@bendyline/squisq 0.1.1

package/dist/Types-sh2VRxfo.d.ts

@@ -0,0 +1,15 @@
+/**
+ * Core geographic types shared across squisq.
+ */
+interface Coordinates {
+    lat: number;
+    lng: number;
+}
+interface BoundingBox {
+    north: number;
+    south: number;
+    east: number;
+    west: number;
+}
+
+export type { BoundingBox as B, Coordinates as C };

package/dist/chunk-7UDSRZKG.js

@@ -0,0 +1,103 @@
+// src/spatial/Haversine.ts
+function haversineDistance(from, to) {
+  const R = 6371;
+  const dLat = toRadians(to.lat - from.lat);
+  const dLng = toRadians(to.lng - from.lng);
+  const a = Math.sin(dLat / 2) * Math.sin(dLat / 2) + Math.cos(toRadians(from.lat)) * Math.cos(toRadians(to.lat)) * Math.sin(dLng / 2) * Math.sin(dLng / 2);
+  const c = 2 * Math.atan2(Math.sqrt(a), Math.sqrt(1 - a));
+  return R * c;
+}
+function calculateBearing(from, to) {
+  const dLng = toRadians(to.lng - from.lng);
+  const lat1 = toRadians(from.lat);
+  const lat2 = toRadians(to.lat);
+  const x = Math.sin(dLng) * Math.cos(lat2);
+  const y = Math.cos(lat1) * Math.sin(lat2) - Math.sin(lat1) * Math.cos(lat2) * Math.cos(dLng);
+  const bearing = Math.atan2(x, y);
+  return (bearing * 180 / Math.PI + 360) % 360;
+}
+function toRadians(degrees) {
+  return degrees * Math.PI / 180;
+}
+
+// src/spatial/Geohash.ts
+import ngeohash from "ngeohash";
+function encodeGeohash(lat, lng, precision = 9) {
+  return ngeohash.encode(lat, lng, precision);
+}
+function decodeGeohash(hash) {
+  const result = ngeohash.decode(hash);
+  return {
+    lat: result.latitude,
+    lng: result.longitude,
+    latErr: result.error.latitude,
+    lngErr: result.error.longitude
+  };
+}
+function getNeighbors(hash) {
+  return ngeohash.neighbors(hash);
+}
+function getGeohash4Neighbors(geohash4) {
+  if (geohash4.length !== 4) {
+    throw new Error(`getGeohash4Neighbors requires 4-char geohash, got: ${geohash4}`);
+  }
+  const neighbors = getNeighbors(geohash4);
+  return [geohash4, ...neighbors];
+}
+function getGeohashPrefix(geohash, precision) {
+  return geohash.slice(0, precision);
+}
+function geohashToHierarchicalPath(geohash4) {
+  if (geohash4.length !== 4) {
+    throw new Error(`geohashToHierarchicalPath requires 4-char geohash, got: ${geohash4}`);
+  }
+  const [c1, c2, c3, c4] = geohash4.split("");
+  return `${c1}/${c2}/${c3}/${c4}`;
+}
+function getGeohashPath(from, to, precision = 4) {
+  if (from === to) return [];
+  const fromCenter = decodeGeohash(from);
+  const toCenter = decodeGeohash(to);
+  const dLat = Math.abs(toCenter.lat - fromCenter.lat);
+  const dLng = Math.abs(toCenter.lng - fromCenter.lng);
+  const midLatRad = (fromCenter.lat + toCenter.lat) / 2 * (Math.PI / 180);
+  const approxKm = Math.sqrt((dLat * 111) ** 2 + (dLng * 111 * Math.cos(midLatRad)) ** 2);
+  const steps = Math.max(2, Math.ceil(approxKm / 15));
+  const seen = /* @__PURE__ */ new Set();
+  seen.add(from);
+  seen.add(to);
+  const path = [];
+  for (let i = 1; i < steps; i++) {
+    const t = i / steps;
+    const lat = fromCenter.lat + t * (toCenter.lat - fromCenter.lat);
+    const lng = fromCenter.lng + t * (toCenter.lng - fromCenter.lng);
+    const hash = encodeGeohash(lat, lng, precision);
+    if (!seen.has(hash)) {
+      seen.add(hash);
+      path.push(hash);
+    }
+  }
+  return path;
+}
+function geohashOverlapsBounds(hash, bounds) {
+  const { lat, lng, latErr, lngErr } = decodeGeohash(hash);
+  const hashNorth = lat + latErr;
+  const hashSouth = lat - latErr;
+  const hashEast = lng + lngErr;
+  const hashWest = lng - lngErr;
+  return !(hashNorth < bounds.south || hashSouth > bounds.north || hashEast < bounds.west || hashWest > bounds.east);
+}
+
+export {
+  haversineDistance,
+  calculateBearing,
+  encodeGeohash,
+  decodeGeohash,
+  getNeighbors,
+  getGeohash4Neighbors,
+  getGeohashPrefix,
+  geohashToHierarchicalPath,
+  getGeohashPath,
+  geohashOverlapsBounds
+};
+//# sourceMappingURL=chunk-7UDSRZKG.js.map

