@woosh/meep-engine 3.2.0 → 3.4.0

package/src/engine/graphics/render/forward_plus/query/analytical_triplanar_corner_mapping.js

@@ -1,8 +0,0 @@
-/**
- *
- * @param {number} field
- * @returns {number}
- */
-export function analytical_triplanar_corner_mapping(field) {
-    return ((field << 1) & 0b100) | ((field >> 2) & 0b10) | ((field >> 5) & 0b1);
-}

package/src/engine/graphics/render/forward_plus/query/cube_mapping.d.ts

@@ -1,11 +0,0 @@
-/**
- * Mapping from 3 plane bitfield, corresponding to intersection point of the planes
- * @type {number[]}
- */
-export const triplanar_corner_mapping: number[];
-/**
- * Mapping from 2 plane bitfield to 2 corner bitfield, corresponding to corner indices of intersecting planes
- * @type {number[]}
- */
-export const biplanar_edge_mapping: number[];
-//# sourceMappingURL=cube_mapping.d.ts.map

package/src/engine/graphics/render/forward_plus/query/cube_mapping.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"cube_mapping.d.ts","sourceRoot":"","sources":["../../../../../../../src/engine/graphics/render/forward_plus/query/cube_mapping.js"],"names":[],"mappings":"AACA;;;GAGG;AACH,uCAFU,MAAM,EAAE,CAE+D;AAUjF;;;GAGG;AACH,oCAFU,MAAM,EAAE,CAE6D"}

package/src/engine/graphics/render/forward_plus/query/cube_mapping.js

@@ -1,38 +0,0 @@
-const _lut_array_buffer = new ArrayBuffer(84);
-/**
- * Mapping from 3 plane bitfield, corresponding to intersection point of the planes
- * @type {number[]}
- */
-export const triplanar_corner_mapping = new Uint8Array(_lut_array_buffer, 0, 43);
-
-triplanar_corner_mapping[0b010101] = 0;
-triplanar_corner_mapping[0b100101] = 1;
-triplanar_corner_mapping[0b011001] = 2;
-triplanar_corner_mapping[0b101001] = 3;
-triplanar_corner_mapping[0b010110] = 4;
-triplanar_corner_mapping[0b100110] = 5;
-triplanar_corner_mapping[0b011010] = 6;
-triplanar_corner_mapping[0b101010] = 7;
-/**
- * Mapping from 2 plane bitfield to 2 corner bitfield, corresponding to corner indices of intersecting planes
- * @type {number[]}
- */
-export const biplanar_edge_mapping = new Uint8Array(_lut_array_buffer, 43, 41);
-
-biplanar_edge_mapping[0b000101] = 0 | (1 << 3);
-biplanar_edge_mapping[0b000110] = 4 | (5 << 3);
-
-biplanar_edge_mapping[0b001001] = 2 | (3 << 3);
-biplanar_edge_mapping[0b001010] = 6 | (7 << 3);
-
-biplanar_edge_mapping[0b010100] = 0 | (4 << 3);
-biplanar_edge_mapping[0b011000] = 2 | (6 << 3);
-
-biplanar_edge_mapping[0b100100] = 1 | (5 << 3);
-biplanar_edge_mapping[0b101000] = 3 | (7 << 3);
-
-biplanar_edge_mapping[0b010001] = 0 | (2 << 3);
-biplanar_edge_mapping[0b010010] = 4 | (6 << 3);
-
-biplanar_edge_mapping[0b100001] = 1 | (3 << 3);
-biplanar_edge_mapping[0b100010] = 5 | (7 << 3);

package/src/engine/graphics/render/forward_plus/query/detailed_sphere_frustum_intersection_test.d.ts

