@loaders.gl/tiles 3.4.0-alpha.2 → 3.4.0-alpha.4

package/dist/esm/tileset/tileset-traverser.js

@@ -1,7 +1,6 @@
 import _defineProperty from "@babel/runtime/helpers/esm/defineProperty";
 import { ManagedArray } from '../utils/managed-array';
 import { TILE_REFINEMENT } from '../constants';
-
 export const DEFAULT_PROPS = {
   loadSiblings: false,
   skipLevelOfDetail: false,
@@ -15,7 +14,6 @@ export class TilesetTraverser {
   traversalFinished(frameState) {
     return true;
   }
-
   constructor(options) {
     _defineProperty(this, "options", void 0);
     _defineProperty(this, "root", void 0);
@@ -33,25 +31,19 @@ export class TilesetTraverser {
     };
     this._traversalStack = new ManagedArray();
     this._emptyTraversalStack = new ManagedArray();
-
     this._frameNumber = null;
-
     this.root = null;
-
     this.selectedTiles = {};
     this.requestedTiles = {};
     this.emptyTiles = {};
   }
-
   traverse(root, frameState, options) {
     this.root = root;
     this.options = {
       ...this.options,
       ...options
     };
-
     this.reset();
-
     this.updateTile(root, frameState);
     this._frameNumber = frameState.frameNumber;
     this.executeTraversal(root, frameState);
@@ -63,20 +55,17 @@ export class TilesetTraverser {
     this._traversalStack.reset();
     this._emptyTraversalStack.reset();
   }
-
   executeTraversal(root, frameState) {
     const stack = this._traversalStack;
     root._selectionDepth = 1;
     stack.push(root);
     while (stack.length > 0) {
       const tile = stack.pop();
-
       let shouldRefine = false;
       if (this.canTraverse(tile, frameState)) {
         this.updateChildTiles(tile, frameState);
         shouldRefine = this.updateAndPushChildren(tile, frameState, stack, tile.hasRenderContent ? tile._selectionDepth + 1 : tile._selectionDepth);
       }
-
       const parent = tile.parent;
       const parentRefines = Boolean(!parent || parent._shouldRefine);
       const stoppedRefining = !shouldRefine;
@@ -89,16 +78,13 @@ export class TilesetTraverser {
       } else if (tile.refine === TILE_REFINEMENT.ADD) {
         this.loadTile(tile, frameState);
         this.selectTile(tile, frameState);
-
       } else if (tile.refine === TILE_REFINEMENT.REPLACE) {
         this.loadTile(tile, frameState);
         if (stoppedRefining) {
           this.selectTile(tile, frameState);
         }
       }
-
       this.touchTile(tile, frameState);
-
       tile._shouldRefine = shouldRefine && parentRefines;
     }
     const newTime = new Date().getTime();
@@ -114,16 +100,13 @@ export class TilesetTraverser {
     }
     return true;
   }
-
   updateAndPushChildren(tile, frameState, stack, depth) {
     const {
       loadSiblings,
       skipLevelOfDetail
     } = this.options;
     const children = tile.children;
-
     children.sort(this.compareDistanceToCamera.bind(this));
-
     const checkRefines = tile.refine === TILE_REFINEMENT.REPLACE && tile.hasRenderContent && !skipLevelOfDetail;
     let hasVisibleChild = false;
     let refines = true;
@@ -159,18 +142,15 @@ export class TilesetTraverser {
     }
     return refines;
   }
-
   updateTile(tile, frameState) {
     this.updateTileVisibility(tile, frameState);
   }
-
   selectTile(tile, frameState) {
     if (this.shouldSelectTile(tile)) {
       tile._selectedFrame = frameState.frameNumber;
       this.selectedTiles[tile.id] = tile;
     }
   }
-
   loadTile(tile, frameState) {
     if (this.shouldLoadTile(tile)) {
       tile._requestedFrame = frameState.frameNumber;
@@ -178,19 +158,16 @@ export class TilesetTraverser {
       this.requestedTiles[tile.id] = tile;
     }
   }
-
   touchTile(tile, frameState) {
     tile.tileset._cache.touch(tile);
     tile._touchedFrame = frameState.frameNumber;
   }
-
   canTraverse(tile, frameState) {
     let useParentMetric = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : false;
     let ignoreVisibility = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : false;
     if (!tile.hasChildren) {
       return false;
     }
-
     if (tile.hasTilesetContent) {
       return !tile.contentExpired;
     }
@@ -205,7 +182,6 @@ export class TilesetTraverser {
   shouldSelectTile(tile) {
     return tile.contentAvailable && !this.options.skipLevelOfDetail;
   }
-
   shouldRefine(tile, frameState, useParentMetric) {
     let screenSpaceError = tile._screenSpaceError;
     if (useParentMetric) {
@@ -227,7 +203,6 @@ export class TilesetTraverser {
     }
     tile.updateVisibility(frameState, viewportIds);
   }
-
   compareDistanceToCamera(b, a) {
     return b._distanceToCamera - a._distanceToCamera;
   }
@@ -239,7 +214,6 @@ export class TilesetTraverser {
     }
     return anyVisible;
   }
-
   executeEmptyTraversal(root, frameState) {
     let allDescendantsLoaded = true;
     const stack = this._emptyTraversalStack;
@@ -251,7 +225,6 @@ export class TilesetTraverser {
         this.loadTile(tile, frameState);
       }
       this.touchTile(tile, frameState);
-
       const traverse = !tile.hasRenderContent && this.canTraverse(tile, frameState, false, true);
       if (traverse) {
         const children = tile.children;

package/dist/esm/tileset/tileset-traverser.js.map

@@ -1 +1 @@
-{"version":3,"file":"tileset-traverser.js","names":["ManagedArray","TILE_REFINEMENT","DEFAULT_PROPS","loadSiblings","skipLevelOfDetail","maximumScreenSpaceError","updateTransforms","onTraversalEnd","viewportTraversersMap","basePath","TilesetTraverser","traversalFinished","frameState","constructor","options","Date","getTime","_traversalStack","_emptyTraversalStack","_frameNumber","root","selectedTiles","requestedTiles","emptyTiles","traverse","reset","updateTile","frameNumber","executeTraversal","stack","_selectionDepth","push","length","tile","pop","shouldRefine","canTraverse","updateChildTiles","updateAndPushChildren","hasRenderContent","parent","parentRefines","Boolean","_shouldRefine","stoppedRefining","id","loadTile","selectTile","refine","ADD","REPLACE","touchTile","newTime","lastUpdate","updateDebounceTime","children","child","depth","sort","compareDistanceToCamera","bind","checkRefines","hasVisibleChild","refines","isVisibleAndInRequestVolume","find","delete","childRefines","_inRequestVolume","executeEmptyTraversal","contentAvailable","updateTileVisibility","shouldSelectTile","_selectedFrame","shouldLoadTile","_requestedFrame","_priority","_getPriority","tileset","_cache","touch","_touchedFrame","useParentMetric","ignoreVisibility","hasChildren","hasTilesetContent","contentExpired","hasUnloadedContent","screenSpaceError","_screenSpaceError","getScreenSpaceError","viewportIds","key","value","viewport","updateVisibility","b","a","_distanceToCamera","anyChildrenVisible","anyVisible","allDescendantsLoaded"],"sources":["../../../src/tileset/tileset-traverser.ts"],"sourcesContent":["import {ManagedArray} from '../utils/managed-array';\nimport {TILE_REFINEMENT} from '../constants';\nimport {FrameState} from './helpers/frame-state';\n\nexport type TilesetTraverserProps = {\n  loadSiblings?: boolean;\n  skipLevelOfDetail?: boolean;\n  maximumScreenSpaceError?: number;\n  onTraversalEnd?: (frameState) => any;\n  viewportTraversersMap?: {[key: string]: any};\n  basePath?: string;\n  updateTransforms?: boolean;\n};\n\n// export type Props = {\n//   loadSiblings: boolean;\n//   skipLevelOfDetail: boolean;\n//   updateTransforms: boolean;\n//   maximumScreenSpaceError: number;\n//   onTraversalEnd: (frameState) => any;\n//   viewportTraversersMap: {[key: string]: any};\n//   basePath: string;\n// };\n\nexport const DEFAULT_PROPS: Required<TilesetTraverserProps> = {\n  loadSiblings: false,\n  skipLevelOfDetail: false,\n  maximumScreenSpaceError: 2,\n  updateTransforms: true,\n  onTraversalEnd: () => {},\n  viewportTraversersMap: {},\n  basePath: ''\n};\n\nexport class TilesetTraverser {\n  options: Required<TilesetTraverserProps>;\n\n  root: any;\n  requestedTiles: object;\n  selectedTiles: object;\n  emptyTiles: object;\n\n  protected lastUpdate: number = new Date().getTime();\n  protected readonly updateDebounceTime = 1000;\n  protected _traversalStack: ManagedArray;\n  protected _emptyTraversalStack: ManagedArray;\n  protected _frameNumber: number | null;\n\n  protected traversalFinished(frameState: FrameState): boolean {\n    return true;\n  }\n\n  // TODO nested props\n  constructor(options: TilesetTraverserProps) {\n    this.options = {...DEFAULT_PROPS, ...options};\n    // TRAVERSAL\n    // temporary storage to hold the traversed tiles during a traversal\n    this._traversalStack = new ManagedArray();\n    this._emptyTraversalStack = new ManagedArray();\n\n    // set in every traverse cycle\n    this._frameNumber = null;\n\n    // fulfill in traverse call\n    this.root = null;\n\n    // RESULT\n    // tiles should be rendered\n    this.selectedTiles = {};\n    // tiles should be loaded from server\n    this.requestedTiles = {};\n    // tiles does not have render content\n    this.emptyTiles = {};\n  }\n\n  // tiles should be visible\n  traverse(root, frameState, options) {\n    this.root = root; // for root screen space error\n    this.options = {...this.options, ...options};\n\n    // reset result\n    this.reset();\n\n    // update tile (visibility and expiration)\n    this.updateTile(root, frameState);\n\n    this._frameNumber = frameState.frameNumber;\n    this.executeTraversal(root, frameState);\n  }\n\n  reset() {\n    this.requestedTiles = {};\n    this.selectedTiles = {};\n    this.emptyTiles = {};\n    this._traversalStack.reset();\n    this._emptyTraversalStack.reset();\n  }\n\n  // execute traverse\n  // Depth-first traversal that traverses all visible tiles and marks tiles for selection.\n  // If skipLevelOfDetail is off then a tile does not refine until all children are loaded.\n  // This is the traditional replacement refinement approach and is called the base traversal.\n  // Tiles that have a greater screen space error than the base screen space error are part of the base traversal,\n  // all other tiles are part of the skip traversal. The skip traversal allows for skipping levels of the tree\n  // and rendering children and parent tiles simultaneously.\n  /* eslint-disable-next-line complexity, max-statements */\n  executeTraversal(root, frameState: FrameState) {\n    // stack to store traversed tiles, only visible tiles should be added to stack\n    // visible: visible in the current view frustum\n    const stack = this._traversalStack;\n    root._selectionDepth = 1;\n\n    stack.push(root);\n    while (stack.length > 0) {\n      // 1. pop tile\n      const tile = stack.pop();\n\n      // 2. check if tile needs to be refine, needs refine if a tile's LoD is not sufficient and tile has available children (available content)\n      let shouldRefine = false;\n      if (this.canTraverse(tile, frameState)) {\n        this.updateChildTiles(tile, frameState);\n        shouldRefine = this.updateAndPushChildren(\n          tile,\n          frameState,\n          stack,\n          tile.hasRenderContent ? tile._selectionDepth + 1 : tile._selectionDepth\n        );\n      }\n\n      // 3. decide if should render (select) this tile\n      //   - tile does not have render content\n      //   - tile has render content and tile is `add` type (pointcloud)\n      //   - tile has render content and tile is `replace` type (photogrammetry) and can't refine any further\n      const parent = tile.parent;\n      const parentRefines = Boolean(!parent || parent._shouldRefine);\n      const stoppedRefining = !shouldRefine;\n\n      if (!tile.hasRenderContent) {\n        this.emptyTiles[tile.id] = tile;\n        this.loadTile(tile, frameState);\n        if (stoppedRefining) {\n          this.selectTile(tile, frameState);\n        }\n        // additive tiles\n      } else if (tile.refine === TILE_REFINEMENT.ADD) {\n        // Additive tiles are always loaded and selected\n        this.loadTile(tile, frameState);\n        this.selectTile(tile, frameState);\n\n        // replace tiles\n      } else if (tile.refine === TILE_REFINEMENT.REPLACE) {\n        // Always load tiles in the base traversal\n        // Select tiles that can't refine further\n        this.loadTile(tile, frameState);\n        if (stoppedRefining) {\n          this.selectTile(tile, frameState);\n        }\n      }\n\n      // 3. update cache, most recent touched tiles have higher priority to be fetched from server\n      this.touchTile(tile, frameState);\n\n      // 4. update tile refine prop and parent refinement status to trickle down to the descendants\n      tile._shouldRefine = shouldRefine && parentRefines;\n    }\n\n    const newTime = new Date().getTime();\n    if (this.traversalFinished(frameState) || newTime - this.lastUpdate > this.updateDebounceTime) {\n      this.lastUpdate = newTime;\n      this.options.onTraversalEnd(frameState);\n    }\n  }\n\n  updateChildTiles(tile, frameState) {\n    const children = tile.children;\n    for (const child of children) {\n      this.updateTile(child, frameState);\n    }\n    return true;\n  }\n\n  /* eslint-disable complexity, max-statements */\n  updateAndPushChildren(tile, frameState, stack, depth) {\n    const {loadSiblings, skipLevelOfDetail} = this.options;\n\n    const children = tile.children;\n\n    // sort children tiles\n    children.sort(this.compareDistanceToCamera.bind(this));\n\n    // For traditional replacement refinement only refine if all children are loaded.\n    // Empty tiles are exempt since it looks better if children stream in as they are loaded to fill the empty space.\n    const checkRefines =\n      tile.refine === TILE_REFINEMENT.REPLACE && tile.hasRenderContent && !skipLevelOfDetail;\n\n    let hasVisibleChild = false;\n    let refines = true;\n\n    for (const child of children) {\n      child._selectionDepth = depth;\n      if (child.isVisibleAndInRequestVolume) {\n        if (stack.find(child)) {\n          stack.delete(child);\n        }\n        stack.push(child);\n        hasVisibleChild = true;\n      } else if (checkRefines || loadSiblings) {\n        // Keep non-visible children loaded since they are still needed before the parent can refine.\n        // Or loadSiblings is true so always load tiles regardless of visibility.\n        this.loadTile(child, frameState);\n        this.touchTile(child, frameState);\n      }\n\n      if (checkRefines) {\n        let childRefines;\n        if (!child._inRequestVolume) {\n          childRefines = false;\n        } else if (!child.hasRenderContent) {\n          childRefines = this.executeEmptyTraversal(child, frameState);\n        } else {\n          childRefines = child.contentAvailable;\n        }\n        refines = refines && childRefines;\n\n        if (!refines) {\n          return false;\n        }\n      }\n    }\n\n    if (!hasVisibleChild) {\n      refines = false;\n    }\n    return refines;\n  }\n  /* eslint-enable complexity, max-statements */\n\n  updateTile(tile, frameState) {\n    this.updateTileVisibility(tile, frameState);\n  }\n\n  // tile to render in the browser\n  selectTile(tile, frameState) {\n    if (this.shouldSelectTile(tile)) {\n      // The tile can be selected right away and does not require traverseAndSelect\n      tile._selectedFrame = frameState.frameNumber;\n      this.selectedTiles[tile.id] = tile;\n    }\n  }\n\n  // tile to load from server\n  loadTile(tile, frameState) {\n    if (this.shouldLoadTile(tile)) {\n      tile._requestedFrame = frameState.frameNumber;\n      tile._priority = tile._getPriority();\n      this.requestedTiles[tile.id] = tile;\n    }\n  }\n\n  // cache tile\n  touchTile(tile, frameState) {\n    tile.tileset._cache.touch(tile);\n    tile._touchedFrame = frameState.frameNumber;\n  }\n\n  // tile should be visible\n  // tile should have children\n  // tile LoD (level of detail) is not sufficient under current viewport\n  canTraverse(tile, frameState, useParentMetric = false, ignoreVisibility = false) {\n    if (!tile.hasChildren) {\n      return false;\n    }\n\n    // cesium specific\n    if (tile.hasTilesetContent) {\n      // Traverse external this to visit its root tile\n      // Don't traverse if the subtree is expired because it will be destroyed\n      return !tile.contentExpired;\n    }\n\n    if (!ignoreVisibility && !tile.isVisibleAndInRequestVolume) {\n      return false;\n    }\n\n    return this.shouldRefine(tile, frameState, useParentMetric);\n  }\n\n  shouldLoadTile(tile) {\n    // if request tile is in current frame\n    // and has unexpired render content\n    return tile.hasUnloadedContent || tile.contentExpired;\n  }\n\n  shouldSelectTile(tile) {\n    // if select tile is in current frame\n    // and content available\n    return tile.contentAvailable && !this.options.skipLevelOfDetail;\n  }\n\n  // Decide if tile LoD (level of detail) is not sufficient under current viewport\n  shouldRefine(tile, frameState, useParentMetric) {\n    let screenSpaceError = tile._screenSpaceError;\n    if (useParentMetric) {\n      screenSpaceError = tile.getScreenSpaceError(frameState, true);\n    }\n\n    return screenSpaceError > this.options.maximumScreenSpaceError;\n  }\n\n  updateTileVisibility(tile, frameState) {\n    const viewportIds: string[] = [];\n    if (this.options.viewportTraversersMap) {\n      for (const key in this.options.viewportTraversersMap) {\n        const value = this.options.viewportTraversersMap[key];\n        if (value === frameState.viewport.id) {\n          viewportIds.push(key);\n        }\n      }\n    } else {\n      viewportIds.push(frameState.viewport.id);\n    }\n    tile.updateVisibility(frameState, viewportIds);\n  }\n\n  // UTILITIES\n\n  compareDistanceToCamera(b, a) {\n    return b._distanceToCamera - a._distanceToCamera;\n  }\n\n  anyChildrenVisible(tile, frameState) {\n    let anyVisible = false;\n    for (const child of tile.children) {\n      child.updateVisibility(frameState);\n      anyVisible = anyVisible || child.isVisibleAndInRequestVolume;\n    }\n    return anyVisible;\n  }\n\n  // Depth-first traversal that checks if all nearest descendants with content are loaded.\n  // Ignores visibility.\n  executeEmptyTraversal(root, frameState) {\n    let allDescendantsLoaded = true;\n    const stack = this._emptyTraversalStack;\n\n    stack.push(root);\n\n    while (stack.length > 0 && allDescendantsLoaded) {\n      const tile = stack.pop();\n\n      this.updateTile(tile, frameState);\n\n      if (!tile.isVisibleAndInRequestVolume) {\n        // Load tiles that aren't visible since they are still needed for the parent to refine\n        this.loadTile(tile, frameState);\n      }\n\n      this.touchTile(tile, frameState);\n\n      // Only traverse if the tile is empty - traversal stop at descendants with content\n      const traverse = !tile.hasRenderContent && this.canTraverse(tile, frameState, false, true);\n\n      if (traverse) {\n        const children = tile.children;\n        for (const child of children) {\n          // eslint-disable-next-line max-depth\n          if (stack.find(child)) {\n            stack.delete(child);\n          }\n          stack.push(child);\n        }\n      } else if (!tile.contentAvailable) {\n        allDescendantsLoaded = false;\n      }\n    }\n\n    return allDescendantsLoaded;\n  }\n}\n\n// TODO\n// enable expiration\n// enable optimization hint\n"],"mappings":";AAAA,SAAQA,YAAY,QAAO,wBAAwB;AACnD,SAAQC,eAAe,QAAO,cAAc;;AAuB5C,OAAO,MAAMC,aAA8C,GAAG;EAC5DC,YAAY,EAAE,KAAK;EACnBC,iBAAiB,EAAE,KAAK;EACxBC,uBAAuB,EAAE,CAAC;EAC1BC,gBAAgB,EAAE,IAAI;EACtBC,cAAc,EAAE,MAAM,CAAC,CAAC;EACxBC,qBAAqB,EAAE,CAAC,CAAC;EACzBC,QAAQ,EAAE;AACZ,CAAC;AAED,OAAO,MAAMC,gBAAgB,CAAC;EAclBC,iBAAiB,CAACC,UAAsB,EAAW;IAC3D,OAAO,IAAI;EACb;;EAGAC,WAAW,CAACC,OAA8B,EAAE;IAAA;IAAA;IAAA;IAAA;IAAA;IAAA,oCAXb,IAAIC,IAAI,EAAE,CAACC,OAAO,EAAE;IAAA,4CACX,IAAI;IAAA;IAAA;IAAA;IAW1C,IAAI,CAACF,OAAO,GAAG;MAAC,GAAGZ,aAAa;MAAE,GAAGY;IAAO,CAAC;IAG7C,IAAI,CAACG,eAAe,GAAG,IAAIjB,YAAY,EAAE;IACzC,IAAI,CAACkB,oBAAoB,GAAG,IAAIlB,YAAY,EAAE;;IAG9C,IAAI,CAACmB,YAAY,GAAG,IAAI;;IAGxB,IAAI,CAACC,IAAI,GAAG,IAAI;;IAIhB,IAAI,CAACC,aAAa,GAAG,CAAC,CAAC;IAEvB,IAAI,CAACC,cAAc,GAAG,CAAC,CAAC;IAExB,IAAI,CAACC,UAAU,GAAG,CAAC,CAAC;EACtB;;EAGAC,QAAQ,CAACJ,IAAI,EAAER,UAAU,EAAEE,OAAO,EAAE;IAClC,IAAI,CAACM,IAAI,GAAGA,IAAI;IAChB,IAAI,CAACN,OAAO,GAAG;MAAC,GAAG,IAAI,CAACA,OAAO;MAAE,GAAGA;IAAO,CAAC;;IAG5C,IAAI,CAACW,KAAK,EAAE;;IAGZ,IAAI,CAACC,UAAU,CAACN,IAAI,EAAER,UAAU,CAAC;IAEjC,IAAI,CAACO,YAAY,GAAGP,UAAU,CAACe,WAAW;IAC1C,IAAI,CAACC,gBAAgB,CAACR,IAAI,EAAER,UAAU,CAAC;EACzC;EAEAa,KAAK,GAAG;IACN,IAAI,CAACH,cAAc,GAAG,CAAC,CAAC;IACxB,IAAI,CAACD,aAAa,GAAG,CAAC,CAAC;IACvB,IAAI,CAACE,UAAU,GAAG,CAAC,CAAC;IACpB,IAAI,CAACN,eAAe,CAACQ,KAAK,EAAE;IAC5B,IAAI,CAACP,oBAAoB,CAACO,KAAK,EAAE;EACnC;;EAUAG,gBAAgB,CAACR,IAAI,EAAER,UAAsB,EAAE;IAG7C,MAAMiB,KAAK,GAAG,IAAI,CAACZ,eAAe;IAClCG,IAAI,CAACU,eAAe,GAAG,CAAC;IAExBD,KAAK,CAACE,IAAI,CAACX,IAAI,CAAC;IAChB,OAAOS,KAAK,CAACG,MAAM,GAAG,CAAC,EAAE;MAEvB,MAAMC,IAAI,GAAGJ,KAAK,CAACK,GAAG,EAAE;;MAGxB,IAAIC,YAAY,GAAG,KAAK;MACxB,IAAI,IAAI,CAACC,WAAW,CAACH,IAAI,EAAErB,UAAU,CAAC,EAAE;QACtC,IAAI,CAACyB,gBAAgB,CAACJ,IAAI,EAAErB,UAAU,CAAC;QACvCuB,YAAY,GAAG,IAAI,CAACG,qBAAqB,CACvCL,IAAI,EACJrB,UAAU,EACViB,KAAK,EACLI,IAAI,CAACM,gBAAgB,GAAGN,IAAI,CAACH,eAAe,GAAG,CAAC,GAAGG,IAAI,CAACH,eAAe,CACxE;MACH;;MAMA,MAAMU,MAAM,GAAGP,IAAI,CAACO,MAAM;MAC1B,MAAMC,aAAa,GAAGC,OAAO,CAAC,CAACF,MAAM,IAAIA,MAAM,CAACG,aAAa,CAAC;MAC9D,MAAMC,eAAe,GAAG,CAACT,YAAY;MAErC,IAAI,CAACF,IAAI,CAACM,gBAAgB,EAAE;QAC1B,IAAI,CAAChB,UAAU,CAACU,IAAI,CAACY,EAAE,CAAC,GAAGZ,IAAI;QAC/B,IAAI,CAACa,QAAQ,CAACb,IAAI,EAAErB,UAAU,CAAC;QAC/B,IAAIgC,eAAe,EAAE;UACnB,IAAI,CAACG,UAAU,CAACd,IAAI,EAAErB,UAAU,CAAC;QACnC;MAEF,CAAC,MAAM,IAAIqB,IAAI,CAACe,MAAM,KAAK/C,eAAe,CAACgD,GAAG,EAAE;QAE9C,IAAI,CAACH,QAAQ,CAACb,IAAI,EAAErB,UAAU,CAAC;QAC/B,IAAI,CAACmC,UAAU,CAACd,IAAI,EAAErB,UAAU,CAAC;;MAGnC,CAAC,MAAM,IAAIqB,IAAI,CAACe,MAAM,KAAK/C,eAAe,CAACiD,OAAO,EAAE;QAGlD,IAAI,CAACJ,QAAQ,CAACb,IAAI,EAAErB,UAAU,CAAC;QAC/B,IAAIgC,eAAe,EAAE;UACnB,IAAI,CAACG,UAAU,CAACd,IAAI,EAAErB,UAAU,CAAC;QACnC;MACF;;MAGA,IAAI,CAACuC,SAAS,CAAClB,IAAI,EAAErB,UAAU,CAAC;;MAGhCqB,IAAI,CAACU,aAAa,GAAGR,YAAY,IAAIM,aAAa;IACpD;IAEA,MAAMW,OAAO,GAAG,IAAIrC,IAAI,EAAE,CAACC,OAAO,EAAE;IACpC,IAAI,IAAI,CAACL,iBAAiB,CAACC,UAAU,CAAC,IAAIwC,OAAO,GAAG,IAAI,CAACC,UAAU,GAAG,IAAI,CAACC,kBAAkB,EAAE;MAC7F,IAAI,CAACD,UAAU,GAAGD,OAAO;MACzB,IAAI,CAACtC,OAAO,CAACP,cAAc,CAACK,UAAU,CAAC;IACzC;EACF;EAEAyB,gBAAgB,CAACJ,IAAI,EAAErB,UAAU,EAAE;IACjC,MAAM2C,QAAQ,GAAGtB,IAAI,CAACsB,QAAQ;IAC9B,KAAK,MAAMC,KAAK,IAAID,QAAQ,EAAE;MAC5B,IAAI,CAAC7B,UAAU,CAAC8B,KAAK,EAAE5C,UAAU,CAAC;IACpC;IACA,OAAO,IAAI;EACb;;EAGA0B,qBAAqB,CAACL,IAAI,EAAErB,UAAU,EAAEiB,KAAK,EAAE4B,KAAK,EAAE;IACpD,MAAM;MAACtD,YAAY;MAAEC;IAAiB,CAAC,GAAG,IAAI,CAACU,OAAO;IAEtD,MAAMyC,QAAQ,GAAGtB,IAAI,CAACsB,QAAQ;;IAG9BA,QAAQ,CAACG,IAAI,CAAC,IAAI,CAACC,uBAAuB,CAACC,IAAI,CAAC,IAAI,CAAC,CAAC;;IAItD,MAAMC,YAAY,GAChB5B,IAAI,CAACe,MAAM,KAAK/C,eAAe,CAACiD,OAAO,IAAIjB,IAAI,CAACM,gBAAgB,IAAI,CAACnC,iBAAiB;IAExF,IAAI0D,eAAe,GAAG,KAAK;IAC3B,IAAIC,OAAO,GAAG,IAAI;IAElB,KAAK,MAAMP,KAAK,IAAID,QAAQ,EAAE;MAC5BC,KAAK,CAAC1B,eAAe,GAAG2B,KAAK;MAC7B,IAAID,KAAK,CAACQ,2BAA2B,EAAE;QACrC,IAAInC,KAAK,CAACoC,IAAI,CAACT,KAAK,CAAC,EAAE;UACrB3B,KAAK,CAACqC,MAAM,CAACV,KAAK,CAAC;QACrB;QACA3B,KAAK,CAACE,IAAI,CAACyB,KAAK,CAAC;QACjBM,eAAe,GAAG,IAAI;MACxB,CAAC,MAAM,IAAID,YAAY,IAAI1D,YAAY,EAAE;QAGvC,IAAI,CAAC2C,QAAQ,CAACU,KAAK,EAAE5C,UAAU,CAAC;QAChC,IAAI,CAACuC,SAAS,CAACK,KAAK,EAAE5C,UAAU,CAAC;MACnC;MAEA,IAAIiD,YAAY,EAAE;QAChB,IAAIM,YAAY;QAChB,IAAI,CAACX,KAAK,CAACY,gBAAgB,EAAE;UAC3BD,YAAY,GAAG,KAAK;QACtB,CAAC,MAAM,IAAI,CAACX,KAAK,CAACjB,gBAAgB,EAAE;UAClC4B,YAAY,GAAG,IAAI,CAACE,qBAAqB,CAACb,KAAK,EAAE5C,UAAU,CAAC;QAC9D,CAAC,MAAM;UACLuD,YAAY,GAAGX,KAAK,CAACc,gBAAgB;QACvC;QACAP,OAAO,GAAGA,OAAO,IAAII,YAAY;QAEjC,IAAI,CAACJ,OAAO,EAAE;UACZ,OAAO,KAAK;QACd;MACF;IACF;IAEA,IAAI,CAACD,eAAe,EAAE;MACpBC,OAAO,GAAG,KAAK;IACjB;IACA,OAAOA,OAAO;EAChB;;EAGArC,UAAU,CAACO,IAAI,EAAErB,UAAU,EAAE;IAC3B,IAAI,CAAC2D,oBAAoB,CAACtC,IAAI,EAAErB,UAAU,CAAC;EAC7C;;EAGAmC,UAAU,CAACd,IAAI,EAAErB,UAAU,EAAE;IAC3B,IAAI,IAAI,CAAC4D,gBAAgB,CAACvC,IAAI,CAAC,EAAE;MAE/BA,IAAI,CAACwC,cAAc,GAAG7D,UAAU,CAACe,WAAW;MAC5C,IAAI,CAACN,aAAa,CAACY,IAAI,CAACY,EAAE,CAAC,GAAGZ,IAAI;IACpC;EACF;;EAGAa,QAAQ,CAACb,IAAI,EAAErB,UAAU,EAAE;IACzB,IAAI,IAAI,CAAC8D,cAAc,CAACzC,IAAI,CAAC,EAAE;MAC7BA,IAAI,CAAC0C,eAAe,GAAG/D,UAAU,CAACe,WAAW;MAC7CM,IAAI,CAAC2C,SAAS,GAAG3C,IAAI,CAAC4C,YAAY,EAAE;MACpC,IAAI,CAACvD,cAAc,CAACW,IAAI,CAACY,EAAE,CAAC,GAAGZ,IAAI;IACrC;EACF;;EAGAkB,SAAS,CAAClB,IAAI,EAAErB,UAAU,EAAE;IAC1BqB,IAAI,CAAC6C,OAAO,CAACC,MAAM,CAACC,KAAK,CAAC/C,IAAI,CAAC;IAC/BA,IAAI,CAACgD,aAAa,GAAGrE,UAAU,CAACe,WAAW;EAC7C;;EAKAS,WAAW,CAACH,IAAI,EAAErB,UAAU,EAAqD;IAAA,IAAnDsE,eAAe,uEAAG,KAAK;IAAA,IAAEC,gBAAgB,uEAAG,KAAK;IAC7E,IAAI,CAAClD,IAAI,CAACmD,WAAW,EAAE;MACrB,OAAO,KAAK;IACd;;IAGA,IAAInD,IAAI,CAACoD,iBAAiB,EAAE;MAG1B,OAAO,CAACpD,IAAI,CAACqD,cAAc;IAC7B;IAEA,IAAI,CAACH,gBAAgB,IAAI,CAAClD,IAAI,CAAC+B,2BAA2B,EAAE;MAC1D,OAAO,KAAK;IACd;IAEA,OAAO,IAAI,CAAC7B,YAAY,CAACF,IAAI,EAAErB,UAAU,EAAEsE,eAAe,CAAC;EAC7D;EAEAR,cAAc,CAACzC,IAAI,EAAE;IAGnB,OAAOA,IAAI,CAACsD,kBAAkB,IAAItD,IAAI,CAACqD,cAAc;EACvD;EAEAd,gBAAgB,CAACvC,IAAI,EAAE;IAGrB,OAAOA,IAAI,CAACqC,gBAAgB,IAAI,CAAC,IAAI,CAACxD,OAAO,CAACV,iBAAiB;EACjE;;EAGA+B,YAAY,CAACF,IAAI,EAAErB,UAAU,EAAEsE,eAAe,EAAE;IAC9C,IAAIM,gBAAgB,GAAGvD,IAAI,CAACwD,iBAAiB;IAC7C,IAAIP,eAAe,EAAE;MACnBM,gBAAgB,GAAGvD,IAAI,CAACyD,mBAAmB,CAAC9E,UAAU,EAAE,IAAI,CAAC;IAC/D;IAEA,OAAO4E,gBAAgB,GAAG,IAAI,CAAC1E,OAAO,CAACT,uBAAuB;EAChE;EAEAkE,oBAAoB,CAACtC,IAAI,EAAErB,UAAU,EAAE;IACrC,MAAM+E,WAAqB,GAAG,EAAE;IAChC,IAAI,IAAI,CAAC7E,OAAO,CAACN,qBAAqB,EAAE;MACtC,KAAK,MAAMoF,GAAG,IAAI,IAAI,CAAC9E,OAAO,CAACN,qBAAqB,EAAE;QACpD,MAAMqF,KAAK,GAAG,IAAI,CAAC/E,OAAO,CAACN,qBAAqB,CAACoF,GAAG,CAAC;QACrD,IAAIC,KAAK,KAAKjF,UAAU,CAACkF,QAAQ,CAACjD,EAAE,EAAE;UACpC8C,WAAW,CAAC5D,IAAI,CAAC6D,GAAG,CAAC;QACvB;MACF;IACF,CAAC,MAAM;MACLD,WAAW,CAAC5D,IAAI,CAACnB,UAAU,CAACkF,QAAQ,CAACjD,EAAE,CAAC;IAC1C;IACAZ,IAAI,CAAC8D,gBAAgB,CAACnF,UAAU,EAAE+E,WAAW,CAAC;EAChD;;EAIAhC,uBAAuB,CAACqC,CAAC,EAAEC,CAAC,EAAE;IAC5B,OAAOD,CAAC,CAACE,iBAAiB,GAAGD,CAAC,CAACC,iBAAiB;EAClD;EAEAC,kBAAkB,CAAClE,IAAI,EAAErB,UAAU,EAAE;IACnC,IAAIwF,UAAU,GAAG,KAAK;IACtB,KAAK,MAAM5C,KAAK,IAAIvB,IAAI,CAACsB,QAAQ,EAAE;MACjCC,KAAK,CAACuC,gBAAgB,CAACnF,UAAU,CAAC;MAClCwF,UAAU,GAAGA,UAAU,IAAI5C,KAAK,CAACQ,2BAA2B;IAC9D;IACA,OAAOoC,UAAU;EACnB;;EAIA/B,qBAAqB,CAACjD,IAAI,EAAER,UAAU,EAAE;IACtC,IAAIyF,oBAAoB,GAAG,IAAI;IAC/B,MAAMxE,KAAK,GAAG,IAAI,CAACX,oBAAoB;IAEvCW,KAAK,CAACE,IAAI,CAACX,IAAI,CAAC;IAEhB,OAAOS,KAAK,CAACG,MAAM,GAAG,CAAC,IAAIqE,oBAAoB,EAAE;MAC/C,MAAMpE,IAAI,GAAGJ,KAAK,CAACK,GAAG,EAAE;MAExB,IAAI,CAACR,UAAU,CAACO,IAAI,EAAErB,UAAU,CAAC;MAEjC,IAAI,CAACqB,IAAI,CAAC+B,2BAA2B,EAAE;QAErC,IAAI,CAAClB,QAAQ,CAACb,IAAI,EAAErB,UAAU,CAAC;MACjC;MAEA,IAAI,CAACuC,SAAS,CAAClB,IAAI,EAAErB,UAAU,CAAC;;MAGhC,MAAMY,QAAQ,GAAG,CAACS,IAAI,CAACM,gBAAgB,IAAI,IAAI,CAACH,WAAW,CAACH,IAAI,EAAErB,UAAU,EAAE,KAAK,EAAE,IAAI,CAAC;MAE1F,IAAIY,QAAQ,EAAE;QACZ,MAAM+B,QAAQ,GAAGtB,IAAI,CAACsB,QAAQ;QAC9B,KAAK,MAAMC,KAAK,IAAID,QAAQ,EAAE;UAE5B,IAAI1B,KAAK,CAACoC,IAAI,CAACT,KAAK,CAAC,EAAE;YACrB3B,KAAK,CAACqC,MAAM,CAACV,KAAK,CAAC;UACrB;UACA3B,KAAK,CAACE,IAAI,CAACyB,KAAK,CAAC;QACnB;MACF,CAAC,MAAM,IAAI,CAACvB,IAAI,CAACqC,gBAAgB,EAAE;QACjC+B,oBAAoB,GAAG,KAAK;MAC9B;IACF;IAEA,OAAOA,oBAAoB;EAC7B;AACF"}
+{"version":3,"file":"tileset-traverser.js","names":["ManagedArray","TILE_REFINEMENT","DEFAULT_PROPS","loadSiblings","skipLevelOfDetail","maximumScreenSpaceError","updateTransforms","onTraversalEnd","viewportTraversersMap","basePath","TilesetTraverser","traversalFinished","frameState","constructor","options","_defineProperty","Date","getTime","_traversalStack","_emptyTraversalStack","_frameNumber","root","selectedTiles","requestedTiles","emptyTiles","traverse","reset","updateTile","frameNumber","executeTraversal","stack","_selectionDepth","push","length","tile","pop","shouldRefine","canTraverse","updateChildTiles","updateAndPushChildren","hasRenderContent","parent","parentRefines","Boolean","_shouldRefine","stoppedRefining","id","loadTile","selectTile","refine","ADD","REPLACE","touchTile","newTime","lastUpdate","updateDebounceTime","children","child","depth","sort","compareDistanceToCamera","bind","checkRefines","hasVisibleChild","refines","isVisibleAndInRequestVolume","find","delete","childRefines","_inRequestVolume","executeEmptyTraversal","contentAvailable","updateTileVisibility","shouldSelectTile","_selectedFrame","shouldLoadTile","_requestedFrame","_priority","_getPriority","tileset","_cache","touch","_touchedFrame","useParentMetric","arguments","undefined","ignoreVisibility","hasChildren","hasTilesetContent","contentExpired","hasUnloadedContent","screenSpaceError","_screenSpaceError","getScreenSpaceError","viewportIds","key","value","viewport","updateVisibility","b","a","_distanceToCamera","anyChildrenVisible","anyVisible","allDescendantsLoaded"],"sources":["../../../src/tileset/tileset-traverser.ts"],"sourcesContent":["import {ManagedArray} from '../utils/managed-array';\nimport {TILE_REFINEMENT} from '../constants';\nimport {FrameState} from './helpers/frame-state';\n\nexport type TilesetTraverserProps = {\n  loadSiblings?: boolean;\n  skipLevelOfDetail?: boolean;\n  maximumScreenSpaceError?: number;\n  onTraversalEnd?: (frameState) => any;\n  viewportTraversersMap?: {[key: string]: any};\n  basePath?: string;\n  updateTransforms?: boolean;\n};\n\n// export type Props = {\n//   loadSiblings: boolean;\n//   skipLevelOfDetail: boolean;\n//   updateTransforms: boolean;\n//   maximumScreenSpaceError: number;\n//   onTraversalEnd: (frameState) => any;\n//   viewportTraversersMap: {[key: string]: any};\n//   basePath: string;\n// };\n\nexport const DEFAULT_PROPS: Required<TilesetTraverserProps> = {\n  loadSiblings: false,\n  skipLevelOfDetail: false,\n  maximumScreenSpaceError: 2,\n  updateTransforms: true,\n  onTraversalEnd: () => {},\n  viewportTraversersMap: {},\n  basePath: ''\n};\n\nexport class TilesetTraverser {\n  options: Required<TilesetTraverserProps>;\n\n  root: any;\n  requestedTiles: object;\n  selectedTiles: object;\n  emptyTiles: object;\n\n  protected lastUpdate: number = new Date().getTime();\n  protected readonly updateDebounceTime = 1000;\n  protected _traversalStack: ManagedArray;\n  protected _emptyTraversalStack: ManagedArray;\n  protected _frameNumber: number | null;\n\n  protected traversalFinished(frameState: FrameState): boolean {\n    return true;\n  }\n\n  // TODO nested props\n  constructor(options: TilesetTraverserProps) {\n    this.options = {...DEFAULT_PROPS, ...options};\n    // TRAVERSAL\n    // temporary storage to hold the traversed tiles during a traversal\n    this._traversalStack = new ManagedArray();\n    this._emptyTraversalStack = new ManagedArray();\n\n    // set in every traverse cycle\n    this._frameNumber = null;\n\n    // fulfill in traverse call\n    this.root = null;\n\n    // RESULT\n    // tiles should be rendered\n    this.selectedTiles = {};\n    // tiles should be loaded from server\n    this.requestedTiles = {};\n    // tiles does not have render content\n    this.emptyTiles = {};\n  }\n\n  // tiles should be visible\n  traverse(root, frameState, options) {\n    this.root = root; // for root screen space error\n    this.options = {...this.options, ...options};\n\n    // reset result\n    this.reset();\n\n    // update tile (visibility and expiration)\n    this.updateTile(root, frameState);\n\n    this._frameNumber = frameState.frameNumber;\n    this.executeTraversal(root, frameState);\n  }\n\n  reset() {\n    this.requestedTiles = {};\n    this.selectedTiles = {};\n    this.emptyTiles = {};\n    this._traversalStack.reset();\n    this._emptyTraversalStack.reset();\n  }\n\n  // execute traverse\n  // Depth-first traversal that traverses all visible tiles and marks tiles for selection.\n  // If skipLevelOfDetail is off then a tile does not refine until all children are loaded.\n  // This is the traditional replacement refinement approach and is called the base traversal.\n  // Tiles that have a greater screen space error than the base screen space error are part of the base traversal,\n  // all other tiles are part of the skip traversal. The skip traversal allows for skipping levels of the tree\n  // and rendering children and parent tiles simultaneously.\n  /* eslint-disable-next-line complexity, max-statements */\n  executeTraversal(root, frameState: FrameState) {\n    // stack to store traversed tiles, only visible tiles should be added to stack\n    // visible: visible in the current view frustum\n    const stack = this._traversalStack;\n    root._selectionDepth = 1;\n\n    stack.push(root);\n    while (stack.length > 0) {\n      // 1. pop tile\n      const tile = stack.pop();\n\n      // 2. check if tile needs to be refine, needs refine if a tile's LoD is not sufficient and tile has available children (available content)\n      let shouldRefine = false;\n      if (this.canTraverse(tile, frameState)) {\n        this.updateChildTiles(tile, frameState);\n        shouldRefine = this.updateAndPushChildren(\n          tile,\n          frameState,\n          stack,\n          tile.hasRenderContent ? tile._selectionDepth + 1 : tile._selectionDepth\n        );\n      }\n\n      // 3. decide if should render (select) this tile\n      //   - tile does not have render content\n      //   - tile has render content and tile is `add` type (pointcloud)\n      //   - tile has render content and tile is `replace` type (photogrammetry) and can't refine any further\n      const parent = tile.parent;\n      const parentRefines = Boolean(!parent || parent._shouldRefine);\n      const stoppedRefining = !shouldRefine;\n\n      if (!tile.hasRenderContent) {\n        this.emptyTiles[tile.id] = tile;\n        this.loadTile(tile, frameState);\n        if (stoppedRefining) {\n          this.selectTile(tile, frameState);\n        }\n        // additive tiles\n      } else if (tile.refine === TILE_REFINEMENT.ADD) {\n        // Additive tiles are always loaded and selected\n        this.loadTile(tile, frameState);\n        this.selectTile(tile, frameState);\n\n        // replace tiles\n      } else if (tile.refine === TILE_REFINEMENT.REPLACE) {\n        // Always load tiles in the base traversal\n        // Select tiles that can't refine further\n        this.loadTile(tile, frameState);\n        if (stoppedRefining) {\n          this.selectTile(tile, frameState);\n        }\n      }\n\n      // 3. update cache, most recent touched tiles have higher priority to be fetched from server\n      this.touchTile(tile, frameState);\n\n      // 4. update tile refine prop and parent refinement status to trickle down to the descendants\n      tile._shouldRefine = shouldRefine && parentRefines;\n    }\n\n    const newTime = new Date().getTime();\n    if (this.traversalFinished(frameState) || newTime - this.lastUpdate > this.updateDebounceTime) {\n      this.lastUpdate = newTime;\n      this.options.onTraversalEnd(frameState);\n    }\n  }\n\n  updateChildTiles(tile, frameState) {\n    const children = tile.children;\n    for (const child of children) {\n      this.updateTile(child, frameState);\n    }\n    return true;\n  }\n\n  /* eslint-disable complexity, max-statements */\n  updateAndPushChildren(tile, frameState, stack, depth) {\n    const {loadSiblings, skipLevelOfDetail} = this.options;\n\n    const children = tile.children;\n\n    // sort children tiles\n    children.sort(this.compareDistanceToCamera.bind(this));\n\n    // For traditional replacement refinement only refine if all children are loaded.\n    // Empty tiles are exempt since it looks better if children stream in as they are loaded to fill the empty space.\n    const checkRefines =\n      tile.refine === TILE_REFINEMENT.REPLACE && tile.hasRenderContent && !skipLevelOfDetail;\n\n    let hasVisibleChild = false;\n    let refines = true;\n\n    for (const child of children) {\n      child._selectionDepth = depth;\n      if (child.isVisibleAndInRequestVolume) {\n        if (stack.find(child)) {\n          stack.delete(child);\n        }\n        stack.push(child);\n        hasVisibleChild = true;\n      } else if (checkRefines || loadSiblings) {\n        // Keep non-visible children loaded since they are still needed before the parent can refine.\n        // Or loadSiblings is true so always load tiles regardless of visibility.\n        this.loadTile(child, frameState);\n        this.touchTile(child, frameState);\n      }\n\n      if (checkRefines) {\n        let childRefines;\n        if (!child._inRequestVolume) {\n          childRefines = false;\n        } else if (!child.hasRenderContent) {\n          childRefines = this.executeEmptyTraversal(child, frameState);\n        } else {\n          childRefines = child.contentAvailable;\n        }\n        refines = refines && childRefines;\n\n        if (!refines) {\n          return false;\n        }\n      }\n    }\n\n    if (!hasVisibleChild) {\n      refines = false;\n    }\n    return refines;\n  }\n  /* eslint-enable complexity, max-statements */\n\n  updateTile(tile, frameState) {\n    this.updateTileVisibility(tile, frameState);\n  }\n\n  // tile to render in the browser\n  selectTile(tile, frameState) {\n    if (this.shouldSelectTile(tile)) {\n      // The tile can be selected right away and does not require traverseAndSelect\n      tile._selectedFrame = frameState.frameNumber;\n      this.selectedTiles[tile.id] = tile;\n    }\n  }\n\n  // tile to load from server\n  loadTile(tile, frameState) {\n    if (this.shouldLoadTile(tile)) {\n      tile._requestedFrame = frameState.frameNumber;\n      tile._priority = tile._getPriority();\n      this.requestedTiles[tile.id] = tile;\n    }\n  }\n\n  // cache tile\n  touchTile(tile, frameState) {\n    tile.tileset._cache.touch(tile);\n    tile._touchedFrame = frameState.frameNumber;\n  }\n\n  // tile should be visible\n  // tile should have children\n  // tile LoD (level of detail) is not sufficient under current viewport\n  canTraverse(tile, frameState, useParentMetric = false, ignoreVisibility = false) {\n    if (!tile.hasChildren) {\n      return false;\n    }\n\n    // cesium specific\n    if (tile.hasTilesetContent) {\n      // Traverse external this to visit its root tile\n      // Don't traverse if the subtree is expired because it will be destroyed\n      return !tile.contentExpired;\n    }\n\n    if (!ignoreVisibility && !tile.isVisibleAndInRequestVolume) {\n      return false;\n    }\n\n    return this.shouldRefine(tile, frameState, useParentMetric);\n  }\n\n  shouldLoadTile(tile) {\n    // if request tile is in current frame\n    // and has unexpired render content\n    return tile.hasUnloadedContent || tile.contentExpired;\n  }\n\n  shouldSelectTile(tile) {\n    // if select tile is in current frame\n    // and content available\n    return tile.contentAvailable && !this.options.skipLevelOfDetail;\n  }\n\n  // Decide if tile LoD (level of detail) is not sufficient under current viewport\n  shouldRefine(tile, frameState, useParentMetric) {\n    let screenSpaceError = tile._screenSpaceError;\n    if (useParentMetric) {\n      screenSpaceError = tile.getScreenSpaceError(frameState, true);\n    }\n\n    return screenSpaceError > this.options.maximumScreenSpaceError;\n  }\n\n  updateTileVisibility(tile, frameState) {\n    const viewportIds: string[] = [];\n    if (this.options.viewportTraversersMap) {\n      for (const key in this.options.viewportTraversersMap) {\n        const value = this.options.viewportTraversersMap[key];\n        if (value === frameState.viewport.id) {\n          viewportIds.push(key);\n        }\n      }\n    } else {\n      viewportIds.push(frameState.viewport.id);\n    }\n    tile.updateVisibility(frameState, viewportIds);\n  }\n\n  // UTILITIES\n\n  compareDistanceToCamera(b, a) {\n    return b._distanceToCamera - a._distanceToCamera;\n  }\n\n  anyChildrenVisible(tile, frameState) {\n    let anyVisible = false;\n    for (const child of tile.children) {\n      child.updateVisibility(frameState);\n      anyVisible = anyVisible || child.isVisibleAndInRequestVolume;\n    }\n    return anyVisible;\n  }\n\n  // Depth-first traversal that checks if all nearest descendants with content are loaded.\n  // Ignores visibility.\n  executeEmptyTraversal(root, frameState) {\n    let allDescendantsLoaded = true;\n    const stack = this._emptyTraversalStack;\n\n    stack.push(root);\n\n    while (stack.length > 0 && allDescendantsLoaded) {\n      const tile = stack.pop();\n\n      this.updateTile(tile, frameState);\n\n      if (!tile.isVisibleAndInRequestVolume) {\n        // Load tiles that aren't visible since they are still needed for the parent to refine\n        this.loadTile(tile, frameState);\n      }\n\n      this.touchTile(tile, frameState);\n\n      // Only traverse if the tile is empty - traversal stop at descendants with content\n      const traverse = !tile.hasRenderContent && this.canTraverse(tile, frameState, false, true);\n\n      if (traverse) {\n        const children = tile.children;\n        for (const child of children) {\n          // eslint-disable-next-line max-depth\n          if (stack.find(child)) {\n            stack.delete(child);\n          }\n          stack.push(child);\n        }\n      } else if (!tile.contentAvailable) {\n        allDescendantsLoaded = false;\n      }\n    }\n\n    return allDescendantsLoaded;\n  }\n}\n\n// TODO\n// enable expiration\n// enable optimization hint\n"],"mappings":";AAAA,SAAQA,YAAY,QAAO,wBAAwB;AACnD,SAAQC,eAAe,QAAO,cAAc;AAuB5C,OAAO,MAAMC,aAA8C,GAAG;EAC5DC,YAAY,EAAE,KAAK;EACnBC,iBAAiB,EAAE,KAAK;EACxBC,uBAAuB,EAAE,CAAC;EAC1BC,gBAAgB,EAAE,IAAI;EACtBC,cAAc,EAAEA,CAAA,KAAM,CAAC,CAAC;EACxBC,qBAAqB,EAAE,CAAC,CAAC;EACzBC,QAAQ,EAAE;AACZ,CAAC;AAED,OAAO,MAAMC,gBAAgB,CAAC;EAclBC,iBAAiBA,CAACC,UAAsB,EAAW;IAC3D,OAAO,IAAI;EACb;EAGAC,WAAWA,CAACC,OAA8B,EAAE;IAAAC,eAAA;IAAAA,eAAA;IAAAA,eAAA;IAAAA,eAAA;IAAAA,eAAA;IAAAA,eAAA,qBAXb,IAAIC,IAAI,CAAC,CAAC,CAACC,OAAO,CAAC,CAAC;IAAAF,eAAA,6BACX,IAAI;IAAAA,eAAA;IAAAA,eAAA;IAAAA,eAAA;IAW1C,IAAI,CAACD,OAAO,GAAG;MAAC,GAAGZ,aAAa;MAAE,GAAGY;IAAO,CAAC;IAG7C,IAAI,CAACI,eAAe,GAAG,IAAIlB,YAAY,CAAC,CAAC;IACzC,IAAI,CAACmB,oBAAoB,GAAG,IAAInB,YAAY,CAAC,CAAC;IAG9C,IAAI,CAACoB,YAAY,GAAG,IAAI;IAGxB,IAAI,CAACC,IAAI,GAAG,IAAI;IAIhB,IAAI,CAACC,aAAa,GAAG,CAAC,CAAC;IAEvB,IAAI,CAACC,cAAc,GAAG,CAAC,CAAC;IAExB,IAAI,CAACC,UAAU,GAAG,CAAC,CAAC;EACtB;EAGAC,QAAQA,CAACJ,IAAI,EAAET,UAAU,EAAEE,OAAO,EAAE;IAClC,IAAI,CAACO,IAAI,GAAGA,IAAI;IAChB,IAAI,CAACP,OAAO,GAAG;MAAC,GAAG,IAAI,CAACA,OAAO;MAAE,GAAGA;IAAO,CAAC;IAG5C,IAAI,CAACY,KAAK,CAAC,CAAC;IAGZ,IAAI,CAACC,UAAU,CAACN,IAAI,EAAET,UAAU,CAAC;IAEjC,IAAI,CAACQ,YAAY,GAAGR,UAAU,CAACgB,WAAW;IAC1C,IAAI,CAACC,gBAAgB,CAACR,IAAI,EAAET,UAAU,CAAC;EACzC;EAEAc,KAAKA,CAAA,EAAG;IACN,IAAI,CAACH,cAAc,GAAG,CAAC,CAAC;IACxB,IAAI,CAACD,aAAa,GAAG,CAAC,CAAC;IACvB,IAAI,CAACE,UAAU,GAAG,CAAC,CAAC;IACpB,IAAI,CAACN,eAAe,CAACQ,KAAK,CAAC,CAAC;IAC5B,IAAI,CAACP,oBAAoB,CAACO,KAAK,CAAC,CAAC;EACnC;EAUAG,gBAAgBA,CAACR,IAAI,EAAET,UAAsB,EAAE;IAG7C,MAAMkB,KAAK,GAAG,IAAI,CAACZ,eAAe;IAClCG,IAAI,CAACU,eAAe,GAAG,CAAC;IAExBD,KAAK,CAACE,IAAI,CAACX,IAAI,CAAC;IAChB,OAAOS,KAAK,CAACG,MAAM,GAAG,CAAC,EAAE;MAEvB,MAAMC,IAAI,GAAGJ,KAAK,CAACK,GAAG,CAAC,CAAC;MAGxB,IAAIC,YAAY,GAAG,KAAK;MACxB,IAAI,IAAI,CAACC,WAAW,CAACH,IAAI,EAAEtB,UAAU,CAAC,EAAE;QACtC,IAAI,CAAC0B,gBAAgB,CAACJ,IAAI,EAAEtB,UAAU,CAAC;QACvCwB,YAAY,GAAG,IAAI,CAACG,qBAAqB,CACvCL,IAAI,EACJtB,UAAU,EACVkB,KAAK,EACLI,IAAI,CAACM,gBAAgB,GAAGN,IAAI,CAACH,eAAe,GAAG,CAAC,GAAGG,IAAI,CAACH,eAC1D,CAAC;MACH;MAMA,MAAMU,MAAM,GAAGP,IAAI,CAACO,MAAM;MAC1B,MAAMC,aAAa,GAAGC,OAAO,CAAC,CAACF,MAAM,IAAIA,MAAM,CAACG,aAAa,CAAC;MAC9D,MAAMC,eAAe,GAAG,CAACT,YAAY;MAErC,IAAI,CAACF,IAAI,CAACM,gBAAgB,EAAE;QAC1B,IAAI,CAAChB,UAAU,CAACU,IAAI,CAACY,EAAE,CAAC,GAAGZ,IAAI;QAC/B,IAAI,CAACa,QAAQ,CAACb,IAAI,EAAEtB,UAAU,CAAC;QAC/B,IAAIiC,eAAe,EAAE;UACnB,IAAI,CAACG,UAAU,CAACd,IAAI,EAAEtB,UAAU,CAAC;QACnC;MAEF,CAAC,MAAM,IAAIsB,IAAI,CAACe,MAAM,KAAKhD,eAAe,CAACiD,GAAG,EAAE;QAE9C,IAAI,CAACH,QAAQ,CAACb,IAAI,EAAEtB,UAAU,CAAC;QAC/B,IAAI,CAACoC,UAAU,CAACd,IAAI,EAAEtB,UAAU,CAAC;MAGnC,CAAC,MAAM,IAAIsB,IAAI,CAACe,MAAM,KAAKhD,eAAe,CAACkD,OAAO,EAAE;QAGlD,IAAI,CAACJ,QAAQ,CAACb,IAAI,EAAEtB,UAAU,CAAC;QAC/B,IAAIiC,eAAe,EAAE;UACnB,IAAI,CAACG,UAAU,CAACd,IAAI,EAAEtB,UAAU,CAAC;QACnC;MACF;MAGA,IAAI,CAACwC,SAAS,CAAClB,IAAI,EAAEtB,UAAU,CAAC;MAGhCsB,IAAI,CAACU,aAAa,GAAGR,YAAY,IAAIM,aAAa;IACpD;IAEA,MAAMW,OAAO,GAAG,IAAIrC,IAAI,CAAC,CAAC,CAACC,OAAO,CAAC,CAAC;IACpC,IAAI,IAAI,CAACN,iBAAiB,CAACC,UAAU,CAAC,IAAIyC,OAAO,GAAG,IAAI,CAACC,UAAU,GAAG,IAAI,CAACC,kBAAkB,EAAE;MAC7F,IAAI,CAACD,UAAU,GAAGD,OAAO;MACzB,IAAI,CAACvC,OAAO,CAACP,cAAc,CAACK,UAAU,CAAC;IACzC;EACF;EAEA0B,gBAAgBA,CAACJ,IAAI,EAAEtB,UAAU,EAAE;IACjC,MAAM4C,QAAQ,GAAGtB,IAAI,CAACsB,QAAQ;IAC9B,KAAK,MAAMC,KAAK,IAAID,QAAQ,EAAE;MAC5B,IAAI,CAAC7B,UAAU,CAAC8B,KAAK,EAAE7C,UAAU,CAAC;IACpC;IACA,OAAO,IAAI;EACb;EAGA2B,qBAAqBA,CAACL,IAAI,EAAEtB,UAAU,EAAEkB,KAAK,EAAE4B,KAAK,EAAE;IACpD,MAAM;MAACvD,YAAY;MAAEC;IAAiB,CAAC,GAAG,IAAI,CAACU,OAAO;IAEtD,MAAM0C,QAAQ,GAAGtB,IAAI,CAACsB,QAAQ;IAG9BA,QAAQ,CAACG,IAAI,CAAC,IAAI,CAACC,uBAAuB,CAACC,IAAI,CAAC,IAAI,CAAC,CAAC;IAItD,MAAMC,YAAY,GAChB5B,IAAI,CAACe,MAAM,KAAKhD,eAAe,CAACkD,OAAO,IAAIjB,IAAI,CAACM,gBAAgB,IAAI,CAACpC,iBAAiB;IAExF,IAAI2D,eAAe,GAAG,KAAK;IAC3B,IAAIC,OAAO,GAAG,IAAI;IAElB,KAAK,MAAMP,KAAK,IAAID,QAAQ,EAAE;MAC5BC,KAAK,CAAC1B,eAAe,GAAG2B,KAAK;MAC7B,IAAID,KAAK,CAACQ,2BAA2B,EAAE;QACrC,IAAInC,KAAK,CAACoC,IAAI,CAACT,KAAK,CAAC,EAAE;UACrB3B,KAAK,CAACqC,MAAM,CAACV,KAAK,CAAC;QACrB;QACA3B,KAAK,CAACE,IAAI,CAACyB,KAAK,CAAC;QACjBM,eAAe,GAAG,IAAI;MACxB,CAAC,MAAM,IAAID,YAAY,IAAI3D,YAAY,EAAE;QAGvC,IAAI,CAAC4C,QAAQ,CAACU,KAAK,EAAE7C,UAAU,CAAC;QAChC,IAAI,CAACwC,SAAS,CAACK,KAAK,EAAE7C,UAAU,CAAC;MACnC;MAEA,IAAIkD,YAAY,EAAE;QAChB,IAAIM,YAAY;QAChB,IAAI,CAACX,KAAK,CAACY,gBAAgB,EAAE;UAC3BD,YAAY,GAAG,KAAK;QACtB,CAAC,MAAM,IAAI,CAACX,KAAK,CAACjB,gBAAgB,EAAE;UAClC4B,YAAY,GAAG,IAAI,CAACE,qBAAqB,CAACb,KAAK,EAAE7C,UAAU,CAAC;QAC9D,CAAC,MAAM;UACLwD,YAAY,GAAGX,KAAK,CAACc,gBAAgB;QACvC;QACAP,OAAO,GAAGA,OAAO,IAAII,YAAY;QAEjC,IAAI,CAACJ,OAAO,EAAE;UACZ,OAAO,KAAK;QACd;MACF;IACF;IAEA,IAAI,CAACD,eAAe,EAAE;MACpBC,OAAO,GAAG,KAAK;IACjB;IACA,OAAOA,OAAO;EAChB;EAGArC,UAAUA,CAACO,IAAI,EAAEtB,UAAU,EAAE;IAC3B,IAAI,CAAC4D,oBAAoB,CAACtC,IAAI,EAAEtB,UAAU,CAAC;EAC7C;EAGAoC,UAAUA,CAACd,IAAI,EAAEtB,UAAU,EAAE;IAC3B,IAAI,IAAI,CAAC6D,gBAAgB,CAACvC,IAAI,CAAC,EAAE;MAE/BA,IAAI,CAACwC,cAAc,GAAG9D,UAAU,CAACgB,WAAW;MAC5C,IAAI,CAACN,aAAa,CAACY,IAAI,CAACY,EAAE,CAAC,GAAGZ,IAAI;IACpC;EACF;EAGAa,QAAQA,CAACb,IAAI,EAAEtB,UAAU,EAAE;IACzB,IAAI,IAAI,CAAC+D,cAAc,CAACzC,IAAI,CAAC,EAAE;MAC7BA,IAAI,CAAC0C,eAAe,GAAGhE,UAAU,CAACgB,WAAW;MAC7CM,IAAI,CAAC2C,SAAS,GAAG3C,IAAI,CAAC4C,YAAY,CAAC,CAAC;MACpC,IAAI,CAACvD,cAAc,CAACW,IAAI,CAACY,EAAE,CAAC,GAAGZ,IAAI;IACrC;EACF;EAGAkB,SAASA,CAAClB,IAAI,EAAEtB,UAAU,EAAE;IAC1BsB,IAAI,CAAC6C,OAAO,CAACC,MAAM,CAACC,KAAK,CAAC/C,IAAI,CAAC;IAC/BA,IAAI,CAACgD,aAAa,GAAGtE,UAAU,CAACgB,WAAW;EAC7C;EAKAS,WAAWA,CAACH,IAAI,EAAEtB,UAAU,EAAqD;IAAA,IAAnDuE,eAAe,GAAAC,SAAA,CAAAnD,MAAA,QAAAmD,SAAA,QAAAC,SAAA,GAAAD,SAAA,MAAG,KAAK;IAAA,IAAEE,gBAAgB,GAAAF,SAAA,CAAAnD,MAAA,QAAAmD,SAAA,QAAAC,SAAA,GAAAD,SAAA,MAAG,KAAK;IAC7E,IAAI,CAAClD,IAAI,CAACqD,WAAW,EAAE;MACrB,OAAO,KAAK;IACd;IAGA,IAAIrD,IAAI,CAACsD,iBAAiB,EAAE;MAG1B,OAAO,CAACtD,IAAI,CAACuD,cAAc;IAC7B;IAEA,IAAI,CAACH,gBAAgB,IAAI,CAACpD,IAAI,CAAC+B,2BAA2B,EAAE;MAC1D,OAAO,KAAK;IACd;IAEA,OAAO,IAAI,CAAC7B,YAAY,CAACF,IAAI,EAAEtB,UAAU,EAAEuE,eAAe,CAAC;EAC7D;EAEAR,cAAcA,CAACzC,IAAI,EAAE;IAGnB,OAAOA,IAAI,CAACwD,kBAAkB,IAAIxD,IAAI,CAACuD,cAAc;EACvD;EAEAhB,gBAAgBA,CAACvC,IAAI,EAAE;IAGrB,OAAOA,IAAI,CAACqC,gBAAgB,IAAI,CAAC,IAAI,CAACzD,OAAO,CAACV,iBAAiB;EACjE;EAGAgC,YAAYA,CAACF,IAAI,EAAEtB,UAAU,EAAEuE,eAAe,EAAE;IAC9C,IAAIQ,gBAAgB,GAAGzD,IAAI,CAAC0D,iBAAiB;IAC7C,IAAIT,eAAe,EAAE;MACnBQ,gBAAgB,GAAGzD,IAAI,CAAC2D,mBAAmB,CAACjF,UAAU,EAAE,IAAI,CAAC;IAC/D;IAEA,OAAO+E,gBAAgB,GAAG,IAAI,CAAC7E,OAAO,CAACT,uBAAuB;EAChE;EAEAmE,oBAAoBA,CAACtC,IAAI,EAAEtB,UAAU,EAAE;IACrC,MAAMkF,WAAqB,GAAG,EAAE;IAChC,IAAI,IAAI,CAAChF,OAAO,CAACN,qBAAqB,EAAE;MACtC,KAAK,MAAMuF,GAAG,IAAI,IAAI,CAACjF,OAAO,CAACN,qBAAqB,EAAE;QACpD,MAAMwF,KAAK,GAAG,IAAI,CAAClF,OAAO,CAACN,qBAAqB,CAACuF,GAAG,CAAC;QACrD,IAAIC,KAAK,KAAKpF,UAAU,CAACqF,QAAQ,CAACnD,EAAE,EAAE;UACpCgD,WAAW,CAAC9D,IAAI,CAAC+D,GAAG,CAAC;QACvB;MACF;IACF,CAAC,MAAM;MACLD,WAAW,CAAC9D,IAAI,CAACpB,UAAU,CAACqF,QAAQ,CAACnD,EAAE,CAAC;IAC1C;IACAZ,IAAI,CAACgE,gBAAgB,CAACtF,UAAU,EAAEkF,WAAW,CAAC;EAChD;EAIAlC,uBAAuBA,CAACuC,CAAC,EAAEC,CAAC,EAAE;IAC5B,OAAOD,CAAC,CAACE,iBAAiB,GAAGD,CAAC,CAACC,iBAAiB;EAClD;EAEAC,kBAAkBA,CAACpE,IAAI,EAAEtB,UAAU,EAAE;IACnC,IAAI2F,UAAU,GAAG,KAAK;IACtB,KAAK,MAAM9C,KAAK,IAAIvB,IAAI,CAACsB,QAAQ,EAAE;MACjCC,KAAK,CAACyC,gBAAgB,CAACtF,UAAU,CAAC;MAClC2F,UAAU,GAAGA,UAAU,IAAI9C,KAAK,CAACQ,2BAA2B;IAC9D;IACA,OAAOsC,UAAU;EACnB;EAIAjC,qBAAqBA,CAACjD,IAAI,EAAET,UAAU,EAAE;IACtC,IAAI4F,oBAAoB,GAAG,IAAI;IAC/B,MAAM1E,KAAK,GAAG,IAAI,CAACX,oBAAoB;IAEvCW,KAAK,CAACE,IAAI,CAACX,IAAI,CAAC;IAEhB,OAAOS,KAAK,CAACG,MAAM,GAAG,CAAC,IAAIuE,oBAAoB,EAAE;MAC/C,MAAMtE,IAAI,GAAGJ,KAAK,CAACK,GAAG,CAAC,CAAC;MAExB,IAAI,CAACR,UAAU,CAACO,IAAI,EAAEtB,UAAU,CAAC;MAEjC,IAAI,CAACsB,IAAI,CAAC+B,2BAA2B,EAAE;QAErC,IAAI,CAAClB,QAAQ,CAACb,IAAI,EAAEtB,UAAU,CAAC;MACjC;MAEA,IAAI,CAACwC,SAAS,CAAClB,IAAI,EAAEtB,UAAU,CAAC;MAGhC,MAAMa,QAAQ,GAAG,CAACS,IAAI,CAACM,gBAAgB,IAAI,IAAI,CAACH,WAAW,CAACH,IAAI,EAAEtB,UAAU,EAAE,KAAK,EAAE,IAAI,CAAC;MAE1F,IAAIa,QAAQ,EAAE;QACZ,MAAM+B,QAAQ,GAAGtB,IAAI,CAACsB,QAAQ;QAC9B,KAAK,MAAMC,KAAK,IAAID,QAAQ,EAAE;UAE5B,IAAI1B,KAAK,CAACoC,IAAI,CAACT,KAAK,CAAC,EAAE;YACrB3B,KAAK,CAACqC,MAAM,CAACV,KAAK,CAAC;UACrB;UACA3B,KAAK,CAACE,IAAI,CAACyB,KAAK,CAAC;QACnB;MACF,CAAC,MAAM,IAAI,CAACvB,IAAI,CAACqC,gBAAgB,EAAE;QACjCiC,oBAAoB,GAAG,KAAK;MAC9B;IACF;IAEA,OAAOA,oBAAoB;EAC7B;AACF"}

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

@@ -1,5 +1,4 @@
 import _defineProperty from "@babel/runtime/helpers/esm/defineProperty";
-
 export class DoublyLinkedListNode {
   constructor(item, previous, next) {
     _defineProperty(this, "item", void 0);

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

@@ -1 +1 @@
-{"version":3,"file":"doubly-linked-list-node.js","names":["DoublyLinkedListNode","constructor","item","previous","next"],"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":";;AASA,OAAO,MAAMA,oBAAoB,CAAC;EAKhCC,WAAW,CAACC,IAAI,EAAEC,QAAQ,EAAEC,IAAI,EAAE;IAAA;IAAA;IAAA;IAChC,IAAI,CAACF,IAAI,GAAGA,IAAI;IAChB,IAAI,CAACC,QAAQ,GAAGA,QAAQ;IACxB,IAAI,CAACC,IAAI,GAAGA,IAAI;EAClB;AACF"}
+{"version":3,"file":"doubly-linked-list-node.js","names":["DoublyLinkedListNode","constructor","item","previous","next","_defineProperty"],"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":";AASA,OAAO,MAAMA,oBAAoB,CAAC;EAKhCC,WAAWA,CAACC,IAAI,EAAEC,QAAQ,EAAEC,IAAI,EAAE;IAAAC,eAAA;IAAAA,eAAA;IAAAA,eAAA;IAChC,IAAI,CAACH,IAAI,GAAGA,IAAI;IAChB,IAAI,CAACC,QAAQ,GAAGA,QAAQ;IACxB,IAAI,CAACC,IAAI,GAAGA,IAAI;EAClB;AACF"}

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

@@ -1,7 +1,5 @@
 import _defineProperty from "@babel/runtime/helpers/esm/defineProperty";
-
 import { DoublyLinkedListNode } from './doubly-linked-list-node';
-
 export class DoublyLinkedList {
   constructor() {
     _defineProperty(this, "head", null);
@@ -11,7 +9,6 @@ export class DoublyLinkedList {
   get length() {
     return this._length;
   }
-
   add(item) {
     const node = new DoublyLinkedListNode(item, this.tail, null);
     if (this.tail) {
@@ -24,7 +21,6 @@ export class DoublyLinkedList {
     ++this._length;
     return node;
   }
-
   remove(node) {
     if (!node) {
       return;
@@ -46,19 +42,16 @@ export class DoublyLinkedList {
     node.previous = null;
     --this._length;
   }
-
   splice(node, nextNode) {
     if (node === nextNode) {
       return;
     }
-
     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 {

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

@@ -1 +1 @@
-{"version":3,"file":"doubly-linked-list.js","names":["DoublyLinkedListNode","DoublyLinkedList","length","_length","add","item","node","tail","next","head","remove","previous","splice","nextNode","_insert","oldNodeNext"],"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,SAAQA,oBAAoB,QAAO,2BAA2B;;AAM9D,OAAO,MAAMC,gBAAgB,CAAC;EAAA;IAAA,8BACQ,IAAI;IAAA,8BACJ,IAAI;IAAA,iCAC9B,CAAC;EAAA;EAEX,IAAIC,MAAM,GAAG;IACX,OAAO,IAAI,CAACC,OAAO;EACrB;;EAOAC,GAAG,CAACC,IAAI,EAAE;IACR,MAAMC,IAAI,GAAG,IAAIN,oBAAoB,CAACK,IAAI,EAAE,IAAI,CAACE,IAAI,EAAE,IAAI,CAAC;IAE5D,IAAI,IAAI,CAACA,IAAI,EAAE;MACb,IAAI,CAACA,IAAI,CAACC,IAAI,GAAGF,IAAI;MACrB,IAAI,CAACC,IAAI,GAAGD,IAAI;IAClB,CAAC,MAAM;MACL,IAAI,CAACG,IAAI,GAAGH,IAAI;MAChB,IAAI,CAACC,IAAI,GAAGD,IAAI;IAClB;IAEA,EAAE,IAAI,CAACH,OAAO;IAEd,OAAOG,IAAI;EACb;;EAMAI,MAAM,CAACJ,IAAI,EAAE;IACX,IAAI,CAACA,IAAI,EAAE;MACT;IACF;IAEA,IAAIA,IAAI,CAACK,QAAQ,IAAIL,IAAI,CAACE,IAAI,EAAE;MAC9BF,IAAI,CAACK,QAAQ,CAACH,IAAI,GAAGF,IAAI,CAACE,IAAI;MAC9BF,IAAI,CAACE,IAAI,CAACG,QAAQ,GAAGL,IAAI,CAACK,QAAQ;IACpC,CAAC,MAAM,IAAIL,IAAI,CAACK,QAAQ,EAAE;MAExBL,IAAI,CAACK,QAAQ,CAACH,IAAI,GAAG,IAAI;MACzB,IAAI,CAACD,IAAI,GAAGD,IAAI,CAACK,QAAQ;IAC3B,CAAC,MAAM,IAAIL,IAAI,CAACE,IAAI,EAAE;MAEpBF,IAAI,CAACE,IAAI,CAACG,QAAQ,GAAG,IAAI;MACzB,IAAI,CAACF,IAAI,GAAGH,IAAI,CAACE,IAAI;IACvB,CAAC,MAAM;MAEL,IAAI,CAACC,IAAI,GAAG,IAAI;MAChB,IAAI,CAACF,IAAI,GAAG,IAAI;IAClB;IAEAD,IAAI,CAACE,IAAI,GAAG,IAAI;IAChBF,IAAI,CAACK,QAAQ,GAAG,IAAI;IAEpB,EAAE,IAAI,CAACR,OAAO;EAChB;;EAOAS,MAAM,CAACN,IAAI,EAAEO,QAAQ,EAAE;IACrB,IAAIP,IAAI,KAAKO,QAAQ,EAAE;MACrB;IACF;;IAGA,IAAI,CAACH,MAAM,CAACG,QAAQ,CAAC;IACrB,IAAI,CAACC,OAAO,CAACR,IAAI,EAAEO,QAAQ,CAAC;EAC9B;EAEAC,OAAO,CAACR,IAAI,EAAEO,QAAQ,EAAE;IACtB,MAAME,WAAW,GAAGT,IAAI,CAACE,IAAI;IAC7BF,IAAI,CAACE,IAAI,GAAGK,QAAQ;;IAGpB,IAAI,IAAI,CAACN,IAAI,KAAKD,IAAI,EAAE;MACtB,IAAI,CAACC,IAAI,GAAGM,QAAQ;IACtB,CAAC,MAAM;MACLE,WAAW,CAACJ,QAAQ,GAAGE,QAAQ;IACjC;IAEAA,QAAQ,CAACL,IAAI,GAAGO,WAAW;IAC3BF,QAAQ,CAACF,QAAQ,GAAGL,IAAI;IAExB,EAAE,IAAI,CAACH,OAAO;EAChB;AACF"}
+{"version":3,"file":"doubly-linked-list.js","names":["DoublyLinkedListNode","DoublyLinkedList","constructor","_defineProperty","length","_length","add","item","node","tail","next","head","remove","previous","splice","nextNode","_insert","oldNodeNext"],"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,SAAQA,oBAAoB,QAAO,2BAA2B;AAM9D,OAAO,MAAMC,gBAAgB,CAAC;EAAAC,YAAA;IAAAC,eAAA,eACQ,IAAI;IAAAA,eAAA,eACJ,IAAI;IAAAA,eAAA,kBAC9B,CAAC;EAAA;EAEX,IAAIC,MAAMA,CAAA,EAAG;IACX,OAAO,IAAI,CAACC,OAAO;EACrB;EAOAC,GAAGA,CAACC,IAAI,EAAE;IACR,MAAMC,IAAI,GAAG,IAAIR,oBAAoB,CAACO,IAAI,EAAE,IAAI,CAACE,IAAI,EAAE,IAAI,CAAC;IAE5D,IAAI,IAAI,CAACA,IAAI,EAAE;MACb,IAAI,CAACA,IAAI,CAACC,IAAI,GAAGF,IAAI;MACrB,IAAI,CAACC,IAAI,GAAGD,IAAI;IAClB,CAAC,MAAM;MACL,IAAI,CAACG,IAAI,GAAGH,IAAI;MAChB,IAAI,CAACC,IAAI,GAAGD,IAAI;IAClB;IAEA,EAAE,IAAI,CAACH,OAAO;IAEd,OAAOG,IAAI;EACb;EAMAI,MAAMA,CAACJ,IAAI,EAAE;IACX,IAAI,CAACA,IAAI,EAAE;MACT;IACF;IAEA,IAAIA,IAAI,CAACK,QAAQ,IAAIL,IAAI,CAACE,IAAI,EAAE;MAC9BF,IAAI,CAACK,QAAQ,CAACH,IAAI,GAAGF,IAAI,CAACE,IAAI;MAC9BF,IAAI,CAACE,IAAI,CAACG,QAAQ,GAAGL,IAAI,CAACK,QAAQ;IACpC,CAAC,MAAM,IAAIL,IAAI,CAACK,QAAQ,EAAE;MAExBL,IAAI,CAACK,QAAQ,CAACH,IAAI,GAAG,IAAI;MACzB,IAAI,CAACD,IAAI,GAAGD,IAAI,CAACK,QAAQ;IAC3B,CAAC,MAAM,IAAIL,IAAI,CAACE,IAAI,EAAE;MAEpBF,IAAI,CAACE,IAAI,CAACG,QAAQ,GAAG,IAAI;MACzB,IAAI,CAACF,IAAI,GAAGH,IAAI,CAACE,IAAI;IACvB,CAAC,MAAM;MAEL,IAAI,CAACC,IAAI,GAAG,IAAI;MAChB,IAAI,CAACF,IAAI,GAAG,IAAI;IAClB;IAEAD,IAAI,CAACE,IAAI,GAAG,IAAI;IAChBF,IAAI,CAACK,QAAQ,GAAG,IAAI;IAEpB,EAAE,IAAI,CAACR,OAAO;EAChB;EAOAS,MAAMA,CAACN,IAAI,EAAEO,QAAQ,EAAE;IACrB,IAAIP,IAAI,KAAKO,QAAQ,EAAE;MACrB;IACF;IAGA,IAAI,CAACH,MAAM,CAACG,QAAQ,CAAC;IACrB,IAAI,CAACC,OAAO,CAACR,IAAI,EAAEO,QAAQ,CAAC;EAC9B;EAEAC,OAAOA,CAACR,IAAI,EAAEO,QAAQ,EAAE;IACtB,MAAME,WAAW,GAAGT,IAAI,CAACE,IAAI;IAC7BF,IAAI,CAACE,IAAI,GAAGK,QAAQ;IAGpB,IAAI,IAAI,CAACN,IAAI,KAAKD,IAAI,EAAE;MACtB,IAAI,CAACC,IAAI,GAAGM,QAAQ;IACtB,CAAC,MAAM;MACLE,WAAW,CAACJ,QAAQ,GAAGE,QAAQ;IACjC;IAEAA,QAAQ,CAACL,IAAI,GAAGO,WAAW;IAC3BF,QAAQ,CAACF,QAAQ,GAAGL,IAAI;IAExB,EAAE,IAAI,CAACH,OAAO;EAChB;AACF"}

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

@@ -1,7 +1,5 @@
 import _defineProperty from "@babel/runtime/helpers/esm/defineProperty";
-
 import { assert } from '@loaders.gl/loader-utils';
-
 export class ManagedArray {
   constructor() {
     let length = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : 0;
@@ -11,7 +9,6 @@ export class ManagedArray {
     this._array = new Array(length);
     this._length = length;
   }
-
   get length() {
     return this._length;
   }
@@ -21,16 +18,13 @@ export class ManagedArray {
       this._array.length = 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) {
@@ -50,11 +44,9 @@ export class ManagedArray {
       this.length--;
     }
   }
-
   peek() {
     return this._array[this._length - 1];
   }
-
   push(element) {
     if (!this._map.has(element)) {
       const index = this.length++;
@@ -62,25 +54,21 @@ export class ManagedArray {
       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;
     }
   }
-
   resize(length) {
     assert(length >= 0);
     this.length = length;
   }
-
   trim(length) {
     if (length === null || length === undefined) {
       length = this.length;

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

@@ -1 +1 @@
-{"version":3,"file":"managed-array.js","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"],"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,SAAQA,MAAM,QAAO,0BAA0B;;AAW/C,OAAO,MAAMC,YAAY,CAAC;EAKxBC,WAAW,GAAa;IAAA,IAAZC,MAAM,uEAAG,CAAC;IAAA,8BAJf,IAAIC,GAAG,EAAE;IAAA;IAAA;IAKd,IAAI,CAACC,MAAM,GAAG,IAAIC,KAAK,CAACH,MAAM,CAAC;IAC/B,IAAI,CAACI,OAAO,GAAGJ,MAAM;EACvB;;EASA,IAAIA,MAAM,GAAG;IACX,OAAO,IAAI,CAACI,OAAO;EACrB;EAEA,IAAIJ,MAAM,CAACA,MAAM,EAAE;IACjB,IAAI,CAACI,OAAO,GAAGJ,MAAM;IACrB,IAAIA,MAAM,GAAG,IAAI,CAACE,MAAM,CAACF,MAAM,EAAE;MAC/B,IAAI,CAACE,MAAM,CAACF,MAAM,GAAGA,MAAM;IAC7B;EACF;;EASA,IAAIK,MAAM,GAAG;IACX,OAAO,IAAI,CAACH,MAAM;EACpB;;EAOAI,GAAG,CAACC,KAAK,EAAE;IACTV,MAAM,CAACU,KAAK,GAAG,IAAI,CAACL,MAAM,CAACF,MAAM,CAAC;IAClC,OAAO,IAAI,CAACE,MAAM,CAACK,KAAK,CAAC;EAC3B;;EAQAC,GAAG,CAACD,KAAK,EAAEE,OAAO,EAAE;IAClBZ,MAAM,CAACU,KAAK,IAAI,CAAC,CAAC;IAElB,IAAIA,KAAK,IAAI,IAAI,CAACP,MAAM,EAAE;MACxB,IAAI,CAACA,MAAM,GAAGO,KAAK,GAAG,CAAC;IACzB;IAEA,IAAI,IAAI,CAACG,IAAI,CAACC,GAAG,CAAC,IAAI,CAACT,MAAM,CAACK,KAAK,CAAC,CAAC,EAAE;MACrC,IAAI,CAACG,IAAI,CAACE,MAAM,CAAC,IAAI,CAACV,MAAM,CAACK,KAAK,CAAC,CAAC;IACtC;IAEA,IAAI,CAACL,MAAM,CAACK,KAAK,CAAC,GAAGE,OAAO;IAC5B,IAAI,CAACC,IAAI,CAACF,GAAG,CAACC,OAAO,EAAEF,KAAK,CAAC;EAC/B;EAEAK,MAAM,CAACH,OAAO,EAAE;IACd,MAAMF,KAAK,GAAG,IAAI,CAACG,IAAI,CAACJ,GAAG,CAACG,OAAO,CAAC;IACpC,IAAIF,KAAK,IAAI,CAAC,EAAE;MACd,IAAI,CAACL,MAAM,CAACW,MAAM,CAACN,KAAK,EAAE,CAAC,CAAC;MAC5B,IAAI,CAACG,IAAI,CAACE,MAAM,CAACH,OAAO,CAAC;MACzB,IAAI,CAACT,MAAM,EAAE;IACf;EACF;;EAOAc,IAAI,GAAG;IACL,OAAO,IAAI,CAACZ,MAAM,CAAC,IAAI,CAACE,OAAO,GAAG,CAAC,CAAC;EACtC;;EAOAW,IAAI,CAACN,OAAO,EAAE;IACZ,IAAI,CAAC,IAAI,CAACC,IAAI,CAACC,GAAG,CAACF,OAAO,CAAC,EAAE;MAC3B,MAAMF,KAAK,GAAG,IAAI,CAACP,MAAM,EAAE;MAC3B,IAAI,CAACE,MAAM,CAACK,KAAK,CAAC,GAAGE,OAAO;MAC5B,IAAI,CAACC,IAAI,CAACF,GAAG,CAACC,OAAO,EAAEF,KAAK,CAAC;IAC/B;EACF;;EAOAS,GAAG,GAAG;IACJ,MAAMP,OAAO,GAAG,IAAI,CAACP,MAAM,CAAC,EAAE,IAAI,CAACF,MAAM,CAAC;IAC1C,IAAI,CAACU,IAAI,CAACE,MAAM,CAACH,OAAO,CAAC;IACzB,OAAOA,OAAO;EAChB;;EAOAQ,OAAO,CAACjB,MAAM,EAAE;IACdH,MAAM,CAACG,MAAM,IAAI,CAAC,CAAC;IAEnB,IAAIA,MAAM,GAAG,IAAI,CAACE,MAAM,CAACF,MAAM,EAAE;MAC/B,IAAI,CAACE,MAAM,CAACF,MAAM,GAAGA,MAAM;IAC7B;EACF;;EAOAkB,MAAM,CAAClB,MAAM,EAAE;IACbH,MAAM,CAACG,MAAM,IAAI,CAAC,CAAC;IAEnB,IAAI,CAACA,MAAM,GAAGA,MAAM;EACtB;;EAOAmB,IAAI,CAACnB,MAAM,EAAE;IACX,IAAIA,MAAM,KAAK,IAAI,IAAIA,MAAM,KAAKoB,SAAS,EAAE;MAC3CpB,MAAM,GAAG,IAAI,CAACA,MAAM;IACtB;IACA,IAAI,CAACE,MAAM,CAACF,MAAM,GAAGA,MAAM;EAC7B;EAEAqB,KAAK,GAAG;IACN,IAAI,CAACnB,MAAM,GAAG,EAAE;IAChB,IAAI,CAACQ,IAAI,GAAG,IAAIT,GAAG,EAAE;IACrB,IAAI,CAACG,OAAO,GAAG,CAAC;EAClB;EAEAkB,IAAI,CAACC,MAAM,EAAE;IACX,OAAO,IAAI,CAACb,IAAI,CAACC,GAAG,CAACY,MAAM,CAAC;EAC9B;AACF"}
+{"version":3,"file":"managed-array.js","names":["assert","ManagedArray","constructor","length","arguments","undefined","_defineProperty","Map","_array","Array","_length","values","get","index","set","element","_map","has","delete","splice","peek","push","pop","reserve","resize","trim","reset","find","target"],"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,SAAQA,MAAM,QAAO,0BAA0B;AAW/C,OAAO,MAAMC,YAAY,CAAC;EAKxBC,WAAWA,CAAA,EAAa;IAAA,IAAZC,MAAM,GAAAC,SAAA,CAAAD,MAAA,QAAAC,SAAA,QAAAC,SAAA,GAAAD,SAAA,MAAG,CAAC;IAAAE,eAAA,eAJf,IAAIC,GAAG,CAAC,CAAC;IAAAD,eAAA;IAAAA,eAAA;IAKd,IAAI,CAACE,MAAM,GAAG,IAAIC,KAAK,CAACN,MAAM,CAAC;IAC/B,IAAI,CAACO,OAAO,GAAGP,MAAM;EACvB;EASA,IAAIA,MAAMA,CAAA,EAAG;IACX,OAAO,IAAI,CAACO,OAAO;EACrB;EAEA,IAAIP,MAAMA,CAACA,MAAM,EAAE;IACjB,IAAI,CAACO,OAAO,GAAGP,MAAM;IACrB,IAAIA,MAAM,GAAG,IAAI,CAACK,MAAM,CAACL,MAAM,EAAE;MAC/B,IAAI,CAACK,MAAM,CAACL,MAAM,GAAGA,MAAM;IAC7B;EACF;EASA,IAAIQ,MAAMA,CAAA,EAAG;IACX,OAAO,IAAI,CAACH,MAAM;EACpB;EAOAI,GAAGA,CAACC,KAAK,EAAE;IACTb,MAAM,CAACa,KAAK,GAAG,IAAI,CAACL,MAAM,CAACL,MAAM,CAAC;IAClC,OAAO,IAAI,CAACK,MAAM,CAACK,KAAK,CAAC;EAC3B;EAQAC,GAAGA,CAACD,KAAK,EAAEE,OAAO,EAAE;IAClBf,MAAM,CAACa,KAAK,IAAI,CAAC,CAAC;IAElB,IAAIA,KAAK,IAAI,IAAI,CAACV,MAAM,EAAE;MACxB,IAAI,CAACA,MAAM,GAAGU,KAAK,GAAG,CAAC;IACzB;IAEA,IAAI,IAAI,CAACG,IAAI,CAACC,GAAG,CAAC,IAAI,CAACT,MAAM,CAACK,KAAK,CAAC,CAAC,EAAE;MACrC,IAAI,CAACG,IAAI,CAACE,MAAM,CAAC,IAAI,CAACV,MAAM,CAACK,KAAK,CAAC,CAAC;IACtC;IAEA,IAAI,CAACL,MAAM,CAACK,KAAK,CAAC,GAAGE,OAAO;IAC5B,IAAI,CAACC,IAAI,CAACF,GAAG,CAACC,OAAO,EAAEF,KAAK,CAAC;EAC/B;EAEAK,MAAMA,CAACH,OAAO,EAAE;IACd,MAAMF,KAAK,GAAG,IAAI,CAACG,IAAI,CAACJ,GAAG,CAACG,OAAO,CAAC;IACpC,IAAIF,KAAK,IAAI,CAAC,EAAE;MACd,IAAI,CAACL,MAAM,CAACW,MAAM,CAACN,KAAK,EAAE,CAAC,CAAC;MAC5B,IAAI,CAACG,IAAI,CAACE,MAAM,CAACH,OAAO,CAAC;MACzB,IAAI,CAACZ,MAAM,EAAE;IACf;EACF;EAOAiB,IAAIA,CAAA,EAAG;IACL,OAAO,IAAI,CAACZ,MAAM,CAAC,IAAI,CAACE,OAAO,GAAG,CAAC,CAAC;EACtC;EAOAW,IAAIA,CAACN,OAAO,EAAE;IACZ,IAAI,CAAC,IAAI,CAACC,IAAI,CAACC,GAAG,CAACF,OAAO,CAAC,EAAE;MAC3B,MAAMF,KAAK,GAAG,IAAI,CAACV,MAAM,EAAE;MAC3B,IAAI,CAACK,MAAM,CAACK,KAAK,CAAC,GAAGE,OAAO;MAC5B,IAAI,CAACC,IAAI,CAACF,GAAG,CAACC,OAAO,EAAEF,KAAK,CAAC;IAC/B;EACF;EAOAS,GAAGA,CAAA,EAAG;IACJ,MAAMP,OAAO,GAAG,IAAI,CAACP,MAAM,CAAC,EAAE,IAAI,CAACL,MAAM,CAAC;IAC1C,IAAI,CAACa,IAAI,CAACE,MAAM,CAACH,OAAO,CAAC;IACzB,OAAOA,OAAO;EAChB;EAOAQ,OAAOA,CAACpB,MAAM,EAAE;IACdH,MAAM,CAACG,MAAM,IAAI,CAAC,CAAC;IAEnB,IAAIA,MAAM,GAAG,IAAI,CAACK,MAAM,CAACL,MAAM,EAAE;MAC/B,IAAI,CAACK,MAAM,CAACL,MAAM,GAAGA,MAAM;IAC7B;EACF;EAOAqB,MAAMA,CAACrB,MAAM,EAAE;IACbH,MAAM,CAACG,MAAM,IAAI,CAAC,CAAC;IAEnB,IAAI,CAACA,MAAM,GAAGA,MAAM;EACtB;EAOAsB,IAAIA,CAACtB,MAAM,EAAE;IACX,IAAIA,MAAM,KAAK,IAAI,IAAIA,MAAM,KAAKE,SAAS,EAAE;MAC3CF,MAAM,GAAG,IAAI,CAACA,MAAM;IACtB;IACA,IAAI,CAACK,MAAM,CAACL,MAAM,GAAGA,MAAM;EAC7B;EAEAuB,KAAKA,CAAA,EAAG;IACN,IAAI,CAAClB,MAAM,GAAG,EAAE;IAChB,IAAI,CAACQ,IAAI,GAAG,IAAIT,GAAG,CAAC,CAAC;IACrB,IAAI,CAACG,OAAO,GAAG,CAAC;EAClB;EAEAiB,IAAIA,CAACC,MAAM,EAAE;IACX,OAAO,IAAI,CAACZ,IAAI,CAACC,GAAG,CAACW,MAAM,CAAC;EAC9B;AACF"}

package/dist/tileset/helpers/bounding-volume.d.ts

@@ -1,3 +1,4 @@
+import { BoundingSphere, OrientedBoundingBox } from '@math.gl/culling';
 /**
  * Create a bounding volume from the tile's bounding volume header.
  * @param {Object} boundingVolumeHeader The tile's bounding volume header.
@@ -6,4 +7,13 @@
  * @returns The modified result parameter or a new TileBoundingVolume instance if none was provided.
  */
 export declare function createBoundingVolume(boundingVolumeHeader: any, transform: any, result: any): any;
+/** [min, max] each in [longitude, latitude, altitude] */
+export type CartographicBounds = [min: number[], max: number[]];
+/**
+ * Calculate the cartographic bounding box the tile's bounding volume.
+ * @param {Object} boundingVolumeHeader The tile's bounding volume header.
+ * @param {BoundingVolume} boundingVolume The bounding volume.
+ * @returns {CartographicBounds}
+ */
+export declare function getCartographicBounds(boundingVolumeHeader: any, boundingVolume: OrientedBoundingBox | BoundingSphere): CartographicBounds;
 //# sourceMappingURL=bounding-volume.d.ts.map

package/dist/tileset/helpers/bounding-volume.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"bounding-volume.d.ts","sourceRoot":"","sources":["../../../src/tileset/helpers/bounding-volume.ts"],"names":[],"mappings":"AAuBA;;;;;;GAMG;AACH,wBAAgB,oBAAoB,CAAC,oBAAoB,KAAA,EAAE,SAAS,KAAA,EAAE,MAAM,KAAA,OAsC3E"}
+{"version":3,"file":"bounding-volume.d.ts","sourceRoot":"","sources":["../../../src/tileset/helpers/bounding-volume.ts"],"names":[],"mappings":"AAKA,OAAO,EAAC,cAAc,EAAE,mBAAmB,EAAC,MAAM,kBAAkB,CAAC;AAmBrE;;;;;;GAMG;AACH,wBAAgB,oBAAoB,CAAC,oBAAoB,KAAA,EAAE,SAAS,KAAA,EAAE,MAAM,KAAA,OAsC3E;AAED,yDAAyD;AACzD,MAAM,MAAM,kBAAkB,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC,CAAC;AAEhE;;;;;GAKG;AACH,wBAAgB,qBAAqB,CACnC,oBAAoB,KAAA,EACpB,cAAc,EAAE,mBAAmB,GAAG,cAAc,GACnD,kBAAkB,CAuBpB"}

package/dist/tileset/helpers/bounding-volume.js

@@ -2,7 +2,7 @@
 // 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 });
-exports.createBoundingVolume = void 0;
+exports.getCartographicBounds = exports.createBoundingVolume = void 0;
 /* eslint-disable */
 const core_1 = require("@math.gl/core");
 const culling_1 = require("@math.gl/culling");
@@ -13,6 +13,7 @@ function defined(x) {
     return x !== undefined && x !== null;
 }
 // const scratchMatrix = new Matrix3();
+const scratchPoint = new core_1.Vector3();
 const scratchScale = new core_1.Vector3();
 const scratchNorthWest = new core_1.Vector3();
 const scratchSouthEast = new core_1.Vector3();
@@ -52,6 +53,34 @@ function createBoundingVolume(boundingVolumeHeader, transform, result) {
     throw new Error('3D Tile: boundingVolume must contain a sphere, region, or box');
 }
 exports.createBoundingVolume = createBoundingVolume;
+/**
+ * Calculate the cartographic bounding box the tile's bounding volume.
+ * @param {Object} boundingVolumeHeader The tile's bounding volume header.
+ * @param {BoundingVolume} boundingVolume The bounding volume.
+ * @returns {CartographicBounds}
+ */
+function getCartographicBounds(boundingVolumeHeader, boundingVolume) {
+    // boundingVolume schema:
+    // https://github.com/AnalyticalGraphicsInc/3d-tiles/blob/master/specification/schema/boundingVolume.schema.json
+    if (boundingVolumeHeader.box) {
+        return orientedBoundingBoxToCartographicBounds(boundingVolume);
+    }
+    if (boundingVolumeHeader.region) {
+        // [west, south, east, north, minimum height, maximum height]
+        // Latitudes and longitudes are in the WGS 84 datum as defined in EPSG 4979 and are in radians.
+        // Heights are in meters above (or below) the WGS 84 ellipsoid.
+        const [west, south, east, north, minHeight, maxHeight] = boundingVolumeHeader.region;
+        return [
+            [(0, core_1.degrees)(west), (0, core_1.degrees)(south), minHeight],
+            [(0, core_1.degrees)(east), (0, core_1.degrees)(north), maxHeight]
+        ];
+    }
+    if (boundingVolumeHeader.sphere) {
+        return boundingSphereToCartographicBounds(boundingVolume);
+    }
+    throw new Error('Unkown boundingVolume type');
+}
+exports.getCartographicBounds = getCartographicBounds;
 function createBox(box, transform, result) {
     // https://math.gl/modules/culling/docs/api-reference/oriented-bounding-box
     // 1. A half-axes based representation.
@@ -175,3 +204,90 @@ function createSphere(sphere, transform, result) {
     }
     return new culling_1.BoundingSphere(center, radius);
 }
+/**
+ * Convert a bounding volume defined by OrientedBoundingBox to cartographic bounds
+ * @returns {CartographicBounds}
+ */
+function orientedBoundingBoxToCartographicBounds(boundingVolume) {
+    const result = emptyCartographicBounds();
+    const { halfAxes } = boundingVolume;
+    const xAxis = new core_1.Vector3(halfAxes.getColumn(0));
+    const yAxis = new core_1.Vector3(halfAxes.getColumn(1));
+    const zAxis = new core_1.Vector3(halfAxes.getColumn(2));
+    // Test all 8 corners of the box
+    for (let x = 0; x < 2; x++) {
+        for (let y = 0; y < 2; y++) {
+            for (let z = 0; z < 2; z++) {
+                scratchPoint.copy(boundingVolume.center);
+                scratchPoint.add(xAxis);
+                scratchPoint.add(yAxis);
+                scratchPoint.add(zAxis);
+                addToCartographicBounds(result, scratchPoint);
+                zAxis.negate();
+            }
+            yAxis.negate();
+        }
+        xAxis.negate();
+    }
+    return result;
+}
+/**
+ * Convert a bounding volume defined by BoundingSphere to cartographic bounds
+ * @returns {CartographicBounds}
+ */
+function boundingSphereToCartographicBounds(boundingVolume) {
+    const result = emptyCartographicBounds();
+    const { center, radius } = boundingVolume;
+    const point = geospatial_1.Ellipsoid.WGS84.scaleToGeodeticSurface(center, scratchPoint);
+    let zAxis;
+    if (point) {
+        zAxis = geospatial_1.Ellipsoid.WGS84.geodeticSurfaceNormal(point);
+    }
+    else {
+        zAxis = new core_1.Vector3(0, 0, 1);
+    }
+    let xAxis = new core_1.Vector3(zAxis[2], -zAxis[1], 0);
+    if (xAxis.len() > 0) {
+        xAxis.normalize();
+    }
+    else {
+        xAxis = new core_1.Vector3(0, 1, 0);
+    }
+    const yAxis = xAxis.clone().cross(zAxis);
+    // Test 6 end points of the 3 axes
+    for (const axis of [xAxis, yAxis, zAxis]) {
+        scratchScale.copy(axis).scale(radius);
+        for (let dir = 0; dir < 2; dir++) {
+            scratchPoint.copy(center);
+            scratchPoint.add(scratchScale);
+            addToCartographicBounds(result, scratchPoint);
+            // Flip the axis
+            scratchScale.negate();
+        }
+    }
+    return result;
+}
+/**
+ * Create a new cartographic bounds that contains no points
+ * @returns {CartographicBounds}
+ */
+function emptyCartographicBounds() {
+    return [
+        [Infinity, Infinity, Infinity],
+        [-Infinity, -Infinity, -Infinity]
+    ];
+}
+/**
+ * Add a point to the target cartographic bounds
+ * @param {CartographicBounds} target
+ * @param {Vector3} cartesian coordinates of the point to add
+ */
+function addToCartographicBounds(target, cartesian) {
+    geospatial_1.Ellipsoid.WGS84.cartesianToCartographic(cartesian, scratchPoint);
+    target[0][0] = Math.min(target[0][0], scratchPoint[0]);
+    target[0][1] = Math.min(target[0][1], scratchPoint[1]);
+    target[0][2] = Math.min(target[0][2], scratchPoint[2]);
+    target[1][0] = Math.max(target[1][0], scratchPoint[0]);
+    target[1][1] = Math.max(target[1][1], scratchPoint[1]);
+    target[1][2] = Math.max(target[1][2], scratchPoint[2]);
+}