@drawcall/lod 0.3.0 → 0.4.0

package/dist/instanced/pages/index.d.ts

@@ -1,74 +0,0 @@
-import { type Renderer, StorageBufferAttribute, StorageInstancedBufferAttribute } from "three/webgpu";
-import type { Attributes, ChunkRange } from "./chunk.js";
-/** A chunk to take in: its attributes and its range of them, where its instance count lies, and its InstancedLod's row. */
-export interface PoolChunk extends Pick<ChunkRange, "start" | "count" | "countIndex"> {
-    readonly attributes: Attributes;
-    readonly row: number;
-}
-/** The page pool of a LodGpu, and the passes that fill and free it. */
-export declare class InstancePagePool {
-    /** Room for instances, in pages of `PAGE`. */
-    readonly capacity: number;
-    readonly pages: number;
-    /** How many pages chunks hold, then per page held its id and its InstancedLod's row (see `PAGE_BITS`). */
-    readonly occupied: StorageBufferAttribute;
-    /** Bumped whenever the passes ran: what the pages hold changed. */
-    version: number;
-    private readonly pool;
-    private passes;
-    /** Per slot, its chunk and windows, and the generation of the chunk it last took: a slot reused in one frame still frees its pages. */
-    private readonly held;
-    private readonly generations;
-    private readonly free;
-    /** The windows no chunk counts in, and those of chunks removed, free once the passes freed their pages. */
-    private windows;
-    private releasing;
-    /** The slots whose chunks are taken in at the next run, and whether a chunk was removed since the last. */
-    private readonly due;
-    private removed;
-    /** The last read of the chunks' states, and the run it followed. */
-    private read;
-    /** Whether the pool's CPU arrays were dropped (see `releaseArrays`). */
-    private released;
-    constructor(
-    /** The most instances held at once. */
-    maxInstanceCount: number, 
-    /** The most chunks held at once. */
-    maxChunkCount: number);
-    /** Every pool index's instance matrix, as the level meshes draw them. */
-    get matrices(): StorageInstancedBufferAttribute;
-    /** Every pool index's colour, RGB and a pad. */
-    get colors(): StorageInstancedBufferAttribute;
-    /** Whether the next run takes chunks in or frees them. */
-    get pending(): boolean;
-    /** Take `chunk` into a free slot at the next run; its slot. */
-    add(chunk: PoolChunk): number;
-    /** Take slot `slot`'s chunk in again at the next run: its attributes changed. */
-    change(slot: number): void;
-    /** Free slot `slot`; its chunk's pages go back to the pool at the next run, its windows after it. */
-    remove(slot: number): void;
-    private heldAt;
-    private write;
-    /** The first of `count` free windows, taken; null if no run of them is free. */
-    private take;
-    /** Free the windows of `freed`, merging runs that meet. */
-    private giveBack;
-    /** Take the chunks' changes in on `renderer`, if they changed since the last run. */
-    prepare(renderer: Renderer): void;
-    /** Run slot `slot`'s chunk's `pass`, one workgroup per window of its range. */
-    private run;
-    /**
-     * The instances the chunks of `slots` hold, once every one has been taken in; null while changes wait for the passes
-     * or chunks changed meanwhile. Throws if a chunk lacks pages. Reads the GPU's progress back.
-     */
-    status(renderer: Renderer, slots: readonly number[]): Promise<number | null>;
-    /** The chunks' states as the GPU holds them after run `version`: one read back for every InstancedLod asking. */
-    private statesAt;
-    dispose(): void;
-}
-/**
- * Drop the CPU arrays of `attributes`, buffers only the GPU writes, once a pass has run with them: they are never read
- * again, and they are most of what they cost on the CPU. This relies on three never uploading them again (as of three
- * r186): nothing marks them for an update, and a LodGpu's renderer, initialised, made each buffer as the pass ran.
- */
-export declare function releaseArrays(attributes: readonly StorageInstancedBufferAttribute[]): void;

package/dist/instanced/pages/index.js

