@meimu/mutracer 0.0.0-stage → 0.1.1

package/lib/renderer/accumulationTarget.d.ts

@@ -0,0 +1,26 @@
+import type { Scene } from '../scene/Scene.js';
+import type { TraceSettings } from './renderPipeline.js';
+import type { RenderPasses } from './RenderingPipeline.js';
+/** Backend-owned execution and outputs of one resident accumulation. */
+export interface TargetPipeline extends RenderPasses {
+    activate(): void;
+    invalidateDenoisedOutput(): void;
+    /** Refreshes backend timing after structural scene changes; optional without GPU timestamps. */
+    invalidateTiming?(): void;
+    configure(settings: TraceSettings): void;
+    synchronizeBackground(background: Scene['background']): void;
+    canCompleteSampleWithin(timeBudgetMs: number): boolean;
+    present(): void;
+    readPresentation(): Promise<{
+        width: number;
+        height: number;
+        data: Float32Array;
+    }>;
+    readonly presentationComplete: boolean;
+    readonly presentationDenoised: boolean;
+    getMemory(): {
+        width: number;
+        height: number;
+        bytes: number;
+    };
+}

package/lib/renderer/accumulationTarget.js

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=accumulationTarget.js.map

package/lib/renderer/accumulationTarget.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"accumulationTarget.js","sourceRoot":"","sources":["../../src/renderer/accumulationTarget.ts"],"names":[],"mappings":"","sourcesContent":["import type { Scene } from '../scene/Scene.js';\nimport type { TraceSettings } from './renderPipeline.js';\nimport type { RenderPasses } from './RenderingPipeline.js';\n\n/** Backend-owned execution and outputs of one resident accumulation. */\nexport interface TargetPipeline extends RenderPasses {\n  activate(): void;\n  invalidateDenoisedOutput(): void;\n  /** Refreshes backend timing after structural scene changes; optional without GPU timestamps. */\n  invalidateTiming?(): void;\n  configure(settings: TraceSettings): void;\n  synchronizeBackground(background: Scene['background']): void;\n  canCompleteSampleWithin(timeBudgetMs: number): boolean;\n  present(): void;\n  readPresentation(): Promise<{width: number; height: number; data: Float32Array}>;\n  readonly presentationComplete: boolean;\n  readonly presentationDenoised: boolean;\n  getMemory(): {width: number; height: number; bytes: number};\n}\n"]}

package/lib/renderer/binnedSahBvh.d.ts

@@ -0,0 +1,31 @@
+export interface BinnedSahBvh {
+    nodeCount: number;
+    /** Per node: min x, y, z, max x, y, z. */
+    bounds: Float32Array;
+    /** Interior node: index of the left child. Leaf: first slot in primIndices. */
+    leftFirst: Uint32Array;
+    /** Primitive count of a leaf; 0 for interior nodes. */
+    primCount: Uint32Array;
+    /** Primitive indices referenced by leaves. */
+    primIndices: Uint32Array;
+}
+/**
+ * Builds a binary BVH over axis-aligned boxes.
+ * @param aabbs min x, y, z, max x, y, z for each primitive.
+ * @param count number of primitives in `aabbs`.
+ */
+export declare function buildBinnedSahBvh(aabbs: Float32Array, count: number): BinnedSahBvh;
+export interface Bvh2Layout {
+    /** Node indices in depth-first order (node, left subtree, right subtree). */
+    order: Uint32Array;
+    /** Offset of each node in vec4 units: 2 per node plus 1 per leaf primitive. */
+    offsets: Uint32Array;
+    vec4Count: number;
+    maxDepth: number;
+    maxLeafPrimitives: number;
+}
+/**
+ * Places nodes in the depth-first BVH2 layout read by the traversal shaders:
+ * the left child follows its parent and leaf primitives follow their leaf.
+ */
+export declare function layoutBvh2(bvh: BinnedSahBvh): Bvh2Layout;

package/lib/renderer/binnedSahBvh.js

