terra-route 0.0.8 → 0.0.10

package/README.md

@@ -1,4 +1,10 @@
-# Terra Route
+<picture>
+  <source media="(prefers-color-scheme: dark)" srcset="./assets/logo-dark-mode.png">
+  <source media="(prefers-color-scheme: light)" srcset="./assets/logo.png">
+  <img alt="Terra Draw logo" src="./assets/logo.png" width="400px">
+</picture>
+
+<p></p>
 
 Terra Route aims to be a fast library for routing on GeoJSON LineStrings networks, where LineStrings share identical coordinates. Terra Routes main aim is currently performance - it uses A* to help achieve this.
 
@@ -20,67 +26,42 @@ Here is a short example of how to use the TerraRoute class:
 import { FeatureCollection, LineString, Point, Feature } from "geojson";
 import { TerraRoute } from "terra-route"; 
 
-// Sample GeoJSON network (a simple "L" shape)
-const network: FeatureCollection<LineString> = {
-  type: "FeatureCollection",
-  features: [
-    {
-      type: "Feature",
-      geometry: {
-        type: "LineString",
-        coordinates: [
-          [0, 0],   // A
-          [0, 1],   // B
-          [0, 2],   // C
-        ],
-      },
-      properties: {},
-    },
-    {
-      type: "Feature",
-      geometry: {
-        type: "LineString",
-        coordinates: [
-          [0, 1],   // B
-          [1, 1],   // D
-        ],
-      },
-      properties: {},
-    },
-  ],
-};
-
-// Define start and end points (A and D)
-const startPoint: Feature<Point> = {
-  type: "Feature",
-  geometry: {
-    type: "Point",
-    coordinates: [0, 0], // Point A
-  },
-  properties: {},
-};
-
-const endPoint: Feature<Point> = {
-  type: "Feature",
-  geometry: {
-    type: "Point",
-    coordinates: [1, 1], // Point D
-  },
-  properties: {},
-};
+// We omit the literal values here in the README for brevity
+import { network, startPoint, endPoint } from './network'
 
 // Initialize TerraRoute instance
 const router = new TerraRoute();
 
-// We must build the route graph first before calling getRoute
+// network here is a FeatureCollection<LineString> where the all
+// identical coordinates are considered connected. 
+// We must build the route graph first before calling getRoute.
 router.buildRouteGraph(network);
 
