geohash-kit 1.0.0

package/dist/coverage.js

@@ -0,0 +1,555 @@
+// geohash-kit/coverage — polygon-to-geohash coverage, GeoJSON, convex hull
+import { bounds as geohashBounds, children as geohashChildren } from './core.js';
+// --- Validation ---
+const BASE32 = '0123456789bcdefghjkmnpqrstuvwxyz';
+function validateGeohash(hash) {
+    for (const ch of hash) {
+        if (!BASE32.includes(ch)) {
+            throw new TypeError(`Invalid geohash character: '${ch}' in "${hash}"`);
+        }
+    }
+}
+// --- Point-in-polygon (ray-casting) ---
+/**
+ * Ray-casting algorithm: test whether a point [x, y] lies inside a polygon.
+ * Polygon is an array of [x, y] vertices (closed automatically).
+ */
+export function pointInPolygon(point, polygon) {
+    const [px, py] = point;
+    let inside = false;
+    for (let i = 0, j = polygon.length - 1; i < polygon.length; j = i++) {
+        const [xi, yi] = polygon[i];
+        const [xj, yj] = polygon[j];
+        if ((yi > py) !== (yj > py) && px < ((xj - xi) * (py - yi)) / (yj - yi) + xi) {
+            inside = !inside;
+        }
+    }
+    return inside;
+}
+/**
+ * Test whether all four corners of bounds lie inside the polygon.
+ */
+export function boundsFullyInsidePolygon(bounds, polygon) {
+    const corners = [
+        [bounds.minLon, bounds.minLat],
+        [bounds.maxLon, bounds.minLat],
+        [bounds.maxLon, bounds.maxLat],
+        [bounds.minLon, bounds.maxLat],
+    ];
+    if (!corners.every((c) => pointInPolygon(c, polygon)))
+        return false;
+    // For concave polygons, all corners can be inside while the polygon edge
+    // cuts through the cell. If any polygon edge intersects a cell edge, the
+    // cell is not fully inside.
+    const boundsEdges = [
+        [corners[0], corners[1]],
+        [corners[1], corners[2]],
+        [corners[2], corners[3]],
+        [corners[3], corners[0]],
+    ];
+    for (let i = 0, j = polygon.length - 1; i < polygon.length; j = i++) {
+        for (const be of boundsEdges) {
+            if (segmentsIntersect(be[0], be[1], polygon[j], polygon[i]))
+                return false;
+        }
+    }
+    return true;
+}
+/**
+ * Test whether a bounds rectangle overlaps a polygon at all.
+ * Checks: (1) any bounds corner inside polygon, (2) any polygon vertex inside bounds,
+ * (3) any edge intersection.
+ */
+export function boundsOverlapsPolygon(bounds, polygon) {
+    const corners = [
+        [bounds.minLon, bounds.minLat],
+        [bounds.maxLon, bounds.minLat],
+        [bounds.maxLon, bounds.maxLat],
+        [bounds.minLon, bounds.maxLat],
+    ];
+    // Any bounds corner inside polygon?
+    if (corners.some((c) => pointInPolygon(c, polygon)))
+        return true;
+    // Any polygon vertex inside bounds?
+    for (const [px, py] of polygon) {
+        if (px >= bounds.minLon && px <= bounds.maxLon && py >= bounds.minLat && py <= bounds.maxLat) {
+            return true;
+        }
+    }
+    // Check edge intersections between bounds edges and polygon edges
+    const boundsEdges = [
+        [corners[0], corners[1]],
+        [corners[1], corners[2]],
+        [corners[2], corners[3]],
+        [corners[3], corners[0]],
+    ];
+    for (let i = 0, j = polygon.length - 1; i < polygon.length; j = i++) {
+        const polyEdge = [polygon[j], polygon[i]];
+        for (const boundsEdge of boundsEdges) {
+            if (segmentsIntersect(boundsEdge[0], boundsEdge[1], polyEdge[0], polyEdge[1])) {
+                return true;
+            }
+        }
+    }
+    return false;
+}
+/** Test whether two line segments (a1->a2) and (b1->b2) intersect. */
+function segmentsIntersect(a1, a2, b1, b2) {
+    const d1 = cross(b1, b2, a1);
+    const d2 = cross(b1, b2, a2);
+    const d3 = cross(a1, a2, b1);
+    const d4 = cross(a1, a2, b2);
+    if (((d1 > 0 && d2 < 0) || (d1 < 0 && d2 > 0)) &&
+        ((d3 > 0 && d4 < 0) || (d3 < 0 && d4 > 0))) {
+        return true;
+    }
+    if (d1 === 0 && onSegment(b1, b2, a1))
+        return true;
+    if (d2 === 0 && onSegment(b1, b2, a2))
+        return true;
+    if (d3 === 0 && onSegment(a1, a2, b1))
+        return true;
+    if (d4 === 0 && onSegment(a1, a2, b2))
+        return true;
+    return false;
+}
+function cross(a, b, c) {
+    return (b[0] - a[0]) * (c[1] - a[1]) - (b[1] - a[1]) * (c[0] - a[0]);
+}
+function onSegment(a, b, p) {
+    return Math.min(a[0], b[0]) <= p[0] && p[0] <= Math.max(a[0], b[0]) &&
+        Math.min(a[1], b[1]) <= p[1] && p[1] <= Math.max(a[1], b[1]);
+}
+/** Strip closing vertex from a ring if it duplicates the first vertex. */
+function stripClosingVertex(ring) {
+    if (ring.length > 1 &&
+        ring[0][0] === ring[ring.length - 1][0] &&
+        ring[0][1] === ring[ring.length - 1][1]) {
+        return ring.slice(0, -1);
+    }
+    return ring;
+}
+/**
+ * Normalise a PolygonInput to a NormalisedPolygon with outer ring and holes.
+ * - `[number, number][]` → outer ring only, no holes
+ * - GeoJSON Polygon → outer ring + inner rings (holes) extracted
+ * - GeoJSON MultiPolygon → not handled here (caller processes each polygon separately)
+ */
+function normalisePolygonInput(input) {
+    if (Array.isArray(input)) {
+        return { outer: input, holes: [] };
+    }
+    if (input.type === 'Polygon') {
+        const ring = input.coordinates[0];
+        if (!ring || ring.length === 0) {
+            throw new Error('GeoJSON Polygon has no outer ring');
+        }
+        const outer = stripClosingVertex(ring);
+        // Extract inner rings (holes), stripping closing vertices and ignoring degenerate rings
+        const holes = [];
+        for (let i = 1; i < input.coordinates.length; i++) {
+            const holeRing = stripClosingVertex(input.coordinates[i]);
+            if (holeRing.length >= 3) {
+                holes.push(holeRing);
+            }
+        }
+        return { outer, holes };
+    }
+    throw new Error(`Unsupported input type: ${input.type}`);
+}
+/**
+ * Convert a polygon (array of [lon, lat] vertices) to an efficient set of
+ * multi-precision geohash strings using recursive subdivision.
+ *
+ * Edges always subdivide to maxPrecision for a tight boundary. Interior
+ * cells use the coarsest precision allowed by mergeThreshold. If the result
+ * exceeds maxCells, maxPrecision is stepped down until it fits.
+ *
+ * Throws RangeError if the polygon cannot be covered within maxCells at
+ * the given minPrecision.
+ *
+ * **Antimeridian:** polygons crossing ±180° longitude are not supported.
+ * Split at the antimeridian and cover each half separately.
+ */
+export function polygonToGeohashes(input, options = {}) {
+    // Parse and validate options upfront (shared by single and multi paths)
+    const { minPrecision: rawMin = 1, maxPrecision: rawMax = 9, maxCells = 500, mergeThreshold: rawThreshold = 1.0 } = options;
+    if (!Number.isFinite(rawMin))
+        throw new RangeError(`Invalid minPrecision: ${rawMin}`);
+    if (!Number.isFinite(rawMax))
+        throw new RangeError(`Invalid maxPrecision: ${rawMax}`);
+    if (!Number.isFinite(maxCells) || maxCells < 1)
+        throw new RangeError(`Invalid maxCells: ${maxCells}`);
+    if (!Number.isFinite(rawThreshold))
+        throw new RangeError(`Invalid mergeThreshold: ${rawThreshold}`);
+    const minPrecision = Math.max(1, Math.min(9, Math.round(rawMin)));
+    const maxPrecision = Math.max(minPrecision, Math.min(9, Math.round(rawMax)));
+    const threshold = Math.max(0, Math.min(1, rawThreshold));
+    // Handle MultiPolygon: global maxCells cap across all child polygons
+    if (!Array.isArray(input) && input.type === 'MultiPolygon') {
+        if (input.coordinates.length === 0)
+            return [];
+        // Normalise all children upfront
+        const children = input.coordinates.map((polyCoords) => normalisePolygonInput({ type: 'Polygon', coordinates: polyCoords }));
+        // Validate all children before computing
+        for (const { outer } of children) {
+            if (outer.length < 3) {
+                throw new Error('Polygon must have at least 3 vertices');
+            }
+            for (let i = 0; i < outer.length; i++) {
+                const j = (i + 1) % outer.length;
+                if (Math.abs(outer[i][0] - outer[j][0]) > 180) {
+                    throw new Error('Polygons crossing the antimeridian (±180° longitude) are not supported');
+                }
+            }
+        }
+        // Retry loop from maxPrecision down to minPrecision
+        const bailout = maxCells * 4;
+        for (let mp = maxPrecision; mp >= minPrecision; mp--) {
+            const allHashes = [];
+            let bailed = false;
+            for (const { outer, holes } of children) {
+                const result = computeGeohashes(outer, holes, minPrecision, mp, threshold, bailout);
+                if (result === null) {
+                    bailed = true;
+                    break;
+                }
+                allHashes.push(...result);
+            }
+            if (bailed)
+                continue;
+            const merged = deduplicateGeohashes(allHashes);
+            if (merged.length <= maxCells)
+                return merged;
+        }
+        // Fallback: minPrecision with threshold=0
+        const fallbackAll = [];
+        for (const { outer, holes } of children) {
+            const result = computeGeohashes(outer, holes, minPrecision, minPrecision, 0) ?? [];
+            fallbackAll.push(...result);
+        }
+        const fallback = deduplicateGeohashes(fallbackAll);
+        if (fallback.length <= maxCells)
+            return fallback;
+        throw new RangeError(`MultiPolygon requires at least ${fallback.length} cells at precision ${minPrecision}, but maxCells is ${maxCells}. ` +
+            'Increase maxCells or reduce the polygon area.');
+    }
+    const { outer: polygon, holes } = normalisePolygonInput(input);
+    // Guard: degenerate polygons
+    if (polygon.length < 3) {
+        throw new Error('Polygon must have at least 3 vertices');
+    }
+    // Guard: antimeridian-crossing polygons are not supported
+    for (let i = 0; i < polygon.length; i++) {
+        const j = (i + 1) % polygon.length;
+        if (Math.abs(polygon[i][0] - polygon[j][0]) > 180) {
+            throw new Error('Polygons crossing the antimeridian (±180° longitude) are not supported');
+        }
+    }
+    // Guard: all coordinates must be within valid geographic bounds
+    for (const [lon, lat] of polygon) {
+        if (!Number.isFinite(lat) || lat < -90 || lat > 90) {
+            throw new RangeError(`Invalid latitude in polygon: ${lat}`);
+        }
+        if (!Number.isFinite(lon) || lon < -180 || lon > 180) {
+            throw new RangeError(`Invalid longitude in polygon: ${lon}`);
+        }
+    }
+    for (const hole of holes) {
+        for (const [lon, lat] of hole) {
+            if (!Number.isFinite(lat) || lat < -90 || lat > 90) {
+                throw new RangeError(`Invalid latitude in hole: ${lat}`);
+            }
+            if (!Number.isFinite(lon) || lon < -180 || lon > 180) {
+                throw new RangeError(`Invalid longitude in hole: ${lon}`);
+            }
+        }
+    }
+    // Early bailout limit
+    const bailout = maxCells * 4;
+    // Try at requested maxPrecision, stepping down if too many cells
+    for (let mp = maxPrecision; mp >= minPrecision; mp--) {
+        const result = computeGeohashes(polygon, holes, minPrecision, mp, threshold, bailout);
+        if (result !== null && result.length <= maxCells)
+            return result;
+    }
+    // Fallback: minPrecision with threshold=0
+    const fallback = computeGeohashes(polygon, holes, minPrecision, minPrecision, 0) ?? [];
+    if (fallback.length <= maxCells)
+        return fallback;
+    throw new RangeError(`Polygon requires at least ${fallback.length} cells at precision ${minPrecision}, but maxCells is ${maxCells}. ` +
+        'Increase maxCells or reduce the polygon area.');
+}
+/**
+ * Compute geohashes covering a polygon via greedy recursive subdivision.
+ *
+ * - Edges always subdivide to maxPrecision (tight boundary).
+ * - Interior cells emit at the coarsest precision allowed by coverageThreshold.
+ *   threshold 1.0 → interior at maxPrecision (uniform cells, most cells).
+ *   threshold 0.0 → interior at minPrecision (coarsest blocks, fewest cells).
+ * - Only fully-inside cells are emitted below maxPrecision, so no blocks
+ *   extend outside the polygon boundary.
+ */
+function computeGeohashes(polygon, holes, minPrecision, maxPrecision, coverageThreshold, bailout) {
+    const result = [];
+    const limit = bailout ?? Infinity;
+    const hasHoles = holes.length > 0;
+    // Pre-compute polygon AABB for fast rejection.
+    let polyMinLon = Infinity, polyMaxLon = -Infinity;
+    let polyMinLat = Infinity, polyMaxLat = -Infinity;
+    for (const [lon, lat] of polygon) {
+        if (lon < polyMinLon)
+            polyMinLon = lon;
+        if (lon > polyMaxLon)
+            polyMaxLon = lon;
+        if (lat < polyMinLat)
+            polyMinLat = lat;
+        if (lat > polyMaxLat)
+            polyMaxLat = lat;
+    }
+    /**
+     * Check if bounds are fully inside the outer polygon and not fully inside any hole.
+     * A cell is "fully inside" the effective polygon when:
+     * - all corners are inside the outer ring, AND
+     * - the cell does not overlap any hole
+     */
+    const isFullyInside = (b) => {
+        if (!boundsFullyInsidePolygon(b, polygon))
+            return false;
+        if (hasHoles) {
+            for (const hole of holes) {
+                if (boundsOverlapsPolygon(b, hole))
+                    return false;
+            }
+        }
+        return true;
+    };
+    /**
+     * Check if bounds overlap the effective polygon (outer minus holes).
+     * A cell overlaps when it overlaps the outer ring AND is not fully inside any hole.
+     */
+    const doesOverlap = (b) => {
+        if (!boundsOverlapsPolygon(b, polygon))
+            return false;
+        if (hasHoles) {
+            for (const hole of holes) {
+                if (boundsFullyInsidePolygon(b, hole))
+                    return false;
+            }
+        }
+        return true;
+    };
+    // Interior cells must reach at least this precision before being emitted.
+    // At threshold 1.0 → all cells at maxPrecision (uniform).
+    // At threshold 0.0 → interior cells as coarse as minPrecision.
+    const interiorMinPrecision = Math.ceil(minPrecision + (maxPrecision - minPrecision) * coverageThreshold);
+    // Seed: precision-1 cells filtered by AABB then polygon overlap.
+    const queue = geohashChildren('').filter((hash) => {
+        const b = geohashBounds(hash);
+        if (b.maxLon < polyMinLon || b.minLon > polyMaxLon ||
+            b.maxLat < polyMinLat || b.minLat > polyMaxLat)
+            return false;
+        return doesOverlap(b);
+    });
+    while (queue.length > 0) {
+        const hash = queue.pop();
+        const b = geohashBounds(hash);
+        if (isFullyInside(b)) {
+            if (hash.length >= interiorMinPrecision) {
+                result.push(hash);
+            }
+            else {
+                for (const child of geohashChildren(hash)) {
+                    queue.push(child);
+                }
+            }
+        }
+        else if (hash.length >= maxPrecision) {
+            // At max precision: only emit if it overlaps the effective polygon
+            if (doesOverlap(b)) {
+                result.push(hash);
+            }
+        }
+        else {
+            for (const child of geohashChildren(hash)) {
+                const cb = geohashBounds(child);
+                // Fast AABB rejection before expensive polygon checks
+                if (cb.maxLon < polyMinLon || cb.minLon > polyMaxLon ||
+                    cb.maxLat < polyMinLat || cb.minLat > polyMaxLat)
+                    continue;
+                if (isFullyInside(cb)) {
+                    if (child.length >= interiorMinPrecision) {
+                        result.push(child);
+                    }
+                    else {
+                        queue.push(child);
+                    }
+                }
+                else if (doesOverlap(cb)) {
+                    queue.push(child);
+                }
+            }
+        }
+        if (result.length > limit)
+            return null;
+    }
+    // Map coverageThreshold to merge aggressiveness:
+    // threshold 1.0 (tight) → require all 32 siblings (exact boundary)
+    // threshold 0.0 (loose) → require only 24 siblings (aggressive merge, fewer cells)
+    const minSiblings = Math.round(24 + coverageThreshold * 8);
+    return mergeCompleteSiblings(result, minPrecision, minSiblings).sort();
+}
+/**
+ * Post-processing merge: bottom-up consolidation of sibling sets.
+ * When at least `minSiblings` of 32 children of a parent are present,
+ * replace them with the parent. With `minSiblings < 32` this trades a
+ * tiny boundary overshoot for a significantly smaller result array.
+ * Iterates from finest to coarsest so merges can cascade.
+ */
+function mergeCompleteSiblings(hashes, minPrecision, minSiblings = 30) {
+    const set = new Set(hashes);
+    let maxP = 0;
+    for (const h of set) {
+        if (h.length > maxP)
+            maxP = h.length;
+    }
+    for (let p = maxP; p > minPrecision; p--) {
+        const parentCounts = new Map();
+        for (const h of set) {
+            if (h.length === p) {
+                const parent = h.slice(0, -1);
+                parentCounts.set(parent, (parentCounts.get(parent) ?? 0) + 1);
+            }
+        }
+        for (const [parent, count] of parentCounts) {
+            if (count >= minSiblings) {
+                // Near-complete or complete — replace children with parent
+                for (const ch of geohashChildren(parent)) {
+                    set.delete(ch);
+                }
+                set.add(parent);
+            }
+        }
+    }
+    return Array.from(set);
+}
+// --- geohashesToConvexHull — reconstruct editable polygon ---
+/** 2D cross product of vectors OA and OB where O is the origin. */
+function cross2D(o, a, b) {
+    return (a[0] - o[0]) * (b[1] - o[1]) - (a[1] - o[1]) * (b[0] - o[0]);
+}
+/**
+ * Compute a convex hull polygon from an array of geohash strings.
+ * Collects all unique cell corners, then builds the hull using
+ * Andrew's monotone chain algorithm.
+ * Returns `[lon, lat][]`.
+ *
+ * **Antimeridian:** throws if the input hashes straddle ±180° longitude.
+ * Dateline-crossing hulls cannot be consumed by planar geometry functions
+ * (`pointInPolygon`, `polygonToGeohashes`). Split hash sets at the
+ * antimeridian and compute separate hulls for each side.
+ */
+export function geohashesToConvexHull(hashes) {
+    if (hashes.length === 0)
+        return [];
+    // Collect unique corners from all geohash bounding boxes
+    const seen = new Set();
+    const points = [];
+    for (const hash of hashes) {
+        const b = geohashBounds(hash);
+        const corners = [
+            [b.minLon, b.minLat],
+            [b.maxLon, b.minLat],
+            [b.maxLon, b.maxLat],
+            [b.minLon, b.maxLat],
+        ];
+        for (const c of corners) {
+            const key = `${c[0]},${c[1]}`;
+            if (!seen.has(key)) {
+                seen.add(key);
+                points.push(c);
+            }
+        }
+    }
+    if (points.length < 3)
+        return points;
+    // Guard: antimeridian-straddling hashes produce hulls that break planar geometry
+    const lons = points.map(p => p[0]);
+    if (Math.max(...lons) - Math.min(...lons) > 180) {
+        throw new Error('Geohashes straddle the antimeridian (±180° longitude). ' +
+            'Split into separate sets and compute hulls independently.');
+    }
+    // Sort by x then y
+    points.sort((a, b) => a[0] - b[0] || a[1] - b[1]);
+    // Andrew's monotone chain — lower hull
+    const lower = [];
+    for (const p of points) {
+        while (lower.length >= 2 && cross2D(lower[lower.length - 2], lower[lower.length - 1], p) <= 0) {
+            lower.pop();
+        }
+        lower.push(p);
+    }
+    // Upper hull
+    const upper = [];
+    for (let i = points.length - 1; i >= 0; i--) {
+        const p = points[i];
+        while (upper.length >= 2 && cross2D(upper[upper.length - 2], upper[upper.length - 1], p) <= 0) {
+            upper.pop();
+        }
+        upper.push(p);
+    }
+    // Remove last point of each half because it's repeated
+    lower.pop();
+    upper.pop();
+    return [...lower, ...upper];
+}
+/**
+ * Remove redundant geohashes and merge sibling groups.
+ * 1. Remove any geohash whose ancestor (shorter prefix) is already in the set.
+ * 2. Merge sibling sets bottom-up — exact (all 32) by default, or
+ *    near-complete (≥30/32) when `lossy: true`.
+ */
+export function deduplicateGeohashes(hashes, options = {}) {
+    // Validate all input hashes
+    for (const h of hashes)
+        validateGeohash(h);
+    // Step 1: remove children when ancestor is present
+    const set = new Set(hashes);
+    const filtered = Array.from(set).filter((h) => {
+        for (let len = 1; len < h.length; len++) {
+            if (set.has(h.slice(0, len)))
+                return false;
+        }
+        return true;
+    });
+    // Step 2: merge sibling groups bottom-up
+    const minSiblings = options.lossy ? 30 : 32;
+    return mergeCompleteSiblings(filtered, 1, minSiblings).sort();
+}
+/**
+ * Convert an array of geohash strings to a GeoJSON FeatureCollection
+ * of polygon rectangles, suitable for rendering on a MapLibre map.
+ */
+export function geohashesToGeoJSON(hashes) {
+    return {
+        type: 'FeatureCollection',
+        features: hashes.map((hash) => {
+            const b = geohashBounds(hash);
+            return {
+                type: 'Feature',
+                geometry: {
+                    type: 'Polygon',
+                    coordinates: [[
+                            [b.minLon, b.minLat],
+                            [b.maxLon, b.minLat],
+                            [b.maxLon, b.maxLat],
+                            [b.minLon, b.maxLat],
+                            [b.minLon, b.minLat],
+                        ]],
+                },
+                properties: { geohash: hash, precision: hash.length },
+            };
+        }),
+    };
+}
+//# sourceMappingURL=coverage.js.map