@@ -1,21 +0,0 @@
-/**
- * Refines a sphere-vs-cell test by measuring the distance to the nearest CORNER (3 planes
- * violated) or EDGE (2 planes violated) implied by `outside_plane_bitfield`.
- *
- * WARNING: this nearest-feature reasoning is only valid for AXIS-ALIGNED boxes. For an oblique
- * cell (e.g. a perspective froxel) the assumed corner/edge can be farther than the cell's true
- * nearest point, so this may report "no intersection" for a sphere that actually reaches the
- * cell. Do NOT use it to cull lights against froxels — use the conservative plane-only test in
- * {@link point_light_inside_volume}. Retained as library surface for axis-aligned callers.
- *
- * @param {number} radius
- * @param {number} light_x
- * @param {number} light_y
- * @param {number} light_z
- * @param {number} outside_plane_count
- * @param {number} outside_plane_bitfield
- * @param {number[]} points
- * @return {boolean}
- */
-export function detailed_sphere_frustum_intersection_test(radius: number, light_x: number, light_y: number, light_z: number, outside_plane_count: number, outside_plane_bitfield: number, points: number[]): boolean;
-//# sourceMappingURL=detailed_sphere_frustum_intersection_test.d.ts.map

package/src/engine/graphics/render/forward_plus/query/detailed_sphere_frustum_intersection_test.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"detailed_sphere_frustum_intersection_test.d.ts","sourceRoot":"","sources":["../../../../../../../src/engine/graphics/render/forward_plus/query/detailed_sphere_frustum_intersection_test.js"],"names":[],"mappings":"AAMA;;;;;;;;;;;;;;;;;;GAkBG;AACH,kEATW,MAAM,WACN,MAAM,WACN,MAAM,WACN,MAAM,uBACN,MAAM,0BACN,MAAM,UACN,MAAM,EAAE,GACP,OAAO,CAwElB"}

package/src/engine/graphics/render/forward_plus/query/detailed_sphere_frustum_intersection_test.js

@@ -1,96 +0,0 @@
-import {
-    line3_compute_segment_point_distance_sqr
-} from "../../../../../core/geom/3d/line/line3_compute_segment_point_distance_sqr.js";
-import { v3_distance_sqr } from "../../../../../core/geom/vec3/v3_distance_sqr.js";
-import { biplanar_edge_mapping, triplanar_corner_mapping } from "./cube_mapping.js";
-
-/**
- * Refines a sphere-vs-cell test by measuring the distance to the nearest CORNER (3 planes
- * violated) or EDGE (2 planes violated) implied by `outside_plane_bitfield`.
- *
- * WARNING: this nearest-feature reasoning is only valid for AXIS-ALIGNED boxes. For an oblique
- * cell (e.g. a perspective froxel) the assumed corner/edge can be farther than the cell's true
- * nearest point, so this may report "no intersection" for a sphere that actually reaches the
- * cell. Do NOT use it to cull lights against froxels — use the conservative plane-only test in
- * {@link point_light_inside_volume}. Retained as library surface for axis-aligned callers.
- *
- * @param {number} radius
- * @param {number} light_x
- * @param {number} light_y
- * @param {number} light_z
- * @param {number} outside_plane_count
- * @param {number} outside_plane_bitfield
- * @param {number[]} points
- * @return {boolean}
- */
-export function detailed_sphere_frustum_intersection_test(
-    radius, light_x, light_y, light_z,
-    outside_plane_count, outside_plane_bitfield,
-    points
-) {
-
-    const radius_sqr = radius * radius;
-
-    if (outside_plane_count === 3) {
-        // nearest point in a corner, find the corner
-        const point_index = triplanar_corner_mapping[outside_plane_bitfield];
-
-        const point_address = point_index * 3;
-
-        const point_x = points[point_address];
-        const point_y = points[point_address + 1];
-        const point_z = points[point_address + 2];
-
-        const distance_to_light_sqr = v3_distance_sqr(
-            point_x, point_y, point_z,
-            light_x, light_y, light_z
-        );
-
-        // query_bvh_frustum_from_objects.checks_sphere_frustum_corner++;
-
-        // return distance_to_light_sqr <= radius_sqr;
-
-        if (distance_to_light_sqr > radius_sqr) {
-
-            // query_bvh_frustum_from_objects.rejection_sphere_count++;
-            return false;
-        }
-
-    } else if (outside_plane_count === 2) {
-        // nearest point is on an edge of two plane intersection
-        const edge_bitfield = biplanar_edge_mapping[outside_plane_bitfield];
-
-        // get 2 corners from edge bitfield
-        const corner_index_0 = edge_bitfield & 0b111;
-        const corner_address_0 = corner_index_0 * 3;
-
-        const corner_index_1 = (edge_bitfield >> 3) & 0b111;
-        const corner_address_1 = corner_index_1 * 3;
-
-        const point_0_x = points[corner_address_0];
-        const point_0_y = points[corner_address_0 + 1];
-        const point_0_z = points[corner_address_0 + 2];
-
-        const point_1_x = points[corner_address_1];
-        const point_1_y = points[corner_address_1 + 1];
-        const point_1_z = points[corner_address_1 + 2];
-
-        const distance_to_frustum_sqr = line3_compute_segment_point_distance_sqr(
-            point_0_x, point_0_y, point_0_z,
-            point_1_x, point_1_y, point_1_z,
-            light_x, light_y, light_z
-        );
-
-        // query_bvh_frustum_from_objects.checks_sphere_frustum_edge++;
-
-        // return distance_to_frustum_sqr <= radius_sqr;
-
-        if (distance_to_frustum_sqr > radius_sqr) {
-
-            // query_bvh_frustum_from_objects.rejection_sphere_count++;
-            return false;
-        }
-    }
-
-    return true;
-}

