@map-colonies/mc-utils 2.0.0 → 2.0.2
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 -17
- package/dist/arrays/index.js.map +0 -0
- 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 -29
- package/dist/communication/http/httpClient.d.ts.map +0 -0
- package/dist/communication/http/httpClient.js +434 -434
- package/dist/communication/http/httpClient.js.map +0 -0
- 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 -17
- package/dist/communication/http/index.js.map +0 -0
- package/dist/communication/index.d.ts +1 -1
- package/dist/communication/index.d.ts.map +0 -0
- package/dist/communication/index.js +17 -17
- package/dist/communication/index.js.map +0 -0
- 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 -17
- package/dist/dateTime/index.js.map +0 -0
- 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 +0 -0
- package/dist/geo/geoHash.js +246 -246
- package/dist/geo/geoHash.js.map +0 -0
- 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 -24
- package/dist/geo/index.js.map +0 -0
- package/dist/geo/tileBatcher.d.ts +8 -8
- package/dist/geo/tileBatcher.d.ts.map +0 -0
- package/dist/geo/tileBatcher.js +167 -167
- package/dist/geo/tileBatcher.js.map +0 -0
- 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 +0 -0
- package/dist/geo/tiles.js +246 -246
- package/dist/geo/tiles.js.map +0 -0
- 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 -21
- package/dist/index.js.map +0 -0
- 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 -18
- package/dist/models/enums/gdal/index.js.map +0 -0
- 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 -17
- package/dist/models/enums/geo/index.js.map +0 -0
- 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 -18
- package/dist/models/enums/index.js.map +0 -0
- package/dist/models/index.d.ts +2 -2
- package/dist/models/index.d.ts.map +0 -0
- package/dist/models/index.js +18 -18
- package/dist/models/index.js.map +0 -0
- 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 -18
- package/dist/models/interfaces/geo/index.js.map +0 -0
- 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 -17
- package/dist/models/interfaces/index.js.map +0 -0
- package/package.json +79 -79
|
@@ -1,71 +1,71 @@
|
|
|
1
|
-
"use strict";
|
|
2
|
-
var __importDefault = (this && this.__importDefault) || function (mod) {
|
|
3
|
-
return (mod && mod.__esModule) ? mod : { "default": mod };
|
|
4
|
-
};
|
|
5
|
-
Object.defineProperty(exports, "__esModule", { value: true });
|
|
6
|
-
exports.featureCollectionBooleanEqual = exports.multiIntersect = void 0;
|
|
7
|
-
var turf_1 = require("@turf/turf");
|
|
8
|
-
var lodash_1 = __importDefault(require("lodash"));
|
|
9
|
-
var featuresCustomizer = function (objectValue, otherValue) {
|
|
10
|
-
// compare features
|
|
11
|
-
// https://lodash.com/docs/4.17.15#find
|
|
12
|
-
if (!lodash_1.default.isEqual(objectValue.length, otherValue.length)) {
|
|
13
|
-
return false;
|
|
14
|
-
}
|
|
15
|
-
for (var i = 0; i < objectValue.length; i++) {
|
|
16
|
-
var isFeatureContained = lodash_1.default.find(otherValue, objectValue[i]);
|
|
17
|
-
if (isFeatureContained === undefined) {
|
|
18
|
-
return false;
|
|
19
|
-
}
|
|
20
|
-
}
|
|
21
|
-
for (var i = 0; i < otherValue.length; i++) {
|
|
22
|
-
var isFeatureContained = lodash_1.default.find(objectValue, otherValue[i]);
|
|
23
|
-
if (isFeatureContained === undefined) {
|
|
24
|
-
return false;
|
|
25
|
-
}
|
|
26
|
-
}
|
|
27
|
-
return true;
|
|
28
|
-
};
|
|
29
|
-
var featureCollectionCustomized = function (objectValue, otherValue) {
|
|
30
|
-
// compare type
|
|
31
|
-
if (!lodash_1.default.isEqual(objectValue.type, otherValue.type)) {
|
|
32
|
-
return false;
|
|
33
|
-
}
|
|
34
|
-
// compare features
|
|
35
|
-
var isFeaturesEqual = lodash_1.default.isEqualWith(objectValue.features, otherValue.features, featuresCustomizer);
|
|
36
|
-
return isFeaturesEqual;
|
|
37
|
-
};
|
|
38
|
-
/**
|
|
39
|
-
* return the intersection footprint of all specified footprints or null when there is no intersection
|
|
40
|
-
* @param footprints footprint list to intersect
|
|
41
|
-
* @returns intersection footprint or null
|
|
42
|
-
*/
|
|
43
|
-
var multiIntersect = function (footprints) {
|
|
44
|
-
if (footprints.length === 0) {
|
|
45
|
-
return null;
|
|
46
|
-
}
|
|
47
|
-
else if (footprints.length === 1) {
|
|
48
|
-
return footprints[0];
|
|
49
|
-
}
|
|
50
|
-
var intersection = footprints[0];
|
|
51
|
-
for (var i = 1; i < footprints.length; i++) {
|
|
52
|
-
var curIntersection = (0, turf_1.intersect)(intersection, footprints[i]);
|
|
53
|
-
if (curIntersection === null) {
|
|
54
|
-
return null;
|
|
55
|
-
}
|
|
56
|
-
intersection = curIntersection;
|
|
57
|
-
}
|
|
58
|
-
return intersection;
|
|
59
|
-
};
|
|
60
|
-
exports.multiIntersect = multiIntersect;
|
|
61
|
-
/**
|
|
62
|
-
* indicates if 2 object of type FeatureCollection are equal by validating properties and features array (order not important)
|
|
63
|
-
* @param fc1 first featureCollection to compare equal
|
|
64
|
-
* @param fc2 second featureCollection to compare equal
|
|
65
|
-
* @returns true if same featureCollection, false if not
|
|
66
|
-
*/
|
|
67
|
-
var featureCollectionBooleanEqual = function (fc1, fc2) {
|
|
68
|
-
return lodash_1.default.isEqualWith(fc1, fc2, featureCollectionCustomized);
|
|
69
|
-
};
|
|
70
|
-
exports.featureCollectionBooleanEqual = featureCollectionBooleanEqual;
|
|
1
|
+
"use strict";
|
|
2
|
+
var __importDefault = (this && this.__importDefault) || function (mod) {
|
|
3
|
+
return (mod && mod.__esModule) ? mod : { "default": mod };
|
|
4
|
+
};
|
|
5
|
+
Object.defineProperty(exports, "__esModule", { value: true });
|
|
6
|
+
exports.featureCollectionBooleanEqual = exports.multiIntersect = void 0;
|
|
7
|
+
var turf_1 = require("@turf/turf");
|
|
8
|
+
var lodash_1 = __importDefault(require("lodash"));
|
|
9
|
+
var featuresCustomizer = function (objectValue, otherValue) {
|
|
10
|
+
// compare features
|
|
11
|
+
// https://lodash.com/docs/4.17.15#find
|
|
12
|
+
if (!lodash_1.default.isEqual(objectValue.length, otherValue.length)) {
|
|
13
|
+
return false;
|
|
14
|
+
}
|
|
15
|
+
for (var i = 0; i < objectValue.length; i++) {
|
|
16
|
+
var isFeatureContained = lodash_1.default.find(otherValue, objectValue[i]);
|
|
17
|
+
if (isFeatureContained === undefined) {
|
|
18
|
+
return false;
|
|
19
|
+
}
|
|
20
|
+
}
|
|
21
|
+
for (var i = 0; i < otherValue.length; i++) {
|
|
22
|
+
var isFeatureContained = lodash_1.default.find(objectValue, otherValue[i]);
|
|
23
|
+
if (isFeatureContained === undefined) {
|
|
24
|
+
return false;
|
|
25
|
+
}
|
|
26
|
+
}
|
|
27
|
+
return true;
|
|
28
|
+
};
|
|
29
|
+
var featureCollectionCustomized = function (objectValue, otherValue) {
|
|
30
|
+
// compare type
|
|
31
|
+
if (!lodash_1.default.isEqual(objectValue.type, otherValue.type)) {
|
|
32
|
+
return false;
|
|
33
|
+
}
|
|
34
|
+
// compare features
|
|
35
|
+
var isFeaturesEqual = lodash_1.default.isEqualWith(objectValue.features, otherValue.features, featuresCustomizer);
|
|
36
|
+
return isFeaturesEqual;
|
|
37
|
+
};
|
|
38
|
+
/**
|
|
39
|
+
* return the intersection footprint of all specified footprints or null when there is no intersection
|
|
40
|
+
* @param footprints footprint list to intersect
|
|
41
|
+
* @returns intersection footprint or null
|
|
42
|
+
*/
|
|
43
|
+
var multiIntersect = function (footprints) {
|
|
44
|
+
if (footprints.length === 0) {
|
|
45
|
+
return null;
|
|
46
|
+
}
|
|
47
|
+
else if (footprints.length === 1) {
|
|
48
|
+
return footprints[0];
|
|
49
|
+
}
|
|
50
|
+
var intersection = footprints[0];
|
|
51
|
+
for (var i = 1; i < footprints.length; i++) {
|
|
52
|
+
var curIntersection = (0, turf_1.intersect)(intersection, footprints[i]);
|
|
53
|
+
if (curIntersection === null) {
|
|
54
|
+
return null;
|
|
55
|
+
}
|
|
56
|
+
intersection = curIntersection;
|
|
57
|
+
}
|
|
58
|
+
return intersection;
|
|
59
|
+
};
|
|
60
|
+
exports.multiIntersect = multiIntersect;
|
|
61
|
+
/**
|
|
62
|
+
* indicates if 2 object of type FeatureCollection are equal by validating properties and features array (order not important)
|
|
63
|
+
* @param fc1 first featureCollection to compare equal
|
|
64
|
+
* @param fc2 second featureCollection to compare equal
|
|
65
|
+
* @returns true if same featureCollection, false if not
|
|
66
|
+
*/
|
|
67
|
+
var featureCollectionBooleanEqual = function (fc1, fc2) {
|
|
68
|
+
return lodash_1.default.isEqualWith(fc1, fc2, featureCollectionCustomized);
|
|
69
|
+
};
|
|
70
|
+
exports.featureCollectionBooleanEqual = featureCollectionBooleanEqual;
|
|
71
71
|
//# sourceMappingURL=geoIntersection.js.map
|
|
File without changes
|
package/dist/geo/index.d.ts
CHANGED
|
@@ -1,9 +1,9 @@
|
|
|
1
|
-
export * from './bboxUtils';
|
|
2
|
-
export * from './geoConvertor';
|
|
3
|
-
export * from './geoHash';
|
|
4
|
-
export * from './geoIntersection';
|
|
5
|
-
export * from './tileBatcher';
|
|
6
|
-
export * from './tileRanger';
|
|
7
|
-
export * from './tiles';
|
|
8
|
-
export * from './tilesGenerator';
|
|
1
|
+
export * from './bboxUtils';
|
|
2
|
+
export * from './geoConvertor';
|
|
3
|
+
export * from './geoHash';
|
|
4
|
+
export * from './geoIntersection';
|
|
5
|
+
export * from './tileBatcher';
|
|
6
|
+
export * from './tileRanger';
|
|
7
|
+
export * from './tiles';
|
|
8
|
+
export * from './tilesGenerator';
|
|
9
9
|
//# sourceMappingURL=index.d.ts.map
|
package/dist/geo/index.d.ts.map
CHANGED
|
File without changes
|
package/dist/geo/index.js
CHANGED
|
@@ -1,25 +1,25 @@
|
|
|
1
|
-
"use strict";
|
|
2
|
-
var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
|
|
3
|
-
if (k2 === undefined) k2 = k;
|
|
4
|
-
var desc = Object.getOwnPropertyDescriptor(m, k);
|
|
5
|
-
if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
|
|
6
|
-
desc = { enumerable: true, get: function() { return m[k]; } };
|
|
7
|
-
}
|
|
8
|
-
Object.defineProperty(o, k2, desc);
|
|
9
|
-
}) : (function(o, m, k, k2) {
|
|
10
|
-
if (k2 === undefined) k2 = k;
|
|
11
|
-
o[k2] = m[k];
|
|
12
|
-
}));
|
|
13
|
-
var __exportStar = (this && this.__exportStar) || function(m, exports) {
|
|
14
|
-
for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
|
|
15
|
-
};
|
|
16
|
-
Object.defineProperty(exports, "__esModule", { value: true });
|
|
17
|
-
__exportStar(require("./bboxUtils"), exports);
|
|
18
|
-
__exportStar(require("./geoConvertor"), exports);
|
|
19
|
-
__exportStar(require("./geoHash"), exports);
|
|
20
|
-
__exportStar(require("./geoIntersection"), exports);
|
|
21
|
-
__exportStar(require("./tileBatcher"), exports);
|
|
22
|
-
__exportStar(require("./tileRanger"), exports);
|
|
23
|
-
__exportStar(require("./tiles"), exports);
|
|
24
|
-
__exportStar(require("./tilesGenerator"), exports);
|
|
1
|
+
"use strict";
|
|
2
|
+
var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
|
|
3
|
+
if (k2 === undefined) k2 = k;
|
|
4
|
+
var desc = Object.getOwnPropertyDescriptor(m, k);
|
|
5
|
+
if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
|
|
6
|
+
desc = { enumerable: true, get: function() { return m[k]; } };
|
|
7
|
+
}
|
|
8
|
+
Object.defineProperty(o, k2, desc);
|
|
9
|
+
}) : (function(o, m, k, k2) {
|
|
10
|
+
if (k2 === undefined) k2 = k;
|
|
11
|
+
o[k2] = m[k];
|
|
12
|
+
}));
|
|
13
|
+
var __exportStar = (this && this.__exportStar) || function(m, exports) {
|
|
14
|
+
for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
|
|
15
|
+
};
|
|
16
|
+
Object.defineProperty(exports, "__esModule", { value: true });
|
|
17
|
+
__exportStar(require("./bboxUtils"), exports);
|
|
18
|
+
__exportStar(require("./geoConvertor"), exports);
|
|
19
|
+
__exportStar(require("./geoHash"), exports);
|
|
20
|
+
__exportStar(require("./geoIntersection"), exports);
|
|
21
|
+
__exportStar(require("./tileBatcher"), exports);
|
|
22
|
+
__exportStar(require("./tileRanger"), exports);
|
|
23
|
+
__exportStar(require("./tiles"), exports);
|
|
24
|
+
__exportStar(require("./tilesGenerator"), exports);
|
|
25
25
|
//# sourceMappingURL=index.js.map
|
package/dist/geo/index.js.map
CHANGED
|
File without changes
|
|
@@ -1,9 +1,9 @@
|
|
|
1
|
-
import { ITileRange } from '../models/interfaces/geo/iTile';
|
|
2
|
-
/**
|
|
3
|
-
* split collection of tile ranges to batches based on tile count
|
|
4
|
-
* @param batchSize amount of tile per batch
|
|
5
|
-
* @param ranges iterable collection of tile ranges
|
|
6
|
-
*/
|
|
7
|
-
declare function tileBatchGenerator(batchSize: number, ranges: Iterable<ITileRange>): Generator<ITileRange[]>;
|
|
8
|
-
export { tileBatchGenerator };
|
|
1
|
+
import { ITileRange } from '../models/interfaces/geo/iTile';
|
|
2
|
+
/**
|
|
3
|
+
* split collection of tile ranges to batches based on tile count
|
|
4
|
+
* @param batchSize amount of tile per batch
|
|
5
|
+
* @param ranges iterable collection of tile ranges
|
|
6
|
+
*/
|
|
7
|
+
declare function tileBatchGenerator(batchSize: number, ranges: Iterable<ITileRange>): Generator<ITileRange[]>;
|
|
8
|
+
export { tileBatchGenerator };
|
|
9
9
|
//# sourceMappingURL=tileBatcher.d.ts.map
|
|
File without changes
|
package/dist/geo/tileBatcher.js
CHANGED
|
@@ -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
|
|
File without changes
|