package/dist/coverage.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"coverage.js","sourceRoot":"","sources":["../src/coverage.ts"],"names":[],"mappings":"AAAA,2EAA2E;AAE3E,OAAO,EAAE,MAAM,IAAI,aAAa,EAAE,QAAQ,IAAI,eAAe,EAAE,MAAM,WAAW,CAAA;AAQhF,qBAAqB;AAErB,MAAM,MAAM,GAAG,kCAAkC,CAAA;AAEjD,SAAS,eAAe,CAAC,IAAY;IACnC,KAAK,MAAM,EAAE,IAAI,IAAI,EAAE,CAAC;QACtB,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC;YACzB,MAAM,IAAI,SAAS,CAAC,+BAA+B,EAAE,SAAS,IAAI,GAAG,CAAC,CAAA;QACxE,CAAC;IACH,CAAC;AACH,CAAC;AAED,yCAAyC;AAEzC;;;GAGG;AACH,MAAM,UAAU,cAAc,CAC5B,KAAuB,EACvB,OAA2B;IAE3B,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,KAAK,CAAA;IACtB,IAAI,MAAM,GAAG,KAAK,CAAA;IAElB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC;QACpE,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;QAC3B,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;QAE3B,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,EAAE,GAAG,EAAE,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC;YAC7E,MAAM,GAAG,CAAC,MAAM,CAAA;QAClB,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAA;AACf,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,wBAAwB,CACtC,MAAqB,EACrB,OAA2B;IAE3B,MAAM,OAAO,GAAuB;QAClC,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC;QAC9B,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC;QAC9B,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC;QAC9B,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC;KAC/B,CAAA;IACD,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,cAAc,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;QAAE,OAAO,KAAK,CAAA;IAEnE,yEAAyE;IACzE,yEAAyE;IACzE,4BAA4B;IAC5B,MAAM,WAAW,GAA2C;QAC1D,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;QACxB,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;QACxB,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;QACxB,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;KACzB,CAAA;IACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC;QACpE,KAAK,MAAM,EAAE,IAAI,WAAW,EAAE,CAAC;YAC7B,IAAI,iBAAiB,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAA;QAC3E,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAA;AACb,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,qBAAqB,CACnC,MAAqB,EACrB,OAA2B;IAE3B,MAAM,OAAO,GAAuB;QAClC,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC;QAC9B,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC;QAC9B,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC;QAC9B,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC;KAC/B,CAAA;IAED,oCAAoC;IACpC,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,cAAc,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;QAAE,OAAO,IAAI,CAAA;IAEhE,oCAAoC;IACpC,KAAK,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,OAAO,EAAE,CAAC;QAC/B,IAAI,EAAE,IAAI,MAAM,CAAC,MAAM,IAAI,EAAE,IAAI,MAAM,CAAC,MAAM,IAAI,EAAE,IAAI,MAAM,CAAC,MAAM,IAAI,EAAE,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;YAC7F,OAAO,IAAI,CAAA;QACb,CAAC;IACH,CAAC;IAED,kEAAkE;IAClE,MAAM,WAAW,GAA2C;QAC1D,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;QACxB,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;QACxB,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;QACxB,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;KACzB,CAAA;IAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC;QACpE,MAAM,QAAQ,GAAyC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAA;QAC/E,KAAK,MAAM,UAAU,IAAI,WAAW,EAAE,CAAC;YACrC,IAAI,iBAAiB,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC9E,OAAO,IAAI,CAAA;YACb,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAA;AACd,CAAC;AAED,sEAAsE;AACtE,SAAS,iBAAiB,CACxB,EAAoB,EAAE,EAAoB,EAC1C,EAAoB,EAAE,EAAoB;IAE1C,MAAM,EAAE,GAAG,KAAK,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAA;IAC5B,MAAM,EAAE,GAAG,KAAK,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAA;IAC5B,MAAM,EAAE,GAAG,KAAK,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAA;IAC5B,MAAM,EAAE,GAAG,KAAK,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAA;IAE5B,IAAI,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC;QAC1C,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;QAC/C,OAAO,IAAI,CAAA;IACb,CAAC;IAED,IAAI,EAAE,KAAK,CAAC,IAAI,SAAS,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC;QAAE,OAAO,IAAI,CAAA;IAClD,IAAI,EAAE,KAAK,CAAC,IAAI,SAAS,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC;QAAE,OAAO,IAAI,CAAA;IAClD,IAAI,EAAE,KAAK,CAAC,IAAI,SAAS,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC;QAAE,OAAO,IAAI,CAAA;IAClD,IAAI,EAAE,KAAK,CAAC,IAAI,SAAS,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC;QAAE,OAAO,IAAI,CAAA;IAElD,OAAO,KAAK,CAAA;AACd,CAAC;AAED,SAAS,KAAK,CAAC,CAAmB,EAAE,CAAmB,EAAE,CAAmB;IAC1E,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;AACtE,CAAC;AAED,SAAS,SAAS,CAAC,CAAmB,EAAE,CAAmB,EAAE,CAAmB;IAC9E,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5D,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;AACrE,CAAC;AAiBD,0EAA0E;AAC1E,SAAS,kBAAkB,CAAC,IAAwB;IAClD,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;QACf,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACvC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAC5C,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;IAC1B,CAAC;IACD,OAAO,IAAI,CAAA;AACb,CAAC;AAED;;;;;GAKG;AACH,SAAS,qBAAqB,CAAC,KAAmB;IAChD,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,EAAE,CAAA;IACpC,CAAC;IACD,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;QAC7B,MAAM,IAAI,GAAG,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,CAAA;QACjC,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC/B,MAAM,IAAI,KAAK,CAAC,mCAAmC,CAAC,CAAA;QACtD,CAAC;QACD,MAAM,KAAK,GAAG,kBAAkB,CAAC,IAA0B,CAAC,CAAA;QAC5D,wFAAwF;QACxF,MAAM,KAAK,GAAyB,EAAE,CAAA;QACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAClD,MAAM,QAAQ,GAAG,kBAAkB,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,CAAuB,CAAC,CAAA;YAC/E,IAAI,QAAQ,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;gBACzB,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;YACtB,CAAC;QACH,CAAC;QACD,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAA;IACzB,CAAC;IACD,MAAM,IAAI,KAAK,CAAC,2BAA4B,KAA0B,CAAC,IAAI,EAAE,CAAC,CAAA;AAChF,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,kBAAkB,CAChC,KAAmB,EACnB,UAA2B,EAAE;IAE7B,wEAAwE;IACxE,MAAM,EAAE,YAAY,EAAE,MAAM,GAAG,CAAC,EAAE,YAAY,EAAE,MAAM,GAAG,CAAC,EAAE,QAAQ,GAAG,GAAG,EAAE,cAAc,EAAE,YAAY,GAAG,GAAG,EAAE,GAAG,OAAO,CAAA;IAC1H,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC;QAAE,MAAM,IAAI,UAAU,CAAC,yBAAyB,MAAM,EAAE,CAAC,CAAA;IACrF,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC;QAAE,MAAM,IAAI,UAAU,CAAC,yBAAyB,MAAM,EAAE,CAAC,CAAA;IACrF,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,QAAQ,GAAG,CAAC;QAAE,MAAM,IAAI,UAAU,CAAC,qBAAqB,QAAQ,EAAE,CAAC,CAAA;IACrG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,YAAY,CAAC;QAAE,MAAM,IAAI,UAAU,CAAC,2BAA2B,YAAY,EAAE,CAAC,CAAA;IACnG,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;IACjE,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;IAC5E,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC,CAAA;IAExD,qEAAqE;IACrE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,IAAI,KAAK,cAAc,EAAE,CAAC;QAC3D,IAAI,KAAK,CAAC,WAAW,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAA;QAE7C,iCAAiC;QACjC,MAAM,QAAQ,GAAG,KAAK,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,UAAU,EAAE,EAAE,CACpD,qBAAqB,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,WAAW,EAAE,UAAU,EAAE,CAAC,CACpE,CAAA;QAED,yCAAyC;QACzC,KAAK,MAAM,EAAE,KAAK,EAAE,IAAI,QAAQ,EAAE,CAAC;YACjC,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACrB,MAAM,IAAI,KAAK,CAAC,uCAAuC,CAAC,CAAA;YAC1D,CAAC;YACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACtC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,CAAA;gBAChC,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,EAAE,CAAC;oBAC9C,MAAM,IAAI,KAAK,CAAC,wEAAwE,CAAC,CAAA;gBAC3F,CAAC;YACH,CAAC;QACH,CAAC;QAED,oDAAoD;QACpD,MAAM,OAAO,GAAG,QAAQ,GAAG,CAAC,CAAA;QAC5B,KAAK,IAAI,EAAE,GAAG,YAAY,EAAE,EAAE,IAAI,YAAY,EAAE,EAAE,EAAE,EAAE,CAAC;YACrD,MAAM,SAAS,GAAa,EAAE,CAAA;YAC9B,IAAI,MAAM,GAAG,KAAK,CAAA;YAClB,KAAK,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,QAAQ,EAAE,CAAC;gBACxC,MAAM,MAAM,GAAG,gBAAgB,CAAC,KAAK,EAAE,KAAK,EAAE,YAAY,EAAE,EAAE,EAAE,SAAS,EAAE,OAAO,CAAC,CAAA;gBACnF,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;oBAAC,MAAM,GAAG,IAAI,CAAC;oBAAC,MAAK;gBAAC,CAAC;gBAC7C,SAAS,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,CAAA;YAC3B,CAAC;YACD,IAAI,MAAM;gBAAE,SAAQ;YACpB,MAAM,MAAM,GAAG,oBAAoB,CAAC,SAAS,CAAC,CAAA;YAC9C,IAAI,MAAM,CAAC,MAAM,IAAI,QAAQ;gBAAE,OAAO,MAAM,CAAA;QAC9C,CAAC;QAED,0CAA0C;QAC1C,MAAM,WAAW,GAAa,EAAE,CAAA;QAChC,KAAK,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,QAAQ,EAAE,CAAC;YACxC,MAAM,MAAM,GAAG,gBAAgB,CAAC,KAAK,EAAE,KAAK,EAAE,YAAY,EAAE,YAAY,EAAE,CAAC,CAAC,IAAI,EAAE,CAAA;YAClF,WAAW,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,CAAA;QAC7B,CAAC;QACD,MAAM,QAAQ,GAAG,oBAAoB,CAAC,WAAW,CAAC,CAAA;QAClD,IAAI,QAAQ,CAAC,MAAM,IAAI,QAAQ;YAAE,OAAO,QAAQ,CAAA;QAEhD,MAAM,IAAI,UAAU,CAClB,kCAAkC,QAAQ,CAAC,MAAM,uBAAuB,YAAY,qBAAqB,QAAQ,IAAI;YACrH,+CAA+C,CAChD,CAAA;IACH,CAAC;IAED,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,GAAG,qBAAqB,CAAC,KAAK,CAAC,CAAA;IAE9D,6BAA6B;IAC7B,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACvB,MAAM,IAAI,KAAK,CAAC,uCAAuC,CAAC,CAAA;IAC1D,CAAC;IAED,0DAA0D;IAC1D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,MAAM,CAAA;QAClC,IAAI,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,EAAE,CAAC;YAClD,MAAM,IAAI,KAAK,CAAC,wEAAwE,CAAC,CAAA;QAC3F,CAAC;IACH,CAAC;IAED,gEAAgE;IAChE,KAAK,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,OAAO,EAAE,CAAC;QACjC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,GAAG,GAAG,CAAC,EAAE,IAAI,GAAG,GAAG,EAAE,EAAE,CAAC;YACnD,MAAM,IAAI,UAAU,CAAC,gCAAgC,GAAG,EAAE,CAAC,CAAA;QAC7D,CAAC;QACD,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,GAAG,GAAG,CAAC,GAAG,IAAI,GAAG,GAAG,GAAG,EAAE,CAAC;YACrD,MAAM,IAAI,UAAU,CAAC,iCAAiC,GAAG,EAAE,CAAC,CAAA;QAC9D,CAAC;IACH,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,KAAK,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,IAAI,EAAE,CAAC;YAC9B,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,GAAG,GAAG,CAAC,EAAE,IAAI,GAAG,GAAG,EAAE,EAAE,CAAC;gBACnD,MAAM,IAAI,UAAU,CAAC,6BAA6B,GAAG,EAAE,CAAC,CAAA;YAC1D,CAAC;YACD,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,GAAG,GAAG,CAAC,GAAG,IAAI,GAAG,GAAG,GAAG,EAAE,CAAC;gBACrD,MAAM,IAAI,UAAU,CAAC,8BAA8B,GAAG,EAAE,CAAC,CAAA;YAC3D,CAAC;QACH,CAAC;IACH,CAAC;IAED,sBAAsB;IACtB,MAAM,OAAO,GAAG,QAAQ,GAAG,CAAC,CAAA;IAE5B,iEAAiE;IACjE,KAAK,IAAI,EAAE,GAAG,YAAY,EAAE,EAAE,IAAI,YAAY,EAAE,EAAE,EAAE,EAAE,CAAC;QACrD,MAAM,MAAM,GAAG,gBAAgB,CAAC,OAAO,EAAE,KAAK,EAAE,YAAY,EAAE,EAAE,EAAE,SAAS,EAAE,OAAO,CAAC,CAAA;QACrF,IAAI,MAAM,KAAK,IAAI,IAAI,MAAM,CAAC,MAAM,IAAI,QAAQ;YAAE,OAAO,MAAM,CAAA;IACjE,CAAC;IAED,0CAA0C;IAC1C,MAAM,QAAQ,GAAG,gBAAgB,CAAC,OAAO,EAAE,KAAK,EAAE,YAAY,EAAE,YAAY,EAAE,CAAC,CAAC,IAAI,EAAE,CAAA;IACtF,IAAI,QAAQ,CAAC,MAAM,IAAI,QAAQ;QAAE,OAAO,QAAQ,CAAA;IAEhD,MAAM,IAAI,UAAU,CAClB,6BAA6B,QAAQ,CAAC,MAAM,uBAAuB,YAAY,qBAAqB,QAAQ,IAAI;QAChH,+CAA+C,CAChD,CAAA;AACH,CAAC;AAED;;;;;;;;;GASG;AACH,SAAS,gBAAgB,CACvB,OAA2B,EAC3B,KAA2B,EAC3B,YAAoB,EACpB,YAAoB,EACpB,iBAAyB,EACzB,OAAgB;IAEhB,MAAM,MAAM,GAAa,EAAE,CAAA;IAC3B,MAAM,KAAK,GAAG,OAAO,IAAI,QAAQ,CAAA;IACjC,MAAM,QAAQ,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAA;IAEjC,+CAA+C;IAC/C,IAAI,UAAU,GAAG,QAAQ,EAAE,UAAU,GAAG,CAAC,QAAQ,CAAA;IACjD,IAAI,UAAU,GAAG,QAAQ,EAAE,UAAU,GAAG,CAAC,QAAQ,CAAA;IACjD,KAAK,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,OAAO,EAAE,CAAC;QACjC,IAAI,GAAG,GAAG,UAAU;YAAE,UAAU,GAAG,GAAG,CAAA;QACtC,IAAI,GAAG,GAAG,UAAU;YAAE,UAAU,GAAG,GAAG,CAAA;QACtC,IAAI,GAAG,GAAG,UAAU;YAAE,UAAU,GAAG,GAAG,CAAA;QACtC,IAAI,GAAG,GAAG,UAAU;YAAE,UAAU,GAAG,GAAG,CAAA;IACxC,CAAC;IAED;;;;;OAKG;IACH,MAAM,aAAa,GAAG,CAAC,CAAgB,EAAW,EAAE;QAClD,IAAI,CAAC,wBAAwB,CAAC,CAAC,EAAE,OAAO,CAAC;YAAE,OAAO,KAAK,CAAA;QACvD,IAAI,QAAQ,EAAE,CAAC;YACb,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,IAAI,qBAAqB,CAAC,CAAC,EAAE,IAAI,CAAC;oBAAE,OAAO,KAAK,CAAA;YAClD,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAA;IACb,CAAC,CAAA;IAED;;;OAGG;IACH,MAAM,WAAW,GAAG,CAAC,CAAgB,EAAW,EAAE;QAChD,IAAI,CAAC,qBAAqB,CAAC,CAAC,EAAE,OAAO,CAAC;YAAE,OAAO,KAAK,CAAA;QACpD,IAAI,QAAQ,EAAE,CAAC;YACb,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,IAAI,wBAAwB,CAAC,CAAC,EAAE,IAAI,CAAC;oBAAE,OAAO,KAAK,CAAA;YACrD,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAA;IACb,CAAC,CAAA;IAED,0EAA0E;IAC1E,0DAA0D;IAC1D,+DAA+D;IAC/D,MAAM,oBAAoB,GAAG,IAAI,CAAC,IAAI,CACpC,YAAY,GAAG,CAAC,YAAY,GAAG,YAAY,CAAC,GAAG,iBAAiB,CACjE,CAAA;IAED,iEAAiE;IACjE,MAAM,KAAK,GAAG,eAAe,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE;QAChD,MAAM,CAAC,GAAG,aAAa,CAAC,IAAI,CAAC,CAAA;QAC7B,IAAI,CAAC,CAAC,MAAM,GAAG,UAAU,IAAI,CAAC,CAAC,MAAM,GAAG,UAAU;YAC9C,CAAC,CAAC,MAAM,GAAG,UAAU,IAAI,CAAC,CAAC,MAAM,GAAG,UAAU;YAAE,OAAO,KAAK,CAAA;QAChE,OAAO,WAAW,CAAC,CAAC,CAAC,CAAA;IACvB,CAAC,CAAC,CAAA;IAEF,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,EAAG,CAAA;QACzB,MAAM,CAAC,GAAG,aAAa,CAAC,IAAI,CAAC,CAAA;QAE7B,IAAI,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC;YACrB,IAAI,IAAI,CAAC,MAAM,IAAI,oBAAoB,EAAE,CAAC;gBACxC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YACnB,CAAC;iBAAM,CAAC;gBACN,KAAK,MAAM,KAAK,IAAI,eAAe,CAAC,IAAI,CAAC,EAAE,CAAC;oBAC1C,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;gBACnB,CAAC;YACH,CAAC;QACH,CAAC;aAAM,IAAI,IAAI,CAAC,MAAM,IAAI,YAAY,EAAE,CAAC;YACvC,mEAAmE;YACnE,IAAI,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC;gBACnB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YACnB,CAAC;QACH,CAAC;aAAM,CAAC;YACN,KAAK,MAAM,KAAK,IAAI,eAAe,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC1C,MAAM,EAAE,GAAG,aAAa,CAAC,KAAK,CAAC,CAAA;gBAC/B,sDAAsD;gBACtD,IAAI,EAAE,CAAC,MAAM,GAAG,UAAU,IAAI,EAAE,CAAC,MAAM,GAAG,UAAU;oBAChD,EAAE,CAAC,MAAM,GAAG,UAAU,IAAI,EAAE,CAAC,MAAM,GAAG,UAAU;oBAAE,SAAQ;gBAC9D,IAAI,aAAa,CAAC,EAAE,CAAC,EAAE,CAAC;oBACtB,IAAI,KAAK,CAAC,MAAM,IAAI,oBAAoB,EAAE,CAAC;wBACzC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;oBACpB,CAAC;yBAAM,CAAC;wBACN,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;oBACnB,CAAC;gBACH,CAAC;qBAAM,IAAI,WAAW,CAAC,EAAE,CAAC,EAAE,CAAC;oBAC3B,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;gBACnB,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,MAAM,CAAC,MAAM,GAAG,KAAK;YAAE,OAAO,IAAI,CAAA;IACxC,CAAC;IAED,iDAAiD;IACjD,mEAAmE;IACnE,mFAAmF;IACnF,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,iBAAiB,GAAG,CAAC,CAAC,CAAA;IAE1D,OAAO,qBAAqB,CAAC,MAAM,EAAE,YAAY,EAAE,WAAW,CAAC,CAAC,IAAI,EAAE,CAAA;AACxE,CAAC;AAED;;;;;;GAMG;AACH,SAAS,qBAAqB,CAAC,MAAgB,EAAE,YAAoB,EAAE,WAAW,GAAG,EAAE;IACrF,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,CAAA;IAC3B,IAAI,IAAI,GAAG,CAAC,CAAA;IACZ,KAAK,MAAM,CAAC,IAAI,GAAG,EAAE,CAAC;QACpB,IAAI,CAAC,CAAC,MAAM,GAAG,IAAI;YAAE,IAAI,GAAG,CAAC,CAAC,MAAM,CAAA;IACtC,CAAC;IAED,KAAK,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,MAAM,YAAY,GAAG,IAAI,GAAG,EAAkB,CAAA;QAC9C,KAAK,MAAM,CAAC,IAAI,GAAG,EAAE,CAAC;YACpB,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACnB,MAAM,MAAM,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;gBAC7B,YAAY,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;YAC/D,CAAC;QACH,CAAC;QAED,KAAK,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,IAAI,YAAY,EAAE,CAAC;YAC3C,IAAI,KAAK,IAAI,WAAW,EAAE,CAAC;gBACzB,2DAA2D;gBAC3D,KAAK,MAAM,EAAE,IAAI,eAAe,CAAC,MAAM,CAAC,EAAE,CAAC;oBACzC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAA;gBAChB,CAAC;gBACD,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;YACjB,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;AACxB,CAAC;AAED,+DAA+D;AAE/D,mEAAmE;AACnE,SAAS,OAAO,CAAC,CAAmB,EAAE,CAAmB,EAAE,CAAmB;IAC5E,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;AACtE,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,qBAAqB,CAAC,MAAgB;IACpD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAA;IAElC,yDAAyD;IACzD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAA;IAC9B,MAAM,MAAM,GAAuB,EAAE,CAAA;IAErC,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;QAC1B,MAAM,CAAC,GAAG,aAAa,CAAC,IAAI,CAAC,CAAA;QAC7B,MAAM,OAAO,GAAuB;YAClC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC;YACpB,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC;YACpB,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC;YACpB,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC;SACrB,CAAA;QACD,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;YACxB,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAA;YAC7B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACnB,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;gBACb,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;YAChB,CAAC;QACH,CAAC;IACH,CAAC;IAED,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,MAAM,CAAA;IAEpC,iFAAiF;IACjF,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IAClC,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC;QAChD,MAAM,IAAI,KAAK,CACb,yDAAyD;YACzD,2DAA2D,CAC5D,CAAA;IACH,CAAC;IAED,mBAAmB;IACnB,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IAEjD,uCAAuC;IACvC,MAAM,KAAK,GAAuB,EAAE,CAAA;IACpC,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,OAAO,KAAK,CAAC,MAAM,IAAI,CAAC,IAAI,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;YAC9F,KAAK,CAAC,GAAG,EAAE,CAAA;QACb,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;IACf,CAAC;IAED,aAAa;IACb,MAAM,KAAK,GAAuB,EAAE,CAAA;IACpC,KAAK,IAAI,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5C,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAA;QACnB,OAAO,KAAK,CAAC,MAAM,IAAI,CAAC,IAAI,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;YAC9F,KAAK,CAAC,GAAG,EAAE,CAAA;QACb,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;IACf,CAAC;IAED,uDAAuD;IACvD,KAAK,CAAC,GAAG,EAAE,CAAA;IACX,KAAK,CAAC,GAAG,EAAE,CAAA;IAEX,OAAO,CAAC,GAAG,KAAK,EAAE,GAAG,KAAK,CAAC,CAAA;AAC7B,CAAC;AAYD;;;;;GAKG;AACH,MAAM,UAAU,oBAAoB,CAAC,MAAgB,EAAE,UAA8B,EAAE;IACrF,4BAA4B;IAC5B,KAAK,MAAM,CAAC,IAAI,MAAM;QAAE,eAAe,CAAC,CAAC,CAAC,CAAA;IAE1C,mDAAmD;IACnD,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,CAAA;IAC3B,MAAM,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE;QAC5C,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC,MAAM,EAAE,GAAG,EAAE,EAAE,CAAC;YACxC,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAA;QAC5C,CAAC;QACD,OAAO,IAAI,CAAA;IACb,CAAC,CAAC,CAAA;IAEF,yCAAyC;IACzC,MAAM,WAAW,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAA;IAC3C,OAAO,qBAAqB,CAAC,QAAQ,EAAE,CAAC,EAAE,WAAW,CAAC,CAAC,IAAI,EAAE,CAAA;AAC/D,CAAC;AAaD;;;GAGG;AACH,MAAM,UAAU,kBAAkB,CAAC,MAAgB;IACjD,OAAO;QACL,IAAI,EAAE,mBAAmB;QACzB,QAAQ,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;YAC5B,MAAM,CAAC,GAAG,aAAa,CAAC,IAAI,CAAC,CAAA;YAC7B,OAAO;gBACL,IAAI,EAAE,SAAkB;gBACxB,QAAQ,EAAE;oBACR,IAAI,EAAE,SAAkB;oBACxB,WAAW,EAAE,CAAC;4BACZ,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC;4BACpB,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC;4BACpB,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC;4BACpB,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC;4BACpB,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC;yBACrB,CAAC;iBACH;gBACD,UAAU,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,CAAC,MAAM,EAAE;aACtD,CAAA;QACH,CAAC,CAAC;KACH,CAAA;AACH,CAAC"}

