@map-colonies/mc-utils 1.4.0 → 1.4.4

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.
Files changed (53) hide show
  1. package/CHANGELOG.md +71 -0
  2. package/dist/arrays/index.d.ts +1 -1
  3. package/dist/arrays/index.js +13 -13
  4. package/dist/arrays/subGroups.d.ts +8 -8
  5. package/dist/arrays/subGroups.js +138 -138
  6. package/dist/communication/http/httpClient.d.ts +26 -25
  7. package/dist/communication/http/httpClient.d.ts.map +1 -1
  8. package/dist/communication/http/httpClient.js +333 -341
  9. package/dist/communication/http/httpClient.js.map +1 -1
  10. package/dist/communication/http/index.d.ts +1 -1
  11. package/dist/communication/http/index.js +13 -13
  12. package/dist/communication/index.d.ts +1 -1
  13. package/dist/communication/index.js +13 -13
  14. package/dist/geo/bboxUtils.d.ts +23 -23
  15. package/dist/geo/bboxUtils.js +84 -84
  16. package/dist/geo/geoConvertor.d.ts +18 -18
  17. package/dist/geo/geoConvertor.js +51 -51
  18. package/dist/geo/geoHash.d.ts +24 -24
  19. package/dist/geo/geoHash.js +242 -242
  20. package/dist/geo/geoIntersection.d.ts +12 -12
  21. package/dist/geo/geoIntersection.js +27 -27
  22. package/dist/geo/index.d.ts +8 -8
  23. package/dist/geo/index.js +20 -20
  24. package/dist/geo/tileBatcher.d.ts +8 -8
  25. package/dist/geo/tileBatcher.js +167 -167
  26. package/dist/geo/tileRanger.d.ts +39 -39
  27. package/dist/geo/tileRanger.js +254 -254
  28. package/dist/geo/tiles.d.ts +32 -32
  29. package/dist/geo/tiles.js +65 -65
  30. package/dist/geo/tiles.js.map +1 -1
  31. package/dist/geo/tilesGenerator.d.ts +2 -2
  32. package/dist/geo/tilesGenerator.js +94 -94
  33. package/dist/index.d.ts +4 -4
  34. package/dist/index.js +16 -16
  35. package/dist/models/enums/geo/index.d.ts +1 -1
  36. package/dist/models/enums/geo/index.js +13 -13
  37. package/dist/models/enums/geo/tileOrigin.d.ts +7 -7
  38. package/dist/models/enums/geo/tileOrigin.js +11 -11
  39. package/dist/models/enums/index.d.ts +1 -1
  40. package/dist/models/enums/index.js +13 -13
  41. package/dist/models/index.d.ts +2 -2
  42. package/dist/models/index.js +14 -14
  43. package/dist/models/interfaces/geo/iPoint.d.ts +7 -7
  44. package/dist/models/interfaces/geo/iPoint.js +2 -2
  45. package/dist/models/interfaces/geo/iTile.d.ts +15 -15
  46. package/dist/models/interfaces/geo/iTile.js +2 -2
  47. package/dist/models/interfaces/geo/index.d.ts +2 -2
  48. package/dist/models/interfaces/geo/index.js +14 -14
  49. package/dist/models/interfaces/iLogger.d.ts +6 -6
  50. package/dist/models/interfaces/iLogger.js +2 -2
  51. package/dist/models/interfaces/index.d.ts +2 -2
  52. package/dist/models/interfaces/index.js +14 -14
  53. package/package.json +1 -1
