@map-colonies/mc-utils 2.0.0 → 2.0.2

package/dist/geo/geoHash.js

@@ -1,247 +1,247 @@
-"use strict";
-var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    var desc = Object.getOwnPropertyDescriptor(m, k);
-    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
-      desc = { enumerable: true, get: function() { return m[k]; } };
-    }
-    Object.defineProperty(o, k2, desc);
-}) : (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    o[k2] = m[k];
-}));
-var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
-    Object.defineProperty(o, "default", { enumerable: true, value: v });
-}) : function(o, v) {
-    o["default"] = v;
-});
-var __importStar = (this && this.__importStar) || function (mod) {
-    if (mod && mod.__esModule) return mod;
-    var result = {};
-    if (mod != null) for (var k in mod) if (k !== "default" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);
-    __setModuleDefault(result, mod);
-    return result;
-};
-var __generator = (this && this.__generator) || function (thisArg, body) {
-    var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;
-    return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
-    function verb(n) { return function (v) { return step([n, v]); }; }
-    function step(op) {
-        if (f) throw new TypeError("Generator is already executing.");
-        while (_) try {
-            if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;
-            if (y = 0, t) op = [op[0] & 2, t.value];
-            switch (op[0]) {
-                case 0: case 1: t = op; break;
-                case 4: _.label++; return { value: op[1], done: false };
-                case 5: _.label++; y = op[1]; op = [0]; continue;
-                case 7: op = _.ops.pop(); _.trys.pop(); continue;
-                default:
-                    if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }
-                    if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }
-                    if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }
-                    if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }
-                    if (t[2]) _.ops.pop();
-                    _.trys.pop(); continue;
-            }
-            op = body.call(thisArg, _);
-        } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }
-        if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };
-    }
-};
-var __values = (this && this.__values) || function(o) {
-    var s = typeof Symbol === "function" && Symbol.iterator, m = s && o[s], i = 0;
-    if (m) return m.call(o);
-    if (o && typeof o.length === "number") return {
-        next: function () {
-            if (o && i >= o.length) o = void 0;
-            return { value: o && o[i++], done: !o };
-        }
-    };
-    throw new TypeError(s ? "Object is not iterable." : "Symbol.iterator is not defined.");
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.tileGenerator = exports.createGeoHashGenerator = exports.decodeGeoHash = void 0;
-var turf_1 = require("@turf/turf");
-var ngeohash = __importStar(require("ngeohash"));
-var tileOrigin_1 = require("../models/enums/geo/tileOrigin");
-var geoConvertor_1 = require("./geoConvertor");
-var bboxUtils_1 = require("./bboxUtils");
-var MAX_STANDARD_ZOOM = 21;
-var bboxIntersection = function (bbox1, bbox2) {
-    var minLon = Math.max(bbox1[0], bbox2[0]);
-    var minLat = Math.max(bbox1[1], bbox2[1]);
-    var maxLon = Math.min(bbox1[2], bbox2[2]);
-    var maxLat = Math.min(bbox1[3], bbox2[3]);
-    return [minLon, minLat, maxLon, maxLat];
-};
-var isSubHash = function (hash, parent) {
-    return hash.startsWith(parent);
-};
-function geoHash(precision, maxPrecision, polygon, bbox, parentHash) {
-    var hashes, hashes_1, hashes_1_1, hash, hashBbox, hashPoly, intersection, intArea, hashArea, subBbox, e_1_1;
-    var e_1, _a;
-    if (parentHash === void 0) { parentHash = ''; }
-    return __generator(this, function (_b) {
-        switch (_b.label) {
-            case 0:
-                hashes = ngeohash.bboxes(bbox[1], bbox[0], bbox[3], bbox[2], precision);
-                if (!(hashes.length > 0)) return [3 /*break*/, 10];
-                _b.label = 1;
-            case 1:
-                _b.trys.push([1, 8, 9, 10]);
-                hashes_1 = __values(hashes), hashes_1_1 = hashes_1.next();
-                _b.label = 2;
-            case 2:
-                if (!!hashes_1_1.done) return [3 /*break*/, 7];
-                hash = hashes_1_1.value;
-                hashBbox = (0, exports.decodeGeoHash)(hash);
-                hashPoly = (0, turf_1.bboxPolygon)(hashBbox);
-                intersection = (0, turf_1.intersect)(polygon, hashPoly);
-                if (intersection === null || !isSubHash(hash, parentHash)) {
-                    return [3 /*break*/, 6];
-                }
-                intArea = (0, turf_1.area)(intersection);
-                hashArea = (0, turf_1.area)(hashPoly);
-                if (!(intArea == hashArea || precision == maxPrecision)) return [3 /*break*/, 4];
-                return [4 /*yield*/, hash];
-            case 3:
-                _b.sent();
-                return [3 /*break*/, 6];
-            case 4:
-                subBbox = bboxIntersection(hashBbox, bbox);
-                return [5 /*yield**/, __values(geoHash(precision + 1, maxPrecision, polygon, subBbox, hash))];
-            case 5:
-                _b.sent();
-                _b.label = 6;
-            case 6:
-                hashes_1_1 = hashes_1.next();
-                return [3 /*break*/, 2];
-            case 7: return [3 /*break*/, 10];
-            case 8:
-                e_1_1 = _b.sent();
-                e_1 = { error: e_1_1 };
-                return [3 /*break*/, 10];
-            case 9:
-                try {
-                    if (hashes_1_1 && !hashes_1_1.done && (_a = hashes_1.return)) _a.call(hashes_1);
-                }
-                finally { if (e_1) throw e_1.error; }
-                return [7 /*endfinally*/];
-            case 10: return [2 /*return*/];
-        }
-    });
-}
-/**
- * converts geohash string to its bbox in wgs84 degrees
- * @param geohash geohash string
- * @returns bbox of the supplied geohash
- */
-var decodeGeoHash = function (geohash) {
-    var bboxFromGeohash = ngeohash.decode_bbox(geohash);
-    // ngeohash.decode_bbox gives a lat-lon array. we change it to lon-lat so @turf can use it.
-    var lonLatBbox = [bboxFromGeohash[1], bboxFromGeohash[0], bboxFromGeohash[3], bboxFromGeohash[2]];
-    return lonLatBbox;
-};
-exports.decodeGeoHash = decodeGeoHash;
-/**
- * generates optimized geohash iterator for given polygon and target zoom level
- * @param polygon polygon to cover with geohashes
- * @param maxTileZoom target zoom level
- * @returns generator that yields the matching geohashes
- */
-var createGeoHashGenerator = function (polygon, maxTileZoom) {
-    if (maxTileZoom === void 0) { maxTileZoom = MAX_STANDARD_ZOOM; }
-    var bbox = (0, turf_1.bbox)(polygon);
-    bbox = (0, bboxUtils_1.snapBBoxToTileGrid)(bbox, maxTileZoom);
-    //at this precision ea geo hash is a tile or smaller
-    /* eslint-disable @typescript-eslint/no-magic-numbers */
-    var zoomPrecision = Math.floor((2 / 5) * (maxTileZoom + 1));
-    var precisionMod = maxTileZoom % 5;
-    if (precisionMod > 0 && precisionMod <= 3) {
-        zoomPrecision++;
-    }
-    else if (precisionMod > 3) {
-        zoomPrecision += 2;
-    }
-    /* eslint-enable @typescript-eslint/no-magic-numbers */
-    return geoHash(1, zoomPrecision, polygon, bbox);
-};
-exports.createGeoHashGenerator = createGeoHashGenerator;
-/**
- * generate all tiles in supplied polygon
- * @param polygon polygon to cover with tiles
- * @param tileZoom target tiles zoom level
- * @param origin target tiles grid origin location (default ll)
- */
-function tileGenerator(polygon, tileZoom, origin) {
-    var hashGen, hashGen_1, hashGen_1_1, hash, bbox, minTile, maxTile, minX, maxX, minY, maxY, x, y, e_2_1;
-    var e_2, _a;
-    if (origin === void 0) { origin = tileOrigin_1.TileOrigin.LOWER_LEFT; }
-    return __generator(this, function (_b) {
-        switch (_b.label) {
-            case 0:
-                hashGen = (0, exports.createGeoHashGenerator)(polygon, tileZoom);
-                _b.label = 1;
-            case 1:
-                _b.trys.push([1, 10, 11, 12]);
-                hashGen_1 = __values(hashGen), hashGen_1_1 = hashGen_1.next();
-                _b.label = 2;
-            case 2:
-                if (!!hashGen_1_1.done) return [3 /*break*/, 9];
-                hash = hashGen_1_1.value;
-                bbox = (0, exports.decodeGeoHash)(hash);
-                minTile = (0, geoConvertor_1.degreesToTile)({
-                    longitude: bbox[0],
-                    latitude: bbox[1],
-                }, tileZoom, origin);
-                maxTile = (0, geoConvertor_1.degreesToTile)({
-                    longitude: bbox[2],
-                    latitude: bbox[3],
-                }, tileZoom, origin);
-                minX = Math.min(minTile.x, maxTile.x);
-                maxX = minTile.x + maxTile.x - minX;
-                minY = Math.min(minTile.y, maxTile.y);
-                maxY = minTile.y + maxTile.y - minY;
-                x = minX;
-                _b.label = 3;
-            case 3:
-                if (!(x < maxX)) return [3 /*break*/, 8];
-                y = minY;
-                _b.label = 4;
-            case 4:
-                if (!(y < maxY)) return [3 /*break*/, 7];
-                return [4 /*yield*/, {
-                        x: x,
-                        y: y,
-                        zoom: tileZoom,
-                    }];
-            case 5:
-                _b.sent();
-                _b.label = 6;
-            case 6:
-                y++;
-                return [3 /*break*/, 4];
-            case 7:
-                x++;
-                return [3 /*break*/, 3];
-            case 8:
-                hashGen_1_1 = hashGen_1.next();
-                return [3 /*break*/, 2];
-            case 9: return [3 /*break*/, 12];
-            case 10:
-                e_2_1 = _b.sent();
-                e_2 = { error: e_2_1 };
-                return [3 /*break*/, 12];
-            case 11:
-                try {
-                    if (hashGen_1_1 && !hashGen_1_1.done && (_a = hashGen_1.return)) _a.call(hashGen_1);
-                }
-                finally { if (e_2) throw e_2.error; }
-                return [7 /*endfinally*/];
-            case 12: return [2 /*return*/];
-        }
-    });
-}
-exports.tileGenerator = tileGenerator;
+"use strict";
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
+    Object.defineProperty(o, "default", { enumerable: true, value: v });
+}) : function(o, v) {
+    o["default"] = v;
+});
+var __importStar = (this && this.__importStar) || function (mod) {
+    if (mod && mod.__esModule) return mod;
+    var result = {};
+    if (mod != null) for (var k in mod) if (k !== "default" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);
+    __setModuleDefault(result, mod);
+    return result;
+};
+var __generator = (this && this.__generator) || function (thisArg, body) {
+    var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;
+    return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
+    function verb(n) { return function (v) { return step([n, v]); }; }
+    function step(op) {
+        if (f) throw new TypeError("Generator is already executing.");
+        while (_) try {
+            if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;
+            if (y = 0, t) op = [op[0] & 2, t.value];
+            switch (op[0]) {
+                case 0: case 1: t = op; break;
+                case 4: _.label++; return { value: op[1], done: false };
+                case 5: _.label++; y = op[1]; op = [0]; continue;
+                case 7: op = _.ops.pop(); _.trys.pop(); continue;
+                default:
+                    if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }
+                    if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }
+                    if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }
+                    if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }
+                    if (t[2]) _.ops.pop();
+                    _.trys.pop(); continue;
+            }
+            op = body.call(thisArg, _);
+        } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }
+        if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };
+    }
+};
+var __values = (this && this.__values) || function(o) {
+    var s = typeof Symbol === "function" && Symbol.iterator, m = s && o[s], i = 0;
+    if (m) return m.call(o);
+    if (o && typeof o.length === "number") return {
+        next: function () {
+            if (o && i >= o.length) o = void 0;
+            return { value: o && o[i++], done: !o };
+        }
+    };
+    throw new TypeError(s ? "Object is not iterable." : "Symbol.iterator is not defined.");
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.tileGenerator = exports.createGeoHashGenerator = exports.decodeGeoHash = void 0;
+var turf_1 = require("@turf/turf");
+var ngeohash = __importStar(require("ngeohash"));
+var tileOrigin_1 = require("../models/enums/geo/tileOrigin");
+var geoConvertor_1 = require("./geoConvertor");
+var bboxUtils_1 = require("./bboxUtils");
+var MAX_STANDARD_ZOOM = 21;
+var bboxIntersection = function (bbox1, bbox2) {
+    var minLon = Math.max(bbox1[0], bbox2[0]);
+    var minLat = Math.max(bbox1[1], bbox2[1]);
+    var maxLon = Math.min(bbox1[2], bbox2[2]);
+    var maxLat = Math.min(bbox1[3], bbox2[3]);
+    return [minLon, minLat, maxLon, maxLat];
+};
+var isSubHash = function (hash, parent) {
+    return hash.startsWith(parent);
+};
+function geoHash(precision, maxPrecision, polygon, bbox, parentHash) {
+    var hashes, hashes_1, hashes_1_1, hash, hashBbox, hashPoly, intersection, intArea, hashArea, subBbox, e_1_1;
+    var e_1, _a;
+    if (parentHash === void 0) { parentHash = ''; }
+    return __generator(this, function (_b) {
+        switch (_b.label) {
+            case 0:
+                hashes = ngeohash.bboxes(bbox[1], bbox[0], bbox[3], bbox[2], precision);
+                if (!(hashes.length > 0)) return [3 /*break*/, 10];
+                _b.label = 1;
+            case 1:
+                _b.trys.push([1, 8, 9, 10]);
+                hashes_1 = __values(hashes), hashes_1_1 = hashes_1.next();
+                _b.label = 2;
+            case 2:
+                if (!!hashes_1_1.done) return [3 /*break*/, 7];
+                hash = hashes_1_1.value;
+                hashBbox = (0, exports.decodeGeoHash)(hash);
+                hashPoly = (0, turf_1.bboxPolygon)(hashBbox);
+                intersection = (0, turf_1.intersect)(polygon, hashPoly);
+                if (intersection === null || !isSubHash(hash, parentHash)) {
+                    return [3 /*break*/, 6];
+                }
+                intArea = (0, turf_1.area)(intersection);
+                hashArea = (0, turf_1.area)(hashPoly);
+                if (!(intArea == hashArea || precision == maxPrecision)) return [3 /*break*/, 4];
+                return [4 /*yield*/, hash];
+            case 3:
+                _b.sent();
+                return [3 /*break*/, 6];
+            case 4:
+                subBbox = bboxIntersection(hashBbox, bbox);
+                return [5 /*yield**/, __values(geoHash(precision + 1, maxPrecision, polygon, subBbox, hash))];
+            case 5:
+                _b.sent();
+                _b.label = 6;
+            case 6:
+                hashes_1_1 = hashes_1.next();
+                return [3 /*break*/, 2];
+            case 7: return [3 /*break*/, 10];
+            case 8:
+                e_1_1 = _b.sent();
+                e_1 = { error: e_1_1 };
+                return [3 /*break*/, 10];
+            case 9:
+                try {
+                    if (hashes_1_1 && !hashes_1_1.done && (_a = hashes_1.return)) _a.call(hashes_1);
+                }
+                finally { if (e_1) throw e_1.error; }
+                return [7 /*endfinally*/];
+            case 10: return [2 /*return*/];
+        }
+    });
+}
+/**
+ * converts geohash string to its bbox in wgs84 degrees
+ * @param geohash geohash string
+ * @returns bbox of the supplied geohash
+ */
+var decodeGeoHash = function (geohash) {
+    var bboxFromGeohash = ngeohash.decode_bbox(geohash);
+    // ngeohash.decode_bbox gives a lat-lon array. we change it to lon-lat so @turf can use it.
+    var lonLatBbox = [bboxFromGeohash[1], bboxFromGeohash[0], bboxFromGeohash[3], bboxFromGeohash[2]];
+    return lonLatBbox;
+};
+exports.decodeGeoHash = decodeGeoHash;
+/**
+ * generates optimized geohash iterator for given polygon and target zoom level
+ * @param polygon polygon to cover with geohashes
+ * @param maxTileZoom target zoom level
+ * @returns generator that yields the matching geohashes
+ */
+var createGeoHashGenerator = function (polygon, maxTileZoom) {
+    if (maxTileZoom === void 0) { maxTileZoom = MAX_STANDARD_ZOOM; }
+    var bbox = (0, turf_1.bbox)(polygon);
+    bbox = (0, bboxUtils_1.snapBBoxToTileGrid)(bbox, maxTileZoom);
+    //at this precision ea geo hash is a tile or smaller
+    /* eslint-disable @typescript-eslint/no-magic-numbers */
+    var zoomPrecision = Math.floor((2 / 5) * (maxTileZoom + 1));
+    var precisionMod = maxTileZoom % 5;
+    if (precisionMod > 0 && precisionMod <= 3) {
+        zoomPrecision++;
+    }
+    else if (precisionMod > 3) {
+        zoomPrecision += 2;
+    }
+    /* eslint-enable @typescript-eslint/no-magic-numbers */
+    return geoHash(1, zoomPrecision, polygon, bbox);
+};
+exports.createGeoHashGenerator = createGeoHashGenerator;
+/**
+ * generate all tiles in supplied polygon
+ * @param polygon polygon to cover with tiles
+ * @param tileZoom target tiles zoom level
+ * @param origin target tiles grid origin location (default ll)
+ */
+function tileGenerator(polygon, tileZoom, origin) {
+    var hashGen, hashGen_1, hashGen_1_1, hash, bbox, minTile, maxTile, minX, maxX, minY, maxY, x, y, e_2_1;
+    var e_2, _a;
+    if (origin === void 0) { origin = tileOrigin_1.TileOrigin.LOWER_LEFT; }
+    return __generator(this, function (_b) {
+        switch (_b.label) {
+            case 0:
+                hashGen = (0, exports.createGeoHashGenerator)(polygon, tileZoom);
+                _b.label = 1;
+            case 1:
+                _b.trys.push([1, 10, 11, 12]);
+                hashGen_1 = __values(hashGen), hashGen_1_1 = hashGen_1.next();
+                _b.label = 2;
+            case 2:
+                if (!!hashGen_1_1.done) return [3 /*break*/, 9];
+                hash = hashGen_1_1.value;
+                bbox = (0, exports.decodeGeoHash)(hash);
+                minTile = (0, geoConvertor_1.degreesToTile)({
+                    longitude: bbox[0],
+                    latitude: bbox[1],
+                }, tileZoom, origin);
+                maxTile = (0, geoConvertor_1.degreesToTile)({
+                    longitude: bbox[2],
+                    latitude: bbox[3],
+                }, tileZoom, origin);
+                minX = Math.min(minTile.x, maxTile.x);
+                maxX = minTile.x + maxTile.x - minX;
+                minY = Math.min(minTile.y, maxTile.y);
+                maxY = minTile.y + maxTile.y - minY;
+                x = minX;
+                _b.label = 3;
+            case 3:
+                if (!(x < maxX)) return [3 /*break*/, 8];
+                y = minY;
+                _b.label = 4;
+            case 4:
+                if (!(y < maxY)) return [3 /*break*/, 7];
+                return [4 /*yield*/, {
+                        x: x,
+                        y: y,
+                        zoom: tileZoom,
+                    }];
+            case 5:
+                _b.sent();
+                _b.label = 6;
+            case 6:
+                y++;
+                return [3 /*break*/, 4];
+            case 7:
+                x++;
+                return [3 /*break*/, 3];
+            case 8:
+                hashGen_1_1 = hashGen_1.next();
+                return [3 /*break*/, 2];
+            case 9: return [3 /*break*/, 12];
+            case 10:
+                e_2_1 = _b.sent();
+                e_2 = { error: e_2_1 };
+                return [3 /*break*/, 12];
+            case 11:
+                try {
+                    if (hashGen_1_1 && !hashGen_1_1.done && (_a = hashGen_1.return)) _a.call(hashGen_1);
+                }
+                finally { if (e_2) throw e_2.error; }
+                return [7 /*endfinally*/];
+            case 12: return [2 /*return*/];
+        }
+    });
+}
+exports.tileGenerator = tileGenerator;
 //# sourceMappingURL=geoHash.js.map

package/dist/geo/geoIntersection.d.ts

@@ -1,20 +1,20 @@
-import { Feature, FeatureCollection, MultiPolygon, Polygon } from '@turf/turf';
-/**
- * tuft intersect supported footprint types
- */
-declare type Footprint = Polygon | MultiPolygon | Feature<Polygon | MultiPolygon>;
-/**
- * return the intersection footprint of all specified footprints or null when there is no intersection
- * @param footprints footprint list to intersect
- * @returns intersection footprint or null
- */
-declare const multiIntersect: (footprints: Footprint[]) => Footprint | null;
-/**
- * indicates if 2 object of type FeatureCollection are equal by validating properties and features array (order not important)
- * @param fc1 first featureCollection to compare equal
- * @param fc2 second featureCollection to compare equal
- * @returns true if same featureCollection, false if not
- */
-declare const featureCollectionBooleanEqual: (fc1: FeatureCollection, fc2: FeatureCollection) => boolean;
-export { multiIntersect, featureCollectionBooleanEqual, Footprint };
+import { Feature, FeatureCollection, MultiPolygon, Polygon } from '@turf/turf';
+/**
+ * tuft intersect supported footprint types
+ */
+declare type Footprint = Polygon | MultiPolygon | Feature<Polygon | MultiPolygon>;
+/**
+ * return the intersection footprint of all specified footprints or null when there is no intersection
+ * @param footprints footprint list to intersect
+ * @returns intersection footprint or null
+ */
+declare const multiIntersect: (footprints: Footprint[]) => Footprint | null;
+/**
+ * indicates if 2 object of type FeatureCollection are equal by validating properties and features array (order not important)
+ * @param fc1 first featureCollection to compare equal
+ * @param fc2 second featureCollection to compare equal
+ * @returns true if same featureCollection, false if not
+ */
+declare const featureCollectionBooleanEqual: (fc1: FeatureCollection, fc2: FeatureCollection) => boolean;
+export { multiIntersect, featureCollectionBooleanEqual, Footprint };
 //# sourceMappingURL=geoIntersection.d.ts.map