package/src/engine/graphics/render/forward_plus/query/point_light_inside_volume.d.ts

@@ -1,22 +0,0 @@
-/**
- * Conservative sphere-vs-convex-cell test: the sphere is considered to intersect the cell
- * unless it lies entirely beyond one of the six bounding planes.
- *
- * NOTE: a previous version refined the "near a corner/edge" cases by measuring the distance
- * to the cell's nearest corner/edge (an Arvo-style nearest-feature test). That refinement is
- * only correct for AXIS-ALIGNED boxes. Froxels are oblique hexahedra, and there the assumed
- * nearest feature can be farther than the cell's true nearest point, so the test rejected
- * spheres that actually reach into the cell. Those false rejections culled real lights from
- * peripheral / far froxels and showed up as hard-edged "blocky" lighting. The plane-only test
- * never under-includes; the only cost is mild over-inclusion near corners, which is harmless
- * because out-of-range lights attenuate to zero in the shader.
- *
- * @param {number} light_x
- * @param {number} light_y
- * @param {number} light_z
- * @param {number} radius
- * @param {number[]|Float32Array|Float64Array} planes
- * @returns {boolean}
- */
-export function point_light_inside_volume(light_x: number, light_y: number, light_z: number, radius: number, planes: number[] | Float32Array | Float64Array): boolean;
-//# sourceMappingURL=point_light_inside_volume.d.ts.map

