@loaders.gl/potree 4.0.0-alpha.8 → 4.0.0-beta.1

package/dist/dist.min.js

@@ -90,7 +90,7 @@
       tileHeader.hasChildren = tileHeader.header.childCount;
       tileHeader.children = [];
       tileHeader.childrenByIndex = new Array(8).fill(null);
-      tileHeader.spacing = options.spacing / Math.pow(2, level);
+      tileHeader.spacing = (options?.spacing || 0) / Math.pow(2, level);
       if (parentNode) {
         parentNode.children.push(tileHeader);
         parentNode.childrenByIndex[index] = tileHeader;
@@ -105,9 +105,6 @@
   });
 
   // src/potree-hierarchy-chunk-loader.ts
-  function parseSync(arrayBuffer) {
-    return parsePotreeHierarchyChunk(arrayBuffer);
-  }
   var PotreeHierarchyChunkLoader;
   var init_potree_hierarchy_chunk_loader = __esm({
     "src/potree-hierarchy-chunk-loader.ts"() {
@@ -117,8 +114,8 @@
         name: "potree Hierarchy Chunk",
         extensions: ["hrc"],
         mimeTypes: ["application/octet-stream"],
-        parse: async (arrayBuffer, options) => await parseSync(arrayBuffer),
-        parseSync,
+        parse: async (arrayBuffer, options) => parsePotreeHierarchyChunk(arrayBuffer),
+        parseSync: (arrayBuffer, options) => parsePotreeHierarchyChunk(arrayBuffer),
         binary: true
       };
     }
@@ -134,7 +131,7 @@
   });
 
   // src/potree-bin-loader.ts
-  function parseSync2(arrayBuffer, options) {
+  function parseSync(arrayBuffer, options) {
     const index = {};
     const byteOffset = 0;
     parsePotreeBin(arrayBuffer, byteOffset, options, index);
@@ -149,7 +146,7 @@
         id: "potree",
         extensions: ["bin"],
         mimeTypes: ["application/octet-stream"],
-        parseSync: parseSync2,
+        parseSync,
         binary: true
       };
     }

package/dist/es5/parsers/parse-potree-bin.js

@@ -3,7 +3,7 @@
 Object.defineProperty(exports, "__esModule", {
   value: true
 });
-exports.default = parsePotreeBin;
+exports.parsePotreeBin = parsePotreeBin;
 function parsePotreeBin(arrayBuffer, byteOffset, options, index) {
   return null;
 }

package/dist/es5/parsers/parse-potree-bin.js.map

@@ -1 +1 @@
-{"version":3,"file":"parse-potree-bin.js","names":["parsePotreeBin","arrayBuffer","byteOffset","options","index"],"sources":["../../../src/parsers/parse-potree-bin.ts"],"sourcesContent":["export default function parsePotreeBin(\n  arrayBuffer: ArrayBuffer,\n  byteOffset: number,\n  options: unknown,\n  index: any\n) {\n  return null;\n}\n"],"mappings":";;;;;;AAAe,SAASA,cAAcA,CACpCC,WAAwB,EACxBC,UAAkB,EAClBC,OAAgB,EAChBC,KAAU,EACV;EACA,OAAO,IAAI;AACb"}
+{"version":3,"file":"parse-potree-bin.js","names":["parsePotreeBin","arrayBuffer","byteOffset","options","index"],"sources":["../../../src/parsers/parse-potree-bin.ts"],"sourcesContent":["export function parsePotreeBin(\n  arrayBuffer: ArrayBuffer,\n  byteOffset: number,\n  options: unknown,\n  index: any\n) {\n  return null;\n}\n"],"mappings":";;;;;;AAAO,SAASA,cAAcA,CAC5BC,WAAwB,EACxBC,UAAkB,EAClBC,OAAgB,EAChBC,KAAU,EACV;EACA,OAAO,IAAI;AACb"}

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

@@ -4,7 +4,7 @@ var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefau
 Object.defineProperty(exports, "__esModule", {
   value: true
 });
-exports.default = parsePotreeHierarchyChunk;
+exports.parsePotreeHierarchyChunk = parsePotreeHierarchyChunk;
 var _defineProperty2 = _interopRequireDefault(require("@babel/runtime/helpers/defineProperty"));
 function _createForOfIteratorHelper(o, allowArrayLike) { var it = typeof Symbol !== "undefined" && o[Symbol.iterator] || o["@@iterator"]; if (!it) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var normalCompletion = true, didErr = false, err; return { s: function s() { it = it.call(o); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it.return != null) it.return(); } finally { if (didErr) throw err; } } }; }
 function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