@@ -1,269 +0,0 @@
-import { StorageBufferAttribute, StorageInstancedBufferAttribute } from "three/webgpu";
-import { at } from "../../at.js";
-import { PAGE_BITS } from "./buffers.js";
-import { PoolPasses } from "./passes.js";
-import { PAGE } from "./workgroup.js";
-// Every instance of every InstancedLod of a LodGpu lives in its page pool: fixed pages of `PAGE` instances, which chunks,
-// from the CPU or the GPU, are copied into, and which updateInstance visits one workgroup per page (see update.ts).
-//
-// In the first render after chunks were added, changed or removed, these passes run: one workgroup
-// walks the chunk slots and pushes every removed or changed chunk's pages back on the free stack; per chunk taken in, a
-// pass with one workgroup per window of `PAGE` of its range counts the window's instances, those at a scale above 0 (an
-// app's pass marks "no instance" with scale 0); one workgroup then gives every such chunk the pages its instances need,
-// turning its windows' counts into where their instances start; per chunk again, a pass writes each instance into its
-// page, so a chunk's instances fill its pages in order, a spot without an instance costs no room, and the room past its
-// last instance draws nothing; last, one workgroup lists every page chunks hold, with its InstancedLod's row. That
-// render is the only time a chunk's attributes are read. A chunk that finds the stack short holds the pages it got, its
-// instances clamped to them, until it is removed; `status` reports it. The CPU never learns a count: it knows only
-// which slots hold chunks and which windows they count in, and the GPU knows what each got.
-/** Windows of `PAGE` spots per page of instances that chunks may span: chunks hold far more spots than instances. */
-const WINDOWS_PER_PAGE = 16;
-/** WebGPU's guaranteed maxStorageBufferBindingSize: the pool's matrices are one binding. */
-const MAX_BINDING = 128 * 2 ** 20;
-/** The page pool of a LodGpu, and the passes that fill and free it. */
-export class InstancePagePool {
-    /** Room for instances, in pages of `PAGE`. */
-    capacity;
-    pages;
-    /** How many pages chunks hold, then per page held its id and its InstancedLod's row (see `PAGE_BITS`). */
-    occupied;
-    /** Bumped whenever the passes ran: what the pages hold changed. */
-    version = 0;
-    pool;
-    passes = null;
-    /** Per slot, its chunk and windows, and the generation of the chunk it last took: a slot reused in one frame still frees its pages. */
-    held;
-    generations;
-    free = [];
-    /** The windows no chunk counts in, and those of chunks removed, free once the passes freed their pages. */
-    windows;
-    releasing = [];
-    /** The slots whose chunks are taken in at the next run, and whether a chunk was removed since the last. */
-    due = new Set();
-    removed = false;
-    /** The last read of the chunks' states, and the run it followed. */
-    read = null;
-    /** Whether the pool's CPU arrays were dropped (see `releaseArrays`). */
-    released = false;
-    constructor(
-    /** The most instances held at once. */
-    maxInstanceCount, 
-    /** The most chunks held at once. */
-    maxChunkCount) {
-        for (const [name, value] of [
-            ["maxInstanceCount", maxInstanceCount],
-            ["maxChunkCount", maxChunkCount],
-        ]) {
-            if (!Number.isInteger(value) || value < 1)
-                throw new RangeError(`LodGpu: ${name} must be a positive integer, got ${value}`);
-        }
-        // A part-filled page per chunk besides the pages that fill.
-        const pages = maxChunkCount + Math.ceil(maxInstanceCount / PAGE);
-        if (pages >= 2 ** PAGE_BITS)
-            throw new RangeError(`LodGpu: ${pages} pages of ${PAGE} instances outgrow the ${2 ** PAGE_BITS} a pool lists: lower maxInstanceCount or maxChunkCount`);
-        if (pages * PAGE * 64 > MAX_BINDING)
-            throw new RangeError(`LodGpu: the matrices of ${pages} pages of ${PAGE} instances outgrow a storage binding of ${MAX_BINDING} bytes: lower maxInstanceCount or maxChunkCount`);
-        const windows = WINDOWS_PER_PAGE * pages;
-        this.pages = pages;
-        this.capacity = pages * PAGE;
-        // Popped from the end: page 0 first.
-        const stack = new Uint32Array(pages + 1);
-        stack[0] = pages;
-        for (let i = 0; i < pages; i++)
-            stack[i + 1] = pages - 1 - i;
-        const words = (length, itemSize = 1) => new StorageBufferAttribute(new Uint32Array(length * itemSize), itemSize);
-        this.pool = {
-            pages,
-            slots: maxChunkCount,
-            stack: new StorageBufferAttribute(stack, 1),
-            table: words(windows),
-            windows: words(windows),
-            sources: words(maxChunkCount, 4),
-            states: words(2 * maxChunkCount, 4),
-            occupied: words(pages + 1),
-            matrices: new StorageInstancedBufferAttribute(new Float32Array(this.capacity * 16), 16),
-            colors: new StorageInstancedBufferAttribute(new Float32Array(this.capacity * 4), 4),
-        };
-        this.occupied = this.pool.occupied;
-        this.windows = [{ first: 0, count: windows }];
-        this.held = Array.from({ length: maxChunkCount }, () => null);
-        this.generations = new Uint32Array(maxChunkCount);
-        for (let slot = maxChunkCount - 1; slot >= 0; slot--)
-            this.free.push(slot);
-    }
-    /** Every pool index's instance matrix, as the level meshes draw them. */
-    get matrices() {
-        return this.pool.matrices;
-    }
-    /** Every pool index's colour, RGB and a pad. */
-    get colors() {
-        return this.pool.colors;
-    }
-    /** Whether the next run takes chunks in or frees them. */
-    get pending() {
-        return this.due.size > 0 || this.removed;
-    }
-    /** Take `chunk` into a free slot at the next run; its slot. */
-    add(chunk) {
-        const slot = this.free.pop();
-        if (slot === undefined)
-            throw new Error(`InstancedLod: all ${this.pool.slots} chunk slots are taken: raise LodGpu's maxChunkCount`);
-        const windows = Math.ceil(chunk.count / PAGE);
-        const base = this.take(windows);
-        if (base === null) {
-            this.free.push(slot);
-            throw new Error(`InstancedLod: chunks span more than the pool's ${this.pool.table.count} windows of ${PAGE} spots: raise LodGpu's maxInstanceCount`);
-        }
-        this.held[slot] = { chunk, base, windows };
-        this.change(slot);
-        return slot;
-    }
-    /** Take slot `slot`'s chunk in again at the next run: its attributes changed. */
-    change(slot) {
-        const { base, windows, chunk } = this.heldAt(slot);
-        const generation = at(this.generations, slot) + 1;
-        this.generations[slot] = generation;
-        this.write(slot, [base, windows, generation, chunk.row + 1]);
-        this.due.add(slot);
-    }
-    /** Free slot `slot`; its chunk's pages go back to the pool at the next run, its windows after it. */
-    remove(slot) {
-        const { base, windows } = this.heldAt(slot);
-        this.held[slot] = null;
-        this.releasing.push({ first: base, count: windows });
-        this.write(slot, [0, 0, at(this.generations, slot), 0]);
-        this.due.delete(slot);
-        this.free.push(slot);
-        this.removed = true;
-    }
-    heldAt(slot) {
-        const held = this.held[slot];
-        if (!held)
-            throw new Error(`InstancedLod: chunk slot ${slot} holds no chunk`);
-        return held;
-    }
-    write(slot, values) {
-        const { sources } = this.pool;
-        sources.array.set(values, slot * 4);
-        sources.addUpdateRange(slot * 4, 4);
-        sources.needsUpdate = true;
-    }
-    /** The first of `count` free windows, taken; null if no run of them is free. */
-    take(count) {
-        if (count === 0)
-            return 0;
-        const run = this.windows.find((each) => each.count >= count);
-        if (!run)
-            return null;
-        const first = run.first;
-        run.first += count;
-        run.count -= count;
-        if (run.count === 0)
-            this.windows.splice(this.windows.indexOf(run), 1);
-        return first;
-    }
-    /** Free the windows of `freed`, merging runs that meet. */
-    giveBack(freed) {
-        if (freed.length === 0)
-            return;
-        const runs = [...this.windows, ...freed.filter((run) => run.count > 0)].sort((a, b) => a.first - b.first);
-        const merged = [];
-        for (const run of runs) {
-            const last = merged.at(-1);
-            if (last && last.first + last.count === run.first)
-                last.count += run.count;
-            else
-                merged.push({ ...run });
-        }
-        this.windows = merged;
-    }
-    /** Take the chunks' changes in on `renderer`, if they changed since the last run. */
-    prepare(renderer) {
-        if (!this.pending)
-            return;
-        const passes = (this.passes ??= new PoolPasses(this.pool));
-        // The free pass reads the windows of chunks removed since the last run: they serve chunks taken in after it.
-        const freed = this.releasing;
-        this.releasing = [];
-        renderer.compute(passes.free);
-        for (const slot of this.due)
-            this.run(renderer, passes, slot, "count");
-        renderer.compute(passes.allocate);
-        for (const slot of this.due)
-            this.run(renderer, passes, slot, "write");
-        renderer.compute(passes.occupy);
-        this.due.clear();
-        this.removed = false;
-        this.version++;
-        this.giveBack(freed);
-        if (!this.released)
-            releaseArrays([this.pool.matrices, this.pool.colors]);
-        this.released = true;
-    }
-    /** Run slot `slot`'s chunk's `pass`, one workgroup per window of its range. */
-    run(renderer, passes, slot, pass) {
-        const { chunk, base, windows } = this.heldAt(slot);
-        if (windows === 0)
-            return;
-        const { attributes, start, count, countIndex } = chunk;
-        renderer.compute(passes.chunkPass(pass, attributes, { slot, base, start, count, countIndex }), [windows, 1, 1]);
-    }
-    /**
-     * The instances the chunks of `slots` hold, once every one has been taken in; null while changes wait for the passes
-     * or chunks changed meanwhile. Throws if a chunk lacks pages. Reads the GPU's progress back.
-     */
-    async status(renderer, slots) {
-        if (this.pending)
-            return null;
-        if (slots.length === 0)
-            return 0;
-        const version = this.version;
-        const states = await this.statesAt(renderer, version);
-        if (version !== this.version || this.pending)
-            return null;
-        let instances = 0;
-        let short = 0;
-        let got = 0;
-        let needed = 0;
-        for (const slot of slots) {
-            const base = slot * 8;
-            if (states[base] !== this.generations[slot])
-                return null;
-            instances += at(states, base + 2);
-            if (at(states, base + 1) === at(states, base + 3))
-                continue;
-            short++;
-            got += at(states, base + 1);
-            needed += at(states, base + 3);
-        }
-        if (short > 0) {
-            throw new Error(`InstancedLod: ${short} chunk${short === 1 ? "" : "s"} lack pages, holding ${got} of the ${needed} pages they need: raise LodGpu's maxInstanceCount (its pool has ${this.pool.pages} pages of ${PAGE})`);
-        }
-        return instances;
-    }
-    /** The chunks' states as the GPU holds them after run `version`: one read back for every InstancedLod asking. */
-    statesAt(renderer, version) {
-        if (this.read?.version !== version) {
-            const promise = renderer.getArrayBufferAsync(this.pool.states).then((buffer) => new Uint32Array(buffer));
-            this.read = { version, promise };
-        }
-        return this.read.promise;
-    }
-    dispose() {
-        const { pool } = this;
-        for (const attribute of [pool.stack, pool.table, pool.windows, pool.sources, pool.states, pool.occupied, pool.matrices, pool.colors])
-            attribute.dispose();
-        this.passes?.dispose();
-        this.passes = null;
-    }
-}
-/**
- * Drop the CPU arrays of `attributes`, buffers only the GPU writes, once a pass has run with them: they are never read
- * again, and they are most of what they cost on the CPU. This relies on three never uploading them again (as of three
- * r186): nothing marks them for an update, and a LodGpu's renderer, initialised, made each buffer as the pass ran.
- */
-export function releaseArrays(attributes) {
-    for (const attribute of attributes)
-        attribute.array = new Float32Array(0);
-}
-//# sourceMappingURL=index.js.map