-// Get shortest route
+// Get shortest route where startPoint and endpoint are Feature<Point> of 
+// a coordinate node which is present on the network (i.e. the coordinate 
+// exists in one of the linestrings)
 const route = router.getRoute(startPoint, endPoint);
 
 console.log("Shortest route:", JSON.stringify(route, null, 2));
 ```
 
+## Additional Functionality
+
+Terra Route also exposes functionality for understanding GeoJSON route networks better called `LineStringGraph`. This can be useful for debugging as this class has a series of methods for determining things like unique nodes, edges, connected components as well as all their counts. With this class you can understand your graph better programmatically, for example determining it's size and if it is correctly connected.
+
+```typescript
+const graph = new LineStringGraph(network);
+
+// Return all nodes in the graph as FeatureCollection<Point>, where each unique node is a Feature<Point>
+const graphPoints = graph.getNodes();
+
+// Return all the unique edges as FeatureCollection<LineString>, where each unique edge is a Feature<LineString>
+const graphEdges = graph.getEdges(); 
+
+// The longest possible shortest path in the graph between two nodes (i.e. graph diameter)
+const longestShortestPath = graph.getMaxLengthShortestPath()
+```
+
 ## Benchmarks
 
 The benchmarks make use of a series out route example route networks from OSM in a moderate sized section of East London. It runs against the GeoJSON Path Finder library and also the ngraph.graph library. You can run the benchmarks yourself using:
@@ -92,19 +73,19 @@ npm run benchmark
 Here is an example output of a benchmark run for routing:
 
 <pre>
-Terra Route with CheapRuler     | ███████ 220ms
-Terra Route                     | ███████████ 360ms
-GeoJSON Path Finder             | ███████████████████ 592ms
-ngraph.graph                    | ██████████████████████████████████████████████████ 1587ms
+Terra Route         | ███████████ 270ms
+GeoJSON Path Finder | █████████████████████████ 591ms
+ngraph.graph        | ██████████████████████████████████████████████████ 1177ms
 </pre>
 
-Using default Haversine distance, Terra Route is approximately 1.6x faster than GeoJSON Path Finder with Haversine distance for A -> B path finding. If you pass in the CheapRuler distance metric (you can use the exposed `createCheapRuler` function), it is about x2.75 faster. 
+Using default Haversine distance, Terra Route is approximately 2x faster than GeoJSON Path Finder with Haversine distance for A -> B path finding. If you pass in the CheapRuler distance metric (you can use the exposed `createCheapRuler` function), it is approximately x5 faster than GeoJSON Path Finder with Haversine distance. 
 
-For initialisation of the network, Terra Route is about 10x faster with Haversine than GeoJSON Path Finder. Terra Draw splits out instantiating the Class of the library from the actual graph building, which is done via `buildRouteGraph`. This allows you to defer graph creation to an appropriate time.
+For initialisation of the network, Terra Route is approximately 10x faster with Haversine than GeoJSON Path Finder. Terra Draw splits out instantiating the Class of the library from the actual graph building, which is done via `buildRouteGraph`. This allows you to defer graph creation to an appropriate time.
 
 ## Limitations
 
-Terra Route does not currently support weighting functions.
+- Terra Route does not currently support weighting functions.
+- Coordinates must be identical to be considered connected
 
 ## Acknowledgements
 

package/dist/graph/graph.d.ts

@@ -0,0 +1,114 @@
+import { Feature, FeatureCollection, LineString, Point } from "geojson";
+import { BoundingBox } from "./methods/bounding-box";
+/**
+ * Represents a graph constructed from a GeoJSON FeatureCollection of LineString features.
+ * This class provides methods to analyze the graph, including connected components, node and edge counts,
+ * and shortest paths. Coordinates in the LineStrings are considered connected if they share identical coordinates.
+ */
+export declare class LineStringGraph {
+    constructor(network: FeatureCollection<LineString>);
+    private network;
+    /**
+     * Sets the network for the graph.
+     * This method replaces the current network with a new one.
+     * @param network A GeoJSON FeatureCollection of LineString features representing the network.
+     */
+    setNetwork(network: FeatureCollection<LineString>): void;
+    /**
+     * Gets the current network of the graph.
+     * @returns A GeoJSON FeatureCollection of LineString features representing the network.
+     */
+    getNetwork(): FeatureCollection<LineString>;
+    /**
+     * Gets a filtered network containing only LineStrings that are completely within the specified bounding box.
+     * @param boundingBox A bounding box array in the format [minLng, minLat, maxLng, maxLat]
+     * @returns A GeoJSON FeatureCollection of LineString features representing the network filtered by the bounding box.
+     */
+    getNetworkInBoundingBox(boundingBox: BoundingBox): FeatureCollection<LineString>;
+    /**
+     * Gets the network without duplicate or subsection lines.
+     * This method processes the network to remove any duplicate lines or lines that are subsections of other lines.
+     * @returns A FeatureCollection<LineString> representing the network without duplicate or subsection lines.
+     */
+    getNetworkWithoutDuplicatesOrSubsections(): FeatureCollection<LineString, import("geojson").GeoJsonProperties>;
+    /**
+     * Gets the connected components of the graph.
+     * @returns An array of FeatureCollection<LineString> representing the connected components.
+     */
+    getConnectedComponents(): FeatureCollection<LineString>[];
+    /**
+     * Gets the count of connected components in the graph.
+     * @returns The number of connected components in the graph.
+     */
+    getConnectedComponentCount(): number;
+    /**
+     * Gets the count of unique nodes and edges in the graph.
+     * @returns An object containing the counts of nodes and edges.
+     */
+    getNodeAndEdgeCount(): {
+        nodeCount: number;
+        edgeCount: number;
+    };
+    /**
+     * Gets the unique nodes of the graph as a FeatureCollection of Point features.
+     * @returns A FeatureCollection<Point> containing the nodes of the graph.
+     */
+    getNodes(): FeatureCollection<Point>;
+    /**
+     * Gets the count of unique nodes in the graph.
+     * @returns The number of unique nodes in the graph.
+     */
+    getNodeCount(): number;
+    /**
+     * Gets the unique edges of the graph as a FeatureCollection of LineString features. Each edge is represented as a LineString.
+     * This method ensures that each edge is unique, meaning that edges are not duplicated in the collection. Each linestring only
+     * two coordinates, representing the start and end points of the edge.
+     * @returns A FeatureCollection<LineString> containing the unique edges of the graph.
+     */
+    getEdges(): FeatureCollection<LineString>;
+    /**
+     * Gets the length of the longest edge in the graph based on the length of the LineString.
+     * If no edges exist, it returns -1.
+     * @returns The length of the longest edge in meters, or 0 if no edges exist.
+     */
+    getLongestEdgeLength(): number;
+    /**
+     * Gets the length of the shortest edge in the graph based on the length of the LineString.
+     * If no edges exist, it returns -1.
+     * @returns The length of the shortest edge in meters, or 0 if no edges exist.
+     */
+    getShortestEdgeLength(): number;
+    /**
+     * Gets the longest edge in the graph based on the length of the LineString.
+     * @returns The longest edge as a Feature<LineString> or null if no edges exist.
+     */
+    getLongestEdge(): Feature<LineString> | null;
+    /**
+     * Gets the shortest edge in the graph based on the length of the LineString.
+     * @returns The shortest edge as a Feature<LineString> or null if no edges exist.
+     */
+    getShortestEdge(): Feature<LineString> | null;
+    /**
+     * Gets the count of unique edges in the graph.
+     * @returns The number of unique edges in the graph.
+     */
+    getEdgeCount(): number;
+    /**
+     * Gets the leaf edges of the graph. A leaf edge is defined as an edge whose start or end node has a degree of 1.
+     * Here an edge is defined as a LineString with two coordinates, representing the start and end points.
+     * @returns A FeatureCollection<LineString> containing only the leaf edges of the graph.
+     */
+    getLeafEdges(): FeatureCollection<LineString>;
+    /**
+     * Returns the pruned network, which is the network without the leaf edges.
+     * i.e. This method removes all leaf edges from the network, leaving only the non-leaf edges
+     * @return A FeatureCollection<LineString> representing the pruned network without leaf edges.
+     */
+    getPrunedEdges(depth?: number): FeatureCollection<LineString>;
+    /**
+     * Returns the network where all nodes that are with n meters of each other are unified.
+     * The function will avoid unifying coordinates in the same linestring.
+     * @param toleranceMeters the tolerance for unifying nodes in meters.
+     */
+    getUnifiedNetwork(toleranceMeters: number): FeatureCollection<LineString, import("geojson").GeoJsonProperties>;
+}

package/dist/graph/methods/bounding-box.d.ts

@@ -0,0 +1,13 @@
+import { FeatureCollection, LineString } from 'geojson';
+/**
+ * Type representing a bounding box as [minLng, minLat, maxLng, maxLat]
+ */
+export type BoundingBox = [number, number, number, number];
+/**
+ * Filters a FeatureCollection of LineString features to only include LineStrings
+ * that are completely within the specified bounding box.
+ * @param featureCollection - A GeoJSON FeatureCollection containing LineString features
+ * @param boundingBox - A bounding box array in the format [minLng, minLat, maxLng, maxLat]
+ * @returns A new FeatureCollection<LineString> containing only the LineStrings completely within the bounding box
+ */
+export declare function getNetworkInBoundingBox(featureCollection: FeatureCollection<LineString>, boundingBox: BoundingBox): FeatureCollection<LineString>;

package/dist/graph/methods/connected.d.ts

@@ -0,0 +1,9 @@
+import { FeatureCollection, LineString } from 'geojson';
+/**
+ * Counts the number of connected components in a graph represented by LineString features in a GeoJSON FeatureCollection.
+ * Each LineString is treated as an edge in the graph, and connected components are determined by shared coordinates.
+ * @param featureCollection - A GeoJSON FeatureCollection containing LineString features
+ * @returns The number of connected components in the graph represented by the LineStrings
+ */
+export declare function graphGetConnectedComponentCount(featureCollection: FeatureCollection<LineString>): number;
+export declare function graphGetConnectedComponents(featureCollection: FeatureCollection<LineString>): FeatureCollection<LineString>[];

package/dist/graph/methods/duplicates.d.ts

@@ -0,0 +1,7 @@
+import { FeatureCollection, LineString } from 'geojson';
+/**
+ * Remove any LineString that is either
+ *  - an exact duplicate of an earlier one, or
+ *  - a contiguous subsequence (in either direction) of any other.
+ */
+export declare function removeDuplicateAndSubsectionLines(collection: FeatureCollection<LineString>): FeatureCollection<LineString>;

package/dist/graph/methods/leaf.d.ts

@@ -0,0 +1,12 @@
+import { FeatureCollection, LineString } from 'geojson';
+/**
+ * Separates a graph's edges into leaf and non-leaf edges.
+ * A leaf edge has a start or end node with degree 1.
+ *
+ * @param edgesFc - FeatureCollection containing LineString features representing edges of a graph
+ * @returns Object containing two FeatureCollections: leafEdges and nonLeafEdges
+ */
+export declare function getLeafEdges(edgesFc: FeatureCollection<LineString>): {
+    leafEdges: FeatureCollection<LineString>;
+    nonLeafEdges: FeatureCollection<LineString>;
+};

package/dist/graph/methods/nodes.d.ts

@@ -0,0 +1,17 @@
+import { Feature, FeatureCollection, LineString, Point } from 'geojson';
+/**
+ * Counts the unique nodes and edges in a GeoJSON FeatureCollection of LineString features.
+ * @param featureCollection - A GeoJSON FeatureCollection containing LineString features
+ * @returns An object containing the count of unique nodes and edges
+ */
+export declare function graphGetNodeAndEdgeCount(featureCollection: FeatureCollection<LineString>): {
+    nodeCount: number;
+    edgeCount: number;
+};
+/**
+ * Converts a FeatureCollection of LineString features into a FeatureCollection of Point features,
+ * where each unique coordinate in the LineStrings becomes a Point.
+ * @param lines - A GeoJSON FeatureCollection containing LineString features
+ * @returns A FeatureCollection of Point features representing unique nodes
+ */
+export declare function graphGetNodesAsPoints(lines: FeatureCollection<LineString>): Feature<Point>[];

package/dist/graph/methods/spatial-index/geokdbush.d.ts

@@ -0,0 +1,3 @@
+import { KDBush } from './kdbush';
+export declare function around(index: KDBush, lng: number, lat: number, maxResults?: number, maxDistanceKm?: number): any[];
+export declare function distance(lng1: number, lat1: number, lng2: number, lat2: number): number;

package/dist/graph/methods/spatial-index/kdbush.d.ts

@@ -0,0 +1,16 @@
+export declare class KDBush {
+    data: ArrayBuffer;
+    ids: Uint16Array | Uint32Array;
+    coords: InstanceType<TypedArrayConstructor>;
+    private _pos;
+    private _finished;
+    numItems: number;
+    nodeSize: number;
+    private ArrayType;
+    private IndexArrayType;
+    constructor(numItems: number, nodeSize?: number, ArrayType?: TypedArrayConstructor, data?: ArrayBuffer);
+    add(x: number, y: number): number;
+    finish(): this;
+}
+type TypedArrayConstructor = Int8ArrayConstructor | Uint8ArrayConstructor | Uint8ClampedArrayConstructor | Int16ArrayConstructor | Uint16ArrayConstructor | Int32ArrayConstructor | Uint32ArrayConstructor | Float32ArrayConstructor | Float64ArrayConstructor;
+export {};

package/dist/graph/methods/spatial-index/tinyqueue.d.ts

@@ -0,0 +1,11 @@
+export default class TinyQueue<T> {
+    private data;
+    length: number;
+    private compare;
+    constructor(data?: T[], compare?: (a: T, b: T) => number);
+    push(item: T): void;
+    pop(): T | undefined;
+    peek(): T | undefined;
+    private _up;
+    private _down;
+}

package/dist/graph/methods/unify.d.ts

@@ -0,0 +1,2 @@
+import { FeatureCollection, LineString } from 'geojson';
+export declare function unifyCloseCoordinates(featureCollection: FeatureCollection<LineString>, radiusMeters: number): FeatureCollection<LineString>;

package/dist/graph/methods/unique-segments.d.ts

@@ -0,0 +1,5 @@
+import { FeatureCollection, LineString } from 'geojson';
+/**
+ * Breaks LineStrings in a FeatureCollection into unique single line segments
+ */
+export declare function graphGetUniqueSegments(input: FeatureCollection<LineString>): FeatureCollection<LineString>;

package/dist/graph/methods/unique.d.ts

@@ -0,0 +1,5 @@
+import { FeatureCollection, LineString } from 'geojson';
+/**
+ * Breaks LineStrings in a FeatureCollection into unique single line segments
+ */
+export declare function graphGetUniqueSegments(input: FeatureCollection<LineString>): FeatureCollection<LineString>;

package/dist/terra-route.cjs

@@ -1,2 +1,2 @@
-function t(t,e){(null==e||e>t.length)&&(e=t.length);for(var r=0,n=Array(e);r<e;r++)n[r]=t[r];return n}function e(e,r){var n="undefined"!=typeof Symbol&&e[Symbol.iterator]||e["@@iterator"];if(n)return(n=n.call(e)).next.bind(n);if(Array.isArray(e)||(n=function(e,r){if(e){if("string"==typeof e)return t(e,r);var n={}.toString.call(e).slice(8,-1);return"Object"===n&&e.constructor&&(n=e.constructor.name),"Map"===n||"Set"===n?Array.from(e):"Arguments"===n||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)?t(e,r):void 0}}(e))||r&&e&&"number"==typeof e.length){n&&(e=n);var a=0;return function(){return a>=e.length?{done:!0}:{done:!1,value:e[a++]}}}throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")}var r=function(t,e){var r=function(t){return t*Math.PI/180},n=r(t[1]),a=r(t[0]),i=r(e[1]),o=i-n,s=r(e[0])-a,h=Math.sin(o/2)*Math.sin(o/2)+Math.cos(n)*Math.cos(i)*Math.sin(s/2)*Math.sin(s/2);return 2*Math.atan2(Math.sqrt(h),Math.sqrt(1-h))*6371e3/1e3},n=/*#__PURE__*/function(){function t(){this.heap=[],this.insertCounter=0}var e=t.prototype;return e.insert=function(t,e){var r={key:t,value:e,index:this.insertCounter++},n=this.heap.length;for(this.heap.push(r);n>0;){var a=n-1>>>1,i=this.heap[a];if(t>i.key||t===i.key&&r.index>i.index)break;this.heap[n]=i,n=a}this.heap[n]=r},e.extractMin=function(){var t=this.heap,e=t.length;if(0===e)return null;var r=t[0],n=t.pop();return e>1&&(t[0]=n,this.bubbleDown(0)),r.value},e.size=function(){return this.heap.length},e.bubbleDown=function(t){for(var e=this.heap,r=e.length,n=e[t],a=n.key,i=n.index;;){var o=1+(t<<1);if(o>=r)break;var s=o,h=e[o],u=o+1;if(u<r){var c=e[u];(c.key<h.key||c.key===h.key&&c.index<h.index)&&(s=u,h=c)}if(!(h.key<a||h.key===a&&h.index<i))break;e[t]=h,t=s}e[t]=n},t}();exports.TerraRoute=/*#__PURE__*/function(){function t(t){var e,a;this.network=null,this.distanceMeasurement=void 0,this.heapConstructor=void 0,this.coordinateIndexMap=new Map,this.coordinates=[],this.adjacencyList=[],this.distanceMeasurement=null!=(e=null==t?void 0:t.distanceMeasurement)?e:r,this.heapConstructor=null!=(a=null==t?void 0:t.heap)?a:n}var a=t.prototype;return a.buildRouteGraph=function(t){this.network=t,this.coordinateIndexMap=new Map,this.coordinates=[],this.adjacencyList=[];for(var r,n=this.coordinateIndexMap,a=this.coordinates,i=this.adjacencyList,o=this.distanceMeasurement,s=e(t.features);!(r=s()).done;)for(var h=r.value.geometry.coordinates,u=0;u<h.length-1;u++){var c=h[u],d=c[0],l=c[1],f=h[u+1],v=f[0],p=f[1],y=n.get(d);y||(y=new Map,n.set(d,y));var M=y.get(l);void 0===M&&(M=a.length,a.push(h[u]),y.set(l,M),i[M]=[]);var g=n.get(v);g||(g=new Map,n.set(v,g));var b=g.get(p);void 0===b&&(b=a.length,a.push(h[u+1]),g.set(p,b),i[b]=[]);var x=o(h[u],h[u+1]);i[M].push({node:b,distance:x}),i[b].push({node:M,distance:x})}},a.getRoute=function(t,r){if(!this.network)throw new Error("Network not built. Please call buildRouteGraph(network) first.");var n=this.getOrCreateIndex(t.geometry.coordinates),a=this.getOrCreateIndex(r.geometry.coordinates);if(n===a)return null;var i=new this.heapConstructor;i.insert(0,n);var o=this.coordinates.length,s=new Array(o).fill(Infinity),h=new Array(o).fill(-1),u=new Array(o).fill(!1);for(s[n]=0;i.size()>0;){var c=i.extractMin();if(!u[c]){if(c===a)break;u[c]=!0;for(var d,l=e(this.adjacencyList[c]||[]);!(d=l()).done;){var f=d.value,v=s[c]+f.distance;if(v<s[f.node]){s[f.node]=v,h[f.node]=c;var p=this.distanceMeasurement(this.coordinates[f.node],this.coordinates[a]);i.insert(v+p,f.node)}}}}if(h[a]<0)return null;for(var y=[],M=a;M!==n;)y.unshift(this.coordinates[M]),M=h[M];return y.unshift(this.coordinates[n]),{type:"Feature",geometry:{type:"LineString",coordinates:y},properties:{}}},a.getOrCreateIndex=function(t){var e=t[0],r=t[1],n=this.coordinateIndexMap.get(e);n||(n=new Map,this.coordinateIndexMap.set(e,n));var a=n.get(r);return void 0===a&&(a=this.coordinates.length,this.coordinates.push(t),n.set(r,a),this.adjacencyList[a]=[]),a},t}(),exports.createCheapRuler=function(t){var e=1/298.257223563,r=e*(2-e),n=Math.PI/180,a=Math.cos(t*n),i=1/(1-r*(1-a*a)),o=Math.sqrt(i),s=6378.137*n,h=s*o*a,u=s*o*i*(1-r);return function(t,e){for(var r=t[0]-e[0];r<-180;)r+=360;for(;r>180;)r-=360;var n=r*h,a=(t[1]-e[1])*u;return Math.sqrt(n*n+a*a)}},exports.haversineDistance=r;
+function t(t,e){(null==e||e>t.length)&&(e=t.length);for(var r=0,n=Array(e);r<e;r++)n[r]=t[r];return n}function e(e,r){var n="undefined"!=typeof Symbol&&e[Symbol.iterator]||e["@@iterator"];if(n)return(n=n.call(e)).next.bind(n);if(Array.isArray(e)||(n=function(e,r){if(e){if("string"==typeof e)return t(e,r);var n={}.toString.call(e).slice(8,-1);return"Object"===n&&e.constructor&&(n=e.constructor.name),"Map"===n||"Set"===n?Array.from(e):"Arguments"===n||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)?t(e,r):void 0}}(e))||r&&e&&"number"==typeof e.length){n&&(e=n);var a=0;return function(){return a>=e.length?{done:!0}:{done:!1,value:e[a++]}}}throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")}function r(){return r=Object.assign?Object.assign.bind():function(t){for(var e=1;e<arguments.length;e++){var r=arguments[e];for(var n in r)({}).hasOwnProperty.call(r,n)&&(t[n]=r[n])}return t},r.apply(null,arguments)}var n=function(t,e){var r=function(t){return t*Math.PI/180},n=r(t[1]),a=r(t[0]),i=r(e[1]),o=i-n,s=r(e[0])-a,u=Math.sin(o/2)*Math.sin(o/2)+Math.cos(n)*Math.cos(i)*Math.sin(s/2)*Math.sin(s/2);return 2*Math.atan2(Math.sqrt(u),Math.sqrt(1-u))*6371e3/1e3},a=/*#__PURE__*/function(){function t(){this.heap=[],this.insertCounter=0}var e=t.prototype;return e.insert=function(t,e){var r={key:t,value:e,index:this.insertCounter++},n=this.heap.length;for(this.heap.push(r);n>0;){var a=n-1>>>1,i=this.heap[a];if(t>i.key||t===i.key&&r.index>i.index)break;this.heap[n]=i,n=a}this.heap[n]=r},e.extractMin=function(){var t=this.heap,e=t.length;if(0===e)return null;var r=t[0],n=t.pop();return e>1&&(t[0]=n,this.bubbleDown(0)),r.value},e.size=function(){return this.heap.length},e.bubbleDown=function(t){for(var e=this.heap,r=e.length,n=e[t],a=n.key,i=n.index;;){var o=1+(t<<1);if(o>=r)break;var s=o,u=e[o],h=o+1;if(h<r){var f=e[h];(f.key<u.key||f.key===u.key&&f.index<u.index)&&(s=h,u=f)}if(!(u.key<a||u.key===a&&u.index<i))break;e[t]=u,t=s}e[t]=n},t}();function i(t,r,n){n[t]=!0;for(var a,o=e(r[t]);!(a=o()).done;){var s=a.value;n[s]||i(s,r,n)}}function o(t,e){var r=function(t,e){var r=t[0],n=e[0];return r<n||r===n&&t[1]<=e[1]?[t,e]:[e,t]}(t,e);return JSON.stringify([r[0],r[1]])}function s(t){for(var r,n=new Map,a=e(t.features);!(r=a()).done;)for(var i=r.value.geometry.coordinates,s=0;s<i.length-1;s++){var u=i[s],h=i[s+1],f=o(u,h);n.has(f)||n.set(f,{type:"Feature",geometry:{type:"LineString",coordinates:[u,h]},properties:{}})}return{type:"FeatureCollection",features:Array.from(n.values())}}function u(t){for(var e=t.geometry.coordinates,r=0,a=0;a<e.length-1;a++)r+=n(e[a],e[a+1]);return r}function h(t,e){var r=t.length,n=e.length;if(r>n)return!1;for(var a=0;a<=n-r;a++){for(var i=!0,o=0;o<r;o++)if(e[a+o][0]!==t[o][0]||e[a+o][1]!==t[o][1]){i=!1;break}if(i)return!0}for(var s=[].concat(t).reverse(),u=0;u<=n-r;u++){for(var h=!0,f=0;f<r;f++)if(e[u+f][0]!==s[f][0]||e[u+f][1]!==s[f][1]){h=!1;break}if(h)return!0}return!1}function f(t){var e=s(t),r=new Map;function n(t){return t.join(",")}for(var a=0;a<e.features.length;a++){var i=e.features[a].geometry.coordinates;if(!(i.length<2)){var o=n(i[0]),u=n(i[i.length-1]);r.set(o,(r.get(o)||0)+1),r.set(u,(r.get(u)||0)+1)}}for(var h=new Map,f=new Map,d=0;d<e.features.length;d++){var v=e.features[d],c=v.geometry.coordinates;if(!(c.length<2)){var l=n(c[0]),g=n(c[c.length-1]),p=r.get(l)||0,y=r.get(g)||0,m=c.map(n).join(";");1===p||1===y?h.has(m)||h.set(m,v):f.has(m)||f.set(m,v)}}return{leafEdges:{type:"FeatureCollection",features:Array.from(h.values())},nonLeafEdges:{type:"FeatureCollection",features:Array.from(f.values())}}}function d(t,r,n,a,i){for(var o,s=e(t.geometry.coordinates);!(o=s()).done;)if(!v(o.value,r,n,a,i))return!1;return!0}function v(t,e,r,n,a){var i=t[0],o=t[1];return i>=e&&i<=n&&o>=r&&o<=a}var c=[Int8Array,Uint8Array,Uint8ClampedArray,Int16Array,Uint16Array,Int32Array,Uint32Array,Float32Array,Float64Array],l=/*#__PURE__*/function(){function t(t,e,r,n){if(void 0===e&&(e=64),void 0===r&&(r=Float64Array),this.data=void 0,this.ids=void 0,this.coords=void 0,this._pos=void 0,this._finished=void 0,this.numItems=void 0,this.nodeSize=void 0,this.ArrayType=void 0,this.IndexArrayType=void 0,isNaN(t)||t<0)throw new Error("Unexpected numItems value: "+t+".");this.numItems=t,this.nodeSize=Math.min(Math.max(e,2),65535),this.ArrayType=r,this.IndexArrayType=t<65536?Uint16Array:Uint32Array;var a=c.indexOf(this.ArrayType),i=2*t*this.ArrayType.BYTES_PER_ELEMENT,o=t*this.IndexArrayType.BYTES_PER_ELEMENT,s=(8-o%8)%8;if(a<0)throw new Error("Unexpected typed array class: "+r+".");n?(this.data=n,this.ids=new this.IndexArrayType(this.data,8,t),this.coords=new this.ArrayType(this.data,8+o+s,2*t),this._pos=2*t,this._finished=!0):(this.data=new ArrayBuffer(8+i+o+s),this.ids=new this.IndexArrayType(this.data,8,t),this.coords=new this.ArrayType(this.data,8+o+s,2*t),this._pos=0,this._finished=!1,new Uint8Array(this.data,0,2).set([219,16+a]),new Uint16Array(this.data,2,1)[0]=this.nodeSize,new Uint32Array(this.data,4,1)[0]=this.numItems)}var e=t.prototype;return e.add=function(t,e){var r=this._pos>>1;return this.ids[r]=r,this.coords[this._pos++]=t,this.coords[this._pos++]=e,r},e.finish=function(){var t=this._pos>>1;if(t!==this.numItems)throw new Error("Added "+t+" items when expected "+this.numItems+".");return g(this.ids,this.coords,this.nodeSize,0,this.numItems-1,0),this._finished=!0,this},t}();function g(t,e,r,n,a,i){if(!(a-n<=r)){var o=n+a>>1;p(t,e,o,n,a,i),g(t,e,r,n,o-1,1-i),g(t,e,r,o+1,a,1-i)}}function p(t,e,r,n,a,i){for(;a>n;){if(a-n>600){var o=a-n+1,s=r-n+1,u=Math.log(o),h=.5*Math.exp(2*u/3),f=.5*Math.sqrt(u*h*(o-h)/o)*(s-o/2<0?-1:1);p(t,e,r,Math.max(n,Math.floor(r-s*h/o+f)),Math.min(a,Math.floor(r+(o-s)*h/o+f)),i)}var d=e[2*r+i],v=n,c=a;for(y(t,e,n,r),e[2*a+i]>d&&y(t,e,n,a);v<c;){for(y(t,e,v,c),v++,c--;e[2*v+i]<d;)v++;for(;e[2*c+i]>d;)c--}e[2*n+i]===d?y(t,e,n,c):y(t,e,++c,a),c<=r&&(n=c+1),r<=c&&(a=c-1)}}function y(t,e,r,n){m(t,r,n),m(e,2*r,2*n),m(e,2*r+1,2*n+1)}function m(t,e,r){var n=t[e];t[e]=t[r],t[r]=n}var w=/*#__PURE__*/function(){function t(t,e){if(void 0===t&&(t=[]),void 0===e&&(e=function(t,e){return t<e?-1:t>e?1:0}),this.data=void 0,this.length=void 0,this.compare=void 0,this.data=t,this.length=this.data.length,this.compare=e,this.length>0)for(var r=(this.length>>1)-1;r>=0;r--)this._down(r)}var e=t.prototype;return e.push=function(t){this.data.push(t),this._up(this.length++)},e.pop=function(){if(0!==this.length){var t=this.data[0],e=this.data.pop();return this.length--,this.length>0&&(this.data[0]=e,this._down(0)),t}},e.peek=function(){return this.data[0]},e._up=function(t){for(var e=this.data,r=this.compare,n=e[t];t>0;){var a=t-1>>1,i=e[a];if(r(n,i)>=0)break;e[t]=i,t=a}e[t]=n},e._down=function(t){for(var e=this.data,r=this.compare,n=this.length>>1,a=e[t];t<n;){var i=1+(t<<1),o=i+1;if(o<this.length&&r(e[o],e[i])<0&&(i=o),r(e[i],a)>=0)break;e[t]=e[i],t=i}e[t]=a},t}(),M=Math.PI/180;function x(t,e,r,n){var a=n.minLng,i=n.maxLng,o=n.minLat,s=n.maxLat;if(t>=a&&t<=i)return e<o?A((e-o)*M):e>s?A((e-s)*M):0;var u=Math.min(A((t-a)*M),A((t-i)*M)),h=function(t,e){var r=1-2*e;return r<=0?t>0?90:-90:Math.atan(Math.tan(t*M)/r)/M}(e,u);return h>o&&h<s?L(u,r,e,h):Math.min(L(u,r,e,o),L(u,r,e,s))}function k(t,e){return t.dist-e.dist}function A(t){var e=Math.sin(t/2);return e*e}function L(t,e,r,n){return e*Math.cos(n*M)*t+A((r-n)*M)}function I(t,e,r,n,a){return L(A((t-r)*M),a,e,n)}var E=/*#__PURE__*/function(){function t(t){this.network=void 0,this.network=t}var a=t.prototype;return a.setNetwork=function(t){this.network=t},a.getNetwork=function(){return this.network},a.getNetworkInBoundingBox=function(t){return function(t,r){var n=r[0],a=r[1],i=r[2],o=r[3];if(n>=i||a>=o)throw new Error("Invalid bounding box: min values must be less than max values");for(var s,u=[],h=e(t.features);!(s=h()).done;){var f=s.value;d(f,n,a,i,o)&&u.push(f)}return{type:"FeatureCollection",features:u}}(this.network,t)},a.getNetworkWithoutDuplicatesOrSubsections=function(){return function(t){for(var e=t.features,r=new Set,n=0;n<e.length;n++)for(var a=e[n].geometry.coordinates,i=0;i<e.length;i++)if(n!==i){var o=e[i].geometry.coordinates;if(h(a,o)&&(a.length<o.length||a.length===o.length&&n>i)){r.add(n);break}}return{type:"FeatureCollection",features:e.filter(function(t,e){return!r.has(e)})}}(this.network)},a.getConnectedComponents=function(){return function(t){var r=t.features,n=new Map,a=new Map;function i(t){return t[0]+","+t[1]}for(var o=0;o<r.length;o++)for(var s,u=e(r[o].geometry.coordinates);!(s=u()).done;){var h=i(s.value);a.has(h)||a.set(h,new Set),a.get(h).add(o)}for(var f=0;f<r.length;f++){n.set(f,new Set);for(var d,v=e(r[f].geometry.coordinates);!(d=v()).done;){var c=i(d.value),l=a.get(c);if(l)for(var g,p=e(l);!(g=p()).done;){var y=g.value;y!==f&&n.get(f).add(y)}}}var m=new Set,w=[];function M(t,a){for(var i=[t];i.length>0;){var o=i.pop();if(!m.has(o)){m.add(o),a.push(r[o]);var s=n.get(o);if(s)for(var u,h=e(s);!(u=h()).done;){var f=u.value;m.has(f)||i.push(f)}}}}for(var x=0;x<r.length;x++)if(!m.has(x)){var k=[];M(x,k),w.push({type:"FeatureCollection",features:k})}return w.sort(function(t,e){return t.features.length-e.features.length}),w}(this.network)},a.getConnectedComponentCount=function(){return function(t){for(var r,n=t.features,a=n.length,o=new Map,s=0;s<a;s++)for(var u,h=e(n[s].geometry.coordinates);!(u=h()).done;){var f=(r=u.value)[0]+","+r[1];o.has(f)||o.set(f,[]),o.get(f).push(s)}for(var d,v=Array.from({length:a},function(){return[]}),c=e(o.values());!(d=c()).done;)for(var l=d.value,g=0;g<l.length;g++)for(var p=g+1;p<l.length;p++){var y=l[g],m=l[p];v[y].push(m),v[m].push(y)}for(var w=new Array(a).fill(!1),M=0,x=0;x<a;x++)w[x]||(i(x,v,w),M++);return M}(this.network)},a.getNodeAndEdgeCount=function(){return function(t){for(var r,n=new Set,a=new Set,i=e(t.features);!(r=i()).done;){for(var o,s=r.value.geometry.coordinates,u=e(s);!(o=u()).done;)n.add(JSON.stringify(o.value));for(var h=0;h<s.length-1;h++){var f=(d=s[h+1],(v=JSON.stringify(s[h]))<(c=JSON.stringify(d))?v+"|"+c:c+"|"+v);a.add(f)}}var d,v,c;return{nodeCount:n.size,edgeCount:a.size}}(this.network)},a.getNodes=function(){return{type:"FeatureCollection",features:function(t){for(var r,n=new Set,a=[],i=e(t.features);!(r=i()).done;)for(var o,s=e(r.value.geometry.coordinates);!(o=s()).done;){var u=o.value,h=u.join(",");n.has(h)||(n.add(h),a.push({type:"Feature",geometry:{type:"Point",coordinates:u},properties:{}}))}return a}(this.network)}},a.getNodeCount=function(){return this.getNodeAndEdgeCount().nodeCount},a.getEdges=function(){return s(this.network)},a.getLongestEdgeLength=function(){var t=this.getLongestEdge();return t?u(t):-1},a.getShortestEdgeLength=function(){var t=this.getShortestEdge();return t?u(t):-1},a.getLongestEdge=function(){var t=this.getEdges().features;if(0===t.length)return null;var e=t.sort(function(t,e){return u(t)-u(e)});return e[e.length-1]},a.getShortestEdge=function(){var t=this.getEdges().features;return 0===t.length?null:t.sort(function(t,e){return u(t)-u(e)})[0]},a.getEdgeCount=function(){return this.getNodeAndEdgeCount().edgeCount},a.getLeafEdges=function(){return f(this.network).leafEdges},a.getPrunedEdges=function(t){if(t&&t>0){for(var e=this.network,r=0;r<t;r++)e=f(e).nonLeafEdges;return e}return f(this.network).nonLeafEdges},a.getUnifiedNetwork=function(t){return function(t,a){if(t.features.length<2)return t;for(var i,o=new Set,s=new Map,u=[],h=new Map,f=e(t.features);!(i=f()).done;)for(var d,v=e(i.value.geometry.coordinates);!(d=v()).done;){var c=d.value,g=c[0]+","+c[1];h.has(g)||(h.set(g,u.length),u.push(c))}for(var p=new l(u.length),y=0,m=u;y<m.length;y++){var L=m[y];p.add(L[0],L[1])}function E(t,r,i){for(var s,h=null,f=Infinity,d=e(function(t,e,r,n,a){void 0===n&&(n=Infinity),void 0===a&&(a=Infinity);var i=1,o=[];void 0===n&&(n=Infinity),void 0!==a&&(i=A(a/6371));for(var s=new w([],k),u={left:0,right:t.ids.length-1,axis:0,dist:0,minLng:-180,minLat:-90,maxLng:180,maxLat:90},h=Math.cos(r*M);u;){var f=u.right,d=u.left;if(f-d<=t.nodeSize)for(var v=d;v<=f;v++){var c=t.ids[v],l=I(e,r,t.coords[2*v],t.coords[2*v+1],h);s.push({id:c,dist:l})}else{var g=d+f>>1,p=t.coords[2*g],y=t.coords[2*g+1],m=t.ids[g],L=I(e,r,p,y,h);s.push({id:m,dist:L});var E=(u.axis+1)%2,b={left:d,right:g-1,axis:E,minLng:u.minLng,minLat:u.minLat,maxLng:0===u.axis?p:u.maxLng,maxLat:1===u.axis?y:u.maxLat,dist:0},C={left:g+1,right:f,axis:E,minLng:0===u.axis?p:u.minLng,minLat:1===u.axis?y:u.minLat,maxLng:u.maxLng,maxLat:u.maxLat,dist:0};b.dist=x(e,r,h,b),C.dist=x(e,r,h,C),s.push(b),s.push(C)}for(;s.length&&null!=s.peek().id;){var S=s.pop();if(S.dist>i)return o;if(o.push(S.id),o.length===n)return o}u=s.pop()}return o}(p,t[0],t[1],Infinity,a/1e3));!(s=d()).done;){var v=u[s.value],c=v[0]+","+v[1];if(o.has(c)&&!r.includes(v)&&!i.has(c)){var l=1e3*n(v,t);l<=a&&l<f&&(h=v,f=l)}}return null!==h?h:(o.add(t[0]+","+t[1]),t)}p.finish();var b=t.features.map(function(t){for(var n,a=[],i=[],o=new Set,u=e(t.geometry.coordinates);!(n=u()).done;){var h=n.value,f=h[0]+","+h[1];if(!s.has(f)){var d=E(h,a,o);o.has(d[0]+","+d[1])?s.set(f,h):s.set(f,d)}var v=s.get(f),c=v[0]+","+v[1];o.has(c)||(i.push(v),o.add(c)),a.push(h)}return r({},t,{geometry:r({},t.geometry,{coordinates:i})})});return r({},t,{features:b})}(this.network,t)},t}(),b=/*#__PURE__*/function(){function t(t){var e,r;this.network=null,this.distanceMeasurement=void 0,this.heapConstructor=void 0,this.coordinateIndexMap=new Map,this.coordinates=[],this.adjacencyList=[],this.distanceMeasurement=null!=(e=null==t?void 0:t.distanceMeasurement)?e:n,this.heapConstructor=null!=(r=null==t?void 0:t.heap)?r:a}var r=t.prototype;return r.buildRouteGraph=function(t){this.network=t,this.coordinateIndexMap=new Map,this.coordinates=[],this.adjacencyList=[];for(var r,n=this.coordinateIndexMap,a=this.coordinates,i=this.adjacencyList,o=this.distanceMeasurement,s=e(t.features);!(r=s()).done;)for(var u=r.value.geometry.coordinates,h=0;h<u.length-1;h++){var f=u[h],d=f[0],v=f[1],c=u[h+1],l=c[0],g=c[1],p=n.get(d);p||(p=new Map,n.set(d,p));var y=p.get(v);void 0===y&&(y=a.length,a.push(u[h]),p.set(v,y),i[y]=[]);var m=n.get(l);m||(m=new Map,n.set(l,m));var w=m.get(g);void 0===w&&(w=a.length,a.push(u[h+1]),m.set(g,w),i[w]=[]);var M=o(u[h],u[h+1]);i[y].push({node:w,distance:M}),i[w].push({node:y,distance:M})}},r.getRoute=function(t,r){if(!this.network)throw new Error("Network not built. Please call buildRouteGraph(network) first.");var n=this.getOrCreateIndex(t.geometry.coordinates),a=this.getOrCreateIndex(r.geometry.coordinates);if(n===a)return null;var i=new this.heapConstructor;i.insert(0,n);var o=this.coordinates.length,s=new Array(o).fill(Infinity),u=new Array(o).fill(-1),h=new Array(o).fill(!1);for(s[n]=0;i.size()>0;){var f=i.extractMin();if(!h[f]){if(f===a)break;h[f]=!0;for(var d,v=e(this.adjacencyList[f]||[]);!(d=v()).done;){var c=d.value,l=s[f]+c.distance;if(l<s[c.node]){s[c.node]=l,u[c.node]=f;var g=this.distanceMeasurement(this.coordinates[c.node],this.coordinates[a]);i.insert(l+g,c.node)}}}}if(u[a]<0)return null;for(var p=[],y=a;y!==n;)p.unshift(this.coordinates[y]),y=u[y];return p.unshift(this.coordinates[n]),{type:"Feature",geometry:{type:"LineString",coordinates:p},properties:{}}},r.getOrCreateIndex=function(t){var e=t[0],r=t[1],n=this.coordinateIndexMap.get(e);n||(n=new Map,this.coordinateIndexMap.set(e,n));var a=n.get(r);return void 0===a&&(a=this.coordinates.length,this.coordinates.push(t),n.set(r,a),this.adjacencyList[a]=[]),a},t}();exports.LineStringGraph=E,exports.TerraRoute=b,exports.createCheapRuler=function(t){var e=1/298.257223563,r=e*(2-e),n=Math.PI/180,a=Math.cos(t*n),i=1/(1-r*(1-a*a)),o=Math.sqrt(i),s=6378.137*n,u=s*o*a,h=s*o*i*(1-r);return function(t,e){for(var r=t[0]-e[0];r<-180;)r+=360;for(;r>180;)r-=360;var n=r*u,a=(t[1]-e[1])*h;return Math.sqrt(n*n+a*a)}},exports.haversineDistance=n;
 //# sourceMappingURL=terra-route.cjs.map