@@ -1,168 +1,168 @@
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 __values = (this && this.__values) || function(o) {
30
- var s = typeof Symbol === "function" && Symbol.iterator, m = s && o[s], i = 0;
31
- if (m) return m.call(o);
32
- if (o && typeof o.length === "number") return {
33
- next: function () {
34
- if (o && i >= o.length) o = void 0;
35
- return { value: o && o[i++], done: !o };
36
- }
37
- };
38
- throw new TypeError(s ? "Object is not iterable." : "Symbol.iterator is not defined.");
39
- };
40
- Object.defineProperty(exports, "__esModule", { value: true });
41
- exports.tileBatchGenerator = void 0;
42
- /**
43
- * split collection of tile ranges to batches based on tile count
44
- * @param batchSize amount of tile per batch
45
- * @param ranges iterable collection of tile ranges
46
- */
47
- function tileBatchGenerator(batchSize, ranges) {
48
- var targetRanges, requiredForFullBatch, ranges_1, ranges_1_1, range, dx, dy, reminderX, remaining, requiredLines, yRange, endX, e_1_1;
49
- var e_1, _a;
50
- return __generator(this, function (_b) {
51
- switch (_b.label) {
52
- case 0:
53
- targetRanges = [];
54
- requiredForFullBatch = batchSize;
55
- _b.label = 1;
56
- case 1:
57
- _b.trys.push([1, 11, 12, 13]);
58
- ranges_1 = __values(ranges), ranges_1_1 = ranges_1.next();
59
- _b.label = 2;
60
- case 2:
61
- if (!!ranges_1_1.done) return [3 /*break*/, 10];
62
- range = ranges_1_1.value;
63
- dx = range.maxX - range.minX;
64
- dy = range.maxY - range.minY;
65
- if (dx === 0 || dy === 0) {
66
- return [3 /*break*/, 9];
67
- }
68
- reminderX = range.maxX;
69
- _b.label = 3;
70
- case 3:
71
- if (!(range.minY < range.maxY)) return [3 /*break*/, 9];
72
- if (!(reminderX < range.maxX)) return [3 /*break*/, 6];
73
- remaining = range.maxX - reminderX;
74
- if (!(remaining > requiredForFullBatch)) return [3 /*break*/, 5];
75
- targetRanges.push({
76
- minX: reminderX,
77
- maxX: reminderX + requiredForFullBatch,
78
- minY: range.minY,
79
- maxY: range.minY + 1,
80
- zoom: range.zoom,
81
- });
82
- return [4 /*yield*/, targetRanges];
83
- case 4:
84
- _b.sent();
85
- reminderX += requiredForFullBatch;
86
- targetRanges = [];
87
- requiredForFullBatch = batchSize;
88
- return [3 /*break*/, 3];
89
- case 5:
90
- targetRanges.push({
91
- minX: reminderX,
92
- maxX: reminderX + remaining,
93
- minY: range.minY,
94
- maxY: range.minY + 1,
95
- zoom: range.zoom,
96
- });
97
- range.minY++;
98
- reminderX += remaining;
99
- requiredForFullBatch -= remaining;
100
- dy--;
101
- _b.label = 6;
102
- case 6:
103
- requiredLines = Math.floor(requiredForFullBatch / dx);
104
- yRange = Math.min(requiredLines, dy);
105
- if (yRange > 0) {
106
- targetRanges.push({
107
- minX: range.minX,
108
- maxX: range.maxX,
109
- minY: range.minY,
110
- maxY: range.minY + yRange,
111
- zoom: range.zoom,
112
- });
113
- range.minY += yRange;
114
- dy -= yRange;
115
- requiredForFullBatch -= yRange * dx;
116
- }
117
- //add partial lines beginning
118
- if (requiredForFullBatch > 0 && range.minY < range.maxY) {
119
- endX = Math.min(range.minX + requiredForFullBatch, range.maxX);
120
- targetRanges.push({
121
- minX: range.minX,
122
- maxX: endX,
123
- minY: range.minY,
124
- maxY: range.minY + 1,
125
- zoom: range.zoom,
126
- });
127
- requiredForFullBatch -= endX - range.minX;
128
- if (endX < range.maxX) {
129
- reminderX = endX;
130
- }
131
- else {
132
- range.minY++;
133
- }
134
- }
135
- if (!(requiredForFullBatch === 0)) return [3 /*break*/, 8];
136
- return [4 /*yield*/, targetRanges];
137
- case 7:
138
- _b.sent();
139
- targetRanges = [];
140
- requiredForFullBatch = batchSize;
141
- _b.label = 8;
142
- case 8: return [3 /*break*/, 3];
143
- case 9:
144
- ranges_1_1 = ranges_1.next();
145
- return [3 /*break*/, 2];
146
- case 10: return [3 /*break*/, 13];
147
- case 11:
148
- e_1_1 = _b.sent();
149
- e_1 = { error: e_1_1 };
150
- return [3 /*break*/, 13];
151
- case 12:
152
- try {
153
- if (ranges_1_1 && !ranges_1_1.done && (_a = ranges_1.return)) _a.call(ranges_1);
154
- }
155
- finally { if (e_1) throw e_1.error; }
156
- return [7 /*endfinally*/];
157
- case 13:
158
- if (!(targetRanges.length > 0)) return [3 /*break*/, 15];
159
- return [4 /*yield*/, targetRanges];
160
- case 14:
161
- _b.sent();
162
- _b.label = 15;
163
- case 15: return [2 /*return*/];
164
- }
165
- });
166
- }
167
- exports.tileBatchGenerator = tileBatchGenerator;
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 __values = (this && this.__values) || function(o) {
30
+ var s = typeof Symbol === "function" && Symbol.iterator, m = s && o[s], i = 0;
31
+ if (m) return m.call(o);
32
+ if (o && typeof o.length === "number") return {
33
+ next: function () {
34
+ if (o && i >= o.length) o = void 0;
35
+ return { value: o && o[i++], done: !o };
36
+ }
37
+ };
38
+ throw new TypeError(s ? "Object is not iterable." : "Symbol.iterator is not defined.");
39
+ };
40
+ Object.defineProperty(exports, "__esModule", { value: true });
41
+ exports.tileBatchGenerator = void 0;
42
+ /**
43
+ * split collection of tile ranges to batches based on tile count
44
+ * @param batchSize amount of tile per batch
45
+ * @param ranges iterable collection of tile ranges
46
+ */
47
+ function tileBatchGenerator(batchSize, ranges) {
48
+ var targetRanges, requiredForFullBatch, ranges_1, ranges_1_1, range, dx, dy, reminderX, remaining, requiredLines, yRange, endX, e_1_1;
49
+ var e_1, _a;
50
+ return __generator(this, function (_b) {
51
+ switch (_b.label) {
52
+ case 0:
53
+ targetRanges = [];
54
+ requiredForFullBatch = batchSize;
55
+ _b.label = 1;
56
+ case 1:
57
+ _b.trys.push([1, 11, 12, 13]);
58
+ ranges_1 = __values(ranges), ranges_1_1 = ranges_1.next();
59
+ _b.label = 2;
60
+ case 2:
61
+ if (!!ranges_1_1.done) return [3 /*break*/, 10];
62
+ range = ranges_1_1.value;
63
+ dx = range.maxX - range.minX;
64
+ dy = range.maxY - range.minY;
65
+ if (dx === 0 || dy === 0) {
66
+ return [3 /*break*/, 9];
67
+ }
68
+ reminderX = range.maxX;
69
+ _b.label = 3;
70
+ case 3:
71
+ if (!(range.minY < range.maxY)) return [3 /*break*/, 9];
72
+ if (!(reminderX < range.maxX)) return [3 /*break*/, 6];
73
+ remaining = range.maxX - reminderX;
74
+ if (!(remaining > requiredForFullBatch)) return [3 /*break*/, 5];
75
+ targetRanges.push({
76
+ minX: reminderX,
77
+ maxX: reminderX + requiredForFullBatch,
78
+ minY: range.minY,
79
+ maxY: range.minY + 1,
80
+ zoom: range.zoom,
81
+ });
82
+ return [4 /*yield*/, targetRanges];
83
+ case 4:
84
+ _b.sent();
85
+ reminderX += requiredForFullBatch;
86
+ targetRanges = [];
87
+ requiredForFullBatch = batchSize;
88
+ return [3 /*break*/, 3];
89
+ case 5:
90
+ targetRanges.push({
91
+ minX: reminderX,
92
+ maxX: reminderX + remaining,
93
+ minY: range.minY,
94
+ maxY: range.minY + 1,
95
+ zoom: range.zoom,
96
+ });
97
+ range.minY++;
98
+ reminderX += remaining;
99
+ requiredForFullBatch -= remaining;
100
+ dy--;
101
+ _b.label = 6;
102
+ case 6:
103
+ requiredLines = Math.floor(requiredForFullBatch / dx);
104
+ yRange = Math.min(requiredLines, dy);
105
+ if (yRange > 0) {
106
+ targetRanges.push({
107
+ minX: range.minX,
108
+ maxX: range.maxX,
109
+ minY: range.minY,
110
+ maxY: range.minY + yRange,
111
+ zoom: range.zoom,
112
+ });
113
+ range.minY += yRange;
114
+ dy -= yRange;
115
+ requiredForFullBatch -= yRange * dx;
116
+ }
117
+ //add partial lines beginning
118
+ if (requiredForFullBatch > 0 && range.minY < range.maxY) {
119
+ endX = Math.min(range.minX + requiredForFullBatch, range.maxX);
120
+ targetRanges.push({
121
+ minX: range.minX,
122
+ maxX: endX,
123
+ minY: range.minY,
124
+ maxY: range.minY + 1,
125
+ zoom: range.zoom,
126
+ });
127
+ requiredForFullBatch -= endX - range.minX;
128
+ if (endX < range.maxX) {
129
+ reminderX = endX;
130
+ }
131
+ else {
132
+ range.minY++;
133
+ }
134
+ }
135
+ if (!(requiredForFullBatch === 0)) return [3 /*break*/, 8];
136
+ return [4 /*yield*/, targetRanges];
137
+ case 7:
138
+ _b.sent();
139
+ targetRanges = [];
140
+ requiredForFullBatch = batchSize;
141
+ _b.label = 8;
142
+ case 8: return [3 /*break*/, 3];
143
+ case 9:
144
+ ranges_1_1 = ranges_1.next();
145
+ return [3 /*break*/, 2];
146
+ case 10: return [3 /*break*/, 13];
147
+ case 11:
148
+ e_1_1 = _b.sent();
149
+ e_1 = { error: e_1_1 };
150
+ return [3 /*break*/, 13];
151
+ case 12:
152
+ try {
153
+ if (ranges_1_1 && !ranges_1_1.done && (_a = ranges_1.return)) _a.call(ranges_1);
154
+ }
155
+ finally { if (e_1) throw e_1.error; }
156
+ return [7 /*endfinally*/];
157
+ case 13:
158
+ if (!(targetRanges.length > 0)) return [3 /*break*/, 15];
159
+ return [4 /*yield*/, targetRanges];
160
+ case 14:
161
+ _b.sent();
162
+ _b.label = 15;
163
+ case 15: return [2 /*return*/];
164
+ }
165
+ });
166
+ }
167
+ exports.tileBatchGenerator = tileBatchGenerator;
168
168
  //# sourceMappingURL=tileBatcher.js.map
@@ -1,40 +1,40 @@
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): 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
- private optimizeHash;
36
- private generateSubTiles;
37
- private readonly tileFootprintIntersection;
38
- private isBbox;
39
- }
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): 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
+ private optimizeHash;
36
+ private generateSubTiles;
37
+ private readonly tileFootprintIntersection;
38
+ private isBbox;
39
+ }
40
40
  //# sourceMappingURL=tileRanger.d.ts.map