package/dist/instanced/pages/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/instanced/pages/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAiB,sBAAsB,EAAE,+BAA+B,EAAE,MAAM,cAAc,CAAC;AACtG,OAAO,EAAE,EAAE,EAAE,MAAM,aAAa,CAAC;AACjC,OAAO,EAAE,SAAS,EAAoB,MAAM,cAAc,CAAC;AAE3D,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,EAAE,IAAI,EAAE,MAAM,gBAAgB,CAAC;AAEtC,0HAA0H;AAC1H,oHAAoH;AACpH,EAAE;AACF,mGAAmG;AACnG,wHAAwH;AACxH,wHAAwH;AACxH,wHAAwH;AACxH,sHAAsH;AACtH,wHAAwH;AACxH,mHAAmH;AACnH,wHAAwH;AACxH,mHAAmH;AACnH,4FAA4F;AAE5F,qHAAqH;AACrH,MAAM,gBAAgB,GAAG,EAAE,CAAC;AAE5B,4FAA4F;AAC5F,MAAM,WAAW,GAAG,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC;AAqBlC,uEAAuE;AACvE,MAAM,OAAO,gBAAgB;IAC3B,8CAA8C;IACrC,QAAQ,CAAS;IACjB,KAAK,CAAS;IACvB,0GAA0G;IACjG,QAAQ,CAAyB;IAC1C,mEAAmE;IACnE,OAAO,GAAG,CAAC,CAAC;IACK,IAAI,CAAc;IAC3B,MAAM,GAAsB,IAAI,CAAC;IACzC,uIAAuI;IACtH,IAAI,CAAkB;IACtB,WAAW,CAAc;IACzB,IAAI,GAAa,EAAE,CAAC;IACrC,2GAA2G;IACnG,OAAO,CAAQ;IACf,SAAS,GAAU,EAAE,CAAC;IAC9B,2GAA2G;IAC1F,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;IACjC,OAAO,GAAG,KAAK,CAAC;IACxB,oEAAoE;IAC5D,IAAI,GAA8D,IAAI,CAAC;IAC/E,wEAAwE;IAChE,QAAQ,GAAG,KAAK,CAAC;IAEzB;IACE,uCAAuC;IACvC,gBAAwB;IACxB,oCAAoC;IACpC,aAAqB;QAErB,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI;YAC1B,CAAC,kBAAkB,EAAE,gBAAgB,CAAC;YACtC,CAAC,eAAe,EAAE,aAAa,CAAC;SACxB,EAAE,CAAC;YACX,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC;gBAAE,MAAM,IAAI,UAAU,CAAC,WAAW,IAAI,oCAAoC,KAAK,EAAE,CAAC,CAAC;QAC9H,CAAC;QACD,4DAA4D;QAC5D,MAAM,KAAK,GAAG,aAAa,GAAG,IAAI,CAAC,IAAI,CAAC,gBAAgB,GAAG,IAAI,CAAC,CAAC;QACjE,IAAI,KAAK,IAAI,CAAC,IAAI,SAAS;YACzB,MAAM,IAAI,UAAU,CAAC,WAAW,KAAK,aAAa,IAAI,0BAA0B,CAAC,IAAI,SAAS,wDAAwD,CAAC,CAAC;QAC1J,IAAI,KAAK,GAAG,IAAI,GAAG,EAAE,GAAG,WAAW;YACjC,MAAM,IAAI,UAAU,CAClB,2BAA2B,KAAK,aAAa,IAAI,2CAA2C,WAAW,iDAAiD,CACzJ,CAAC;QACJ,MAAM,OAAO,GAAG,gBAAgB,GAAG,KAAK,CAAC;QACzC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,QAAQ,GAAG,KAAK,GAAG,IAAI,CAAC;QAC7B,qCAAqC;QACrC,MAAM,KAAK,GAAG,IAAI,WAAW,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QACzC,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;QACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE;YAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC;QAC7D,MAAM,KAAK,GAAG,CAAC,MAAc,EAAE,QAAQ,GAAG,CAAC,EAAE,EAAE,CAAC,IAAI,sBAAsB,CAAC,IAAI,WAAW,CAAC,MAAM,GAAG,QAAQ,CAAC,EAAE,QAAQ,CAAC,CAAC;QACzH,IAAI,CAAC,IAAI,GAAG;YACV,KAAK;YACL,KAAK,EAAE,aAAa;YACpB,KAAK,EAAE,IAAI,sBAAsB,CAAC,KAAK,EAAE,CAAC,CAAC;YAC3C,KAAK,EAAE,KAAK,CAAC,OAAO,CAAC;YACrB,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC;YACvB,OAAO,EAAE,KAAK,CAAC,aAAa,EAAE,CAAC,CAAC;YAChC,MAAM,EAAE,KAAK,CAAC,CAAC,GAAG,aAAa,EAAE,CAAC,CAAC;YACnC,QAAQ,EAAE,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC;YAC1B,QAAQ,EAAE,IAAI,+BAA+B,CAAC,IAAI,YAAY,CAAC,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YACvF,MAAM,EAAE,IAAI,+BAA+B,CAAC,IAAI,YAAY,CAAC,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;SACpF,CAAC;QACF,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC;QACnC,IAAI,CAAC,OAAO,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC;QAC9C,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,aAAa,EAAE,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;QAC9D,IAAI,CAAC,WAAW,GAAG,IAAI,WAAW,CAAC,aAAa,CAAC,CAAC;QAClD,KAAK,IAAI,IAAI,GAAG,aAAa,GAAG,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,IAAI,EAAE;YAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC7E,CAAC;IAED,yEAAyE;IACzE,IAAI,QAAQ;QACV,OAAO,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC;IAC5B,CAAC;IAED,gDAAgD;IAChD,IAAI,MAAM;QACR,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;IAC1B,CAAC;IAED,0DAA0D;IAC1D,IAAI,OAAO;QACT,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,IAAI,IAAI,CAAC,OAAO,CAAC;IAC3C,CAAC;IAED,+DAA+D;IAC/D,GAAG,CAAC,KAAgB;QAClB,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC;QAC7B,IAAI,IAAI,KAAK,SAAS;YAAE,MAAM,IAAI,KAAK,CAAC,qBAAqB,IAAI,CAAC,IAAI,CAAC,KAAK,sDAAsD,CAAC,CAAC;QACpI,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,CAAC;QAC9C,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAChC,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;YAClB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACrB,MAAM,IAAI,KAAK,CAAC,kDAAkD,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,eAAe,IAAI,yCAAyC,CAAC,CAAC;QACvJ,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;QAC3C,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAClB,OAAO,IAAI,CAAC;IACd,CAAC;IAED,iFAAiF;IACjF,MAAM,CAAC,IAAY;QACjB,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACnD,MAAM,UAAU,GAAG,EAAE,CAAC,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;QAClD,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,GAAG,UAAU,CAAC;QACpC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,OAAO,EAAE,UAAU,EAAE,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QAC7D,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACrB,CAAC;IAED,qGAAqG;IACrG,MAAM,CAAC,IAAY;QACjB,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC5C,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;QACvB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC;QACrD,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACxD,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACtB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrB,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC;IACtB,CAAC;IAEO,MAAM,CAAC,IAAY;QACzB,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC7B,IAAI,CAAC,IAAI;YAAE,MAAM,IAAI,KAAK,CAAC,4BAA4B,IAAI,iBAAiB,CAAC,CAAC;QAC9E,OAAO,IAAI,CAAC;IACd,CAAC;IAEO,KAAK,CAAC,IAAY,EAAE,MAAyB;QACnD,MAAM,EAAE,OAAO,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC;QAC9B,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC;QACpC,OAAO,CAAC,cAAc,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QACpC,OAAO,CAAC,WAAW,GAAG,IAAI,CAAC;IAC7B,CAAC;IAED,gFAAgF;IACxE,IAAI,CAAC,KAAa;QACxB,IAAI,KAAK,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC;QAC1B,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,CAAC;QAC7D,IAAI,CAAC,GAAG;YAAE,OAAO,IAAI,CAAC;QACtB,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC;QACxB,GAAG,CAAC,KAAK,IAAI,KAAK,CAAC;QACnB,GAAG,CAAC,KAAK,IAAI,KAAK,CAAC;QACnB,IAAI,GAAG,CAAC,KAAK,KAAK,CAAC;YAAE,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QACvE,OAAO,KAAK,CAAC;IACf,CAAC;IAED,2DAA2D;IACnD,QAAQ,CAAC,KAAqB;QACpC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO;QAC/B,MAAM,IAAI,GAAG,CAAC,GAAG,IAAI,CAAC,OAAO,EAAE,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAC1G,MAAM,MAAM,GAAU,EAAE,CAAC;QACzB,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,MAAM,IAAI,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3B,IAAI,IAAI,IAAI,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,KAAK,GAAG,CAAC,KAAK;gBAAE,IAAI,CAAC,KAAK,IAAI,GAAG,CAAC,KAAK,CAAC;;gBACtE,MAAM,CAAC,IAAI,CAAC,EAAE,GAAG,GAAG,EAAE,CAAC,CAAC;QAC/B,CAAC;QACD,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;IACxB,CAAC;IAED,qFAAqF;IACrF,OAAO,CAAC,QAAkB;QACxB,IAAI,CAAC,IAAI,CAAC,OAAO;YAAE,OAAO;QAC1B,MAAM,MAAM,GAAG,CAAC,IAAI,CAAC,MAAM,KAAK,IAAI,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAC3D,6GAA6G;QAC7G,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC;QAC7B,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC;QACpB,QAAQ,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC9B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,GAAG;YAAE,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;QACvE,QAAQ,CAAC,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QAClC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,GAAG;YAAE,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;QACvE,QAAQ,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAChC,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC;QACjB,IAAI,CAAC,OAAO,GAAG,KAAK,CAAC;QACrB,IAAI,CAAC,OAAO,EAAE,CAAC;QACf,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QACrB,IAAI,CAAC,IAAI,CAAC,QAAQ;YAAE,aAAa,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;QAC1E,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;IACvB,CAAC;IAED,+EAA+E;IACvE,GAAG,CAAC,QAAkB,EAAE,MAAkB,EAAE,IAAY,EAAE,IAAuB;QACvF,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACnD,IAAI,OAAO,KAAK,CAAC;YAAE,OAAO;QAC1B,MAAM,EAAE,UAAU,EAAE,KAAK,EAAE,KAAK,EAAE,UAAU,EAAE,GAAG,KAAK,CAAC;QACvD,QAAQ,CAAC,OAAO,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,UAAU,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAClH,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,MAAM,CAAC,QAAkB,EAAE,KAAwB;QACvD,IAAI,IAAI,CAAC,OAAO;YAAE,OAAO,IAAI,CAAC;QAC9B,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC;QACjC,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;QAC7B,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;QACtD,IAAI,OAAO,KAAK,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,OAAO;YAAE,OAAO,IAAI,CAAC;QAC1D,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC;YACtB,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC;gBAAE,OAAO,IAAI,CAAC;YACzD,SAAS,IAAI,EAAE,CAAC,MAAM,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC;YAClC,IAAI,EAAE,CAAC,MAAM,EAAE,IAAI,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,MAAM,EAAE,IAAI,GAAG,CAAC,CAAC;gBAAE,SAAS;YAC5D,KAAK,EAAE,CAAC;YACR,GAAG,IAAI,EAAE,CAAC,MAAM,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC;YAC5B,MAAM,IAAI,EAAE,CAAC,MAAM,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC;QACjC,CAAC;QACD,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;YACd,MAAM,IAAI,KAAK,CACb,iBAAiB,KAAK,SAAS,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,wBAAwB,GAAG,WAAW,MAAM,mEAAmE,IAAI,CAAC,IAAI,CAAC,KAAK,aAAa,IAAI,GAAG,CACxM,CAAC;QACJ,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,iHAAiH;IACzG,QAAQ,CAAC,QAAkB,EAAE,OAAe;QAClD,IAAI,IAAI,CAAC,IAAI,EAAE,OAAO,KAAK,OAAO,EAAE,CAAC;YACnC,MAAM,OAAO,GAAG,QAAQ,CAAC,mBAAmB,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,IAAI,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC;YACzG,IAAI,CAAC,IAAI,GAAG,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC;QACnC,CAAC;QACD,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC;IAC3B,CAAC;IAED,OAAO;QACL,MAAM,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC;QACtB,KAAK,MAAM,SAAS,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC;YAAE,SAAS,CAAC,OAAO,EAAE,CAAC;QAC1J,IAAI,CAAC,MAAM,EAAE,OAAO,EAAE,CAAC;QACvB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;IACrB,CAAC;CACF;AAED;;;;GAIG;AACH,MAAM,UAAU,aAAa,CAAC,UAAsD;IAClF,KAAK,MAAM,SAAS,IAAI,UAAU;QAAE,SAAS,CAAC,KAAK,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;AAC5E,CAAC"}

