@osmix/router 0.0.2

package/dist/src/index.js

@@ -0,0 +1,41 @@
+/**
+ * @osmix/router - Pathfinding on OSM road networks.
+ *
+ * Builds a routeable graph from OSM ways and provides pathfinding algorithms
+ * (Dijkstra, A*, bidirectional) for finding routes between nodes. Supports
+ * both distance and time-based routing.
+ *
+ * Key features:
+ * - **Graph construction**: Build routing graphs from OSM ways with highway filtering.
+ * - **Multiple algorithms**: Dijkstra, A*, and bidirectional search.
+ * - **Time-based routing**: Uses maxspeed tags and default speeds by highway type.
+ * - **One-way support**: Respects oneway=yes/1 tags.
+ * - **Snapping**: Find nearest routable node from arbitrary coordinates.
+ *
+ * @example
+ * ```ts
+ * import { buildGraph, Router, findNearestNodeOnGraph } from "@osmix/router"
+ *
+ * const graph = buildGraph(osm)
+ * const router = new Router(osm, graph)
+ *
+ * const start = findNearestNodeOnGraph(osm, graph, [-73.989, 40.733], 1)
+ * const end = findNearestNodeOnGraph(osm, graph, [-73.988, 40.734], 1)
+ *
+ * if (start && end) {
+ *   const path = router.route(start.nodeIndex, end.nodeIndex)
+ *   if (path) {
+ *     const result = router.buildResult(path)
+ *     console.log(result.coordinates)
+ *   }
+ * }
+ * ```
+ *
+ * @module @osmix/router
+ */
+export * from "./algorithms";
+export * from "./graph";
+export * from "./router";
+export * from "./types";
+export * from "./utils";
+//# sourceMappingURL=index.js.map

package/dist/src/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAkCG;AAEH,cAAc,cAAc,CAAA;AAC5B,cAAc,SAAS,CAAA;AACvB,cAAc,UAAU,CAAA;AACxB,cAAc,SAAS,CAAA;AACvB,cAAc,SAAS,CAAA"}

package/dist/src/router.d.ts

@@ -0,0 +1,55 @@
+/**
+ * High-level router API.
+ *
+ * Wraps the routing graph and algorithms to provide a convenient interface
+ * for finding routes and building result objects with coordinates.
+ *
+ * @module
+ */
+import type { Osm } from "@osmix/core";
+import type { RoutingGraph } from "./graph";
+import type { PathSegment, RouteOptions, RoutePathInfo, RouteResult, RouteStatistics } from "./types";
+/**
+ * Router for finding paths through OSM road networks.
+ *
+ * Uses pathfinding algorithms (Dijkstra, A*, or bidirectional) to find
+ * routes between node indexes. Use `findNearestNodeOnGraph()` to snap
+ * arbitrary coordinates to routable nodes before calling `route()`.
+ *
+ * @example
+ * ```ts
+ * const router = new Router(osm, graph, { algorithm: "astar" })
+ * const path = router.route(startNodeIndex, endNodeIndex)
+ * if (path) {
+ *   const result = router.buildResult(path)
+ *   console.log(result.coordinates)
+ * }
+ * ```
+ */
+export declare class Router {
+    readonly graph: RoutingGraph;
+    readonly osm: Osm;
+    private readonly defaults;
+    constructor(osm: Osm, graph: RoutingGraph, options?: Partial<RouteOptions>);
+    /**
+     * Find a route between two node indexes.
+     * Returns path segments or null if no path exists.
+     */
+    route(fromNodeIndex: number, toNodeIndex: number, options?: Partial<RouteOptions>): PathSegment[] | null;
+    /** Build route result with coordinates from path segments. */
+    buildResult(path: PathSegment[], options?: Partial<RouteOptions>): RouteResult;
+    /**
+     * Calculate route statistics (distance and time) from path segments.
+     * @param path - Path segments from route().
+     * @returns Total distance in meters and time in seconds.
+     */
+    getRouteStatistics(path: PathSegment[]): RouteStatistics;
+    /**
+     * Build route path info (segments and turn points) from path segments.
+     * Consecutive ways with the same name are merged into a single segment.
+     * @param path - Path segments from route().
+     * @returns Segments with per-way breakdown and turn point coordinates.
+     */
+    getRoutePathInfo(path: PathSegment[]): RoutePathInfo;
+}
+//# sourceMappingURL=router.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"router.d.ts","sourceRoot":"","sources":["../../src/router.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAAE,GAAG,EAAE,MAAM,aAAa,CAAA;AAGtC,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,SAAS,CAAA;AAC3C,OAAO,KAAK,EACX,WAAW,EACX,YAAY,EACZ,aAAa,EACb,WAAW,EACX,eAAe,EAEf,MAAM,SAAS,CAAA;AAEhB;;;;;;;;;;;;;;;;GAgBG;AACH,qBAAa,MAAM;IAClB,QAAQ,CAAC,KAAK,EAAE,YAAY,CAAA;IAC5B,QAAQ,CAAC,GAAG,EAAE,GAAG,CAAA;IACjB,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAwB;gBAGhD,GAAG,EAAE,GAAG,EACR,KAAK,EAAE,YAAY,EACnB,OAAO,GAAE,OAAO,CAAC,YAAY,CAAM;IAYpC;;;OAGG;IACH,KAAK,CACJ,aAAa,EAAE,MAAM,EACrB,WAAW,EAAE,MAAM,EACnB,OAAO,GAAE,OAAO,CAAC,YAAY,CAAM,GACjC,WAAW,EAAE,GAAG,IAAI;IAmBvB,8DAA8D;IAC9D,WAAW,CACV,IAAI,EAAE,WAAW,EAAE,EACnB,OAAO,GAAE,OAAO,CAAC,YAAY,CAAM,GACjC,WAAW;IAsDd;;;;OAIG;IACH,kBAAkB,CAAC,IAAI,EAAE,WAAW,EAAE,GAAG,eAAe;IAqBxD;;;;;OAKG;IACH,gBAAgB,CAAC,IAAI,EAAE,WAAW,EAAE,GAAG,aAAa;CAqFpD"}

