@ifc-lite/pointcloud 0.11.0 → 0.13.0

package/README.md

@@ -29,6 +29,30 @@ if (chunk) {
 }
 ```
 
+For native import or coordinate processing, `decodeIfcxPointSource(attributes)`
+returns authored numeric channels before float32 staging: owned `Float64Array`
+`positions` and optional normalized RGB `colors`, plus `pointCount`,
+`sourcePrecision` and `sourceEncoding`. It uses the same PCD > inline array >
+base64 precedence and validation as `decodeIfcxPointAttribute`, returning `null`
+when no supported attribute is present. It applies no offsets, transforms,
+normals or bounds. ASCII PCD and inline numbers retain JavaScript number
+precision; binary and compressed PCD retain decoded float64 values. The
+`sourcePrecision` is `f32` only when all encoded coordinates are float32
+(including `points::base64`); otherwise it is `f64` (also for integer PCD
+coordinates decoded as numbers). `sourceEncoding` is `pcd-ascii`, `pcd-binary`,
+`pcd-binary_compressed`, `points-array` or `points-base64`. Widening an f32
+source does not recover precision already lost by its author.
+
+```ts
+import { decodeIfcxPointSource } from '@ifc-lite/pointcloud';
+
+declare const attributes: ReadonlyMap<string, unknown>;
+const source = decodeIfcxPointSource(attributes);
+if (source) {
+  console.log(source.positions, source.sourcePrecision, source.sourceEncoding);
+}
+```
+
 `DecodedPointChunk.normals` carries source-supplied oriented normals as
 row-aligned `nx, ny, nz` float triples when a decoder provides them. PLY
 supports complete `nx`/`ny`/`nz` properties in ASCII and binary files and
@@ -81,6 +105,78 @@ Notes:
 - Strict CSPs need `script-src 'self' blob:` to allow the `Blob`-URL
   worker.
 
+## COPC: range-read octree point clouds
+
+A [COPC](https://copc.io) file is a LAZ 1.4 file organised as an octree, so a
+viewer can read only the nodes it needs, from a local `File` or over HTTP
+Range requests. `openCopcWorkerReader` opens one in the decode worker, loads
+the root hierarchy page, and decodes nodes on demand. Detection is by the
+`copc`/`info` VLR (`isCopcHeader` on the first `COPC_PROBE_BYTES` bytes), not
+by the `.copc.laz` file name.
+
+```ts
+import { openCopcWorkerReader } from '@ifc-lite/pointcloud';
+
+declare const file: File;
+const reader = await openCopcWorkerReader({ source: { kind: 'blob', blob: file } });
+const root = reader.hierarchy.nodes.get('0-0-0-0');
+if (root) {
+  const chunk = await reader.readNode(root, { stride: 1 });
+  console.log(`${chunk.pointCount} points in the root node`);
+}
+// Deeper hierarchy pages load on demand: reader.loadPage(ref) for any
+// ref in reader.hierarchy.pendingPages.
+reader.close();
+```
+
+For a remote file, pass `{ kind: 'http', url }`. The server must answer
+Range requests with `206 Partial Content`; a server that ignores `Range` is
+refused rather than downloading the whole file. When CORS hides
+`Content-Range`, the size comes from a `HEAD` request and each response is
+checked by its exact length. Hierarchy pages come from the file, so the
+page walk is iterative with a visited set and page, node and byte budgets;
+exceeding a budget is an error, never a silently truncated octree.
+
+## View-dependent level of detail
+
+`selectLod(root, camera, { pointBudget })` picks which octree nodes to show.
+It is pure (no renderer, no I/O) and works on any additive octree through the
+small `LodNode` interface; `createCopcLodTree` adapts a COPC hierarchy.
+
+- Nodes outside the view frustum are never selected.
+- The selected node with the largest projected screen span refines first,
+  while its span exceeds `pixelThreshold` (default 96 px) and the selection
+  stays within `maxNodes` (default `clamp(pointBudget / 128, 8, 1024)`).
+  Parents always precede their children.
+- The point budget is water-filled across the selection: each node gets an
+  equal share capped by its own point count, and every node carries a
+  `stride` hint whose decoded count never exceeds its share.
+- Nodes that should refine but whose hierarchy page is not loaded yet are
+  listed in `needsChildren`.
+
+`LodPacer` sizes a fast first pass to a time budget (default 200 ms) from a
+learned read rate, an asymmetric moving average that drops fast and rises
+slowly, with outlier clipping. `shouldReplacePass` swaps what is on screen
+only for something better: more points for the same view, or a complete
+pass for a newer view.
+
+```ts
+import { LodPacer, createCopcLodTree, selectLod, type CopcWorkerReader, type LodCamera } from '@ifc-lite/pointcloud';
+
+declare const reader: CopcWorkerReader;
+declare const camera: LodCamera;
+// Bounds in the decoded frame; move the camera into it (view-projection x placement).
+const tree = createCopcLodTree(reader.hierarchy, reader.file.info, reader.originOffset);
+const pacer = new LodPacer();
+const [firstPass] = pacer.passBudgets(10_000_000);
+if (tree.root) {
+  const selection = selectLod(tree.root, camera, { pointBudget: firstPass });
+  for (const node of selection.needsChildren) {
+    for (const ref of tree.pendingPagesUnder(node)) void reader.loadPage(ref);
+  }
+}
+```
+
 ## API
 
 See the [docs site](https://ifclite.dev/docs/) for guides and the full API reference.

package/dist/copc/copc-hierarchy.d.ts

@@ -0,0 +1,102 @@
+/**
+ * COPC hierarchy pages (#6869).
+ *
+ * A page is a packed array of 32-byte entries:
+ *   VoxelKey (int32 level, x, y, z) | uint64 offset | int32 byteSize | int32 pointCount
+ * `pointCount >= 0` describes a node whose LAZ chunk sits at `offset`;
+ * `pointCount === -1` points at a CHILD PAGE of `byteSize` bytes at `offset`.
+ *
+ * The page tree comes from the file, so its shape is attacker-controlled.
+ * Following AGENTS.md "Bounding walks over file-supplied references", the
+ * walk is ITERATIVE (no stack to overflow), keeps a global visited set of
+ * page offsets (a page is a pure function of its offset, so memoising is
+ * safe and kills cycles and fan-out), and carries work budgets for pages,
+ * nodes and page bytes. Exceeding a budget THROWS: a truncated hierarchy
+ * would render as silently missing geometry.
+ */
+import { type VoxelKey } from './copc-info.js';
+/** Deepest level accepted: keeps `2^d` cell indices inside int32. */
+export declare const MAX_COPC_LEVEL = 30;
+/** Largest single node accepted (points). Real writers stay far below. */
+export declare const MAX_COPC_NODE_POINTS: number;
+export interface CopcNodeEntry {
+    key: VoxelKey;
+    /** Absolute file offset of the node's LAZ chunk. */
+    offset: number;
+    byteSize: number;
+    pointCount: number;
+}
+export interface CopcPageRef {
+    /** Root of the subtree the page describes. */
+    key: VoxelKey;
+    offset: number;
+    byteSize: number;
+}
+export interface CopcHierarchyPage {
+    nodes: CopcNodeEntry[];
+    pages: CopcPageRef[];
+}
+export interface CopcHierarchyLimits {
+    maxPages: number;
+    maxNodes: number;
+    maxPageBytes: number;
+}
+export declare const DEFAULT_COPC_HIERARCHY_LIMITS: CopcHierarchyLimits;
+/** Parse and validate one page. Every entry is checked against the file size. */
+export declare function parseCopcHierarchyPage(bytes: Uint8Array, fileSize: number): CopcHierarchyPage;
+export type CopcChildState = 'node' | 'page' | 'absent';
+/** The eight children of `key`. */
+export declare function copcChildKeys(key: VoxelKey): VoxelKey[];
+/**
+ * The hierarchy known so far: nodes from loaded pages, plus pointers to
+ * pages not yet loaded. Pages load on demand, so a huge file's hierarchy is
+ * only read where the camera looks.
+ */
+export declare class CopcHierarchy {
+    readonly limits: CopcHierarchyLimits;
+    readonly nodes: Map<string, CopcNodeEntry>;
+    /** Unloaded child pages, keyed by the id of their subtree root. */
+    readonly pendingPages: Map<string, CopcPageRef>;
+    private readonly seenPageOffsets;
+    private pageBytes;
+    private pageCount;
+    constructor(limits?: CopcHierarchyLimits);
+    get loadedPageCount(): number;
+    /** Page bytes still allowed by `limits.maxPageBytes`. */
+    get remainingPageBytes(): number;
+    /**
+     * Throw unless `ref` fits the page and byte budgets. Call BEFORE reading a
+     * page: a hostile pointer can name a page as large as the file, and a
+     * budget checked only after parsing has already paid for it.
+     */
+    assertCanLoad(ref: {
+        byteSize: number;
+    }): void;
+    /**
+     * Admit the page read from `ref`: the root page first, then only pages
+     * that are pending. Throws when a budget is exceeded or a node key
+     * repeats; pointers to already-seen pages are dropped.
+     */
+    addPage(ref: {
+        offset: number;
+        byteSize: number;
+        key?: VoxelKey;
+    }, page: CopcHierarchyPage): void;
+    private isPending;
+    /** Whether `key` is a known node, the root of an unloaded page, or neither. */
+    stateOf(key: VoxelKey): CopcChildState;
+}
+/** Reads one page's bytes and parses it; the reader owns the I/O. */
+export type CopcPageFetcher = (ref: CopcPageRef, signal?: AbortSignal) => Promise<CopcHierarchyPage>;
+/**
+ * Load every pending page, iteratively (breadth-first, `concurrency` reads
+ * in flight), optionally only those whose subtree root is at most
+ * `maxLevel` deep. The visited set and the hierarchy's budgets bound the
+ * work; there is no recursion.
+ */
+export declare function loadPendingCopcPages(hierarchy: CopcHierarchy, fetchPage: CopcPageFetcher, options?: {
+    maxLevel?: number;
+    signal?: AbortSignal;
+    concurrency?: number;
+}): Promise<void>;
+//# sourceMappingURL=copc-hierarchy.d.ts.map

package/dist/copc/copc-hierarchy.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"copc-hierarchy.d.ts","sourceRoot":"","sources":["../../src/copc/copc-hierarchy.ts"],"names":[],"mappings":"AAIA;;;;;;;;;;;;;;;GAeG;AAEH,OAAO,EAAc,KAAK,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAG3D,qEAAqE;AACrE,eAAO,MAAM,cAAc,KAAK,CAAC;AACjC,0EAA0E;AAC1E,eAAO,MAAM,oBAAoB,QAAU,CAAC;AAE5C,MAAM,WAAW,aAAa;IAC5B,GAAG,EAAE,QAAQ,CAAC;IACd,oDAAoD;IACpD,MAAM,EAAE,MAAM,CAAC;IACf,QAAQ,EAAE,MAAM,CAAC;IACjB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,MAAM,WAAW,WAAW;IAC1B,8CAA8C;IAC9C,GAAG,EAAE,QAAQ,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;IACf,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED,MAAM,WAAW,iBAAiB;IAChC,KAAK,EAAE,aAAa,EAAE,CAAC;IACvB,KAAK,EAAE,WAAW,EAAE,CAAC;CACtB;AAED,MAAM,WAAW,mBAAmB;IAClC,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,MAAM,CAAC;IACjB,YAAY,EAAE,MAAM,CAAC;CACtB;AAED,eAAO,MAAM,6BAA6B,EAAE,mBAI3C,CAAC;AAQF,iFAAiF;AACjF,wBAAgB,sBAAsB,CAAC,KAAK,EAAE,UAAU,EAAE,QAAQ,EAAE,MAAM,GAAG,iBAAiB,CAyC7F;AAED,MAAM,MAAM,cAAc,GAAG,MAAM,GAAG,MAAM,GAAG,QAAQ,CAAC;AAExD,mCAAmC;AACnC,wBAAgB,aAAa,CAAC,GAAG,EAAE,QAAQ,GAAG,QAAQ,EAAE,CAMvD;AAED;;;;GAIG;AACH,qBAAa,aAAa;IAQZ,QAAQ,CAAC,MAAM,EAAE,mBAAmB;IAPhD,QAAQ,CAAC,KAAK,6BAAoC;IAClD,mEAAmE;IACnE,QAAQ,CAAC,YAAY,2BAAkC;IACvD,OAAO,CAAC,QAAQ,CAAC,eAAe,CAAqB;IACrD,OAAO,CAAC,SAAS,CAAK;IACtB,OAAO,CAAC,SAAS,CAAK;gBAED,MAAM,GAAE,mBAAmD;IAEhF,IAAI,eAAe,IAAI,MAAM,CAE5B;IAED,yDAAyD;IACzD,IAAI,kBAAkB,IAAI,MAAM,CAE/B;IAED;;;;OAIG;IACH,aAAa,CAAC,GAAG,EAAE;QAAE,QAAQ,EAAE,MAAM,CAAA;KAAE,GAAG,IAAI;IAS9C;;;;OAIG;IACH,OAAO,CAAC,GAAG,EAAE;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAC;QAAC,GAAG,CAAC,EAAE,QAAQ,CAAA;KAAE,EAAE,IAAI,EAAE,iBAAiB,GAAG,IAAI;IAmCjG,OAAO,CAAC,SAAS;IAKjB,+EAA+E;IAC/E,OAAO,CAAC,GAAG,EAAE,QAAQ,GAAG,cAAc;CAMvC;AAED,qEAAqE;AACrE,MAAM,MAAM,eAAe,GAAG,CAAC,GAAG,EAAE,WAAW,EAAE,MAAM,CAAC,EAAE,WAAW,KAAK,OAAO,CAAC,iBAAiB,CAAC,CAAC;AAErG;;;;;GAKG;AACH,wBAAsB,oBAAoB,CACxC,SAAS,EAAE,aAAa,EACxB,SAAS,EAAE,eAAe,EAC1B,OAAO,GAAE;IAAE,QAAQ,CAAC,EAAE,MAAM,CAAC;IAAC,MAAM,CAAC,EAAE,WAAW,CAAC;IAAC,WAAW,CAAC,EAAE,MAAM,CAAA;CAAO,GAC9E,OAAO,CAAC,IAAI,CAAC,CAef"}

package/dist/copc/copc-hierarchy.js

@@ -0,0 +1,210 @@
+/* This Source Code Form is subject to the terms of the Mozilla Public
+ * License, v. 2.0. If a copy of the MPL was not distributed with this
+ * file, You can obtain one at https://mozilla.org/MPL/2.0/. */
+/**
+ * COPC hierarchy pages (#6869).
+ *
+ * A page is a packed array of 32-byte entries:
+ *   VoxelKey (int32 level, x, y, z) | uint64 offset | int32 byteSize | int32 pointCount
+ * `pointCount >= 0` describes a node whose LAZ chunk sits at `offset`;
+ * `pointCount === -1` points at a CHILD PAGE of `byteSize` bytes at `offset`.
+ *
+ * The page tree comes from the file, so its shape is attacker-controlled.
+ * Following AGENTS.md "Bounding walks over file-supplied references", the
+ * walk is ITERATIVE (no stack to overflow), keeps a global visited set of
+ * page offsets (a page is a pure function of its offset, so memoising is
+ * safe and kills cycles and fan-out), and carries work budgets for pages,
+ * nodes and page bytes. Exceeding a budget THROWS: a truncated hierarchy
+ * would render as silently missing geometry.
+ */
+import { voxelKeyId } from './copc-info.js';
+const ENTRY_SIZE = 32;
+/** Deepest level accepted: keeps `2^d` cell indices inside int32. */
+export const MAX_COPC_LEVEL = 30;
+/** Largest single node accepted (points). Real writers stay far below. */
+export const MAX_COPC_NODE_POINTS = 1 << 24;
+export const DEFAULT_COPC_HIERARCHY_LIMITS = {
+    maxPages: 1 << 16,
+    maxNodes: 1 << 21,
+    maxPageBytes: (1 << 21) * ENTRY_SIZE,
+};
+function checkSpan(what, offset, size, fileSize) {
+    if (!Number.isSafeInteger(offset) || offset < 0 || offset + size > fileSize) {
+        throw new Error(`COPC: ${what} [${offset}, +${size}) lies outside the ${fileSize}-byte file`);
+    }
+}
+/** Parse and validate one page. Every entry is checked against the file size. */
+export function parseCopcHierarchyPage(bytes, fileSize) {
+    if (bytes.length % ENTRY_SIZE !== 0) {
+        throw new Error(`COPC: hierarchy page of ${bytes.length} bytes is not a multiple of ${ENTRY_SIZE}`);
+    }
+    const view = new DataView(bytes.buffer, bytes.byteOffset, bytes.byteLength);
+    const page = { nodes: [], pages: [] };
+    for (let at = 0; at < bytes.length; at += ENTRY_SIZE) {
+        const key = {
+            d: view.getInt32(at, true),
+            x: view.getInt32(at + 4, true),
+            y: view.getInt32(at + 8, true),
+            z: view.getInt32(at + 12, true),
+        };
+        const offset = view.getUint32(at + 16, true) + view.getUint32(at + 20, true) * 0x100000000;
+        const byteSize = view.getInt32(at + 24, true);
+        const pointCount = view.getInt32(at + 28, true);
+        if (key.d < 0 || key.d > MAX_COPC_LEVEL)
+            throw new Error(`COPC: hierarchy key level ${key.d} out of range`);
+        const cells = 2 ** key.d;
+        for (const c of [key.x, key.y, key.z]) {
+            if (c < 0 || c >= cells)
+                throw new Error(`COPC: hierarchy key ${voxelKeyId(key)} has a cell outside [0, ${cells})`);
+        }
+        if (pointCount === -1) {
+            if (byteSize <= 0 || byteSize % ENTRY_SIZE !== 0) {
+                throw new Error(`COPC: child page ${voxelKeyId(key)} has invalid size ${byteSize}`);
+            }
+            checkSpan(`child page ${voxelKeyId(key)}`, offset, byteSize, fileSize);
+            page.pages.push({ key, offset, byteSize });
+        }
+        else if (pointCount === 0) {
+            page.nodes.push({ key, offset: 0, byteSize: 0, pointCount: 0 });
+        }
+        else if (pointCount > 0) {
+            if (pointCount > MAX_COPC_NODE_POINTS) {
+                throw new Error(`COPC: node ${voxelKeyId(key)} declares ${pointCount} points (limit ${MAX_COPC_NODE_POINTS})`);
+            }
+            if (byteSize <= 0)
+                throw new Error(`COPC: node ${voxelKeyId(key)} has ${pointCount} points but ${byteSize} bytes`);
+            checkSpan(`node ${voxelKeyId(key)}`, offset, byteSize, fileSize);
+            page.nodes.push({ key, offset, byteSize, pointCount });
+        }
+        else {
+            throw new Error(`COPC: hierarchy entry ${voxelKeyId(key)} has invalid point count ${pointCount}`);
+        }
+    }
+    return page;
+}
+/** The eight children of `key`. */
+export function copcChildKeys(key) {
+    const out = [];
+    for (let i = 0; i < 8; i++) {
+        out.push({ d: key.d + 1, x: key.x * 2 + (i & 1), y: key.y * 2 + ((i >> 1) & 1), z: key.z * 2 + ((i >> 2) & 1) });
+    }
+    return out;
+}
+/**
+ * The hierarchy known so far: nodes from loaded pages, plus pointers to
+ * pages not yet loaded. Pages load on demand, so a huge file's hierarchy is
+ * only read where the camera looks.
+ */
+export class CopcHierarchy {
+    limits;
+    nodes = new Map();
+    /** Unloaded child pages, keyed by the id of their subtree root. */
+    pendingPages = new Map();
+    seenPageOffsets = new Set();
+    pageBytes = 0;
+    pageCount = 0;
+    constructor(limits = DEFAULT_COPC_HIERARCHY_LIMITS) {
+        this.limits = limits;
+    }
+    get loadedPageCount() {
+        return this.pageCount;
+    }
+    /** Page bytes still allowed by `limits.maxPageBytes`. */
+    get remainingPageBytes() {
+        return Math.max(0, this.limits.maxPageBytes - this.pageBytes);
+    }
+    /**
+     * Throw unless `ref` fits the page and byte budgets. Call BEFORE reading a
+     * page: a hostile pointer can name a page as large as the file, and a
+     * budget checked only after parsing has already paid for it.
+     */
+    assertCanLoad(ref) {
+        if (this.pageCount + 1 > this.limits.maxPages) {
+            throw new Error(`COPC: hierarchy exceeds ${this.limits.maxPages} pages`);
+        }
+        if (ref.byteSize > this.remainingPageBytes) {
+            throw new Error(`COPC: hierarchy exceeds ${this.limits.maxPageBytes} page bytes`);
+        }
+    }
+    /**
+     * Admit the page read from `ref`: the root page first, then only pages
+     * that are pending. Throws when a budget is exceeded or a node key
+     * repeats; pointers to already-seen pages are dropped.
+     */
+    addPage(ref, page) {
+        if (this.pageCount > 0 && !this.isPending(ref)) {
+            throw new Error(`COPC: page at ${ref.offset} is not a pending hierarchy page`);
+        }
+        this.pageCount++;
+        this.pageBytes += ref.byteSize;
+        if (this.pageCount > this.limits.maxPages) {
+            throw new Error(`COPC: hierarchy exceeds ${this.limits.maxPages} pages`);
+        }
+        if (this.pageBytes > this.limits.maxPageBytes) {
+            throw new Error(`COPC: hierarchy exceeds ${this.limits.maxPageBytes} page bytes`);
+        }
+        this.seenPageOffsets.add(ref.offset);
+        if (ref.key)
+            this.pendingPages.delete(voxelKeyId(ref.key));
+        if (this.nodes.size + page.nodes.length > this.limits.maxNodes) {
+            throw new Error(`COPC: hierarchy exceeds ${this.limits.maxNodes} nodes`);
+        }
+        for (const node of page.nodes) {
+            const id = voxelKeyId(node.key);
+            if (this.nodes.has(id))
+                throw new Error(`COPC: hierarchy lists node ${id} twice`);
+            this.nodes.set(id, node);
+        }
+        for (const child of page.pages) {
+            // The visited set is the cycle guard: a pointer back to any page we
+            // have read or queued is dropped, never followed.
+            if (this.seenPageOffsets.has(child.offset))
+                continue;
+            const id = voxelKeyId(child.key);
+            // Two pointers for one subtree root: overwriting would silently drop
+            // the first page's subtree, so treat it like a repeated node.
+            if (this.pendingPages.has(id))
+                throw new Error(`COPC: hierarchy lists child page ${id} twice`);
+            this.seenPageOffsets.add(child.offset);
+            this.pendingPages.set(id, child);
+        }
+    }
+    isPending(ref) {
+        if (!ref.key)
+            return false;
+        return this.pendingPages.get(voxelKeyId(ref.key))?.offset === ref.offset;
+    }
+    /** Whether `key` is a known node, the root of an unloaded page, or neither. */
+    stateOf(key) {
+        const id = voxelKeyId(key);
+        if (this.nodes.has(id))
+            return 'node';
+        if (this.pendingPages.has(id))
+            return 'page';
+        return 'absent';
+    }
+}
+/**
+ * Load every pending page, iteratively (breadth-first, `concurrency` reads
+ * in flight), optionally only those whose subtree root is at most
+ * `maxLevel` deep. The visited set and the hierarchy's budgets bound the
+ * work; there is no recursion.
+ */
+export async function loadPendingCopcPages(hierarchy, fetchPage, options = {}) {
+    const maxLevel = options.maxLevel ?? Infinity;
+    const concurrency = Math.max(1, Math.floor(options.concurrency ?? 6));
+    while (true) {
+        options.signal?.throwIfAborted();
+        const batch = [...hierarchy.pendingPages.values()].filter((ref) => ref.key.d <= maxLevel).slice(0, concurrency);
+        if (batch.length === 0)
+            return;
+        // Budget the whole batch before any read starts.
+        batch.reduce((bytes, ref) => {
+            hierarchy.assertCanLoad({ byteSize: bytes + ref.byteSize });
+            return bytes + ref.byteSize;
+        }, 0);
+        const pages = await Promise.all(batch.map((ref) => fetchPage(ref, options.signal)));
+        batch.forEach((ref, i) => hierarchy.addPage(ref, pages[i]));
+    }
+}
+//# sourceMappingURL=copc-hierarchy.js.map

package/dist/copc/copc-hierarchy.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"copc-hierarchy.js","sourceRoot":"","sources":["../../src/copc/copc-hierarchy.ts"],"names":[],"mappings":"AAAA;;+DAE+D;AAE/D;;;;;;;;;;;;;;;GAeG;AAEH,OAAO,EAAE,UAAU,EAAiB,MAAM,gBAAgB,CAAC;AAE3D,MAAM,UAAU,GAAG,EAAE,CAAC;AACtB,qEAAqE;AACrE,MAAM,CAAC,MAAM,cAAc,GAAG,EAAE,CAAC;AACjC,0EAA0E;AAC1E,MAAM,CAAC,MAAM,oBAAoB,GAAG,CAAC,IAAI,EAAE,CAAC;AA4B5C,MAAM,CAAC,MAAM,6BAA6B,GAAwB;IAChE,QAAQ,EAAE,CAAC,IAAI,EAAE;IACjB,QAAQ,EAAE,CAAC,IAAI,EAAE;IACjB,YAAY,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,UAAU;CACrC,CAAC;AAEF,SAAS,SAAS,CAAC,IAAY,EAAE,MAAc,EAAE,IAAY,EAAE,QAAgB;IAC7E,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,MAAM,CAAC,IAAI,MAAM,GAAG,CAAC,IAAI,MAAM,GAAG,IAAI,GAAG,QAAQ,EAAE,CAAC;QAC5E,MAAM,IAAI,KAAK,CAAC,SAAS,IAAI,KAAK,MAAM,MAAM,IAAI,sBAAsB,QAAQ,YAAY,CAAC,CAAC;IAChG,CAAC;AACH,CAAC;AAED,iFAAiF;AACjF,MAAM,UAAU,sBAAsB,CAAC,KAAiB,EAAE,QAAgB;IACxE,IAAI,KAAK,CAAC,MAAM,GAAG,UAAU,KAAK,CAAC,EAAE,CAAC;QACpC,MAAM,IAAI,KAAK,CAAC,2BAA2B,KAAK,CAAC,MAAM,+BAA+B,UAAU,EAAE,CAAC,CAAC;IACtG,CAAC;IACD,MAAM,IAAI,GAAG,IAAI,QAAQ,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,UAAU,EAAE,KAAK,CAAC,UAAU,CAAC,CAAC;IAC5E,MAAM,IAAI,GAAsB,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;IACzD,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,KAAK,CAAC,MAAM,EAAE,EAAE,IAAI,UAAU,EAAE,CAAC;QACrD,MAAM,GAAG,GAAa;YACpB,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,EAAE,EAAE,IAAI,CAAC;YAC1B,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC;YAC9B,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC;YAC9B,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,EAAE,GAAG,EAAE,EAAE,IAAI,CAAC;SAChC,CAAC;QACF,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,EAAE,GAAG,EAAE,EAAE,IAAI,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,EAAE,GAAG,EAAE,EAAE,IAAI,CAAC,GAAG,WAAW,CAAC;QAC3F,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,EAAE,GAAG,EAAE,EAAE,IAAI,CAAC,CAAC;QAC9C,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,CAAC,EAAE,GAAG,EAAE,EAAE,IAAI,CAAC,CAAC;QAChD,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,cAAc;YAAE,MAAM,IAAI,KAAK,CAAC,6BAA6B,GAAG,CAAC,CAAC,eAAe,CAAC,CAAC;QAC5G,MAAM,KAAK,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;QACzB,KAAK,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YACtC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,KAAK;gBAAE,MAAM,IAAI,KAAK,CAAC,uBAAuB,UAAU,CAAC,GAAG,CAAC,2BAA2B,KAAK,GAAG,CAAC,CAAC;QACtH,CAAC;QACD,IAAI,UAAU,KAAK,CAAC,CAAC,EAAE,CAAC;YACtB,IAAI,QAAQ,IAAI,CAAC,IAAI,QAAQ,GAAG,UAAU,KAAK,CAAC,EAAE,CAAC;gBACjD,MAAM,IAAI,KAAK,CAAC,oBAAoB,UAAU,CAAC,GAAG,CAAC,qBAAqB,QAAQ,EAAE,CAAC,CAAC;YACtF,CAAC;YACD,SAAS,CAAC,cAAc,UAAU,CAAC,GAAG,CAAC,EAAE,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;YACvE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,CAAC;QAC7C,CAAC;aAAM,IAAI,UAAU,KAAK,CAAC,EAAE,CAAC;YAC5B,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC,CAAC;QAClE,CAAC;aAAM,IAAI,UAAU,GAAG,CAAC,EAAE,CAAC;YAC1B,IAAI,UAAU,GAAG,oBAAoB,EAAE,CAAC;gBACtC,MAAM,IAAI,KAAK,CAAC,cAAc,UAAU,CAAC,GAAG,CAAC,aAAa,UAAU,kBAAkB,oBAAoB,GAAG,CAAC,CAAC;YACjH,CAAC;YACD,IAAI,QAAQ,IAAI,CAAC;gBAAE,MAAM,IAAI,KAAK,CAAC,cAAc,UAAU,CAAC,GAAG,CAAC,QAAQ,UAAU,eAAe,QAAQ,QAAQ,CAAC,CAAC;YACnH,SAAS,CAAC,QAAQ,UAAU,CAAC,GAAG,CAAC,EAAE,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;YACjE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,QAAQ,EAAE,UAAU,EAAE,CAAC,CAAC;QACzD,CAAC;aAAM,CAAC;YACN,MAAM,IAAI,KAAK,CAAC,yBAAyB,UAAU,CAAC,GAAG,CAAC,4BAA4B,UAAU,EAAE,CAAC,CAAC;QACpG,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAID,mCAAmC;AACnC,MAAM,UAAU,aAAa,CAAC,GAAa;IACzC,MAAM,GAAG,GAAe,EAAE,CAAC;IAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;IACnH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;GAIG;AACH,MAAM,OAAO,aAAa;IAQH;IAPZ,KAAK,GAAG,IAAI,GAAG,EAAyB,CAAC;IAClD,mEAAmE;IAC1D,YAAY,GAAG,IAAI,GAAG,EAAuB,CAAC;IACtC,eAAe,GAAG,IAAI,GAAG,EAAU,CAAC;IAC7C,SAAS,GAAG,CAAC,CAAC;IACd,SAAS,GAAG,CAAC,CAAC;IAEtB,YAAqB,SAA8B,6BAA6B;QAA3D,WAAM,GAAN,MAAM,CAAqD;IAAG,CAAC;IAEpF,IAAI,eAAe;QACjB,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IAED,yDAAyD;IACzD,IAAI,kBAAkB;QACpB,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,YAAY,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC;IAChE,CAAC;IAED;;;;OAIG;IACH,aAAa,CAAC,GAAyB;QACrC,IAAI,IAAI,CAAC,SAAS,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;YAC9C,MAAM,IAAI,KAAK,CAAC,2BAA2B,IAAI,CAAC,MAAM,CAAC,QAAQ,QAAQ,CAAC,CAAC;QAC3E,CAAC;QACD,IAAI,GAAG,CAAC,QAAQ,GAAG,IAAI,CAAC,kBAAkB,EAAE,CAAC;YAC3C,MAAM,IAAI,KAAK,CAAC,2BAA2B,IAAI,CAAC,MAAM,CAAC,YAAY,aAAa,CAAC,CAAC;QACpF,CAAC;IACH,CAAC;IAED;;;;OAIG;IACH,OAAO,CAAC,GAAyD,EAAE,IAAuB;QACxF,IAAI,IAAI,CAAC,SAAS,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC;YAC/C,MAAM,IAAI,KAAK,CAAC,iBAAiB,GAAG,CAAC,MAAM,kCAAkC,CAAC,CAAC;QACjF,CAAC;QACD,IAAI,CAAC,SAAS,EAAE,CAAC;QACjB,IAAI,CAAC,SAAS,IAAI,GAAG,CAAC,QAAQ,CAAC;QAC/B,IAAI,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;YAC1C,MAAM,IAAI,KAAK,CAAC,2BAA2B,IAAI,CAAC,MAAM,CAAC,QAAQ,QAAQ,CAAC,CAAC;QAC3E,CAAC;QACD,IAAI,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC;YAC9C,MAAM,IAAI,KAAK,CAAC,2BAA2B,IAAI,CAAC,MAAM,CAAC,YAAY,aAAa,CAAC,CAAC;QACpF,CAAC;QACD,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACrC,IAAI,GAAG,CAAC,GAAG;YAAE,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QAC3D,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;YAC/D,MAAM,IAAI,KAAK,CAAC,2BAA2B,IAAI,CAAC,MAAM,CAAC,QAAQ,QAAQ,CAAC,CAAC;QAC3E,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC9B,MAAM,EAAE,GAAG,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAChC,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;gBAAE,MAAM,IAAI,KAAK,CAAC,8BAA8B,EAAE,QAAQ,CAAC,CAAC;YAClF,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAC3B,CAAC;QACD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC/B,oEAAoE;YACpE,kDAAkD;YAClD,IAAI,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC;gBAAE,SAAS;YACrD,MAAM,EAAE,GAAG,UAAU,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YACjC,qEAAqE;YACrE,8DAA8D;YAC9D,IAAI,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC;gBAAE,MAAM,IAAI,KAAK,CAAC,oCAAoC,EAAE,QAAQ,CAAC,CAAC;YAC/F,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YACvC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QACnC,CAAC;IACH,CAAC;IAEO,SAAS,CAAC,GAAuC;QACvD,IAAI,CAAC,GAAG,CAAC,GAAG;YAAE,OAAO,KAAK,CAAC;QAC3B,OAAO,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,KAAK,GAAG,CAAC,MAAM,CAAC;IAC3E,CAAC;IAED,+EAA+E;IAC/E,OAAO,CAAC,GAAa;QACnB,MAAM,EAAE,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,OAAO,MAAM,CAAC;QACtC,IAAI,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,OAAO,MAAM,CAAC;QAC7C,OAAO,QAAQ,CAAC;IAClB,CAAC;CACF;AAKD;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,oBAAoB,CACxC,SAAwB,EACxB,SAA0B,EAC1B,UAA6E,EAAE;IAE/E,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,IAAI,QAAQ,CAAC;IAC9C,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,CAAC,CAAC,CAAC;IACtE,OAAO,IAAI,EAAE,CAAC;QACZ,OAAO,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;QACjC,MAAM,KAAK,GAAG,CAAC,GAAG,SAAS,CAAC,YAAY,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;QAChH,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO;QAC/B,iDAAiD;QACjD,KAAK,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,GAAG,EAAE,EAAE;YAC1B,SAAS,CAAC,aAAa,CAAC,EAAE,QAAQ,EAAE,KAAK,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC;YAC5D,OAAO,KAAK,GAAG,GAAG,CAAC,QAAQ,CAAC;QAC9B,CAAC,EAAE,CAAC,CAAC,CAAC;QACN,MAAM,KAAK,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACpF,KAAK,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,OAAO,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9D,CAAC;AACH,CAAC"}

package/dist/copc/copc-info.d.ts

@@ -0,0 +1,52 @@
+import { type LasHeader } from '../formats/las.js';
+import type { PointCloudBBox } from '../types.js';
+import type { PointSourceSpatialMetadata, RangeByteSource } from '../streaming/types.js';
+/** Byte size of the LAS 1.4 public header block. */
+export declare const LAS14_HEADER_SIZE = 375;
+/** Header + the `copc` VLR header + its payload: everything detection needs. */
+export declare const COPC_PROBE_BYTES: number;
+/** VLRs are control-plane metadata; a larger block is refused before allocation. */
+export declare const MAX_COPC_VLR_BYTES: number;
+/** The `copc`/`info` VLR payload. */
+export interface CopcInfo {
+    /** Centre of the root octree cube, in native (unshifted) coordinates. */
+    center: [number, number, number];
+    /** Half the edge length of the root cube. */
+    halfsize: number;
+    /** Point spacing at the root level; halves with every level. */
+    spacing: number;
+    /** Absolute file offset of the root hierarchy page. */
+    rootHierOffset: number;
+    /** Byte size of the root hierarchy page (a multiple of 32). */
+    rootHierSize: number;
+    gpsTimeMin: number;
+    gpsTimeMax: number;
+}
+/** Everything `openCopc` learns before touching point data. */
+export interface CopcFileInfo {
+    header: LasHeader;
+    info: CopcInfo;
+    fileSize: number;
+    spatialMetadata?: PointSourceSpatialMetadata;
+}
+/** True when `bytes` (at least `COPC_PROBE_BYTES` of a file's start) is a COPC header. */
+export declare function isCopcHeader(bytes: Uint8Array): boolean;
+/** Parse the 160-byte `copc`/`info` payload. Throws on a non-finite or impossible cube. */
+export declare function parseCopcInfo(payload: Uint8Array, fileSize: number): CopcInfo;
+/**
+ * Read the header and VLR block through `source`, validating that this is a
+ * COPC file this reader can decode. Point data is not touched.
+ */
+export declare function readCopcFileInfo(source: RangeByteSource, signal?: AbortSignal): Promise<CopcFileInfo>;
+/** An octree address: level `d` and integer cell `x, y, z` in `[0, 2^d)`. */
+export interface VoxelKey {
+    d: number;
+    x: number;
+    y: number;
+    z: number;
+}
+/** Stable string id for a key (`"d-x-y-z"`), the form COPC tools print. */
+export declare function voxelKeyId(key: VoxelKey): string;
+/** The cube a node covers, in native coordinates: the root cube split `2^d` ways per axis. */
+export declare function copcNodeBounds(info: CopcInfo, key: VoxelKey): PointCloudBBox;
+//# sourceMappingURL=copc-info.d.ts.map

package/dist/copc/copc-info.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"copc-info.d.ts","sourceRoot":"","sources":["../../src/copc/copc-info.ts"],"names":[],"mappings":"AAgBA,OAAO,EAA6B,KAAK,SAAS,EAAE,MAAM,mBAAmB,CAAC;AAC9E,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AAClD,OAAO,KAAK,EAAE,0BAA0B,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAC;AAEzF,oDAAoD;AACpD,eAAO,MAAM,iBAAiB,MAAM,CAAC;AAGrC,gFAAgF;AAChF,eAAO,MAAM,gBAAgB,QAAuD,CAAC;AACrF,oFAAoF;AACpF,eAAO,MAAM,kBAAkB,QAAW,CAAC;AAK3C,qCAAqC;AACrC,MAAM,WAAW,QAAQ;IACvB,yEAAyE;IACzE,MAAM,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;IACjC,6CAA6C;IAC7C,QAAQ,EAAE,MAAM,CAAC;IACjB,gEAAgE;IAChE,OAAO,EAAE,MAAM,CAAC;IAChB,uDAAuD;IACvD,cAAc,EAAE,MAAM,CAAC;IACvB,+DAA+D;IAC/D,YAAY,EAAE,MAAM,CAAC;IACrB,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,+DAA+D;AAC/D,MAAM,WAAW,YAAY;IAC3B,MAAM,EAAE,SAAS,CAAC;IAClB,IAAI,EAAE,QAAQ,CAAC;IACf,QAAQ,EAAE,MAAM,CAAC;IACjB,eAAe,CAAC,EAAE,0BAA0B,CAAC;CAC9C;AAYD,0FAA0F;AAC1F,wBAAgB,YAAY,CAAC,KAAK,EAAE,UAAU,GAAG,OAAO,CAQvD;AAED,2FAA2F;AAC3F,wBAAgB,aAAa,CAAC,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAE,MAAM,GAAG,QAAQ,CAoB7E;AAED;;;GAGG;AACH,wBAAsB,gBAAgB,CAAC,MAAM,EAAE,eAAe,EAAE,MAAM,CAAC,EAAE,WAAW,GAAG,OAAO,CAAC,YAAY,CAAC,CA0B3G;AA2BD,6EAA6E;AAC7E,MAAM,WAAW,QAAQ;IACvB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX;AAED,2EAA2E;AAC3E,wBAAgB,UAAU,CAAC,GAAG,EAAE,QAAQ,GAAG,MAAM,CAEhD;AAED,8FAA8F;AAC9F,wBAAgB,cAAc,CAAC,IAAI,EAAE,QAAQ,EAAE,GAAG,EAAE,QAAQ,GAAG,cAAc,CAQ5E"}

package/dist/copc/copc-info.js

@@ -0,0 +1,147 @@
+/* This Source Code Form is subject to the terms of the Mozilla Public
+ * License, v. 2.0. If a copy of the MPL was not distributed with this
+ * file, You can obtain one at https://mozilla.org/MPL/2.0/. */
+/**
+ * COPC 1.0 header and `copc`/`info` VLR (#6869), from the specification at
+ * https://copc.io.
+ *
+ * A COPC file is a LAS 1.4 file (point formats 6, 7 or 8, LAZ-compressed)
+ * whose FIRST VLR is `copc`/1, a 160-byte record describing the octree cube
+ * and where the root hierarchy page lives. Detection is by that VLR, not by
+ * the `.copc.laz` file name: a renamed COPC file is still COPC and a plain
+ * LAZ named `.copc.laz` is not.
+ */
+import { extractWktCrsIdentifiers } from '../spatial-wkt.js';
+import { parseLasHeader, readU64LE } from '../formats/las.js';
+/** Byte size of the LAS 1.4 public header block. */
+export const LAS14_HEADER_SIZE = 375;
+const VLR_HEADER_SIZE = 54;
+const COPC_INFO_SIZE = 160;
+/** Header + the `copc` VLR header + its payload: everything detection needs. */
+export const COPC_PROBE_BYTES = LAS14_HEADER_SIZE + VLR_HEADER_SIZE + COPC_INFO_SIZE;
+/** VLRs are control-plane metadata; a larger block is refused before allocation. */
+export const MAX_COPC_VLR_BYTES = 16 << 20;
+const COPC_POINT_FORMATS = new Set([6, 7, 8]);
+const LASF_PROJECTION = 'LASF_Projection';
+const WKT_RECORD_ID = 2112;
+function readAscii(bytes, start, length) {
+    let out = '';
+    for (let i = start; i < start + length; i++) {
+        const c = bytes[i];
+        if (c === 0)
+            break;
+        out += String.fromCharCode(c);
+    }
+    return out;
+}
+/** True when `bytes` (at least `COPC_PROBE_BYTES` of a file's start) is a COPC header. */
+export function isCopcHeader(bytes) {
+    if (bytes.length < COPC_PROBE_BYTES)
+        return false;
+    const view = new DataView(bytes.buffer, bytes.byteOffset, bytes.byteLength);
+    if (view.getUint32(0, true) !== 0x4653414c)
+        return false; // "LASF"
+    if (view.getUint8(24) !== 1 || view.getUint8(25) !== 4)
+        return false;
+    const headerSize = view.getUint16(94, true);
+    if (headerSize !== LAS14_HEADER_SIZE)
+        return false;
+    return readAscii(bytes, headerSize + 2, 16) === 'copc' && view.getUint16(headerSize + 18, true) === 1;
+}
+/** Parse the 160-byte `copc`/`info` payload. Throws on a non-finite or impossible cube. */
+export function parseCopcInfo(payload, fileSize) {
+    if (payload.length < COPC_INFO_SIZE)
+        throw new Error('COPC: info VLR truncated');
+    const view = new DataView(payload.buffer, payload.byteOffset, payload.byteLength);
+    const center = [view.getFloat64(0, true), view.getFloat64(8, true), view.getFloat64(16, true)];
+    const halfsize = view.getFloat64(24, true);
+    const spacing = view.getFloat64(32, true);
+    const rootHierOffset = readU64LE(view, 40);
+    const rootHierSize = readU64LE(view, 48);
+    const gpsTimeMin = view.getFloat64(56, true);
+    const gpsTimeMax = view.getFloat64(64, true);
+    if (!center.every(Number.isFinite))
+        throw new Error('COPC: info VLR has a non-finite octree centre');
+    if (!(Number.isFinite(halfsize) && halfsize > 0))
+        throw new Error(`COPC: invalid octree halfsize ${halfsize}`);
+    if (!(Number.isFinite(spacing) && spacing > 0))
+        throw new Error(`COPC: invalid root spacing ${spacing}`);
+    if (rootHierSize <= 0 || rootHierSize % 32 !== 0) {
+        throw new Error(`COPC: root hierarchy page size ${rootHierSize} is not a positive multiple of 32`);
+    }
+    if (rootHierOffset < LAS14_HEADER_SIZE || rootHierOffset + rootHierSize > fileSize) {
+        throw new Error(`COPC: root hierarchy page [${rootHierOffset}, +${rootHierSize}) lies outside the ${fileSize}-byte file`);
+    }
+    return { center, halfsize, spacing, rootHierOffset, rootHierSize, gpsTimeMin, gpsTimeMax };
+}
+/**
+ * Read the header and VLR block through `source`, validating that this is a
+ * COPC file this reader can decode. Point data is not touched.
+ */
+export async function readCopcFileInfo(source, signal) {
+    const head = await source.read(0, COPC_PROBE_BYTES, signal);
+    if (!isCopcHeader(head)) {
+        throw new Error('COPC: not a COPC file (LAS 1.4 header whose first VLR is copc/info expected)');
+    }
+    const header = parseLasHeader(head);
+    if (!COPC_POINT_FORMATS.has(header.pointDataFormatId)) {
+        throw new Error(`COPC: point data format ${header.pointDataFormatId} is not one of 6, 7, 8`);
+    }
+    const vlrEnd = header.pointDataOffset;
+    if (vlrEnd < COPC_PROBE_BYTES || vlrEnd > source.size) {
+        throw new Error(`COPC: point data offset ${vlrEnd} lies outside the file`);
+    }
+    if (vlrEnd - LAS14_HEADER_SIZE > MAX_COPC_VLR_BYTES) {
+        throw new Error(`COPC: VLR block of ${vlrEnd - LAS14_HEADER_SIZE} bytes exceeds the ${MAX_COPC_VLR_BYTES}-byte limit`);
+    }
+    const vlrs = vlrEnd > COPC_PROBE_BYTES
+        ? concat(head, await source.read(COPC_PROBE_BYTES, vlrEnd, signal))
+        : head;
+    if (vlrs.length < vlrEnd)
+        throw new Error('COPC: VLR block truncated');
+    const info = parseCopcInfo(vlrs.subarray(LAS14_HEADER_SIZE + VLR_HEADER_SIZE, COPC_PROBE_BYTES), source.size);
+    const wkt = findWkt(vlrs, header.numberOfVlrs, vlrEnd);
+    const spatialMetadata = wkt
+        ? { ...extractWktCrsIdentifiers(wkt), wkt, provenance: 'LAS OGC WKT VLR' }
+        : undefined;
+    return { header, info, fileSize: source.size, ...(spatialMetadata ? { spatialMetadata } : {}) };
+}
+/** Walk the VLR list (bounded by both the declared count and the byte block). */
+function findWkt(bytes, count, end) {
+    const view = new DataView(bytes.buffer, bytes.byteOffset, bytes.byteLength);
+    let at = LAS14_HEADER_SIZE;
+    for (let i = 0; i < count && at + VLR_HEADER_SIZE <= end; i++) {
+        const userId = readAscii(bytes, at + 2, 16);
+        const recordId = view.getUint16(at + 18, true);
+        const length = view.getUint16(at + 20, true);
+        const dataStart = at + VLR_HEADER_SIZE;
+        if (dataStart + length > end)
+            break;
+        if (userId === LASF_PROJECTION && recordId === WKT_RECORD_ID) {
+            return new TextDecoder().decode(bytes.subarray(dataStart, dataStart + length)).replace(/\0+$/, '');
+        }
+        at = dataStart + length;
+    }
+    return undefined;
+}
+function concat(a, b) {
+    const out = new Uint8Array(a.length + b.length);
+    out.set(a, 0);
+    out.set(b, a.length);
+    return out;
+}
+/** Stable string id for a key (`"d-x-y-z"`), the form COPC tools print. */
+export function voxelKeyId(key) {
+    return `${key.d}-${key.x}-${key.y}-${key.z}`;
+}
+/** The cube a node covers, in native coordinates: the root cube split `2^d` ways per axis. */
+export function copcNodeBounds(info, key) {
+    const side = (2 * info.halfsize) / 2 ** key.d;
+    const min = [
+        info.center[0] - info.halfsize + key.x * side,
+        info.center[1] - info.halfsize + key.y * side,
+        info.center[2] - info.halfsize + key.z * side,
+    ];
+    return { min, max: [min[0] + side, min[1] + side, min[2] + side] };
+}
+//# sourceMappingURL=copc-info.js.map