@@ -0,0 +1,263 @@
+// Binned SAH BVH builder ported from TinyBVH's reference builder
+// (`BVH::Build( nodeIdx, depth )` in tiny_bvh.h at commit
+// 0e4584287823252cf83f0e9cd072848bec5f79c5, https://github.com/jbikker/tinybvh).
+// Copyright (c) 2024-2026 Jacco Bikker / Breda University of Applied Sciences.
+// MIT License, see src/tinybvh/LICENSE.
+//
+// Like the reference, it bins primitive centroids into 8 bins on all three
+// axes, sweeps the bins for the lowest surface area heuristic cost and stops
+// splitting when a leaf is cheaper (C_INT = C_TRAV = 1). Siblings are stored
+// next to each other: an interior node's children are leftFirst and
+// leftFirst + 1. Unlike the reference, node 1 is not left unused, the task
+// stack grows instead of turning a node into a leaf after 512 entries, and
+// arithmetic is float64: near-equal split costs can resolve differently from
+// TinyBVH's float32, giving trees of the same quality that are not
+// byte-identical.
+const BINS = 8;
+const C_INT = 1;
+const C_TRAV = 1;
+const FAR = 1e30;
+// Scratch shared by all builds; the builder is synchronous.
+const binMin = new Float64Array(3 * BINS * 3);
+const binMax = new Float64Array(3 * BINS * 3);
+const binCount = new Uint32Array(3 * BINS);
+// Per split position: half area times primitive count of each side.
+const leftCost = new Float64Array(BINS - 1);
+const rightCost = new Float64Array(BINS - 1);
+/**
+ * Bin of a centroid along one axis. Binning and partitioning both use this,
+ * so every primitive ends up on the side whose bounds include its bin.
+ */
+function binOf(center, nodeMin, scale) {
+    const bin = ((center - nodeMin) * scale) | 0;
+    return bin < 0 ? 0 : bin > BINS - 1 ? BINS - 1 : bin;
+}
+function growBin(o, minX, minY, minZ, maxX, maxY, maxZ) {
+    binMin[o] = Math.min(binMin[o], minX);
+    binMin[o + 1] = Math.min(binMin[o + 1], minY);
+    binMin[o + 2] = Math.min(binMin[o + 2], minZ);
+    binMax[o] = Math.max(binMax[o], maxX);
+    binMax[o + 1] = Math.max(binMax[o + 1], maxY);
+    binMax[o + 2] = Math.max(binMax[o + 2], maxZ);
+}
+/**
+ * Builds a binary BVH over axis-aligned boxes.
+ * @param aabbs min x, y, z, max x, y, z for each primitive.
+ * @param count number of primitives in `aabbs`.
+ */
+export function buildBinnedSahBvh(aabbs, count) {
+    const capacity = Math.max(1, count * 2 - 1);
+    const bounds = new Float32Array(capacity * 6);
+    const leftFirst = new Uint32Array(capacity);
+    const primCount = new Uint32Array(capacity);
+    const primIndices = new Uint32Array(count);
+    if (count === 0) {
+        return { nodeCount: 0, bounds, leftFirst, primCount, primIndices };
+    }
+    const centers = new Float32Array(count * 3);
+    let rootMinX = FAR, rootMinY = FAR, rootMinZ = FAR;
+    let rootMaxX = -FAR, rootMaxY = -FAR, rootMaxZ = -FAR;
+    for (let i = 0; i < count; i++) {
+        const b = i * 6, c = i * 3;
+        const minX = aabbs[b], minY = aabbs[b + 1], minZ = aabbs[b + 2];
+        const maxX = aabbs[b + 3], maxY = aabbs[b + 4], maxZ = aabbs[b + 5];
+        centers[c] = (minX + maxX) * 0.5;
+        centers[c + 1] = (minY + maxY) * 0.5;
+        centers[c + 2] = (minZ + maxZ) * 0.5;
+        if (minX < rootMinX)
+            rootMinX = minX;
+        if (minY < rootMinY)
+            rootMinY = minY;
+        if (minZ < rootMinZ)
+            rootMinZ = minZ;
+        if (maxX > rootMaxX)
+            rootMaxX = maxX;
+        if (maxY > rootMaxY)
+            rootMaxY = maxY;
+        if (maxZ > rootMaxZ)
+            rootMaxZ = maxZ;
+        primIndices[i] = i;
+    }
+    bounds[0] = rootMinX;
+    bounds[1] = rootMinY;
+    bounds[2] = rootMinZ;
+    bounds[3] = rootMaxX;
+    bounds[4] = rootMaxY;
+    bounds[5] = rootMaxZ;
+    leftFirst[0] = 0;
+    primCount[0] = count;
+    const minDimX = (rootMaxX - rootMinX) * 1e-20;
+    const minDimY = (rootMaxY - rootMinY) * 1e-20;
+    const minDimZ = (rootMaxZ - rootMinZ) * 1e-20;
+    let newNode = 1;
+    const tasks = [];
+    let nodeIndex = 0;
+    while (true) {
+        while (true) {
+            const nb = nodeIndex * 6;
+            const nMinX = bounds[nb], nMinY = bounds[nb + 1], nMinZ = bounds[nb + 2];
+            const extentX = bounds[nb + 3] - nMinX;
+            const extentY = bounds[nb + 4] - nMinY;
+            const extentZ = bounds[nb + 5] - nMinZ;
+            const area = extentX * extentY + extentY * extentZ + extentZ * extentX;
+            if (area === 0)
+                break; // can't split an infinitely small node.
+            const first = leftFirst[nodeIndex];
+            const nodePrims = primCount[nodeIndex];
+            // Every split of a single primitive leaves one side empty.
+            if (nodePrims === 1)
+                break;
+            const scaleX = extentX > minDimX ? BINS / extentX : 0;
+            const scaleY = extentY > minDimY ? BINS / extentY : 0;
+            const scaleZ = extentZ > minDimZ ? BINS / extentZ : 0;
+            for (let i = 0; i < 3 * BINS * 3; i++) {
+                binMin[i] = FAR;
+                binMax[i] = -FAR;
+            }
+            binCount.fill(0);
+            for (let i = first, end = first + nodePrims; i < end; i++) {
+                const p = primIndices[i];
+                const c = p * 3, b = p * 6;
+                const minX = aabbs[b], minY = aabbs[b + 1], minZ = aabbs[b + 2];
+                const maxX = aabbs[b + 3], maxY = aabbs[b + 4], maxZ = aabbs[b + 5];
+                // Axis a, bin i: bounds at ((a * BINS) + i) * 3.
+                const bx = binOf(centers[c], nMinX, scaleX);
+                const by = BINS + binOf(centers[c + 1], nMinY, scaleY);
+                const bz = 2 * BINS + binOf(centers[c + 2], nMinZ, scaleZ);
+                binCount[bx]++;
+                binCount[by]++;
+                binCount[bz]++;
+                growBin(bx * 3, minX, minY, minZ, maxX, maxY, maxZ);
+                growBin(by * 3, minX, minY, minZ, maxX, maxY, maxZ);
+                growBin(bz * 3, minX, minY, minZ, maxX, maxY, maxZ);
+            }
+            // Sweep the bins of each axis for the lowest split cost.
+            let splitCost = FAR;
+            let bestAxis = 0, bestPos = 0;
+            for (let axis = 0; axis < 3; axis++) {
+                const extent = axis === 0 ? extentX : axis === 1 ? extentY : extentZ;
+                const minDim = axis === 0 ? minDimX : axis === 1 ? minDimY : minDimZ;
+                if (!(extent > minDim))
+                    continue;
+                let lMinX = FAR, lMinY = FAR, lMinZ = FAR, lMaxX = -FAR, lMaxY = -FAR, lMaxZ = -FAR;
+                let rMinX = FAR, rMinY = FAR, rMinZ = FAR, rMaxX = -FAR, rMaxY = -FAR, rMaxZ = -FAR;
+                let leftN = 0, rightN = 0;
+                for (let i = 0; i < BINS - 1; i++) {
+                    const l = (axis * BINS + i) * 3;
+                    const r = (axis * BINS + BINS - 1 - i) * 3;
+                    lMinX = Math.min(lMinX, binMin[l]);
+                    lMinY = Math.min(lMinY, binMin[l + 1]);
+                    lMinZ = Math.min(lMinZ, binMin[l + 2]);
+                    lMaxX = Math.max(lMaxX, binMax[l]);
+                    lMaxY = Math.max(lMaxY, binMax[l + 1]);
+                    lMaxZ = Math.max(lMaxZ, binMax[l + 2]);
+                    rMinX = Math.min(rMinX, binMin[r]);
+                    rMinY = Math.min(rMinY, binMin[r + 1]);
+                    rMinZ = Math.min(rMinZ, binMin[r + 2]);
+                    rMaxX = Math.max(rMaxX, binMax[r]);
+                    rMaxY = Math.max(rMaxY, binMax[r + 1]);
+                    rMaxZ = Math.max(rMaxZ, binMax[r + 2]);
+                    leftN += binCount[axis * BINS + i];
+                    rightN += binCount[axis * BINS + BINS - 1 - i];
+                    const lx = lMaxX - lMinX, ly = lMaxY - lMinY, lz = lMaxZ - lMinZ;
+                    const rx = rMaxX - rMinX, ry = rMaxY - rMinY, rz = rMaxZ - rMinZ;
+                    leftCost[i] = leftN === 0 ? FAR : (lx * ly + ly * lz + lz * lx) * leftN;
+                    rightCost[BINS - 2 - i] = rightN === 0 ? FAR : (rx * ry + ry * rz + rz * rx) * rightN;
+                }
+                for (let i = 0; i < BINS - 1; i++) {
+                    const cost = leftCost[i] + rightCost[i];
+                    if (cost < splitCost) {
+                        splitCost = cost;
+                        bestAxis = axis;
+                        bestPos = i;
+                    }
+                }
+            }
+            splitCost = C_TRAV + C_INT * splitCost / area;
+            // Not splitting is better (also stops on non-finite bounds).
+            if (!(splitCost < nodePrims * C_INT))
+                break;
+            // In-place partition by the chosen bin.
+            const scale = bestAxis === 0 ? scaleX : bestAxis === 1 ? scaleY : scaleZ;
+            const nMin = bestAxis === 0 ? nMinX : bestAxis === 1 ? nMinY : nMinZ;
+            let j = first + nodePrims, src = first;
+            for (let i = 0; i < nodePrims; i++) {
+                const p = primIndices[src];
+                if (binOf(centers[p * 3 + bestAxis], nMin, scale) <= bestPos) {
+                    src++;
+                }
+                else {
+                    primIndices[src] = primIndices[--j];
+                    primIndices[j] = p;
+                }
+            }
+            const leftPrims = src - first;
+            const rightPrims = nodePrims - leftPrims;
+            if (leftPrims === 0 || rightPrims === 0)
+                break; // should not happen.
+            const n = newNode;
+            newNode += 2;
+            // Child bounds are the unions of the bins on each side of the split.
+            const leftBase = n * 6, rightBase = leftBase + 6;
+            for (let k = 0; k < 3; k++) {
+                bounds[leftBase + k] = bounds[rightBase + k] = FAR;
+                bounds[leftBase + 3 + k] = bounds[rightBase + 3 + k] = -FAR;
+            }
+            for (let i = 0; i < BINS; i++) {
+                const o = (bestAxis * BINS + i) * 3;
+                const base = i <= bestPos ? leftBase : rightBase;
+                for (let k = 0; k < 3; k++) {
+                    if (binMin[o + k] < bounds[base + k])
+                        bounds[base + k] = binMin[o + k];
+                    if (binMax[o + k] > bounds[base + 3 + k])
+                        bounds[base + 3 + k] = binMax[o + k];
+                }
+            }
+            leftFirst[n] = first;
+            primCount[n] = leftPrims;
+            leftFirst[n + 1] = j;
+            primCount[n + 1] = rightPrims;
+            leftFirst[nodeIndex] = n;
+            primCount[nodeIndex] = 0;
+            tasks.push(n + 1);
+            nodeIndex = n;
+        }
+        if (!tasks.length)
+            break;
+        nodeIndex = tasks.pop();
+    }
+    return { nodeCount: newNode, bounds, leftFirst, primCount, primIndices };
+}
+/**
+ * Places nodes in the depth-first BVH2 layout read by the traversal shaders:
+ * the left child follows its parent and leaf primitives follow their leaf.
+ */
+export function layoutBvh2(bvh) {
+    const { nodeCount, leftFirst, primCount } = bvh;
+    const order = new Uint32Array(nodeCount);
+    const offsets = new Uint32Array(nodeCount);
+    let vec4Count = 0, maxDepth = 0, maxLeafPrimitives = 0;
+    if (!nodeCount)
+        return { order, offsets, vec4Count, maxDepth, maxLeafPrimitives };
+    const stack = [0, 1];
+    let written = 0;
+    while (stack.length) {
+        const depth = stack.pop();
+        const node = stack.pop();
+        order[written++] = node;
+        offsets[node] = vec4Count;
+        if (depth > maxDepth)
+            maxDepth = depth;
+        const prims = primCount[node];
+        vec4Count += 2 + prims;
+        if (prims) {
+            if (prims > maxLeafPrimitives)
+                maxLeafPrimitives = prims;
+        }
+        else {
+            stack.push(leftFirst[node] + 1, depth + 1, leftFirst[node], depth + 1);
+        }
+    }
+    return { order, offsets, vec4Count, maxDepth, maxLeafPrimitives };
+}
+//# sourceMappingURL=binnedSahBvh.js.map