package/dist/geojson.d.ts

@@ -0,0 +1,13 @@
+/** GeoJSON Polygon geometry. Coordinates are [lon, lat] rings; first ring is the outer boundary. */
+export interface GeoJSONPolygon {
+    type: 'Polygon';
+    coordinates: number[][][];
+}
+/** GeoJSON MultiPolygon geometry. Each element of coordinates is a Polygon's coordinate array. */
+export interface GeoJSONMultiPolygon {
+    type: 'MultiPolygon';
+    coordinates: number[][][][];
+}
+/** Input types accepted by polygonToGeohashes. */
+export type PolygonInput = [number, number][] | GeoJSONPolygon | GeoJSONMultiPolygon;
+//# sourceMappingURL=geojson.d.ts.map

package/dist/geojson.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"geojson.d.ts","sourceRoot":"","sources":["../src/geojson.ts"],"names":[],"mappings":"AAEA,oGAAoG;AACpG,MAAM,WAAW,cAAc;IAC7B,IAAI,EAAE,SAAS,CAAA;IACf,WAAW,EAAE,MAAM,EAAE,EAAE,EAAE,CAAA;CAC1B;AAED,kGAAkG;AAClG,MAAM,WAAW,mBAAmB;IAClC,IAAI,EAAE,cAAc,CAAA;IACpB,WAAW,EAAE,MAAM,EAAE,EAAE,EAAE,EAAE,CAAA;CAC5B;AAED,kDAAkD;AAClD,MAAM,MAAM,YAAY,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,GAAG,cAAc,GAAG,mBAAmB,CAAA"}