package/dist/src/router.js

@@ -0,0 +1,189 @@
+/**
+ * High-level router API.
+ *
+ * Wraps the routing graph and algorithms to provide a convenient interface
+ * for finding routes and building result objects with coordinates.
+ *
+ * @module
+ */
+import { routingAlgorithms } from "./algorithms";
+/**
+ * Router for finding paths through OSM road networks.
+ *
+ * Uses pathfinding algorithms (Dijkstra, A*, or bidirectional) to find
+ * routes between node indexes. Use `findNearestNodeOnGraph()` to snap
+ * arbitrary coordinates to routable nodes before calling `route()`.
+ *
+ * @example
+ * ```ts
+ * const router = new Router(osm, graph, { algorithm: "astar" })
+ * const path = router.route(startNodeIndex, endNodeIndex)
+ * if (path) {
+ *   const result = router.buildResult(path)
+ *   console.log(result.coordinates)
+ * }
+ * ```
+ */
+export class Router {
+    graph;
+    osm;
+    defaults;
+    constructor(osm, graph, options = {}) {
+        this.osm = osm;
+        this.graph = graph;
+        this.defaults = {
+            algorithm: options.algorithm ?? "astar",
+            metric: options.metric ?? "distance",
+            includeStats: options.includeStats ?? false,
+            includePathInfo: options.includePathInfo ?? false,
+        };
+    }
+    /**
+     * Find a route between two node indexes.
+     * Returns path segments or null if no path exists.
+     */
+    route(fromNodeIndex, toNodeIndex, options = {}) {
+        // Trivial case: same node
+        if (fromNodeIndex === toNodeIndex)
+            return [{ nodeIndex: fromNodeIndex, cost: 0 }];
+        const algorithm = routingAlgorithms[options.algorithm ?? this.defaults.algorithm];
+        const metric = options.metric ?? this.defaults.metric;
+        return algorithm((nodeIndex) => this.graph.getEdges(nodeIndex), fromNodeIndex, toNodeIndex, (edge) => (metric === "distance" ? edge.distance : edge.time), (nodeIndex) => this.osm.nodes.getNodeLonLat({ index: nodeIndex }), metric);
+    }
+    /** Build route result with coordinates from path segments. */
+    buildResult(path, options = {}) {
+        const coordinates = [];
+        const wayIndexes = [];
+        const nodeIndexes = [];
+        const seenNodes = new Set();
+        let currentWay;
+        for (let i = 0; i < path.length; i++) {
+            const seg = path[i];
+            const coord = this.osm.nodes.getNodeLonLat({ index: seg.nodeIndex });
+            if (coord)
+                coordinates.push(coord);
+            // Track way transitions
+            if (seg.wayIndex !== undefined && seg.wayIndex !== currentWay) {
+                wayIndexes.push(seg.wayIndex);
+                currentWay = seg.wayIndex;
+                // Mark node at way transition
+                if (i > 0 && !seenNodes.has(seg.nodeIndex)) {
+                    seenNodes.add(seg.nodeIndex);
+                    nodeIndexes.push(seg.nodeIndex);
+                }
+            }
+            // Mark start, end, and intersections
+            const isEndpoint = i === 0 || i === path.length - 1;
+            const isIntersection = this.graph.isIntersection(seg.nodeIndex);
+            if ((isEndpoint || isIntersection) && !seenNodes.has(seg.nodeIndex)) {
+                seenNodes.add(seg.nodeIndex);
+                nodeIndexes.push(seg.nodeIndex);
+            }
+        }
+        const result = { coordinates, wayIndexes, nodeIndexes };
+        const includeStats = options.includeStats ?? this.defaults.includeStats;
+        const includePathInfo = options.includePathInfo ?? this.defaults.includePathInfo;
+        if (includeStats) {
+            const stats = this.getRouteStatistics(path);
+            result.distance = stats.distance;
+            result.time = stats.time;
+        }
+        if (includePathInfo) {
+            const pathInfo = this.getRoutePathInfo(path);
+            result.segments = pathInfo.segments;
+            result.turnPoints = pathInfo.turnPoints;
+        }
+        return result;
+    }
+    /**
+     * Calculate route statistics (distance and time) from path segments.
+     * @param path - Path segments from route().
+     * @returns Total distance in meters and time in seconds.
+     */
+    getRouteStatistics(path) {
+        let distance = 0;
+        let time = 0;
+        for (const seg of path) {
+            if (seg.wayIndex !== undefined && seg.previousNodeIndex !== undefined) {
+                const edges = this.graph.getEdges(seg.previousNodeIndex);
+                const edge = edges.find((e) => e.targetNodeIndex === seg.nodeIndex && e.wayIndex === seg.wayIndex);
+                if (edge) {
+                    distance += edge.distance;
+                    time += edge.time;
+                }
+            }
+        }
+        return { distance, time };
+    }
+    /**
+     * Build route path info (segments and turn points) from path segments.
+     * Consecutive ways with the same name are merged into a single segment.
+     * @param path - Path segments from route().
+     * @returns Segments with per-way breakdown and turn point coordinates.
+     */
+    getRoutePathInfo(path) {
+        const edgeSequence = [];
+        for (const seg of path) {
+            if (seg.wayIndex !== undefined && seg.previousNodeIndex !== undefined) {
+                const edges = this.graph.getEdges(seg.previousNodeIndex);
+                const edge = edges.find((e) => e.targetNodeIndex === seg.nodeIndex && e.wayIndex === seg.wayIndex);
+                if (edge) {
+                    edgeSequence.push({
+                        wayIndex: seg.wayIndex,
+                        transitionNodeIndex: seg.previousNodeIndex,
+                        distance: edge.distance,
+                        time: edge.time,
+                    });
+                }
+            }
+        }
+        // Build segments, merging consecutive same-name ways
+        const segments = [];
+        const turnPoints = [];
+        let currentSegment = null;
+        let currentDisplayName = null;
+        const getDisplayName = (tags) => {
+            const name = tags?.["name"] ?? "";
+            const highway = tags?.["highway"] ?? "";
+            return name || highway;
+        };
+        for (const { wayIndex, transitionNodeIndex, distance, time, } of edgeSequence) {
+            const wayId = this.osm.ways.ids.at(wayIndex);
+            const tags = this.osm.ways.tags.getTags(wayIndex);
+            const name = tags?.["name"] ?? "";
+            const highway = tags?.["highway"] ?? "";
+            const displayName = getDisplayName(tags);
+            if (currentSegment && currentDisplayName === displayName) {
+                if (!currentSegment.wayIds.includes(wayId)) {
+                    currentSegment.wayIds.push(wayId);
+                }
+                currentSegment.distance += distance;
+                currentSegment.time += time;
+            }
+            else {
+                if (currentSegment) {
+                    segments.push(currentSegment);
+                    const coord = this.osm.nodes.getNodeLonLat({
+                        index: transitionNodeIndex,
+                    });
+                    if (coord) {
+                        turnPoints.push(coord);
+                    }
+                }
+                currentSegment = {
+                    wayIds: [wayId],
+                    name,
+                    highway,
+                    distance,
+                    time,
+                };
+                currentDisplayName = displayName;
+            }
+        }
+        if (currentSegment) {
+            segments.push(currentSegment);
+        }
+        return { segments, turnPoints };
+    }
+}
+//# sourceMappingURL=router.js.map