package/src/engine/graphics/render/forward_plus/query/point_light_inside_volume.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"point_light_inside_volume.d.ts","sourceRoot":"","sources":["../../../../../../../src/engine/graphics/render/forward_plus/query/point_light_inside_volume.js"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AACH,mDAPW,MAAM,WACN,MAAM,WACN,MAAM,UACN,MAAM,UACN,MAAM,EAAE,GAAC,YAAY,GAAC,YAAY,GAChC,OAAO,CAyBnB"}

package/src/engine/graphics/render/forward_plus/query/point_light_inside_volume.js

@@ -1,44 +0,0 @@
-/**
- * Conservative sphere-vs-convex-cell test: the sphere is considered to intersect the cell
- * unless it lies entirely beyond one of the six bounding planes.
- *
- * NOTE: a previous version refined the "near a corner/edge" cases by measuring the distance
- * to the cell's nearest corner/edge (an Arvo-style nearest-feature test). That refinement is
- * only correct for AXIS-ALIGNED boxes. Froxels are oblique hexahedra, and there the assumed
- * nearest feature can be farther than the cell's true nearest point, so the test rejected
- * spheres that actually reach into the cell. Those false rejections culled real lights from
- * peripheral / far froxels and showed up as hard-edged "blocky" lighting. The plane-only test
- * never under-includes; the only cost is mild over-inclusion near corners, which is harmless
- * because out-of-range lights attenuate to zero in the shader.
- *
- * @param {number} light_x
- * @param {number} light_y
- * @param {number} light_z
- * @param {number} radius
- * @param {number[]|Float32Array|Float64Array} planes
- * @returns {boolean}
- */
-export function point_light_inside_volume(
-    light_x, light_y, light_z, radius,
-    planes
-) {
-    for (let j = 0; j < 6; j++) {
-
-        const plane_address = j * 4;
-
-        const plane_normal_x = planes[plane_address];
-        const plane_normal_y = planes[plane_address + 1];
-        const plane_normal_z = planes[plane_address + 2];
-        const plane_constant = planes[plane_address + 3];
-
-        // signed distance from the sphere centre to the plane (inlined point-to-plane)
-        const distance = (plane_normal_x * light_x + plane_normal_y * light_y + plane_normal_z * light_z) + plane_constant;
-
-        if (distance < -radius) {
-            // sphere is entirely beyond this plane -> cannot intersect the cell
-            return false;
-        }
-    }
-
-    return true;
-}

package/src/engine/graphics/render/forward_plus/query/query_bvh_frustum_from_texture.d.ts

@@ -1,11 +0,0 @@
-/**
- * Most of the data is in flat continuous array for cache coherence
- * @param {number[]} destination
- * @param {number} destination_offset
- * @param {BinaryUint32BVH} bvh
- * @param {number[]|Uint8ClampedArray} source_data
- * @param {number[]|Float32Array|Float64Array} planes
- * @returns {number} number of items added to the destination, non-negative integer
- */
-export function query_bvh_frustum_from_texture(destination: number[], destination_offset: number, bvh: BinaryUint32BVH, source_data: number[] | Uint8ClampedArray, planes: number[] | Float32Array | Float64Array): number;
-//# sourceMappingURL=query_bvh_frustum_from_texture.d.ts.map

package/src/engine/graphics/render/forward_plus/query/query_bvh_frustum_from_texture.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"query_bvh_frustum_from_texture.d.ts","sourceRoot":"","sources":["../../../../../../../src/engine/graphics/render/forward_plus/query/query_bvh_frustum_from_texture.js"],"names":[],"mappings":"AAoDA;;;;;;;;GAQG;AACH,4DAPW,MAAM,EAAE,sBACR,MAAM,qCAEN,MAAM,EAAE,GAAC,iBAAiB,UAC1B,MAAM,EAAE,GAAC,YAAY,GAAC,YAAY,GAChC,MAAM,CA6GlB"}

package/src/engine/graphics/render/forward_plus/query/query_bvh_frustum_from_texture.js

