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

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

@@ -1,129 +1,83 @@
-"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    |
+export default function parsePotreeHierarchyChunk(arrayBuffer) {
+  const tileHeaders = parseBinaryChunk(arrayBuffer);
+  return buildHierarchy(tileHeaders);
+}
 
-So if in a hierarchy the child node 3 and node 7 exist then the hierarchies
-mask has to be `0b00001000 | 0b10000000` → `0b10001000` (=136).
+function parseBinaryChunk(arrayBuffer, byteOffset = 0) {
+  const dataView = new DataView(arrayBuffer);
+  const stack = [];
+  const topTileHeader = {};
+  byteOffset = decodeRow(dataView, byteOffset, topTileHeader);
+  stack.push(topTileHeader);
+  const tileHeaders = [];
 
-_Example:_ A simple, non-realistic tree:
+  while (stack.length > 0) {
+    const snode = stack.shift();
+    let mask = 1;
 
-```
-|- r1
-|  |
-|  \- r14 (2 Points)
-|
-\- r3
-   |
-   \- r36 (1 Point)
-```
+    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++;
+      }
 
-Would have an index looking like this:
+      mask = mask * 2;
+    }
 
-| 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;
-        }
+    if (byteOffset === dataView.byteLength) {
+      break;
     }
-    return tileHeaders;
+  }
+
+  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;
+  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;
+  const DEFAULT_OPTIONS = {
+    spacing: 100
+  };
+  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;
+    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);
+
+    if (parentNode) {
+      parentNode.children.push(tileHeader);
+      parentNode.childrenByIndex[index] = tileHeader;
     }
-    // First node is the root
-    return topNode;
+
+    nodes[name] = tileHeader;
+  }
+
+  return topNode;
 }
+//# sourceMappingURL=parse-potree-hierarchy-chunk.js.map

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

