@map-colonies/mc-utils 3.0.0 → 3.1.0

package/dist/geo/tileRanger.js

@@ -1,384 +1,233 @@
-"use strict";
-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 __await = (this && this.__await) || function (v) { return this instanceof __await ? (this.v = v, this) : new __await(v); }
-var __asyncValues = (this && this.__asyncValues) || function (o) {
-    if (!Symbol.asyncIterator) throw new TypeError("Symbol.asyncIterator is not defined.");
-    var m = o[Symbol.asyncIterator], i;
-    return m ? m.call(o) : (o = typeof __values === "function" ? __values(o) : o[Symbol.iterator](), i = {}, verb("next"), verb("throw"), verb("return"), i[Symbol.asyncIterator] = function () { return this; }, i);
-    function verb(n) { i[n] = o[n] && function (v) { return new Promise(function (resolve, reject) { v = o[n](v), settle(resolve, reject, v.done, v.value); }); }; }
-    function settle(resolve, reject, d, v) { Promise.resolve(v).then(function(v) { resolve({ value: v, done: d }); }, reject); }
-};
-var __asyncDelegator = (this && this.__asyncDelegator) || function (o) {
-    var i, p;
-    return i = {}, verb("next"), verb("throw", function (e) { throw e; }), verb("return"), i[Symbol.iterator] = function () { return this; }, i;
-    function verb(n, f) { i[n] = o[n] ? function (v) { return (p = !p) ? { value: __await(o[n](v)), done: n === "return" } : f ? f(v) : v; } : f; }
-};
-var __asyncGenerator = (this && this.__asyncGenerator) || function (thisArg, _arguments, generator) {
-    if (!Symbol.asyncIterator) throw new TypeError("Symbol.asyncIterator is not defined.");
-    var g = generator.apply(thisArg, _arguments || []), i, q = [];
-    return i = {}, verb("next"), verb("throw"), verb("return"), i[Symbol.asyncIterator] = function () { return this; }, i;
-    function verb(n) { if (g[n]) i[n] = function (v) { return new Promise(function (a, b) { q.push([n, v, a, b]) > 1 || resume(n, v); }); }; }
-    function resume(n, v) { try { step(g[n](v)); } catch (e) { settle(q[0][3], e); } }
-    function step(r) { r.value instanceof __await ? Promise.resolve(r.value.v).then(fulfill, reject) : settle(q[0][2], r); }
-    function fulfill(value) { resume("next", value); }
-    function reject(value) { resume("throw", value); }
-    function settle(f, v) { if (f(v), q.shift(), q.length) resume(q[0][0], q[0][1]); }
-};
-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.TileRanger = void 0;
-var turf_1 = require("@turf/turf");
-var bboxUtils_1 = require("./bboxUtils");
-var tiles_1 = require("./tiles");
-var tilesGenerator_1 = require("./tilesGenerator");
-var TileIntersectionState;
-(function (TileIntersectionState) {
-    TileIntersectionState["FULL"] = "full";
-    TileIntersectionState["PARTIAL"] = "partial";
-    TileIntersectionState["NONE"] = "none";
-})(TileIntersectionState || (TileIntersectionState = {}));
-/**
- * class for generating and decoding tile hashes
- */
-var TileRanger = /** @class */ (function () {
-    function TileRanger() {
-        this.tileFootprintIntersection = function (tile, intersectionParams) {
-            var tileBbox = (0, tiles_1.tileToBbox)(tile);
-            var tilePoly = (0, turf_1.bboxPolygon)(tileBbox);
-            var intersection = (0, turf_1.intersect)(intersectionParams.footprint, tilePoly);
-            if (intersection === null) {
-                return TileIntersectionState.NONE;
-            }
-            // stop condition
-            if (tile.zoom === intersectionParams.maxZoom) {
-                return TileIntersectionState.FULL;
-            }
-            var intArea = (0, turf_1.area)(intersection);
-            var hashArea = (0, turf_1.area)(tilePoly);
-            if (intArea == hashArea) {
-                return TileIntersectionState.FULL;
-            }
-            return TileIntersectionState.PARTIAL;
-        };
-    }
-    /**
-     * converts tile to tile range of specified zoom level
-     * @param tile
-     * @param zoom target tile range zoom
-     * @returns
-     */
-    TileRanger.prototype.tileToRange = function (tile, zoom) {
-        var minX, minY, maxX, maxY;
-        minX = tile.x;
-        maxX = tile.x + 1;
-        minY = tile.y;
-        maxY = tile.y + 1;
-        if (tile.zoom < zoom) {
-            var dz = zoom - tile.zoom;
-            minX = minX << dz;
-            maxX = maxX << dz;
-            minY = minY << dz;
-            maxY = maxY << dz;
-        }
-        else if (tile.zoom > zoom) {
-            var dz = tile.zoom - zoom;
-            minX = minX >> dz;
-            minY = minY >> dz;
-            maxX = minX + 1;
-            maxY = minY + 1;
-        }
-        return {
-            minX: minX,
-            minY: minY,
-            maxX: maxX,
-            maxY: maxY,
-            zoom: zoom,
-        };
-    };
-    /**
-     * generate tile hashes
-     * @param footprint footprint to cover with generated tile hashes
-     * @param zoom max hash zoom
-     * @returns
-     */
-    TileRanger.prototype.encodeFootprint = function (footprint, zoom, verbose) {
-        if (verbose === void 0) { verbose = false; }
-        return __asyncGenerator(this, arguments, function encodeFootprint_1() {
-            var bbox, tileRange, intersectionParams;
-            return __generator(this, function (_a) {
-                switch (_a.label) {
-                    case 0:
-                        ////////////////////////////////
-                        /// Step 1: check if the footprint is identical to its bbox
-                        ////////////////////////////////
-                        if (verbose) {
-                            console.log('encode footprint');
-                        }
-                        bbox = (0, turf_1.bbox)(footprint);
-                        if (!this.isBbox(footprint)) return [3 /*break*/, 4];
-                        tileRange = (0, bboxUtils_1.bboxToTileRange)(bbox, zoom);
-                        if (verbose) {
-                            console.log("footprint is identical to its bbox - return BBOX tile range zoom: ".concat(tileRange.zoom, " : X ").concat(tileRange.minX, " - ").concat(tileRange.maxX, " : Y ").concat(tileRange.minY, " - ").concat(tileRange.maxY));
-                        }
-                        return [4 /*yield*/, __await(Promise.resolve(tileRange))];
-                    case 1: return [4 /*yield*/, __await.apply(void 0, [_a.sent()])];
-                    case 2: return [4 /*yield*/, _a.sent()];
-                    case 3:
-                        _a.sent();
-                        return [3 /*break*/, 8];
-                    case 4:
-                        intersectionParams = {
-                            footprint: footprint,
-                            maxZoom: zoom,
-                        };
-                        if (verbose) {
-                            console.log('footprint is different from its bbox - generateRanges');
-                        }
-                        return [4 /*yield*/, __await(Promise.resolve(this.generateRanges(bbox, zoom, intersectionParams, this.tileFootprintIntersection, verbose)))];
-                    case 5: return [5 /*yield**/, __values(__asyncDelegator.apply(void 0, [__asyncValues.apply(void 0, [_a.sent()])]))];
-                    case 6: return [4 /*yield*/, __await.apply(void 0, [_a.sent()])];
-                    case 7:
-                        _a.sent();
-                        _a.label = 8;
-                    case 8: return [2 /*return*/];
-                }
-            });
-        });
-    };
-    TileRanger.prototype.generateTiles = function (area, zoom) {
-        var gen;
-        if (Array.isArray(area)) {
-            var tileRangeGen = function tileRangeGenerator() {
-                return __asyncGenerator(this, arguments, function tileRangeGenerator_1() {
-                    return __generator(this, function (_a) {
-                        switch (_a.label) {
-                            case 0: return [4 /*yield*/, __await(Promise.resolve((0, bboxUtils_1.bboxToTileRange)(area, zoom)))];
-                            case 1: return [4 /*yield*/, __await.apply(void 0, [_a.sent()])];
-                            case 2: return [4 /*yield*/, _a.sent()];
-                            case 3:
-                                _a.sent();
-                                return [2 /*return*/];
-                        }
-                    });
-                });
-            };
-            gen = tileRangeGen();
-        }
-        else {
-            gen = this.encodeFootprint(area, zoom);
-        }
-        return (0, tilesGenerator_1.tilesGenerator)(gen);
-    };
-    TileRanger.prototype.generateRanges = function (bbox, zoom, intersectionTarget, intersectionFunction, verbose) {
-        if (verbose === void 0) { verbose = false; }
-        return __asyncGenerator(this, arguments, function generateRanges_1() {
-            var boundingRange, bboxString, dx, dy, minXZoom, minYZoom, minZoom, minimalRange, x, y, tile, intersection, tileRange;
-            return __generator(this, function (_a) {
-                switch (_a.label) {
-                    case 0:
-                        /////////////////////////////////////////////////////////////////////////////////////////////////
-                        /// Step 3: Convert the bbox to tile range of the requested zoom
-                        /////////////////////////////////////////////////////////////////////////////////////////////////
-                        if (verbose) {
-                            console.log('Convert the bbox to tile range of the requested zoom');
-                        }
-                        boundingRange = (0, bboxUtils_1.bboxToTileRange)(bbox, zoom);
-                        if (verbose) {
-                            bboxString = "BBOX[0]: ".concat(bbox[0], ", BBOX[1]: ").concat(bbox[1], ", BBOX[2]: ").concat(bbox[2], ", BBOX[3]: ").concat(bbox[3]);
-                            console.log("".concat(bboxString, ", Zoom: ").concat(zoom, ", bounding range: minX: ").concat(boundingRange.minX, ", maxX: ").concat(boundingRange.maxX, ", minY: ").concat(boundingRange.minY, ", maxY: ").concat(boundingRange.maxY));
-                        }
-                        /////////////////////////////////////////////////////////////////////////////////////////////////
-                        /// Step 4: Use range size to calculate zoom level where the target area is smaller then 1 tile
-                        ///         (use zoom zero in-case there is no such zoom, for example in global bbox).
-                        /////////////////////////////////////////////////////////////////////////////////////////////////
-                        // find minimal zoom where the the area can be converted by area the size of single tile to skip levels that can't have full hashes
-                        if (verbose) {
-                            console.log("find minimal zoom where the the area can be converted by area the size of single tile to skip levels that can't have full hashes");
-                        }
-                        dx = boundingRange.maxX - boundingRange.minX;
-                        dy = boundingRange.maxY - boundingRange.minY;
-                        minXZoom = Math.max(Math.floor(Math.log2(1 << (zoom + 1)) / dx) - 1, 0);
-                        minYZoom = Math.max(Math.floor(Math.log2(1 << zoom) / dy), 0);
-                        minZoom = Math.min(minXZoom, minYZoom);
-                        if (verbose) {
-                            console.log("MinZoom: ".concat(minZoom));
-                        }
-                        minimalRange = (0, bboxUtils_1.bboxToTileRange)(bbox, minZoom);
-                        x = minimalRange.minX;
-                        _a.label = 1;
-                    case 1:
-                        if (!(x < minimalRange.maxX)) return [3 /*break*/, 12];
-                        y = minimalRange.minY;
-                        _a.label = 2;
-                    case 2:
-                        if (!(y < minimalRange.maxY)) return [3 /*break*/, 11];
-                        tile = { x: x, y: y, zoom: minimalRange.zoom };
-                        intersection = intersectionFunction(tile, intersectionTarget);
-                        if (verbose) {
-                            console.log("Tile X: ".concat(tile.x, ", Y: ").concat(tile.y, " zoom ").concat(tile.zoom, ", intersection: ").concat(intersection));
-                        }
-                        if (!(intersection === TileIntersectionState.FULL)) return [3 /*break*/, 6];
-                        tileRange = this.tileToRange(tile, zoom);
-                        if (verbose) {
-                            console.log("return BBOX tile range zoom: ".concat(tileRange.zoom, " : X ").concat(tileRange.minX, " - ").concat(tileRange.maxX, " : Y ").concat(tileRange.minY, " - ").concat(tileRange.maxY));
-                        }
-                        return [4 /*yield*/, __await(Promise.resolve(tileRange))];
-                    case 3: return [4 /*yield*/, __await.apply(void 0, [_a.sent()])];
-                    case 4: return [4 /*yield*/, _a.sent()];
-                    case 5:
-                        _a.sent();
-                        return [3 /*break*/, 10];
-                    case 6:
-                        if (!(intersection === TileIntersectionState.PARTIAL)) return [3 /*break*/, 10];
-                        return [4 /*yield*/, __await(Promise.resolve(this.optimizeHash(tile, zoom, intersectionTarget, intersectionFunction, verbose)))];
-                    case 7: 
-                    /// if it partly covered:
-                    // calculate the sub tiles contained in the current tile (in the next zoom level)
-                    // for every sub tile recursively run step 6
-                    //optimize partial base hashes
-                    return [5 /*yield**/, __values(__asyncDelegator.apply(void 0, [__asyncValues.apply(void 0, [_a.sent()])]))];
-                    case 8: 
-                    /// if it partly covered:
-                    // calculate the sub tiles contained in the current tile (in the next zoom level)
-                    // for every sub tile recursively run step 6
-                    //optimize partial base hashes
-                    return [4 /*yield*/, __await.apply(void 0, [_a.sent()])];
-                    case 9:
-                        /// if it partly covered:
-                        // calculate the sub tiles contained in the current tile (in the next zoom level)
-                        // for every sub tile recursively run step 6
-                        //optimize partial base hashes
-                        _a.sent();
-                        _a.label = 10;
-                    case 10:
-                        y++;
-                        return [3 /*break*/, 2];
-                    case 11:
-                        x++;
-                        return [3 /*break*/, 1];
-                    case 12: return [2 /*return*/];
-                }
-            });
-        });
-    };
-    /**
-     * generate tile
-     * @param tile tile to get all intersecting tiles from
-     * @param targetZoom target tiles zoom level
-     * @param intersectionTarget original zoom level and footprint to intersect
-     * @param intersectionFunction the intersection function to be called
-     */
-    TileRanger.prototype.optimizeHash = function (tile, targetZoom, intersectionTarget, intersectionFunction, verbose) {
-        var tiles, tiles_2, tiles_2_1, subTile, intersection, tileRange, e_1_1;
-        var e_1, _a;
-        if (verbose === void 0) { verbose = false; }
-        return __generator(this, function (_b) {
-            switch (_b.label) {
-                case 0:
-                    /// generate from a tile the next zoom level tiles that compose the tile
-                    if (verbose) {
-                        console.log("optimizeHash: Tile X: ".concat(tile.x, ", Y: ").concat(tile.y, " zoom ").concat(tile.zoom, ", intersectionTarget ").concat(intersectionTarget.maxZoom, ", - generate from a tile the next zoom level tiles that compose the tile"));
-                    }
-                    tiles = this.generateSubTiles(tile);
-                    _b.label = 1;
-                case 1:
-                    _b.trys.push([1, 8, 9, 10]);
-                    tiles_2 = __values(tiles), tiles_2_1 = tiles_2.next();
-                    _b.label = 2;
-                case 2:
-                    if (!!tiles_2_1.done) return [3 /*break*/, 7];
-                    subTile = tiles_2_1.value;
-                    intersection = intersectionFunction(subTile, intersectionTarget);
-                    if (verbose) {
-                        console.log("Tile X: ".concat(subTile.x, ", Y: ").concat(subTile.y, " zoom ").concat(subTile.zoom, ", intersection: ").concat(intersection));
-                    }
-                    if (!(intersection === TileIntersectionState.FULL)) return [3 /*break*/, 4];
-                    tileRange = this.tileToRange(subTile, targetZoom);
-                    if (verbose) {
-                        console.log("return BBOX tile range zoom: ".concat(tileRange.zoom, " : X ").concat(tileRange.minX, " - ").concat(tileRange.maxX, " : Y ").concat(tileRange.minY, " - ").concat(tileRange.maxY));
-                    }
-                    return [4 /*yield*/, tileRange];
-                case 3:
-                    _b.sent();
-                    return [3 /*break*/, 6];
-                case 4:
-                    if (!(intersection === TileIntersectionState.PARTIAL)) return [3 /*break*/, 6];
-                    /// if it partly covered:
-                    // calculate the sub tiles contained in the current tile (in the next zoom level) - recursive
-                    return [5 /*yield**/, __values(this.optimizeHash(subTile, targetZoom, intersectionTarget, intersectionFunction, verbose))];
-                case 5:
-                    /// if it partly covered:
-                    // calculate the sub tiles contained in the current tile (in the next zoom level) - recursive
-                    _b.sent();
-                    _b.label = 6;
-                case 6:
-                    tiles_2_1 = tiles_2.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 (tiles_2_1 && !tiles_2_1.done && (_a = tiles_2.return)) _a.call(tiles_2);
-                    }
-                    finally { if (e_1) throw e_1.error; }
-                    return [7 /*endfinally*/];
-                case 10: return [2 /*return*/];
-            }
-        });
-    };
-    TileRanger.prototype.generateSubTiles = function (tile) {
-        var tile0 = { x: tile.x << 1, y: tile.y << 1, zoom: tile.zoom + 1 };
-        var tile1 = { x: tile0.x + 1, y: tile0.y, zoom: tile0.zoom };
-        var tile2 = { x: tile0.x, y: tile0.y + 1, zoom: tile0.zoom };
-        var tile3 = { x: tile0.x + 1, y: tile0.y + 1, zoom: tile0.zoom };
-        var tiles = [tile0, tile1, tile2, tile3];
-        return tiles;
-    };
-    TileRanger.prototype.isBbox = function (footprint) {
-        var bbox = (0, turf_1.bbox)(footprint);
-        var bboxPoly = (0, turf_1.bboxPolygon)(bbox);
-        return (0, turf_1.booleanEqual)(footprint, bboxPoly);
-    };
-    return TileRanger;
-}());
-exports.TileRanger = TileRanger;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.TileRanger = void 0;
+const turf_1 = require("@turf/turf");
+const bboxUtils_1 = require("./bboxUtils");
+const tiles_1 = require("./tiles");
+const tilesGenerator_1 = require("./tilesGenerator");
+var TileIntersectionState;
+(function (TileIntersectionState) {
+    TileIntersectionState["FULL"] = "full";
+    TileIntersectionState["PARTIAL"] = "partial";
+    TileIntersectionState["NONE"] = "none";
+})(TileIntersectionState || (TileIntersectionState = {}));
+/**
+ * class for generating and decoding tile hashes
+ */
+class TileRanger {
+    /**
+     * converts tile to tile range of specified zoom level
+     * @param tile
+     * @param zoom target tile range zoom
+     * @returns
+     */
+    tileToRange(tile, zoom) {
+        let minX, minY, maxX, maxY;
+        minX = tile.x;
+        maxX = tile.x + 1;
+        minY = tile.y;
+        maxY = tile.y + 1;
+        if (tile.zoom < zoom) {
+            const dz = zoom - tile.zoom;
+            minX = minX << dz;
+            maxX = maxX << dz;
+            minY = minY << dz;
+            maxY = maxY << dz;
+        }
+        else if (tile.zoom > zoom) {
+            const dz = tile.zoom - zoom;
+            minX = minX >> dz;
+            minY = minY >> dz;
+            maxX = minX + 1;
+            maxY = minY + 1;
+        }
+        return {
+            minX,
+            minY,
+            maxX,
+            maxY,
+            zoom,
+        };
+    }
+    /**
+     * generate tile hashes
+     * @param footprint footprint to cover with generated tile hashes
+     * @param zoom max hash zoom
+     * @returns
+     */
+    async *encodeFootprint(footprint, zoom, verbose = false) {
+        ////////////////////////////////
+        /// Step 1: check if the footprint is identical to its bbox
+        ////////////////////////////////
+        if (verbose) {
+            console.log('encode footprint');
+        }
+        ////////////////////////////////
+        /// Step 2: convert footprint to BBOX
+        ////////////////////////////////
+        const bbox = (0, turf_1.bbox)(footprint);
+        if (this.isBbox(footprint)) {
+            // if it is convert its bbox directly to tile range and return it (bbox to tiles conversion is fast and direct mathematical conversion)
+            const tileRange = (0, bboxUtils_1.bboxToTileRange)(bbox, zoom);
+            if (verbose) {
+                console.log(`footprint is identical to its bbox - return BBOX tile range zoom: ${tileRange.zoom} : X ${tileRange.minX} - ${tileRange.maxX} : Y ${tileRange.minY} - ${tileRange.maxY}`);
+            }
+            yield await Promise.resolve(tileRange);
+        }
+        else {
+            const intersectionParams = {
+                footprint,
+                maxZoom: zoom,
+            };
+            if (verbose) {
+                console.log('footprint is different from its bbox - generateRanges');
+            }
+            yield* await Promise.resolve(this.generateRanges(bbox, zoom, intersectionParams, this.tileFootprintIntersection, verbose));
+        }
+    }
+    generateTiles(area, zoom) {
+        let gen;
+        if (Array.isArray(area)) {
+            const tileRangeGen = async function* tileRangeGenerator() {
+                yield await Promise.resolve((0, bboxUtils_1.bboxToTileRange)(area, zoom));
+            };
+            gen = tileRangeGen();
+        }
+        else {
+            gen = this.encodeFootprint(area, zoom);
+        }
+        return (0, tilesGenerator_1.tilesGenerator)(gen);
+    }
+    async *generateRanges(bbox, zoom, intersectionTarget, intersectionFunction, verbose = false) {
+        /////////////////////////////////////////////////////////////////////////////////////////////////
+        /// Step 3: Convert the bbox to tile range of the requested zoom
+        /////////////////////////////////////////////////////////////////////////////////////////////////
+        if (verbose) {
+            console.log('Convert the bbox to tile range of the requested zoom');
+        }
+        const boundingRange = (0, bboxUtils_1.bboxToTileRange)(bbox, zoom);
+        if (verbose) {
+            const bboxString = `BBOX[0]: ${bbox[0]}, BBOX[1]: ${bbox[1]}, BBOX[2]: ${bbox[2]}, BBOX[3]: ${bbox[3]}`;
+            console.log(`${bboxString}, Zoom: ${zoom}, bounding range: minX: ${boundingRange.minX}, maxX: ${boundingRange.maxX}, minY: ${boundingRange.minY}, maxY: ${boundingRange.maxY}`);
+        }
+        /////////////////////////////////////////////////////////////////////////////////////////////////
+        /// Step 4: Use range size to calculate zoom level where the target area is smaller then 1 tile
+        ///         (use zoom zero in-case there is no such zoom, for example in global bbox).
+        /////////////////////////////////////////////////////////////////////////////////////////////////
+        // find minimal zoom where the the area can be converted by area the size of single tile to skip levels that can't have full hashes
+        if (verbose) {
+            console.log("find minimal zoom where the the area can be converted by area the size of single tile to skip levels that can't have full hashes");
+        }
+        const dx = boundingRange.maxX - boundingRange.minX;
+        const dy = boundingRange.maxY - boundingRange.minY;
+        const minXZoom = Math.max(Math.floor(Math.log2(1 << (zoom + 1)) / dx) - 1, 0);
+        const minYZoom = Math.max(Math.floor(Math.log2(1 << zoom) / dy), 0);
+        const minZoom = Math.min(minXZoom, minYZoom);
+        if (verbose) {
+            console.log(`MinZoom: ${minZoom}`);
+        }
+        /////////////////////////////////////////////////////////////////////////////////////////////////
+        /// Step 5: convert the requested bbox to to tile range of the zoom level calculated in step 3 (this reduce the iteration required for the calculation)
+        /////////////////////////////////////////////////////////////////////////////////////////////////
+        //find base hashes
+        const minimalRange = (0, bboxUtils_1.bboxToTileRange)(bbox, minZoom);
+        for (let x = minimalRange.minX; x < minimalRange.maxX; x++) {
+            for (let y = minimalRange.minY; y < minimalRange.maxY; y++) {
+                /////////////////////////////////////////////////////////////////////////////////////////////////
+                /// Step 6: for every tile in the current range:
+                /// Step 7: check the tile intersection with the footprint
+                /////////////////////////////////////////////////////////////////////////////////////////////////
+                const tile = { x, y, zoom: minimalRange.zoom };
+                const intersection = intersectionFunction(tile, intersectionTarget);
+                if (verbose) {
+                    console.log(`Tile X: ${tile.x}, Y: ${tile.y} zoom ${tile.zoom}, intersection: ${intersection}`);
+                }
+                /// if it is completely covered or the tile is in the requested zoom:
+                if (intersection === TileIntersectionState.FULL) {
+                    /// convert it to tile range of the requested resolution
+                    /// add the range to the result set (yield is used for lazy calculation to improve memory usage)
+                    const tileRange = this.tileToRange(tile, zoom);
+                    if (verbose) {
+                        console.log(`return BBOX tile range zoom: ${tileRange.zoom} : X ${tileRange.minX} - ${tileRange.maxX} : Y ${tileRange.minY} - ${tileRange.maxY}`);
+                    }
+                    yield await Promise.resolve(tileRange);
+                }
+                else if (intersection === TileIntersectionState.PARTIAL) {
+                    /// if it partly covered:
+                    // calculate the sub tiles contained in the current tile (in the next zoom level)
+                    // for every sub tile recursively run step 6
+                    //optimize partial base hashes
+                    yield* await Promise.resolve(this.optimizeHash(tile, zoom, intersectionTarget, intersectionFunction, verbose));
+                }
+                /// else do nothing as this tiles aren't intersected with the original footprint
+            }
+        }
+    }
+    /**
+     * generate tile
+     * @param tile tile to get all intersecting tiles from
+     * @param targetZoom target tiles zoom level
+     * @param intersectionTarget original zoom level and footprint to intersect
+     * @param intersectionFunction the intersection function to be called
+     */
+    *optimizeHash(tile, targetZoom, intersectionTarget, intersectionFunction, verbose = false) {
+        /// generate from a tile the next zoom level tiles that compose the tile
+        if (verbose) {
+            console.log(`optimizeHash: Tile X: ${tile.x}, Y: ${tile.y} zoom ${tile.zoom}, intersectionTarget ${intersectionTarget.maxZoom}, - generate from a tile the next zoom level tiles that compose the tile`);
+        }
+        const tiles = this.generateSubTiles(tile);
+        for (const subTile of tiles) {
+            const intersection = intersectionFunction(subTile, intersectionTarget);
+            if (verbose) {
+                console.log(`Tile X: ${subTile.x}, Y: ${subTile.y} zoom ${subTile.zoom}, intersection: ${intersection}`);
+            }
+            if (intersection === TileIntersectionState.FULL) {
+                /// convert it to tile range of the requested resolution
+                /// add the range to the result set (yield is used for lazy calculation to improve memory usage)
+                const tileRange = this.tileToRange(subTile, targetZoom);
+                if (verbose) {
+                    console.log(`return BBOX tile range zoom: ${tileRange.zoom} : X ${tileRange.minX} - ${tileRange.maxX} : Y ${tileRange.minY} - ${tileRange.maxY}`);
+                }
+                yield tileRange;
+            }
+            else if (intersection === TileIntersectionState.PARTIAL) {
+                /// if it partly covered:
+                // calculate the sub tiles contained in the current tile (in the next zoom level) - recursive
+                yield* this.optimizeHash(subTile, targetZoom, intersectionTarget, intersectionFunction, verbose);
+            }
+        }
+    }
+    generateSubTiles(tile) {
+        const tile0 = { x: tile.x << 1, y: tile.y << 1, zoom: tile.zoom + 1 };
+        const tile1 = { x: tile0.x + 1, y: tile0.y, zoom: tile0.zoom };
+        const tile2 = { x: tile0.x, y: tile0.y + 1, zoom: tile0.zoom };
+        const tile3 = { x: tile0.x + 1, y: tile0.y + 1, zoom: tile0.zoom };
+        const tiles = [tile0, tile1, tile2, tile3];
+        return tiles;
+    }
+    tileFootprintIntersection = (tile, intersectionParams) => {
+        const tileBbox = (0, tiles_1.tileToBbox)(tile);
+        const tilePoly = (0, turf_1.bboxPolygon)(tileBbox);
+        const intersection = (0, turf_1.intersect)(intersectionParams.footprint, tilePoly);
+        if (intersection === null) {
+            return TileIntersectionState.NONE;
+        }
+        // stop condition
+        if (tile.zoom === intersectionParams.maxZoom) {
+            return TileIntersectionState.FULL;
+        }
+        const intArea = (0, turf_1.area)(intersection);
+        const hashArea = (0, turf_1.area)(tilePoly);
+        if (intArea == hashArea) {
+            return TileIntersectionState.FULL;
+        }
+        return TileIntersectionState.PARTIAL;
+    };
+    isBbox(footprint) {
+        const bbox = (0, turf_1.bbox)(footprint);
+        const bboxPoly = (0, turf_1.bboxPolygon)(bbox);
+        return (0, turf_1.booleanEqual)(footprint, bboxPoly);
+    }
+}
+exports.TileRanger = TileRanger;
 //# sourceMappingURL=tileRanger.js.map