package/lib/renderer/binnedSahBvh.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"binnedSahBvh.js","sourceRoot":"","sources":["../../src/renderer/binnedSahBvh.ts"],"names":[],"mappings":"AAAA,iEAAiE;AACjE,0DAA0D;AAC1D,iFAAiF;AACjF,+EAA+E;AAC/E,wCAAwC;AACxC,EAAE;AACF,2EAA2E;AAC3E,6EAA6E;AAC7E,6EAA6E;AAC7E,oEAAoE;AACpE,2EAA2E;AAC3E,2EAA2E;AAC3E,6EAA6E;AAC7E,mEAAmE;AACnE,kBAAkB;AAElB,MAAM,IAAI,GAAG,CAAC,CAAC;AACf,MAAM,KAAK,GAAG,CAAC,CAAC;AAChB,MAAM,MAAM,GAAG,CAAC,CAAC;AACjB,MAAM,GAAG,GAAG,IAAI,CAAC;AAcjB,4DAA4D;AAC5D,MAAM,MAAM,GAAG,IAAI,YAAY,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC;AAC9C,MAAM,MAAM,GAAG,IAAI,YAAY,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC;AAC9C,MAAM,QAAQ,GAAG,IAAI,WAAW,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;AAC3C,oEAAoE;AACpE,MAAM,QAAQ,GAAG,IAAI,YAAY,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;AAC5C,MAAM,SAAS,GAAG,IAAI,YAAY,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;AAE7C;;;GAGG;AACH,SAAS,KAAK,CAAC,MAAc,EAAE,OAAe,EAAE,KAAa;IAC3D,MAAM,GAAG,GAAG,CAAC,CAAC,MAAM,GAAG,OAAO,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;IAC7C,OAAO,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;AACvD,CAAC;AAED,SAAS,OAAO,CACd,CAAS,EACT,IAAY,EAAE,IAAY,EAAE,IAAY,EACxC,IAAY,EAAE,IAAY,EAAE,IAAY;IAExC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IACtC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IAC9C,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IAC9C,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IACtC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IAC9C,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;AAChD,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,iBAAiB,CAAC,KAAmB,EAAE,KAAa;IAClE,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IAC5C,MAAM,MAAM,GAAG,IAAI,YAAY,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC;IAC9C,MAAM,SAAS,GAAG,IAAI,WAAW,CAAC,QAAQ,CAAC,CAAC;IAC5C,MAAM,SAAS,GAAG,IAAI,WAAW,CAAC,QAAQ,CAAC,CAAC;IAC5C,MAAM,WAAW,GAAG,IAAI,WAAW,CAAC,KAAK,CAAC,CAAC;IAC3C,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;QAChB,OAAO,EAAE,SAAS,EAAE,CAAC,EAAE,MAAM,EAAE,SAAS,EAAE,SAAS,EAAE,WAAW,EAAE,CAAC;IACrE,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,YAAY,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;IAC5C,IAAI,QAAQ,GAAG,GAAG,EAAE,QAAQ,GAAG,GAAG,EAAE,QAAQ,GAAG,GAAG,CAAC;IACnD,IAAI,QAAQ,GAAG,CAAC,GAAG,EAAE,QAAQ,GAAG,CAAC,GAAG,EAAE,QAAQ,GAAG,CAAC,GAAG,CAAC;IACtD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/B,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC3B,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAChE,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACpE,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,GAAG,CAAC;QACjC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,GAAG,CAAC;QACrC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,GAAG,CAAC;QACrC,IAAI,IAAI,GAAG,QAAQ;YAAE,QAAQ,GAAG,IAAI,CAAC;QACrC,IAAI,IAAI,GAAG,QAAQ;YAAE,QAAQ,GAAG,IAAI,CAAC;QACrC,IAAI,IAAI,GAAG,QAAQ;YAAE,QAAQ,GAAG,IAAI,CAAC;QACrC,IAAI,IAAI,GAAG,QAAQ;YAAE,QAAQ,GAAG,IAAI,CAAC;QACrC,IAAI,IAAI,GAAG,QAAQ;YAAE,QAAQ,GAAG,IAAI,CAAC;QACrC,IAAI,IAAI,GAAG,QAAQ;YAAE,QAAQ,GAAG,IAAI,CAAC;QACrC,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACrB,CAAC;IACD,MAAM,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC;IAAC,MAAM,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC;IAAC,MAAM,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC;IACjE,MAAM,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC;IAAC,MAAM,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC;IAAC,MAAM,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC;IACjE,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACjB,SAAS,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;IAErB,MAAM,OAAO,GAAG,CAAC,QAAQ,GAAG,QAAQ,CAAC,GAAG,KAAK,CAAC;IAC9C,MAAM,OAAO,GAAG,CAAC,QAAQ,GAAG,QAAQ,CAAC,GAAG,KAAK,CAAC;IAC9C,MAAM,OAAO,GAAG,CAAC,QAAQ,GAAG,QAAQ,CAAC,GAAG,KAAK,CAAC;IAE9C,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,OAAO,IAAI,EAAE,CAAC;QACZ,OAAO,IAAI,EAAE,CAAC;YACZ,MAAM,EAAE,GAAG,SAAS,GAAG,CAAC,CAAC;YACzB,MAAM,KAAK,GAAG,MAAM,CAAC,EAAE,CAAC,EAAE,KAAK,GAAG,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,KAAK,GAAG,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;YACzE,MAAM,OAAO,GAAG,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC;YACvC,MAAM,OAAO,GAAG,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC;YACvC,MAAM,OAAO,GAAG,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC;YACvC,MAAM,IAAI,GAAG,OAAO,GAAG,OAAO,GAAG,OAAO,GAAG,OAAO,GAAG,OAAO,GAAG,OAAO,CAAC;YACvE,IAAI,IAAI,KAAK,CAAC;gBAAE,MAAM,CAAC,wCAAwC;YAE/D,MAAM,KAAK,GAAG,SAAS,CAAC,SAAS,CAAC,CAAC;YACnC,MAAM,SAAS,GAAG,SAAS,CAAC,SAAS,CAAC,CAAC;YACvC,2DAA2D;YAC3D,IAAI,SAAS,KAAK,CAAC;gBAAE,MAAM;YAC3B,MAAM,MAAM,GAAG,OAAO,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;YACtD,MAAM,MAAM,GAAG,OAAO,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;YACtD,MAAM,MAAM,GAAG,OAAO,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;YAEtD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACtC,MAAM,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;gBAChB,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC;YACnB,CAAC;YACD,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACjB,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,GAAG,GAAG,KAAK,GAAG,SAAS,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC1D,MAAM,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;gBACzB,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAC3B,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBAChE,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACpE,iDAAiD;gBACjD,MAAM,EAAE,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;gBAC5C,MAAM,EAAE,GAAG,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;gBACvD,MAAM,EAAE,GAAG,CAAC,GAAG,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;gBAC3D,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC;gBAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC;gBAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC/C,OAAO,CAAC,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;gBACpD,OAAO,CAAC,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;gBACpD,OAAO,CAAC,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;YACtD,CAAC;YAED,yDAAyD;YACzD,IAAI,SAAS,GAAG,GAAG,CAAC;YACpB,IAAI,QAAQ,GAAG,CAAC,EAAE,OAAO,GAAG,CAAC,CAAC;YAC9B,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC;gBACpC,MAAM,MAAM,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC;gBACrE,MAAM,MAAM,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC;gBACrE,IAAI,CAAC,CAAC,MAAM,GAAG,MAAM,CAAC;oBAAE,SAAS;gBACjC,IAAI,KAAK,GAAG,GAAG,EAAE,KAAK,GAAG,GAAG,EAAE,KAAK,GAAG,GAAG,EAAE,KAAK,GAAG,CAAC,GAAG,EAAE,KAAK,GAAG,CAAC,GAAG,EAAE,KAAK,GAAG,CAAC,GAAG,CAAC;gBACpF,IAAI,KAAK,GAAG,GAAG,EAAE,KAAK,GAAG,GAAG,EAAE,KAAK,GAAG,GAAG,EAAE,KAAK,GAAG,CAAC,GAAG,EAAE,KAAK,GAAG,CAAC,GAAG,EAAE,KAAK,GAAG,CAAC,GAAG,CAAC;gBACpF,IAAI,KAAK,GAAG,CAAC,EAAE,MAAM,GAAG,CAAC,CAAC;gBAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAClC,MAAM,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;oBAChC,MAAM,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;oBAC3C,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;oBAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBACnH,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;oBAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBACnH,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;oBAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBACnH,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;oBAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBACnH,KAAK,IAAI,QAAQ,CAAC,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC;oBACnC,MAAM,IAAI,QAAQ,CAAC,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;oBAC/C,MAAM,EAAE,GAAG,KAAK,GAAG,KAAK,EAAE,EAAE,GAAG,KAAK,GAAG,KAAK,EAAE,EAAE,GAAG,KAAK,GAAG,KAAK,CAAC;oBACjE,MAAM,EAAE,GAAG,KAAK,GAAG,KAAK,EAAE,EAAE,GAAG,KAAK,GAAG,KAAK,EAAE,EAAE,GAAG,KAAK,GAAG,KAAK,CAAC;oBACjE,QAAQ,CAAC,CAAC,CAAC,GAAG,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,GAAG,KAAK,CAAC;oBACxE,SAAS,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,GAAG,MAAM,CAAC;gBACxF,CAAC;gBACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAClC,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;oBACxC,IAAI,IAAI,GAAG,SAAS,EAAE,CAAC;wBACrB,SAAS,GAAG,IAAI,CAAC;wBACjB,QAAQ,GAAG,IAAI,CAAC;wBAChB,OAAO,GAAG,CAAC,CAAC;oBACd,CAAC;gBACH,CAAC;YACH,CAAC;YACD,SAAS,GAAG,MAAM,GAAG,KAAK,GAAG,SAAS,GAAG,IAAI,CAAC;YAC9C,6DAA6D;YAC7D,IAAI,CAAC,CAAC,SAAS,GAAG,SAAS,GAAG,KAAK,CAAC;gBAAE,MAAM;YAE5C,wCAAwC;YACxC,MAAM,KAAK,GAAG,QAAQ,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC;YACzE,MAAM,IAAI,GAAG,QAAQ,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC;YACrE,IAAI,CAAC,GAAG,KAAK,GAAG,SAAS,EAAE,GAAG,GAAG,KAAK,CAAC;YACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;gBACnC,MAAM,CAAC,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC;gBAC3B,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,OAAO,EAAE,CAAC;oBAC7D,GAAG,EAAE,CAAC;gBACR,CAAC;qBAAM,CAAC;oBACN,WAAW,CAAC,GAAG,CAAC,GAAG,WAAW,CAAC,EAAE,CAAC,CAAC,CAAC;oBACpC,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBACrB,CAAC;YACH,CAAC;YACD,MAAM,SAAS,GAAG,GAAG,GAAG,KAAK,CAAC;YAC9B,MAAM,UAAU,GAAG,SAAS,GAAG,SAAS,CAAC;YACzC,IAAI,SAAS,KAAK,CAAC,IAAI,UAAU,KAAK,CAAC;gBAAE,MAAM,CAAC,qBAAqB;YAErE,MAAM,CAAC,GAAG,OAAO,CAAC;YAClB,OAAO,IAAI,CAAC,CAAC;YACb,qEAAqE;YACrE,MAAM,QAAQ,GAAG,CAAC,GAAG,CAAC,EAAE,SAAS,GAAG,QAAQ,GAAG,CAAC,CAAC;YACjD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,MAAM,CAAC,QAAQ,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,SAAS,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC;gBACnD,MAAM,CAAC,QAAQ,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,SAAS,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC;YAC9D,CAAC;YACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC9B,MAAM,CAAC,GAAG,CAAC,QAAQ,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;gBACpC,MAAM,IAAI,GAAG,CAAC,IAAI,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC;gBACjD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC3B,IAAI,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC;wBAAE,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;oBACvE,IAAI,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC;wBAAE,MAAM,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACjF,CAAC;YACH,CAAC;YACD,SAAS,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;YAAC,SAAS,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC;YAC/C,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;YAAC,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC;YACpD,SAAS,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;YAAC,SAAS,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;YACnD,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAClB,SAAS,GAAG,CAAC,CAAC;QAChB,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,MAAM;YAAE,MAAM;QACzB,SAAS,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;IAC3B,CAAC;IAED,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,SAAS,EAAE,WAAW,EAAE,CAAC;AAC3E,CAAC;AAYD;;;GAGG;AACH,MAAM,UAAU,UAAU,CAAC,GAAiB;IAC1C,MAAM,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,GAAG,GAAG,CAAC;IAChD,MAAM,KAAK,GAAG,IAAI,WAAW,CAAC,SAAS,CAAC,CAAC;IACzC,MAAM,OAAO,GAAG,IAAI,WAAW,CAAC,SAAS,CAAC,CAAC;IAC3C,IAAI,SAAS,GAAG,CAAC,EAAE,QAAQ,GAAG,CAAC,EAAE,iBAAiB,GAAG,CAAC,CAAC;IACvD,IAAI,CAAC,SAAS;QAAE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,iBAAiB,EAAE,CAAC;IAClF,MAAM,KAAK,GAAa,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC/B,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,OAAO,KAAK,CAAC,MAAM,EAAE,CAAC;QACpB,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;QAC3B,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;QAC1B,KAAK,CAAC,OAAO,EAAE,CAAC,GAAG,IAAI,CAAC;QACxB,OAAO,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC;QAC1B,IAAI,KAAK,GAAG,QAAQ;YAAE,QAAQ,GAAG,KAAK,CAAC;QACvC,MAAM,KAAK,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;QAC9B,SAAS,IAAI,CAAC,GAAG,KAAK,CAAC;QACvB,IAAI,KAAK,EAAE,CAAC;YACV,IAAI,KAAK,GAAG,iBAAiB;gBAAE,iBAAiB,GAAG,KAAK,CAAC;QAC3D,CAAC;aAAM,CAAC;YACN,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,SAAS,CAAC,IAAI,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;QACzE,CAAC;IACH,CAAC;IACD,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,iBAAiB,EAAE,CAAC;AACpE,CAAC","sourcesContent":["// Binned SAH BVH builder ported from TinyBVH's reference builder\n// (`BVH::Build( nodeIdx, depth )` in tiny_bvh.h at commit\n// 0e4584287823252cf83f0e9cd072848bec5f79c5, https://github.com/jbikker/tinybvh).\n// Copyright (c) 2024-2026 Jacco Bikker / Breda University of Applied Sciences.\n// MIT License, see src/tinybvh/LICENSE.\n//\n// Like the reference, it bins primitive centroids into 8 bins on all three\n// axes, sweeps the bins for the lowest surface area heuristic cost and stops\n// splitting when a leaf is cheaper (C_INT = C_TRAV = 1). Siblings are stored\n// next to each other: an interior node's children are leftFirst and\n// leftFirst + 1. Unlike the reference, node 1 is not left unused, the task\n// stack grows instead of turning a node into a leaf after 512 entries, and\n// arithmetic is float64: near-equal split costs can resolve differently from\n// TinyBVH's float32, giving trees of the same quality that are not\n// byte-identical.\n\nconst BINS = 8;\nconst C_INT = 1;\nconst C_TRAV = 1;\nconst FAR = 1e30;\n\nexport interface BinnedSahBvh {\n  nodeCount: number;\n  /** Per node: min x, y, z, max x, y, z. */\n  bounds: Float32Array;\n  /** Interior node: index of the left child. Leaf: first slot in primIndices. */\n  leftFirst: Uint32Array;\n  /** Primitive count of a leaf; 0 for interior nodes. */\n  primCount: Uint32Array;\n  /** Primitive indices referenced by leaves. */\n  primIndices: Uint32Array;\n}\n\n// Scratch shared by all builds; the builder is synchronous.\nconst binMin = new Float64Array(3 * BINS * 3);\nconst binMax = new Float64Array(3 * BINS * 3);\nconst binCount = new Uint32Array(3 * BINS);\n// Per split position: half area times primitive count of each side.\nconst leftCost = new Float64Array(BINS - 1);\nconst rightCost = new Float64Array(BINS - 1);\n\n/**\n * Bin of a centroid along one axis. Binning and partitioning both use this,\n * so every primitive ends up on the side whose bounds include its bin.\n */\nfunction binOf(center: number, nodeMin: number, scale: number) {\n  const bin = ((center - nodeMin) * scale) | 0;\n  return bin < 0 ? 0 : bin > BINS - 1 ? BINS - 1 : bin;\n}\n\nfunction growBin(\n  o: number,\n  minX: number, minY: number, minZ: number,\n  maxX: number, maxY: number, maxZ: number\n) {\n  binMin[o] = Math.min(binMin[o], minX);\n  binMin[o + 1] = Math.min(binMin[o + 1], minY);\n  binMin[o + 2] = Math.min(binMin[o + 2], minZ);\n  binMax[o] = Math.max(binMax[o], maxX);\n  binMax[o + 1] = Math.max(binMax[o + 1], maxY);\n  binMax[o + 2] = Math.max(binMax[o + 2], maxZ);\n}\n\n/**\n * Builds a binary BVH over axis-aligned boxes.\n * @param aabbs min x, y, z, max x, y, z for each primitive.\n * @param count number of primitives in `aabbs`.\n */\nexport function buildBinnedSahBvh(aabbs: Float32Array, count: number): BinnedSahBvh {\n  const capacity = Math.max(1, count * 2 - 1);\n  const bounds = new Float32Array(capacity * 6);\n  const leftFirst = new Uint32Array(capacity);\n  const primCount = new Uint32Array(capacity);\n  const primIndices = new Uint32Array(count);\n  if (count === 0) {\n    return { nodeCount: 0, bounds, leftFirst, primCount, primIndices };\n  }\n\n  const centers = new Float32Array(count * 3);\n  let rootMinX = FAR, rootMinY = FAR, rootMinZ = FAR;\n  let rootMaxX = -FAR, rootMaxY = -FAR, rootMaxZ = -FAR;\n  for (let i = 0; i < count; i++) {\n    const b = i * 6, c = i * 3;\n    const minX = aabbs[b], minY = aabbs[b + 1], minZ = aabbs[b + 2];\n    const maxX = aabbs[b + 3], maxY = aabbs[b + 4], maxZ = aabbs[b + 5];\n    centers[c] = (minX + maxX) * 0.5;\n    centers[c + 1] = (minY + maxY) * 0.5;\n    centers[c + 2] = (minZ + maxZ) * 0.5;\n    if (minX < rootMinX) rootMinX = minX;\n    if (minY < rootMinY) rootMinY = minY;\n    if (minZ < rootMinZ) rootMinZ = minZ;\n    if (maxX > rootMaxX) rootMaxX = maxX;\n    if (maxY > rootMaxY) rootMaxY = maxY;\n    if (maxZ > rootMaxZ) rootMaxZ = maxZ;\n    primIndices[i] = i;\n  }\n  bounds[0] = rootMinX; bounds[1] = rootMinY; bounds[2] = rootMinZ;\n  bounds[3] = rootMaxX; bounds[4] = rootMaxY; bounds[5] = rootMaxZ;\n  leftFirst[0] = 0;\n  primCount[0] = count;\n\n  const minDimX = (rootMaxX - rootMinX) * 1e-20;\n  const minDimY = (rootMaxY - rootMinY) * 1e-20;\n  const minDimZ = (rootMaxZ - rootMinZ) * 1e-20;\n\n  let newNode = 1;\n  const tasks: number[] = [];\n  let nodeIndex = 0;\n  while (true) {\n    while (true) {\n      const nb = nodeIndex * 6;\n      const nMinX = bounds[nb], nMinY = bounds[nb + 1], nMinZ = bounds[nb + 2];\n      const extentX = bounds[nb + 3] - nMinX;\n      const extentY = bounds[nb + 4] - nMinY;\n      const extentZ = bounds[nb + 5] - nMinZ;\n      const area = extentX * extentY + extentY * extentZ + extentZ * extentX;\n      if (area === 0) break; // can't split an infinitely small node.\n\n      const first = leftFirst[nodeIndex];\n      const nodePrims = primCount[nodeIndex];\n      // Every split of a single primitive leaves one side empty.\n      if (nodePrims === 1) break;\n      const scaleX = extentX > minDimX ? BINS / extentX : 0;\n      const scaleY = extentY > minDimY ? BINS / extentY : 0;\n      const scaleZ = extentZ > minDimZ ? BINS / extentZ : 0;\n\n      for (let i = 0; i < 3 * BINS * 3; i++) {\n        binMin[i] = FAR;\n        binMax[i] = -FAR;\n      }\n      binCount.fill(0);\n      for (let i = first, end = first + nodePrims; i < end; i++) {\n        const p = primIndices[i];\n        const c = p * 3, b = p * 6;\n        const minX = aabbs[b], minY = aabbs[b + 1], minZ = aabbs[b + 2];\n        const maxX = aabbs[b + 3], maxY = aabbs[b + 4], maxZ = aabbs[b + 5];\n        // Axis a, bin i: bounds at ((a * BINS) + i) * 3.\n        const bx = binOf(centers[c], nMinX, scaleX);\n        const by = BINS + binOf(centers[c + 1], nMinY, scaleY);\n        const bz = 2 * BINS + binOf(centers[c + 2], nMinZ, scaleZ);\n        binCount[bx]++; binCount[by]++; binCount[bz]++;\n        growBin(bx * 3, minX, minY, minZ, maxX, maxY, maxZ);\n        growBin(by * 3, minX, minY, minZ, maxX, maxY, maxZ);\n        growBin(bz * 3, minX, minY, minZ, maxX, maxY, maxZ);\n      }\n\n      // Sweep the bins of each axis for the lowest split cost.\n      let splitCost = FAR;\n      let bestAxis = 0, bestPos = 0;\n      for (let axis = 0; axis < 3; axis++) {\n        const extent = axis === 0 ? extentX : axis === 1 ? extentY : extentZ;\n        const minDim = axis === 0 ? minDimX : axis === 1 ? minDimY : minDimZ;\n        if (!(extent > minDim)) continue;\n        let lMinX = FAR, lMinY = FAR, lMinZ = FAR, lMaxX = -FAR, lMaxY = -FAR, lMaxZ = -FAR;\n        let rMinX = FAR, rMinY = FAR, rMinZ = FAR, rMaxX = -FAR, rMaxY = -FAR, rMaxZ = -FAR;\n        let leftN = 0, rightN = 0;\n        for (let i = 0; i < BINS - 1; i++) {\n          const l = (axis * BINS + i) * 3;\n          const r = (axis * BINS + BINS - 1 - i) * 3;\n          lMinX = Math.min(lMinX, binMin[l]); lMinY = Math.min(lMinY, binMin[l + 1]); lMinZ = Math.min(lMinZ, binMin[l + 2]);\n          lMaxX = Math.max(lMaxX, binMax[l]); lMaxY = Math.max(lMaxY, binMax[l + 1]); lMaxZ = Math.max(lMaxZ, binMax[l + 2]);\n          rMinX = Math.min(rMinX, binMin[r]); rMinY = Math.min(rMinY, binMin[r + 1]); rMinZ = Math.min(rMinZ, binMin[r + 2]);\n          rMaxX = Math.max(rMaxX, binMax[r]); rMaxY = Math.max(rMaxY, binMax[r + 1]); rMaxZ = Math.max(rMaxZ, binMax[r + 2]);\n          leftN += binCount[axis * BINS + i];\n          rightN += binCount[axis * BINS + BINS - 1 - i];\n          const lx = lMaxX - lMinX, ly = lMaxY - lMinY, lz = lMaxZ - lMinZ;\n          const rx = rMaxX - rMinX, ry = rMaxY - rMinY, rz = rMaxZ - rMinZ;\n          leftCost[i] = leftN === 0 ? FAR : (lx * ly + ly * lz + lz * lx) * leftN;\n          rightCost[BINS - 2 - i] = rightN === 0 ? FAR : (rx * ry + ry * rz + rz * rx) * rightN;\n        }\n        for (let i = 0; i < BINS - 1; i++) {\n          const cost = leftCost[i] + rightCost[i];\n          if (cost < splitCost) {\n            splitCost = cost;\n            bestAxis = axis;\n            bestPos = i;\n          }\n        }\n      }\n      splitCost = C_TRAV + C_INT * splitCost / area;\n      // Not splitting is better (also stops on non-finite bounds).\n      if (!(splitCost < nodePrims * C_INT)) break;\n\n      // In-place partition by the chosen bin.\n      const scale = bestAxis === 0 ? scaleX : bestAxis === 1 ? scaleY : scaleZ;\n      const nMin = bestAxis === 0 ? nMinX : bestAxis === 1 ? nMinY : nMinZ;\n      let j = first + nodePrims, src = first;\n      for (let i = 0; i < nodePrims; i++) {\n        const p = primIndices[src];\n        if (binOf(centers[p * 3 + bestAxis], nMin, scale) <= bestPos) {\n          src++;\n        } else {\n          primIndices[src] = primIndices[--j];\n          primIndices[j] = p;\n        }\n      }\n      const leftPrims = src - first;\n      const rightPrims = nodePrims - leftPrims;\n      if (leftPrims === 0 || rightPrims === 0) break; // should not happen.\n\n      const n = newNode;\n      newNode += 2;\n      // Child bounds are the unions of the bins on each side of the split.\n      const leftBase = n * 6, rightBase = leftBase + 6;\n      for (let k = 0; k < 3; k++) {\n        bounds[leftBase + k] = bounds[rightBase + k] = FAR;\n        bounds[leftBase + 3 + k] = bounds[rightBase + 3 + k] = -FAR;\n      }\n      for (let i = 0; i < BINS; i++) {\n        const o = (bestAxis * BINS + i) * 3;\n        const base = i <= bestPos ? leftBase : rightBase;\n        for (let k = 0; k < 3; k++) {\n          if (binMin[o + k] < bounds[base + k]) bounds[base + k] = binMin[o + k];\n          if (binMax[o + k] > bounds[base + 3 + k]) bounds[base + 3 + k] = binMax[o + k];\n        }\n      }\n      leftFirst[n] = first; primCount[n] = leftPrims;\n      leftFirst[n + 1] = j; primCount[n + 1] = rightPrims;\n      leftFirst[nodeIndex] = n; primCount[nodeIndex] = 0;\n      tasks.push(n + 1);\n      nodeIndex = n;\n    }\n    if (!tasks.length) break;\n    nodeIndex = tasks.pop()!;\n  }\n\n  return { nodeCount: newNode, bounds, leftFirst, primCount, primIndices };\n}\n\nexport interface Bvh2Layout {\n  /** Node indices in depth-first order (node, left subtree, right subtree). */\n  order: Uint32Array;\n  /** Offset of each node in vec4 units: 2 per node plus 1 per leaf primitive. */\n  offsets: Uint32Array;\n  vec4Count: number;\n  maxDepth: number;\n  maxLeafPrimitives: number;\n}\n\n/**\n * Places nodes in the depth-first BVH2 layout read by the traversal shaders:\n * the left child follows its parent and leaf primitives follow their leaf.\n */\nexport function layoutBvh2(bvh: BinnedSahBvh): Bvh2Layout {\n  const { nodeCount, leftFirst, primCount } = bvh;\n  const order = new Uint32Array(nodeCount);\n  const offsets = new Uint32Array(nodeCount);\n  let vec4Count = 0, maxDepth = 0, maxLeafPrimitives = 0;\n  if (!nodeCount) return { order, offsets, vec4Count, maxDepth, maxLeafPrimitives };\n  const stack: number[] = [0, 1];\n  let written = 0;\n  while (stack.length) {\n    const depth = stack.pop()!;\n    const node = stack.pop()!;\n    order[written++] = node;\n    offsets[node] = vec4Count;\n    if (depth > maxDepth) maxDepth = depth;\n    const prims = primCount[node];\n    vec4Count += 2 + prims;\n    if (prims) {\n      if (prims > maxLeafPrimitives) maxLeafPrimitives = prims;\n    } else {\n      stack.push(leftFirst[node] + 1, depth + 1, leftFirst[node], depth + 1);\n    }\n  }\n  return { order, offsets, vec4Count, maxDepth, maxLeafPrimitives };\n}\n"]}