@@ -1,169 +0,0 @@
-import { BVH_BINARY_NODE_SIZE, BVH_LEAF_NODE_SIZE } from "../../../../../core/bvh2/binary/2/BinaryUint32BVH.js";
-import { SCRATCH_UINT32_TRAVERSAL_STACK } from "../../../../../core/collection/SCRATCH_UINT32_TRAVERSAL_STACK.js";
-import {
-    aabb3_compute_distance_above_plane_max
-} from "../../../../../core/geom/3d/aabb/aabb3_compute_distance_above_plane_max.js";
-import { point_light_inside_volume } from "./point_light_inside_volume.js";
-
-const stack = SCRATCH_UINT32_TRAVERSAL_STACK;
-
-/**
- *
- * @param {Float32Array} data
- * @param {number} address
- * @param {ArrayLike<number>|number[]} planes
- * @return {boolean}
- */
-function frustum_check(data, address, planes) {
-    const n_x0 = data[address];
-    const n_y0 = data[address + 1];
-    const n_z0 = data[address + 2];
-
-    const n_x1 = data[address + 3];
-    const n_y1 = data[address + 4];
-    const n_z1 = data[address + 5];
-
-    for (let plane_address = 0; plane_address < 24; plane_address += 4) {
-
-        const plane_normal_x = planes[plane_address];
-        const plane_normal_y = planes[plane_address + 1];
-        const plane_normal_z = planes[plane_address + 2];
-        const plane_constant = planes[plane_address + 3];
-
-        const distanceAbovePlane = aabb3_compute_distance_above_plane_max(
-            plane_normal_x, plane_normal_y, plane_normal_z, plane_constant,
-            n_x0, n_y0, n_z0,
-            n_x1, n_y1, n_z1
-        );
-
-        if (distanceAbovePlane <= 0) {
-            // node is below the plane
-
-            // query_bvh_frustum_from_objects.rejection_count++;
-
-            return false;
-        }
-
-        // TODO under current scheme we can reserve 6 bit in what we push onto the stack for plane mask (allows us to skip some planar tests)
-    }
-
-    return true;
-}
-
-/**
- * Most of the data is in flat continuous array for cache coherence
- * @param {number[]} destination
- * @param {number} destination_offset
- * @param {BinaryUint32BVH} bvh
- * @param {number[]|Uint8ClampedArray} source_data
- * @param {number[]|Float32Array|Float64Array} planes
- * @returns {number} number of items added to the destination, non-negative integer
- */
-export function query_bvh_frustum_from_texture(
-    destination,
-    destination_offset,
-    bvh,
-    source_data,
-    planes
-) {
-    let result = 0;
-
-    const binary_node_count = bvh.binary_node_count;
-
-    if (binary_node_count <= 0) {
-        // this should not happen
-        return 0;
-    }
-
-    /**
-     *
-     * @type {number}
-     */
-    const stack_top = stack.pointer++;
-
-    /**
-     * After performing empirical tests, stack-based depth-first traversal turns out faster than using a queue
-     * @type {number}
-     */
-    stack[stack_top] = 0;
-
-    const last_valid_index = binary_node_count + bvh.leaf_node_count;
-
-    const float32 = bvh.float32;
-    const uint32 = bvh.uint32;
-
-    do {
-        stack.pointer--;
-
-        // query_bvh_frustum_from_objects.iteration_count++;
-        const node_index = stack[stack.pointer];
-
-        if (node_index < binary_node_count) {
-            // is intermediate node
-            const node_address = node_index * BVH_BINARY_NODE_SIZE;
-
-            if (!frustum_check(float32, node_address, planes)) {
-                continue;
-            }
-
-            const left_index = (node_index << 1) + 1;
-            const right_index = left_index + 1;
-
-            // left node ends up on top of the stack, which aligns with the desired access sequence
-            if (right_index < last_valid_index) {
-                stack[stack.pointer++] = right_index;
-                // micro-optimization, since we know that right node is valid and left appears before that, left is valid too
-                stack[stack.pointer++] = left_index;
-            } else if (left_index < last_valid_index) {
-                stack[stack.pointer++] = left_index;
-            }
-
-
-        } else {
-            // leaf node
-            const leaf_index = node_index - binary_node_count;
-
-            const node_address = leaf_index * BVH_LEAF_NODE_SIZE + binary_node_count * BVH_BINARY_NODE_SIZE;
-
-            const light_descriptor = uint32[node_address + 6];
-
-            const light_type = light_descriptor & 3;
-
-            // mask out type bits
-            const light_address = light_descriptor & 0xFFFFFFF8;
-
-            if (light_type === 0) {
-                // Point light
-
-                const light_x = source_data[light_address];
-                const light_y = source_data[light_address + 1];
-                const light_z = source_data[light_address + 2];
-
-                const radius = source_data[light_address + 3];
-
-                if (!point_light_inside_volume(light_x, light_y, light_z, radius, planes)) {
-                    // cull
-                    continue;
-                }
-
-            } else if (light_type === 3) {
-                // decal
-
-                if (!frustum_check(float32, node_address, planes)) {
-                    continue;
-                }
-
-            } else {
-                throw new Error(`Unsupported light type ${light_type}`);
-            }
-
-            // write to output
-            destination[destination_offset + result] = light_descriptor;
-
-            result++;
-        }
-
-    } while (stack.pointer > stack_top)
-
-    return result;
-}

package/src/engine/graphics/render/forward_plus/query/spot_light_inside_volume.d.ts

@@ -1,9 +0,0 @@
-/**
- *
- * @param {SpotLight} light
- * @param {number[]} points
- * @param {number[]|Float32Array|Float64Array} planes
- * @returns {boolean}
- */
-export function spot_light_inside_volume(light: SpotLight, points: number[], planes: number[] | Float32Array | Float64Array): boolean;
-//# sourceMappingURL=spot_light_inside_volume.d.ts.map