package/dist/instanced/pages/passes.d.ts

@@ -1,21 +0,0 @@
-import type { ComputeNode } from "three/webgpu";
-import type { PoolBuffers } from "./buffers.js";
-import { type Attributes, type ChunkRange } from "./chunk.js";
-/**
- * A pool's passes: built once, the count and write passes once per layout of the attributes they read (colours of a
- * stride or none, counts or none: six at most), and pointed at a chunk's attributes and range as it is about to run
- * (see `chunkPass`). They run at once as the pool prepares, never queued, so no pass still waits to run when the next
- * chunk is set.
- */
-export declare class PoolPasses {
-    private readonly pool;
-    readonly free: ComputeNode;
-    readonly allocate: ComputeNode;
-    readonly occupy: ComputeNode;
-    private readonly uniforms;
-    private readonly byLayout;
-    constructor(pool: PoolBuffers);
-    /** `pass` for the chunk of `attributes` and `range`, pointed at them: run it before pointing it at another. */
-    chunkPass(pass: "count" | "write", attributes: Attributes, range: ChunkRange): ComputeNode;
-    dispose(): void;
-}

package/dist/instanced/pages/passes.js

@@ -1,52 +0,0 @@
-import { chunkReads, chunkUniforms, countPass, writePass } from "./chunk.js";
-import { allocatePass, freePass, occupyPass } from "./slots.js";
-/**
- * A pool's passes: built once, the count and write passes once per layout of the attributes they read (colours of a
- * stride or none, counts or none: six at most), and pointed at a chunk's attributes and range as it is about to run
- * (see `chunkPass`). They run at once as the pool prepares, never queued, so no pass still waits to run when the next
- * chunk is set.
- */
-export class PoolPasses {
-    pool;
-    free;
-    allocate;
-    occupy;
-    uniforms = chunkUniforms();
-    byLayout = new Map();
-    constructor(pool) {
-        this.pool = pool;
-        this.free = freePass(pool);
-        this.allocate = allocatePass(pool);
-        this.occupy = occupyPass(pool);
-    }
-    /** `pass` for the chunk of `attributes` and `range`, pointed at them: run it before pointing it at another. */
-    chunkPass(pass, attributes, range) {
-        const layout = `${attributes.colors?.stride ?? 0}/${attributes.counts ? 1 : 0}`;
-        let passes = this.byLayout.get(layout);
-        if (!passes) {
-            const reads = chunkReads(attributes);
-            passes = { reads, count: countPass(this.pool, this.uniforms, reads), write: writePass(this.pool, this.uniforms, reads) };
-            this.byLayout.set(layout, passes);
-        }
-        const { reads } = passes;
-        reads.matrices.value = attributes.matrices;
-        if (reads.colors && attributes.colors)
-            reads.colors.floats.value = attributes.colors.attribute;
-        if (reads.counts && attributes.counts)
-            reads.counts.value = attributes.counts;
-        const { uniforms } = this;
-        uniforms.slot.value = range.slot;
-        uniforms.base.value = range.base;
-        uniforms.start.value = range.start;
-        uniforms.count.value = range.count;
-        uniforms.countIndex.value = range.countIndex;
-        return passes[pass];
-    }
-    dispose() {
-        const chunkNodes = [...this.byLayout.values()].flatMap(({ count, write }) => [count, write]);
-        for (const node of [this.free, this.allocate, this.occupy, ...chunkNodes])
-            node.dispose();
-        this.byLayout.clear();
-    }
-}
-//# sourceMappingURL=passes.js.map