package/dist/src/router.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"router.js","sourceRoot":"","sources":["../../src/router.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAIH,OAAO,EAAE,iBAAiB,EAAE,MAAM,cAAc,CAAA;AAWhD;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,OAAO,MAAM;IACT,KAAK,CAAc;IACnB,GAAG,CAAK;IACA,QAAQ,CAAwB;IAEjD,YACC,GAAQ,EACR,KAAmB,EACnB,UAAiC,EAAE;QAEnC,IAAI,CAAC,GAAG,GAAG,GAAG,CAAA;QACd,IAAI,CAAC,KAAK,GAAG,KAAK,CAAA;QAClB,IAAI,CAAC,QAAQ,GAAG;YACf,SAAS,EAAE,OAAO,CAAC,SAAS,IAAI,OAAO;YACvC,MAAM,EAAE,OAAO,CAAC,MAAM,IAAI,UAAU;YACpC,YAAY,EAAE,OAAO,CAAC,YAAY,IAAI,KAAK;YAC3C,eAAe,EAAE,OAAO,CAAC,eAAe,IAAI,KAAK;SACjD,CAAA;IACF,CAAC;IAED;;;OAGG;IACH,KAAK,CACJ,aAAqB,EACrB,WAAmB,EACnB,UAAiC,EAAE;QAEnC,0BAA0B;QAC1B,IAAI,aAAa,KAAK,WAAW;YAChC,OAAO,CAAC,EAAE,SAAS,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAA;QAE/C,MAAM,SAAS,GACd,iBAAiB,CAAC,OAAO,CAAC,SAAS,IAAI,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAA;QAChE,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAA;QAErD,OAAO,SAAS,CACf,CAAC,SAAS,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,EAC7C,aAAa,EACb,WAAW,EACX,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,MAAM,KAAK,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAC7D,CAAC,SAAS,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,aAAa,CAAC,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC,EACjE,MAAM,CACN,CAAA;IACF,CAAC;IAED,8DAA8D;IAC9D,WAAW,CACV,IAAmB,EACnB,UAAiC,EAAE;QAEnC,MAAM,WAAW,GAAa,EAAE,CAAA;QAChC,MAAM,UAAU,GAAa,EAAE,CAAA;QAC/B,MAAM,WAAW,GAAa,EAAE,CAAA;QAChC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAA;QAEnC,IAAI,UAA8B,CAAA;QAElC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,CAAE,CAAA;YACpB,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,aAAa,CAAC,EAAE,KAAK,EAAE,GAAG,CAAC,SAAS,EAAE,CAAC,CAAA;YACpE,IAAI,KAAK;gBAAE,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;YAElC,wBAAwB;YACxB,IAAI,GAAG,CAAC,QAAQ,KAAK,SAAS,IAAI,GAAG,CAAC,QAAQ,KAAK,UAAU,EAAE,CAAC;gBAC/D,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;gBAC7B,UAAU,GAAG,GAAG,CAAC,QAAQ,CAAA;gBACzB,8BAA8B;gBAC9B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;oBAC5C,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC,CAAA;oBAC5B,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAA;gBAChC,CAAC;YACF,CAAC;YAED,qCAAqC;YACrC,MAAM,UAAU,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,MAAM,GAAG,CAAC,CAAA;YACnD,MAAM,cAAc,GAAG,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,GAAG,CAAC,SAAS,CAAC,CAAA;YAC/D,IAAI,CAAC,UAAU,IAAI,cAAc,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;gBACrE,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC,CAAA;gBAC5B,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAA;YAChC,CAAC;QACF,CAAC;QAED,MAAM,MAAM,GAAgB,EAAE,WAAW,EAAE,UAAU,EAAE,WAAW,EAAE,CAAA;QAEpE,MAAM,YAAY,GAAG,OAAO,CAAC,YAAY,IAAI,IAAI,CAAC,QAAQ,CAAC,YAAY,CAAA;QACvE,MAAM,eAAe,GACpB,OAAO,CAAC,eAAe,IAAI,IAAI,CAAC,QAAQ,CAAC,eAAe,CAAA;QAEzD,IAAI,YAAY,EAAE,CAAC;YAClB,MAAM,KAAK,GAAG,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAA;YAC3C,MAAM,CAAC,QAAQ,GAAG,KAAK,CAAC,QAAQ,CAAA;YAChC,MAAM,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAA;QACzB,CAAC;QAED,IAAI,eAAe,EAAE,CAAC;YACrB,MAAM,QAAQ,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAA;YAC5C,MAAM,CAAC,QAAQ,GAAG,QAAQ,CAAC,QAAQ,CAAA;YACnC,MAAM,CAAC,UAAU,GAAG,QAAQ,CAAC,UAAU,CAAA;QACxC,CAAC;QAED,OAAO,MAAM,CAAA;IACd,CAAC;IAED;;;;OAIG;IACH,kBAAkB,CAAC,IAAmB;QACrC,IAAI,QAAQ,GAAG,CAAC,CAAA;QAChB,IAAI,IAAI,GAAG,CAAC,CAAA;QAEZ,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACxB,IAAI,GAAG,CAAC,QAAQ,KAAK,SAAS,IAAI,GAAG,CAAC,iBAAiB,KAAK,SAAS,EAAE,CAAC;gBACvE,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,iBAAiB,CAAC,CAAA;gBACxD,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CACtB,CAAC,CAAC,EAAE,EAAE,CACL,CAAC,CAAC,eAAe,KAAK,GAAG,CAAC,SAAS,IAAI,CAAC,CAAC,QAAQ,KAAK,GAAG,CAAC,QAAQ,CACnE,CAAA;gBACD,IAAI,IAAI,EAAE,CAAC;oBACV,QAAQ,IAAI,IAAI,CAAC,QAAQ,CAAA;oBACzB,IAAI,IAAI,IAAI,CAAC,IAAI,CAAA;gBAClB,CAAC;YACF,CAAC;QACF,CAAC;QAED,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAA;IAC1B,CAAC;IAED;;;;;OAKG;IACH,gBAAgB,CAAC,IAAmB;QAQnC,MAAM,YAAY,GAAoB,EAAE,CAAA;QAExC,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACxB,IAAI,GAAG,CAAC,QAAQ,KAAK,SAAS,IAAI,GAAG,CAAC,iBAAiB,KAAK,SAAS,EAAE,CAAC;gBACvE,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,iBAAiB,CAAC,CAAA;gBACxD,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CACtB,CAAC,CAAC,EAAE,EAAE,CACL,CAAC,CAAC,eAAe,KAAK,GAAG,CAAC,SAAS,IAAI,CAAC,CAAC,QAAQ,KAAK,GAAG,CAAC,QAAQ,CACnE,CAAA;gBACD,IAAI,IAAI,EAAE,CAAC;oBACV,YAAY,CAAC,IAAI,CAAC;wBACjB,QAAQ,EAAE,GAAG,CAAC,QAAQ;wBACtB,mBAAmB,EAAE,GAAG,CAAC,iBAAiB;wBAC1C,QAAQ,EAAE,IAAI,CAAC,QAAQ;wBACvB,IAAI,EAAE,IAAI,CAAC,IAAI;qBACf,CAAC,CAAA;gBACH,CAAC;YACF,CAAC;QACF,CAAC;QAED,qDAAqD;QACrD,MAAM,QAAQ,GAAiB,EAAE,CAAA;QACjC,MAAM,UAAU,GAAa,EAAE,CAAA;QAC/B,IAAI,cAAc,GAAsB,IAAI,CAAA;QAC5C,IAAI,kBAAkB,GAAkB,IAAI,CAAA;QAE5C,MAAM,cAAc,GAAG,CAAC,IAAsC,EAAE,EAAE;YACjE,MAAM,IAAI,GAAI,IAAI,EAAE,CAAC,MAAM,CAAY,IAAI,EAAE,CAAA;YAC7C,MAAM,OAAO,GAAI,IAAI,EAAE,CAAC,SAAS,CAAY,IAAI,EAAE,CAAA;YACnD,OAAO,IAAI,IAAI,OAAO,CAAA;QACvB,CAAC,CAAA;QAED,KAAK,MAAM,EACV,QAAQ,EACR,mBAAmB,EACnB,QAAQ,EACR,IAAI,GACJ,IAAI,YAAY,EAAE,CAAC;YACnB,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAA;YAC5C,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAA;YACjD,MAAM,IAAI,GAAI,IAAI,EAAE,CAAC,MAAM,CAAY,IAAI,EAAE,CAAA;YAC7C,MAAM,OAAO,GAAI,IAAI,EAAE,CAAC,SAAS,CAAY,IAAI,EAAE,CAAA;YACnD,MAAM,WAAW,GAAG,cAAc,CAAC,IAAI,CAAC,CAAA;YAExC,IAAI,cAAc,IAAI,kBAAkB,KAAK,WAAW,EAAE,CAAC;gBAC1D,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;oBAC5C,cAAc,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;gBAClC,CAAC;gBACD,cAAc,CAAC,QAAQ,IAAI,QAAQ,CAAA;gBACnC,cAAc,CAAC,IAAI,IAAI,IAAI,CAAA;YAC5B,CAAC;iBAAM,CAAC;gBACP,IAAI,cAAc,EAAE,CAAC;oBACpB,QAAQ,CAAC,IAAI,CAAC,cAAc,CAAC,CAAA;oBAC7B,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,aAAa,CAAC;wBAC1C,KAAK,EAAE,mBAAmB;qBAC1B,CAAC,CAAA;oBACF,IAAI,KAAK,EAAE,CAAC;wBACX,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;oBACvB,CAAC;gBACF,CAAC;gBACD,cAAc,GAAG;oBAChB,MAAM,EAAE,CAAC,KAAK,CAAC;oBACf,IAAI;oBACJ,OAAO;oBACP,QAAQ;oBACR,IAAI;iBACJ,CAAA;gBACD,kBAAkB,GAAG,WAAW,CAAA;YACjC,CAAC;QACF,CAAC;QAED,IAAI,cAAc,EAAE,CAAC;YACpB,QAAQ,CAAC,IAAI,CAAC,cAAc,CAAC,CAAA;QAC9B,CAAC;QAED,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,CAAA;IAChC,CAAC;CACD"}

