@map-colonies/mc-utils 1.9.0 → 2.0.1
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +67 -67
- package/dist/arrays/index.d.ts +1 -1
- package/dist/arrays/index.d.ts.map +0 -0
- package/dist/arrays/index.js +17 -13
- package/dist/arrays/index.js.map +1 -1
- package/dist/arrays/subGroups.d.ts +8 -8
- package/dist/arrays/subGroups.d.ts.map +0 -0
- package/dist/arrays/subGroups.js +138 -138
- package/dist/arrays/subGroups.js.map +0 -0
- package/dist/communication/http/httpClient.d.ts +29 -28
- package/dist/communication/http/httpClient.d.ts.map +1 -1
- package/dist/communication/http/httpClient.js +434 -429
- package/dist/communication/http/httpClient.js.map +1 -1
- package/dist/communication/http/index.d.ts +1 -1
- package/dist/communication/http/index.d.ts.map +0 -0
- package/dist/communication/http/index.js +17 -13
- package/dist/communication/http/index.js.map +1 -1
- package/dist/communication/index.d.ts +1 -1
- package/dist/communication/index.d.ts.map +0 -0
- package/dist/communication/index.js +17 -13
- package/dist/communication/index.js.map +1 -1
- package/dist/dateTime/getUTCDate.d.ts +1 -1
- package/dist/dateTime/getUTCDate.d.ts.map +0 -0
- package/dist/dateTime/getUTCDate.js +10 -10
- package/dist/dateTime/getUTCDate.js.map +0 -0
- package/dist/dateTime/index.d.ts +1 -1
- package/dist/dateTime/index.d.ts.map +0 -0
- package/dist/dateTime/index.js +17 -13
- package/dist/dateTime/index.js.map +1 -1
- package/dist/geo/bboxUtils.d.ts +23 -23
- package/dist/geo/bboxUtils.d.ts.map +0 -0
- package/dist/geo/bboxUtils.js +89 -89
- package/dist/geo/bboxUtils.js.map +0 -0
- package/dist/geo/geoConvertor.d.ts +18 -18
- package/dist/geo/geoConvertor.d.ts.map +0 -0
- package/dist/geo/geoConvertor.js +51 -51
- package/dist/geo/geoConvertor.js.map +0 -0
- package/dist/geo/geoHash.d.ts +24 -24
- package/dist/geo/geoHash.d.ts.map +1 -1
- package/dist/geo/geoHash.js +274 -242
- package/dist/geo/geoHash.js.map +1 -1
- package/dist/geo/geoIntersection.d.ts +19 -19
- package/dist/geo/geoIntersection.d.ts.map +0 -0
- package/dist/geo/geoIntersection.js +70 -70
- package/dist/geo/geoIntersection.js.map +0 -0
- package/dist/geo/index.d.ts +8 -8
- package/dist/geo/index.d.ts.map +0 -0
- package/dist/geo/index.js +24 -20
- package/dist/geo/index.js.map +1 -1
- package/dist/geo/tileBatcher.d.ts +8 -8
- package/dist/geo/tileBatcher.d.ts.map +1 -1
- package/dist/geo/tileBatcher.js +188 -167
- package/dist/geo/tileBatcher.js.map +1 -1
- package/dist/geo/tileRanger.d.ts +46 -46
- package/dist/geo/tileRanger.d.ts.map +0 -0
- package/dist/geo/tileRanger.js +327 -327
- package/dist/geo/tileRanger.js.map +0 -0
- package/dist/geo/tiles.d.ts +82 -82
- package/dist/geo/tiles.d.ts.map +1 -1
- package/dist/geo/tiles.js +246 -238
- package/dist/geo/tiles.js.map +1 -1
- package/dist/geo/tilesGenerator.d.ts +2 -2
- package/dist/geo/tilesGenerator.d.ts.map +0 -0
- package/dist/geo/tilesGenerator.js +94 -94
- package/dist/geo/tilesGenerator.js.map +0 -0
- package/dist/index.d.ts +5 -5
- package/dist/index.d.ts.map +0 -0
- package/dist/index.js +21 -17
- package/dist/index.js.map +1 -1
- package/dist/models/enums/gdal/dataType.d.ts +16 -16
- package/dist/models/enums/gdal/dataType.d.ts.map +0 -0
- package/dist/models/enums/gdal/dataType.js +20 -20
- package/dist/models/enums/gdal/dataType.js.map +0 -0
- package/dist/models/enums/gdal/index.d.ts +2 -2
- package/dist/models/enums/gdal/index.d.ts.map +0 -0
- package/dist/models/enums/gdal/index.js +18 -14
- package/dist/models/enums/gdal/index.js.map +1 -1
- package/dist/models/enums/gdal/resamplingMethod.d.ts +16 -16
- package/dist/models/enums/gdal/resamplingMethod.d.ts.map +0 -0
- package/dist/models/enums/gdal/resamplingMethod.js +20 -20
- package/dist/models/enums/gdal/resamplingMethod.js.map +0 -0
- package/dist/models/enums/geo/index.d.ts +1 -1
- package/dist/models/enums/geo/index.d.ts.map +0 -0
- package/dist/models/enums/geo/index.js +17 -13
- package/dist/models/enums/geo/index.js.map +1 -1
- package/dist/models/enums/geo/tileOrigin.d.ts +7 -7
- package/dist/models/enums/geo/tileOrigin.d.ts.map +0 -0
- package/dist/models/enums/geo/tileOrigin.js +11 -11
- package/dist/models/enums/geo/tileOrigin.js.map +0 -0
- package/dist/models/enums/index.d.ts +2 -2
- package/dist/models/enums/index.d.ts.map +0 -0
- package/dist/models/enums/index.js +18 -14
- package/dist/models/enums/index.js.map +1 -1
- package/dist/models/index.d.ts +2 -2
- package/dist/models/index.d.ts.map +0 -0
- package/dist/models/index.js +18 -14
- package/dist/models/index.js.map +1 -1
- package/dist/models/interfaces/geo/iPoint.d.ts +7 -7
- package/dist/models/interfaces/geo/iPoint.d.ts.map +0 -0
- package/dist/models/interfaces/geo/iPoint.js +2 -2
- package/dist/models/interfaces/geo/iPoint.js.map +0 -0
- package/dist/models/interfaces/geo/iTile.d.ts +15 -15
- package/dist/models/interfaces/geo/iTile.d.ts.map +0 -0
- package/dist/models/interfaces/geo/iTile.js +2 -2
- package/dist/models/interfaces/geo/iTile.js.map +0 -0
- package/dist/models/interfaces/geo/index.d.ts +2 -2
- package/dist/models/interfaces/geo/index.d.ts.map +0 -0
- package/dist/models/interfaces/geo/index.js +18 -14
- package/dist/models/interfaces/geo/index.js.map +1 -1
- package/dist/models/interfaces/index.d.ts +1 -1
- package/dist/models/interfaces/index.d.ts.map +0 -0
- package/dist/models/interfaces/index.js +17 -13
- package/dist/models/interfaces/index.js.map +1 -1
- package/package.json +79 -79
package/dist/geo/tileBatcher.js
CHANGED
|
@@ -1,168 +1,189 @@
|
|
|
1
|
-
"use strict";
|
|
2
|
-
var __generator = (this && this.__generator) || function (thisArg, body) {
|
|
3
|
-
var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;
|
|
4
|
-
return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
|
|
5
|
-
function verb(n) { return function (v) { return step([n, v]); }; }
|
|
6
|
-
function step(op) {
|
|
7
|
-
if (f) throw new TypeError("Generator is already executing.");
|
|
8
|
-
while (_) try {
|
|
9
|
-
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;
|
|
10
|
-
if (y = 0, t) op = [op[0] & 2, t.value];
|
|
11
|
-
switch (op[0]) {
|
|
12
|
-
case 0: case 1: t = op; break;
|
|
13
|
-
case 4: _.label++; return { value: op[1], done: false };
|
|
14
|
-
case 5: _.label++; y = op[1]; op = [0]; continue;
|
|
15
|
-
case 7: op = _.ops.pop(); _.trys.pop(); continue;
|
|
16
|
-
default:
|
|
17
|
-
if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }
|
|
18
|
-
if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }
|
|
19
|
-
if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }
|
|
20
|
-
if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }
|
|
21
|
-
if (t[2]) _.ops.pop();
|
|
22
|
-
_.trys.pop(); continue;
|
|
23
|
-
}
|
|
24
|
-
op = body.call(thisArg, _);
|
|
25
|
-
} catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }
|
|
26
|
-
if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };
|
|
27
|
-
}
|
|
28
|
-
};
|
|
29
|
-
var
|
|
30
|
-
|
|
31
|
-
|
|
32
|
-
|
|
33
|
-
|
|
34
|
-
|
|
35
|
-
|
|
36
|
-
|
|
37
|
-
|
|
38
|
-
throw new TypeError(
|
|
39
|
-
|
|
40
|
-
|
|
41
|
-
|
|
42
|
-
|
|
43
|
-
|
|
44
|
-
|
|
45
|
-
|
|
46
|
-
|
|
47
|
-
|
|
48
|
-
|
|
49
|
-
|
|
50
|
-
|
|
51
|
-
|
|
52
|
-
|
|
53
|
-
|
|
54
|
-
|
|
55
|
-
|
|
56
|
-
|
|
57
|
-
|
|
58
|
-
|
|
59
|
-
|
|
60
|
-
|
|
61
|
-
|
|
62
|
-
|
|
63
|
-
|
|
64
|
-
|
|
65
|
-
|
|
66
|
-
|
|
67
|
-
|
|
68
|
-
|
|
69
|
-
|
|
70
|
-
|
|
71
|
-
|
|
72
|
-
|
|
73
|
-
|
|
74
|
-
|
|
75
|
-
|
|
76
|
-
|
|
77
|
-
|
|
78
|
-
|
|
79
|
-
|
|
80
|
-
|
|
81
|
-
|
|
82
|
-
|
|
83
|
-
|
|
84
|
-
|
|
85
|
-
|
|
86
|
-
|
|
87
|
-
|
|
88
|
-
|
|
89
|
-
|
|
90
|
-
|
|
91
|
-
|
|
92
|
-
|
|
93
|
-
|
|
94
|
-
|
|
95
|
-
|
|
96
|
-
|
|
97
|
-
|
|
98
|
-
|
|
99
|
-
|
|
100
|
-
|
|
101
|
-
|
|
102
|
-
|
|
103
|
-
|
|
104
|
-
|
|
105
|
-
|
|
106
|
-
|
|
107
|
-
|
|
108
|
-
|
|
109
|
-
|
|
110
|
-
|
|
111
|
-
|
|
112
|
-
|
|
113
|
-
|
|
114
|
-
|
|
115
|
-
|
|
116
|
-
|
|
117
|
-
|
|
118
|
-
|
|
119
|
-
|
|
120
|
-
|
|
121
|
-
|
|
122
|
-
|
|
123
|
-
|
|
124
|
-
|
|
125
|
-
|
|
126
|
-
|
|
127
|
-
|
|
128
|
-
|
|
129
|
-
|
|
130
|
-
|
|
131
|
-
|
|
132
|
-
|
|
133
|
-
|
|
134
|
-
|
|
135
|
-
|
|
136
|
-
|
|
137
|
-
|
|
138
|
-
|
|
139
|
-
|
|
140
|
-
|
|
141
|
-
|
|
142
|
-
|
|
143
|
-
|
|
144
|
-
|
|
145
|
-
|
|
146
|
-
|
|
147
|
-
|
|
148
|
-
|
|
149
|
-
|
|
150
|
-
return [
|
|
151
|
-
|
|
152
|
-
|
|
153
|
-
|
|
154
|
-
|
|
155
|
-
|
|
156
|
-
return [
|
|
157
|
-
|
|
158
|
-
|
|
159
|
-
|
|
160
|
-
|
|
161
|
-
|
|
162
|
-
|
|
163
|
-
|
|
164
|
-
|
|
165
|
-
|
|
166
|
-
|
|
167
|
-
|
|
1
|
+
"use strict";
|
|
2
|
+
var __generator = (this && this.__generator) || function (thisArg, body) {
|
|
3
|
+
var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;
|
|
4
|
+
return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
|
|
5
|
+
function verb(n) { return function (v) { return step([n, v]); }; }
|
|
6
|
+
function step(op) {
|
|
7
|
+
if (f) throw new TypeError("Generator is already executing.");
|
|
8
|
+
while (_) try {
|
|
9
|
+
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;
|
|
10
|
+
if (y = 0, t) op = [op[0] & 2, t.value];
|
|
11
|
+
switch (op[0]) {
|
|
12
|
+
case 0: case 1: t = op; break;
|
|
13
|
+
case 4: _.label++; return { value: op[1], done: false };
|
|
14
|
+
case 5: _.label++; y = op[1]; op = [0]; continue;
|
|
15
|
+
case 7: op = _.ops.pop(); _.trys.pop(); continue;
|
|
16
|
+
default:
|
|
17
|
+
if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }
|
|
18
|
+
if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }
|
|
19
|
+
if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }
|
|
20
|
+
if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }
|
|
21
|
+
if (t[2]) _.ops.pop();
|
|
22
|
+
_.trys.pop(); continue;
|
|
23
|
+
}
|
|
24
|
+
op = body.call(thisArg, _);
|
|
25
|
+
} catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }
|
|
26
|
+
if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };
|
|
27
|
+
}
|
|
28
|
+
};
|
|
29
|
+
var __asyncValues = (this && this.__asyncValues) || function (o) {
|
|
30
|
+
if (!Symbol.asyncIterator) throw new TypeError("Symbol.asyncIterator is not defined.");
|
|
31
|
+
var m = o[Symbol.asyncIterator], i;
|
|
32
|
+
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);
|
|
33
|
+
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); }); }; }
|
|
34
|
+
function settle(resolve, reject, d, v) { Promise.resolve(v).then(function(v) { resolve({ value: v, done: d }); }, reject); }
|
|
35
|
+
};
|
|
36
|
+
var __await = (this && this.__await) || function (v) { return this instanceof __await ? (this.v = v, this) : new __await(v); }
|
|
37
|
+
var __asyncGenerator = (this && this.__asyncGenerator) || function (thisArg, _arguments, generator) {
|
|
38
|
+
if (!Symbol.asyncIterator) throw new TypeError("Symbol.asyncIterator is not defined.");
|
|
39
|
+
var g = generator.apply(thisArg, _arguments || []), i, q = [];
|
|
40
|
+
return i = {}, verb("next"), verb("throw"), verb("return"), i[Symbol.asyncIterator] = function () { return this; }, i;
|
|
41
|
+
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); }); }; }
|
|
42
|
+
function resume(n, v) { try { step(g[n](v)); } catch (e) { settle(q[0][3], e); } }
|
|
43
|
+
function step(r) { r.value instanceof __await ? Promise.resolve(r.value.v).then(fulfill, reject) : settle(q[0][2], r); }
|
|
44
|
+
function fulfill(value) { resume("next", value); }
|
|
45
|
+
function reject(value) { resume("throw", value); }
|
|
46
|
+
function settle(f, v) { if (f(v), q.shift(), q.length) resume(q[0][0], q[0][1]); }
|
|
47
|
+
};
|
|
48
|
+
Object.defineProperty(exports, "__esModule", { value: true });
|
|
49
|
+
exports.tileBatchGenerator = void 0;
|
|
50
|
+
/**
|
|
51
|
+
* split collection of tile ranges to batches based on tile count
|
|
52
|
+
* @param batchSize amount of tile per batch
|
|
53
|
+
* @param ranges iterable collection of tile ranges
|
|
54
|
+
*/
|
|
55
|
+
function tileBatchGenerator(batchSize, ranges) {
|
|
56
|
+
return __asyncGenerator(this, arguments, function tileBatchGenerator_1() {
|
|
57
|
+
var targetRanges, requiredForFullBatch, ranges_1, ranges_1_1, range, dx, dy, reminderX, remaining, requiredLines, yRange, endX, e_1_1;
|
|
58
|
+
var e_1, _a;
|
|
59
|
+
return __generator(this, function (_b) {
|
|
60
|
+
switch (_b.label) {
|
|
61
|
+
case 0:
|
|
62
|
+
targetRanges = [];
|
|
63
|
+
requiredForFullBatch = batchSize;
|
|
64
|
+
_b.label = 1;
|
|
65
|
+
case 1:
|
|
66
|
+
_b.trys.push([1, 16, 17, 22]);
|
|
67
|
+
ranges_1 = __asyncValues(ranges);
|
|
68
|
+
_b.label = 2;
|
|
69
|
+
case 2: return [4 /*yield*/, __await(ranges_1.next())];
|
|
70
|
+
case 3:
|
|
71
|
+
if (!(ranges_1_1 = _b.sent(), !ranges_1_1.done)) return [3 /*break*/, 15];
|
|
72
|
+
range = ranges_1_1.value;
|
|
73
|
+
dx = range.maxX - range.minX;
|
|
74
|
+
dy = range.maxY - range.minY;
|
|
75
|
+
if (dx === 0 || dy === 0) {
|
|
76
|
+
return [3 /*break*/, 14];
|
|
77
|
+
}
|
|
78
|
+
reminderX = range.maxX;
|
|
79
|
+
_b.label = 4;
|
|
80
|
+
case 4:
|
|
81
|
+
if (!(range.minY < range.maxY)) return [3 /*break*/, 14];
|
|
82
|
+
if (!(reminderX < range.maxX)) return [3 /*break*/, 9];
|
|
83
|
+
remaining = range.maxX - reminderX;
|
|
84
|
+
if (!(remaining > requiredForFullBatch)) return [3 /*break*/, 8];
|
|
85
|
+
targetRanges.push({
|
|
86
|
+
minX: reminderX,
|
|
87
|
+
maxX: reminderX + requiredForFullBatch,
|
|
88
|
+
minY: range.minY,
|
|
89
|
+
maxY: range.minY + 1,
|
|
90
|
+
zoom: range.zoom,
|
|
91
|
+
});
|
|
92
|
+
return [4 /*yield*/, __await(Promise.resolve(targetRanges))];
|
|
93
|
+
case 5: return [4 /*yield*/, __await.apply(void 0, [_b.sent()])];
|
|
94
|
+
case 6: return [4 /*yield*/, _b.sent()];
|
|
95
|
+
case 7:
|
|
96
|
+
_b.sent();
|
|
97
|
+
reminderX += requiredForFullBatch;
|
|
98
|
+
targetRanges = [];
|
|
99
|
+
requiredForFullBatch = batchSize;
|
|
100
|
+
return [3 /*break*/, 4];
|
|
101
|
+
case 8:
|
|
102
|
+
targetRanges.push({
|
|
103
|
+
minX: reminderX,
|
|
104
|
+
maxX: reminderX + remaining,
|
|
105
|
+
minY: range.minY,
|
|
106
|
+
maxY: range.minY + 1,
|
|
107
|
+
zoom: range.zoom,
|
|
108
|
+
});
|
|
109
|
+
range.minY++;
|
|
110
|
+
reminderX += remaining;
|
|
111
|
+
requiredForFullBatch -= remaining;
|
|
112
|
+
dy--;
|
|
113
|
+
_b.label = 9;
|
|
114
|
+
case 9:
|
|
115
|
+
requiredLines = Math.floor(requiredForFullBatch / dx);
|
|
116
|
+
yRange = Math.min(requiredLines, dy);
|
|
117
|
+
if (yRange > 0) {
|
|
118
|
+
targetRanges.push({
|
|
119
|
+
minX: range.minX,
|
|
120
|
+
maxX: range.maxX,
|
|
121
|
+
minY: range.minY,
|
|
122
|
+
maxY: range.minY + yRange,
|
|
123
|
+
zoom: range.zoom,
|
|
124
|
+
});
|
|
125
|
+
range.minY += yRange;
|
|
126
|
+
dy -= yRange;
|
|
127
|
+
requiredForFullBatch -= yRange * dx;
|
|
128
|
+
}
|
|
129
|
+
//add partial lines beginning
|
|
130
|
+
if (requiredForFullBatch > 0 && range.minY < range.maxY) {
|
|
131
|
+
endX = Math.min(range.minX + requiredForFullBatch, range.maxX);
|
|
132
|
+
targetRanges.push({
|
|
133
|
+
minX: range.minX,
|
|
134
|
+
maxX: endX,
|
|
135
|
+
minY: range.minY,
|
|
136
|
+
maxY: range.minY + 1,
|
|
137
|
+
zoom: range.zoom,
|
|
138
|
+
});
|
|
139
|
+
requiredForFullBatch -= endX - range.minX;
|
|
140
|
+
if (endX < range.maxX) {
|
|
141
|
+
reminderX = endX;
|
|
142
|
+
}
|
|
143
|
+
else {
|
|
144
|
+
range.minY++;
|
|
145
|
+
}
|
|
146
|
+
}
|
|
147
|
+
if (!(requiredForFullBatch === 0)) return [3 /*break*/, 13];
|
|
148
|
+
return [4 /*yield*/, __await(Promise.resolve(targetRanges))];
|
|
149
|
+
case 10: return [4 /*yield*/, __await.apply(void 0, [_b.sent()])];
|
|
150
|
+
case 11: return [4 /*yield*/, _b.sent()];
|
|
151
|
+
case 12:
|
|
152
|
+
_b.sent();
|
|
153
|
+
targetRanges = [];
|
|
154
|
+
requiredForFullBatch = batchSize;
|
|
155
|
+
_b.label = 13;
|
|
156
|
+
case 13: return [3 /*break*/, 4];
|
|
157
|
+
case 14: return [3 /*break*/, 2];
|
|
158
|
+
case 15: return [3 /*break*/, 22];
|
|
159
|
+
case 16:
|
|
160
|
+
e_1_1 = _b.sent();
|
|
161
|
+
e_1 = { error: e_1_1 };
|
|
162
|
+
return [3 /*break*/, 22];
|
|
163
|
+
case 17:
|
|
164
|
+
_b.trys.push([17, , 20, 21]);
|
|
165
|
+
if (!(ranges_1_1 && !ranges_1_1.done && (_a = ranges_1.return))) return [3 /*break*/, 19];
|
|
166
|
+
return [4 /*yield*/, __await(_a.call(ranges_1))];
|
|
167
|
+
case 18:
|
|
168
|
+
_b.sent();
|
|
169
|
+
_b.label = 19;
|
|
170
|
+
case 19: return [3 /*break*/, 21];
|
|
171
|
+
case 20:
|
|
172
|
+
if (e_1) throw e_1.error;
|
|
173
|
+
return [7 /*endfinally*/];
|
|
174
|
+
case 21: return [7 /*endfinally*/];
|
|
175
|
+
case 22:
|
|
176
|
+
if (!(targetRanges.length > 0)) return [3 /*break*/, 26];
|
|
177
|
+
return [4 /*yield*/, __await(Promise.resolve(targetRanges))];
|
|
178
|
+
case 23: return [4 /*yield*/, __await.apply(void 0, [_b.sent()])];
|
|
179
|
+
case 24: return [4 /*yield*/, _b.sent()];
|
|
180
|
+
case 25:
|
|
181
|
+
_b.sent();
|
|
182
|
+
_b.label = 26;
|
|
183
|
+
case 26: return [2 /*return*/];
|
|
184
|
+
}
|
|
185
|
+
});
|
|
186
|
+
});
|
|
187
|
+
}
|
|
188
|
+
exports.tileBatchGenerator = tileBatchGenerator;
|
|
168
189
|
//# sourceMappingURL=tileBatcher.js.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"tileBatcher.js","sourceRoot":"","sources":["../../src/geo/tileBatcher.ts"],"names":[],"mappings":"
|
|
1
|
+
{"version":3,"file":"tileBatcher.js","sourceRoot":"","sources":["../../src/geo/tileBatcher.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAEA;;;;GAIG;AACH,SAAgB,kBAAkB,CAAC,SAAiB,EAAE,MAA4B;;;;;;;oBAC5E,YAAY,GAAiB,EAAE,CAAC;oBAChC,oBAAoB,GAAG,SAAS,CAAC;;;;oBACZ,WAAA,cAAA,MAAM,CAAA;;;;;oBAAf,KAAK,mBAAA,CAAA;oBACb,EAAE,GAAG,KAAK,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC;oBAC/B,EAAE,GAAG,KAAK,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC;oBACjC,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE;wBACxB,yBAAS;qBACV;oBACG,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC;;;yBACpB,CAAA,KAAK,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAA;yBAExB,CAAA,SAAS,GAAG,KAAK,CAAC,IAAI,CAAA,EAAtB,wBAAsB;oBAClB,SAAS,GAAG,KAAK,CAAC,IAAI,GAAG,SAAS,CAAC;yBACrC,CAAA,SAAS,GAAG,oBAAoB,CAAA,EAAhC,wBAAgC;oBAClC,YAAY,CAAC,IAAI,CAAC;wBAChB,IAAI,EAAE,SAAS;wBACf,IAAI,EAAE,SAAS,GAAG,oBAAoB;wBACtC,IAAI,EAAE,KAAK,CAAC,IAAI;wBAChB,IAAI,EAAE,KAAK,CAAC,IAAI,GAAG,CAAC;wBACpB,IAAI,EAAE,KAAK,CAAC,IAAI;qBACjB,CAAC,CAAC;oBACG,6BAAM,OAAO,CAAC,OAAO,CAAC,YAAY,CAAC,GAAA;oEAAnC,SAAmC;wBAAzC,gCAAyC;;oBAAzC,SAAyC,CAAC;oBAC1C,SAAS,IAAI,oBAAoB,CAAC;oBAClC,YAAY,GAAG,EAAE,CAAC;oBAClB,oBAAoB,GAAG,SAAS,CAAC;oBACjC,wBAAS;;oBAET,YAAY,CAAC,IAAI,CAAC;wBAChB,IAAI,EAAE,SAAS;wBACf,IAAI,EAAE,SAAS,GAAG,SAAS;wBAC3B,IAAI,EAAE,KAAK,CAAC,IAAI;wBAChB,IAAI,EAAE,KAAK,CAAC,IAAI,GAAG,CAAC;wBACpB,IAAI,EAAE,KAAK,CAAC,IAAI;qBACjB,CAAC,CAAC;oBACH,KAAK,CAAC,IAAI,EAAE,CAAC;oBACb,SAAS,IAAI,SAAS,CAAC;oBACvB,oBAAoB,IAAI,SAAS,CAAC;oBAClC,EAAE,EAAE,CAAC;;;oBAIH,aAAa,GAAG,IAAI,CAAC,KAAK,CAAC,oBAAoB,GAAG,EAAE,CAAC,CAAC;oBACtD,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,aAAa,EAAE,EAAE,CAAC,CAAC;oBAC3C,IAAI,MAAM,GAAG,CAAC,EAAE;wBACd,YAAY,CAAC,IAAI,CAAC;4BAChB,IAAI,EAAE,KAAK,CAAC,IAAI;4BAChB,IAAI,EAAE,KAAK,CAAC,IAAI;4BAChB,IAAI,EAAE,KAAK,CAAC,IAAI;4BAChB,IAAI,EAAE,KAAK,CAAC,IAAI,GAAG,MAAM;4BACzB,IAAI,EAAE,KAAK,CAAC,IAAI;yBACjB,CAAC,CAAC;wBACH,KAAK,CAAC,IAAI,IAAI,MAAM,CAAC;wBACrB,EAAE,IAAI,MAAM,CAAC;wBACb,oBAAoB,IAAI,MAAM,GAAG,EAAE,CAAC;qBACrC;oBACD,6BAA6B;oBAC7B,IAAI,oBAAoB,GAAG,CAAC,IAAI,KAAK,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,EAAE;wBACjD,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,GAAG,oBAAoB,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;wBACrE,YAAY,CAAC,IAAI,CAAC;4BAChB,IAAI,EAAE,KAAK,CAAC,IAAI;4BAChB,IAAI,EAAE,IAAI;4BACV,IAAI,EAAE,KAAK,CAAC,IAAI;4BAChB,IAAI,EAAE,KAAK,CAAC,IAAI,GAAG,CAAC;4BACpB,IAAI,EAAE,KAAK,CAAC,IAAI;yBACjB,CAAC,CAAC;wBACH,oBAAoB,IAAI,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC;wBAC1C,IAAI,IAAI,GAAG,KAAK,CAAC,IAAI,EAAE;4BACrB,SAAS,GAAG,IAAI,CAAC;yBAClB;6BAAM;4BACL,KAAK,CAAC,IAAI,EAAE,CAAC;yBACd;qBACF;yBACG,CAAA,oBAAoB,KAAK,CAAC,CAAA,EAA1B,yBAA0B;oBACtB,6BAAM,OAAO,CAAC,OAAO,CAAC,YAAY,CAAC,GAAA;qEAAnC,SAAmC;yBAAzC,gCAAyC;;oBAAzC,SAAyC,CAAC;oBAC1C,YAAY,GAAG,EAAE,CAAC;oBAClB,oBAAoB,GAAG,SAAS,CAAC;;;;;;;;;;;;;;;;;;;;;;yBAInC,CAAA,YAAY,CAAC,MAAM,GAAG,CAAC,CAAA,EAAvB,yBAAuB;oBACnB,6BAAM,OAAO,CAAC,OAAO,CAAC,YAAY,CAAC,GAAA;qEAAnC,SAAmC;yBAAzC,gCAAyC;;oBAAzC,SAAyC,CAAC;;;;;;CAE7C;AAEQ,gDAAkB"}
|
package/dist/geo/tileRanger.d.ts
CHANGED
|
@@ -1,47 +1,47 @@
|
|
|
1
|
-
import { BBox2d } from '@turf/helpers/dist/js/lib/geojson';
|
|
2
|
-
import { Feature, MultiPolygon, Polygon } from '@turf/turf';
|
|
3
|
-
import { ITile, ITileRange } from '../models/interfaces/geo/iTile';
|
|
4
|
-
/**
|
|
5
|
-
* class for generating and decoding tile hashes
|
|
6
|
-
*/
|
|
7
|
-
export declare class TileRanger {
|
|
8
|
-
/**
|
|
9
|
-
* converts tile to tile range of specified zoom level
|
|
10
|
-
* @param tile
|
|
11
|
-
* @param zoom target tile range zoom
|
|
12
|
-
* @returns
|
|
13
|
-
*/
|
|
14
|
-
tileToRange(tile: ITile, zoom: number): ITileRange;
|
|
15
|
-
/**
|
|
16
|
-
* generate tile hashes
|
|
17
|
-
* @param footprint footprint to cover with generated tile hashes
|
|
18
|
-
* @param zoom max hash zoom
|
|
19
|
-
* @returns
|
|
20
|
-
*/
|
|
21
|
-
encodeFootprint(footprint: Polygon | Feature<Polygon | MultiPolygon>, zoom: number, verbose?: boolean): Generator<ITileRange>;
|
|
22
|
-
/**
|
|
23
|
-
* generate tile
|
|
24
|
-
* @param bbox bbox to cover with generated tiles
|
|
25
|
-
* @param zoom target tiles zoom level
|
|
26
|
-
*/
|
|
27
|
-
generateTiles(bbox: BBox2d, zoom: number): Generator<ITile>;
|
|
28
|
-
/**
|
|
29
|
-
* generate tile
|
|
30
|
-
* @param footprint footprint to cover with generated tiles
|
|
31
|
-
* @param zoom target tiles zoom level
|
|
32
|
-
*/
|
|
33
|
-
generateTiles(footprint: Polygon | Feature<Polygon | MultiPolygon>, zoom: number): Generator<ITile>;
|
|
34
|
-
private generateRanges;
|
|
35
|
-
/**
|
|
36
|
-
* generate tile
|
|
37
|
-
* @param tile tile to get all intersecting tiles from
|
|
38
|
-
* @param targetZoom target tiles zoom level
|
|
39
|
-
* @param intersectionTarget original zoom level and footprint to intersect
|
|
40
|
-
* @param intersectionFunction the intersection function to be called
|
|
41
|
-
*/
|
|
42
|
-
private optimizeHash;
|
|
43
|
-
private generateSubTiles;
|
|
44
|
-
private readonly tileFootprintIntersection;
|
|
45
|
-
private isBbox;
|
|
46
|
-
}
|
|
1
|
+
import { BBox2d } from '@turf/helpers/dist/js/lib/geojson';
|
|
2
|
+
import { Feature, MultiPolygon, Polygon } from '@turf/turf';
|
|
3
|
+
import { ITile, ITileRange } from '../models/interfaces/geo/iTile';
|
|
4
|
+
/**
|
|
5
|
+
* class for generating and decoding tile hashes
|
|
6
|
+
*/
|
|
7
|
+
export declare class TileRanger {
|
|
8
|
+
/**
|
|
9
|
+
* converts tile to tile range of specified zoom level
|
|
10
|
+
* @param tile
|
|
11
|
+
* @param zoom target tile range zoom
|
|
12
|
+
* @returns
|
|
13
|
+
*/
|
|
14
|
+
tileToRange(tile: ITile, zoom: number): ITileRange;
|
|
15
|
+
/**
|
|
16
|
+
* generate tile hashes
|
|
17
|
+
* @param footprint footprint to cover with generated tile hashes
|
|
18
|
+
* @param zoom max hash zoom
|
|
19
|
+
* @returns
|
|
20
|
+
*/
|
|
21
|
+
encodeFootprint(footprint: Polygon | Feature<Polygon | MultiPolygon>, zoom: number, verbose?: boolean): Generator<ITileRange>;
|
|
22
|
+
/**
|
|
23
|
+
* generate tile
|
|
24
|
+
* @param bbox bbox to cover with generated tiles
|
|
25
|
+
* @param zoom target tiles zoom level
|
|
26
|
+
*/
|
|
27
|
+
generateTiles(bbox: BBox2d, zoom: number): Generator<ITile>;
|
|
28
|
+
/**
|
|
29
|
+
* generate tile
|
|
30
|
+
* @param footprint footprint to cover with generated tiles
|
|
31
|
+
* @param zoom target tiles zoom level
|
|
32
|
+
*/
|
|
33
|
+
generateTiles(footprint: Polygon | Feature<Polygon | MultiPolygon>, zoom: number): Generator<ITile>;
|
|
34
|
+
private generateRanges;
|
|
35
|
+
/**
|
|
36
|
+
* generate tile
|
|
37
|
+
* @param tile tile to get all intersecting tiles from
|
|
38
|
+
* @param targetZoom target tiles zoom level
|
|
39
|
+
* @param intersectionTarget original zoom level and footprint to intersect
|
|
40
|
+
* @param intersectionFunction the intersection function to be called
|
|
41
|
+
*/
|
|
42
|
+
private optimizeHash;
|
|
43
|
+
private generateSubTiles;
|
|
44
|
+
private readonly tileFootprintIntersection;
|
|
45
|
+
private isBbox;
|
|
46
|
+
}
|
|
47
47
|
//# sourceMappingURL=tileRanger.d.ts.map
|
|
File without changes
|