package/dist/instanced/pages/passes.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"passes.js","sourceRoot":"","sources":["../../../src/instanced/pages/passes.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,UAAU,EAAE,aAAa,EAAE,SAAS,EAAE,SAAS,EAAqD,MAAM,YAAY,CAAC;AAChI,OAAO,EAAE,YAAY,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AAYhE;;;;;GAKG;AACH,MAAM,OAAO,UAAU;IAOQ;IANpB,IAAI,CAAc;IAClB,QAAQ,CAAc;IACtB,MAAM,CAAc;IACZ,QAAQ,GAAG,aAAa,EAAE,CAAC;IAC3B,QAAQ,GAAG,IAAI,GAAG,EAAuB,CAAC;IAE3D,YAA6B,IAAiB;QAAjB,SAAI,GAAJ,IAAI,CAAa;QAC5C,IAAI,CAAC,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC;QAC3B,IAAI,CAAC,QAAQ,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;QACnC,IAAI,CAAC,MAAM,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC;IACjC,CAAC;IAED,+GAA+G;IAC/G,SAAS,CAAC,IAAuB,EAAE,UAAsB,EAAE,KAAiB;QAC1E,MAAM,MAAM,GAAG,GAAG,UAAU,CAAC,MAAM,EAAE,MAAM,IAAI,CAAC,IAAI,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAChF,IAAI,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACvC,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,MAAM,KAAK,GAAG,UAAU,CAAC,UAAU,CAAC,CAAC;YACrC,MAAM,GAAG,EAAE,KAAK,EAAE,KAAK,EAAE,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,QAAQ,EAAE,KAAK,CAAC,EAAE,KAAK,EAAE,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,QAAQ,EAAE,KAAK,CAAC,EAAE,CAAC;YACzH,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QACpC,CAAC;QACD,MAAM,EAAE,KAAK,EAAE,GAAG,MAAM,CAAC;QACzB,KAAK,CAAC,QAAQ,CAAC,KAAK,GAAG,UAAU,CAAC,QAAQ,CAAC;QAC3C,IAAI,KAAK,CAAC,MAAM,IAAI,UAAU,CAAC,MAAM;YAAE,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,GAAG,UAAU,CAAC,MAAM,CAAC,SAAS,CAAC;QAC/F,IAAI,KAAK,CAAC,MAAM,IAAI,UAAU,CAAC,MAAM;YAAE,KAAK,CAAC,MAAM,CAAC,KAAK,GAAG,UAAU,CAAC,MAAM,CAAC;QAC9E,MAAM,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAC;QAC1B,QAAQ,CAAC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC;QACjC,QAAQ,CAAC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC;QACjC,QAAQ,CAAC,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;QACnC,QAAQ,CAAC,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;QACnC,QAAQ,CAAC,UAAU,CAAC,KAAK,GAAG,KAAK,CAAC,UAAU,CAAC;QAC7C,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC;IACtB,CAAC;IAED,OAAO;QACL,MAAM,UAAU,GAAG,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;QAC7F,KAAK,MAAM,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,EAAE,GAAG,UAAU,CAAC;YAAE,IAAI,CAAC,OAAO,EAAE,CAAC;QAC1F,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;IACxB,CAAC;CACF"}