package/dist/src/types.d.ts

@@ -0,0 +1,118 @@
+/**
+ * Type definitions for the routing module.
+ * @module
+ */
+import type { BufferType } from "@osmix/core";
+import type { LonLat, OsmTags } from "@osmix/shared/types";
+/** Per-way segment with distance and time (consecutive same-name ways merged). */
+export interface WaySegment {
+    /** OSM way IDs included in this segment (multiple if merged). */
+    wayIds: number[];
+    /** Way name from tags (may be empty). */
+    name: string;
+    /** Highway type from tags. */
+    highway: string;
+    /** Distance travelled on this segment in meters. */
+    distance: number;
+    /** Time travelled on this segment in seconds. */
+    time: number;
+}
+/** Route statistics (distance and time). */
+export interface RouteStatistics {
+    /** Total route distance in meters. */
+    distance: number;
+    /** Total route time in seconds. */
+    time: number;
+}
+/** Route path info (segments and turn points). */
+export interface RoutePathInfo {
+    /** Per-way breakdown (consecutive same-name ways merged). */
+    segments: WaySegment[];
+    /** Coordinates where way name changes (turn points). */
+    turnPoints: LonLat[];
+}
+/** Route result containing the path geometry and metadata. */
+export interface RouteResult {
+    /** Coordinates along the route. */
+    coordinates: LonLat[];
+    /** Way indexes traversed, in order. */
+    wayIndexes: number[];
+    /** Node indexes at turns and intersections. */
+    nodeIndexes: number[];
+    /** Total route distance in meters (when includeStats is true). */
+    distance?: number;
+    /** Total route time in seconds (when includeStats is true). */
+    time?: number;
+    /** Per-way breakdown (when includePathInfo is true). */
+    segments?: WaySegment[];
+    /** Coordinates where way name changes (when includePathInfo is true). */
+    turnPoints?: LonLat[];
+}
+/** Filter function to determine which highways are routable. Default: common vehicle highways. */
+export type HighwayFilter = (tags?: OsmTags) => boolean;
+/** Available routing algorithms. */
+export type RoutingAlgorithm = "dijkstra" | "astar" | "bidirectional";
+/** Routing metric to optimize. */
+export type RoutingMetric = "distance" | "time";
+/** Speed limits by highway type (km/h). */
+export type DefaultSpeeds = Record<string, number>;
+/** Router configuration options. */
+export interface RouteOptions {
+    /** Routing algorithm. Default: "astar". */
+    algorithm: RoutingAlgorithm;
+    /** Optimization metric. Default: "distance". */
+    metric: RoutingMetric;
+    /** Include distance and time in result. Default: false. */
+    includeStats?: boolean;
+    /** Include segments and turnPoints in result. Default: false. */
+    includePathInfo?: boolean;
+}
+/** Edge in the routing graph. */
+export interface GraphEdge {
+    /** Target node index. */
+    targetNodeIndex: number;
+    /** Way index this edge belongs to. */
+    wayIndex: number;
+    /** Distance in meters. */
+    distance: number;
+    /** Travel time in seconds. */
+    time: number;
+}
+/**
+ * Serializable representation of a RoutingGraph for worker transfer.
+ * Uses CSR (Compressed Sparse Row) format for efficient storage and zero-copy transfer.
+ */
+export interface RoutingGraphTransferables {
+    /** Total number of nodes in the graph. */
+    nodeCount: number;
+    /** Total number of edges in the graph. */
+    edgeCount: number;
+    /** CSR offsets: edges for node i are at indices [edgeOffsets[i], edgeOffsets[i+1]) */
+    edgeOffsets: BufferType;
+    /** Target node index for each edge. */
+    edgeTargets: BufferType;
+    /** Way index for each edge. */
+    edgeWayIndexes: BufferType;
+    /** Distance in meters for each edge. */
+    edgeDistances: BufferType;
+    /** Travel time in seconds for each edge. */
+    edgeTimes: BufferType;
+    /** Bitset: 1 bit per node indicating if routable. */
+    routableBits: BufferType;
+    /** Bitset: 1 bit per node indicating if intersection. */
+    intersectionBits: BufferType;
+}
+/** Path segment returned by routing algorithms. */
+export interface PathSegment {
+    /** Node index. */
+    nodeIndex: number;
+    /** Way index used to reach this node. */
+    wayIndex?: number;
+    /** Previous node in path. */
+    previousNodeIndex?: number;
+    /** Cost to reach this node. */
+    cost: number;
+}
+/** Function signature for routing algorithms. */
+export type RoutingAlgorithmFn = (graph: (nodeIndex: number) => GraphEdge[], startNodeIndex: number, endNodeIndex: number, getEdgeWeight: (edge: GraphEdge) => number, getNodeCoord?: (nodeIndex: number) => LonLat | undefined, metric?: RoutingMetric) => PathSegment[] | null;
+//# sourceMappingURL=types.d.ts.map