@@ -0,0 +1 @@
+{"version":3,"sources":["../../src/parsers/parse-potree-hierarchy-chunk.ts"],"names":["parsePotreeHierarchyChunk","arrayBuffer","tileHeaders","parseBinaryChunk","buildHierarchy","byteOffset","dataView","DataView","stack","topTileHeader","decodeRow","push","length","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"],"mappings":"AA2DA,eAAe,SAASA,yBAAT,CAAmCC,WAAnC,EAA6D;AAC1E,QAAMC,WAAW,GAAGC,gBAAgB,CAACF,WAAD,CAApC;AACA,SAAOG,cAAc,CAACF,WAAD,CAArB;AACD;;AAGD,SAASC,gBAAT,CAA0BF,WAA1B,EAAoDI,UAAU,GAAG,CAAjE,EAAoE;AAClE,QAAMC,QAAQ,GAAG,IAAIC,QAAJ,CAAaN,WAAb,CAAjB;AAEA,QAAMO,KAAK,GAAG,EAAd;AAGA,QAAMC,aAAa,GAAG,EAAtB;AACAJ,EAAAA,UAAU,GAAGK,SAAS,CAACJ,QAAD,EAAWD,UAAX,EAAuBI,aAAvB,CAAtB;AAEAD,EAAAA,KAAK,CAACG,IAAN,CAAWF,aAAX;AAEA,QAAMP,WAAW,GAAG,EAApB;;AAEA,SAAOM,KAAK,CAACI,MAAN,GAAe,CAAtB,EAAyB;AACvB,UAAMC,KAAK,GAAGL,KAAK,CAACM,KAAN,EAAd;AACA,QAAIC,IAAI,GAAG,CAAX;;AAEA,SAAK,IAAIC,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAG,CAApB,EAAuBA,CAAC,EAAxB,EAA4B;AAC1B,UAAIH,KAAK,IAAI,CAACA,KAAK,CAACI,MAAN,CAAaC,SAAb,GAAyBH,IAA1B,MAAoC,CAAjD,EAAoD;AAClD,cAAMI,UAAU,GAAG,EAAnB;AACAd,QAAAA,UAAU,GAAGK,SAAS,CAACJ,QAAD,EAAWD,UAAX,EAAuBc,UAAvB,CAAtB;AACAA,QAAAA,UAAU,CAACC,IAAX,GAAkBP,KAAK,CAACO,IAAN,GAAaJ,CAA/B;AAEAR,QAAAA,KAAK,CAACG,IAAN,CAAWQ,UAAX;AACAjB,QAAAA,WAAW,CAACS,IAAZ,CAAiBQ,UAAjB;AACAN,QAAAA,KAAK,CAACI,MAAN,CAAaI,UAAb;AACD;;AACDN,MAAAA,IAAI,GAAGA,IAAI,GAAG,CAAd;AACD;;AAED,QAAIV,UAAU,KAAKC,QAAQ,CAACgB,UAA5B,EAAwC;AACtC;AACD;AACF;;AAED,SAAOpB,WAAP;AACD;;AAED,SAASQ,SAAT,CAAmBJ,QAAnB,EAA6BD,UAA7B,EAAyCc,UAAzC,EAAqD;AACnDA,EAAAA,UAAU,CAACF,MAAX,GAAoBE,UAAU,CAACF,MAAX,IAAqB,EAAzC;AACAE,EAAAA,UAAU,CAACF,MAAX,CAAkBC,SAAlB,GAA8BZ,QAAQ,CAACiB,QAAT,CAAkBlB,UAAlB,CAA9B;AACAc,EAAAA,UAAU,CAACF,MAAX,CAAkBI,UAAlB,GAA+B,CAA/B;AACAF,EAAAA,UAAU,CAACK,UAAX,GAAwBlB,QAAQ,CAACmB,SAAT,CAAmBpB,UAAU,GAAG,CAAhC,EAAmC,IAAnC,CAAxB;AACAc,EAAAA,UAAU,CAACC,IAAX,GAAkB,EAAlB;AACAf,EAAAA,UAAU,IAAI,CAAd;AACA,SAAOA,UAAP;AACD;;AAGD,SAASD,cAAT,CAAwBF,WAAxB,EAAqCwB,OAAO,GAAG,EAA/C,EAAmD;AACjD,QAAMC,eAAe,GAAG;AAACC,IAAAA,OAAO,EAAE;AAAV,GAAxB;AACAF,EAAAA,OAAO,GAAG,EAAC,GAAGC,eAAJ;AAAqB,OAAGD;AAAxB,GAAV;AAEA,QAAMG,OAAO,GAAG3B,WAAW,CAAC,CAAD,CAA3B;AACA,QAAM4B,KAAK,GAAG,EAAd;;AAEA,OAAK,MAAMX,UAAX,IAAyBjB,WAAzB,EAAsC;AACpC,UAAM;AAACkB,MAAAA;AAAD,QAASD,UAAf;AAEA,UAAMY,KAAK,GAAGC,QAAQ,CAACZ,IAAI,CAACa,MAAL,CAAYb,IAAI,CAACR,MAAL,GAAc,CAA1B,CAAD,EAA+B,EAA/B,CAAtB;AACA,UAAMsB,UAAU,GAAGd,IAAI,CAACe,SAAL,CAAe,CAAf,EAAkBf,IAAI,CAACR,MAAL,GAAc,CAAhC,CAAnB;AACA,UAAMwB,UAAU,GAAGN,KAAK,CAACI,UAAD,CAAxB;AACA,UAAMG,KAAK,GAAGjB,IAAI,CAACR,MAAL,GAAc,CAA5B;AAGAO,IAAAA,UAAU,CAACkB,KAAX,GAAmBA,KAAnB;AACAlB,IAAAA,UAAU,CAACmB,WAAX,GAAyBnB,UAAU,CAACF,MAAX,CAAkBI,UAA3C;AACAF,IAAAA,UAAU,CAACoB,QAAX,GAAsB,EAAtB;AACApB,IAAAA,UAAU,CAACqB,eAAX,GAA6B,IAAIC,KAAJ,CAAU,CAAV,EAAaC,IAAb,CAAkB,IAAlB,CAA7B;AACAvB,IAAAA,UAAU,CAACS,OAAX,GAAqBF,OAAO,CAACE,OAAR,GAAkBe,IAAI,CAACC,GAAL,CAAS,CAAT,EAAYP,KAAZ,CAAvC;;AAGA,QAAID,UAAJ,EAAgB;AACdA,MAAAA,UAAU,CAACG,QAAX,CAAoB5B,IAApB,CAAyBQ,UAAzB;AACAiB,MAAAA,UAAU,CAACI,eAAX,CAA2BT,KAA3B,IAAoCZ,UAApC;AACD;;AAGDW,IAAAA,KAAK,CAACV,IAAD,CAAL,GAAcD,UAAd;AACD;;AAGD,SAAOU,OAAP;AACD","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"],"file":"parse-potree-hierarchy-chunk.js"}