package/lib/renderer/bvh.worker.d.ts

@@ -0,0 +1 @@
+export {};

package/lib/renderer/bvh.worker.js

@@ -0,0 +1,16 @@
+import { executeBvhBuild } from './bvhWorkerBuild.js';
+const scope = self;
+// Serialize builds to reuse TinyBVH's WASM instance and bound working memory.
+let queue = Promise.resolve();
+scope.onmessage = ({ data }) => {
+    queue = queue.then(async () => {
+        try {
+            const bvh = await executeBvhBuild(data);
+            scope.postMessage({ id: data.id, bvh }, [bvh.buffer]);
+        }
+        catch (error) {
+            scope.postMessage({ id: data.id, error: error instanceof Error ? error.message : String(error) });
+        }
+    });
+};
+//# sourceMappingURL=bvh.worker.js.map

package/lib/renderer/bvh.worker.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bvh.worker.js","sourceRoot":"","sources":["../../src/renderer/bvh.worker.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,MAAM,qBAAqB,CAAC;AAGtD,MAAM,KAAK,GAAG,IAGb,CAAC;AACF,8EAA8E;AAC9E,IAAI,KAAK,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC;AAC9B,KAAK,CAAC,SAAS,GAAG,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE;IAC7B,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE;QAC5B,IAAI,CAAC;YACH,MAAM,GAAG,GAAG,MAAM,eAAe,CAAC,IAAI,CAAC,CAAC;YACxC,KAAK,CAAC,WAAW,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;QACxD,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,KAAK,CAAC,WAAW,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,KAAK,EAAE,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QACpG,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC","sourcesContent":["import { executeBvhBuild } from './bvhWorkerBuild.js';\nimport type { BvhBuildRequest, BvhBuildResponse } from './bvhWorkerClient.js';\n\nconst scope = self as unknown as {\n  onmessage: (event: MessageEvent<BvhBuildRequest>) => void;\n  postMessage: (response: BvhBuildResponse, transfers?: Transferable[]) => void;\n};\n// Serialize builds to reuse TinyBVH's WASM instance and bound working memory.\nlet queue = Promise.resolve();\nscope.onmessage = ({ data }) => {\n  queue = queue.then(async () => {\n    try {\n      const bvh = await executeBvhBuild(data);\n      scope.postMessage({ id: data.id, bvh }, [bvh.buffer]);\n    } catch (error) {\n      scope.postMessage({ id: data.id, error: error instanceof Error ? error.message : String(error) });\n    }\n  });\n};\n"]}