package/dist/src/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/types.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,aAAa,CAAA;AAC7C,OAAO,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAA;AAE1D,kFAAkF;AAClF,MAAM,WAAW,UAAU;IAC1B,iEAAiE;IACjE,MAAM,EAAE,MAAM,EAAE,CAAA;IAChB,yCAAyC;IACzC,IAAI,EAAE,MAAM,CAAA;IACZ,8BAA8B;IAC9B,OAAO,EAAE,MAAM,CAAA;IACf,oDAAoD;IACpD,QAAQ,EAAE,MAAM,CAAA;IAChB,iDAAiD;IACjD,IAAI,EAAE,MAAM,CAAA;CACZ;AAED,4CAA4C;AAC5C,MAAM,WAAW,eAAe;IAC/B,sCAAsC;IACtC,QAAQ,EAAE,MAAM,CAAA;IAChB,mCAAmC;IACnC,IAAI,EAAE,MAAM,CAAA;CACZ;AAED,kDAAkD;AAClD,MAAM,WAAW,aAAa;IAC7B,6DAA6D;IAC7D,QAAQ,EAAE,UAAU,EAAE,CAAA;IACtB,wDAAwD;IACxD,UAAU,EAAE,MAAM,EAAE,CAAA;CACpB;AAED,8DAA8D;AAC9D,MAAM,WAAW,WAAW;IAC3B,mCAAmC;IACnC,WAAW,EAAE,MAAM,EAAE,CAAA;IACrB,uCAAuC;IACvC,UAAU,EAAE,MAAM,EAAE,CAAA;IACpB,+CAA+C;IAC/C,WAAW,EAAE,MAAM,EAAE,CAAA;IACrB,kEAAkE;IAClE,QAAQ,CAAC,EAAE,MAAM,CAAA;IACjB,+DAA+D;IAC/D,IAAI,CAAC,EAAE,MAAM,CAAA;IACb,wDAAwD;IACxD,QAAQ,CAAC,EAAE,UAAU,EAAE,CAAA;IACvB,yEAAyE;IACzE,UAAU,CAAC,EAAE,MAAM,EAAE,CAAA;CACrB;AAED,kGAAkG;AAClG,MAAM,MAAM,aAAa,GAAG,CAAC,IAAI,CAAC,EAAE,OAAO,KAAK,OAAO,CAAA;AAEvD,oCAAoC;AACpC,MAAM,MAAM,gBAAgB,GAAG,UAAU,GAAG,OAAO,GAAG,eAAe,CAAA;AAErE,kCAAkC;AAClC,MAAM,MAAM,aAAa,GAAG,UAAU,GAAG,MAAM,CAAA;AAE/C,2CAA2C;AAC3C,MAAM,MAAM,aAAa,GAAG,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;AAElD,oCAAoC;AACpC,MAAM,WAAW,YAAY;IAC5B,2CAA2C;IAC3C,SAAS,EAAE,gBAAgB,CAAA;IAC3B,gDAAgD;IAChD,MAAM,EAAE,aAAa,CAAA;IACrB,2DAA2D;IAC3D,YAAY,CAAC,EAAE,OAAO,CAAA;IACtB,iEAAiE;IACjE,eAAe,CAAC,EAAE,OAAO,CAAA;CACzB;AAED,iCAAiC;AACjC,MAAM,WAAW,SAAS;IACzB,yBAAyB;IACzB,eAAe,EAAE,MAAM,CAAA;IACvB,sCAAsC;IACtC,QAAQ,EAAE,MAAM,CAAA;IAChB,0BAA0B;IAC1B,QAAQ,EAAE,MAAM,CAAA;IAChB,8BAA8B;IAC9B,IAAI,EAAE,MAAM,CAAA;CACZ;AAED;;;GAGG;AACH,MAAM,WAAW,yBAAyB;IACzC,0CAA0C;IAC1C,SAAS,EAAE,MAAM,CAAA;IACjB,0CAA0C;IAC1C,SAAS,EAAE,MAAM,CAAA;IACjB,sFAAsF;IACtF,WAAW,EAAE,UAAU,CAAA;IACvB,uCAAuC;IACvC,WAAW,EAAE,UAAU,CAAA;IACvB,+BAA+B;IAC/B,cAAc,EAAE,UAAU,CAAA;IAC1B,wCAAwC;IACxC,aAAa,EAAE,UAAU,CAAA;IACzB,4CAA4C;IAC5C,SAAS,EAAE,UAAU,CAAA;IACrB,qDAAqD;IACrD,YAAY,EAAE,UAAU,CAAA;IACxB,yDAAyD;IACzD,gBAAgB,EAAE,UAAU,CAAA;CAC5B;AAED,mDAAmD;AACnD,MAAM,WAAW,WAAW;IAC3B,kBAAkB;IAClB,SAAS,EAAE,MAAM,CAAA;IACjB,yCAAyC;IACzC,QAAQ,CAAC,EAAE,MAAM,CAAA;IACjB,6BAA6B;IAC7B,iBAAiB,CAAC,EAAE,MAAM,CAAA;IAC1B,+BAA+B;IAC/B,IAAI,EAAE,MAAM,CAAA;CACZ;AAED,iDAAiD;AACjD,MAAM,MAAM,kBAAkB,GAAG,CAChC,KAAK,EAAE,CAAC,SAAS,EAAE,MAAM,KAAK,SAAS,EAAE,EACzC,cAAc,EAAE,MAAM,EACtB,YAAY,EAAE,MAAM,EACpB,aAAa,EAAE,CAAC,IAAI,EAAE,SAAS,KAAK,MAAM,EAC1C,YAAY,CAAC,EAAE,CAAC,SAAS,EAAE,MAAM,KAAK,MAAM,GAAG,SAAS,EACxD,MAAM,CAAC,EAAE,aAAa,KAClB,WAAW,EAAE,GAAG,IAAI,CAAA"}