package/dist/instanced/pages/slots.d.ts

@@ -1,11 +0,0 @@
-import type { ComputeNode } from "three/webgpu";
-import { type PoolBuffers } from "./buffers.js";
-/** Frees the pages of every chunk removed or changed since the last run: one workgroup. */
-export declare function freePass(pool: PoolBuffers): ComputeNode;
-/**
- * Gives new chunks the pages their instances need, turning their window counts into where their instances start: one
- * workgroup. Under a short stack, which chunks get its last pages is a race.
- */
-export declare function allocatePass(pool: PoolBuffers): ComputeNode;
-/** Lists every page chunks hold, with its InstancedLod's row, for updateInstance to visit: one workgroup. */
-export declare function occupyPass(pool: PoolBuffers): ComputeNode;

package/dist/instanced/pages/slots.js

@@ -1,90 +0,0 @@
-import { Break, If, Loop, atomicAdd, atomicLoad, atomicStore, atomicSub, localId, storage, storageBarrier, uint, uvec4 } from "three/tsl";
-import { PAGE_BITS, nodes } from "./buffers.js";
-import { PAGE, least, workgroups } from "./workgroup.js";
-/** `body` for every chunk slot of `pool`, in a pass of one workgroup, its lanes taking every `PAGE`th slot. */
-function eachSlot(pool, body) {
-    Loop({ start: uint(0), end: uint(Math.ceil(pool.slots / PAGE)), type: "uint", condition: "<" }, ({ i }) => {
-        const slot = i.mul(PAGE).add(localId.x).toVar();
-        If(slot.lessThan(pool.slots), () => body(slot));
-    });
-}
-/** Slot `slot`'s state, the generation, pages, instances and needed pages, and the first window its pages are listed from. */
-function stateOf(n, slot) {
-    return { state: n.states.element(slot.mul(2)).toVar(), first: n.states.element(slot.mul(2).add(1)).x.toVar() };
-}
-/** Frees the pages of every chunk removed or changed since the last run: one workgroup. */
-export function freePass(pool) {
-    const n = nodes(pool);
-    const top = n.stack.element(0);
-    return workgroups(() => {
-        eachSlot(pool, (slot) => {
-            const source = n.sources.element(slot).toVar();
-            const { state, first } = stateOf(n, slot);
-            If(source.w.equal(0).or(state.x.notEqual(source.z)), () => {
-                Loop({ start: uint(0), end: state.y, type: "uint", condition: "<" }, ({ i }) => {
-                    atomicStore(n.stack.element(atomicAdd(top, uint(1)).add(1)), n.table.element(first.add(i)));
-                });
-                n.states.element(slot.mul(2)).assign(uvec4(0));
-            });
-        });
-    });
-}
-/**
- * Gives new chunks the pages their instances need, turning their window counts into where their instances start: one
- * workgroup. Under a short stack, which chunks get its last pages is a race.
- */
-export function allocatePass(pool) {
-    const n = nodes(pool);
-    const top = n.stack.element(0);
-    return workgroups(() => {
-        eachSlot(pool, (slot) => {
-            const source = n.sources.element(slot).toVar();
-            const state = n.states.element(slot.mul(2)).toVar();
-            If(source.w.notEqual(0).and(state.x.notEqual(source.z)), () => {
-                const first = source.x;
-                const instances = uint(0).toVar();
-                Loop({ start: uint(0), end: source.y, type: "uint", condition: "<" }, ({ i }) => {
-                    const window = n.windows.element(first.add(i));
-                    const counted = window.toVar();
-                    window.assign(instances);
-                    instances.addAssign(counted);
-                });
-                const need = instances
-                    .add(PAGE - 1)
-                    .div(PAGE)
-                    .toVar();
-                const held = uint(0).toVar();
-                Loop({ start: uint(0), end: need, type: "uint", condition: "<" }, ({ i }) => {
-                    // The page under the top before taking it; none when the stack ran dry, its count wrapped past 0.
-                    const before = atomicSub(top, uint(1)).toVar();
-                    If(before.sub(1).greaterThanEqual(pool.pages), () => {
-                        atomicAdd(top, uint(1));
-                        Break();
-                    });
-                    n.table.element(first.add(i)).assign(atomicLoad(n.stack.element(before)));
-                    held.addAssign(1);
-                });
-                n.states.element(slot.mul(2)).assign(uvec4(source.z, held, least(instances, held.mul(PAGE)), need));
-                n.states.element(slot.mul(2).add(1)).assign(uvec4(first, 0, 0, 0));
-            });
-        });
-    });
-}
-/** Lists every page chunks hold, with its InstancedLod's row, for updateInstance to visit: one workgroup. */
-export function occupyPass(pool) {
-    const n = nodes(pool);
-    const occupied = storage(pool.occupied, "uint", 0).toAtomic();
-    return workgroups(() => {
-        If(localId.x.equal(0), () => void atomicStore(occupied.element(0), uint(0)));
-        storageBarrier();
-        eachSlot(pool, (slot) => {
-            const row = n.sources.element(slot).w.sub(1).toVar();
-            const { state, first } = stateOf(n, slot);
-            Loop({ start: uint(0), end: state.y, type: "uint", condition: "<" }, ({ i }) => {
-                const entry = n.table.element(first.add(i)).bitOr(row.shiftLeft(PAGE_BITS));
-                atomicStore(occupied.element(atomicAdd(occupied.element(0), uint(1)).add(1)), entry);
-            });
-        });
-    });
-}
-//# sourceMappingURL=slots.js.map