package/lib/renderer/bvhAccel.d.ts

@@ -0,0 +1,81 @@
+import { type MeshInstances } from './meshInstances.js';
+import Geometry from '../scene/Geometry.js';
+import { vec3 } from '../math.js';
+import { Mat4Array } from '../math.js';
+export declare const INSTANCE_VEC4_STRIDE = 10;
+export declare const INSTANCE_WORD_STRIDE: number;
+export type BvhLayout = 'bvh2' | 'bvh4' | 'bvh-gpu' | 'cwbvh';
+export interface FlattendBVH {
+    /** CPU builder that produced the GPU traversal data. */
+    builder?: 'builtin' | 'tinybvh';
+    buildSurfaceArea?: number;
+    maxDepth: number;
+    /** Largest leaf fan-out; used with maxDepth to size the traversal stack. */
+    maxLeafPrimitives?: number;
+    buffer: ArrayBuffer;
+    /** Precomputed data without a layout field uses the legacy BVH2 layout. */
+    layout?: BvhLayout;
+    instancesBuffer?: ArrayBuffer;
+}
+export declare class Box3 {
+    min: vec3.Vec3Array;
+    max: vec3.Vec3Array;
+    constructor();
+}
+export interface TLASInstance {
+    blasIndex: number;
+    bounds: Box3;
+    transform: Mat4Array;
+    materialsIndices: number[];
+    displacementScale?: number;
+    color?: [number, number, number];
+}
+export interface BLASInstance {
+    bvh: FlattendBVH;
+    trainglesCount: number;
+    verticesCount: number;
+}
+export declare const MAX_TRAVERSAL_STACK_SIZE = 64;
+export interface TraversalStackSizes {
+    tlas: number;
+    blas: number;
+}
+/**
+ * Sizes independent TLAS and BLAS stacks for the nested WebGPU traversal.
+ * A TLAS leaf is consumed in place, so its instance fan-out no longer needs
+ * pending stack entries. TinyBVH converted layouts store their exact stack
+ * requirement in maxDepth; BVH2 stores its tree depth.
+ */
+export declare function getTraversalStackSizes(tlas: FlattendBVH, blases: readonly BLASInstance[]): TraversalStackSizes;
+export declare function concatBLASBuffers(blases: BLASInstance[]): ArrayBuffer;
+/** BLAS without triangles. */
+export declare function emptyBLAS(): FlattendBVH;
+/**
+ * Builds a BVH2 BLAS over the geometry's triangles. Triangles with
+ * non-finite bounds are skipped. With per-triangle displacement ranges
+ * (min, max pairs scaled by displacementScale), leaves bound the
+ * displacement prisms along the vertex normals and store the packed ranges.
+ */
+export declare function buildBLAS(geometry: Pick<Geometry, 'position' | 'indices' | 'normal'>, displacementScale?: number, trianglesDisplacement?: Float32Array): FlattendBVH;
+/**
+ * Builds a BVH2 TLAS over the instances. Leaves store
+ * (instance record, BLAS offset, source instance index, 0); instance records
+ * are written in leaf order to instancesBuffer.
+ */
+export declare function buildTLAS(instances: MeshInstances, blases: BLASInstance[]): FlattendBVH;
+export interface TLASRefitRange {
+    offset: number;
+    size: number;
+}
+export interface TLASRefitResult {
+    tlasRanges: TLASRefitRange[];
+    instanceRanges: TLASRefitRange[];
+}
+export declare function mergeRefitRanges(ranges: TLASRefitRange[]): TLASRefitRange[];
+export declare function refitTLAS(flattened: FlattendBVH, instances: MeshInstances, blases: BLASInstance[], dirtySourceIndices?: ReadonlySet<number>): TLASRefitResult;
+/** Dynamic BLASes rebuild when their total node surface area doubles. */
+export declare const DYNAMIC_BLAS_REBUILD_RATIO = 2;
+/** Refit a BVH2 BLAS after vertex deformation, preserving topology. */
+export declare function refitBLAS(flattened: FlattendBVH, geometry: Pick<Geometry, 'position'> & Partial<Pick<Geometry, 'dynamic'>>): boolean;
+/** Writes only instance colors; TLAS topology and bounds remain untouched. */
+export declare function updateTLASInstanceColors(flattened: FlattendBVH, instances: MeshInstances, dirty: ReadonlySet<number>): TLASRefitRange[];