package/dist/src/types.js

@@ -0,0 +1,5 @@
+/**
+ * Type definitions for the routing module.
+ * @module
+ */
+//# sourceMappingURL=types.js.map

package/dist/src/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../src/types.ts"],"names":[],"mappings":"AAAA;;;GAGG"}

package/dist/src/utils.d.ts

@@ -0,0 +1,20 @@
+/**
+ * Routing utility functions.
+ *
+ * Provides highway filtering, speed limit parsing, and travel time calculation.
+ *
+ * @module
+ */
+import type { OsmTags } from "@osmix/shared/types";
+import type { DefaultSpeeds } from "./types";
+/** Default speeds (km/h) by highway type. */
+export declare const DEFAULT_SPEEDS: DefaultSpeeds;
+/** Parse maxspeed tag to km/h. Handles "50", "50 km/h", "30 mph". */
+export declare function parseMaxSpeed(value: string | number | undefined): number | null;
+/** Get speed limit (km/h) for a way. */
+export declare function getSpeedLimit(tags: OsmTags | undefined, defaultSpeeds?: DefaultSpeeds): number;
+/** Default filter: common vehicle highways. */
+export declare function defaultHighwayFilter(tags?: OsmTags): boolean;
+/** Default pedestrian filter */
+export declare function defaultPedestrianFilter(tags?: OsmTags): boolean;
+//# sourceMappingURL=utils.d.ts.map