package/dist/potree-bin-loader.js

@@ -1,27 +1,17 @@
-"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
+import { default as parsePotreeBin } from './parsers/parse-potree-bin';
+export const PotreeBinLoader = {
+  name: 'potree Binary Point Attributes',
+  id: 'potree',
+  extensions: ['bin'],
+  mimeTypes: ['application/octet-stream'],
+  parseSync,
+  binary: true
 };
+
 function parseSync(arrayBuffer, options) {
-    const index = {};
-    const byteOffset = 0;
-    (0, parse_potree_bin_1.default)(arrayBuffer, byteOffset, options, index);
-    return index;
+  const index = {};
+  const byteOffset = 0;
+  parsePotreeBin(arrayBuffer, byteOffset, options, index);
+  return index;
 }
+//# sourceMappingURL=potree-bin-loader.js.map

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

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/potree-bin-loader.ts"],"names":["default","parsePotreeBin","PotreeBinLoader","name","id","extensions","mimeTypes","parseSync","binary","arrayBuffer","options","index","byteOffset"],"mappings":"AACA,SAAQA,OAAO,IAAIC,cAAnB,QAAwC,4BAAxC;AAMA,OAAO,MAAMC,eAAiC,GAAG;AAC/CC,EAAAA,IAAI,EAAE,gCADyC;AAE/CC,EAAAA,EAAE,EAAE,QAF2C;AAG/CC,EAAAA,UAAU,EAAE,CAAC,KAAD,CAHmC;AAI/CC,EAAAA,SAAS,EAAE,CAAC,0BAAD,CAJoC;AAO/CC,EAAAA,SAP+C;AAQ/CC,EAAAA,MAAM,EAAE;AARuC,CAA1C;;AAWP,SAASD,SAAT,CAAmBE,WAAnB,EAA6CC,OAA7C,EAAsE;AACpE,QAAMC,KAAK,GAAG,EAAd;AACA,QAAMC,UAAU,GAAG,CAAnB;AACAX,EAAAA,cAAc,CAACQ,WAAD,EAAcG,UAAd,EAA0BF,OAA1B,EAAmCC,KAAnC,CAAd;AACA,SAAOA,KAAP;AACD","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"],"file":"potree-bin-loader.js"}

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

@@ -1,23 +1,15 @@
-"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
+import { default as 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,
+  binary: true
 };
+
 function parseSync(arrayBuffer) {
-    return (0, parse_potree_hierarchy_chunk_1.default)(arrayBuffer);
+  return parsePotreeHierarchyChunk(arrayBuffer);
 }
+//# sourceMappingURL=potree-hierarchy-chunk-loader.js.map

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

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/potree-hierarchy-chunk-loader.ts"],"names":["default","parsePotreeHierarchyChunk","PotreeHierarchyChunkLoader","id","name","extensions","mimeTypes","parse","arrayBuffer","options","parseSync","binary"],"mappings":"AACA,SAAQA,OAAO,IAAIC,yBAAnB,QAAmD,wCAAnD;AAIA,OAAO,MAAMC,0BAA4C,GAAG;AAC1DC,EAAAA,EAAE,EAAE,QADsD;AAE1DC,EAAAA,IAAI,EAAE,wBAFoD;AAG1DC,EAAAA,UAAU,EAAE,CAAC,KAAD,CAH8C;AAI1DC,EAAAA,SAAS,EAAE,CAAC,0BAAD,CAJ+C;AAO1DC,EAAAA,KAAK,EAAE,OAAOC,WAAP,EAAoBC,OAApB,KAAgC,MAAMC,SAAS,CAACF,WAAD,CAPI;AAQ1DE,EAAAA,SAR0D;AAS1DC,EAAAA,MAAM,EAAE;AATkD,CAArD;;AAYP,SAASD,SAAT,CAAmBF,WAAnB,EAAgC;AAC9B,SAAOP,yBAAyB,CAACO,WAAD,CAAhC;AACD","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"],"file":"potree-hierarchy-chunk-loader.js"}