package/dist/geojson.js

@@ -0,0 +1,3 @@
+// src/geojson.ts — minimal GeoJSON geometry types (zero-dependency alternative to @types/geojson)
+export {};
+//# sourceMappingURL=geojson.js.map

package/dist/geojson.js.map

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

package/dist/index.d.ts

@@ -0,0 +1,4 @@
+export { encode, decode, bounds, children, contains, matchesAny, neighbour, neighbours, distance, distanceFromCoords, radiusToPrecision, precisionToRadius, type GeohashBounds, type Direction, } from './core.js';
+export { pointInPolygon, boundsOverlapsPolygon, boundsFullyInsidePolygon, polygonToGeohashes, geohashesToGeoJSON, geohashesToConvexHull, deduplicateGeohashes, type CoverageOptions, type DeduplicateOptions, type GeohashGeoJSON, type PolygonInput, type GeoJSONPolygon, type GeoJSONMultiPolygon, } from './coverage.js';
+export { createGTagLadder, createGTagFilter, createGTagFilterFromGeohashes, expandRings, nearbyFilter, parseGTags, bestGeohash, } from './nostr.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,UAAU,EACtD,SAAS,EAAE,UAAU,EACrB,QAAQ,EAAE,kBAAkB,EAAE,iBAAiB,EAAE,iBAAiB,EAClE,KAAK,aAAa,EAAE,KAAK,SAAS,GACnC,MAAM,WAAW,CAAA;AAElB,OAAO,EACL,cAAc,EAAE,qBAAqB,EAAE,wBAAwB,EAC/D,kBAAkB,EAAE,kBAAkB,EAAE,qBAAqB,EAC7D,oBAAoB,EACpB,KAAK,eAAe,EAAE,KAAK,kBAAkB,EAAE,KAAK,cAAc,EAClE,KAAK,YAAY,EAAE,KAAK,cAAc,EAAE,KAAK,mBAAmB,GACjE,MAAM,eAAe,CAAA;AAEtB,OAAO,EACL,gBAAgB,EAAE,gBAAgB,EAAE,6BAA6B,EACjE,WAAW,EAAE,YAAY,EAAE,UAAU,EAAE,WAAW,GACnD,MAAM,YAAY,CAAA"}