package/dist/src/utils.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"utils.d.ts","sourceRoot":"","sources":["../../src/utils.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAA;AAClD,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,SAAS,CAAA;AAE5C,6CAA6C;AAC7C,eAAO,MAAM,cAAc,EAAE,aAoB5B,CAAA;AA6BD,qEAAqE;AACrE,wBAAgB,aAAa,CAC5B,KAAK,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS,GAChC,MAAM,GAAG,IAAI,CAqBf;AAED,wCAAwC;AACxC,wBAAgB,aAAa,CAC5B,IAAI,EAAE,OAAO,GAAG,SAAS,EACzB,aAAa,GAAE,aAA8B,GAC3C,MAAM,CAUR;AAED,+CAA+C;AAC/C,wBAAgB,oBAAoB,CAAC,IAAI,CAAC,EAAE,OAAO,GAAG,OAAO,CAG5D;AAED,gCAAgC;AAChC,wBAAgB,uBAAuB,CAAC,IAAI,CAAC,EAAE,OAAO,GAAG,OAAO,CAG/D"}

package/dist/src/utils.js

@@ -0,0 +1,101 @@
+/**
+ * Routing utility functions.
+ *
+ * Provides highway filtering, speed limit parsing, and travel time calculation.
+ *
+ * @module
+ */
+/** Default speeds (km/h) by highway type. */
+export const DEFAULT_SPEEDS = {
+    motorway: 120,
+    motorway_link: 60,
+    trunk: 100,
+    trunk_link: 50,
+    primary: 80,
+    primary_link: 50,
+    secondary: 70,
+    secondary_link: 50,
+    tertiary: 60,
+    tertiary_link: 50,
+    unclassified: 50,
+    residential: 30,
+    living_street: 20,
+    service: 20,
+    footway: 5,
+    path: 5,
+    cycleway: 20,
+    bridleway: 10,
+    steps: 2,
+};
+/** Highways included in default vehicle routing. */
+const VEHICLE_HIGHWAYS = new Set([
+    "motorway",
+    "motorway_link",
+    "trunk",
+    "trunk_link",
+    "primary",
+    "primary_link",
+    "secondary",
+    "secondary_link",
+    "tertiary",
+    "tertiary_link",
+    "unclassified",
+    "residential",
+    "living_street",
+    "service",
+]);
+/** Footways included in default pedestrian routing. */
+const FOOT_HIGHWAYS = new Set([
+    "footway",
+    "path",
+    "cycleway",
+    "bridleway",
+    "steps",
+]);
+/** Parse maxspeed tag to km/h. Handles "50", "50 km/h", "30 mph". */
+export function parseMaxSpeed(value) {
+    if (!value)
+        return null;
+    const str = String(value).trim().toLowerCase();
+    // Numeric: assume km/h
+    const numeric = str.match(/^(\d+)$/);
+    if (numeric)
+        return Number.parseInt(numeric[1], 10);
+    // Explicit km/h
+    const kmh = str.match(/^(\d+)\s*(km\/h|kmh|kph)$/);
+    if (kmh)
+        return Number.parseInt(kmh[1], 10);
+    // MPH -> km/h
+    const mph = str.match(/^(\d+)\s*mph$/);
+    if (mph)
+        return Math.round(Number.parseInt(mph[1], 10) * 1.60934);
+    // Special values
+    if (str === "walk" || str === "none")
+        return 5;
+    return null;
+}
+/** Get speed limit (km/h) for a way. */
+export function getSpeedLimit(tags, defaultSpeeds = DEFAULT_SPEEDS) {
+    if (tags?.["maxspeed"]) {
+        const parsed = parseMaxSpeed(tags["maxspeed"]);
+        if (parsed !== null)
+            return parsed;
+    }
+    const highway = tags?.["highway"] ? String(tags["highway"]) : undefined;
+    if (highway && defaultSpeeds[highway])
+        return defaultSpeeds[highway];
+    return 50;
+}
+/** Default filter: common vehicle highways. */
+export function defaultHighwayFilter(tags) {
+    if (!tags?.["highway"])
+        return false;
+    return VEHICLE_HIGHWAYS.has(String(tags["highway"]));
+}
+/** Default pedestrian filter */
+export function defaultPedestrianFilter(tags) {
+    if (!tags?.["highway"])
+        return false;
+    return FOOT_HIGHWAYS.has(String(tags["highway"]));
+}
+//# sourceMappingURL=utils.js.map