package/dist/potree-loader.js

@@ -1,21 +1,15 @@
-"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: {}
-    }
+const VERSION = typeof "4.0.0-alpha.5" !== 'undefined' ? "4.0.0-alpha.5" : 'latest';
+export const 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: {}
+  }
 };
+//# sourceMappingURL=potree-loader.js.map

package/dist/potree-loader.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/potree-loader.ts"],"names":["VERSION","PotreeLoader","name","id","module","version","extensions","mimeTypes","testText","text","indexOf","parseTextSync","JSON","parse","options","potree"],"mappings":"AAIA,MAAMA,OAAO,GAAG,2BAAuB,WAAvB,qBAAmD,QAAnE;AAIA,OAAO,MAAMC,YAA8B,GAAG;AAC5CC,EAAAA,IAAI,EAAE,QADsC;AAE5CC,EAAAA,EAAE,EAAE,QAFwC;AAG5CC,EAAAA,MAAM,EAAE,QAHoC;AAI5CC,EAAAA,OAAO,EAAEL,OAJmC;AAK5CM,EAAAA,UAAU,EAAE,CAAC,MAAD,CALgC;AAM5CC,EAAAA,SAAS,EAAE,CAAC,kBAAD,CANiC;AAO5CC,EAAAA,QAAQ,EAAGC,IAAD,IAAUA,IAAI,CAACC,OAAL,CAAa,WAAb,KAA6B,CAPL;AAQ5CC,EAAAA,aAAa,EAAGF,IAAD,IAAUG,IAAI,CAACC,KAAL,CAAWJ,IAAX,CARmB;AAS5CK,EAAAA,OAAO,EAAE;AACPC,IAAAA,MAAM,EAAE;AADD;AATmC,CAAvC","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"],"file":"potree-loader.js"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@loaders.gl/potree",
-  "version": "3.1.3",
+  "version": "4.0.0-alpha.5",
   "description": "potree loaders for large point clouds.",
   "license": "MIT",
   "publishConfig": {
@@ -22,8 +22,8 @@
     "pointcloud"
   ],
   "types": "dist/index.d.ts",
-  "main": "dist/es5/index.js",
-  "module": "dist/esm/index.js",
+  "main": "dist/index.js",
+  "module": "dist/index.js",
   "sideEffects": false,
   "files": [
     "src",
@@ -35,8 +35,8 @@
     "build-bundle": "esbuild src/bundle.ts --bundle --outfile=dist/dist.min.js"
   },
   "dependencies": {
-    "@loaders.gl/math": "3.1.3",
+    "@loaders.gl/math": "4.0.0-alpha.5",
     "@math.gl/core": "^3.5.1"
   },
-  "gitHead": "4a690c369779346d73c9a27395d1c08d77d279a4"
+  "gitHead": "7a71a54bdf1ddf985cc3af3db90b82e7fa97d025"
 }

package/dist/es5/bundle.js

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

package/dist/es5/bundle.js.map

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

package/dist/es5/index.js

@@ -1,30 +0,0 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-Object.defineProperty(exports, "PotreeLoader", {
-  enumerable: true,
-  get: function get() {
-    return _potreeLoader.PotreeLoader;
-  }
-});
-Object.defineProperty(exports, "PotreeHierarchyChunkLoader", {
-  enumerable: true,
-  get: function get() {
-    return _potreeHierarchyChunkLoader.PotreeHierarchyChunkLoader;
-  }
-});
-Object.defineProperty(exports, "PotreeBinLoader", {
-  enumerable: true,
-  get: function get() {
-    return _potreeBinLoader.PotreeBinLoader;
-  }
-});
-
-var _potreeLoader = require("./potree-loader");
-
-var _potreeHierarchyChunkLoader = require("./potree-hierarchy-chunk-loader");
-
-var _potreeBinLoader = require("./potree-bin-loader");
-//# sourceMappingURL=index.js.map

package/dist/es5/index.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../../src/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;AAAA;;AACA;;AACA","sourcesContent":["export {PotreeLoader} from './potree-loader';\nexport {PotreeHierarchyChunkLoader} from './potree-hierarchy-chunk-loader';\nexport {PotreeBinLoader} from './potree-bin-loader';\n"],"file":"index.js"}