package/src/engine/graphics/render/forward_plus/query/spot_light_inside_volume.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"spot_light_inside_volume.d.ts","sourceRoot":"","sources":["../../../../../../../src/engine/graphics/render/forward_plus/query/spot_light_inside_volume.js"],"names":[],"mappings":"AAEA;;;;;;GAMG;AACH,mEAJW,MAAM,EAAE,UACR,MAAM,EAAE,GAAC,YAAY,GAAC,YAAY,GAChC,OAAO,CAyBnB"}

package/src/engine/graphics/render/forward_plus/query/spot_light_inside_volume.js

@@ -1,33 +0,0 @@
-import { cone_compute_plane_side } from "../../../../../core/geom/3d/cone/cone_compute_plane_side.js";
-
-/**
- *
- * @param {SpotLight} light
- * @param {number[]} points
- * @param {number[]|Float32Array|Float64Array} planes
- * @returns {boolean}
- */
-export function spot_light_inside_volume(light, points, planes) {
-    for (let j = 0; j < 6; j++) {
-
-        const plane_address = j * 4;
-
-        const plane_normal_x = planes[plane_address];
-        const plane_normal_y = planes[plane_address + 1];
-        const plane_normal_z = planes[plane_address + 2];
-        const plane_constant = planes[plane_address + 3];
-
-        const side = cone_compute_plane_side(
-            plane_normal_x, plane_normal_y, plane_normal_z, plane_constant,
-            light.position.x, light.position.y, light.position.z,
-            light.direction.x, light.direction.y, light.direction.z,
-            light.angle.getValue(), light.distance.getValue()
-        );
-
-        if (side < 0) {
-            return false;
-        }
-    }
-
-    return true;
-}

package/src/engine/graphics/render/forward_plus/read_frustum_corner.d.ts

@@ -1,2 +0,0 @@
-export { read_frustum_corner } from "../../../../core/geom/3d/frustum/read_frustum_corner.js";
-//# sourceMappingURL=read_frustum_corner.d.ts.map

package/src/engine/graphics/render/forward_plus/read_frustum_corner.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"read_frustum_corner.d.ts","sourceRoot":"","sources":["../../../../../../src/engine/graphics/render/forward_plus/read_frustum_corner.js"],"names":[],"mappings":""}

package/src/engine/graphics/render/forward_plus/read_frustum_corner.js

@@ -1,2 +0,0 @@
-// Re-export for path compatibility; implementation lives in core/geom/3d/frustum/read_frustum_corner.js
-export { read_frustum_corner } from "../../../../core/geom/3d/frustum/read_frustum_corner.js";

package/src/engine/graphics/render/forward_plus/sort_decal_data.d.ts

@@ -1,9 +0,0 @@
-/**
- * Decals need to be drawn in a specific order to achieve correct blending, for this they need to be sorted
- * @param {number[]|Uint8ClampedArray|Uint8Array|Uint32Array} lookup
- * @param {number[]|Float32Array} data
- * @param {number} offset
- * @param {number} count
- */
-export function sort_decal_data(lookup: number[] | Uint8ClampedArray | Uint8Array | Uint32Array, data: number[] | Float32Array, offset: number, count: number): void;
-//# sourceMappingURL=sort_decal_data.d.ts.map

package/src/engine/graphics/render/forward_plus/sort_decal_data.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"sort_decal_data.d.ts","sourceRoot":"","sources":["../../../../../../src/engine/graphics/render/forward_plus/sort_decal_data.js"],"names":[],"mappings":"AAuCA;;;;;;GAMG;AACH,wCALW,MAAM,EAAE,GAAC,iBAAiB,GAAC,UAAU,GAAC,WAAW,QACjD,MAAM,EAAE,GAAC,YAAY,UACrB,MAAM,SACN,MAAM,QAyDhB"}

package/src/engine/graphics/render/forward_plus/sort_decal_data.js