package/dist/chunk-7UDSRZKG.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/spatial/Haversine.ts","../src/spatial/Geohash.ts"],"sourcesContent":["/**\n * Haversine Distance Calculation\n *\n * Provides accurate distance calculation between two geographic coordinates\n * using the Haversine formula, which accounts for Earth's curvature.\n */\n\nimport type { Coordinates } from '../schemas/Types.js';\n\n/**\n * Calculate distance between two coordinates using Haversine formula.\n *\n * @param from Start coordinates\n * @param to End coordinates\n * @returns Distance in kilometers\n */\nexport function haversineDistance(from: Coordinates, to: Coordinates): number {\n  const R = 6371; // Earth's radius in kilometers\n\n  const dLat = toRadians(to.lat - from.lat);\n  const dLng = toRadians(to.lng - from.lng);\n\n  const a =\n    Math.sin(dLat / 2) * Math.sin(dLat / 2) +\n    Math.cos(toRadians(from.lat)) *\n      Math.cos(toRadians(to.lat)) *\n      Math.sin(dLng / 2) *\n      Math.sin(dLng / 2);\n\n  const c = 2 * Math.atan2(Math.sqrt(a), Math.sqrt(1 - a));\n\n  return R * c;\n}\n\n/**\n * Calculate bearing from one coordinate to another.\n *\n * @param from Start coordinates\n * @param to End coordinates\n * @returns Bearing in degrees (0-360, where 0 = north, 90 = east)\n */\nexport function calculateBearing(from: Coordinates, to: Coordinates): number {\n  const dLng = toRadians(to.lng - from.lng);\n  const lat1 = toRadians(from.lat);\n  const lat2 = toRadians(to.lat);\n\n  const x = Math.sin(dLng) * Math.cos(lat2);\n  const y = Math.cos(lat1) * Math.sin(lat2) - Math.sin(lat1) * Math.cos(lat2) * Math.cos(dLng);\n\n  const bearing = Math.atan2(x, y);\n  return ((bearing * 180) / Math.PI + 360) % 360;\n}\n\n/**\n * Convert degrees to radians.\n */\nfunction toRadians(degrees: number): number {\n  return (degrees * Math.PI) / 180;\n}\n","/**\n * Geohash Utilities\n *\n * Provides geohash encoding/decoding and spatial utilities using the standard\n * ngeohash library for core operations, plus custom utilities for overlap checking\n * and distance calculation.\n *\n * Geohashes are a hierarchical spatial indexing system that divides the world\n * into a grid of cells. Each additional character narrows the area by ~1/32.\n *\n * Precision guide:\n * - 4 chars: ~39km x 19km (used for tile indexing)\n * - 5 chars: ~5km x 5km\n * - 6 chars: ~1.2km x 0.6km\n */\n\nimport ngeohash from 'ngeohash';\n\n/**\n * Encode latitude/longitude to a geohash string.\n * Uses the standard ngeohash library.\n */\nexport function encodeGeohash(lat: number, lng: number, precision = 9): string {\n  return ngeohash.encode(lat, lng, precision);\n}\n\n/**\n * Decode a geohash to latitude/longitude center with error bounds.\n * Uses the standard ngeohash library.\n */\nexport function decodeGeohash(hash: string): {\n  lat: number;\n  lng: number;\n  latErr: number;\n  lngErr: number;\n} {\n  const result = ngeohash.decode(hash);\n  return {\n    lat: result.latitude,\n    lng: result.longitude,\n    latErr: result.error.latitude,\n    lngErr: result.error.longitude,\n  };\n}\n\n/**\n * Get the 8 neighboring geohash cells.\n * Returns up to 8 neighbors (fewer at poles or antimeridian).\n * Uses the standard ngeohash library.\n */\nexport function getNeighbors(hash: string): string[] {\n  return ngeohash.neighbors(hash);\n}\n\n/**\n * Get a 3x3 grid of geohash4 cells (center + 8 neighbors).\n * Used for landing bonus expansions in Fly mode.\n *\n * @param geohash4 - Center geohash4 cell\n * @returns Array of 9 geohash4 cells (center first, then neighbors)\n *\n * @example\n * getGeohash4Neighbors('c23n')\n * // => ['c23n', 'c23p', 'c23q', 'c23j', 'c23m', 'c23k', 'c23h', 'c23e', 'c23s']\n */\nexport function getGeohash4Neighbors(geohash4: string): string[] {\n  if (geohash4.length !== 4) {\n    throw new Error(`getGeohash4Neighbors requires 4-char geohash, got: ${geohash4}`);\n  }\n  const neighbors = getNeighbors(geohash4);\n  return [geohash4, ...neighbors];\n}\n\n/**\n * Get the prefix of a geohash at a given precision.\n * Simple helper for extracting geohash prefixes for directory organization.\n */\nexport function getGeohashPrefix(geohash: string, precision: number): string {\n  return geohash.slice(0, precision);\n}\n\n/**\n * Convert a geohash prefix to a hierarchical path.\n *\n * Examples:\n *   \"9mud\" -> \"9/m/u/d\"\n *   \"9q8y\" -> \"9/q/8/y\"\n *   \"c24k\" -> \"c/2/4/k\"\n *\n * This is used for organizing files in hierarchical directories to avoid\n * thousands of folders in a single directory, which causes filesystem\n * performance issues.\n */\nexport function geohashToHierarchicalPath(geohash4: string): string {\n  if (geohash4.length !== 4) {\n    throw new Error(`geohashToHierarchicalPath requires 4-char geohash, got: ${geohash4}`);\n  }\n  const [c1, c2, c3, c4] = geohash4.split('');\n  return `${c1}/${c2}/${c3}/${c4}`;\n}\n\n/**\n * Compute all geohash cells along the path between two geohash cells.\n * Interpolates lat/lng points between the centers of `from` and `to`,\n * encoding each to a geohash at the given precision, and returns the\n * deduplicated list of intermediate cells (excluding `from` and `to`).\n */\nexport function getGeohashPath(from: string, to: string, precision = 4): string[] {\n  if (from === to) return [];\n\n  const fromCenter = decodeGeohash(from);\n  const toCenter = decodeGeohash(to);\n\n  // Compute approximate distance to determine step count\n  const dLat = Math.abs(toCenter.lat - fromCenter.lat);\n  const dLng = Math.abs(toCenter.lng - fromCenter.lng);\n  // Rough km: 1 degree lat ≈ 111km, 1 degree lng ≈ 111km * cos(midLat)\n  const midLatRad = ((fromCenter.lat + toCenter.lat) / 2) * (Math.PI / 180);\n  const approxKm = Math.sqrt((dLat * 111) ** 2 + (dLng * 111 * Math.cos(midLatRad)) ** 2);\n\n  // Step every ~15km to avoid skipping any geohash4 cell (~39x19km)\n  const steps = Math.max(2, Math.ceil(approxKm / 15));\n\n  const seen = new Set<string>();\n  seen.add(from);\n  seen.add(to);\n\n  const path: string[] = [];\n  for (let i = 1; i < steps; i++) {\n    const t = i / steps;\n    const lat = fromCenter.lat + t * (toCenter.lat - fromCenter.lat);\n    const lng = fromCenter.lng + t * (toCenter.lng - fromCenter.lng);\n    const hash = encodeGeohash(lat, lng, precision);\n    if (!seen.has(hash)) {\n      seen.add(hash);\n      path.push(hash);\n    }\n  }\n\n  return path;\n}\n\n/**\n * Check if a geohash cell overlaps with a bounding box.\n * Custom implementation (not available in ngeohash).\n */\nexport function geohashOverlapsBounds(\n  hash: string,\n  bounds: { north: number; south: number; east: number; west: number },\n): boolean {\n  const { lat, lng, latErr, lngErr } = decodeGeohash(hash);\n\n  const hashNorth = lat + latErr;\n  const hashSouth = lat - latErr;\n  const hashEast = lng + lngErr;\n  const hashWest = lng - lngErr;\n\n  return !(\n    hashNorth < bounds.south ||\n    hashSouth > bounds.north ||\n    hashEast < bounds.west ||\n    hashWest > bounds.east\n  );\n}\n\n// haversineDistance is now in shared/spatial/Haversine.ts (canonical location).\n// Re-export for backwards compatibility with existing imports.\nexport { haversineDistance } from './Haversine.js';\n"],"mappings":";AAgBO,SAAS,kBAAkB,MAAmB,IAAyB;AAC5E,QAAM,IAAI;AAEV,QAAM,OAAO,UAAU,GAAG,MAAM,KAAK,GAAG;AACxC,QAAM,OAAO,UAAU,GAAG,MAAM,KAAK,GAAG;AAExC,QAAM,IACJ,KAAK,IAAI,OAAO,CAAC,IAAI,KAAK,IAAI,OAAO,CAAC,IACtC,KAAK,IAAI,UAAU,KAAK,GAAG,CAAC,IAC1B,KAAK,IAAI,UAAU,GAAG,GAAG,CAAC,IAC1B,KAAK,IAAI,OAAO,CAAC,IACjB,KAAK,IAAI,OAAO,CAAC;AAErB,QAAM,IAAI,IAAI,KAAK,MAAM,KAAK,KAAK,CAAC,GAAG,KAAK,KAAK,IAAI,CAAC,CAAC;AAEvD,SAAO,IAAI;AACb;AASO,SAAS,iBAAiB,MAAmB,IAAyB;AAC3E,QAAM,OAAO,UAAU,GAAG,MAAM,KAAK,GAAG;AACxC,QAAM,OAAO,UAAU,KAAK,GAAG;AAC/B,QAAM,OAAO,UAAU,GAAG,GAAG;AAE7B,QAAM,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,IAAI;AACxC,QAAM,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,IAAI;AAE3F,QAAM,UAAU,KAAK,MAAM,GAAG,CAAC;AAC/B,UAAS,UAAU,MAAO,KAAK,KAAK,OAAO;AAC7C;AAKA,SAAS,UAAU,SAAyB;AAC1C,SAAQ,UAAU,KAAK,KAAM;AAC/B;;;AC1CA,OAAO,cAAc;AAMd,SAAS,cAAc,KAAa,KAAa,YAAY,GAAW;AAC7E,SAAO,SAAS,OAAO,KAAK,KAAK,SAAS;AAC5C;AAMO,SAAS,cAAc,MAK5B;AACA,QAAM,SAAS,SAAS,OAAO,IAAI;AACnC,SAAO;AAAA,IACL,KAAK,OAAO;AAAA,IACZ,KAAK,OAAO;AAAA,IACZ,QAAQ,OAAO,MAAM;AAAA,IACrB,QAAQ,OAAO,MAAM;AAAA,EACvB;AACF;AAOO,SAAS,aAAa,MAAwB;AACnD,SAAO,SAAS,UAAU,IAAI;AAChC;AAaO,SAAS,qBAAqB,UAA4B;AAC/D,MAAI,SAAS,WAAW,GAAG;AACzB,UAAM,IAAI,MAAM,sDAAsD,QAAQ,EAAE;AAAA,EAClF;AACA,QAAM,YAAY,aAAa,QAAQ;AACvC,SAAO,CAAC,UAAU,GAAG,SAAS;AAChC;AAMO,SAAS,iBAAiB,SAAiB,WAA2B;AAC3E,SAAO,QAAQ,MAAM,GAAG,SAAS;AACnC;AAcO,SAAS,0BAA0B,UAA0B;AAClE,MAAI,SAAS,WAAW,GAAG;AACzB,UAAM,IAAI,MAAM,2DAA2D,QAAQ,EAAE;AAAA,EACvF;AACA,QAAM,CAAC,IAAI,IAAI,IAAI,EAAE,IAAI,SAAS,MAAM,EAAE;AAC1C,SAAO,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE;AAChC;AAQO,SAAS,eAAe,MAAc,IAAY,YAAY,GAAa;AAChF,MAAI,SAAS,GAAI,QAAO,CAAC;AAEzB,QAAM,aAAa,cAAc,IAAI;AACrC,QAAM,WAAW,cAAc,EAAE;AAGjC,QAAM,OAAO,KAAK,IAAI,SAAS,MAAM,WAAW,GAAG;AACnD,QAAM,OAAO,KAAK,IAAI,SAAS,MAAM,WAAW,GAAG;AAEnD,QAAM,aAAc,WAAW,MAAM,SAAS,OAAO,KAAM,KAAK,KAAK;AACrE,QAAM,WAAW,KAAK,MAAM,OAAO,QAAQ,KAAK,OAAO,MAAM,KAAK,IAAI,SAAS,MAAM,CAAC;AAGtF,QAAM,QAAQ,KAAK,IAAI,GAAG,KAAK,KAAK,WAAW,EAAE,CAAC;AAElD,QAAM,OAAO,oBAAI,IAAY;AAC7B,OAAK,IAAI,IAAI;AACb,OAAK,IAAI,EAAE;AAEX,QAAM,OAAiB,CAAC;AACxB,WAAS,IAAI,GAAG,IAAI,OAAO,KAAK;AAC9B,UAAM,IAAI,IAAI;AACd,UAAM,MAAM,WAAW,MAAM,KAAK,SAAS,MAAM,WAAW;AAC5D,UAAM,MAAM,WAAW,MAAM,KAAK,SAAS,MAAM,WAAW;AAC5D,UAAM,OAAO,cAAc,KAAK,KAAK,SAAS;AAC9C,QAAI,CAAC,KAAK,IAAI,IAAI,GAAG;AACnB,WAAK,IAAI,IAAI;AACb,WAAK,KAAK,IAAI;AAAA,IAChB;AAAA,EACF;AAEA,SAAO;AACT;AAMO,SAAS,sBACd,MACA,QACS;AACT,QAAM,EAAE,KAAK,KAAK,QAAQ,OAAO,IAAI,cAAc,IAAI;AAEvD,QAAM,YAAY,MAAM;AACxB,QAAM,YAAY,MAAM;AACxB,QAAM,WAAW,MAAM;AACvB,QAAM,WAAW,MAAM;AAEvB,SAAO,EACL,YAAY,OAAO,SACnB,YAAY,OAAO,SACnB,WAAW,OAAO,QAClB,WAAW,OAAO;AAEtB;","names":[]}