@@ -64,6 +64,7 @@ function buildHierarchy(tileHeaders) {
     _step;
   try {
     for (_iterator.s(); !(_step = _iterator.n()).done;) {
+      var _options;
       var tileHeader = _step.value;
       var name = tileHeader.name;
       var index = parseInt(name.charAt(name.length - 1), 10);
@@ -74,7 +75,7 @@ function buildHierarchy(tileHeaders) {
       tileHeader.hasChildren = tileHeader.header.childCount;
       tileHeader.children = [];
       tileHeader.childrenByIndex = new Array(8).fill(null);
-      tileHeader.spacing = options.spacing / Math.pow(2, level);
+      tileHeader.spacing = (((_options = options) === null || _options === void 0 ? void 0 : _options.spacing) || 0) / Math.pow(2, level);
       if (parentNode) {
         parentNode.children.push(tileHeader);
         parentNode.childrenByIndex[index] = tileHeader;

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

@@ -1 +1 @@
-{"version":3,"file":"parse-potree-hierarchy-chunk.js","names":["parsePotreeHierarchyChunk","arrayBuffer","tileHeaders","parseBinaryChunk","buildHierarchy","byteOffset","arguments","length","undefined","dataView","DataView","stack","topTileHeader","decodeRow","push","snode","shift","mask","i","header","childMask","tileHeader","name","childCount","byteLength","getUint8","pointCount","getUint32","options","DEFAULT_OPTIONS","spacing","_objectSpread","topNode","nodes","_iterator","_createForOfIteratorHelper","_step","s","n","done","value","index","parseInt","charAt","parentName","substring","parentNode","level","hasChildren","children","childrenByIndex","Array","fill","Math","pow","err","e","f"],"sources":["../../../src/parsers/parse-potree-hierarchy-chunk.ts"],"sourcesContent":["// 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// Potree Hierarchy Chunk file format\n// https://github.com/potree/potree/blob/develop/docs/potree-file-format.md#index-files\n\n/*\n### Hierarchy Chunk Files\n\nAs mentioned in the former section, the `.hrc` files contain the index structure\nmeaning a list of all the files stored within the directory tree.\n\nAn index file contains a list of tuple values with the first being a `uint8`\n\"mask\" and the second being `uint32` \"number of points\" of a hierarchy level\nin a [breadth first level order][breadth-first].\n\nPer hierarchy level we have 8 possible nodes. To indicate whether a node exists\na simple binary mask is used:\n\n| Position | Mask | [Binary][bin] |\n|----------|------|---------------|\n| 0        | 1    | 0b00000001    |\n| 1        | 2    | 0b00000010    |\n| 2        | 4    | 0b00000100    |\n| 3        | 8    | 0b00001000    |\n| 4        | 16   | 0b00010000    |\n| 5        | 32   | 0b00100000    |\n| 6        | 64   | 0b01000000    |\n| 7        | 128  | 0b10000000    |\n\nSo if in a hierarchy the child node 3 and node 7 exist then the hierarchies\nmask has to be `0b00001000 | 0b10000000` → `0b10001000` (=136).\n\n_Example:_ A simple, non-realistic tree:\n\n```\n|- r1\n|  |\n|  \\- r14 (2 Points)\n|\n\\- r3\n   |\n   \\- r36 (1 Point)\n```\n\nWould have an index looking like this:\n\n| name | mask               | points |\n|------|--------------------|--------|\n| r    | `0b00001010` (=10) | `3`    |\n| r1   | `0b00010000` (=16) | `2`    |\n| r3   | `0b01000000` (=64) | `1`    |\n| r14  | `0b00000000` (=0)  | `2`    |\n| r36  | `0b00000000` (=0)  | `1`    |\n*/\n\n// @ts-nocheck\n\n// load hierarchy\nexport default function parsePotreeHierarchyChunk(arrayBuffer: ArrayBuffer) {\n  const tileHeaders = parseBinaryChunk(arrayBuffer);\n  return buildHierarchy(tileHeaders);\n}\n\n// Parses the binary rows\nfunction parseBinaryChunk(arrayBuffer: ArrayBuffer, byteOffset = 0) {\n  const dataView = new DataView(arrayBuffer);\n\n  const stack = [];\n\n  // Get root mask\n  const topTileHeader = {};\n  byteOffset = decodeRow(dataView, byteOffset, topTileHeader);\n\n  stack.push(topTileHeader);\n\n  const tileHeaders = [];\n\n  while (stack.length > 0) {\n    const snode = stack.shift();\n    let mask = 1;\n\n    for (let i = 0; i < 8; i++) {\n      if (snode && (snode.header.childMask & mask) !== 0) {\n        const tileHeader = {};\n        byteOffset = decodeRow(dataView, byteOffset, tileHeader);\n        tileHeader.name = snode.name + i;\n\n        stack.push(tileHeader);\n        tileHeaders.push(tileHeader);\n        snode.header.childCount++;\n      }\n      mask = mask * 2;\n    }\n\n    if (byteOffset === dataView.byteLength) {\n      break;\n    }\n  }\n\n  return tileHeaders;\n}\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\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\n  const topNode = tileHeaders[0];\n  const nodes = {};\n\n  for (const tileHeader of tileHeaders) {\n    const {name} = tileHeader;\n\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\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 / Math.pow(2, level);\n    // tileHeader.boundingVolume = Utils.createChildAABB(parentNode.boundingBox, index);\n\n    if (parentNode) {\n      parentNode.children.push(tileHeader);\n      parentNode.childrenByIndex[index] = tileHeader;\n    }\n\n    // Add the node to the map\n    nodes[name] = tileHeader;\n  }\n\n  // First node is the root\n  return topNode;\n}\n"],"mappings":";;;;;;;;;;;;;AA2De,SAASA,yBAAyBA,CAACC,WAAwB,EAAE;EAC1E,IAAMC,WAAW,GAAGC,gBAAgB,CAACF,WAAW,CAAC;EACjD,OAAOG,cAAc,CAACF,WAAW,CAAC;AACpC;AAGA,SAASC,gBAAgBA,CAACF,WAAwB,EAAkB;EAAA,IAAhBI,UAAU,GAAAC,SAAA,CAAAC,MAAA,QAAAD,SAAA,QAAAE,SAAA,GAAAF,SAAA,MAAG,CAAC;EAChE,IAAMG,QAAQ,GAAG,IAAIC,QAAQ,CAACT,WAAW,CAAC;EAE1C,IAAMU,KAAK,GAAG,EAAE;EAGhB,IAAMC,aAAa,GAAG,CAAC,CAAC;EACxBP,UAAU,GAAGQ,SAAS,CAACJ,QAAQ,EAAEJ,UAAU,EAAEO,aAAa,CAAC;EAE3DD,KAAK,CAACG,IAAI,CAACF,aAAa,CAAC;EAEzB,IAAMV,WAAW,GAAG,EAAE;EAEtB,OAAOS,KAAK,CAACJ,MAAM,GAAG,CAAC,EAAE;IACvB,IAAMQ,KAAK,GAAGJ,KAAK,CAACK,KAAK,CAAC,CAAC;IAC3B,IAAIC,IAAI,GAAG,CAAC;IAEZ,KAAK,IAAIC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG,CAAC,EAAEA,CAAC,EAAE,EAAE;MAC1B,IAAIH,KAAK,IAAI,CAACA,KAAK,CAACI,MAAM,CAACC,SAAS,GAAGH,IAAI,MAAM,CAAC,EAAE;QAClD,IAAMI,UAAU,GAAG,CAAC,CAAC;QACrBhB,UAAU,GAAGQ,SAAS,CAACJ,QAAQ,EAAEJ,UAAU,EAAEgB,UAAU,CAAC;QACxDA,UAAU,CAACC,IAAI,GAAGP,KAAK,CAACO,IAAI,GAAGJ,CAAC;QAEhCP,KAAK,CAACG,IAAI,CAACO,UAAU,CAAC;QACtBnB,WAAW,CAACY,IAAI,CAACO,UAAU,CAAC;QAC5BN,KAAK,CAACI,MAAM,CAACI,UAAU,EAAE;MAC3B;MACAN,IAAI,GAAGA,IAAI,GAAG,CAAC;IACjB;IAEA,IAAIZ,UAAU,KAAKI,QAAQ,CAACe,UAAU,EAAE;MACtC;IACF;EACF;EAEA,OAAOtB,WAAW;AACpB;AAEA,SAASW,SAASA,CAACJ,QAAQ,EAAEJ,UAAU,EAAEgB,UAAU,EAAE;EACnDA,UAAU,CAACF,MAAM,GAAGE,UAAU,CAACF,MAAM,IAAI,CAAC,CAAC;EAC3CE,UAAU,CAACF,MAAM,CAACC,SAAS,GAAGX,QAAQ,CAACgB,QAAQ,CAACpB,UAAU,CAAC;EAC3DgB,UAAU,CAACF,MAAM,CAACI,UAAU,GAAG,CAAC;EAChCF,UAAU,CAACK,UAAU,GAAGjB,QAAQ,CAACkB,SAAS,CAACtB,UAAU,GAAG,CAAC,EAAE,IAAI,CAAC;EAChEgB,UAAU,CAACC,IAAI,GAAG,EAAE;EACpBjB,UAAU,IAAI,CAAC;EACf,OAAOA,UAAU;AACnB;AAGA,SAASD,cAAcA,CAACF,WAAW,EAAgB;EAAA,IAAd0B,OAAO,GAAAtB,SAAA,CAAAC,MAAA,QAAAD,SAAA,QAAAE,SAAA,GAAAF,SAAA,MAAG,CAAC,CAAC;EAC/C,IAAMuB,eAAe,GAAG;IAACC,OAAO,EAAE;EAAG,CAAC;EACtCF,OAAO,GAAAG,aAAA,CAAAA,aAAA,KAAOF,eAAe,GAAKD,OAAO,CAAC;EAE1C,IAAMI,OAAO,GAAG9B,WAAW,CAAC,CAAC,CAAC;EAC9B,IAAM+B,KAAK,GAAG,CAAC,CAAC;EAAC,IAAAC,SAAA,GAAAC,0BAAA,CAEQjC,WAAW;IAAAkC,KAAA;EAAA;IAApC,KAAAF,SAAA,CAAAG,CAAA,MAAAD,KAAA,GAAAF,SAAA,CAAAI,CAAA,IAAAC,IAAA,GAAsC;MAAA,IAA3BlB,UAAU,GAAAe,KAAA,CAAAI,KAAA;MACnB,IAAOlB,IAAI,GAAID,UAAU,CAAlBC,IAAI;MAEX,IAAMmB,KAAK,GAAGC,QAAQ,CAACpB,IAAI,CAACqB,MAAM,CAACrB,IAAI,CAACf,MAAM,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC;MACxD,IAAMqC,UAAU,GAAGtB,IAAI,CAACuB,SAAS,CAAC,CAAC,EAAEvB,IAAI,CAACf,MAAM,GAAG,CAAC,CAAC;MACrD,IAAMuC,UAAU,GAAGb,KAAK,CAACW,UAAU,CAAC;MACpC,IAAMG,KAAK,GAAGzB,IAAI,CAACf,MAAM,GAAG,CAAC;MAG7Bc,UAAU,CAAC0B,KAAK,GAAGA,KAAK;MACxB1B,UAAU,CAAC2B,WAAW,GAAG3B,UAAU,CAACF,MAAM,CAACI,UAAU;MACrDF,UAAU,CAAC4B,QAAQ,GAAG,EAAE;MACxB5B,UAAU,CAAC6B,eAAe,GAAG,IAAIC,KAAK,CAAC,CAAC,CAAC,CAACC,IAAI,CAAC,IAAI,CAAC;MACpD/B,UAAU,CAACS,OAAO,GAAGF,OAAO,CAACE,OAAO,GAAGuB,IAAI,CAACC,GAAG,CAAC,CAAC,EAAEP,KAAK,CAAC;MAGzD,IAAID,UAAU,EAAE;QACdA,UAAU,CAACG,QAAQ,CAACnC,IAAI,CAACO,UAAU,CAAC;QACpCyB,UAAU,CAACI,eAAe,CAACT,KAAK,CAAC,GAAGpB,UAAU;MAChD;MAGAY,KAAK,CAACX,IAAI,CAAC,GAAGD,UAAU;IAC1B;EAAC,SAAAkC,GAAA;IAAArB,SAAA,CAAAsB,CAAA,CAAAD,GAAA;EAAA;IAAArB,SAAA,CAAAuB,CAAA;EAAA;EAGD,OAAOzB,OAAO;AAChB"}
+{"version":3,"file":"parse-potree-hierarchy-chunk.js","names":["parsePotreeHierarchyChunk","arrayBuffer","tileHeaders","parseBinaryChunk","buildHierarchy","byteOffset","arguments","length","undefined","dataView","DataView","stack","topTileHeader","decodeRow","push","snode","shift","mask","i","header","childMask","tileHeader","name","childCount","byteLength","getUint8","pointCount","getUint32","options","DEFAULT_OPTIONS","spacing","_objectSpread","topNode","nodes","_iterator","_createForOfIteratorHelper","_step","s","n","done","_options","value","index","parseInt","charAt","parentName","substring","parentNode","level","hasChildren","children","childrenByIndex","Array","fill","Math","pow","err","e","f"],"sources":["../../../src/parsers/parse-potree-hierarchy-chunk.ts"],"sourcesContent":["// 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// Potree Hierarchy Chunk file format\n// https://github.com/potree/potree/blob/develop/docs/potree-file-format.md#index-files\n\n/*\n### Hierarchy Chunk Files\n\nAs mentioned in the former section, the `.hrc` files contain the index structure\nmeaning a list of all the files stored within the directory tree.\n\nAn index file contains a list of tuple values with the first being a `uint8`\n\"mask\" and the second being `uint32` \"number of points\" of a hierarchy level\nin a [breadth first level order][breadth-first].\n\nPer hierarchy level we have 8 possible nodes. To indicate whether a node exists\na simple binary mask is used:\n\n| Position | Mask | [Binary][bin] |\n|----------|------|---------------|\n| 0        | 1    | 0b00000001    |\n| 1        | 2    | 0b00000010    |\n| 2        | 4    | 0b00000100    |\n| 3        | 8    | 0b00001000    |\n| 4        | 16   | 0b00010000    |\n| 5        | 32   | 0b00100000    |\n| 6        | 64   | 0b01000000    |\n| 7        | 128  | 0b10000000    |\n\nSo if in a hierarchy the child node 3 and node 7 exist then the hierarchies\nmask has to be `0b00001000 | 0b10000000` → `0b10001000` (=136).\n\n_Example:_ A simple, non-realistic tree:\n\n```\n|- r1\n|  |\n|  \\- r14 (2 Points)\n|\n\\- r3\n   |\n   \\- r36 (1 Point)\n```\n\nWould have an index looking like this:\n\n| name | mask               | points |\n|------|--------------------|--------|\n| r    | `0b00001010` (=10) | `3`    |\n| r1   | `0b00010000` (=16) | `2`    |\n| r3   | `0b01000000` (=64) | `1`    |\n| r14  | `0b00000000` (=0)  | `2`    |\n| r36  | `0b00000000` (=0)  | `1`    |\n*/\n\n/** @todo these types are an incorrect mess */\nexport type POTreeTileHeader = {\n  childCount: number;\n  name: string;\n  childMask: number;\n};\n\n/** @todo these types are an incorrect mess */\nexport type POTreeNode = {\n  header: POTreeTileHeader;\n  name: string;\n  pointCount: number;\n  children: POTreeNode[];\n  childrenByIndex: POTreeNode[];\n};\n\n// type POTreeTileNode = POTreeNode;\n\n// load hierarchy\nexport function parsePotreeHierarchyChunk(arrayBuffer: ArrayBuffer) {\n  const tileHeaders = parseBinaryChunk(arrayBuffer);\n  return buildHierarchy(tileHeaders);\n}\n\n// Parses the binary rows\nfunction parseBinaryChunk(arrayBuffer: ArrayBuffer, byteOffset = 0) {\n  const dataView = new DataView(arrayBuffer);\n\n  const stack: POTreeNode[] = [];\n\n  // Get root mask\n  // @ts-expect-error\n  const topTileHeader: POTreeNode = {};\n  byteOffset = decodeRow(dataView, byteOffset, topTileHeader);\n\n  stack.push(topTileHeader);\n\n  const tileHeaders: POTreeTileHeader[] = [];\n\n  while (stack.length > 0) {\n    const snode = stack.shift();\n    let mask = 1;\n\n    for (let i = 0; i < 8; i++) {\n      if (snode && (snode.header.childMask & mask) !== 0) {\n        // @ts-expect-error\n        const tileHeader: POTreeTileHeader = {};\n        byteOffset = decodeRow(dataView, byteOffset, tileHeader);\n        tileHeader.name = snode.name + i;\n\n        // @ts-expect-error\n        stack.push(tileHeader);\n        tileHeaders.push(tileHeader);\n        snode.header.childCount++;\n      }\n      mask = mask * 2;\n    }\n\n    if (byteOffset === dataView.byteLength) {\n      break;\n    }\n  }\n\n  return tileHeaders;\n}\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\n// Resolves the binary rows into a hierarchy (tree structure)\nfunction buildHierarchy(tileHeaders, options: {spacing?: number} = {}): POTreeNode {\n  const DEFAULT_OPTIONS = {spacing: 100}; // TODO assert instead of default?\n  options = {...DEFAULT_OPTIONS, ...options};\n\n  const topNode = tileHeaders[0];\n  const nodes = {};\n\n  for (const tileHeader of tileHeaders) {\n    const {name} = tileHeader;\n\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\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\n    if (parentNode) {\n      parentNode.children.push(tileHeader);\n      parentNode.childrenByIndex[index] = tileHeader;\n    }\n\n    // Add the node to the map\n    nodes[name] = tileHeader;\n  }\n\n  // First node is the root\n  return topNode;\n}\n"],"mappings":";;;;;;;;;;;;;AA2EO,SAASA,yBAAyBA,CAACC,WAAwB,EAAE;EAClE,IAAMC,WAAW,GAAGC,gBAAgB,CAACF,WAAW,CAAC;EACjD,OAAOG,cAAc,CAACF,WAAW,CAAC;AACpC;AAGA,SAASC,gBAAgBA,CAACF,WAAwB,EAAkB;EAAA,IAAhBI,UAAU,GAAAC,SAAA,CAAAC,MAAA,QAAAD,SAAA,QAAAE,SAAA,GAAAF,SAAA,MAAG,CAAC;EAChE,IAAMG,QAAQ,GAAG,IAAIC,QAAQ,CAACT,WAAW,CAAC;EAE1C,IAAMU,KAAmB,GAAG,EAAE;EAI9B,IAAMC,aAAyB,GAAG,CAAC,CAAC;EACpCP,UAAU,GAAGQ,SAAS,CAACJ,QAAQ,EAAEJ,UAAU,EAAEO,aAAa,CAAC;EAE3DD,KAAK,CAACG,IAAI,CAACF,aAAa,CAAC;EAEzB,IAAMV,WAA+B,GAAG,EAAE;EAE1C,OAAOS,KAAK,CAACJ,MAAM,GAAG,CAAC,EAAE;IACvB,IAAMQ,KAAK,GAAGJ,KAAK,CAACK,KAAK,CAAC,CAAC;IAC3B,IAAIC,IAAI,GAAG,CAAC;IAEZ,KAAK,IAAIC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG,CAAC,EAAEA,CAAC,EAAE,EAAE;MAC1B,IAAIH,KAAK,IAAI,CAACA,KAAK,CAACI,MAAM,CAACC,SAAS,GAAGH,IAAI,MAAM,CAAC,EAAE;QAElD,IAAMI,UAA4B,GAAG,CAAC,CAAC;QACvChB,UAAU,GAAGQ,SAAS,CAACJ,QAAQ,EAAEJ,UAAU,EAAEgB,UAAU,CAAC;QACxDA,UAAU,CAACC,IAAI,GAAGP,KAAK,CAACO,IAAI,GAAGJ,CAAC;QAGhCP,KAAK,CAACG,IAAI,CAACO,UAAU,CAAC;QACtBnB,WAAW,CAACY,IAAI,CAACO,UAAU,CAAC;QAC5BN,KAAK,CAACI,MAAM,CAACI,UAAU,EAAE;MAC3B;MACAN,IAAI,GAAGA,IAAI,GAAG,CAAC;IACjB;IAEA,IAAIZ,UAAU,KAAKI,QAAQ,CAACe,UAAU,EAAE;MACtC;IACF;EACF;EAEA,OAAOtB,WAAW;AACpB;AAEA,SAASW,SAASA,CAACJ,QAAQ,EAAEJ,UAAU,EAAEgB,UAAU,EAAE;EACnDA,UAAU,CAACF,MAAM,GAAGE,UAAU,CAACF,MAAM,IAAI,CAAC,CAAC;EAC3CE,UAAU,CAACF,MAAM,CAACC,SAAS,GAAGX,QAAQ,CAACgB,QAAQ,CAACpB,UAAU,CAAC;EAC3DgB,UAAU,CAACF,MAAM,CAACI,UAAU,GAAG,CAAC;EAChCF,UAAU,CAACK,UAAU,GAAGjB,QAAQ,CAACkB,SAAS,CAACtB,UAAU,GAAG,CAAC,EAAE,IAAI,CAAC;EAChEgB,UAAU,CAACC,IAAI,GAAG,EAAE;EACpBjB,UAAU,IAAI,CAAC;EACf,OAAOA,UAAU;AACnB;AAGA,SAASD,cAAcA,CAACF,WAAW,EAAgD;EAAA,IAA9C0B,OAA2B,GAAAtB,SAAA,CAAAC,MAAA,QAAAD,SAAA,QAAAE,SAAA,GAAAF,SAAA,MAAG,CAAC,CAAC;EACnE,IAAMuB,eAAe,GAAG;IAACC,OAAO,EAAE;EAAG,CAAC;EACtCF,OAAO,GAAAG,aAAA,CAAAA,aAAA,KAAOF,eAAe,GAAKD,OAAO,CAAC;EAE1C,IAAMI,OAAO,GAAG9B,WAAW,CAAC,CAAC,CAAC;EAC9B,IAAM+B,KAAK,GAAG,CAAC,CAAC;EAAC,IAAAC,SAAA,GAAAC,0BAAA,CAEQjC,WAAW;IAAAkC,KAAA;EAAA;IAApC,KAAAF,SAAA,CAAAG,CAAA,MAAAD,KAAA,GAAAF,SAAA,CAAAI,CAAA,IAAAC,IAAA,GAAsC;MAAA,IAAAC,QAAA;MAAA,IAA3BnB,UAAU,GAAAe,KAAA,CAAAK,KAAA;MACnB,IAAOnB,IAAI,GAAID,UAAU,CAAlBC,IAAI;MAEX,IAAMoB,KAAK,GAAGC,QAAQ,CAACrB,IAAI,CAACsB,MAAM,CAACtB,IAAI,CAACf,MAAM,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC;MACxD,IAAMsC,UAAU,GAAGvB,IAAI,CAACwB,SAAS,CAAC,CAAC,EAAExB,IAAI,CAACf,MAAM,GAAG,CAAC,CAAC;MACrD,IAAMwC,UAAU,GAAGd,KAAK,CAACY,UAAU,CAAC;MACpC,IAAMG,KAAK,GAAG1B,IAAI,CAACf,MAAM,GAAG,CAAC;MAG7Bc,UAAU,CAAC2B,KAAK,GAAGA,KAAK;MACxB3B,UAAU,CAAC4B,WAAW,GAAG5B,UAAU,CAACF,MAAM,CAACI,UAAU;MACrDF,UAAU,CAAC6B,QAAQ,GAAG,EAAE;MACxB7B,UAAU,CAAC8B,eAAe,GAAG,IAAIC,KAAK,CAAC,CAAC,CAAC,CAACC,IAAI,CAAC,IAAI,CAAC;MACpDhC,UAAU,CAACS,OAAO,GAAG,CAAC,EAAAU,QAAA,GAAAZ,OAAO,cAAAY,QAAA,uBAAPA,QAAA,CAASV,OAAO,KAAI,CAAC,IAAIwB,IAAI,CAACC,GAAG,CAAC,CAAC,EAAEP,KAAK,CAAC;MAGjE,IAAID,UAAU,EAAE;QACdA,UAAU,CAACG,QAAQ,CAACpC,IAAI,CAACO,UAAU,CAAC;QACpC0B,UAAU,CAACI,eAAe,CAACT,KAAK,CAAC,GAAGrB,UAAU;MAChD;MAGAY,KAAK,CAACX,IAAI,CAAC,GAAGD,UAAU;IAC1B;EAAC,SAAAmC,GAAA;IAAAtB,SAAA,CAAAuB,CAAA,CAAAD,GAAA;EAAA;IAAAtB,SAAA,CAAAwB,CAAA;EAAA;EAGD,OAAO1B,OAAO;AAChB"}

package/dist/es5/potree-bin-loader.js

@@ -1,11 +1,10 @@
 "use strict";
 
-var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
 Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.PotreeBinLoader = void 0;
-var _parsePotreeBin = _interopRequireDefault(require("./parsers/parse-potree-bin"));
+var _parsePotreeBin = require("./parsers/parse-potree-bin");
 var PotreeBinLoader = {
   name: 'potree Binary Point Attributes',
   id: 'potree',
@@ -18,7 +17,7 @@ exports.PotreeBinLoader = PotreeBinLoader;
 function parseSync(arrayBuffer, options) {
   var index = {};
   var byteOffset = 0;
-  (0, _parsePotreeBin.default)(arrayBuffer, byteOffset, options, index);
+  (0, _parsePotreeBin.parsePotreeBin)(arrayBuffer, byteOffset, options, index);
   return index;
 }
 //# sourceMappingURL=potree-bin-loader.js.map

package/dist/es5/potree-bin-loader.js.map

@@ -1 +1 @@
-{"version":3,"file":"potree-bin-loader.js","names":["_parsePotreeBin","_interopRequireDefault","require","PotreeBinLoader","name","id","extensions","mimeTypes","parseSync","binary","exports","arrayBuffer","options","index","byteOffset","parsePotreeBin"],"sources":["../../src/potree-bin-loader.ts"],"sourcesContent":["import type {LoaderWithParser, LoaderOptions} from '@loaders.gl/loader-utils';\nimport {default as parsePotreeBin} from './parsers/parse-potree-bin';\n\n/**\n * Loader for potree Binary Point Attributes\n * */\n// @ts-ignore\nexport const PotreeBinLoader: LoaderWithParser = {\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};\n\nfunction parseSync(arrayBuffer: ArrayBuffer, options?: LoaderOptions) {\n  const index = {};\n  const byteOffset = 0;\n  parsePotreeBin(arrayBuffer, byteOffset, options, index);\n  return index;\n}\n"],"mappings":";;;;;;;AACA,IAAAA,eAAA,GAAAC,sBAAA,CAAAC,OAAA;AAMO,IAAMC,eAAiC,GAAG;EAC/CC,IAAI,EAAE,gCAAgC;EACtCC,EAAE,EAAE,QAAQ;EACZC,UAAU,EAAE,CAAC,KAAK,CAAC;EACnBC,SAAS,EAAE,CAAC,0BAA0B,CAAC;EAGvCC,SAAS,EAATA,SAAS;EACTC,MAAM,EAAE;AACV,CAAC;AAACC,OAAA,CAAAP,eAAA,GAAAA,eAAA;AAEF,SAASK,SAASA,CAACG,WAAwB,EAAEC,OAAuB,EAAE;EACpE,IAAMC,KAAK,GAAG,CAAC,CAAC;EAChB,IAAMC,UAAU,GAAG,CAAC;EACpB,IAAAC,uBAAc,EAACJ,WAAW,EAAEG,UAAU,EAAEF,OAAO,EAAEC,KAAK,CAAC;EACvD,OAAOA,KAAK;AACd"}
+{"version":3,"file":"potree-bin-loader.js","names":["_parsePotreeBin","require","PotreeBinLoader","name","id","extensions","mimeTypes","parseSync","binary","exports","arrayBuffer","options","index","byteOffset","parsePotreeBin"],"sources":["../../src/potree-bin-loader.ts"],"sourcesContent":["import type {LoaderWithParser, LoaderOptions} from '@loaders.gl/loader-utils';\nimport {parsePotreeBin} from './parsers/parse-potree-bin';\n\n/**\n * Loader for potree Binary Point Attributes\n * */\n// @ts-ignore\nexport const PotreeBinLoader: LoaderWithParser<{}, never, LoaderOptions> = {\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};\n\nfunction parseSync(arrayBuffer: ArrayBuffer, options?: LoaderOptions): {} {\n  const index = {};\n  const byteOffset = 0;\n  parsePotreeBin(arrayBuffer, byteOffset, options, index);\n  return index;\n}\n"],"mappings":";;;;;;AACA,IAAAA,eAAA,GAAAC,OAAA;AAMO,IAAMC,eAA2D,GAAG;EACzEC,IAAI,EAAE,gCAAgC;EACtCC,EAAE,EAAE,QAAQ;EACZC,UAAU,EAAE,CAAC,KAAK,CAAC;EACnBC,SAAS,EAAE,CAAC,0BAA0B,CAAC;EAGvCC,SAAS,EAATA,SAAS;EACTC,MAAM,EAAE;AACV,CAAC;AAACC,OAAA,CAAAP,eAAA,GAAAA,eAAA;AAEF,SAASK,SAASA,CAACG,WAAwB,EAAEC,OAAuB,EAAM;EACxE,IAAMC,KAAK,GAAG,CAAC,CAAC;EAChB,IAAMC,UAAU,GAAG,CAAC;EACpB,IAAAC,8BAAc,EAACJ,WAAW,EAAEG,UAAU,EAAEF,OAAO,EAAEC,KAAK,CAAC;EACvD,OAAOA,KAAK;AACd"}

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

@@ -7,7 +7,7 @@ Object.defineProperty(exports, "__esModule", {
 exports.PotreeHierarchyChunkLoader = void 0;
 var _regenerator = _interopRequireDefault(require("@babel/runtime/regenerator"));
 var _asyncToGenerator2 = _interopRequireDefault(require("@babel/runtime/helpers/asyncToGenerator"));
-var _parsePotreeHierarchyChunk = _interopRequireDefault(require("./parsers/parse-potree-hierarchy-chunk"));
+var _parsePotreeHierarchyChunk = require("./parsers/parse-potree-hierarchy-chunk");
 var PotreeHierarchyChunkLoader = {
   id: 'potree',
   name: 'potree Hierarchy Chunk',
@@ -18,11 +18,8 @@ var PotreeHierarchyChunkLoader = {
       return _regenerator.default.wrap(function _callee$(_context) {
         while (1) switch (_context.prev = _context.next) {
           case 0:
-            _context.next = 2;
-            return parseSync(arrayBuffer);
-          case 2:
-            return _context.abrupt("return", _context.sent);
-          case 3:
+            return _context.abrupt("return", (0, _parsePotreeHierarchyChunk.parsePotreeHierarchyChunk)(arrayBuffer));
+          case 1:
           case "end":
             return _context.stop();
         }
@@ -33,11 +30,10 @@ var PotreeHierarchyChunkLoader = {
     }
     return parse;
   }(),
-  parseSync: parseSync,
+  parseSync: function parseSync(arrayBuffer, options) {
+    return (0, _parsePotreeHierarchyChunk.parsePotreeHierarchyChunk)(arrayBuffer);
+  },
   binary: true
 };
 exports.PotreeHierarchyChunkLoader = PotreeHierarchyChunkLoader;
-function parseSync(arrayBuffer) {
-  return (0, _parsePotreeHierarchyChunk.default)(arrayBuffer);
-}
 //# sourceMappingURL=potree-hierarchy-chunk-loader.js.map

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

@@ -1 +1 @@
-{"version":3,"file":"potree-hierarchy-chunk-loader.js","names":["_parsePotreeHierarchyChunk","_interopRequireDefault","require","PotreeHierarchyChunkLoader","id","name","extensions","mimeTypes","parse","_parse","_asyncToGenerator2","default","_regenerator","mark","_callee","arrayBuffer","options","wrap","_callee$","_context","prev","next","parseSync","abrupt","sent","stop","_x","_x2","apply","arguments","binary","exports","parsePotreeHierarchyChunk"],"sources":["../../src/potree-hierarchy-chunk-loader.ts"],"sourcesContent":["import type {LoaderWithParser} from '@loaders.gl/loader-utils';\nimport {default as parsePotreeHierarchyChunk} from './parsers/parse-potree-hierarchy-chunk';\n\n/** Potree hierarchy chunk loader */\n// @ts-ignore\nexport const PotreeHierarchyChunkLoader: LoaderWithParser = {\n  id: 'potree',\n  name: 'potree Hierarchy Chunk',\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) => await parseSync(arrayBuffer),\n  parseSync,\n  binary: true\n};\n\nfunction parseSync(arrayBuffer) {\n  return parsePotreeHierarchyChunk(arrayBuffer);\n}\n"],"mappings":";;;;;;;;;AACA,IAAAA,0BAAA,GAAAC,sBAAA,CAAAC,OAAA;AAIO,IAAMC,0BAA4C,GAAG;EAC1DC,EAAE,EAAE,QAAQ;EACZC,IAAI,EAAE,wBAAwB;EAC9BC,UAAU,EAAE,CAAC,KAAK,CAAC;EACnBC,SAAS,EAAE,CAAC,0BAA0B,CAAC;EAGvCC,KAAK;IAAA,IAAAC,MAAA,OAAAC,kBAAA,CAAAC,OAAA,EAAAC,YAAA,CAAAD,OAAA,CAAAE,IAAA,CAAE,SAAAC,QAAOC,WAAW,EAAEC,OAAO;MAAA,OAAAJ,YAAA,CAAAD,OAAA,CAAAM,IAAA,UAAAC,SAAAC,QAAA;QAAA,kBAAAA,QAAA,CAAAC,IAAA,GAAAD,QAAA,CAAAE,IAAA;UAAA;YAAAF,QAAA,CAAAE,IAAA;YAAA,OAAWC,SAAS,CAACP,WAAW,CAAC;UAAA;YAAA,OAAAI,QAAA,CAAAI,MAAA,WAAAJ,QAAA,CAAAK,IAAA;UAAA;UAAA;YAAA,OAAAL,QAAA,CAAAM,IAAA;QAAA;MAAA,GAAAX,OAAA;IAAA;IAAA,SAAAN,MAAAkB,EAAA,EAAAC,GAAA;MAAA,OAAAlB,MAAA,CAAAmB,KAAA,OAAAC,SAAA;IAAA;IAAA,OAAArB,KAAA;EAAA;EACnEc,SAAS,EAATA,SAAS;EACTQ,MAAM,EAAE;AACV,CAAC;AAACC,OAAA,CAAA5B,0BAAA,GAAAA,0BAAA;AAEF,SAASmB,SAASA,CAACP,WAAW,EAAE;EAC9B,OAAO,IAAAiB,kCAAyB,EAACjB,WAAW,CAAC;AAC/C"}
+{"version":3,"file":"potree-hierarchy-chunk-loader.js","names":["_parsePotreeHierarchyChunk","require","PotreeHierarchyChunkLoader","id","name","extensions","mimeTypes","parse","_parse","_asyncToGenerator2","default","_regenerator","mark","_callee","arrayBuffer","options","wrap","_callee$","_context","prev","next","abrupt","parsePotreeHierarchyChunk","stop","_x","_x2","apply","arguments","parseSync","binary","exports"],"sources":["../../src/potree-hierarchy-chunk-loader.ts"],"sourcesContent":["import type {LoaderWithParser} from '@loaders.gl/loader-utils';\nimport type {POTreeLoaderOptions} from './potree-loader';\nimport type {POTreeNode} from './parsers/parse-potree-hierarchy-chunk';\nimport {parsePotreeHierarchyChunk} from './parsers/parse-potree-hierarchy-chunk';\n\n/** Potree hierarchy chunk loader */\n// @ts-ignore not a valid loader\nexport const PotreeHierarchyChunkLoader: LoaderWithParser<POTreeNode, never, POTreeLoaderOptions> =\n  {\n    id: 'potree',\n    name: 'potree Hierarchy Chunk',\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    binary: true\n  };\n"],"mappings":";;;;;;;;;AAGA,IAAAA,0BAAA,GAAAC,OAAA;AAIO,IAAMC,0BAAoF,GAC/F;EACEC,EAAE,EAAE,QAAQ;EACZC,IAAI,EAAE,wBAAwB;EAC9BC,UAAU,EAAE,CAAC,KAAK,CAAC;EACnBC,SAAS,EAAE,CAAC,0BAA0B,CAAC;EAGvCC,KAAK;IAAA,IAAAC,MAAA,OAAAC,kBAAA,CAAAC,OAAA,EAAAC,YAAA,CAAAD,OAAA,CAAAE,IAAA,CAAE,SAAAC,QAAOC,WAAW,EAAEC,OAAO;MAAA,OAAAJ,YAAA,CAAAD,OAAA,CAAAM,IAAA,UAAAC,SAAAC,QAAA;QAAA,kBAAAA,QAAA,CAAAC,IAAA,GAAAD,QAAA,CAAAE,IAAA;UAAA;YAAA,OAAAF,QAAA,CAAAG,MAAA,WAAK,IAAAC,oDAAyB,EAACR,WAAW,CAAC;UAAA;UAAA;YAAA,OAAAI,QAAA,CAAAK,IAAA;QAAA;MAAA,GAAAV,OAAA;IAAA;IAAA,SAAAN,MAAAiB,EAAA,EAAAC,GAAA;MAAA,OAAAjB,MAAA,CAAAkB,KAAA,OAAAC,SAAA;IAAA;IAAA,OAAApB,KAAA;EAAA;EAC7EqB,SAAS,EAAE,SAAAA,UAACd,WAAW,EAAEC,OAAO;IAAA,OAAK,IAAAO,oDAAyB,EAACR,WAAW,CAAC;EAAA;EAC3Ee,MAAM,EAAE;AACV,CAAC;AAACC,OAAA,CAAA5B,0BAAA,GAAAA,0BAAA"}

package/dist/es5/potree-loader.js

@@ -4,7 +4,7 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.PotreeLoader = void 0;
-var VERSION = typeof "4.0.0-alpha.8" !== 'undefined' ? "4.0.0-alpha.8" : 'latest';
+var VERSION = typeof "4.0.0-beta.1" !== 'undefined' ? "4.0.0-beta.1" : 'latest';
 var PotreeLoader = {
   name: 'potree',
   id: 'potree',

package/dist/es5/potree-loader.js.map

@@ -1 +1 @@
-{"version":3,"file":"potree-loader.js","names":["VERSION","PotreeLoader","name","id","module","version","extensions","mimeTypes","testText","text","indexOf","parseTextSync","JSON","parse","options","potree","exports"],"sources":["../../src/potree-loader.ts"],"sourcesContent":["import type {LoaderWithParser} from '@loaders.gl/loader-utils';\n\n// __VERSION__ is injected by babel-plugin-version-inline\n// @ts-ignore TS2304: Cannot find name '__VERSION__'.\nconst VERSION = typeof __VERSION__ !== 'undefined' ? __VERSION__ : 'latest';\n\n/** Potree loader */\n// @ts-ignore\nexport const PotreeLoader: LoaderWithParser = {\n  name: 'potree',\n  id: 'potree',\n  module: 'potree',\n  version: VERSION,\n  extensions: ['json'],\n  mimeTypes: ['application/json'],\n  testText: (text) => text.indexOf('octreeDir') >= 0,\n  parseTextSync: (text) => JSON.parse(text),\n  options: {\n    potree: {}\n  }\n};\n"],"mappings":";;;;;;AAIA,IAAMA,OAAO,GAAG,sBAAkB,KAAK,WAAW,qBAAiB,QAAQ;AAIpE,IAAMC,YAA8B,GAAG;EAC5CC,IAAI,EAAE,QAAQ;EACdC,EAAE,EAAE,QAAQ;EACZC,MAAM,EAAE,QAAQ;EAChBC,OAAO,EAAEL,OAAO;EAChBM,UAAU,EAAE,CAAC,MAAM,CAAC;EACpBC,SAAS,EAAE,CAAC,kBAAkB,CAAC;EAC/BC,QAAQ,EAAE,SAAAA,SAACC,IAAI;IAAA,OAAKA,IAAI,CAACC,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC;EAAA;EAClDC,aAAa,EAAE,SAAAA,cAACF,IAAI;IAAA,OAAKG,IAAI,CAACC,KAAK,CAACJ,IAAI,CAAC;EAAA;EACzCK,OAAO,EAAE;IACPC,MAAM,EAAE,CAAC;EACX;AACF,CAAC;AAACC,OAAA,CAAAf,YAAA,GAAAA,YAAA"}
+{"version":3,"file":"potree-loader.js","names":["VERSION","PotreeLoader","name","id","module","version","extensions","mimeTypes","testText","text","indexOf","parseTextSync","JSON","parse","options","potree","exports"],"sources":["../../src/potree-loader.ts"],"sourcesContent":["import type {LoaderWithParser, LoaderOptions} from '@loaders.gl/loader-utils';\n\n// __VERSION__ is injected by babel-plugin-version-inline\n// @ts-ignore TS2304: Cannot find name '__VERSION__'.\nconst VERSION = typeof __VERSION__ !== 'undefined' ? __VERSION__ : 'latest';\n\nexport type POTreeLoaderOptions = LoaderOptions & {\n  potree?: {};\n};\n\n/** Potree loader */\n// @ts-ignore\nexport const PotreeLoader: LoaderWithParser<any, never, POTreeLoaderOptions> = {\n  name: 'potree',\n  id: 'potree',\n  module: 'potree',\n  version: VERSION,\n  extensions: ['json'],\n  mimeTypes: ['application/json'],\n  testText: (text) => text.indexOf('octreeDir') >= 0,\n  parseTextSync: (text) => JSON.parse(text),\n  options: {\n    potree: {}\n  }\n};\n"],"mappings":";;;;;;AAIA,IAAMA,OAAO,GAAG,qBAAkB,KAAK,WAAW,oBAAiB,QAAQ;AAQpE,IAAMC,YAA+D,GAAG;EAC7EC,IAAI,EAAE,QAAQ;EACdC,EAAE,EAAE,QAAQ;EACZC,MAAM,EAAE,QAAQ;EAChBC,OAAO,EAAEL,OAAO;EAChBM,UAAU,EAAE,CAAC,MAAM,CAAC;EACpBC,SAAS,EAAE,CAAC,kBAAkB,CAAC;EAC/BC,QAAQ,EAAE,SAAAA,SAACC,IAAI;IAAA,OAAKA,IAAI,CAACC,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC;EAAA;EAClDC,aAAa,EAAE,SAAAA,cAACF,IAAI;IAAA,OAAKG,IAAI,CAACC,KAAK,CAACJ,IAAI,CAAC;EAAA;EACzCK,OAAO,EAAE;IACPC,MAAM,EAAE,CAAC;EACX;AACF,CAAC;AAACC,OAAA,CAAAf,YAAA,GAAAA,YAAA"}

package/dist/esm/parsers/parse-potree-bin.js

@@ -1,4 +1,4 @@
-export default function parsePotreeBin(arrayBuffer, byteOffset, options, index) {
+export function parsePotreeBin(arrayBuffer, byteOffset, options, index) {
   return null;
 }
 //# sourceMappingURL=parse-potree-bin.js.map

package/dist/esm/parsers/parse-potree-bin.js.map

@@ -1 +1 @@
-{"version":3,"file":"parse-potree-bin.js","names":["parsePotreeBin","arrayBuffer","byteOffset","options","index"],"sources":["../../../src/parsers/parse-potree-bin.ts"],"sourcesContent":["export default function parsePotreeBin(\n  arrayBuffer: ArrayBuffer,\n  byteOffset: number,\n  options: unknown,\n  index: any\n) {\n  return null;\n}\n"],"mappings":"AAAA,eAAe,SAASA,cAAcA,CACpCC,WAAwB,EACxBC,UAAkB,EAClBC,OAAgB,EAChBC,KAAU,EACV;EACA,OAAO,IAAI;AACb"}
+{"version":3,"file":"parse-potree-bin.js","names":["parsePotreeBin","arrayBuffer","byteOffset","options","index"],"sources":["../../../src/parsers/parse-potree-bin.ts"],"sourcesContent":["export function parsePotreeBin(\n  arrayBuffer: ArrayBuffer,\n  byteOffset: number,\n  options: unknown,\n  index: any\n) {\n  return null;\n}\n"],"mappings":"AAAA,OAAO,SAASA,cAAcA,CAC5BC,WAAwB,EACxBC,UAAkB,EAClBC,OAAgB,EAChBC,KAAU,EACV;EACA,OAAO,IAAI;AACb"}

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

@@ -1,4 +1,4 @@
-export default function parsePotreeHierarchyChunk(arrayBuffer) {
+export function parsePotreeHierarchyChunk(arrayBuffer) {
   const tileHeaders = parseBinaryChunk(arrayBuffer);
   return buildHierarchy(tileHeaders);
 }
@@ -51,6 +51,7 @@ function buildHierarchy(tileHeaders) {
   const topNode = tileHeaders[0];
   const nodes = {};
   for (const tileHeader of tileHeaders) {
+    var _options;
     const {
       name
     } = tileHeader;
@@ -62,7 +63,7 @@ function buildHierarchy(tileHeaders) {
     tileHeader.hasChildren = tileHeader.header.childCount;
     tileHeader.children = [];
     tileHeader.childrenByIndex = new Array(8).fill(null);
-    tileHeader.spacing = options.spacing / Math.pow(2, level);
+    tileHeader.spacing = (((_options = options) === null || _options === void 0 ? void 0 : _options.spacing) || 0) / Math.pow(2, level);
     if (parentNode) {
       parentNode.children.push(tileHeader);
       parentNode.childrenByIndex[index] = tileHeader;

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

@@ -1 +1 @@
-{"version":3,"file":"parse-potree-hierarchy-chunk.js","names":["parsePotreeHierarchyChunk","arrayBuffer","tileHeaders","parseBinaryChunk","buildHierarchy","byteOffset","arguments","length","undefined","dataView","DataView","stack","topTileHeader","decodeRow","push","snode","shift","mask","i","header","childMask","tileHeader","name","childCount","byteLength","getUint8","pointCount","getUint32","options","DEFAULT_OPTIONS","spacing","topNode","nodes","index","parseInt","charAt","parentName","substring","parentNode","level","hasChildren","children","childrenByIndex","Array","fill","Math","pow"],"sources":["../../../src/parsers/parse-potree-hierarchy-chunk.ts"],"sourcesContent":["// 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// Potree Hierarchy Chunk file format\n// https://github.com/potree/potree/blob/develop/docs/potree-file-format.md#index-files\n\n/*\n### Hierarchy Chunk Files\n\nAs mentioned in the former section, the `.hrc` files contain the index structure\nmeaning a list of all the files stored within the directory tree.\n\nAn index file contains a list of tuple values with the first being a `uint8`\n\"mask\" and the second being `uint32` \"number of points\" of a hierarchy level\nin a [breadth first level order][breadth-first].\n\nPer hierarchy level we have 8 possible nodes. To indicate whether a node exists\na simple binary mask is used:\n\n| Position | Mask | [Binary][bin] |\n|----------|------|---------------|\n| 0        | 1    | 0b00000001    |\n| 1        | 2    | 0b00000010    |\n| 2        | 4    | 0b00000100    |\n| 3        | 8    | 0b00001000    |\n| 4        | 16   | 0b00010000    |\n| 5        | 32   | 0b00100000    |\n| 6        | 64   | 0b01000000    |\n| 7        | 128  | 0b10000000    |\n\nSo if in a hierarchy the child node 3 and node 7 exist then the hierarchies\nmask has to be `0b00001000 | 0b10000000` → `0b10001000` (=136).\n\n_Example:_ A simple, non-realistic tree:\n\n```\n|- r1\n|  |\n|  \\- r14 (2 Points)\n|\n\\- r3\n   |\n   \\- r36 (1 Point)\n```\n\nWould have an index looking like this:\n\n| name | mask               | points |\n|------|--------------------|--------|\n| r    | `0b00001010` (=10) | `3`    |\n| r1   | `0b00010000` (=16) | `2`    |\n| r3   | `0b01000000` (=64) | `1`    |\n| r14  | `0b00000000` (=0)  | `2`    |\n| r36  | `0b00000000` (=0)  | `1`    |\n*/\n\n// @ts-nocheck\n\n// load hierarchy\nexport default function parsePotreeHierarchyChunk(arrayBuffer: ArrayBuffer) {\n  const tileHeaders = parseBinaryChunk(arrayBuffer);\n  return buildHierarchy(tileHeaders);\n}\n\n// Parses the binary rows\nfunction parseBinaryChunk(arrayBuffer: ArrayBuffer, byteOffset = 0) {\n  const dataView = new DataView(arrayBuffer);\n\n  const stack = [];\n\n  // Get root mask\n  const topTileHeader = {};\n  byteOffset = decodeRow(dataView, byteOffset, topTileHeader);\n\n  stack.push(topTileHeader);\n\n  const tileHeaders = [];\n\n  while (stack.length > 0) {\n    const snode = stack.shift();\n    let mask = 1;\n\n    for (let i = 0; i < 8; i++) {\n      if (snode && (snode.header.childMask & mask) !== 0) {\n        const tileHeader = {};\n        byteOffset = decodeRow(dataView, byteOffset, tileHeader);\n        tileHeader.name = snode.name + i;\n\n        stack.push(tileHeader);\n        tileHeaders.push(tileHeader);\n        snode.header.childCount++;\n      }\n      mask = mask * 2;\n    }\n\n    if (byteOffset === dataView.byteLength) {\n      break;\n    }\n  }\n\n  return tileHeaders;\n}\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\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\n  const topNode = tileHeaders[0];\n  const nodes = {};\n\n  for (const tileHeader of tileHeaders) {\n    const {name} = tileHeader;\n\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\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 / Math.pow(2, level);\n    // tileHeader.boundingVolume = Utils.createChildAABB(parentNode.boundingBox, index);\n\n    if (parentNode) {\n      parentNode.children.push(tileHeader);\n      parentNode.childrenByIndex[index] = tileHeader;\n    }\n\n    // Add the node to the map\n    nodes[name] = tileHeader;\n  }\n\n  // First node is the root\n  return topNode;\n}\n"],"mappings":"AA2DA,eAAe,SAASA,yBAAyBA,CAACC,WAAwB,EAAE;EAC1E,MAAMC,WAAW,GAAGC,gBAAgB,CAACF,WAAW,CAAC;EACjD,OAAOG,cAAc,CAACF,WAAW,CAAC;AACpC;AAGA,SAASC,gBAAgBA,CAACF,WAAwB,EAAkB;EAAA,IAAhBI,UAAU,GAAAC,SAAA,CAAAC,MAAA,QAAAD,SAAA,QAAAE,SAAA,GAAAF,SAAA,MAAG,CAAC;EAChE,MAAMG,QAAQ,GAAG,IAAIC,QAAQ,CAACT,WAAW,CAAC;EAE1C,MAAMU,KAAK,GAAG,EAAE;EAGhB,MAAMC,aAAa,GAAG,CAAC,CAAC;EACxBP,UAAU,GAAGQ,SAAS,CAACJ,QAAQ,EAAEJ,UAAU,EAAEO,aAAa,CAAC;EAE3DD,KAAK,CAACG,IAAI,CAACF,aAAa,CAAC;EAEzB,MAAMV,WAAW,GAAG,EAAE;EAEtB,OAAOS,KAAK,CAACJ,MAAM,GAAG,CAAC,EAAE;IACvB,MAAMQ,KAAK,GAAGJ,KAAK,CAACK,KAAK,CAAC,CAAC;IAC3B,IAAIC,IAAI,GAAG,CAAC;IAEZ,KAAK,IAAIC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG,CAAC,EAAEA,CAAC,EAAE,EAAE;MAC1B,IAAIH,KAAK,IAAI,CAACA,KAAK,CAACI,MAAM,CAACC,SAAS,GAAGH,IAAI,MAAM,CAAC,EAAE;QAClD,MAAMI,UAAU,GAAG,CAAC,CAAC;QACrBhB,UAAU,GAAGQ,SAAS,CAACJ,QAAQ,EAAEJ,UAAU,EAAEgB,UAAU,CAAC;QACxDA,UAAU,CAACC,IAAI,GAAGP,KAAK,CAACO,IAAI,GAAGJ,CAAC;QAEhCP,KAAK,CAACG,IAAI,CAACO,UAAU,CAAC;QACtBnB,WAAW,CAACY,IAAI,CAACO,UAAU,CAAC;QAC5BN,KAAK,CAACI,MAAM,CAACI,UAAU,EAAE;MAC3B;MACAN,IAAI,GAAGA,IAAI,GAAG,CAAC;IACjB;IAEA,IAAIZ,UAAU,KAAKI,QAAQ,CAACe,UAAU,EAAE;MACtC;IACF;EACF;EAEA,OAAOtB,WAAW;AACpB;AAEA,SAASW,SAASA,CAACJ,QAAQ,EAAEJ,UAAU,EAAEgB,UAAU,EAAE;EACnDA,UAAU,CAACF,MAAM,GAAGE,UAAU,CAACF,MAAM,IAAI,CAAC,CAAC;EAC3CE,UAAU,CAACF,MAAM,CAACC,SAAS,GAAGX,QAAQ,CAACgB,QAAQ,CAACpB,UAAU,CAAC;EAC3DgB,UAAU,CAACF,MAAM,CAACI,UAAU,GAAG,CAAC;EAChCF,UAAU,CAACK,UAAU,GAAGjB,QAAQ,CAACkB,SAAS,CAACtB,UAAU,GAAG,CAAC,EAAE,IAAI,CAAC;EAChEgB,UAAU,CAACC,IAAI,GAAG,EAAE;EACpBjB,UAAU,IAAI,CAAC;EACf,OAAOA,UAAU;AACnB;AAGA,SAASD,cAAcA,CAACF,WAAW,EAAgB;EAAA,IAAd0B,OAAO,GAAAtB,SAAA,CAAAC,MAAA,QAAAD,SAAA,QAAAE,SAAA,GAAAF,SAAA,MAAG,CAAC,CAAC;EAC/C,MAAMuB,eAAe,GAAG;IAACC,OAAO,EAAE;EAAG,CAAC;EACtCF,OAAO,GAAG;IAAC,GAAGC,eAAe;IAAE,GAAGD;EAAO,CAAC;EAE1C,MAAMG,OAAO,GAAG7B,WAAW,CAAC,CAAC,CAAC;EAC9B,MAAM8B,KAAK,GAAG,CAAC,CAAC;EAEhB,KAAK,MAAMX,UAAU,IAAInB,WAAW,EAAE;IACpC,MAAM;MAACoB;IAAI,CAAC,GAAGD,UAAU;IAEzB,MAAMY,KAAK,GAAGC,QAAQ,CAACZ,IAAI,CAACa,MAAM,CAACb,IAAI,CAACf,MAAM,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC;IACxD,MAAM6B,UAAU,GAAGd,IAAI,CAACe,SAAS,CAAC,CAAC,EAAEf,IAAI,CAACf,MAAM,GAAG,CAAC,CAAC;IACrD,MAAM+B,UAAU,GAAGN,KAAK,CAACI,UAAU,CAAC;IACpC,MAAMG,KAAK,GAAGjB,IAAI,CAACf,MAAM,GAAG,CAAC;IAG7Bc,UAAU,CAACkB,KAAK,GAAGA,KAAK;IACxBlB,UAAU,CAACmB,WAAW,GAAGnB,UAAU,CAACF,MAAM,CAACI,UAAU;IACrDF,UAAU,CAACoB,QAAQ,GAAG,EAAE;IACxBpB,UAAU,CAACqB,eAAe,GAAG,IAAIC,KAAK,CAAC,CAAC,CAAC,CAACC,IAAI,CAAC,IAAI,CAAC;IACpDvB,UAAU,CAACS,OAAO,GAAGF,OAAO,CAACE,OAAO,GAAGe,IAAI,CAACC,GAAG,CAAC,CAAC,EAAEP,KAAK,CAAC;IAGzD,IAAID,UAAU,EAAE;MACdA,UAAU,CAACG,QAAQ,CAAC3B,IAAI,CAACO,UAAU,CAAC;MACpCiB,UAAU,CAACI,eAAe,CAACT,KAAK,CAAC,GAAGZ,UAAU;IAChD;IAGAW,KAAK,CAACV,IAAI,CAAC,GAAGD,UAAU;EAC1B;EAGA,OAAOU,OAAO;AAChB"}
+{"version":3,"file":"parse-potree-hierarchy-chunk.js","names":["parsePotreeHierarchyChunk","arrayBuffer","tileHeaders","parseBinaryChunk","buildHierarchy","byteOffset","arguments","length","undefined","dataView","DataView","stack","topTileHeader","decodeRow","push","snode","shift","mask","i","header","childMask","tileHeader","name","childCount","byteLength","getUint8","pointCount","getUint32","options","DEFAULT_OPTIONS","spacing","topNode","nodes","_options","index","parseInt","charAt","parentName","substring","parentNode","level","hasChildren","children","childrenByIndex","Array","fill","Math","pow"],"sources":["../../../src/parsers/parse-potree-hierarchy-chunk.ts"],"sourcesContent":["// 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// Potree Hierarchy Chunk file format\n// https://github.com/potree/potree/blob/develop/docs/potree-file-format.md#index-files\n\n/*\n### Hierarchy Chunk Files\n\nAs mentioned in the former section, the `.hrc` files contain the index structure\nmeaning a list of all the files stored within the directory tree.\n\nAn index file contains a list of tuple values with the first being a `uint8`\n\"mask\" and the second being `uint32` \"number of points\" of a hierarchy level\nin a [breadth first level order][breadth-first].\n\nPer hierarchy level we have 8 possible nodes. To indicate whether a node exists\na simple binary mask is used:\n\n| Position | Mask | [Binary][bin] |\n|----------|------|---------------|\n| 0        | 1    | 0b00000001    |\n| 1        | 2    | 0b00000010    |\n| 2        | 4    | 0b00000100    |\n| 3        | 8    | 0b00001000    |\n| 4        | 16   | 0b00010000    |\n| 5        | 32   | 0b00100000    |\n| 6        | 64   | 0b01000000    |\n| 7        | 128  | 0b10000000    |\n\nSo if in a hierarchy the child node 3 and node 7 exist then the hierarchies\nmask has to be `0b00001000 | 0b10000000` → `0b10001000` (=136).\n\n_Example:_ A simple, non-realistic tree:\n\n```\n|- r1\n|  |\n|  \\- r14 (2 Points)\n|\n\\- r3\n   |\n   \\- r36 (1 Point)\n```\n\nWould have an index looking like this:\n\n| name | mask               | points |\n|------|--------------------|--------|\n| r    | `0b00001010` (=10) | `3`    |\n| r1   | `0b00010000` (=16) | `2`    |\n| r3   | `0b01000000` (=64) | `1`    |\n| r14  | `0b00000000` (=0)  | `2`    |\n| r36  | `0b00000000` (=0)  | `1`    |\n*/\n\n/** @todo these types are an incorrect mess */\nexport type POTreeTileHeader = {\n  childCount: number;\n  name: string;\n  childMask: number;\n};\n\n/** @todo these types are an incorrect mess */\nexport type POTreeNode = {\n  header: POTreeTileHeader;\n  name: string;\n  pointCount: number;\n  children: POTreeNode[];\n  childrenByIndex: POTreeNode[];\n};\n\n// type POTreeTileNode = POTreeNode;\n\n// load hierarchy\nexport function parsePotreeHierarchyChunk(arrayBuffer: ArrayBuffer) {\n  const tileHeaders = parseBinaryChunk(arrayBuffer);\n  return buildHierarchy(tileHeaders);\n}\n\n// Parses the binary rows\nfunction parseBinaryChunk(arrayBuffer: ArrayBuffer, byteOffset = 0) {\n  const dataView = new DataView(arrayBuffer);\n\n  const stack: POTreeNode[] = [];\n\n  // Get root mask\n  // @ts-expect-error\n  const topTileHeader: POTreeNode = {};\n  byteOffset = decodeRow(dataView, byteOffset, topTileHeader);\n\n  stack.push(topTileHeader);\n\n  const tileHeaders: POTreeTileHeader[] = [];\n\n  while (stack.length > 0) {\n    const snode = stack.shift();\n    let mask = 1;\n\n    for (let i = 0; i < 8; i++) {\n      if (snode && (snode.header.childMask & mask) !== 0) {\n        // @ts-expect-error\n        const tileHeader: POTreeTileHeader = {};\n        byteOffset = decodeRow(dataView, byteOffset, tileHeader);\n        tileHeader.name = snode.name + i;\n\n        // @ts-expect-error\n        stack.push(tileHeader);\n        tileHeaders.push(tileHeader);\n        snode.header.childCount++;\n      }\n      mask = mask * 2;\n    }\n\n    if (byteOffset === dataView.byteLength) {\n      break;\n    }\n  }\n\n  return tileHeaders;\n}\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\n// Resolves the binary rows into a hierarchy (tree structure)\nfunction buildHierarchy(tileHeaders, options: {spacing?: number} = {}): POTreeNode {\n  const DEFAULT_OPTIONS = {spacing: 100}; // TODO assert instead of default?\n  options = {...DEFAULT_OPTIONS, ...options};\n\n  const topNode = tileHeaders[0];\n  const nodes = {};\n\n  for (const tileHeader of tileHeaders) {\n    const {name} = tileHeader;\n\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\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\n    if (parentNode) {\n      parentNode.children.push(tileHeader);\n      parentNode.childrenByIndex[index] = tileHeader;\n    }\n\n    // Add the node to the map\n    nodes[name] = tileHeader;\n  }\n\n  // First node is the root\n  return topNode;\n}\n"],"mappings":"AA2EA,OAAO,SAASA,yBAAyBA,CAACC,WAAwB,EAAE;EAClE,MAAMC,WAAW,GAAGC,gBAAgB,CAACF,WAAW,CAAC;EACjD,OAAOG,cAAc,CAACF,WAAW,CAAC;AACpC;AAGA,SAASC,gBAAgBA,CAACF,WAAwB,EAAkB;EAAA,IAAhBI,UAAU,GAAAC,SAAA,CAAAC,MAAA,QAAAD,SAAA,QAAAE,SAAA,GAAAF,SAAA,MAAG,CAAC;EAChE,MAAMG,QAAQ,GAAG,IAAIC,QAAQ,CAACT,WAAW,CAAC;EAE1C,MAAMU,KAAmB,GAAG,EAAE;EAI9B,MAAMC,aAAyB,GAAG,CAAC,CAAC;EACpCP,UAAU,GAAGQ,SAAS,CAACJ,QAAQ,EAAEJ,UAAU,EAAEO,aAAa,CAAC;EAE3DD,KAAK,CAACG,IAAI,CAACF,aAAa,CAAC;EAEzB,MAAMV,WAA+B,GAAG,EAAE;EAE1C,OAAOS,KAAK,CAACJ,MAAM,GAAG,CAAC,EAAE;IACvB,MAAMQ,KAAK,GAAGJ,KAAK,CAACK,KAAK,CAAC,CAAC;IAC3B,IAAIC,IAAI,GAAG,CAAC;IAEZ,KAAK,IAAIC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG,CAAC,EAAEA,CAAC,EAAE,EAAE;MAC1B,IAAIH,KAAK,IAAI,CAACA,KAAK,CAACI,MAAM,CAACC,SAAS,GAAGH,IAAI,MAAM,CAAC,EAAE;QAElD,MAAMI,UAA4B,GAAG,CAAC,CAAC;QACvChB,UAAU,GAAGQ,SAAS,CAACJ,QAAQ,EAAEJ,UAAU,EAAEgB,UAAU,CAAC;QACxDA,UAAU,CAACC,IAAI,GAAGP,KAAK,CAACO,IAAI,GAAGJ,CAAC;QAGhCP,KAAK,CAACG,IAAI,CAACO,UAAU,CAAC;QACtBnB,WAAW,CAACY,IAAI,CAACO,UAAU,CAAC;QAC5BN,KAAK,CAACI,MAAM,CAACI,UAAU,EAAE;MAC3B;MACAN,IAAI,GAAGA,IAAI,GAAG,CAAC;IACjB;IAEA,IAAIZ,UAAU,KAAKI,QAAQ,CAACe,UAAU,EAAE;MACtC;IACF;EACF;EAEA,OAAOtB,WAAW;AACpB;AAEA,SAASW,SAASA,CAACJ,QAAQ,EAAEJ,UAAU,EAAEgB,UAAU,EAAE;EACnDA,UAAU,CAACF,MAAM,GAAGE,UAAU,CAACF,MAAM,IAAI,CAAC,CAAC;EAC3CE,UAAU,CAACF,MAAM,CAACC,SAAS,GAAGX,QAAQ,CAACgB,QAAQ,CAACpB,UAAU,CAAC;EAC3DgB,UAAU,CAACF,MAAM,CAACI,UAAU,GAAG,CAAC;EAChCF,UAAU,CAACK,UAAU,GAAGjB,QAAQ,CAACkB,SAAS,CAACtB,UAAU,GAAG,CAAC,EAAE,IAAI,CAAC;EAChEgB,UAAU,CAACC,IAAI,GAAG,EAAE;EACpBjB,UAAU,IAAI,CAAC;EACf,OAAOA,UAAU;AACnB;AAGA,SAASD,cAAcA,CAACF,WAAW,EAAgD;EAAA,IAA9C0B,OAA2B,GAAAtB,SAAA,CAAAC,MAAA,QAAAD,SAAA,QAAAE,SAAA,GAAAF,SAAA,MAAG,CAAC,CAAC;EACnE,MAAMuB,eAAe,GAAG;IAACC,OAAO,EAAE;EAAG,CAAC;EACtCF,OAAO,GAAG;IAAC,GAAGC,eAAe;IAAE,GAAGD;EAAO,CAAC;EAE1C,MAAMG,OAAO,GAAG7B,WAAW,CAAC,CAAC,CAAC;EAC9B,MAAM8B,KAAK,GAAG,CAAC,CAAC;EAEhB,KAAK,MAAMX,UAAU,IAAInB,WAAW,EAAE;IAAA,IAAA+B,QAAA;IACpC,MAAM;MAACX;IAAI,CAAC,GAAGD,UAAU;IAEzB,MAAMa,KAAK,GAAGC,QAAQ,CAACb,IAAI,CAACc,MAAM,CAACd,IAAI,CAACf,MAAM,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC;IACxD,MAAM8B,UAAU,GAAGf,IAAI,CAACgB,SAAS,CAAC,CAAC,EAAEhB,IAAI,CAACf,MAAM,GAAG,CAAC,CAAC;IACrD,MAAMgC,UAAU,GAAGP,KAAK,CAACK,UAAU,CAAC;IACpC,MAAMG,KAAK,GAAGlB,IAAI,CAACf,MAAM,GAAG,CAAC;IAG7Bc,UAAU,CAACmB,KAAK,GAAGA,KAAK;IACxBnB,UAAU,CAACoB,WAAW,GAAGpB,UAAU,CAACF,MAAM,CAACI,UAAU;IACrDF,UAAU,CAACqB,QAAQ,GAAG,EAAE;IACxBrB,UAAU,CAACsB,eAAe,GAAG,IAAIC,KAAK,CAAC,CAAC,CAAC,CAACC,IAAI,CAAC,IAAI,CAAC;IACpDxB,UAAU,CAACS,OAAO,GAAG,CAAC,EAAAG,QAAA,GAAAL,OAAO,cAAAK,QAAA,uBAAPA,QAAA,CAASH,OAAO,KAAI,CAAC,IAAIgB,IAAI,CAACC,GAAG,CAAC,CAAC,EAAEP,KAAK,CAAC;IAGjE,IAAID,UAAU,EAAE;MACdA,UAAU,CAACG,QAAQ,CAAC5B,IAAI,CAACO,UAAU,CAAC;MACpCkB,UAAU,CAACI,eAAe,CAACT,KAAK,CAAC,GAAGb,UAAU;IAChD;IAGAW,KAAK,CAACV,IAAI,CAAC,GAAGD,UAAU;EAC1B;EAGA,OAAOU,OAAO;AAChB"}

package/dist/esm/potree-bin-loader.js

@@ -1,4 +1,4 @@
-import { default as parsePotreeBin } from './parsers/parse-potree-bin';
+import { parsePotreeBin } from './parsers/parse-potree-bin';
 export const PotreeBinLoader = {
   name: 'potree Binary Point Attributes',
   id: 'potree',

package/dist/esm/potree-bin-loader.js.map

@@ -1 +1 @@
-{"version":3,"file":"potree-bin-loader.js","names":["default","parsePotreeBin","PotreeBinLoader","name","id","extensions","mimeTypes","parseSync","binary","arrayBuffer","options","index","byteOffset"],"sources":["../../src/potree-bin-loader.ts"],"sourcesContent":["import type {LoaderWithParser, LoaderOptions} from '@loaders.gl/loader-utils';\nimport {default as parsePotreeBin} from './parsers/parse-potree-bin';\n\n/**\n * Loader for potree Binary Point Attributes\n * */\n// @ts-ignore\nexport const PotreeBinLoader: LoaderWithParser = {\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};\n\nfunction parseSync(arrayBuffer: ArrayBuffer, options?: LoaderOptions) {\n  const index = {};\n  const byteOffset = 0;\n  parsePotreeBin(arrayBuffer, byteOffset, options, index);\n  return index;\n}\n"],"mappings":"AACA,SAAQA,OAAO,IAAIC,cAAc,QAAO,4BAA4B;AAMpE,OAAO,MAAMC,eAAiC,GAAG;EAC/CC,IAAI,EAAE,gCAAgC;EACtCC,EAAE,EAAE,QAAQ;EACZC,UAAU,EAAE,CAAC,KAAK,CAAC;EACnBC,SAAS,EAAE,CAAC,0BAA0B,CAAC;EAGvCC,SAAS;EACTC,MAAM,EAAE;AACV,CAAC;AAED,SAASD,SAASA,CAACE,WAAwB,EAAEC,OAAuB,EAAE;EACpE,MAAMC,KAAK,GAAG,CAAC,CAAC;EAChB,MAAMC,UAAU,GAAG,CAAC;EACpBX,cAAc,CAACQ,WAAW,EAAEG,UAAU,EAAEF,OAAO,EAAEC,KAAK,CAAC;EACvD,OAAOA,KAAK;AACd"}
+{"version":3,"file":"potree-bin-loader.js","names":["parsePotreeBin","PotreeBinLoader","name","id","extensions","mimeTypes","parseSync","binary","arrayBuffer","options","index","byteOffset"],"sources":["../../src/potree-bin-loader.ts"],"sourcesContent":["import type {LoaderWithParser, LoaderOptions} from '@loaders.gl/loader-utils';\nimport {parsePotreeBin} from './parsers/parse-potree-bin';\n\n/**\n * Loader for potree Binary Point Attributes\n * */\n// @ts-ignore\nexport const PotreeBinLoader: LoaderWithParser<{}, never, LoaderOptions> = {\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};\n\nfunction parseSync(arrayBuffer: ArrayBuffer, options?: LoaderOptions): {} {\n  const index = {};\n  const byteOffset = 0;\n  parsePotreeBin(arrayBuffer, byteOffset, options, index);\n  return index;\n}\n"],"mappings":"AACA,SAAQA,cAAc,QAAO,4BAA4B;AAMzD,OAAO,MAAMC,eAA2D,GAAG;EACzEC,IAAI,EAAE,gCAAgC;EACtCC,EAAE,EAAE,QAAQ;EACZC,UAAU,EAAE,CAAC,KAAK,CAAC;EACnBC,SAAS,EAAE,CAAC,0BAA0B,CAAC;EAGvCC,SAAS;EACTC,MAAM,EAAE;AACV,CAAC;AAED,SAASD,SAASA,CAACE,WAAwB,EAAEC,OAAuB,EAAM;EACxE,MAAMC,KAAK,GAAG,CAAC,CAAC;EAChB,MAAMC,UAAU,GAAG,CAAC;EACpBX,cAAc,CAACQ,WAAW,EAAEG,UAAU,EAAEF,OAAO,EAAEC,KAAK,CAAC;EACvD,OAAOA,KAAK;AACd"}

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

@@ -1,14 +1,11 @@
-import { default as parsePotreeHierarchyChunk } from './parsers/parse-potree-hierarchy-chunk';
+import { parsePotreeHierarchyChunk } from './parsers/parse-potree-hierarchy-chunk';
 export const PotreeHierarchyChunkLoader = {
   id: 'potree',
   name: 'potree Hierarchy Chunk',
   extensions: ['hrc'],
   mimeTypes: ['application/octet-stream'],
-  parse: async (arrayBuffer, options) => await parseSync(arrayBuffer),
-  parseSync,
+  parse: async (arrayBuffer, options) => parsePotreeHierarchyChunk(arrayBuffer),
+  parseSync: (arrayBuffer, options) => parsePotreeHierarchyChunk(arrayBuffer),
   binary: true
 };
-function parseSync(arrayBuffer) {
-  return parsePotreeHierarchyChunk(arrayBuffer);
-}
 //# sourceMappingURL=potree-hierarchy-chunk-loader.js.map

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

@@ -1 +1 @@
-{"version":3,"file":"potree-hierarchy-chunk-loader.js","names":["default","parsePotreeHierarchyChunk","PotreeHierarchyChunkLoader","id","name","extensions","mimeTypes","parse","arrayBuffer","options","parseSync","binary"],"sources":["../../src/potree-hierarchy-chunk-loader.ts"],"sourcesContent":["import type {LoaderWithParser} from '@loaders.gl/loader-utils';\nimport {default as parsePotreeHierarchyChunk} from './parsers/parse-potree-hierarchy-chunk';\n\n/** Potree hierarchy chunk loader */\n// @ts-ignore\nexport const PotreeHierarchyChunkLoader: LoaderWithParser = {\n  id: 'potree',\n  name: 'potree Hierarchy Chunk',\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) => await parseSync(arrayBuffer),\n  parseSync,\n  binary: true\n};\n\nfunction parseSync(arrayBuffer) {\n  return parsePotreeHierarchyChunk(arrayBuffer);\n}\n"],"mappings":"AACA,SAAQA,OAAO,IAAIC,yBAAyB,QAAO,wCAAwC;AAI3F,OAAO,MAAMC,0BAA4C,GAAG;EAC1DC,EAAE,EAAE,QAAQ;EACZC,IAAI,EAAE,wBAAwB;EAC9BC,UAAU,EAAE,CAAC,KAAK,CAAC;EACnBC,SAAS,EAAE,CAAC,0BAA0B,CAAC;EAGvCC,KAAK,EAAE,MAAAA,CAAOC,WAAW,EAAEC,OAAO,KAAK,MAAMC,SAAS,CAACF,WAAW,CAAC;EACnEE,SAAS;EACTC,MAAM,EAAE;AACV,CAAC;AAED,SAASD,SAASA,CAACF,WAAW,EAAE;EAC9B,OAAOP,yBAAyB,CAACO,WAAW,CAAC;AAC/C"}
+{"version":3,"file":"potree-hierarchy-chunk-loader.js","names":["parsePotreeHierarchyChunk","PotreeHierarchyChunkLoader","id","name","extensions","mimeTypes","parse","arrayBuffer","options","parseSync","binary"],"sources":["../../src/potree-hierarchy-chunk-loader.ts"],"sourcesContent":["import type {LoaderWithParser} from '@loaders.gl/loader-utils';\nimport type {POTreeLoaderOptions} from './potree-loader';\nimport type {POTreeNode} from './parsers/parse-potree-hierarchy-chunk';\nimport {parsePotreeHierarchyChunk} from './parsers/parse-potree-hierarchy-chunk';\n\n/** Potree hierarchy chunk loader */\n// @ts-ignore not a valid loader\nexport const PotreeHierarchyChunkLoader: LoaderWithParser<POTreeNode, never, POTreeLoaderOptions> =\n  {\n    id: 'potree',\n    name: 'potree Hierarchy Chunk',\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    binary: true\n  };\n"],"mappings":"AAGA,SAAQA,yBAAyB,QAAO,wCAAwC;AAIhF,OAAO,MAAMC,0BAAoF,GAC/F;EACEC,EAAE,EAAE,QAAQ;EACZC,IAAI,EAAE,wBAAwB;EAC9BC,UAAU,EAAE,CAAC,KAAK,CAAC;EACnBC,SAAS,EAAE,CAAC,0BAA0B,CAAC;EAGvCC,KAAK,EAAE,MAAAA,CAAOC,WAAW,EAAEC,OAAO,KAAKR,yBAAyB,CAACO,WAAW,CAAC;EAC7EE,SAAS,EAAEA,CAACF,WAAW,EAAEC,OAAO,KAAKR,yBAAyB,CAACO,WAAW,CAAC;EAC3EG,MAAM,EAAE;AACV,CAAC"}

package/dist/esm/potree-loader.js

@@ -1,4 +1,4 @@
-const VERSION = typeof "4.0.0-alpha.8" !== 'undefined' ? "4.0.0-alpha.8" : 'latest';
+const VERSION = typeof "4.0.0-beta.1" !== 'undefined' ? "4.0.0-beta.1" : 'latest';
 export const PotreeLoader = {
   name: 'potree',
   id: 'potree',

package/dist/esm/potree-loader.js.map

@@ -1 +1 @@
-{"version":3,"file":"potree-loader.js","names":["VERSION","PotreeLoader","name","id","module","version","extensions","mimeTypes","testText","text","indexOf","parseTextSync","JSON","parse","options","potree"],"sources":["../../src/potree-loader.ts"],"sourcesContent":["import type {LoaderWithParser} from '@loaders.gl/loader-utils';\n\n// __VERSION__ is injected by babel-plugin-version-inline\n// @ts-ignore TS2304: Cannot find name '__VERSION__'.\nconst VERSION = typeof __VERSION__ !== 'undefined' ? __VERSION__ : 'latest';\n\n/** Potree loader */\n// @ts-ignore\nexport const PotreeLoader: LoaderWithParser = {\n  name: 'potree',\n  id: 'potree',\n  module: 'potree',\n  version: VERSION,\n  extensions: ['json'],\n  mimeTypes: ['application/json'],\n  testText: (text) => text.indexOf('octreeDir') >= 0,\n  parseTextSync: (text) => JSON.parse(text),\n  options: {\n    potree: {}\n  }\n};\n"],"mappings":"AAIA,MAAMA,OAAO,GAAG,sBAAkB,KAAK,WAAW,qBAAiB,QAAQ;AAI3E,OAAO,MAAMC,YAA8B,GAAG;EAC5CC,IAAI,EAAE,QAAQ;EACdC,EAAE,EAAE,QAAQ;EACZC,MAAM,EAAE,QAAQ;EAChBC,OAAO,EAAEL,OAAO;EAChBM,UAAU,EAAE,CAAC,MAAM,CAAC;EACpBC,SAAS,EAAE,CAAC,kBAAkB,CAAC;EAC/BC,QAAQ,EAAGC,IAAI,IAAKA,IAAI,CAACC,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC;EAClDC,aAAa,EAAGF,IAAI,IAAKG,IAAI,CAACC,KAAK,CAACJ,IAAI,CAAC;EACzCK,OAAO,EAAE;IACPC,MAAM,EAAE,CAAC;EACX;AACF,CAAC"}
+{"version":3,"file":"potree-loader.js","names":["VERSION","PotreeLoader","name","id","module","version","extensions","mimeTypes","testText","text","indexOf","parseTextSync","JSON","parse","options","potree"],"sources":["../../src/potree-loader.ts"],"sourcesContent":["import type {LoaderWithParser, LoaderOptions} from '@loaders.gl/loader-utils';\n\n// __VERSION__ is injected by babel-plugin-version-inline\n// @ts-ignore TS2304: Cannot find name '__VERSION__'.\nconst VERSION = typeof __VERSION__ !== 'undefined' ? __VERSION__ : 'latest';\n\nexport type POTreeLoaderOptions = LoaderOptions & {\n  potree?: {};\n};\n\n/** Potree loader */\n// @ts-ignore\nexport const PotreeLoader: LoaderWithParser<any, never, POTreeLoaderOptions> = {\n  name: 'potree',\n  id: 'potree',\n  module: 'potree',\n  version: VERSION,\n  extensions: ['json'],\n  mimeTypes: ['application/json'],\n  testText: (text) => text.indexOf('octreeDir') >= 0,\n  parseTextSync: (text) => JSON.parse(text),\n  options: {\n    potree: {}\n  }\n};\n"],"mappings":"AAIA,MAAMA,OAAO,GAAG,qBAAkB,KAAK,WAAW,oBAAiB,QAAQ;AAQ3E,OAAO,MAAMC,YAA+D,GAAG;EAC7EC,IAAI,EAAE,QAAQ;EACdC,EAAE,EAAE,QAAQ;EACZC,MAAM,EAAE,QAAQ;EAChBC,OAAO,EAAEL,OAAO;EAChBM,UAAU,EAAE,CAAC,MAAM,CAAC;EACpBC,SAAS,EAAE,CAAC,kBAAkB,CAAC;EAC/BC,QAAQ,EAAGC,IAAI,IAAKA,IAAI,CAACC,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC;EAClDC,aAAa,EAAGF,IAAI,IAAKG,IAAI,CAACC,KAAK,CAACJ,IAAI,CAAC;EACzCK,OAAO,EAAE;IACPC,MAAM,EAAE,CAAC;EACX;AACF,CAAC"}

package/dist/parsers/parse-potree-bin.d.ts

@@ -1,2 +1,2 @@
-export default function parsePotreeBin(arrayBuffer: ArrayBuffer, byteOffset: number, options: unknown, index: any): null;
+export declare function parsePotreeBin(arrayBuffer: ArrayBuffer, byteOffset: number, options: unknown, index: any): null;
 //# sourceMappingURL=parse-potree-bin.d.ts.map

package/dist/parsers/parse-potree-bin.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"parse-potree-bin.d.ts","sourceRoot":"","sources":["../../src/parsers/parse-potree-bin.ts"],"names":[],"mappings":"AAAA,MAAM,CAAC,OAAO,UAAU,cAAc,CACpC,WAAW,EAAE,WAAW,EACxB,UAAU,EAAE,MAAM,EAClB,OAAO,EAAE,OAAO,EAChB,KAAK,EAAE,GAAG,QAGX"}
+{"version":3,"file":"parse-potree-bin.d.ts","sourceRoot":"","sources":["../../src/parsers/parse-potree-bin.ts"],"names":[],"mappings":"AAAA,wBAAgB,cAAc,CAC5B,WAAW,EAAE,WAAW,EACxB,UAAU,EAAE,MAAM,EAClB,OAAO,EAAE,OAAO,EAChB,KAAK,EAAE,GAAG,QAGX"}

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

@@ -1,2 +1,16 @@
-export default function parsePotreeHierarchyChunk(arrayBuffer: ArrayBuffer): any;
+/** @todo these types are an incorrect mess */
+export type POTreeTileHeader = {
+    childCount: number;
+    name: string;
+    childMask: number;
+};
+/** @todo these types are an incorrect mess */
+export type POTreeNode = {
+    header: POTreeTileHeader;
+    name: string;
+    pointCount: number;
+    children: POTreeNode[];
+    childrenByIndex: POTreeNode[];
+};
+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":"AA2DA,MAAM,CAAC,OAAO,UAAU,yBAAyB,CAAC,WAAW,EAAE,WAAW,OAGzE"}
+{"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"}

package/dist/potree-bin-loader.d.ts

@@ -1,6 +1,6 @@
-import type { LoaderWithParser } from '@loaders.gl/loader-utils';
+import type { LoaderWithParser, LoaderOptions } from '@loaders.gl/loader-utils';
 /**
  * Loader for potree Binary Point Attributes
  * */
-export declare const PotreeBinLoader: LoaderWithParser;
+export declare const PotreeBinLoader: LoaderWithParser<{}, never, LoaderOptions>;
 //# sourceMappingURL=potree-bin-loader.d.ts.map

package/dist/potree-bin-loader.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"potree-bin-loader.d.ts","sourceRoot":"","sources":["../src/potree-bin-loader.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAC,gBAAgB,EAAgB,MAAM,0BAA0B,CAAC;AAG9E;;KAEK;AAEL,eAAO,MAAM,eAAe,EAAE,gBAS7B,CAAC"}
+{"version":3,"file":"potree-bin-loader.d.ts","sourceRoot":"","sources":["../src/potree-bin-loader.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAC,gBAAgB,EAAE,aAAa,EAAC,MAAM,0BAA0B,CAAC;AAG9E;;KAEK;AAEL,eAAO,MAAM,eAAe,EAAE,gBAAgB,CAAC,EAAE,EAAE,KAAK,EAAE,aAAa,CAStE,CAAC"}

package/dist/potree-hierarchy-chunk-loader.d.ts

@@ -1,4 +1,6 @@
 import type { LoaderWithParser } from '@loaders.gl/loader-utils';
+import type { POTreeLoaderOptions } from './potree-loader';
+import type { POTreeNode } from './parsers/parse-potree-hierarchy-chunk';
 /** Potree hierarchy chunk loader */
-export declare const PotreeHierarchyChunkLoader: LoaderWithParser;
+export declare const PotreeHierarchyChunkLoader: LoaderWithParser<POTreeNode, never, POTreeLoaderOptions>;
 //# sourceMappingURL=potree-hierarchy-chunk-loader.d.ts.map

package/dist/potree-hierarchy-chunk-loader.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"potree-hierarchy-chunk-loader.d.ts","sourceRoot":"","sources":["../src/potree-hierarchy-chunk-loader.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAC,gBAAgB,EAAC,MAAM,0BAA0B,CAAC;AAG/D,oCAAoC;AAEpC,eAAO,MAAM,0BAA0B,EAAE,gBAUxC,CAAC"}
+{"version":3,"file":"potree-hierarchy-chunk-loader.d.ts","sourceRoot":"","sources":["../src/potree-hierarchy-chunk-loader.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAC,gBAAgB,EAAC,MAAM,0BAA0B,CAAC;AAC/D,OAAO,KAAK,EAAC,mBAAmB,EAAC,MAAM,iBAAiB,CAAC;AACzD,OAAO,KAAK,EAAC,UAAU,EAAC,MAAM,wCAAwC,CAAC;AAGvE,oCAAoC;AAEpC,eAAO,MAAM,0BAA0B,EAAE,gBAAgB,CAAC,UAAU,EAAE,KAAK,EAAE,mBAAmB,CAW7F,CAAC"}

package/dist/potree-loader.d.ts

@@ -1,4 +1,7 @@
-import type { LoaderWithParser } from '@loaders.gl/loader-utils';
+import type { LoaderWithParser, LoaderOptions } from '@loaders.gl/loader-utils';
+export type POTreeLoaderOptions = LoaderOptions & {
+    potree?: {};
+};
 /** Potree loader */
-export declare const PotreeLoader: LoaderWithParser;
+export declare const PotreeLoader: LoaderWithParser<any, never, POTreeLoaderOptions>;
 //# sourceMappingURL=potree-loader.d.ts.map

package/dist/potree-loader.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"potree-loader.d.ts","sourceRoot":"","sources":["../src/potree-loader.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAC,gBAAgB,EAAC,MAAM,0BAA0B,CAAC;AAM/D,oBAAoB;AAEpB,eAAO,MAAM,YAAY,EAAE,gBAY1B,CAAC"}
+{"version":3,"file":"potree-loader.d.ts","sourceRoot":"","sources":["../src/potree-loader.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAC,gBAAgB,EAAE,aAAa,EAAC,MAAM,0BAA0B,CAAC;AAM9E,MAAM,MAAM,mBAAmB,GAAG,aAAa,GAAG;IAChD,MAAM,CAAC,EAAE,EAAE,CAAC;CACb,CAAC;AAEF,oBAAoB;AAEpB,eAAO,MAAM,YAAY,EAAE,gBAAgB,CAAC,GAAG,EAAE,KAAK,EAAE,mBAAmB,CAY1E,CAAC"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@loaders.gl/potree",
-  "version": "4.0.0-alpha.8",
+  "version": "4.0.0-beta.1",
   "description": "potree loaders for large point clouds.",
   "license": "MIT",
   "publishConfig": {
@@ -35,8 +35,8 @@
     "build-bundle": "esbuild src/bundle.ts --bundle --outfile=dist/dist.min.js"
   },
   "dependencies": {
-    "@loaders.gl/math": "4.0.0-alpha.8",
+    "@loaders.gl/math": "4.0.0-beta.1",
     "@math.gl/core": "^3.5.1"
   },
-  "gitHead": "c35d6640c8d26deab99e277a8e698b5174233789"
+  "gitHead": "35c625e67132b0784e597d9ddabae8aefea29ff2"
 }

package/src/parsers/parse-potree-bin.ts

@@ -1,4 +1,4 @@
-export default function parsePotreeBin(
+export function parsePotreeBin(
   arrayBuffer: ArrayBuffer,
   byteOffset: number,
   options: unknown,

package/src/parsers/parse-potree-hierarchy-chunk.ts

@@ -54,10 +54,26 @@ Would have an index looking like this:
 | r36  | `0b00000000` (=0)  | `1`    |
 */
 
-// @ts-nocheck
+/** @todo these types are an incorrect mess */
+export type POTreeTileHeader = {
+  childCount: number;
+  name: string;
+  childMask: number;
+};
+
+/** @todo these types are an incorrect mess */
+export type POTreeNode = {
+  header: POTreeTileHeader;
+  name: string;
+  pointCount: number;
+  children: POTreeNode[];
+  childrenByIndex: POTreeNode[];
+};
+
+// type POTreeTileNode = POTreeNode;
 
 // load hierarchy
-export default function parsePotreeHierarchyChunk(arrayBuffer: ArrayBuffer) {
+export function parsePotreeHierarchyChunk(arrayBuffer: ArrayBuffer) {
   const tileHeaders = parseBinaryChunk(arrayBuffer);
   return buildHierarchy(tileHeaders);
 }
@@ -66,15 +82,16 @@ export default function parsePotreeHierarchyChunk(arrayBuffer: ArrayBuffer) {
 function parseBinaryChunk(arrayBuffer: ArrayBuffer, byteOffset = 0) {
   const dataView = new DataView(arrayBuffer);
 
-  const stack = [];
+  const stack: POTreeNode[] = [];
 
   // Get root mask
-  const topTileHeader = {};
+  // @ts-expect-error
+  const topTileHeader: POTreeNode = {};
   byteOffset = decodeRow(dataView, byteOffset, topTileHeader);
 
   stack.push(topTileHeader);
 
-  const tileHeaders = [];
+  const tileHeaders: POTreeTileHeader[] = [];
 
   while (stack.length > 0) {
     const snode = stack.shift();
@@ -82,10 +99,12 @@ function parseBinaryChunk(arrayBuffer: ArrayBuffer, byteOffset = 0) {
 
     for (let i = 0; i < 8; i++) {
       if (snode && (snode.header.childMask & mask) !== 0) {
-        const tileHeader = {};
+        // @ts-expect-error
+        const tileHeader: POTreeTileHeader = {};
         byteOffset = decodeRow(dataView, byteOffset, tileHeader);
         tileHeader.name = snode.name + i;
 
+        // @ts-expect-error
         stack.push(tileHeader);
         tileHeaders.push(tileHeader);
         snode.header.childCount++;
@@ -112,7 +131,7 @@ function decodeRow(dataView, byteOffset, tileHeader) {
 }
 
 // Resolves the binary rows into a hierarchy (tree structure)
-function buildHierarchy(tileHeaders, options = {}) {
+function buildHierarchy(tileHeaders, options: {spacing?: number} = {}): POTreeNode {
   const DEFAULT_OPTIONS = {spacing: 100}; // TODO assert instead of default?
   options = {...DEFAULT_OPTIONS, ...options};
 
@@ -132,7 +151,7 @@ function buildHierarchy(tileHeaders, options = {}) {
     tileHeader.hasChildren = tileHeader.header.childCount;
     tileHeader.children = [];
     tileHeader.childrenByIndex = new Array(8).fill(null);
-    tileHeader.spacing = options.spacing / Math.pow(2, level);
+    tileHeader.spacing = (options?.spacing || 0) / Math.pow(2, level);
     // tileHeader.boundingVolume = Utils.createChildAABB(parentNode.boundingBox, index);
 
     if (parentNode) {

package/src/potree-bin-loader.ts

@@ -1,11 +1,11 @@
 import type {LoaderWithParser, LoaderOptions} from '@loaders.gl/loader-utils';
-import {default as parsePotreeBin} from './parsers/parse-potree-bin';
+import {parsePotreeBin} from './parsers/parse-potree-bin';
 
 /**
  * Loader for potree Binary Point Attributes
  * */
 // @ts-ignore
-export const PotreeBinLoader: LoaderWithParser = {
+export const PotreeBinLoader: LoaderWithParser<{}, never, LoaderOptions> = {
   name: 'potree Binary Point Attributes',
   id: 'potree',
   extensions: ['bin'],
@@ -16,7 +16,7 @@ export const PotreeBinLoader: LoaderWithParser = {
   binary: true
 };
 
-function parseSync(arrayBuffer: ArrayBuffer, options?: LoaderOptions) {
+function parseSync(arrayBuffer: ArrayBuffer, options?: LoaderOptions): {} {
   const index = {};
   const byteOffset = 0;
   parsePotreeBin(arrayBuffer, byteOffset, options, index);

package/src/potree-hierarchy-chunk-loader.ts

@@ -1,20 +1,19 @@
 import type {LoaderWithParser} from '@loaders.gl/loader-utils';
-import {default as parsePotreeHierarchyChunk} from './parsers/parse-potree-hierarchy-chunk';
+import type {POTreeLoaderOptions} from './potree-loader';
+import type {POTreeNode} from './parsers/parse-potree-hierarchy-chunk';
+import {parsePotreeHierarchyChunk} from './parsers/parse-potree-hierarchy-chunk';
 
 /** Potree hierarchy chunk loader */
-// @ts-ignore
-export const PotreeHierarchyChunkLoader: LoaderWithParser = {
-  id: 'potree',
-  name: 'potree Hierarchy Chunk',
-  extensions: ['hrc'],
-  mimeTypes: ['application/octet-stream'],
-  // binary potree files have no header bytes, no content test function possible
-  // test: ['...'],
-  parse: async (arrayBuffer, options) => await parseSync(arrayBuffer),
-  parseSync,
-  binary: true
-};
-
-function parseSync(arrayBuffer) {
-  return parsePotreeHierarchyChunk(arrayBuffer);
-}
+// @ts-ignore not a valid loader
+export const PotreeHierarchyChunkLoader: LoaderWithParser<POTreeNode, never, POTreeLoaderOptions> =
+  {
+    id: 'potree',
+    name: 'potree Hierarchy Chunk',
+    extensions: ['hrc'],
+    mimeTypes: ['application/octet-stream'],
+    // binary potree files have no header bytes, no content test function possible
+    // test: ['...'],
+    parse: async (arrayBuffer, options) => parsePotreeHierarchyChunk(arrayBuffer),
+    parseSync: (arrayBuffer, options) => parsePotreeHierarchyChunk(arrayBuffer),
+    binary: true
+  };

package/src/potree-loader.ts

@@ -1,12 +1,16 @@
-import type {LoaderWithParser} from '@loaders.gl/loader-utils';
+import type {LoaderWithParser, LoaderOptions} from '@loaders.gl/loader-utils';
 
 // __VERSION__ is injected by babel-plugin-version-inline
 // @ts-ignore TS2304: Cannot find name '__VERSION__'.
 const VERSION = typeof __VERSION__ !== 'undefined' ? __VERSION__ : 'latest';
 
+export type POTreeLoaderOptions = LoaderOptions & {
+  potree?: {};
+};
+
 /** Potree loader */
 // @ts-ignore
-export const PotreeLoader: LoaderWithParser = {
+export const PotreeLoader: LoaderWithParser<any, never, POTreeLoaderOptions> = {
   name: 'potree',
   id: 'potree',
   module: 'potree',

package/dist/bundle.js

@@ -1,5 +0,0 @@
-"use strict";
-// @ts-nocheck
-const moduleExports = require('./index');
-globalThis.loaders = globalThis.loaders || {};
-module.exports = Object.assign(globalThis.loaders, moduleExports);

package/dist/index.js

@@ -1,9 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.PotreeBinLoader = exports.PotreeHierarchyChunkLoader = exports.PotreeLoader = void 0;
-var potree_loader_1 = require("./potree-loader");
-Object.defineProperty(exports, "PotreeLoader", { enumerable: true, get: function () { return potree_loader_1.PotreeLoader; } });
-var potree_hierarchy_chunk_loader_1 = require("./potree-hierarchy-chunk-loader");
-Object.defineProperty(exports, "PotreeHierarchyChunkLoader", { enumerable: true, get: function () { return potree_hierarchy_chunk_loader_1.PotreeHierarchyChunkLoader; } });
-var potree_bin_loader_1 = require("./potree-bin-loader");
-Object.defineProperty(exports, "PotreeBinLoader", { enumerable: true, get: function () { return potree_bin_loader_1.PotreeBinLoader; } });

package/dist/lib/octree.js

@@ -1,197 +0,0 @@
-"use strict";
-/* eslint-disable */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.PointCloudOctant = exports.PointCloudOctree = void 0;
-// @ts-nocheck
-class PointCloudOctree {
-    constructor() {
-        this.url = null;
-        this.octreeDir = null;
-        this.spacing = 0;
-        this.boundingBox = null;
-        this.root = null;
-        this.nodes = null;
-        this.pointAttributes = null;
-        this.hierarchyStepSize = -1;
-        this.loader = null;
-    }
-}
-exports.PointCloudOctree = PointCloudOctree;
-class PointCloudOctant {
-    constructor(name, octree, boundingBox) {
-        this.octree = this.id = PointCloudOctreeGeometryNode.IDCount++;
-        this.name = name;
-        this.index = parseInt(name.charAt(name.length - 1));
-        this.octree = octree;
-        this.geometry = null;
-        this.boundingBox = boundingBox;
-        this.boundingSphere = boundingBox.getBoundingSphere(new THREE.Sphere());
-        this.children = {};
-        this.numPoints = 0;
-        this.level = null;
-        this.loaded = false;
-        this.oneTimeDisposeHandlers = [];
-    }
-    isGeometryNode() {
-        return true;
-    }
-    getLevel() {
-        return this.level;
-    }
-    isTreeNode() {
-        return false;
-    }
-    isLoaded() {
-        return this.loaded;
-    }
-    getBoundingSphere() {
-        return this.boundingSphere;
-    }
-    getBoundingBox() {
-        return this.boundingBox;
-    }
-    getChildren() {
-        // Children is a length 8 array with nulls for "missing" octants
-        return this.children.filter(Boolean);
-    }
-    getURL() {
-        const { version } = this.octree;
-        const hierarchyPath = version >= 1.5 ? `${this.getHierarchyPath()}/` : '';
-        return `${this.octree.octreeDir}/${hierarchyPath}${this.name}`;
-    }
-    getHierarchyPath() {
-        let path = 'r/';
-        let hierarchyStepSize = this.octree.hierarchyStepSize;
-        let indices = this.name.substr(1);
-        let numParts = Math.floor(indices.length / hierarchyStepSize);
-        for (let i = 0; i < numParts; i++) {
-            path += indices.substr(i * hierarchyStepSize, hierarchyStepSize) + '/';
-        }
-        path = path.slice(0, -1);
-        return path;
-    }
-    addChild(child) {
-        this.children[child.index] = child;
-        child.parent = this;
-    }
-    load() {
-        if (this.loading === true ||
-            this.loaded === true ||
-            Potree.numNodesLoading >= Potree.maxNodesLoading) {
-            return;
-        }
-        this.loading = true;
-        Potree.numNodesLoading++;
-        if (this.octree.loader.version.equalOrHigher('1.5')) {
-            if (this.level % this.octree.hierarchyStepSize === 0 && this.hasChildren) {
-                this.loadHierachyThenPoints();
-            }
-            else {
-                this.loadPoints();
-            }
-        }
-        else {
-            this.loadPoints();
-        }
-    }
-    loadPoints() {
-        this.octree.loader.load(this);
-    }
-    loadHierachyThenPoints() {
-        let node = this;
-        // load hierarchy
-        let callback = function (node, hbuffer) {
-            let view = new DataView(hbuffer);
-            let stack = [];
-            let children = view.getUint8(0);
-            let numPoints = view.getUint32(1, true);
-            node.numPoints = numPoints;
-            stack.push({ children: children, numPoints: numPoints, name: node.name });
-            let decoded = [];
-            let offset = 5;
-            while (stack.length > 0) {
-                let snode = stack.shift();
-                let mask = 1;
-                for (let i = 0; i < 8; i++) {
-                    if ((snode.children & mask) !== 0) {
-                        let childName = snode.name + i;
-                        let childChildren = view.getUint8(offset);
-                        let childNumPoints = view.getUint32(offset + 1, true);
-                        stack.push({ children: childChildren, numPoints: childNumPoints, name: childName });
-                        decoded.push({ children: childChildren, numPoints: childNumPoints, name: childName });
-                        offset += 5;
-                    }
-                    mask = mask * 2;
-                }
-                if (offset === hbuffer.byteLength) {
-                    break;
-                }
-            }
-            // console.log(decoded);
-            let nodes = {};
-            nodes[node.name] = node;
-            let pco = node.pcoGeometry;
-            for (let i = 0; i < decoded.length; i++) {
-                let name = decoded[i].name;
-                let decodedNumPoints = decoded[i].numPoints;
-                let index = parseInt(name.charAt(name.length - 1));
-                let parentName = name.substring(0, name.length - 1);
-                let parentNode = nodes[parentName];
-                let level = name.length - 1;
-                let boundingBox = Utils.createChildAABB(parentNode.boundingBox, index);
-                let currentNode = new PointCloudOctreeGeometryNode(name, pco, boundingBox);
-                currentNode.level = level;
-                currentNode.numPoints = decodedNumPoints;
-                currentNode.hasChildren = decoded[i].children > 0;
-                currentNode.spacing = pco.spacing / Math.pow(2, level);
-                parentNode.addChild(currentNode);
-                nodes[name] = currentNode;
-            }
-            node.loadPoints();
-        };
-        if (node.level % node.pcoGeometry.hierarchyStepSize === 0) {
-            // let hurl = node.pcoGeometry.octreeDir + "/../hierarchy/" + node.name + ".hrc";
-            let hurl = node.pcoGeometry.octreeDir + '/' + node.getHierarchyPath() + '/' + node.name + '.hrc';
-            let xhr = XHRFactory.createXMLHttpRequest();
-            xhr.open('GET', hurl, true);
-            xhr.responseType = 'arraybuffer';
-            xhr.overrideMimeType('text/plain; charset=x-user-defined');
-            xhr.onreadystatechange = () => {
-                if (xhr.readyState === 4) {
-                    if (xhr.status === 200 || xhr.status === 0) {
-                        let hbuffer = xhr.response;
-                        callback(node, hbuffer);
-                    }
-                    else {
-                        console.log('Failed to load file! HTTP status: ' + xhr.status + ', file: ' + hurl);
-                        Potree.numNodesLoading--;
-                    }
-                }
-            };
-            try {
-                xhr.send(null);
-            }
-            catch (e) {
-                console.log('fehler beim laden der punktwolke: ' + e);
-            }
-        }
-    }
-    getNumPoints() {
-        return this.numPoints;
-    }
-    dispose() {
-        if (this.geometry && this.parent != null) {
-            this.geometry.dispose();
-            this.geometry = null;
-            this.loaded = false;
-            // this.dispatchEvent( { type: 'dispose' } );
-            for (let i = 0; i < this.oneTimeDisposeHandlers.length; i++) {
-                let handler = this.oneTimeDisposeHandlers[i];
-                handler();
-            }
-            this.oneTimeDisposeHandlers = [];
-        }
-    }
-}
-exports.PointCloudOctant = PointCloudOctant;
-PointCloudOctreeGeometryNode.IDCount = 0;

package/dist/parsers/parse-potree-bin.js

@@ -1,6 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-function parsePotreeBin(arrayBuffer, byteOffset, options, index) {
-    return null;
-}
-exports.default = parsePotreeBin;

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

@@ -1,129 +0,0 @@
-"use strict";
-// 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
-Object.defineProperty(exports, "__esModule", { value: true });
-// Potree Hierarchy Chunk file format
-// https://github.com/potree/potree/blob/develop/docs/potree-file-format.md#index-files
-/*
-### Hierarchy Chunk Files
-
-As mentioned in the former section, the `.hrc` files contain the index structure
-meaning a list of all the files stored within the directory tree.
-
-An index file contains a list of tuple values with the first being a `uint8`
-"mask" and the second being `uint32` "number of points" of a hierarchy level
-in a [breadth first level order][breadth-first].
-
-Per hierarchy level we have 8 possible nodes. To indicate whether a node exists
-a simple binary mask is used:
-
-| Position | Mask | [Binary][bin] |
-|----------|------|---------------|
-| 0        | 1    | 0b00000001    |
-| 1        | 2    | 0b00000010    |
-| 2        | 4    | 0b00000100    |
-| 3        | 8    | 0b00001000    |
-| 4        | 16   | 0b00010000    |
-| 5        | 32   | 0b00100000    |
-| 6        | 64   | 0b01000000    |
-| 7        | 128  | 0b10000000    |
-
-So if in a hierarchy the child node 3 and node 7 exist then the hierarchies
-mask has to be `0b00001000 | 0b10000000` → `0b10001000` (=136).
-
-_Example:_ A simple, non-realistic tree:
-
-```
-|- r1
-|  |
-|  \- r14 (2 Points)
-|
-\- r3
-   |
-   \- r36 (1 Point)
-```
-
-Would have an index looking like this:
-
-| name | mask               | points |
-|------|--------------------|--------|
-| r    | `0b00001010` (=10) | `3`    |
-| r1   | `0b00010000` (=16) | `2`    |
-| r3   | `0b01000000` (=64) | `1`    |
-| r14  | `0b00000000` (=0)  | `2`    |
-| r36  | `0b00000000` (=0)  | `1`    |
-*/
-// @ts-nocheck
-// load hierarchy
-function parsePotreeHierarchyChunk(arrayBuffer) {
-    const tileHeaders = parseBinaryChunk(arrayBuffer);
-    return buildHierarchy(tileHeaders);
-}
-exports.default = parsePotreeHierarchyChunk;
-// Parses the binary rows
-function parseBinaryChunk(arrayBuffer, byteOffset = 0) {
-    const dataView = new DataView(arrayBuffer);
-    const stack = [];
-    // Get root mask
-    const topTileHeader = {};
-    byteOffset = decodeRow(dataView, byteOffset, topTileHeader);
-    stack.push(topTileHeader);
-    const tileHeaders = [];
-    while (stack.length > 0) {
-        const snode = stack.shift();
-        let mask = 1;
-        for (let i = 0; i < 8; i++) {
-            if (snode && (snode.header.childMask & mask) !== 0) {
-                const tileHeader = {};
-                byteOffset = decodeRow(dataView, byteOffset, tileHeader);
-                tileHeader.name = snode.name + i;
-                stack.push(tileHeader);
-                tileHeaders.push(tileHeader);
-                snode.header.childCount++;
-            }
-            mask = mask * 2;
-        }
-        if (byteOffset === dataView.byteLength) {
-            break;
-        }
-    }
-    return tileHeaders;
-}
-function decodeRow(dataView, byteOffset, tileHeader) {
-    tileHeader.header = tileHeader.header || {};
-    tileHeader.header.childMask = dataView.getUint8(byteOffset);
-    tileHeader.header.childCount = 0;
-    tileHeader.pointCount = dataView.getUint32(byteOffset + 1, true);
-    tileHeader.name = '';
-    byteOffset += 5;
-    return byteOffset;
-}
-// Resolves the binary rows into a hierarchy (tree structure)
-function buildHierarchy(tileHeaders, options = {}) {
-    const DEFAULT_OPTIONS = { spacing: 100 }; // TODO assert instead of default?
-    options = { ...DEFAULT_OPTIONS, ...options };
-    const topNode = tileHeaders[0];
-    const nodes = {};
-    for (const tileHeader of tileHeaders) {
-        const { name } = tileHeader;
-        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 / Math.pow(2, level);
-        // tileHeader.boundingVolume = Utils.createChildAABB(parentNode.boundingBox, index);
-        if (parentNode) {
-            parentNode.children.push(tileHeader);
-            parentNode.childrenByIndex[index] = tileHeader;
-        }
-        // Add the node to the map
-        nodes[name] = tileHeader;
-    }
-    // First node is the root
-    return topNode;
-}

package/dist/potree-bin-loader.js

@@ -1,27 +0,0 @@
-"use strict";
-var __importDefault = (this && this.__importDefault) || function (mod) {
-    return (mod && mod.__esModule) ? mod : { "default": mod };
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.PotreeBinLoader = void 0;
-const parse_potree_bin_1 = __importDefault(require("./parsers/parse-potree-bin"));
-/**
- * Loader for potree Binary Point Attributes
- * */
-// @ts-ignore
-exports.PotreeBinLoader = {
-    name: 'potree Binary Point Attributes',
-    id: 'potree',
-    extensions: ['bin'],
-    mimeTypes: ['application/octet-stream'],
-    // Unfortunately binary potree files have no header bytes, no test possible
-    // test: ['...'],
-    parseSync,
-    binary: true
-};
-function parseSync(arrayBuffer, options) {
-    const index = {};
-    const byteOffset = 0;
-    (0, parse_potree_bin_1.default)(arrayBuffer, byteOffset, options, index);
-    return index;
-}

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

@@ -1,23 +0,0 @@
-"use strict";
-var __importDefault = (this && this.__importDefault) || function (mod) {
-    return (mod && mod.__esModule) ? mod : { "default": mod };
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.PotreeHierarchyChunkLoader = void 0;
-const parse_potree_hierarchy_chunk_1 = __importDefault(require("./parsers/parse-potree-hierarchy-chunk"));
-/** Potree hierarchy chunk loader */
-// @ts-ignore
-exports.PotreeHierarchyChunkLoader = {
-    id: 'potree',
-    name: 'potree Hierarchy Chunk',
-    extensions: ['hrc'],
-    mimeTypes: ['application/octet-stream'],
-    // binary potree files have no header bytes, no content test function possible
-    // test: ['...'],
-    parse: async (arrayBuffer, options) => await parseSync(arrayBuffer),
-    parseSync,
-    binary: true
-};
-function parseSync(arrayBuffer) {
-    return (0, parse_potree_hierarchy_chunk_1.default)(arrayBuffer);
-}

package/dist/potree-loader.js

@@ -1,21 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.PotreeLoader = void 0;
-// __VERSION__ is injected by babel-plugin-version-inline
-// @ts-ignore TS2304: Cannot find name '__VERSION__'.
-const VERSION = typeof __VERSION__ !== 'undefined' ? __VERSION__ : 'latest';
-/** Potree loader */
-// @ts-ignore
-exports.PotreeLoader = {
-    name: 'potree',
-    id: 'potree',
-    module: 'potree',
-    version: VERSION,
-    extensions: ['json'],
-    mimeTypes: ['application/json'],
-    testText: (text) => text.indexOf('octreeDir') >= 0,
-    parseTextSync: (text) => JSON.parse(text),
-    options: {
-        potree: {}
-    }
-};