@loaders.gl/potree 4.3.0-alpha.5 → 4.3.0-alpha.6

package/dist/index.cjs

@@ -22,12 +22,13 @@ var dist_exports = {};
 __export(dist_exports, {
   PotreeBinLoader: () => PotreeBinLoader,
   PotreeHierarchyChunkLoader: () => PotreeHierarchyChunkLoader,
-  PotreeLoader: () => PotreeLoader
+  PotreeLoader: () => PotreeLoader,
+  PotreeSource: () => PotreeSource
 });
 module.exports = __toCommonJS(dist_exports);
 
 // dist/potree-loader.js
-var VERSION = true ? "4.3.0-alpha.4" : "latest";
+var VERSION = true ? "4.3.0-alpha.5" : "latest";
 var PotreeLoader = {
   dataType: null,
   batchType: null,
@@ -56,7 +57,7 @@ function parseBinaryChunk(arrayBuffer, byteOffset = 0) {
   const topTileHeader = {};
   byteOffset = decodeRow(dataView, byteOffset, topTileHeader);
   stack.push(topTileHeader);
-  const tileHeaders = [];
+  const tileHeaders = [topTileHeader];
   while (stack.length > 0) {
     const snode = stack.shift();
     let mask = 1;
@@ -86,33 +87,33 @@ function decodeRow(dataView, byteOffset, tileHeader) {
   byteOffset += 5;
   return byteOffset;
 }
-function buildHierarchy(tileHeaders, options = {}) {
+function buildHierarchy(flatNodes, options = {}) {
   const DEFAULT_OPTIONS = { spacing: 100 };
   options = { ...DEFAULT_OPTIONS, ...options };
-  const topNode = tileHeaders[0];
+  const topNode = flatNodes[0];
   const nodes = {};
-  for (const tileHeader of tileHeaders) {
-    const { name } = tileHeader;
+  for (const node of flatNodes) {
+    const { name } = node;
     const index = parseInt(name.charAt(name.length - 1), 10);
     const parentName = name.substring(0, name.length - 1);
     const parentNode = nodes[parentName];
     const level = name.length - 1;
-    tileHeader.level = level;
-    tileHeader.hasChildren = tileHeader.header.childCount;
-    tileHeader.children = [];
-    tileHeader.childrenByIndex = new Array(8).fill(null);
-    tileHeader.spacing = ((options == null ? void 0 : options.spacing) || 0) / Math.pow(2, level);
+    node.level = level;
+    node.hasChildren = Boolean(node.header.childCount);
+    node.children = [];
+    node.childrenByIndex = new Array(8).fill(null);
+    node.spacing = ((options == null ? void 0 : options.spacing) || 0) / Math.pow(2, level);
     if (parentNode) {
-      parentNode.children.push(tileHeader);
-      parentNode.childrenByIndex[index] = tileHeader;
+      parentNode.children.push(node);
+      parentNode.childrenByIndex[index] = node;
     }
-    nodes[name] = tileHeader;
+    nodes[name] = node;
   }
   return topNode;
 }
 
 // dist/potree-hierarchy-chunk-loader.js
-var VERSION2 = true ? "4.3.0-alpha.4" : "latest";
+var VERSION2 = true ? "4.3.0-alpha.5" : "latest";
 var PotreeHierarchyChunkLoader = {
   dataType: null,
   batchType: null,
@@ -158,4 +159,159 @@ function parseSync(arrayBuffer, options) {
   parsePotreeBin(arrayBuffer, byteOffset, options, index);
   return index;
 }
+
+// dist/lib/potree-node-source.js
+var import_core = require("@loaders.gl/core");
+var import_loader_utils = require("@loaders.gl/loader-utils");
+var import_las = require("@loaders.gl/las");
+
+// dist/utils/parse-version.js
+function parseVersion(version) {
+  const parts = version.split(".").map(Number);
+  return { major: parts[0], minor: parts[1] };
+}
+
+// dist/lib/potree-node-source.js
+var PotreeNodesSource = class extends import_loader_utils.DataSource {
+  /** Dataset base URL */
+  baseUrl = "";
+  /** Input data: string - dataset url, blob - single file data */
+  data;
+  /** Input props */
+  props;
+  /** Meta information from `cloud.js` */
+  metadata = null;
+  /** Root node */
+  root = null;
+  /** Is data source ready to use after initial loading */
+  isReady = false;
+  initPromise = null;
+  /**
+   * @constructor
+   * @param data  - if string - data set path url or path to `cloud.js` metadata file
+   *              - if Blob - single file data
+   * @param props - data source properties
+   */
+  constructor(data, props) {
+    super(props);
+    this.props = props;
+    this.data = data;
+    this.makeBaseUrl(this.data);
+    this.initPromise = this.init();
+  }
+  /** Initial data source loading */
+  async init() {
+    if (this.initPromise) {
+      await this.initPromise;
+      return;
+    }
+    this.metadata = await (0, import_core.load)(`${this.baseUrl}/cloud.js`, PotreeLoader);
+    await this.loadHierarchy();
+    this.isReady = true;
+  }
+  /** Is data set supported */
+  isSupported() {
+    var _a, _b, _c;
+    const { minor, major } = parseVersion(((_a = this.metadata) == null ? void 0 : _a.version) ?? "");
+    return this.isReady && major === 1 && minor < 2 && typeof ((_b = this.metadata) == null ? void 0 : _b.pointAttributes) === "string" && ["LAS", "LAZ"].includes((_c = this.metadata) == null ? void 0 : _c.pointAttributes);
+  }
+  /** Get content files extension */
+  getContentExtension() {
+    var _a;
+    if (!this.isReady) {
+      return null;
+    }
+    switch ((_a = this.metadata) == null ? void 0 : _a.pointAttributes) {
+      case "LAS":
+        return "las";
+      case "LAZ":
+        return "laz";
+      default:
+        return "bin";
+    }
+  }
+  /**
+   * Load octree node content
+   * @param path array of numbers between 0-7 specifying successive octree divisions.
+   * @return node content geometry or null if the node doesn't exist
+   */
+  async loadNodeContent(path) {
+    var _a;
+    await this.initPromise;
+    if (!this.isSupported()) {
+      return null;
+    }
+    const isAvailable = await this.isNodeAvailable(path);
+    if (isAvailable) {
+      return (0, import_core.load)(`${this.baseUrl}/${(_a = this.metadata) == null ? void 0 : _a.octreeDir}/r/r${path.join()}.${this.getContentExtension()}`, import_las.LASLoader);
+    }
+    return null;
+  }
+  /**
+   * Check if a node exists in the octree
+   * @param path array of numbers between 0-7 specifying successive octree divisions
+   * @returns true - the node does exist, false - the nodes doesn't exist
+   */
+  async isNodeAvailable(path) {
+    var _a;
+    if ((_a = this.metadata) == null ? void 0 : _a.hierarchy) {
+      return this.metadata.hierarchy.findIndex((item) => item[0] === `r${path.join()}`) !== -1;
+    }
+    if (!this.root) {
+      return false;
+    }
+    let currentParent = this.root;
+    let name = "";
+    let result = true;
+    for (const nodeLevel of path) {
+      const newName = `${name}${nodeLevel}`;
+      const node = currentParent.children.find((child) => child.name === newName);
+      if (node) {
+        currentParent = node;
+        name = newName;
+      } else {
+        result = false;
+        break;
+      }
+    }
+    return result;
+  }
+  /**
+   * Load data source hierarchy into tree of available nodes
+   */
+  async loadHierarchy() {
+    var _a;
+    this.root = await (0, import_core.load)(`${this.baseUrl}/${(_a = this.metadata) == null ? void 0 : _a.octreeDir}/r/r.hrc`, PotreeHierarchyChunkLoader);
+  }
+  /**
+   * Deduce base url from the input url sring
+   * @param data - data source input data
+   */
+  makeBaseUrl(data) {
+    this.baseUrl = typeof data === "string" ? (0, import_loader_utils.resolvePath)(data) : "";
+    if (this.baseUrl.endsWith("cloud.js")) {
+      this.baseUrl = this.baseUrl.substring(0, -8);
+    }
+    if (this.baseUrl.endsWith("/")) {
+      this.baseUrl = this.baseUrl.substring(0, -1);
+    }
+  }
+};
+
+// dist/potree-source.js
+var VERSION3 = "1.7";
+var PotreeSource = {
+  name: "Potree",
+  id: "potree",
+  module: "potree",
+  version: VERSION3,
+  extensions: ["bin", "las", "laz"],
+  mimeTypes: ["application/octet-stream"],
+  options: { url: void 0, potree: {} },
+  type: "potree",
+  fromUrl: true,
+  fromBlob: true,
+  testURL: (url) => url.endsWith(".js"),
+  createDataSource: (url, props) => new PotreeNodesSource(url, props)
+};
 //# sourceMappingURL=index.cjs.map

package/dist/index.cjs.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
-  "sources": ["index.js", "potree-loader.js", "parsers/parse-potree-hierarchy-chunk.js", "potree-hierarchy-chunk-loader.js", "parsers/parse-potree-bin.js", "potree-bin-loader.js"],
-  "sourcesContent": ["export { PotreeLoader } from \"./potree-loader.js\";\nexport { PotreeHierarchyChunkLoader } from \"./potree-hierarchy-chunk-loader.js\";\nexport { PotreeBinLoader } from \"./potree-bin-loader.js\";\n", "// loaders.gl\n// SPDX-License-Identifier: MIT\n// Copyright vis.gl contributors\n// __VERSION__ is injected by babel-plugin-version-inline\n// @ts-ignore TS2304: Cannot find name '__VERSION__'.\nconst VERSION = typeof \"4.3.0-alpha.4\" !== 'undefined' ? \"4.3.0-alpha.4\" : 'latest';\n/** Potree loader */\nexport const PotreeLoader = {\n    dataType: null,\n    batchType: null,\n    name: 'potree metadata',\n    id: 'potree',\n    module: 'potree',\n    version: VERSION,\n    extensions: ['js'],\n    mimeTypes: ['application/json'],\n    testText: (text) => text.indexOf('octreeDir') >= 0,\n    parse: (data) => JSON.parse(new TextDecoder().decode(data)),\n    parseTextSync: (text) => JSON.parse(text),\n    options: {\n        potree: {}\n    }\n};\n", "// This file is derived from the Cesium code base under BSD 2-clause license\n// See LICENSE.md and https://github.com/potree/potree/blob/develop/LICENSE\n// type POTreeTileNode = POTreeNode;\n// load hierarchy\nexport function parsePotreeHierarchyChunk(arrayBuffer) {\n    const tileHeaders = parseBinaryChunk(arrayBuffer);\n    return buildHierarchy(tileHeaders);\n}\n// Parses the binary rows\nfunction parseBinaryChunk(arrayBuffer, byteOffset = 0) {\n    const dataView = new DataView(arrayBuffer);\n    const stack = [];\n    // Get root mask\n    // @ts-expect-error\n    const topTileHeader = {};\n    byteOffset = decodeRow(dataView, byteOffset, topTileHeader);\n    stack.push(topTileHeader);\n    const tileHeaders = [];\n    while (stack.length > 0) {\n        const snode = stack.shift();\n        let mask = 1;\n        for (let i = 0; i < 8; i++) {\n            if (snode && (snode.header.childMask & mask) !== 0) {\n                // @ts-expect-error\n                const tileHeader = {};\n                byteOffset = decodeRow(dataView, byteOffset, tileHeader);\n                tileHeader.name = snode.name + i;\n                // @ts-expect-error\n                stack.push(tileHeader);\n                tileHeaders.push(tileHeader);\n                snode.header.childCount++;\n            }\n            mask = mask * 2;\n        }\n        if (byteOffset === dataView.byteLength) {\n            break;\n        }\n    }\n    return tileHeaders;\n}\nfunction decodeRow(dataView, byteOffset, tileHeader) {\n    tileHeader.header = tileHeader.header || {};\n    tileHeader.header.childMask = dataView.getUint8(byteOffset);\n    tileHeader.header.childCount = 0;\n    tileHeader.pointCount = dataView.getUint32(byteOffset + 1, true);\n    tileHeader.name = '';\n    byteOffset += 5;\n    return byteOffset;\n}\n// Resolves the binary rows into a hierarchy (tree structure)\nfunction buildHierarchy(tileHeaders, options = {}) {\n    const DEFAULT_OPTIONS = { spacing: 100 }; // TODO assert instead of default?\n    options = { ...DEFAULT_OPTIONS, ...options };\n    const topNode = tileHeaders[0];\n    const nodes = {};\n    for (const tileHeader of tileHeaders) {\n        const { name } = tileHeader;\n        const index = parseInt(name.charAt(name.length - 1), 10);\n        const parentName = name.substring(0, name.length - 1);\n        const parentNode = nodes[parentName];\n        const level = name.length - 1;\n        // assert(parentNode && level >= 0);\n        tileHeader.level = level;\n        tileHeader.hasChildren = tileHeader.header.childCount;\n        tileHeader.children = [];\n        tileHeader.childrenByIndex = new Array(8).fill(null);\n        tileHeader.spacing = (options?.spacing || 0) / Math.pow(2, level);\n        // tileHeader.boundingVolume = Utils.createChildAABB(parentNode.boundingBox, index);\n        if (parentNode) {\n            parentNode.children.push(tileHeader);\n            parentNode.childrenByIndex[index] = tileHeader;\n        }\n        // Add the node to the map\n        nodes[name] = tileHeader;\n    }\n    // First node is the root\n    return topNode;\n}\n", "// loaders.gl\n// SPDX-License-Identifier: MIT\n// Copyright vis.gl contributors\nimport { parsePotreeHierarchyChunk } from \"./parsers/parse-potree-hierarchy-chunk.js\";\n// __VERSION__ is injected by babel-plugin-version-inline\n// @ts-ignore TS2304: Cannot find name '__VERSION__'.\nconst VERSION = typeof \"4.3.0-alpha.4\" !== 'undefined' ? \"4.3.0-alpha.4\" : 'latest';\n/** Potree hierarchy chunk loader */\nexport const PotreeHierarchyChunkLoader = {\n    dataType: null,\n    batchType: null,\n    name: 'potree Hierarchy Chunk',\n    id: 'potree-hrc',\n    module: 'potree',\n    version: VERSION,\n    extensions: ['hrc'],\n    mimeTypes: ['application/octet-stream'],\n    // binary potree files have no header bytes, no content test function possible\n    // test: ['...'],\n    parse: async (arrayBuffer, options) => parsePotreeHierarchyChunk(arrayBuffer),\n    parseSync: (arrayBuffer, options) => parsePotreeHierarchyChunk(arrayBuffer),\n    options: {\n        potree: {}\n    },\n    binary: true\n};\n", "export function parsePotreeBin(arrayBuffer, byteOffset, options, index) {\n    return null;\n}\n", "// loaders.gl\n// SPDX-License-Identifier: MIT\n// Copyright vis.gl contributors\nimport { parsePotreeBin } from \"./parsers/parse-potree-bin.js\";\n/**\n * Loader for potree Binary Point Attributes\n * */\nexport const PotreeBinLoader = {\n    dataType: null,\n    batchType: null,\n    name: 'potree Binary Point Attributes',\n    id: 'potree',\n    extensions: ['bin'],\n    mimeTypes: ['application/octet-stream'],\n    // Unfortunately binary potree files have no header bytes, no test possible\n    // test: ['...'],\n    parseSync,\n    binary: true,\n    options: {}\n    // @ts-ignore\n};\nfunction parseSync(arrayBuffer, options) {\n    const index = {};\n    const byteOffset = 0;\n    parsePotreeBin(arrayBuffer, byteOffset, options, index);\n    return index;\n}\n"],
-  "mappings": ";;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;ACKA,IAAM,UAAU,OAAyC,kBAAkB;AAEpE,IAAM,eAAe;AAAA,EACxB,UAAU;AAAA,EACV,WAAW;AAAA,EACX,MAAM;AAAA,EACN,IAAI;AAAA,EACJ,QAAQ;AAAA,EACR,SAAS;AAAA,EACT,YAAY,CAAC,IAAI;AAAA,EACjB,WAAW,CAAC,kBAAkB;AAAA,EAC9B,UAAU,CAAC,SAAS,KAAK,QAAQ,WAAW,KAAK;AAAA,EACjD,OAAO,CAAC,SAAS,KAAK,MAAM,IAAI,YAAY,EAAE,OAAO,IAAI,CAAC;AAAA,EAC1D,eAAe,CAAC,SAAS,KAAK,MAAM,IAAI;AAAA,EACxC,SAAS;AAAA,IACL,QAAQ,CAAC;AAAA,EACb;AACJ;;;AClBO,SAAS,0BAA0B,aAAa;AACnD,QAAM,cAAc,iBAAiB,WAAW;AAChD,SAAO,eAAe,WAAW;AACrC;AAEA,SAAS,iBAAiB,aAAa,aAAa,GAAG;AACnD,QAAM,WAAW,IAAI,SAAS,WAAW;AACzC,QAAM,QAAQ,CAAC;AAGf,QAAM,gBAAgB,CAAC;AACvB,eAAa,UAAU,UAAU,YAAY,aAAa;AAC1D,QAAM,KAAK,aAAa;AACxB,QAAM,cAAc,CAAC;AACrB,SAAO,MAAM,SAAS,GAAG;AACrB,UAAM,QAAQ,MAAM,MAAM;AAC1B,QAAI,OAAO;AACX,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AACxB,UAAI,UAAU,MAAM,OAAO,YAAY,UAAU,GAAG;AAEhD,cAAM,aAAa,CAAC;AACpB,qBAAa,UAAU,UAAU,YAAY,UAAU;AACvD,mBAAW,OAAO,MAAM,OAAO;AAE/B,cAAM,KAAK,UAAU;AACrB,oBAAY,KAAK,UAAU;AAC3B,cAAM,OAAO;AAAA,MACjB;AACA,aAAO,OAAO;AAAA,IAClB;AACA,QAAI,eAAe,SAAS,YAAY;AACpC;AAAA,IACJ;AAAA,EACJ;AACA,SAAO;AACX;AACA,SAAS,UAAU,UAAU,YAAY,YAAY;AACjD,aAAW,SAAS,WAAW,UAAU,CAAC;AAC1C,aAAW,OAAO,YAAY,SAAS,SAAS,UAAU;AAC1D,aAAW,OAAO,aAAa;AAC/B,aAAW,aAAa,SAAS,UAAU,aAAa,GAAG,IAAI;AAC/D,aAAW,OAAO;AAClB,gBAAc;AACd,SAAO;AACX;AAEA,SAAS,eAAe,aAAa,UAAU,CAAC,GAAG;AAC/C,QAAM,kBAAkB,EAAE,SAAS,IAAI;AACvC,YAAU,EAAE,GAAG,iBAAiB,GAAG,QAAQ;AAC3C,QAAM,UAAU,YAAY,CAAC;AAC7B,QAAM,QAAQ,CAAC;AACf,aAAW,cAAc,aAAa;AAClC,UAAM,EAAE,KAAK,IAAI;AACjB,UAAM,QAAQ,SAAS,KAAK,OAAO,KAAK,SAAS,CAAC,GAAG,EAAE;AACvD,UAAM,aAAa,KAAK,UAAU,GAAG,KAAK,SAAS,CAAC;AACpD,UAAM,aAAa,MAAM,UAAU;AACnC,UAAM,QAAQ,KAAK,SAAS;AAE5B,eAAW,QAAQ;AACnB,eAAW,cAAc,WAAW,OAAO;AAC3C,eAAW,WAAW,CAAC;AACvB,eAAW,kBAAkB,IAAI,MAAM,CAAC,EAAE,KAAK,IAAI;AACnD,eAAW,YAAW,mCAAS,YAAW,KAAK,KAAK,IAAI,GAAG,KAAK;AAEhE,QAAI,YAAY;AACZ,iBAAW,SAAS,KAAK,UAAU;AACnC,iBAAW,gBAAgB,KAAK,IAAI;AAAA,IACxC;AAEA,UAAM,IAAI,IAAI;AAAA,EAClB;AAEA,SAAO;AACX;;;ACvEA,IAAMA,WAAU,OAAyC,kBAAkB;AAEpE,IAAM,6BAA6B;AAAA,EACtC,UAAU;AAAA,EACV,WAAW;AAAA,EACX,MAAM;AAAA,EACN,IAAI;AAAA,EACJ,QAAQ;AAAA,EACR,SAASA;AAAA,EACT,YAAY,CAAC,KAAK;AAAA,EAClB,WAAW,CAAC,0BAA0B;AAAA;AAAA;AAAA,EAGtC,OAAO,OAAO,aAAa,YAAY,0BAA0B,WAAW;AAAA,EAC5E,WAAW,CAAC,aAAa,YAAY,0BAA0B,WAAW;AAAA,EAC1E,SAAS;AAAA,IACL,QAAQ,CAAC;AAAA,EACb;AAAA,EACA,QAAQ;AACZ;;;ACzBO,SAAS,eAAe,aAAa,YAAY,SAAS,OAAO;AACpE,SAAO;AACX;;;ACKO,IAAM,kBAAkB;AAAA,EAC3B,UAAU;AAAA,EACV,WAAW;AAAA,EACX,MAAM;AAAA,EACN,IAAI;AAAA,EACJ,YAAY,CAAC,KAAK;AAAA,EAClB,WAAW,CAAC,0BAA0B;AAAA;AAAA;AAAA,EAGtC;AAAA,EACA,QAAQ;AAAA,EACR,SAAS,CAAC;AAAA;AAEd;AACA,SAAS,UAAU,aAAa,SAAS;AACrC,QAAM,QAAQ,CAAC;AACf,QAAM,aAAa;AACnB,iBAAe,aAAa,YAAY,SAAS,KAAK;AACtD,SAAO;AACX;",
-  "names": ["VERSION"]
+  "sources": ["index.js", "potree-loader.js", "parsers/parse-potree-hierarchy-chunk.js", "potree-hierarchy-chunk-loader.js", "parsers/parse-potree-bin.js", "potree-bin-loader.js", "lib/potree-node-source.js", "utils/parse-version.js", "potree-source.js"],
+  "sourcesContent": ["export { PotreeLoader } from \"./potree-loader.js\";\nexport { PotreeHierarchyChunkLoader } from \"./potree-hierarchy-chunk-loader.js\";\nexport { PotreeBinLoader } from \"./potree-bin-loader.js\";\nexport { PotreeSource } from \"./potree-source.js\";\n", "// loaders.gl\n// SPDX-License-Identifier: MIT\n// Copyright vis.gl contributors\n// __VERSION__ is injected by babel-plugin-version-inline\n// @ts-ignore TS2304: Cannot find name '__VERSION__'.\nconst VERSION = typeof \"4.3.0-alpha.5\" !== 'undefined' ? \"4.3.0-alpha.5\" : 'latest';\n/** Potree loader */\nexport const PotreeLoader = {\n    dataType: null,\n    batchType: null,\n    name: 'potree metadata',\n    id: 'potree',\n    module: 'potree',\n    version: VERSION,\n    extensions: ['js'],\n    mimeTypes: ['application/json'],\n    testText: (text) => text.indexOf('octreeDir') >= 0,\n    parse: (data) => JSON.parse(new TextDecoder().decode(data)),\n    parseTextSync: (text) => JSON.parse(text),\n    options: {\n        potree: {}\n    }\n};\n", "// This file is derived from the Cesium code base under BSD 2-clause license\n// See LICENSE.md and https://github.com/potree/potree/blob/develop/LICENSE\n/**\n * load hierarchy\n * @param arrayBuffer - binary index data\n * @returns root node\n **/\nexport function parsePotreeHierarchyChunk(arrayBuffer) {\n    const tileHeaders = parseBinaryChunk(arrayBuffer);\n    return buildHierarchy(tileHeaders);\n}\n/**\n * Parses the binary rows\n * @param arrayBuffer - binary index data to parse\n * @param byteOffset - byte offset to start from\n * @returns flat nodes array\n * */\nfunction parseBinaryChunk(arrayBuffer, byteOffset = 0) {\n    const dataView = new DataView(arrayBuffer);\n    const stack = [];\n    // Get root mask\n    // @ts-expect-error\n    const topTileHeader = {};\n    byteOffset = decodeRow(dataView, byteOffset, topTileHeader);\n    stack.push(topTileHeader);\n    const tileHeaders = [topTileHeader];\n    while (stack.length > 0) {\n        const snode = stack.shift();\n        let mask = 1;\n        for (let i = 0; i < 8; i++) {\n            if (snode && (snode.header.childMask & mask) !== 0) {\n                // @ts-expect-error\n                const tileHeader = {};\n                byteOffset = decodeRow(dataView, byteOffset, tileHeader);\n                tileHeader.name = snode.name + i;\n                stack.push(tileHeader);\n                tileHeaders.push(tileHeader);\n                snode.header.childCount++;\n            }\n            mask = mask * 2;\n        }\n        if (byteOffset === dataView.byteLength) {\n            break;\n        }\n    }\n    return tileHeaders;\n}\n/**\n * Reads next row from binary index file\n * @param dataView - index data\n * @param byteOffset - current offset in the index data\n * @param tileHeader - container to read to\n * @returns new offset\n */\nfunction decodeRow(dataView, byteOffset, tileHeader) {\n    tileHeader.header = tileHeader.header || {};\n    tileHeader.header.childMask = dataView.getUint8(byteOffset);\n    tileHeader.header.childCount = 0;\n    tileHeader.pointCount = dataView.getUint32(byteOffset + 1, true);\n    tileHeader.name = '';\n    byteOffset += 5;\n    return byteOffset;\n}\n/** Resolves the binary rows into a hierarchy (tree structure) */\nfunction buildHierarchy(flatNodes, options = {}) {\n    const DEFAULT_OPTIONS = { spacing: 100 }; // TODO assert instead of default?\n    options = { ...DEFAULT_OPTIONS, ...options };\n    const topNode = flatNodes[0];\n    const nodes = {};\n    for (const node of flatNodes) {\n        const { name } = node;\n        const index = parseInt(name.charAt(name.length - 1), 10);\n        const parentName = name.substring(0, name.length - 1);\n        const parentNode = nodes[parentName];\n        const level = name.length - 1;\n        // assert(parentNode && level >= 0);\n        node.level = level;\n        node.hasChildren = Boolean(node.header.childCount);\n        node.children = [];\n        node.childrenByIndex = new Array(8).fill(null);\n        node.spacing = (options?.spacing || 0) / Math.pow(2, level);\n        // tileHeader.boundingVolume = Utils.createChildAABB(parentNode.boundingBox, index);\n        if (parentNode) {\n            parentNode.children.push(node);\n            parentNode.childrenByIndex[index] = node;\n        }\n        // Add the node to the map\n        nodes[name] = node;\n    }\n    // First node is the root\n    return topNode;\n}\n", "// loaders.gl\n// SPDX-License-Identifier: MIT\n// Copyright vis.gl contributors\nimport { parsePotreeHierarchyChunk } from \"./parsers/parse-potree-hierarchy-chunk.js\";\n// __VERSION__ is injected by babel-plugin-version-inline\n// @ts-ignore TS2304: Cannot find name '__VERSION__'.\nconst VERSION = typeof \"4.3.0-alpha.5\" !== 'undefined' ? \"4.3.0-alpha.5\" : 'latest';\n/** Potree hierarchy chunk loader */\nexport const PotreeHierarchyChunkLoader = {\n    dataType: null,\n    batchType: null,\n    name: 'potree Hierarchy Chunk',\n    id: 'potree-hrc',\n    module: 'potree',\n    version: VERSION,\n    extensions: ['hrc'],\n    mimeTypes: ['application/octet-stream'],\n    // binary potree files have no header bytes, no content test function possible\n    // test: ['...'],\n    parse: async (arrayBuffer, options) => parsePotreeHierarchyChunk(arrayBuffer),\n    parseSync: (arrayBuffer, options) => parsePotreeHierarchyChunk(arrayBuffer),\n    options: {\n        potree: {}\n    },\n    binary: true\n};\n", "export function parsePotreeBin(arrayBuffer, byteOffset, options, index) {\n    return null;\n}\n", "// loaders.gl\n// SPDX-License-Identifier: MIT\n// Copyright vis.gl contributors\nimport { parsePotreeBin } from \"./parsers/parse-potree-bin.js\";\n/**\n * Loader for potree Binary Point Attributes\n * */\nexport const PotreeBinLoader = {\n    dataType: null,\n    batchType: null,\n    name: 'potree Binary Point Attributes',\n    id: 'potree',\n    extensions: ['bin'],\n    mimeTypes: ['application/octet-stream'],\n    // Unfortunately binary potree files have no header bytes, no test possible\n    // test: ['...'],\n    parseSync,\n    binary: true,\n    options: {}\n    // @ts-ignore\n};\nfunction parseSync(arrayBuffer, options) {\n    const index = {};\n    const byteOffset = 0;\n    parsePotreeBin(arrayBuffer, byteOffset, options, index);\n    return index;\n}\n", "// loaders.gl\n// SPDX-License-Identifier: MIT\n// Copyright (c) vis.gl contributors\nimport { load } from '@loaders.gl/core';\nimport { DataSource, resolvePath } from '@loaders.gl/loader-utils';\nimport { LASLoader } from '@loaders.gl/las';\nimport { PotreeHierarchyChunkLoader } from \"../potree-hierarchy-chunk-loader.js\";\nimport { PotreeLoader } from \"../potree-loader.js\";\nimport { parseVersion } from \"../utils/parse-version.js\";\n/**\n * A Potree data source\n * @version 1.0 - https://github.com/potree/potree/blob/1.0RC/docs/file_format.md\n * @version 1.7 - https://github.com/potree/potree/blob/1.7/docs/potree-file-format.md\n * @note Point cloud nodes tile source\n */\nexport class PotreeNodesSource extends DataSource {\n    /** Dataset base URL */\n    baseUrl = '';\n    /** Input data: string - dataset url, blob - single file data */\n    data;\n    /** Input props */\n    props;\n    /** Meta information from `cloud.js` */\n    metadata = null;\n    /** Root node */\n    root = null;\n    /** Is data source ready to use after initial loading */\n    isReady = false;\n    initPromise = null;\n    /**\n     * @constructor\n     * @param data  - if string - data set path url or path to `cloud.js` metadata file\n     *              - if Blob - single file data\n     * @param props - data source properties\n     */\n    constructor(data, props) {\n        super(props);\n        this.props = props;\n        this.data = data;\n        this.makeBaseUrl(this.data);\n        this.initPromise = this.init();\n    }\n    /** Initial data source loading */\n    async init() {\n        if (this.initPromise) {\n            await this.initPromise;\n            return;\n        }\n        this.metadata = await load(`${this.baseUrl}/cloud.js`, PotreeLoader);\n        await this.loadHierarchy();\n        this.isReady = true;\n    }\n    /** Is data set supported */\n    isSupported() {\n        const { minor, major } = parseVersion(this.metadata?.version ?? '');\n        return (this.isReady &&\n            major === 1 &&\n            minor < 2 &&\n            typeof this.metadata?.pointAttributes === 'string' &&\n            ['LAS', 'LAZ'].includes(this.metadata?.pointAttributes));\n    }\n    /** Get content files extension */\n    getContentExtension() {\n        if (!this.isReady) {\n            return null;\n        }\n        switch (this.metadata?.pointAttributes) {\n            case 'LAS':\n                return 'las';\n            case 'LAZ':\n                return 'laz';\n            default:\n                return 'bin';\n        }\n    }\n    /**\n     * Load octree node content\n     * @param path array of numbers between 0-7 specifying successive octree divisions.\n     * @return node content geometry or null if the node doesn't exist\n     */\n    async loadNodeContent(path) {\n        await this.initPromise;\n        if (!this.isSupported()) {\n            return null;\n        }\n        const isAvailable = await this.isNodeAvailable(path);\n        if (isAvailable) {\n            return load(`${this.baseUrl}/${this.metadata\n                ?.octreeDir}/r/r${path.join()}.${this.getContentExtension()}`, LASLoader);\n        }\n        return null;\n    }\n    /**\n     * Check if a node exists in the octree\n     * @param path array of numbers between 0-7 specifying successive octree divisions\n     * @returns true - the node does exist, false - the nodes doesn't exist\n     */\n    async isNodeAvailable(path) {\n        if (this.metadata?.hierarchy) {\n            return this.metadata.hierarchy.findIndex((item) => item[0] === `r${path.join()}`) !== -1;\n        }\n        if (!this.root) {\n            return false;\n        }\n        let currentParent = this.root;\n        let name = '';\n        let result = true;\n        for (const nodeLevel of path) {\n            const newName = `${name}${nodeLevel}`;\n            const node = currentParent.children.find((child) => child.name === newName);\n            if (node) {\n                currentParent = node;\n                name = newName;\n            }\n            else {\n                result = false;\n                break;\n            }\n        }\n        return result;\n    }\n    /**\n     * Load data source hierarchy into tree of available nodes\n     */\n    async loadHierarchy() {\n        this.root = await load(`${this.baseUrl}/${this.metadata?.octreeDir}/r/r.hrc`, PotreeHierarchyChunkLoader);\n    }\n    /**\n     * Deduce base url from the input url sring\n     * @param data - data source input data\n     */\n    makeBaseUrl(data) {\n        this.baseUrl = typeof data === 'string' ? resolvePath(data) : '';\n        if (this.baseUrl.endsWith('cloud.js')) {\n            this.baseUrl = this.baseUrl.substring(0, -8);\n        }\n        if (this.baseUrl.endsWith('/')) {\n            this.baseUrl = this.baseUrl.substring(0, -1);\n        }\n    }\n}\n", "// loaders.gl\n// SPDX-License-Identifier: MIT\n// Copyright (c) vis.gl contributors\nexport function parseVersion(version) {\n    const parts = version.split('.').map(Number);\n    return { major: parts[0], minor: parts[1] };\n}\n", "// loaders.gl\n// SPDX-License-Identifier: MIT\n// Copyright (c) vis.gl contributors\nimport { PotreeNodesSource } from \"./lib/potree-node-source.js\";\nconst VERSION = '1.7';\n/**\n * Creates point cloud data sources for Potree urls\n */\nexport const PotreeSource = {\n    name: 'Potree',\n    id: 'potree',\n    module: 'potree',\n    version: VERSION,\n    extensions: ['bin', 'las', 'laz'],\n    mimeTypes: ['application/octet-stream'],\n    options: { url: undefined, potree: {} },\n    type: 'potree',\n    fromUrl: true,\n    fromBlob: true,\n    testURL: (url) => url.endsWith('.js'),\n    createDataSource: (url, props) => new PotreeNodesSource(url, props)\n};\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;ACKA,IAAM,UAAU,OAAyC,kBAAkB;AAEpE,IAAM,eAAe;AAAA,EACxB,UAAU;AAAA,EACV,WAAW;AAAA,EACX,MAAM;AAAA,EACN,IAAI;AAAA,EACJ,QAAQ;AAAA,EACR,SAAS;AAAA,EACT,YAAY,CAAC,IAAI;AAAA,EACjB,WAAW,CAAC,kBAAkB;AAAA,EAC9B,UAAU,CAAC,SAAS,KAAK,QAAQ,WAAW,KAAK;AAAA,EACjD,OAAO,CAAC,SAAS,KAAK,MAAM,IAAI,YAAY,EAAE,OAAO,IAAI,CAAC;AAAA,EAC1D,eAAe,CAAC,SAAS,KAAK,MAAM,IAAI;AAAA,EACxC,SAAS;AAAA,IACL,QAAQ,CAAC;AAAA,EACb;AACJ;;;ACfO,SAAS,0BAA0B,aAAa;AACnD,QAAM,cAAc,iBAAiB,WAAW;AAChD,SAAO,eAAe,WAAW;AACrC;AAOA,SAAS,iBAAiB,aAAa,aAAa,GAAG;AACnD,QAAM,WAAW,IAAI,SAAS,WAAW;AACzC,QAAM,QAAQ,CAAC;AAGf,QAAM,gBAAgB,CAAC;AACvB,eAAa,UAAU,UAAU,YAAY,aAAa;AAC1D,QAAM,KAAK,aAAa;AACxB,QAAM,cAAc,CAAC,aAAa;AAClC,SAAO,MAAM,SAAS,GAAG;AACrB,UAAM,QAAQ,MAAM,MAAM;AAC1B,QAAI,OAAO;AACX,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AACxB,UAAI,UAAU,MAAM,OAAO,YAAY,UAAU,GAAG;AAEhD,cAAM,aAAa,CAAC;AACpB,qBAAa,UAAU,UAAU,YAAY,UAAU;AACvD,mBAAW,OAAO,MAAM,OAAO;AAC/B,cAAM,KAAK,UAAU;AACrB,oBAAY,KAAK,UAAU;AAC3B,cAAM,OAAO;AAAA,MACjB;AACA,aAAO,OAAO;AAAA,IAClB;AACA,QAAI,eAAe,SAAS,YAAY;AACpC;AAAA,IACJ;AAAA,EACJ;AACA,SAAO;AACX;AAQA,SAAS,UAAU,UAAU,YAAY,YAAY;AACjD,aAAW,SAAS,WAAW,UAAU,CAAC;AAC1C,aAAW,OAAO,YAAY,SAAS,SAAS,UAAU;AAC1D,aAAW,OAAO,aAAa;AAC/B,aAAW,aAAa,SAAS,UAAU,aAAa,GAAG,IAAI;AAC/D,aAAW,OAAO;AAClB,gBAAc;AACd,SAAO;AACX;AAEA,SAAS,eAAe,WAAW,UAAU,CAAC,GAAG;AAC7C,QAAM,kBAAkB,EAAE,SAAS,IAAI;AACvC,YAAU,EAAE,GAAG,iBAAiB,GAAG,QAAQ;AAC3C,QAAM,UAAU,UAAU,CAAC;AAC3B,QAAM,QAAQ,CAAC;AACf,aAAW,QAAQ,WAAW;AAC1B,UAAM,EAAE,KAAK,IAAI;AACjB,UAAM,QAAQ,SAAS,KAAK,OAAO,KAAK,SAAS,CAAC,GAAG,EAAE;AACvD,UAAM,aAAa,KAAK,UAAU,GAAG,KAAK,SAAS,CAAC;AACpD,UAAM,aAAa,MAAM,UAAU;AACnC,UAAM,QAAQ,KAAK,SAAS;AAE5B,SAAK,QAAQ;AACb,SAAK,cAAc,QAAQ,KAAK,OAAO,UAAU;AACjD,SAAK,WAAW,CAAC;AACjB,SAAK,kBAAkB,IAAI,MAAM,CAAC,EAAE,KAAK,IAAI;AAC7C,SAAK,YAAW,mCAAS,YAAW,KAAK,KAAK,IAAI,GAAG,KAAK;AAE1D,QAAI,YAAY;AACZ,iBAAW,SAAS,KAAK,IAAI;AAC7B,iBAAW,gBAAgB,KAAK,IAAI;AAAA,IACxC;AAEA,UAAM,IAAI,IAAI;AAAA,EAClB;AAEA,SAAO;AACX;;;ACrFA,IAAMA,WAAU,OAAyC,kBAAkB;AAEpE,IAAM,6BAA6B;AAAA,EACtC,UAAU;AAAA,EACV,WAAW;AAAA,EACX,MAAM;AAAA,EACN,IAAI;AAAA,EACJ,QAAQ;AAAA,EACR,SAASA;AAAA,EACT,YAAY,CAAC,KAAK;AAAA,EAClB,WAAW,CAAC,0BAA0B;AAAA;AAAA;AAAA,EAGtC,OAAO,OAAO,aAAa,YAAY,0BAA0B,WAAW;AAAA,EAC5E,WAAW,CAAC,aAAa,YAAY,0BAA0B,WAAW;AAAA,EAC1E,SAAS;AAAA,IACL,QAAQ,CAAC;AAAA,EACb;AAAA,EACA,QAAQ;AACZ;;;ACzBO,SAAS,eAAe,aAAa,YAAY,SAAS,OAAO;AACpE,SAAO;AACX;;;ACKO,IAAM,kBAAkB;AAAA,EAC3B,UAAU;AAAA,EACV,WAAW;AAAA,EACX,MAAM;AAAA,EACN,IAAI;AAAA,EACJ,YAAY,CAAC,KAAK;AAAA,EAClB,WAAW,CAAC,0BAA0B;AAAA;AAAA;AAAA,EAGtC;AAAA,EACA,QAAQ;AAAA,EACR,SAAS,CAAC;AAAA;AAEd;AACA,SAAS,UAAU,aAAa,SAAS;AACrC,QAAM,QAAQ,CAAC;AACf,QAAM,aAAa;AACnB,iBAAe,aAAa,YAAY,SAAS,KAAK;AACtD,SAAO;AACX;;;ACvBA,kBAAqB;AACrB,0BAAwC;AACxC,iBAA0B;;;ACFnB,SAAS,aAAa,SAAS;AAClC,QAAM,QAAQ,QAAQ,MAAM,GAAG,EAAE,IAAI,MAAM;AAC3C,SAAO,EAAE,OAAO,MAAM,CAAC,GAAG,OAAO,MAAM,CAAC,EAAE;AAC9C;;;ADSO,IAAM,oBAAN,cAAgC,+BAAW;AAAA;AAAA,EAE9C,UAAU;AAAA;AAAA,EAEV;AAAA;AAAA,EAEA;AAAA;AAAA,EAEA,WAAW;AAAA;AAAA,EAEX,OAAO;AAAA;AAAA,EAEP,UAAU;AAAA,EACV,cAAc;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOd,YAAY,MAAM,OAAO;AACrB,UAAM,KAAK;AACX,SAAK,QAAQ;AACb,SAAK,OAAO;AACZ,SAAK,YAAY,KAAK,IAAI;AAC1B,SAAK,cAAc,KAAK,KAAK;AAAA,EACjC;AAAA;AAAA,EAEA,MAAM,OAAO;AACT,QAAI,KAAK,aAAa;AAClB,YAAM,KAAK;AACX;AAAA,IACJ;AACA,SAAK,WAAW,UAAM,kBAAK,GAAG,KAAK,oBAAoB,YAAY;AACnE,UAAM,KAAK,cAAc;AACzB,SAAK,UAAU;AAAA,EACnB;AAAA;AAAA,EAEA,cAAc;AArDlB;AAsDQ,UAAM,EAAE,OAAO,MAAM,IAAI,eAAa,UAAK,aAAL,mBAAe,YAAW,EAAE;AAClE,WAAQ,KAAK,WACT,UAAU,KACV,QAAQ,KACR,SAAO,UAAK,aAAL,mBAAe,qBAAoB,YAC1C,CAAC,OAAO,KAAK,EAAE,UAAS,UAAK,aAAL,mBAAe,eAAe;AAAA,EAC9D;AAAA;AAAA,EAEA,sBAAsB;AA9D1B;AA+DQ,QAAI,CAAC,KAAK,SAAS;AACf,aAAO;AAAA,IACX;AACA,aAAQ,UAAK,aAAL,mBAAe,iBAAiB;AAAA,MACpC,KAAK;AACD,eAAO;AAAA,MACX,KAAK;AACD,eAAO;AAAA,MACX;AACI,eAAO;AAAA,IACf;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,gBAAgB,MAAM;AAhFhC;AAiFQ,UAAM,KAAK;AACX,QAAI,CAAC,KAAK,YAAY,GAAG;AACrB,aAAO;AAAA,IACX;AACA,UAAM,cAAc,MAAM,KAAK,gBAAgB,IAAI;AACnD,QAAI,aAAa;AACb,iBAAO,kBAAK,GAAG,KAAK,YAAW,UAAK,aAAL,mBACzB,gBAAgB,KAAK,KAAK,KAAK,KAAK,oBAAoB,KAAK,oBAAS;AAAA,IAChF;AACA,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,gBAAgB,MAAM;AAjGhC;AAkGQ,SAAI,UAAK,aAAL,mBAAe,WAAW;AAC1B,aAAO,KAAK,SAAS,UAAU,UAAU,CAAC,SAAS,KAAK,CAAC,MAAM,IAAI,KAAK,KAAK,GAAG,MAAM;AAAA,IAC1F;AACA,QAAI,CAAC,KAAK,MAAM;AACZ,aAAO;AAAA,IACX;AACA,QAAI,gBAAgB,KAAK;AACzB,QAAI,OAAO;AACX,QAAI,SAAS;AACb,eAAW,aAAa,MAAM;AAC1B,YAAM,UAAU,GAAG,OAAO;AAC1B,YAAM,OAAO,cAAc,SAAS,KAAK,CAAC,UAAU,MAAM,SAAS,OAAO;AAC1E,UAAI,MAAM;AACN,wBAAgB;AAChB,eAAO;AAAA,MACX,OACK;AACD,iBAAS;AACT;AAAA,MACJ;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA,EAIA,MAAM,gBAAgB;AA5H1B;AA6HQ,SAAK,OAAO,UAAM,kBAAK,GAAG,KAAK,YAAW,UAAK,aAAL,mBAAe,qBAAqB,0BAA0B;AAAA,EAC5G;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,YAAY,MAAM;AACd,SAAK,UAAU,OAAO,SAAS,eAAW,iCAAY,IAAI,IAAI;AAC9D,QAAI,KAAK,QAAQ,SAAS,UAAU,GAAG;AACnC,WAAK,UAAU,KAAK,QAAQ,UAAU,GAAG,EAAE;AAAA,IAC/C;AACA,QAAI,KAAK,QAAQ,SAAS,GAAG,GAAG;AAC5B,WAAK,UAAU,KAAK,QAAQ,UAAU,GAAG,EAAE;AAAA,IAC/C;AAAA,EACJ;AACJ;;;AExIA,IAAMC,WAAU;AAIT,IAAM,eAAe;AAAA,EACxB,MAAM;AAAA,EACN,IAAI;AAAA,EACJ,QAAQ;AAAA,EACR,SAASA;AAAA,EACT,YAAY,CAAC,OAAO,OAAO,KAAK;AAAA,EAChC,WAAW,CAAC,0BAA0B;AAAA,EACtC,SAAS,EAAE,KAAK,QAAW,QAAQ,CAAC,EAAE;AAAA,EACtC,MAAM;AAAA,EACN,SAAS;AAAA,EACT,UAAU;AAAA,EACV,SAAS,CAAC,QAAQ,IAAI,SAAS,KAAK;AAAA,EACpC,kBAAkB,CAAC,KAAK,UAAU,IAAI,kBAAkB,KAAK,KAAK;AACtE;",
+  "names": ["VERSION", "VERSION"]
 }

package/dist/index.d.ts

@@ -1,4 +1,5 @@
 export { PotreeLoader } from "./potree-loader.js";
 export { PotreeHierarchyChunkLoader } from "./potree-hierarchy-chunk-loader.js";
 export { PotreeBinLoader } from "./potree-bin-loader.js";
+export { PotreeSource } from "./potree-source.js";
 //# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,YAAY,EAAC,2BAAwB;AAC7C,OAAO,EAAC,0BAA0B,EAAC,2CAAwC;AAC3E,OAAO,EAAC,eAAe,EAAC,+BAA4B"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,YAAY,EAAC,2BAAwB;AAC7C,OAAO,EAAC,0BAA0B,EAAC,2CAAwC;AAC3E,OAAO,EAAC,eAAe,EAAC,+BAA4B;AACpD,OAAO,EAAC,YAAY,EAAC,2BAAwB"}

package/dist/index.js

@@ -1,3 +1,4 @@
 export { PotreeLoader } from "./potree-loader.js";
 export { PotreeHierarchyChunkLoader } from "./potree-hierarchy-chunk-loader.js";
 export { PotreeBinLoader } from "./potree-bin-loader.js";
+export { PotreeSource } from "./potree-source.js";

package/dist/lib/potree-node-source.d.ts

@@ -47,16 +47,16 @@ export declare class PotreeNodesSource extends DataSource {
      * @return node content geometry or null if the node doesn't exist
      */
     loadNodeContent(path: number[]): Promise<MeshGeometry | null>;
-    /**
-     * Load data source hierarchy into tree of available nodes
-     */
-    loadHierarchy(): Promise<void>;
     /**
      * Check if a node exists in the octree
      * @param path array of numbers between 0-7 specifying successive octree divisions
      * @returns true - the node does exist, false - the nodes doesn't exist
      */
     isNodeAvailable(path: number[]): Promise<boolean>;
+    /**
+     * Load data source hierarchy into tree of available nodes
+     */
+    private loadHierarchy;
     /**
      * Deduce base url from the input url sring
      * @param data - data source input data

package/dist/lib/potree-node-source.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"potree-node-source.d.ts","sourceRoot":"","sources":["../../src/lib/potree-node-source.ts"],"names":[],"mappings":"AAKA,OAAO,EAAC,YAAY,EAAC,MAAM,oBAAoB,CAAC;AAChD,OAAO,EAAC,UAAU,EAAE,eAAe,EAAE,aAAa,EAAc,MAAM,0BAA0B,CAAC;AAEjG,OAAO,EAAC,cAAc,EAAC,oCAAiC;AACxD,OAAO,EAAC,UAAU,EAAC,mDAAgD;AAKnE,MAAM,MAAM,sBAAsB,GAAG,eAAe,GAAG;IACrD,YAAY,CAAC,EAAE,MAAM,EAAE,CAAC;IACxB,MAAM,CAAC,EAAE;QACP,WAAW,CAAC,EAAE,aAAa,CAAC;KAE7B,CAAC;CACH,CAAC;AAEF;;;;;GAKG;AACH,qBAAa,iBAAkB,SAAQ,UAAU;IAC/C,uBAAuB;IACvB,OAAO,EAAE,MAAM,CAAM;IACrB,gEAAgE;IAChE,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;IACpB,kBAAkB;IAClB,KAAK,EAAE,sBAAsB,CAAC;IAC9B,uCAAuC;IACvC,QAAQ,EAAE,cAAc,GAAG,IAAI,CAAQ;IACvC,gBAAgB;IAChB,IAAI,EAAE,UAAU,GAAG,IAAI,CAAQ;IAC/B,wDAAwD;IACxD,OAAO,UAAS;IAEhB,OAAO,CAAC,WAAW,CAA8B;IAEjD;;;;;OAKG;gBACS,IAAI,EAAE,MAAM,GAAG,IAAI,EAAE,KAAK,EAAE,sBAAsB;IAS9D,kCAAkC;IAC5B,IAAI;IAMV,4BAA4B;IAC5B,WAAW,IAAI,OAAO;IAWtB,kCAAkC;IAClC,mBAAmB,IAAI,MAAM,GAAG,IAAI;IAcpC;;;;OAIG;IACG,eAAe,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,YAAY,GAAG,IAAI,CAAC;IAkBnE;;OAEG;IACG,aAAa,IAAI,OAAO,CAAC,IAAI,CAAC;IAQpC;;;;OAIG;IACG,eAAe,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,OAAO,CAAC;IAyBvD;;;OAGG;IACH,OAAO,CAAC,WAAW;CASpB"}
+{"version":3,"file":"potree-node-source.d.ts","sourceRoot":"","sources":["../../src/lib/potree-node-source.ts"],"names":[],"mappings":"AAKA,OAAO,EAAC,YAAY,EAAC,MAAM,oBAAoB,CAAC;AAChD,OAAO,EAAC,UAAU,EAAE,eAAe,EAAE,aAAa,EAAc,MAAM,0BAA0B,CAAC;AAEjG,OAAO,EAAC,cAAc,EAAC,oCAAiC;AACxD,OAAO,EAAC,UAAU,EAAC,mDAAgD;AAKnE,MAAM,MAAM,sBAAsB,GAAG,eAAe,GAAG;IACrD,YAAY,CAAC,EAAE,MAAM,EAAE,CAAC;IACxB,MAAM,CAAC,EAAE;QACP,WAAW,CAAC,EAAE,aAAa,CAAC;KAE7B,CAAC;CACH,CAAC;AAEF;;;;;GAKG;AACH,qBAAa,iBAAkB,SAAQ,UAAU;IAC/C,uBAAuB;IACvB,OAAO,EAAE,MAAM,CAAM;IACrB,gEAAgE;IAChE,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;IACpB,kBAAkB;IAClB,KAAK,EAAE,sBAAsB,CAAC;IAC9B,uCAAuC;IACvC,QAAQ,EAAE,cAAc,GAAG,IAAI,CAAQ;IACvC,gBAAgB;IAChB,IAAI,EAAE,UAAU,GAAG,IAAI,CAAQ;IAC/B,wDAAwD;IACxD,OAAO,UAAS;IAEhB,OAAO,CAAC,WAAW,CAA8B;IAEjD;;;;;OAKG;gBACS,IAAI,EAAE,MAAM,GAAG,IAAI,EAAE,KAAK,EAAE,sBAAsB;IAS9D,kCAAkC;IAC5B,IAAI;IAUV,4BAA4B;IAC5B,WAAW,IAAI,OAAO;IAWtB,kCAAkC;IAClC,mBAAmB,IAAI,MAAM,GAAG,IAAI;IAcpC;;;;OAIG;IACG,eAAe,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,YAAY,GAAG,IAAI,CAAC;IAkBnE;;;;OAIG;IACG,eAAe,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,OAAO,CAAC;IAyBvD;;OAEG;YACW,aAAa;IAO3B;;;OAGG;IACH,OAAO,CAAC,WAAW;CASpB"}

package/dist/lib/potree-node-source.js

@@ -42,6 +42,10 @@ export class PotreeNodesSource extends DataSource {
     }
     /** Initial data source loading */
     async init() {
+        if (this.initPromise) {
+            await this.initPromise;
+            return;
+        }
         this.metadata = await load(`${this.baseUrl}/cloud.js`, PotreeLoader);
         await this.loadHierarchy();
         this.isReady = true;
@@ -86,13 +90,6 @@ export class PotreeNodesSource extends DataSource {
         }
         return null;
     }
-    /**
-     * Load data source hierarchy into tree of available nodes
-     */
-    async loadHierarchy() {
-        await this.initPromise;
-        this.root = await load(`${this.baseUrl}/${this.metadata?.octreeDir}/r/r.hrc`, PotreeHierarchyChunkLoader);
-    }
     /**
      * Check if a node exists in the octree
      * @param path array of numbers between 0-7 specifying successive octree divisions
@@ -122,6 +119,12 @@ export class PotreeNodesSource extends DataSource {
         }
         return result;
     }
+    /**
+     * Load data source hierarchy into tree of available nodes
+     */
+    async loadHierarchy() {
+        this.root = await load(`${this.baseUrl}/${this.metadata?.octreeDir}/r/r.hrc`, PotreeHierarchyChunkLoader);
+    }
     /**
      * Deduce base url from the input url sring
      * @param data - data source input data

package/dist/parsers/parse-potree-hierarchy-chunk.d.ts

@@ -1,16 +1,35 @@
-/** @todo these types are an incorrect mess */
+/** Node metadata from index file */
 export type POTreeTileHeader = {
+    /** Number of child nodes */
     childCount: number;
+    /** Human readable name */
     name: string;
+    /** Child availability mask */
     childMask: number;
 };
-/** @todo these types are an incorrect mess */
+/** Hierarchical potree node structure */
 export type POTreeNode = {
+    /** Index data */
     header: POTreeTileHeader;
+    /** Human readable name */
     name: string;
+    /** Number of points */
     pointCount: number;
+    /** Node's level in the tree */
+    level: number;
+    /** Has children */
+    hasChildren: boolean;
+    /** Space between points */
+    spacing: number;
+    /** Available children */
     children: POTreeNode[];
+    /** All children including unavailable */
     childrenByIndex: POTreeNode[];
 };
+/**
+ * load hierarchy
+ * @param arrayBuffer - binary index data
+ * @returns root node
+ **/
 export declare function parsePotreeHierarchyChunk(arrayBuffer: ArrayBuffer): POTreeNode;
 //# sourceMappingURL=parse-potree-hierarchy-chunk.d.ts.map

package/dist/parsers/parse-potree-hierarchy-chunk.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"parse-potree-hierarchy-chunk.d.ts","sourceRoot":"","sources":["../../src/parsers/parse-potree-hierarchy-chunk.ts"],"names":[],"mappings":"AAwDA,8CAA8C;AAC9C,MAAM,MAAM,gBAAgB,GAAG;IAC7B,UAAU,EAAE,MAAM,CAAC;IACnB,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,MAAM,CAAC;CACnB,CAAC;AAEF,8CAA8C;AAC9C,MAAM,MAAM,UAAU,GAAG;IACvB,MAAM,EAAE,gBAAgB,CAAC;IACzB,IAAI,EAAE,MAAM,CAAC;IACb,UAAU,EAAE,MAAM,CAAC;IACnB,QAAQ,EAAE,UAAU,EAAE,CAAC;IACvB,eAAe,EAAE,UAAU,EAAE,CAAC;CAC/B,CAAC;AAKF,wBAAgB,yBAAyB,CAAC,WAAW,EAAE,WAAW,cAGjE"}
+{"version":3,"file":"parse-potree-hierarchy-chunk.d.ts","sourceRoot":"","sources":["../../src/parsers/parse-potree-hierarchy-chunk.ts"],"names":[],"mappings":"AAwDA,oCAAoC;AACpC,MAAM,MAAM,gBAAgB,GAAG;IAC7B,4BAA4B;IAC5B,UAAU,EAAE,MAAM,CAAC;IACnB,0BAA0B;IAC1B,IAAI,EAAE,MAAM,CAAC;IACb,8BAA8B;IAC9B,SAAS,EAAE,MAAM,CAAC;CACnB,CAAC;AAEF,yCAAyC;AACzC,MAAM,MAAM,UAAU,GAAG;IACvB,iBAAiB;IACjB,MAAM,EAAE,gBAAgB,CAAC;IACzB,0BAA0B;IAC1B,IAAI,EAAE,MAAM,CAAC;IACb,uBAAuB;IACvB,UAAU,EAAE,MAAM,CAAC;IACnB,+BAA+B;IAC/B,KAAK,EAAE,MAAM,CAAC;IACd,mBAAmB;IACnB,WAAW,EAAE,OAAO,CAAC;IACrB,2BAA2B;IAC3B,OAAO,EAAE,MAAM,CAAC;IAChB,yBAAyB;IACzB,QAAQ,EAAE,UAAU,EAAE,CAAC;IACvB,yCAAyC;IACzC,eAAe,EAAE,UAAU,EAAE,CAAC;CAC/B,CAAC;AAEF;;;;IAII;AACJ,wBAAgB,yBAAyB,CAAC,WAAW,EAAE,WAAW,GAAG,UAAU,CAG9E"}

package/dist/parsers/parse-potree-hierarchy-chunk.js

@@ -1,12 +1,20 @@
 // This file is derived from the Cesium code base under BSD 2-clause license
 // See LICENSE.md and https://github.com/potree/potree/blob/develop/LICENSE
-// type POTreeTileNode = POTreeNode;
-// load hierarchy
+/**
+ * load hierarchy
+ * @param arrayBuffer - binary index data
+ * @returns root node
+ **/
 export function parsePotreeHierarchyChunk(arrayBuffer) {
     const tileHeaders = parseBinaryChunk(arrayBuffer);
     return buildHierarchy(tileHeaders);
 }
-// Parses the binary rows
+/**
+ * Parses the binary rows
+ * @param arrayBuffer - binary index data to parse
+ * @param byteOffset - byte offset to start from
+ * @returns flat nodes array
+ * */
 function parseBinaryChunk(arrayBuffer, byteOffset = 0) {
     const dataView = new DataView(arrayBuffer);
     const stack = [];
@@ -15,7 +23,7 @@ function parseBinaryChunk(arrayBuffer, byteOffset = 0) {
     const topTileHeader = {};
     byteOffset = decodeRow(dataView, byteOffset, topTileHeader);
     stack.push(topTileHeader);
-    const tileHeaders = [];
+    const tileHeaders = [topTileHeader];
     while (stack.length > 0) {
         const snode = stack.shift();
         let mask = 1;
@@ -25,7 +33,6 @@ function parseBinaryChunk(arrayBuffer, byteOffset = 0) {
                 const tileHeader = {};
                 byteOffset = decodeRow(dataView, byteOffset, tileHeader);
                 tileHeader.name = snode.name + i;
-                // @ts-expect-error
                 stack.push(tileHeader);
                 tileHeaders.push(tileHeader);
                 snode.header.childCount++;
@@ -38,6 +45,13 @@ function parseBinaryChunk(arrayBuffer, byteOffset = 0) {
     }
     return tileHeaders;
 }
+/**
+ * Reads next row from binary index file
+ * @param dataView - index data
+ * @param byteOffset - current offset in the index data
+ * @param tileHeader - container to read to
+ * @returns new offset
+ */
 function decodeRow(dataView, byteOffset, tileHeader) {
     tileHeader.header = tileHeader.header || {};
     tileHeader.header.childMask = dataView.getUint8(byteOffset);
@@ -47,31 +61,31 @@ function decodeRow(dataView, byteOffset, tileHeader) {
     byteOffset += 5;
     return byteOffset;
 }
-// Resolves the binary rows into a hierarchy (tree structure)
-function buildHierarchy(tileHeaders, options = {}) {
+/** Resolves the binary rows into a hierarchy (tree structure) */
+function buildHierarchy(flatNodes, options = {}) {
     const DEFAULT_OPTIONS = { spacing: 100 }; // TODO assert instead of default?
     options = { ...DEFAULT_OPTIONS, ...options };
-    const topNode = tileHeaders[0];
+    const topNode = flatNodes[0];
     const nodes = {};
-    for (const tileHeader of tileHeaders) {
-        const { name } = tileHeader;
+    for (const node of flatNodes) {
+        const { name } = node;
         const index = parseInt(name.charAt(name.length - 1), 10);
         const parentName = name.substring(0, name.length - 1);
         const parentNode = nodes[parentName];
         const level = name.length - 1;
         // assert(parentNode && level >= 0);
-        tileHeader.level = level;
-        tileHeader.hasChildren = tileHeader.header.childCount;
-        tileHeader.children = [];
-        tileHeader.childrenByIndex = new Array(8).fill(null);
-        tileHeader.spacing = (options?.spacing || 0) / Math.pow(2, level);
+        node.level = level;
+        node.hasChildren = Boolean(node.header.childCount);
+        node.children = [];
+        node.childrenByIndex = new Array(8).fill(null);
+        node.spacing = (options?.spacing || 0) / Math.pow(2, level);
         // tileHeader.boundingVolume = Utils.createChildAABB(parentNode.boundingBox, index);
         if (parentNode) {
-            parentNode.children.push(tileHeader);
-            parentNode.childrenByIndex[index] = tileHeader;
+            parentNode.children.push(node);
+            parentNode.childrenByIndex[index] = node;
         }
         // Add the node to the map
-        nodes[name] = tileHeader;
+        nodes[name] = node;
     }
     // First node is the root
     return topNode;

package/dist/potree-hierarchy-chunk-loader.js

@@ -4,7 +4,7 @@
 import { parsePotreeHierarchyChunk } from "./parsers/parse-potree-hierarchy-chunk.js";
 // __VERSION__ is injected by babel-plugin-version-inline
 // @ts-ignore TS2304: Cannot find name '__VERSION__'.
-const VERSION = typeof "4.3.0-alpha.4" !== 'undefined' ? "4.3.0-alpha.4" : 'latest';
+const VERSION = typeof "4.3.0-alpha.5" !== 'undefined' ? "4.3.0-alpha.5" : 'latest';
 /** Potree hierarchy chunk loader */
 export const PotreeHierarchyChunkLoader = {
     dataType: null,

package/dist/potree-loader.js

@@ -3,7 +3,7 @@
 // Copyright vis.gl contributors
 // __VERSION__ is injected by babel-plugin-version-inline
 // @ts-ignore TS2304: Cannot find name '__VERSION__'.
-const VERSION = typeof "4.3.0-alpha.4" !== 'undefined' ? "4.3.0-alpha.4" : 'latest';
+const VERSION = typeof "4.3.0-alpha.5" !== 'undefined' ? "4.3.0-alpha.5" : 'latest';
 /** Potree loader */
 export const PotreeLoader = {
     dataType: null,

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@loaders.gl/potree",
-  "version": "4.3.0-alpha.5",
+  "version": "4.3.0-alpha.6",
   "description": "potree loaders for large point clouds.",
   "license": "MIT",
   "type": "module",
@@ -44,13 +44,13 @@
     "build-bundle-dev": "ocular-bundle ./bundle.ts --env=dev --output=dist/dist.dev.js"
   },
   "dependencies": {
-    "@loaders.gl/las": "4.3.0-alpha.5",
-    "@loaders.gl/math": "4.3.0-alpha.5",
-    "@loaders.gl/schema": "4.3.0-alpha.5",
+    "@loaders.gl/las": "4.3.0-alpha.6",
+    "@loaders.gl/math": "4.3.0-alpha.6",
+    "@loaders.gl/schema": "4.3.0-alpha.6",
     "@math.gl/core": "^4.0.0"
   },
   "peerDependencies": {
     "@loaders.gl/core": "^4.0.0"
   },
-  "gitHead": "b57553345b3cbf621c95ad9b22aa672217451f61"
+  "gitHead": "315f2e232fc4e6a477c41de800a54d3e3d957e8c"
 }

package/src/index.ts

@@ -1,3 +1,4 @@
 export {PotreeLoader} from './potree-loader';
 export {PotreeHierarchyChunkLoader} from './potree-hierarchy-chunk-loader';
 export {PotreeBinLoader} from './potree-bin-loader';
+export {PotreeSource} from './potree-source';

package/src/lib/potree-node-source.ts

@@ -59,6 +59,10 @@ export class PotreeNodesSource extends DataSource {
 
   /** Initial data source loading */
   async init() {
+    if (this.initPromise) {
+      await this.initPromise;
+      return;
+    }
     this.metadata = await load(`${this.baseUrl}/cloud.js`, PotreeLoader);
     await this.loadHierarchy();
     this.isReady = true;
@@ -114,17 +118,6 @@ export class PotreeNodesSource extends DataSource {
     return null;
   }
 
-  /**
-   * Load data source hierarchy into tree of available nodes
-   */
-  async loadHierarchy(): Promise<void> {
-    await this.initPromise;
-    this.root = await load(
-      `${this.baseUrl}/${this.metadata?.octreeDir}/r/r.hrc`,
-      PotreeHierarchyChunkLoader
-    );
-  }
-
   /**
    * Check if a node exists in the octree
    * @param path array of numbers between 0-7 specifying successive octree divisions
@@ -155,6 +148,16 @@ export class PotreeNodesSource extends DataSource {
     return result;
   }
 
+  /**
+   * Load data source hierarchy into tree of available nodes
+   */
+  private async loadHierarchy(): Promise<void> {
+    this.root = await load(
+      `${this.baseUrl}/${this.metadata?.octreeDir}/r/r.hrc`,
+      PotreeHierarchyChunkLoader
+    );
+  }
+
   /**
    * Deduce base url from the input url sring
    * @param data - data source input data