package/dist/instanced/pages/slots.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"slots.js","sourceRoot":"","sources":["../../../src/instanced/pages/slots.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,UAAU,EAAE,WAAW,EAAE,SAAS,EAAE,OAAO,EAAE,OAAO,EAAE,cAAc,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,WAAW,CAAC;AAC1I,OAAO,EAAE,SAAS,EAAE,KAAK,EAAoB,MAAM,cAAc,CAAC;AAClE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,UAAU,EAAE,MAAM,gBAAgB,CAAC;AAOzD,+GAA+G;AAC/G,SAAS,QAAQ,CAAC,IAAiB,EAAE,IAAkC;IACrE,IAAI,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE;QACxG,MAAM,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC;QAChD,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;AACL,CAAC;AAED,8HAA8H;AAC9H,SAAS,OAAO,CAAC,CAAQ,EAAE,IAAkB;IAC3C,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC;AACjH,CAAC;AAED,2FAA2F;AAC3F,MAAM,UAAU,QAAQ,CAAC,IAAiB;IACxC,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;IACtB,MAAM,GAAG,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAC/B,OAAO,UAAU,CAAC,GAAG,EAAE;QACrB,QAAQ,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,EAAE;YACtB,MAAM,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC;YAC/C,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,OAAO,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;YAC1C,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE;gBACxD,IAAI,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE;oBAC7E,WAAW,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC9F,CAAC,CAAC,CAAC;gBACH,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YACjD,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,YAAY,CAAC,IAAiB;IAC5C,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;IACtB,MAAM,GAAG,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAC/B,OAAO,UAAU,CAAC,GAAG,EAAE;QACrB,QAAQ,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,EAAE;YACtB,MAAM,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC;YAC/C,MAAM,KAAK,GAAG,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC;YACpD,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE;gBAC5D,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC;gBACvB,MAAM,SAAS,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC;gBAClC,IAAI,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE;oBAC9E,MAAM,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC/C,MAAM,OAAO,GAAG,MAAM,CAAC,KAAK,EAAE,CAAC;oBAC/B,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;oBACzB,SAAS,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;gBAC/B,CAAC,CAAC,CAAC;gBACH,MAAM,IAAI,GAAG,SAAS;qBACnB,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC;qBACb,GAAG,CAAC,IAAI,CAAC;qBACT,KAAK,EAAE,CAAC;gBACX,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC;gBAC7B,IAAI,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE;oBAC1E,kGAAkG;oBAClG,MAAM,MAAM,GAAG,SAAS,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC;oBAC/C,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,gBAAgB,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,EAAE;wBAClD,SAAS,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;wBACxB,KAAK,EAAE,CAAC;oBACV,CAAC,CAAC,CAAC;oBACH,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;oBAC1E,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;gBACpB,CAAC,CAAC,CAAC;gBACH,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,SAAS,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;gBACpG,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACrE,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC;AAED,6GAA6G;AAC7G,MAAM,UAAU,UAAU,CAAC,IAAiB;IAC1C,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;IACtB,MAAM,QAAQ,GAAG,OAAO,CAAC,IAAI,CAAC,QAAQ,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;IAC9D,OAAO,UAAU,CAAC,GAAG,EAAE;QACrB,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,WAAW,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7E,cAAc,EAAE,CAAC;QACjB,QAAQ,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,EAAE;YACtB,MAAM,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC;YACrD,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,OAAO,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;YAC1C,IAAI,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE;gBAC7E,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC;gBAC5E,WAAW,CAAC,QAAQ,CAAC,OAAO,CAAC,SAAS,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;YACvF,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC"}