package/dist/src/utils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"utils.js","sourceRoot":"","sources":["../../src/utils.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAKH,6CAA6C;AAC7C,MAAM,CAAC,MAAM,cAAc,GAAkB;IAC5C,QAAQ,EAAE,GAAG;IACb,aAAa,EAAE,EAAE;IACjB,KAAK,EAAE,GAAG;IACV,UAAU,EAAE,EAAE;IACd,OAAO,EAAE,EAAE;IACX,YAAY,EAAE,EAAE;IAChB,SAAS,EAAE,EAAE;IACb,cAAc,EAAE,EAAE;IAClB,QAAQ,EAAE,EAAE;IACZ,aAAa,EAAE,EAAE;IACjB,YAAY,EAAE,EAAE;IAChB,WAAW,EAAE,EAAE;IACf,aAAa,EAAE,EAAE;IACjB,OAAO,EAAE,EAAE;IACX,OAAO,EAAE,CAAC;IACV,IAAI,EAAE,CAAC;IACP,QAAQ,EAAE,EAAE;IACZ,SAAS,EAAE,EAAE;IACb,KAAK,EAAE,CAAC;CACR,CAAA;AAED,oDAAoD;AACpD,MAAM,gBAAgB,GAAG,IAAI,GAAG,CAAC;IAChC,UAAU;IACV,eAAe;IACf,OAAO;IACP,YAAY;IACZ,SAAS;IACT,cAAc;IACd,WAAW;IACX,gBAAgB;IAChB,UAAU;IACV,eAAe;IACf,cAAc;IACd,aAAa;IACb,eAAe;IACf,SAAS;CACT,CAAC,CAAA;AAEF,uDAAuD;AACvD,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC;IAC7B,SAAS;IACT,MAAM;IACN,UAAU;IACV,WAAW;IACX,OAAO;CACP,CAAC,CAAA;AAEF,qEAAqE;AACrE,MAAM,UAAU,aAAa,CAC5B,KAAkC;IAElC,IAAI,CAAC,KAAK;QAAE,OAAO,IAAI,CAAA;IAEvB,MAAM,GAAG,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAA;IAE9C,uBAAuB;IACvB,MAAM,OAAO,GAAG,GAAG,CAAC,KAAK,CAAC,SAAS,CAAC,CAAA;IACpC,IAAI,OAAO;QAAE,OAAO,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAE,EAAE,EAAE,CAAC,CAAA;IAEpD,gBAAgB;IAChB,MAAM,GAAG,GAAG,GAAG,CAAC,KAAK,CAAC,2BAA2B,CAAC,CAAA;IAClD,IAAI,GAAG;QAAE,OAAO,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAE,EAAE,EAAE,CAAC,CAAA;IAE5C,cAAc;IACd,MAAM,GAAG,GAAG,GAAG,CAAC,KAAK,CAAC,eAAe,CAAC,CAAA;IACtC,IAAI,GAAG;QAAE,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAE,EAAE,EAAE,CAAC,GAAG,OAAO,CAAC,CAAA;IAElE,iBAAiB;IACjB,IAAI,GAAG,KAAK,MAAM,IAAI,GAAG,KAAK,MAAM;QAAE,OAAO,CAAC,CAAA;IAE9C,OAAO,IAAI,CAAA;AACZ,CAAC;AAED,wCAAwC;AACxC,MAAM,UAAU,aAAa,CAC5B,IAAyB,EACzB,gBAA+B,cAAc;IAE7C,IAAI,IAAI,EAAE,CAAC,UAAU,CAAC,EAAE,CAAC;QACxB,MAAM,MAAM,GAAG,aAAa,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAA;QAC9C,IAAI,MAAM,KAAK,IAAI;YAAE,OAAO,MAAM,CAAA;IACnC,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAA;IACvE,IAAI,OAAO,IAAI,aAAa,CAAC,OAAO,CAAC;QAAE,OAAO,aAAa,CAAC,OAAO,CAAE,CAAA;IAErE,OAAO,EAAE,CAAA;AACV,CAAC;AAED,+CAA+C;AAC/C,MAAM,UAAU,oBAAoB,CAAC,IAAc;IAClD,IAAI,CAAC,IAAI,EAAE,CAAC,SAAS,CAAC;QAAE,OAAO,KAAK,CAAA;IACpC,OAAO,gBAAgB,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAA;AACrD,CAAC;AAED,gCAAgC;AAChC,MAAM,UAAU,uBAAuB,CAAC,IAAc;IACrD,IAAI,CAAC,IAAI,EAAE,CAAC,SAAS,CAAC;QAAE,OAAO,KAAK,CAAA;IACpC,OAAO,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAA;AAClD,CAAC"}

package/dist/test/algorithms.test.d.ts

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

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

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