@@ -1,102 +0,0 @@
-const _scratch_array = [];
-
-/**
- *
- * @param {number} a
- * @param {number} b
- * @param {number[]} lookup
- * @param {number[]} data
- * @returns {number}
- */
-function compare_decals(a, b, lookup, data) {
-    if (a === b) {
-        return 0;
-    }
-
-    const a_encoded = lookup[a];
-    const b_encoded = lookup[b];
-
-    // mask out bottom 2 type bits
-    const a_address = a_encoded & 0xFFFFFFF8;
-    const b_address = b_encoded & 0xFFFFFFF8;
-
-    const a_priority = data[a_address + 20];
-    const b_priority = data[b_address + 20];
-
-    let diff = b_priority - a_priority;
-
-    if (diff !== 0) {
-        return diff;
-    }
-
-
-    const a_id = data[a_address + 21];
-    const b_id = data[b_address + 21];
-
-    // data order is explicit and stable, we use that as a secondary comparison criteria
-    return b_id - a_id;
-}
-
-/**
- * Decals need to be drawn in a specific order to achieve correct blending, for this they need to be sorted
- * @param {number[]|Uint8ClampedArray|Uint8Array|Uint32Array} lookup
- * @param {number[]|Float32Array} data
- * @param {number} offset
- * @param {number} count
- */
-export function sort_decal_data(lookup, data, offset, count) {
-    const stack = _scratch_array;
-
-    stack[0] = offset;
-    stack[1] = offset + count - 1;
-
-    let stackPointer = 2;
-    let i, j;
-
-    while (stackPointer > 0) {
-        stackPointer -= 2;
-
-        const right = stack[stackPointer + 1];
-        const left = stack[stackPointer];
-
-        i = left;
-        j = right;
-
-        const pivotIndex = (left + right) >> 1;
-
-        /* partition */
-        while (i <= j) {
-
-            while (compare_decals(i, pivotIndex, lookup, data) > 0) {
-                i++;
-            }
-
-            while (compare_decals(j, pivotIndex, lookup, data) < 0) {
-                j--;
-            }
-
-            if (i <= j) {
-
-                if (i !== j) {
-                    //do swap
-                    const swap = lookup[i];
-                    lookup[i] = lookup[j]
-                    lookup[j] = swap;
-                }
-
-                i++;
-                j--;
-            }
-        }
-
-        /* recursion */
-        if (left < j) {
-            stack[stackPointer++] = left;
-            stack[stackPointer++] = j;
-        }
-        if (i < right) {
-            stack[stackPointer++] = i;
-            stack[stackPointer++] = right;
-        }
-    }
-}

package/src/engine/graphics/render/forward_plus/testClusterEquality.d.ts

@@ -1,10 +0,0 @@
-/**
- *
- * @param {number[]} light_data
- * @param {number} count
- * @param {number[]|Uint32Array|Uint16Array|Uint8Array|Uint8ClampedArray} light_lookup_texture_data
- * @param {number} address
- * @returns {boolean}
- */
-export function testClusterEquality(light_data: number[], count: number, light_lookup_texture_data: number[] | Uint32Array | Uint16Array | Uint8Array | Uint8ClampedArray, address: number): boolean;
-//# sourceMappingURL=testClusterEquality.d.ts.map

package/src/engine/graphics/render/forward_plus/testClusterEquality.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"testClusterEquality.d.ts","sourceRoot":"","sources":["../../../../../../src/engine/graphics/render/forward_plus/testClusterEquality.js"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,gDANW,MAAM,EAAE,SACR,MAAM,6BACN,MAAM,EAAE,GAAC,WAAW,GAAC,WAAW,GAAC,UAAU,GAAC,iBAAiB,WAC7D,MAAM,GACJ,OAAO,CAenB"}

package/src/engine/graphics/render/forward_plus/testClusterEquality.js

@@ -1,22 +0,0 @@
-/**
- *
- * @param {number[]} light_data
- * @param {number} count
- * @param {number[]|Uint32Array|Uint16Array|Uint8Array|Uint8ClampedArray} light_lookup_texture_data
- * @param {number} address
- * @returns {boolean}
- */
-export function testClusterEquality(light_data, count, light_lookup_texture_data, address) {
-    for (let i = 0; i < count; i++) {
-
-        const existing_light_address = light_lookup_texture_data[address + i];
-
-        const datum = light_data[i];
-
-        if (datum !== existing_light_address) {
-            return false;
-        }
-    }
-
-    return true;
-}