@loaders.gl/tiles 3.4.13 → 3.4.15
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/dist/dist.min.js +122 -338
- package/dist/es5/bundle.js +1 -1
- package/dist/es5/bundle.js.map +1 -1
- package/dist/es5/constants.js +6 -6
- package/dist/es5/constants.js.map +1 -1
- package/dist/es5/index.js +13 -13
- package/dist/es5/tileset/format-3d-tiles/tileset-3d-traverser.js +32 -53
- package/dist/es5/tileset/format-3d-tiles/tileset-3d-traverser.js.map +1 -1
- package/dist/es5/tileset/format-i3s/i3s-pending-tiles-register.js +21 -32
- package/dist/es5/tileset/format-i3s/i3s-pending-tiles-register.js.map +1 -1
- package/dist/es5/tileset/format-i3s/i3s-tile-manager.js +66 -63
- package/dist/es5/tileset/format-i3s/i3s-tile-manager.js.map +1 -1
- package/dist/es5/tileset/format-i3s/i3s-tileset-traverser.js +54 -121
- package/dist/es5/tileset/format-i3s/i3s-tileset-traverser.js.map +1 -1
- package/dist/es5/tileset/helpers/bounding-volume.js +48 -62
- package/dist/es5/tileset/helpers/bounding-volume.js.map +1 -1
- package/dist/es5/tileset/helpers/frame-state.js +67 -80
- package/dist/es5/tileset/helpers/frame-state.js.map +1 -1
- package/dist/es5/tileset/helpers/i3s-lod.js +27 -27
- package/dist/es5/tileset/helpers/i3s-lod.js.map +1 -1
- package/dist/es5/tileset/helpers/tiles-3d-lod.js +51 -45
- package/dist/es5/tileset/helpers/tiles-3d-lod.js.map +1 -1
- package/dist/es5/tileset/helpers/transform-utils.js +17 -11
- package/dist/es5/tileset/helpers/transform-utils.js.map +1 -1
- package/dist/es5/tileset/helpers/zoom.js +28 -28
- package/dist/es5/tileset/helpers/zoom.js.map +1 -1
- package/dist/es5/tileset/tile-3d.js +316 -430
- package/dist/es5/tileset/tile-3d.js.map +1 -1
- package/dist/es5/tileset/tileset-3d.js +460 -701
- package/dist/es5/tileset/tileset-3d.js.map +1 -1
- package/dist/es5/tileset/tileset-cache.js +41 -58
- package/dist/es5/tileset/tileset-cache.js.map +1 -1
- package/dist/es5/tileset/tileset-traverser.js +189 -264
- package/dist/es5/tileset/tileset-traverser.js.map +1 -1
- package/dist/es5/utils/doubly-linked-list-node.js +10 -11
- package/dist/es5/utils/doubly-linked-list-node.js.map +1 -1
- package/dist/es5/utils/doubly-linked-list.js +53 -68
- package/dist/es5/utils/doubly-linked-list.js.map +1 -1
- package/dist/es5/utils/managed-array.js +69 -100
- package/dist/es5/utils/managed-array.js.map +1 -1
- package/package.json +5 -5
|
@@ -5,17 +5,16 @@ Object.defineProperty(exports, "__esModule", {
|
|
|
5
5
|
value: true
|
|
6
6
|
});
|
|
7
7
|
exports.DoublyLinkedListNode = void 0;
|
|
8
|
-
var _createClass2 = _interopRequireDefault(require("@babel/runtime/helpers/createClass"));
|
|
9
|
-
var _classCallCheck2 = _interopRequireDefault(require("@babel/runtime/helpers/classCallCheck"));
|
|
10
8
|
var _defineProperty2 = _interopRequireDefault(require("@babel/runtime/helpers/defineProperty"));
|
|
11
|
-
|
|
12
|
-
(
|
|
13
|
-
|
|
14
|
-
|
|
15
|
-
|
|
16
|
-
|
|
17
|
-
|
|
18
|
-
|
|
19
|
-
}
|
|
9
|
+
class DoublyLinkedListNode {
|
|
10
|
+
constructor(item, previous, next) {
|
|
11
|
+
(0, _defineProperty2.default)(this, "item", void 0);
|
|
12
|
+
(0, _defineProperty2.default)(this, "previous", void 0);
|
|
13
|
+
(0, _defineProperty2.default)(this, "next", void 0);
|
|
14
|
+
this.item = item;
|
|
15
|
+
this.previous = previous;
|
|
16
|
+
this.next = next;
|
|
17
|
+
}
|
|
18
|
+
}
|
|
20
19
|
exports.DoublyLinkedListNode = DoublyLinkedListNode;
|
|
21
20
|
//# sourceMappingURL=doubly-linked-list-node.js.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"doubly-linked-list-node.js","names":["DoublyLinkedListNode","
|
|
1
|
+
{"version":3,"file":"doubly-linked-list-node.js","names":["DoublyLinkedListNode","constructor","item","previous","next","_defineProperty2","default","exports"],"sources":["../../../src/utils/doubly-linked-list-node.ts"],"sourcesContent":["// loaders.gl, MIT license\n\n// This file is derived from the Cesium code base under Apache 2 license\n// See LICENSE.md and https://github.com/AnalyticalGraphicsInc/cesium/blob/master/LICENSE.md\n\n/**\n * Doubly linked list node\n * @private\n */\nexport class DoublyLinkedListNode {\n item;\n previous;\n next;\n\n constructor(item, previous, next) {\n this.item = item;\n this.previous = previous;\n this.next = next;\n }\n}\n"],"mappings":";;;;;;;;AASO,MAAMA,oBAAoB,CAAC;EAKhCC,WAAWA,CAACC,IAAI,EAAEC,QAAQ,EAAEC,IAAI,EAAE;IAAA,IAAAC,gBAAA,CAAAC,OAAA;IAAA,IAAAD,gBAAA,CAAAC,OAAA;IAAA,IAAAD,gBAAA,CAAAC,OAAA;IAChC,IAAI,CAACJ,IAAI,GAAGA,IAAI;IAChB,IAAI,CAACC,QAAQ,GAAGA,QAAQ;IACxB,IAAI,CAACC,IAAI,GAAGA,IAAI;EAClB;AACF;AAACG,OAAA,CAAAP,oBAAA,GAAAA,oBAAA"}
|
|
@@ -5,84 +5,69 @@ Object.defineProperty(exports, "__esModule", {
|
|
|
5
5
|
value: true
|
|
6
6
|
});
|
|
7
7
|
exports.DoublyLinkedList = void 0;
|
|
8
|
-
var _classCallCheck2 = _interopRequireDefault(require("@babel/runtime/helpers/classCallCheck"));
|
|
9
|
-
var _createClass2 = _interopRequireDefault(require("@babel/runtime/helpers/createClass"));
|
|
10
8
|
var _defineProperty2 = _interopRequireDefault(require("@babel/runtime/helpers/defineProperty"));
|
|
11
9
|
var _doublyLinkedListNode = require("./doubly-linked-list-node");
|
|
12
|
-
|
|
13
|
-
|
|
14
|
-
(0, _classCallCheck2.default)(this, DoublyLinkedList);
|
|
10
|
+
class DoublyLinkedList {
|
|
11
|
+
constructor() {
|
|
15
12
|
(0, _defineProperty2.default)(this, "head", null);
|
|
16
13
|
(0, _defineProperty2.default)(this, "tail", null);
|
|
17
14
|
(0, _defineProperty2.default)(this, "_length", 0);
|
|
18
15
|
}
|
|
19
|
-
(
|
|
20
|
-
|
|
21
|
-
|
|
22
|
-
|
|
16
|
+
get length() {
|
|
17
|
+
return this._length;
|
|
18
|
+
}
|
|
19
|
+
add(item) {
|
|
20
|
+
const node = new _doublyLinkedListNode.DoublyLinkedListNode(item, this.tail, null);
|
|
21
|
+
if (this.tail) {
|
|
22
|
+
this.tail.next = node;
|
|
23
|
+
this.tail = node;
|
|
24
|
+
} else {
|
|
25
|
+
this.head = node;
|
|
26
|
+
this.tail = node;
|
|
23
27
|
}
|
|
24
|
-
|
|
25
|
-
|
|
26
|
-
|
|
27
|
-
|
|
28
|
-
|
|
29
|
-
|
|
30
|
-
this.tail = node;
|
|
31
|
-
} else {
|
|
32
|
-
this.head = node;
|
|
33
|
-
this.tail = node;
|
|
34
|
-
}
|
|
35
|
-
++this._length;
|
|
36
|
-
return node;
|
|
28
|
+
++this._length;
|
|
29
|
+
return node;
|
|
30
|
+
}
|
|
31
|
+
remove(node) {
|
|
32
|
+
if (!node) {
|
|
33
|
+
return;
|
|
37
34
|
}
|
|
38
|
-
|
|
39
|
-
|
|
40
|
-
|
|
41
|
-
|
|
42
|
-
|
|
43
|
-
|
|
44
|
-
|
|
45
|
-
|
|
46
|
-
|
|
47
|
-
|
|
48
|
-
|
|
49
|
-
|
|
50
|
-
} else if (node.next) {
|
|
51
|
-
node.next.previous = null;
|
|
52
|
-
this.head = node.next;
|
|
53
|
-
} else {
|
|
54
|
-
this.head = null;
|
|
55
|
-
this.tail = null;
|
|
56
|
-
}
|
|
57
|
-
node.next = null;
|
|
58
|
-
node.previous = null;
|
|
59
|
-
--this._length;
|
|
35
|
+
if (node.previous && node.next) {
|
|
36
|
+
node.previous.next = node.next;
|
|
37
|
+
node.next.previous = node.previous;
|
|
38
|
+
} else if (node.previous) {
|
|
39
|
+
node.previous.next = null;
|
|
40
|
+
this.tail = node.previous;
|
|
41
|
+
} else if (node.next) {
|
|
42
|
+
node.next.previous = null;
|
|
43
|
+
this.head = node.next;
|
|
44
|
+
} else {
|
|
45
|
+
this.head = null;
|
|
46
|
+
this.tail = null;
|
|
60
47
|
}
|
|
61
|
-
|
|
62
|
-
|
|
63
|
-
|
|
64
|
-
|
|
65
|
-
|
|
66
|
-
|
|
67
|
-
|
|
68
|
-
this._insert(node, nextNode);
|
|
48
|
+
node.next = null;
|
|
49
|
+
node.previous = null;
|
|
50
|
+
--this._length;
|
|
51
|
+
}
|
|
52
|
+
splice(node, nextNode) {
|
|
53
|
+
if (node === nextNode) {
|
|
54
|
+
return;
|
|
69
55
|
}
|
|
70
|
-
|
|
71
|
-
|
|
72
|
-
|
|
73
|
-
|
|
74
|
-
|
|
75
|
-
|
|
76
|
-
|
|
77
|
-
|
|
78
|
-
|
|
79
|
-
|
|
80
|
-
nextNode.next = oldNodeNext;
|
|
81
|
-
nextNode.previous = node;
|
|
82
|
-
++this._length;
|
|
56
|
+
this.remove(nextNode);
|
|
57
|
+
this._insert(node, nextNode);
|
|
58
|
+
}
|
|
59
|
+
_insert(node, nextNode) {
|
|
60
|
+
const oldNodeNext = node.next;
|
|
61
|
+
node.next = nextNode;
|
|
62
|
+
if (this.tail === node) {
|
|
63
|
+
this.tail = nextNode;
|
|
64
|
+
} else {
|
|
65
|
+
oldNodeNext.previous = nextNode;
|
|
83
66
|
}
|
|
84
|
-
|
|
85
|
-
|
|
86
|
-
|
|
67
|
+
nextNode.next = oldNodeNext;
|
|
68
|
+
nextNode.previous = node;
|
|
69
|
+
++this._length;
|
|
70
|
+
}
|
|
71
|
+
}
|
|
87
72
|
exports.DoublyLinkedList = DoublyLinkedList;
|
|
88
73
|
//# sourceMappingURL=doubly-linked-list.js.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"doubly-linked-list.js","names":["_doublyLinkedListNode","require","DoublyLinkedList","
|
|
1
|
+
{"version":3,"file":"doubly-linked-list.js","names":["_doublyLinkedListNode","require","DoublyLinkedList","constructor","_defineProperty2","default","length","_length","add","item","node","DoublyLinkedListNode","tail","next","head","remove","previous","splice","nextNode","_insert","oldNodeNext","exports"],"sources":["../../../src/utils/doubly-linked-list.ts"],"sourcesContent":["// This file is derived from the Cesium code base under Apache 2 license\n// See LICENSE.md and https://github.com/AnalyticalGraphicsInc/cesium/blob/master/LICENSE.md\n\nimport {DoublyLinkedListNode} from './doubly-linked-list-node';\n\n/**\n * Doubly linked list\n * @private\n */\nexport class DoublyLinkedList {\n head: DoublyLinkedListNode | null = null;\n tail: DoublyLinkedListNode | null = null;\n _length = 0;\n\n get length() {\n return this._length;\n }\n\n /**\n * Adds the item to the end of the list\n * @param {*} [item]\n * @return {DoublyLinkedListNode}\n */\n add(item) {\n const node = new DoublyLinkedListNode(item, this.tail, null);\n\n if (this.tail) {\n this.tail.next = node;\n this.tail = node;\n } else {\n this.head = node;\n this.tail = node;\n }\n\n ++this._length;\n\n return node;\n }\n\n /**\n * Removes the given node from the list\n * @param {DoublyLinkedListNode} node\n */\n remove(node) {\n if (!node) {\n return;\n }\n\n if (node.previous && node.next) {\n node.previous.next = node.next;\n node.next.previous = node.previous;\n } else if (node.previous) {\n // Remove last node\n node.previous.next = null;\n this.tail = node.previous;\n } else if (node.next) {\n // Remove first node\n node.next.previous = null;\n this.head = node.next;\n } else {\n // Remove last node in the linked list\n this.head = null;\n this.tail = null;\n }\n\n node.next = null;\n node.previous = null;\n\n --this._length;\n }\n\n /**\n * Moves nextNode after node\n * @param {DoublyLinkedListNode} node\n * @param {DoublyLinkedListNode} nextNode\n */\n splice(node, nextNode) {\n if (node === nextNode) {\n return;\n }\n\n // Remove nextNode, then insert after node\n this.remove(nextNode);\n this._insert(node, nextNode);\n }\n\n _insert(node, nextNode) {\n const oldNodeNext = node.next;\n node.next = nextNode;\n\n // nextNode is the new tail\n if (this.tail === node) {\n this.tail = nextNode;\n } else {\n oldNodeNext.previous = nextNode;\n }\n\n nextNode.next = oldNodeNext;\n nextNode.previous = node;\n\n ++this._length;\n }\n}\n"],"mappings":";;;;;;;;AAGA,IAAAA,qBAAA,GAAAC,OAAA;AAMO,MAAMC,gBAAgB,CAAC;EAAAC,YAAA;IAAA,IAAAC,gBAAA,CAAAC,OAAA,gBACQ,IAAI;IAAA,IAAAD,gBAAA,CAAAC,OAAA,gBACJ,IAAI;IAAA,IAAAD,gBAAA,CAAAC,OAAA,mBAC9B,CAAC;EAAA;EAEX,IAAIC,MAAMA,CAAA,EAAG;IACX,OAAO,IAAI,CAACC,OAAO;EACrB;EAOAC,GAAGA,CAACC,IAAI,EAAE;IACR,MAAMC,IAAI,GAAG,IAAIC,0CAAoB,CAACF,IAAI,EAAE,IAAI,CAACG,IAAI,EAAE,IAAI,CAAC;IAE5D,IAAI,IAAI,CAACA,IAAI,EAAE;MACb,IAAI,CAACA,IAAI,CAACC,IAAI,GAAGH,IAAI;MACrB,IAAI,CAACE,IAAI,GAAGF,IAAI;IAClB,CAAC,MAAM;MACL,IAAI,CAACI,IAAI,GAAGJ,IAAI;MAChB,IAAI,CAACE,IAAI,GAAGF,IAAI;IAClB;IAEA,EAAE,IAAI,CAACH,OAAO;IAEd,OAAOG,IAAI;EACb;EAMAK,MAAMA,CAACL,IAAI,EAAE;IACX,IAAI,CAACA,IAAI,EAAE;MACT;IACF;IAEA,IAAIA,IAAI,CAACM,QAAQ,IAAIN,IAAI,CAACG,IAAI,EAAE;MAC9BH,IAAI,CAACM,QAAQ,CAACH,IAAI,GAAGH,IAAI,CAACG,IAAI;MAC9BH,IAAI,CAACG,IAAI,CAACG,QAAQ,GAAGN,IAAI,CAACM,QAAQ;IACpC,CAAC,MAAM,IAAIN,IAAI,CAACM,QAAQ,EAAE;MAExBN,IAAI,CAACM,QAAQ,CAACH,IAAI,GAAG,IAAI;MACzB,IAAI,CAACD,IAAI,GAAGF,IAAI,CAACM,QAAQ;IAC3B,CAAC,MAAM,IAAIN,IAAI,CAACG,IAAI,EAAE;MAEpBH,IAAI,CAACG,IAAI,CAACG,QAAQ,GAAG,IAAI;MACzB,IAAI,CAACF,IAAI,GAAGJ,IAAI,CAACG,IAAI;IACvB,CAAC,MAAM;MAEL,IAAI,CAACC,IAAI,GAAG,IAAI;MAChB,IAAI,CAACF,IAAI,GAAG,IAAI;IAClB;IAEAF,IAAI,CAACG,IAAI,GAAG,IAAI;IAChBH,IAAI,CAACM,QAAQ,GAAG,IAAI;IAEpB,EAAE,IAAI,CAACT,OAAO;EAChB;EAOAU,MAAMA,CAACP,IAAI,EAAEQ,QAAQ,EAAE;IACrB,IAAIR,IAAI,KAAKQ,QAAQ,EAAE;MACrB;IACF;IAGA,IAAI,CAACH,MAAM,CAACG,QAAQ,CAAC;IACrB,IAAI,CAACC,OAAO,CAACT,IAAI,EAAEQ,QAAQ,CAAC;EAC9B;EAEAC,OAAOA,CAACT,IAAI,EAAEQ,QAAQ,EAAE;IACtB,MAAME,WAAW,GAAGV,IAAI,CAACG,IAAI;IAC7BH,IAAI,CAACG,IAAI,GAAGK,QAAQ;IAGpB,IAAI,IAAI,CAACN,IAAI,KAAKF,IAAI,EAAE;MACtB,IAAI,CAACE,IAAI,GAAGM,QAAQ;IACtB,CAAC,MAAM;MACLE,WAAW,CAACJ,QAAQ,GAAGE,QAAQ;IACjC;IAEAA,QAAQ,CAACL,IAAI,GAAGO,WAAW;IAC3BF,QAAQ,CAACF,QAAQ,GAAGN,IAAI;IAExB,EAAE,IAAI,CAACH,OAAO;EAChB;AACF;AAACc,OAAA,CAAAnB,gBAAA,GAAAA,gBAAA"}
|
|
@@ -5,122 +5,91 @@ Object.defineProperty(exports, "__esModule", {
|
|
|
5
5
|
value: true
|
|
6
6
|
});
|
|
7
7
|
exports.ManagedArray = void 0;
|
|
8
|
-
var _classCallCheck2 = _interopRequireDefault(require("@babel/runtime/helpers/classCallCheck"));
|
|
9
|
-
var _createClass2 = _interopRequireDefault(require("@babel/runtime/helpers/createClass"));
|
|
10
8
|
var _defineProperty2 = _interopRequireDefault(require("@babel/runtime/helpers/defineProperty"));
|
|
11
9
|
var _loaderUtils = require("@loaders.gl/loader-utils");
|
|
12
|
-
|
|
13
|
-
|
|
14
|
-
|
|
15
|
-
(0, _classCallCheck2.default)(this, ManagedArray);
|
|
10
|
+
class ManagedArray {
|
|
11
|
+
constructor() {
|
|
12
|
+
let length = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : 0;
|
|
16
13
|
(0, _defineProperty2.default)(this, "_map", new Map());
|
|
17
14
|
(0, _defineProperty2.default)(this, "_array", void 0);
|
|
18
15
|
(0, _defineProperty2.default)(this, "_length", void 0);
|
|
19
16
|
this._array = new Array(length);
|
|
20
17
|
this._length = length;
|
|
21
18
|
}
|
|
22
|
-
(
|
|
23
|
-
|
|
24
|
-
|
|
25
|
-
|
|
26
|
-
|
|
27
|
-
|
|
28
|
-
this.
|
|
29
|
-
if (length > this._array.length) {
|
|
30
|
-
this._array.length = length;
|
|
31
|
-
}
|
|
32
|
-
}
|
|
33
|
-
}, {
|
|
34
|
-
key: "values",
|
|
35
|
-
get: function get() {
|
|
36
|
-
return this._array;
|
|
37
|
-
}
|
|
38
|
-
}, {
|
|
39
|
-
key: "get",
|
|
40
|
-
value: function get(index) {
|
|
41
|
-
(0, _loaderUtils.assert)(index < this._array.length);
|
|
42
|
-
return this._array[index];
|
|
43
|
-
}
|
|
44
|
-
}, {
|
|
45
|
-
key: "set",
|
|
46
|
-
value: function set(index, element) {
|
|
47
|
-
(0, _loaderUtils.assert)(index >= 0);
|
|
48
|
-
if (index >= this.length) {
|
|
49
|
-
this.length = index + 1;
|
|
50
|
-
}
|
|
51
|
-
if (this._map.has(this._array[index])) {
|
|
52
|
-
this._map.delete(this._array[index]);
|
|
53
|
-
}
|
|
54
|
-
this._array[index] = element;
|
|
55
|
-
this._map.set(element, index);
|
|
56
|
-
}
|
|
57
|
-
}, {
|
|
58
|
-
key: "delete",
|
|
59
|
-
value: function _delete(element) {
|
|
60
|
-
var index = this._map.get(element);
|
|
61
|
-
if (index >= 0) {
|
|
62
|
-
this._array.splice(index, 1);
|
|
63
|
-
this._map.delete(element);
|
|
64
|
-
this.length--;
|
|
65
|
-
}
|
|
19
|
+
get length() {
|
|
20
|
+
return this._length;
|
|
21
|
+
}
|
|
22
|
+
set length(length) {
|
|
23
|
+
this._length = length;
|
|
24
|
+
if (length > this._array.length) {
|
|
25
|
+
this._array.length = length;
|
|
66
26
|
}
|
|
67
|
-
}
|
|
68
|
-
|
|
69
|
-
|
|
70
|
-
|
|
27
|
+
}
|
|
28
|
+
get values() {
|
|
29
|
+
return this._array;
|
|
30
|
+
}
|
|
31
|
+
get(index) {
|
|
32
|
+
(0, _loaderUtils.assert)(index < this._array.length);
|
|
33
|
+
return this._array[index];
|
|
34
|
+
}
|
|
35
|
+
set(index, element) {
|
|
36
|
+
(0, _loaderUtils.assert)(index >= 0);
|
|
37
|
+
if (index >= this.length) {
|
|
38
|
+
this.length = index + 1;
|
|
71
39
|
}
|
|
72
|
-
|
|
73
|
-
|
|
74
|
-
value: function push(element) {
|
|
75
|
-
if (!this._map.has(element)) {
|
|
76
|
-
var index = this.length++;
|
|
77
|
-
this._array[index] = element;
|
|
78
|
-
this._map.set(element, index);
|
|
79
|
-
}
|
|
40
|
+
if (this._map.has(this._array[index])) {
|
|
41
|
+
this._map.delete(this._array[index]);
|
|
80
42
|
}
|
|
81
|
-
|
|
82
|
-
|
|
83
|
-
|
|
84
|
-
|
|
43
|
+
this._array[index] = element;
|
|
44
|
+
this._map.set(element, index);
|
|
45
|
+
}
|
|
46
|
+
delete(element) {
|
|
47
|
+
const index = this._map.get(element);
|
|
48
|
+
if (index >= 0) {
|
|
49
|
+
this._array.splice(index, 1);
|
|
85
50
|
this._map.delete(element);
|
|
86
|
-
|
|
51
|
+
this.length--;
|
|
87
52
|
}
|
|
88
|
-
}
|
|
89
|
-
|
|
90
|
-
|
|
91
|
-
|
|
92
|
-
|
|
93
|
-
|
|
94
|
-
|
|
95
|
-
|
|
96
|
-
|
|
97
|
-
key: "resize",
|
|
98
|
-
value: function resize(length) {
|
|
99
|
-
(0, _loaderUtils.assert)(length >= 0);
|
|
100
|
-
this.length = length;
|
|
53
|
+
}
|
|
54
|
+
peek() {
|
|
55
|
+
return this._array[this._length - 1];
|
|
56
|
+
}
|
|
57
|
+
push(element) {
|
|
58
|
+
if (!this._map.has(element)) {
|
|
59
|
+
const index = this.length++;
|
|
60
|
+
this._array[index] = element;
|
|
61
|
+
this._map.set(element, index);
|
|
101
62
|
}
|
|
102
|
-
}
|
|
103
|
-
|
|
104
|
-
|
|
105
|
-
|
|
106
|
-
|
|
107
|
-
|
|
63
|
+
}
|
|
64
|
+
pop() {
|
|
65
|
+
const element = this._array[--this.length];
|
|
66
|
+
this._map.delete(element);
|
|
67
|
+
return element;
|
|
68
|
+
}
|
|
69
|
+
reserve(length) {
|
|
70
|
+
(0, _loaderUtils.assert)(length >= 0);
|
|
71
|
+
if (length > this._array.length) {
|
|
108
72
|
this._array.length = length;
|
|
109
73
|
}
|
|
110
|
-
}
|
|
111
|
-
|
|
112
|
-
|
|
113
|
-
|
|
114
|
-
|
|
115
|
-
|
|
116
|
-
|
|
117
|
-
|
|
118
|
-
key: "find",
|
|
119
|
-
value: function find(target) {
|
|
120
|
-
return this._map.has(target);
|
|
74
|
+
}
|
|
75
|
+
resize(length) {
|
|
76
|
+
(0, _loaderUtils.assert)(length >= 0);
|
|
77
|
+
this.length = length;
|
|
78
|
+
}
|
|
79
|
+
trim(length) {
|
|
80
|
+
if (length === null || length === undefined) {
|
|
81
|
+
length = this.length;
|
|
121
82
|
}
|
|
122
|
-
|
|
123
|
-
|
|
124
|
-
|
|
83
|
+
this._array.length = length;
|
|
84
|
+
}
|
|
85
|
+
reset() {
|
|
86
|
+
this._array = [];
|
|
87
|
+
this._map = new Map();
|
|
88
|
+
this._length = 0;
|
|
89
|
+
}
|
|
90
|
+
find(target) {
|
|
91
|
+
return this._map.has(target);
|
|
92
|
+
}
|
|
93
|
+
}
|
|
125
94
|
exports.ManagedArray = ManagedArray;
|
|
126
95
|
//# sourceMappingURL=managed-array.js.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"managed-array.js","names":["_loaderUtils","require","ManagedArray","length","arguments","undefined","
|
|
1
|
+
{"version":3,"file":"managed-array.js","names":["_loaderUtils","require","ManagedArray","constructor","length","arguments","undefined","_defineProperty2","default","Map","_array","Array","_length","values","get","index","assert","set","element","_map","has","delete","splice","peek","push","pop","reserve","resize","trim","reset","find","target","exports"],"sources":["../../../src/utils/managed-array.ts"],"sourcesContent":["// This file is derived from the Cesium code base under Apache 2 license\n// See LICENSE.md and https://github.com/AnalyticalGraphicsInc/cesium/blob/master/LICENSE.md\n\nimport {assert} from '@loaders.gl/loader-utils';\n\n/**\n * A wrapper around arrays so that the internal length of the array can be manually managed.\n *\n * @alias ManagedArray\n * @constructor\n * @private\n *\n * @param {Number} [length=0] The initial length of the array.\n */\nexport class ManagedArray {\n _map = new Map();\n _array: any[];\n _length: number;\n\n constructor(length = 0) {\n this._array = new Array(length);\n this._length = length;\n }\n\n /**\n * Gets or sets the length of the array.\n * If the set length is greater than the length of the internal array, the internal array is resized.\n *\n * @memberof ManagedArray.prototype\n * @type Number\n */\n get length() {\n return this._length;\n }\n\n set length(length) {\n this._length = length;\n if (length > this._array.length) {\n this._array.length = length;\n }\n }\n\n /**\n * Gets the internal array.\n *\n * @memberof ManagedArray.prototype\n * @type Array\n * @readonly\n */\n get values() {\n return this._array;\n }\n\n /**\n * Gets the element at an index.\n *\n * @param {Number} index The index to get.\n */\n get(index) {\n assert(index < this._array.length);\n return this._array[index];\n }\n\n /**\n * Sets the element at an index. Resizes the array if index is greater than the length of the array.\n *\n * @param {Number} index The index to set.\n * @param {*} element The element to set at index.\n */\n set(index, element) {\n assert(index >= 0);\n\n if (index >= this.length) {\n this.length = index + 1;\n }\n\n if (this._map.has(this._array[index])) {\n this._map.delete(this._array[index]);\n }\n\n this._array[index] = element;\n this._map.set(element, index);\n }\n\n delete(element) {\n const index = this._map.get(element);\n if (index >= 0) {\n this._array.splice(index, 1);\n this._map.delete(element);\n this.length--;\n }\n }\n\n /**\n * Returns the last element in the array without modifying the array.\n *\n * @returns {*} The last element in the array.\n */\n peek() {\n return this._array[this._length - 1];\n }\n\n /**\n * Push an element into the array.\n *\n * @param {*} element The element to push.\n */\n push(element) {\n if (!this._map.has(element)) {\n const index = this.length++;\n this._array[index] = element;\n this._map.set(element, index);\n }\n }\n\n /**\n * Pop an element from the array.\n *\n * @returns {*} The last element in the array.\n */\n pop() {\n const element = this._array[--this.length];\n this._map.delete(element);\n return element;\n }\n\n /**\n * Resize the internal array if length > _array.length.\n *\n * @param {Number} length The length.\n */\n reserve(length) {\n assert(length >= 0);\n\n if (length > this._array.length) {\n this._array.length = length;\n }\n }\n\n /**\n * Resize the array.\n *\n * @param {Number} length The length.\n */\n resize(length) {\n assert(length >= 0);\n\n this.length = length;\n }\n\n /**\n * Trim the internal array to the specified length. Defaults to the current length.\n *\n * @param {Number} [length] The length.\n */\n trim(length) {\n if (length === null || length === undefined) {\n length = this.length;\n }\n this._array.length = length;\n }\n\n reset() {\n this._array = [];\n this._map = new Map();\n this._length = 0;\n }\n\n find(target) {\n return this._map.has(target);\n }\n}\n"],"mappings":";;;;;;;;AAGA,IAAAA,YAAA,GAAAC,OAAA;AAWO,MAAMC,YAAY,CAAC;EAKxBC,WAAWA,CAAA,EAAa;IAAA,IAAZC,MAAM,GAAAC,SAAA,CAAAD,MAAA,QAAAC,SAAA,QAAAC,SAAA,GAAAD,SAAA,MAAG,CAAC;IAAA,IAAAE,gBAAA,CAAAC,OAAA,gBAJf,IAAIC,GAAG,CAAC,CAAC;IAAA,IAAAF,gBAAA,CAAAC,OAAA;IAAA,IAAAD,gBAAA,CAAAC,OAAA;IAKd,IAAI,CAACE,MAAM,GAAG,IAAIC,KAAK,CAACP,MAAM,CAAC;IAC/B,IAAI,CAACQ,OAAO,GAAGR,MAAM;EACvB;EASA,IAAIA,MAAMA,CAAA,EAAG;IACX,OAAO,IAAI,CAACQ,OAAO;EACrB;EAEA,IAAIR,MAAMA,CAACA,MAAM,EAAE;IACjB,IAAI,CAACQ,OAAO,GAAGR,MAAM;IACrB,IAAIA,MAAM,GAAG,IAAI,CAACM,MAAM,CAACN,MAAM,EAAE;MAC/B,IAAI,CAACM,MAAM,CAACN,MAAM,GAAGA,MAAM;IAC7B;EACF;EASA,IAAIS,MAAMA,CAAA,EAAG;IACX,OAAO,IAAI,CAACH,MAAM;EACpB;EAOAI,GAAGA,CAACC,KAAK,EAAE;IACT,IAAAC,mBAAM,EAACD,KAAK,GAAG,IAAI,CAACL,MAAM,CAACN,MAAM,CAAC;IAClC,OAAO,IAAI,CAACM,MAAM,CAACK,KAAK,CAAC;EAC3B;EAQAE,GAAGA,CAACF,KAAK,EAAEG,OAAO,EAAE;IAClB,IAAAF,mBAAM,EAACD,KAAK,IAAI,CAAC,CAAC;IAElB,IAAIA,KAAK,IAAI,IAAI,CAACX,MAAM,EAAE;MACxB,IAAI,CAACA,MAAM,GAAGW,KAAK,GAAG,CAAC;IACzB;IAEA,IAAI,IAAI,CAACI,IAAI,CAACC,GAAG,CAAC,IAAI,CAACV,MAAM,CAACK,KAAK,CAAC,CAAC,EAAE;MACrC,IAAI,CAACI,IAAI,CAACE,MAAM,CAAC,IAAI,CAACX,MAAM,CAACK,KAAK,CAAC,CAAC;IACtC;IAEA,IAAI,CAACL,MAAM,CAACK,KAAK,CAAC,GAAGG,OAAO;IAC5B,IAAI,CAACC,IAAI,CAACF,GAAG,CAACC,OAAO,EAAEH,KAAK,CAAC;EAC/B;EAEAM,MAAMA,CAACH,OAAO,EAAE;IACd,MAAMH,KAAK,GAAG,IAAI,CAACI,IAAI,CAACL,GAAG,CAACI,OAAO,CAAC;IACpC,IAAIH,KAAK,IAAI,CAAC,EAAE;MACd,IAAI,CAACL,MAAM,CAACY,MAAM,CAACP,KAAK,EAAE,CAAC,CAAC;MAC5B,IAAI,CAACI,IAAI,CAACE,MAAM,CAACH,OAAO,CAAC;MACzB,IAAI,CAACd,MAAM,EAAE;IACf;EACF;EAOAmB,IAAIA,CAAA,EAAG;IACL,OAAO,IAAI,CAACb,MAAM,CAAC,IAAI,CAACE,OAAO,GAAG,CAAC,CAAC;EACtC;EAOAY,IAAIA,CAACN,OAAO,EAAE;IACZ,IAAI,CAAC,IAAI,CAACC,IAAI,CAACC,GAAG,CAACF,OAAO,CAAC,EAAE;MAC3B,MAAMH,KAAK,GAAG,IAAI,CAACX,MAAM,EAAE;MAC3B,IAAI,CAACM,MAAM,CAACK,KAAK,CAAC,GAAGG,OAAO;MAC5B,IAAI,CAACC,IAAI,CAACF,GAAG,CAACC,OAAO,EAAEH,KAAK,CAAC;IAC/B;EACF;EAOAU,GAAGA,CAAA,EAAG;IACJ,MAAMP,OAAO,GAAG,IAAI,CAACR,MAAM,CAAC,EAAE,IAAI,CAACN,MAAM,CAAC;IAC1C,IAAI,CAACe,IAAI,CAACE,MAAM,CAACH,OAAO,CAAC;IACzB,OAAOA,OAAO;EAChB;EAOAQ,OAAOA,CAACtB,MAAM,EAAE;IACd,IAAAY,mBAAM,EAACZ,MAAM,IAAI,CAAC,CAAC;IAEnB,IAAIA,MAAM,GAAG,IAAI,CAACM,MAAM,CAACN,MAAM,EAAE;MAC/B,IAAI,CAACM,MAAM,CAACN,MAAM,GAAGA,MAAM;IAC7B;EACF;EAOAuB,MAAMA,CAACvB,MAAM,EAAE;IACb,IAAAY,mBAAM,EAACZ,MAAM,IAAI,CAAC,CAAC;IAEnB,IAAI,CAACA,MAAM,GAAGA,MAAM;EACtB;EAOAwB,IAAIA,CAACxB,MAAM,EAAE;IACX,IAAIA,MAAM,KAAK,IAAI,IAAIA,MAAM,KAAKE,SAAS,EAAE;MAC3CF,MAAM,GAAG,IAAI,CAACA,MAAM;IACtB;IACA,IAAI,CAACM,MAAM,CAACN,MAAM,GAAGA,MAAM;EAC7B;EAEAyB,KAAKA,CAAA,EAAG;IACN,IAAI,CAACnB,MAAM,GAAG,EAAE;IAChB,IAAI,CAACS,IAAI,GAAG,IAAIV,GAAG,CAAC,CAAC;IACrB,IAAI,CAACG,OAAO,GAAG,CAAC;EAClB;EAEAkB,IAAIA,CAACC,MAAM,EAAE;IACX,OAAO,IAAI,CAACZ,IAAI,CAACC,GAAG,CAACW,MAAM,CAAC;EAC9B;AACF;AAACC,OAAA,CAAA9B,YAAA,GAAAA,YAAA"}
|
package/package.json
CHANGED
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
{
|
|
2
2
|
"name": "@loaders.gl/tiles",
|
|
3
|
-
"version": "3.4.
|
|
3
|
+
"version": "3.4.15",
|
|
4
4
|
"description": "Common components for different tiles loaders.",
|
|
5
5
|
"license": "MIT",
|
|
6
6
|
"publishConfig": {
|
|
@@ -33,13 +33,13 @@
|
|
|
33
33
|
"build-bundle": "esbuild src/bundle.ts --bundle --outfile=dist/dist.min.js"
|
|
34
34
|
},
|
|
35
35
|
"dependencies": {
|
|
36
|
-
"@loaders.gl/loader-utils": "3.4.
|
|
37
|
-
"@loaders.gl/math": "3.4.
|
|
36
|
+
"@loaders.gl/loader-utils": "3.4.15",
|
|
37
|
+
"@loaders.gl/math": "3.4.15",
|
|
38
38
|
"@math.gl/core": "^3.5.1",
|
|
39
39
|
"@math.gl/culling": "^3.5.1",
|
|
40
40
|
"@math.gl/geospatial": "^3.5.1",
|
|
41
41
|
"@math.gl/web-mercator": "^3.5.1",
|
|
42
|
-
"@probe.gl/stats": "^
|
|
42
|
+
"@probe.gl/stats": "^3.5.0"
|
|
43
43
|
},
|
|
44
44
|
"peerDependencies": {
|
|
45
45
|
"@loaders.gl/core": "^3.4.0"
|
|
@@ -47,5 +47,5 @@
|
|
|
47
47
|
"devDependencies": {
|
|
48
48
|
"@deck.gl/core": "^8.9.0"
|
|
49
49
|
},
|
|
50
|
-
"gitHead": "
|
|
50
|
+
"gitHead": "19e941d5805568e449ef9092490d6568a4853298"
|
|
51
51
|
}
|