package/dist/instanced/pages/workgroup.d.ts

@@ -1,14 +0,0 @@
-import type { ComputeNode, Node } from "three/webgpu";
-/** Instances per page, and lanes per workgroup of the passes over pages: updateInstance runs one workgroup per page. */
-export declare const PAGE = 256;
-/**
- * A pass of workgroups of `PAGE` lanes: one, unless dispatched indirectly. A dispatch size rather than a count: a count
- * adds an early return, which a barrier may not follow.
- */
-export declare function workgroups(body: () => void): ComputeNode;
-/** The lesser of two uints. */
-export declare const least: (a: Node<"uint">, b: Node<"uint">) => Node<"uint">;
-export declare function rank(chosen: Node<"bool">): {
-    before: Node<"uint">;
-    total: Node<"uint">;
-};

package/dist/instanced/pages/workgroup.js

@@ -1,38 +0,0 @@
-import { Fn, code, computeKernel, localId, uint, uvec2, wgslFn } from "three/tsl";
-// What the page passes share: workgroups of `PAGE` lanes, and ranking lanes within one.
-/** Instances per page, and lanes per workgroup of the passes over pages: updateInstance runs one workgroup per page. */
-export const PAGE = 256;
-/**
- * A pass of workgroups of `PAGE` lanes: one, unless dispatched indirectly. A dispatch size rather than a count: a count
- * adds an early return, which a barrier may not follow.
- */
-export function workgroups(body) {
-    const node = computeKernel(Fn(body)(), [PAGE]);
-    node.dispatchSize = [1, 1, 1];
-    return node;
-}
-/** The lesser of two uints. */
-export const least = (a, b) => a.lessThan(b).select(a, b);
-/**
- * Across a workgroup of `PAGE` lanes: how many lanes before this one are `chosen`, and how many are in all. Every lane
- * calls it, outside any branch: it waits for the others. Hillis–Steele: after the step of width w, each lane holds the
- * sum of the 2w lanes up to it.
- */
-const rankOf = wgslFn(`fn lodRank(lane: u32, chosen: u32) -> vec2u {
-  lodRankSums[lane] = chosen;
-  for (var width = 1u; width < ${PAGE}u; width *= 2u) {
-    workgroupBarrier();
-    var sum = lodRankSums[lane];
-    if (lane >= width) { sum += lodRankSums[lane - width]; }
-    workgroupBarrier();
-    lodRankSums[lane] = sum;
-  }
-  workgroupBarrier();
-  return vec2u(lodRankSums[lane] - chosen, lodRankSums[${PAGE - 1}]);
-}`, [code(`var<workgroup> lodRankSums: array<u32, ${PAGE}>;`)]);
-export function rank(chosen) {
-    const ranked = uvec2(0).toVar();
-    ranked.assign(rankOf({ lane: localId.x, chosen: chosen.select(uint(1), uint(0)) }));
-    return { before: ranked.x, total: ranked.y };
-}
-//# sourceMappingURL=workgroup.js.map

package/dist/instanced/pages/workgroup.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"workgroup.js","sourceRoot":"","sources":["../../../src/instanced/pages/workgroup.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,aAAa,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,WAAW,CAAC;AAElF,wFAAwF;AAExF,wHAAwH;AACxH,MAAM,CAAC,MAAM,IAAI,GAAG,GAAG,CAAC;AAExB;;;GAGG;AACH,MAAM,UAAU,UAAU,CAAC,IAAgB;IACzC,MAAM,IAAI,GAAG,aAAa,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;IAC/C,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAC9B,OAAO,IAAI,CAAC;AACd,CAAC;AAED,+BAA+B;AAC/B,MAAM,CAAC,MAAM,KAAK,GAAG,CAAC,CAAe,EAAE,CAAe,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAEtF;;;;GAIG;AACH,MAAM,MAAM,GAAG,MAAM,CACnB;;iCAE+B,IAAI;;;;;;;;yDAQoB,IAAI,GAAG,CAAC;EAC/D,EACA,CAAC,IAAI,CAAC,0CAA0C,IAAI,IAAI,CAAC,CAAC,CAC3D,CAAC;AAEF,MAAM,UAAU,IAAI,CAAC,MAAoB;IACvC,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC;IAChC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpF,OAAO,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC,EAAE,CAAC;AAC/C,CAAC"}

package/dist/levels/wait.d.ts

@@ -1,27 +0,0 @@
-/**
- * Whether an InstancedLod's chunks wait to be shown taken in on the GPU: from a change until, a few renders later, a
- * read of their status shows each taken in, so that its manager holds its item until a host sees them drawn.
- */
-export declare class ChunkWait {
-    /** Whether the GPU shows every chunk taken in, read back; it throws if a chunk lacks room. */
-    private readonly read;
-    /** Called once a read shows every chunk taken in. */
-    private readonly taken;
-    /** Called with what a read throws. */
-    private readonly failed;
-    /** While chunks wait, the renders left before their status is read, and whether a read is under way. */
-    private rest;
-    constructor(
-    /** Whether the GPU shows every chunk taken in, read back; it throws if a chunk lacks room. */
-    read: () => Promise<boolean>, 
-    /** Called once a read shows every chunk taken in. */
-    taken: () => void, 
-    /** Called with what a read throws. */
-    failed: (error: unknown) => void);
-    /** Whether chunks wait to be shown taken in. */
-    get waiting(): boolean;
-    /** The chunks were added or removed: wait for them again. */
-    changed(): void;
-    /** A render updated the InstancedLod: read the chunks' status once their change has rested. */
-    render(): void;
-}