@loaders.gl/tiles 3.1.3 → 4.0.0-alpha.5

package/dist/utils/doubly-linked-list-node.js

@@ -1,17 +1,16 @@
-"use strict";
-// This file is derived from the Cesium code base under Apache 2 license
-// See LICENSE.md and https://github.com/AnalyticalGraphicsInc/cesium/blob/master/LICENSE.md
-Object.defineProperty(exports, "__esModule", { value: true });
-/**
- * Doubly linked list node
- *
- * @private
- */
-class DoublyLinkedListNode {
-    constructor(item, previous, next) {
-        this.item = item;
-        this.previous = previous;
-        this.next = next;
-    }
+import _defineProperty from "@babel/runtime/helpers/esm/defineProperty";
+export default class DoublyLinkedListNode {
+  constructor(item, previous, next) {
+    _defineProperty(this, "item", void 0);
+
+    _defineProperty(this, "previous", void 0);
+
+    _defineProperty(this, "next", void 0);
+
+    this.item = item;
+    this.previous = previous;
+    this.next = next;
+  }
+
 }
-exports.default = DoublyLinkedListNode;
+//# sourceMappingURL=doubly-linked-list-node.js.map

package/dist/utils/doubly-linked-list-node.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../src/utils/doubly-linked-list-node.ts"],"names":["DoublyLinkedListNode","constructor","item","previous","next"],"mappings":";AAQA,eAAe,MAAMA,oBAAN,CAA2B;AAKxCC,EAAAA,WAAW,CAACC,IAAD,EAAOC,QAAP,EAAiBC,IAAjB,EAAuB;AAAA;;AAAA;;AAAA;;AAChC,SAAKF,IAAL,GAAYA,IAAZ;AACA,SAAKC,QAAL,GAAgBA,QAAhB;AACA,SAAKC,IAAL,GAAYA,IAAZ;AACD;;AATuC","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\n/**\n * Doubly linked list node\n *\n * @private\n */\nexport default 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"],"file":"doubly-linked-list-node.js"}

package/dist/utils/doubly-linked-list.js

@@ -1,100 +1,81 @@
-"use strict";
-// This file is derived from the Cesium code base under Apache 2 license
-// See LICENSE.md and https://github.com/AnalyticalGraphicsInc/cesium/blob/master/LICENSE.md
-var __importDefault = (this && this.__importDefault) || function (mod) {
-    return (mod && mod.__esModule) ? mod : { "default": mod };
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-const doubly_linked_list_node_1 = __importDefault(require("../utils/doubly-linked-list-node"));
-/**
- * Doubly linked list
- *
- * @private
- */
-class DoublyLinkedList {
-    constructor() {
-        this.head = null;
-        this.tail = null;
-        this._length = 0;
+import _defineProperty from "@babel/runtime/helpers/esm/defineProperty";
+import DoublyLinkedListNode from '../utils/doubly-linked-list-node';
+export default class DoublyLinkedList {
+  constructor() {
+    _defineProperty(this, "head", null);
+
+    _defineProperty(this, "tail", null);
+
+    _defineProperty(this, "_length", 0);
+  }
+
+  get length() {
+    return this._length;
+  }
+
+  add(item) {
+    const node = new DoublyLinkedListNode(item, this.tail, null);
+
+    if (this.tail) {
+      this.tail.next = node;
+      this.tail = node;
+    } else {
+      this.head = node;
+      this.tail = node;
     }
-    get length() {
-        return this._length;
+
+    ++this._length;
+    return node;
+  }
+
+  remove(node) {
+    if (!node) {
+      return;
     }
-    /**
-     * Adds the item to the end of the list
-     * @param {*} [item]
-     * @return {DoublyLinkedListNode}
-     */
-    add(item) {
-        const node = new doubly_linked_list_node_1.default(item, this.tail, null);
-        if (this.tail) {
-            this.tail.next = node;
-            this.tail = node;
-        }
-        else {
-            this.head = node;
-            this.tail = node;
-        }
-        ++this._length;
-        return node;
+
+    if (node.previous && node.next) {
+      node.previous.next = node.next;
+      node.next.previous = node.previous;
+    } else if (node.previous) {
+      node.previous.next = null;
+      this.tail = node.previous;
+    } else if (node.next) {
+      node.next.previous = null;
+      this.head = node.next;
+    } else {
+      this.head = null;
+      this.tail = null;
     }
-    /**
-     * Removes the given node from the list
-     * @param {DoublyLinkedListNode} node
-     */
-    remove(node) {
-        if (!node) {
-            return;
-        }
-        if (node.previous && node.next) {
-            node.previous.next = node.next;
-            node.next.previous = node.previous;
-        }
-        else if (node.previous) {
-            // Remove last node
-            node.previous.next = null;
-            this.tail = node.previous;
-        }
-        else if (node.next) {
-            // Remove first node
-            node.next.previous = null;
-            this.head = node.next;
-        }
-        else {
-            // Remove last node in the linked list
-            this.head = null;
-            this.tail = null;
-        }
-        node.next = null;
-        node.previous = null;
-        --this._length;
+
+    node.next = null;
+    node.previous = null;
+    --this._length;
+  }
+
+  splice(node, nextNode) {
+    if (node === nextNode) {
+      return;
     }
-    /**
-     * Moves nextNode after node
-     * @param {DoublyLinkedListNode} node
-     * @param {DoublyLinkedListNode} nextNode
-     */
-    splice(node, nextNode) {
-        if (node === nextNode) {
-            return;
-        }
-        // Remove nextNode, then insert after node
-        this.remove(nextNode);
-        this._insert(node, nextNode);
-    }
-    _insert(node, nextNode) {
-        const oldNodeNext = node.next;
-        node.next = nextNode;
-        // nextNode is the new tail
-        if (this.tail === node) {
-            this.tail = nextNode;
-        }
-        else {
-            oldNodeNext.previous = nextNode;
-        }
-        nextNode.next = oldNodeNext;
-        nextNode.previous = node;
-        ++this._length;
+
+    this.remove(nextNode);
+
+    this._insert(node, nextNode);
+  }
+
+  _insert(node, nextNode) {
+    const oldNodeNext = node.next;
+    node.next = nextNode;
+
+    if (this.tail === node) {
+      this.tail = nextNode;
+    } else {
+      oldNodeNext.previous = nextNode;
     }
+
+    nextNode.next = oldNodeNext;
+    nextNode.previous = node;
+    ++this._length;
+  }
+
 }
-exports.default = DoublyLinkedList;
+//# sourceMappingURL=doubly-linked-list.js.map

package/dist/utils/doubly-linked-list.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../src/utils/doubly-linked-list.ts"],"names":["DoublyLinkedListNode","DoublyLinkedList","length","_length","add","item","node","tail","next","head","remove","previous","splice","nextNode","_insert","oldNodeNext"],"mappings":";AAGA,OAAOA,oBAAP,MAAiC,kCAAjC;AAOA,eAAe,MAAMC,gBAAN,CAAuB;AAAA;AAAA,kCACA,IADA;;AAAA,kCAEA,IAFA;;AAAA,qCAG1B,CAH0B;AAAA;;AAK1B,MAANC,MAAM,GAAG;AACX,WAAO,KAAKC,OAAZ;AACD;;AAODC,EAAAA,GAAG,CAACC,IAAD,EAAO;AACR,UAAMC,IAAI,GAAG,IAAIN,oBAAJ,CAAyBK,IAAzB,EAA+B,KAAKE,IAApC,EAA0C,IAA1C,CAAb;;AAEA,QAAI,KAAKA,IAAT,EAAe;AACb,WAAKA,IAAL,CAAUC,IAAV,GAAiBF,IAAjB;AACA,WAAKC,IAAL,GAAYD,IAAZ;AACD,KAHD,MAGO;AACL,WAAKG,IAAL,GAAYH,IAAZ;AACA,WAAKC,IAAL,GAAYD,IAAZ;AACD;;AAED,MAAE,KAAKH,OAAP;AAEA,WAAOG,IAAP;AACD;;AAMDI,EAAAA,MAAM,CAACJ,IAAD,EAAO;AACX,QAAI,CAACA,IAAL,EAAW;AACT;AACD;;AAED,QAAIA,IAAI,CAACK,QAAL,IAAiBL,IAAI,CAACE,IAA1B,EAAgC;AAC9BF,MAAAA,IAAI,CAACK,QAAL,CAAcH,IAAd,GAAqBF,IAAI,CAACE,IAA1B;AACAF,MAAAA,IAAI,CAACE,IAAL,CAAUG,QAAV,GAAqBL,IAAI,CAACK,QAA1B;AACD,KAHD,MAGO,IAAIL,IAAI,CAACK,QAAT,EAAmB;AAExBL,MAAAA,IAAI,CAACK,QAAL,CAAcH,IAAd,GAAqB,IAArB;AACA,WAAKD,IAAL,GAAYD,IAAI,CAACK,QAAjB;AACD,KAJM,MAIA,IAAIL,IAAI,CAACE,IAAT,EAAe;AAEpBF,MAAAA,IAAI,CAACE,IAAL,CAAUG,QAAV,GAAqB,IAArB;AACA,WAAKF,IAAL,GAAYH,IAAI,CAACE,IAAjB;AACD,KAJM,MAIA;AAEL,WAAKC,IAAL,GAAY,IAAZ;AACA,WAAKF,IAAL,GAAY,IAAZ;AACD;;AAEDD,IAAAA,IAAI,CAACE,IAAL,GAAY,IAAZ;AACAF,IAAAA,IAAI,CAACK,QAAL,GAAgB,IAAhB;AAEA,MAAE,KAAKR,OAAP;AACD;;AAODS,EAAAA,MAAM,CAACN,IAAD,EAAOO,QAAP,EAAiB;AACrB,QAAIP,IAAI,KAAKO,QAAb,EAAuB;AACrB;AACD;;AAGD,SAAKH,MAAL,CAAYG,QAAZ;;AACA,SAAKC,OAAL,CAAaR,IAAb,EAAmBO,QAAnB;AACD;;AAEDC,EAAAA,OAAO,CAACR,IAAD,EAAOO,QAAP,EAAiB;AACtB,UAAME,WAAW,GAAGT,IAAI,CAACE,IAAzB;AACAF,IAAAA,IAAI,CAACE,IAAL,GAAYK,QAAZ;;AAGA,QAAI,KAAKN,IAAL,KAAcD,IAAlB,EAAwB;AACtB,WAAKC,IAAL,GAAYM,QAAZ;AACD,KAFD,MAEO;AACLE,MAAAA,WAAW,CAACJ,QAAZ,GAAuBE,QAAvB;AACD;;AAEDA,IAAAA,QAAQ,CAACL,IAAT,GAAgBO,WAAhB;AACAF,IAAAA,QAAQ,CAACF,QAAT,GAAoBL,IAApB;AAEA,MAAE,KAAKH,OAAP;AACD;;AA5FmC","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 '../utils/doubly-linked-list-node';\n\n/**\n * Doubly linked list\n *\n * @private\n */\nexport default 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"],"file":"doubly-linked-list.js"}

package/dist/utils/managed-array.js

@@ -1,151 +1,117 @@
-"use strict";
-// This file is derived from the Cesium code base under Apache 2 license
-// See LICENSE.md and https://github.com/AnalyticalGraphicsInc/cesium/blob/master/LICENSE.md
-Object.defineProperty(exports, "__esModule", { value: true });
-const loader_utils_1 = require("@loaders.gl/loader-utils");
-/**
- * A wrapper around arrays so that the internal length of the array can be manually managed.
- *
- * @alias ManagedArray
- * @constructor
- * @private
- *
- * @param {Number} [length=0] The initial length of the array.
- */
-class ManagedArray {
-    constructor(length = 0) {
-        this._map = new Map();
-        this._array = new Array(length);
-        this._length = length;
+import _defineProperty from "@babel/runtime/helpers/esm/defineProperty";
+import { assert } from '@loaders.gl/loader-utils';
+export default class ManagedArray {
+  constructor(length = 0) {
+    _defineProperty(this, "_map", new Map());
+
+    _defineProperty(this, "_array", void 0);
+
+    _defineProperty(this, "_length", void 0);
+
+    this._array = new Array(length);
+    this._length = length;
+  }
+
+  get length() {
+    return this._length;
+  }
+
+  set length(length) {
+    this._length = length;
+
+    if (length > this._array.length) {
+      this._array.length = length;
     }
-    /**
-     * Gets or sets the length of the array.
-     * If the set length is greater than the length of the internal array, the internal array is resized.
-     *
-     * @memberof ManagedArray.prototype
-     * @type Number
-     */
-    get length() {
-        return this._length;
+  }
+
+  get values() {
+    return this._array;
+  }
+
+  get(index) {
+    assert(index < this._array.length);
+    return this._array[index];
+  }
+
+  set(index, element) {
+    assert(index >= 0);
+
+    if (index >= this.length) {
+      this.length = index + 1;
     }
-    set length(length) {
-        this._length = length;
-        if (length > this._array.length) {
-            this._array.length = length;
-        }
+
+    if (this._map.has(this._array[index])) {
+      this._map.delete(this._array[index]);
     }
-    /**
-     * Gets the internal array.
-     *
-     * @memberof ManagedArray.prototype
-     * @type Array
-     * @readonly
-     */
-    get values() {
-        return this._array;
+
+    this._array[index] = element;
+
+    this._map.set(element, index);
+  }
+
+  delete(element) {
+    const index = this._map.get(element);
+
+    if (index >= 0) {
+      this._array.splice(index, 1);
+
+      this._map.delete(element);
+
+      this.length--;
     }
-    /**
-     * Gets the element at an index.
-     *
-     * @param {Number} index The index to get.
-     */
-    get(index) {
-        (0, loader_utils_1.assert)(index < this._array.length);
-        return this._array[index];
+  }
+
+  peek() {
+    return this._array[this._length - 1];
+  }
+
+  push(element) {
+    if (!this._map.has(element)) {
+      const index = this.length++;
+      this._array[index] = element;
+
+      this._map.set(element, index);
     }
-    /**
-     * Sets the element at an index. Resizes the array if index is greater than the length of the array.
-     *
-     * @param {Number} index The index to set.
-     * @param {*} element The element to set at index.
-     */
-    set(index, element) {
-        (0, loader_utils_1.assert)(index >= 0);
-        if (index >= this.length) {
-            this.length = index + 1;
-        }
-        if (this._map.has(this._array[index])) {
-            this._map.delete(this._array[index]);
-        }
-        this._array[index] = element;
-        this._map.set(element, index);
+  }
+
+  pop() {
+    const element = this._array[--this.length];
+
+    this._map.delete(element);
+
+    return element;
+  }
+
+  reserve(length) {
+    assert(length >= 0);
+
+    if (length > this._array.length) {
+      this._array.length = length;
     }
-    delete(element) {
-        const index = this._map.get(element);
-        if (index >= 0) {
-            this._array.splice(index, 1);
-            this._map.delete(element);
-            this.length--;
-        }
-    }
-    /**
-     * Returns the last element in the array without modifying the array.
-     *
-     * @returns {*} The last element in the array.
-     */
-    peek() {
-        return this._array[this._length - 1];
-    }
-    /**
-     * Push an element into the array.
-     *
-     * @param {*} element The element to push.
-     */
-    push(element) {
-        if (!this._map.has(element)) {
-            const index = this.length++;
-            this._array[index] = element;
-            this._map.set(element, index);
-        }
-    }
-    /**
-     * Pop an element from the array.
-     *
-     * @returns {*} The last element in the array.
-     */
-    pop() {
-        const element = this._array[--this.length];
-        this._map.delete(element);
-        return element;
-    }
-    /**
-     * Resize the internal array if length > _array.length.
-     *
-     * @param {Number} length The length.
-     */
-    reserve(length) {
-        (0, loader_utils_1.assert)(length >= 0);
-        if (length > this._array.length) {
-            this._array.length = length;
-        }
-    }
-    /**
-     * Resize the array.
-     *
-     * @param {Number} length The length.
-     */
-    resize(length) {
-        (0, loader_utils_1.assert)(length >= 0);
-        this.length = length;
-    }
-    /**
-     * Trim the internal array to the specified length. Defaults to the current length.
-     *
-     * @param {Number} [length] The length.
-     */
-    trim(length) {
-        if (length === null || length === undefined) {
-            length = this.length;
-        }
-        this._array.length = length;
-    }
-    reset() {
-        this._array = [];
-        this._map = new Map();
-        this._length = 0;
-    }
-    find(target) {
-        return this._map.has(target);
+  }
+
+  resize(length) {
+    assert(length >= 0);
+    this.length = length;
+  }
+
+  trim(length) {
+    if (length === null || length === undefined) {
+      length = this.length;
     }
+
+    this._array.length = length;
+  }
+
+  reset() {
+    this._array = [];
+    this._map = new Map();
+    this._length = 0;
+  }
+
+  find(target) {
+    return this._map.has(target);
+  }
+
 }
-exports.default = ManagedArray;
+//# sourceMappingURL=managed-array.js.map

package/dist/utils/managed-array.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../src/utils/managed-array.ts"],"names":["assert","ManagedArray","constructor","length","Map","_array","Array","_length","values","get","index","set","element","_map","has","delete","splice","peek","push","pop","reserve","resize","trim","undefined","reset","find","target"],"mappings":";AAGA,SAAQA,MAAR,QAAqB,0BAArB;AAWA,eAAe,MAAMC,YAAN,CAAmB;AAKhCC,EAAAA,WAAW,CAACC,MAAM,GAAG,CAAV,EAAa;AAAA,kCAJjB,IAAIC,GAAJ,EAIiB;;AAAA;;AAAA;;AACtB,SAAKC,MAAL,GAAc,IAAIC,KAAJ,CAAUH,MAAV,CAAd;AACA,SAAKI,OAAL,GAAeJ,MAAf;AACD;;AASS,MAANA,MAAM,GAAG;AACX,WAAO,KAAKI,OAAZ;AACD;;AAES,MAANJ,MAAM,CAACA,MAAD,EAAS;AACjB,SAAKI,OAAL,GAAeJ,MAAf;;AACA,QAAIA,MAAM,GAAG,KAAKE,MAAL,CAAYF,MAAzB,EAAiC;AAC/B,WAAKE,MAAL,CAAYF,MAAZ,GAAqBA,MAArB;AACD;AACF;;AASS,MAANK,MAAM,GAAG;AACX,WAAO,KAAKH,MAAZ;AACD;;AAODI,EAAAA,GAAG,CAACC,KAAD,EAAQ;AACTV,IAAAA,MAAM,CAACU,KAAK,GAAG,KAAKL,MAAL,CAAYF,MAArB,CAAN;AACA,WAAO,KAAKE,MAAL,CAAYK,KAAZ,CAAP;AACD;;AAQDC,EAAAA,GAAG,CAACD,KAAD,EAAQE,OAAR,EAAiB;AAClBZ,IAAAA,MAAM,CAACU,KAAK,IAAI,CAAV,CAAN;;AAEA,QAAIA,KAAK,IAAI,KAAKP,MAAlB,EAA0B;AACxB,WAAKA,MAAL,GAAcO,KAAK,GAAG,CAAtB;AACD;;AAED,QAAI,KAAKG,IAAL,CAAUC,GAAV,CAAc,KAAKT,MAAL,CAAYK,KAAZ,CAAd,CAAJ,EAAuC;AACrC,WAAKG,IAAL,CAAUE,MAAV,CAAiB,KAAKV,MAAL,CAAYK,KAAZ,CAAjB;AACD;;AAED,SAAKL,MAAL,CAAYK,KAAZ,IAAqBE,OAArB;;AACA,SAAKC,IAAL,CAAUF,GAAV,CAAcC,OAAd,EAAuBF,KAAvB;AACD;;AAEDK,EAAAA,MAAM,CAACH,OAAD,EAAU;AACd,UAAMF,KAAK,GAAG,KAAKG,IAAL,CAAUJ,GAAV,CAAcG,OAAd,CAAd;;AACA,QAAIF,KAAK,IAAI,CAAb,EAAgB;AACd,WAAKL,MAAL,CAAYW,MAAZ,CAAmBN,KAAnB,EAA0B,CAA1B;;AACA,WAAKG,IAAL,CAAUE,MAAV,CAAiBH,OAAjB;;AACA,WAAKT,MAAL;AACD;AACF;;AAODc,EAAAA,IAAI,GAAG;AACL,WAAO,KAAKZ,MAAL,CAAY,KAAKE,OAAL,GAAe,CAA3B,CAAP;AACD;;AAODW,EAAAA,IAAI,CAACN,OAAD,EAAU;AACZ,QAAI,CAAC,KAAKC,IAAL,CAAUC,GAAV,CAAcF,OAAd,CAAL,EAA6B;AAC3B,YAAMF,KAAK,GAAG,KAAKP,MAAL,EAAd;AACA,WAAKE,MAAL,CAAYK,KAAZ,IAAqBE,OAArB;;AACA,WAAKC,IAAL,CAAUF,GAAV,CAAcC,OAAd,EAAuBF,KAAvB;AACD;AACF;;AAODS,EAAAA,GAAG,GAAG;AACJ,UAAMP,OAAO,GAAG,KAAKP,MAAL,CAAY,EAAE,KAAKF,MAAnB,CAAhB;;AACA,SAAKU,IAAL,CAAUE,MAAV,CAAiBH,OAAjB;;AACA,WAAOA,OAAP;AACD;;AAODQ,EAAAA,OAAO,CAACjB,MAAD,EAAS;AACdH,IAAAA,MAAM,CAACG,MAAM,IAAI,CAAX,CAAN;;AAEA,QAAIA,MAAM,GAAG,KAAKE,MAAL,CAAYF,MAAzB,EAAiC;AAC/B,WAAKE,MAAL,CAAYF,MAAZ,GAAqBA,MAArB;AACD;AACF;;AAODkB,EAAAA,MAAM,CAAClB,MAAD,EAAS;AACbH,IAAAA,MAAM,CAACG,MAAM,IAAI,CAAX,CAAN;AAEA,SAAKA,MAAL,GAAcA,MAAd;AACD;;AAODmB,EAAAA,IAAI,CAACnB,MAAD,EAAS;AACX,QAAIA,MAAM,KAAK,IAAX,IAAmBA,MAAM,KAAKoB,SAAlC,EAA6C;AAC3CpB,MAAAA,MAAM,GAAG,KAAKA,MAAd;AACD;;AACD,SAAKE,MAAL,CAAYF,MAAZ,GAAqBA,MAArB;AACD;;AAEDqB,EAAAA,KAAK,GAAG;AACN,SAAKnB,MAAL,GAAc,EAAd;AACA,SAAKQ,IAAL,GAAY,IAAIT,GAAJ,EAAZ;AACA,SAAKG,OAAL,GAAe,CAAf;AACD;;AAEDkB,EAAAA,IAAI,CAACC,MAAD,EAAS;AACX,WAAO,KAAKb,IAAL,CAAUC,GAAV,CAAcY,MAAd,CAAP;AACD;;AA5J+B","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 default 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"],"file":"managed-array.js"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@loaders.gl/tiles",
-  "version": "3.1.3",
+  "version": "4.0.0-alpha.5",
   "description": "Common components for different tiles loaders.",
   "license": "MIT",
   "publishConfig": {
@@ -20,8 +20,8 @@
     "pointcloud"
   ],
   "types": "dist/index.d.ts",
-  "main": "dist/es5/index.js",
-  "module": "dist/esm/index.js",
+  "main": "dist/index.js",
+  "module": "dist/index.js",
   "sideEffects": false,
   "files": [
     "src",
@@ -33,8 +33,8 @@
     "build-bundle": "esbuild src/bundle.ts --bundle --outfile=dist/dist.min.js"
   },
   "dependencies": {
-    "@loaders.gl/loader-utils": "3.1.3",
-    "@loaders.gl/math": "3.1.3",
+    "@loaders.gl/loader-utils": "4.0.0-alpha.5",
+    "@loaders.gl/math": "4.0.0-alpha.5",
     "@math.gl/core": "^3.5.1",
     "@math.gl/culling": "^3.5.1",
     "@math.gl/geospatial": "^3.5.1",
@@ -42,7 +42,7 @@
     "@probe.gl/stats": "^3.5.0"
   },
   "peerDependencies": {
-    "@loaders.gl/core": "3.1.0"
+    "@loaders.gl/core": "4.0.0-alpha.4"
   },
-  "gitHead": "4a690c369779346d73c9a27395d1c08d77d279a4"
+  "gitHead": "7a71a54bdf1ddf985cc3af3db90b82e7fa97d025"
 }

package/dist/es5/bundle.js

@@ -1,7 +0,0 @@
-"use strict";
-
-var moduleExports = require('./index');
-
-globalThis.loaders = globalThis.loaders || {};
-module.exports = Object.assign(globalThis.loaders, moduleExports);
-//# sourceMappingURL=bundle.js.map

package/dist/es5/bundle.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../../src/bundle.ts"],"names":["moduleExports","require","globalThis","loaders","module","exports","Object","assign"],"mappings":";;AACA,IAAMA,aAAa,GAAGC,OAAO,CAAC,SAAD,CAA7B;;AACAC,UAAU,CAACC,OAAX,GAAqBD,UAAU,CAACC,OAAX,IAAsB,EAA3C;AACAC,MAAM,CAACC,OAAP,GAAiBC,MAAM,CAACC,MAAP,CAAcL,UAAU,CAACC,OAAzB,EAAkCH,aAAlC,CAAjB","sourcesContent":["// @ts-nocheck\nconst moduleExports = require('./index');\nglobalThis.loaders = globalThis.loaders || {};\nmodule.exports = Object.assign(globalThis.loaders, moduleExports);\n"],"file":"bundle.js"}

package/dist/es5/constants.js

@@ -1,44 +0,0 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.TILE3D_OPTIMIZATION_HINT = exports.LOD_METRIC_TYPE = exports.TILESET_TYPE = exports.TILE_TYPE = exports.TILE_REFINEMENT = exports.TILE_CONTENT_STATE = void 0;
-var TILE_CONTENT_STATE = {
-  UNLOADED: 0,
-  LOADING: 1,
-  PROCESSING: 2,
-  READY: 3,
-  EXPIRED: 4,
-  FAILED: 5
-};
-exports.TILE_CONTENT_STATE = TILE_CONTENT_STATE;
-var TILE_REFINEMENT = {
-  ADD: 1,
-  REPLACE: 2
-};
-exports.TILE_REFINEMENT = TILE_REFINEMENT;
-var TILE_TYPE = {
-  EMPTY: 'empty',
-  SCENEGRAPH: 'scenegraph',
-  POINTCLOUD: 'pointcloud',
-  MESH: 'mesh'
-};
-exports.TILE_TYPE = TILE_TYPE;
-var TILESET_TYPE = {
-  I3S: 'I3S',
-  TILES3D: 'TILES3D'
-};
-exports.TILESET_TYPE = TILESET_TYPE;
-var LOD_METRIC_TYPE = {
-  GEOMETRIC_ERROR: 'geometricError',
-  MAX_SCREEN_THRESHOLD: 'maxScreenThreshold'
-};
-exports.LOD_METRIC_TYPE = LOD_METRIC_TYPE;
-var TILE3D_OPTIMIZATION_HINT = {
-  NOT_COMPUTED: -1,
-  USE_OPTIMIZATION: 1,
-  SKIP_OPTIMIZATION: 0
-};
-exports.TILE3D_OPTIMIZATION_HINT = TILE3D_OPTIMIZATION_HINT;
-//# sourceMappingURL=constants.js.map

package/dist/es5/constants.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../../src/constants.ts"],"names":["TILE_CONTENT_STATE","UNLOADED","LOADING","PROCESSING","READY","EXPIRED","FAILED","TILE_REFINEMENT","ADD","REPLACE","TILE_TYPE","EMPTY","SCENEGRAPH","POINTCLOUD","MESH","TILESET_TYPE","I3S","TILES3D","LOD_METRIC_TYPE","GEOMETRIC_ERROR","MAX_SCREEN_THRESHOLD","TILE3D_OPTIMIZATION_HINT","NOT_COMPUTED","USE_OPTIMIZATION","SKIP_OPTIMIZATION"],"mappings":";;;;;;AAAO,IAAMA,kBAAkB,GAAG;AAChCC,EAAAA,QAAQ,EAAE,CADsB;AAEhCC,EAAAA,OAAO,EAAE,CAFuB;AAGhCC,EAAAA,UAAU,EAAE,CAHoB;AAIhCC,EAAAA,KAAK,EAAE,CAJyB;AAKhCC,EAAAA,OAAO,EAAE,CALuB;AAMhCC,EAAAA,MAAM,EAAE;AANwB,CAA3B;;AASA,IAAMC,eAAe,GAAG;AAC7BC,EAAAA,GAAG,EAAE,CADwB;AAE7BC,EAAAA,OAAO,EAAE;AAFoB,CAAxB;;AAKA,IAAMC,SAAS,GAAG;AACvBC,EAAAA,KAAK,EAAE,OADgB;AAEvBC,EAAAA,UAAU,EAAE,YAFW;AAGvBC,EAAAA,UAAU,EAAE,YAHW;AAIvBC,EAAAA,IAAI,EAAE;AAJiB,CAAlB;;AAOA,IAAMC,YAAY,GAAG;AAC1BC,EAAAA,GAAG,EAAE,KADqB;AAE1BC,EAAAA,OAAO,EAAE;AAFiB,CAArB;;AAKA,IAAMC,eAAe,GAAG;AAC7BC,EAAAA,eAAe,EAAE,gBADY;AAE7BC,EAAAA,oBAAoB,EAAE;AAFO,CAAxB;;AAMA,IAAMC,wBAAwB,GAAG;AACtCC,EAAAA,YAAY,EAAE,CAAC,CADuB;AAEtCC,EAAAA,gBAAgB,EAAE,CAFoB;AAGtCC,EAAAA,iBAAiB,EAAE;AAHmB,CAAjC","sourcesContent":["export const TILE_CONTENT_STATE = {\n  UNLOADED: 0, // Has never been requested\n  LOADING: 1, // Is waiting on a pending request\n  PROCESSING: 2, // Request received.  Contents are being processed for rendering.  Depending on the content, it might make its own requests for external data.\n  READY: 3, // Ready to render.\n  EXPIRED: 4, // Is expired and will be unloaded once new content is loaded.\n  FAILED: 5 // Request failed.\n};\n\nexport const TILE_REFINEMENT = {\n  ADD: 1, // Render tile and, if screen space error exceeded, also refine to its children.\n  REPLACE: 2 // Render tile or, if screen space error exceeded, refine to its descendants instead.\n};\n\nexport const TILE_TYPE = {\n  EMPTY: 'empty',\n  SCENEGRAPH: 'scenegraph',\n  POINTCLOUD: 'pointcloud',\n  MESH: 'mesh'\n};\n\nexport const TILESET_TYPE = {\n  I3S: 'I3S',\n  TILES3D: 'TILES3D'\n};\n\nexport const LOD_METRIC_TYPE = {\n  GEOMETRIC_ERROR: 'geometricError',\n  MAX_SCREEN_THRESHOLD: 'maxScreenThreshold'\n};\n\n// Cesium 3D Tiles Specific\nexport const TILE3D_OPTIMIZATION_HINT = {\n  NOT_COMPUTED: -1,\n  USE_OPTIMIZATION: 1,\n  SKIP_OPTIMIZATION: 0\n};\n"],"file":"constants.js"}