package/dist/index.js

@@ -0,0 +1,4 @@
+export { encode, decode, bounds, children, contains, matchesAny, neighbour, neighbours, distance, distanceFromCoords, radiusToPrecision, precisionToRadius, } from './core.js';
+export { pointInPolygon, boundsOverlapsPolygon, boundsFullyInsidePolygon, polygonToGeohashes, geohashesToGeoJSON, geohashesToConvexHull, deduplicateGeohashes, } from './coverage.js';
+export { createGTagLadder, createGTagFilter, createGTagFilterFromGeohashes, expandRings, nearbyFilter, parseGTags, bestGeohash, } from './nostr.js';
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,UAAU,EACtD,SAAS,EAAE,UAAU,EACrB,QAAQ,EAAE,kBAAkB,EAAE,iBAAiB,EAAE,iBAAiB,GAEnE,MAAM,WAAW,CAAA;AAElB,OAAO,EACL,cAAc,EAAE,qBAAqB,EAAE,wBAAwB,EAC/D,kBAAkB,EAAE,kBAAkB,EAAE,qBAAqB,EAC7D,oBAAoB,GAGrB,MAAM,eAAe,CAAA;AAEtB,OAAO,EACL,gBAAgB,EAAE,gBAAgB,EAAE,6BAA6B,EACjE,WAAW,EAAE,YAAY,EAAE,UAAU,EAAE,WAAW,GACnD,MAAM,YAAY,CAAA"}