@woosh/meep-engine 2.33.23 → 2.33.27

package/core/bvh2/binary/IndexedBinaryBVH.js

@@ -6,8 +6,13 @@ import { min2 } from "../../math/min2.js";
 import { IndexedBinaryBVHVisitor } from "./IndexedBinaryBVHVisitor.js";
 import { NodeType } from "./NodeType.js";
 import { RayLeafIntersectionVisitor } from "./RayLeafIntersectionVisitor.js";
+import { array_copy } from "../../collection/array/copyArray.js";
 
 
+/**
+ *
+ * @type {Float32Array|number[]}
+ */
 const scratch_aabb_0 = new Float32Array(6);
 
 
@@ -30,16 +35,16 @@ export default class IndexedBinaryBVH {
         this.binaryNodeCount = 0;
 
         /**
-         *
+         * Total number of boxes contained in the tree, some might be unused
          * @type {number}
          */
         this.boxCount = 0;
 
         /**
          *
-         * @type {null|Float32Array}
+         * @type {Float32Array|number[]}
          */
-        this.data = null;
+        this.data = new Float32Array(16);
     }
 
     /**
@@ -59,7 +64,14 @@ export default class IndexedBinaryBVH {
 
         this.boxCount = this.leafNodeCount + this.binaryNodeCount;
 
-        this.data = new Float32Array(this.boxCount * 6);
+        // possibly resize the storage
+        const storage_size = this.boxCount * 6;
+
+        if (this.data.length < storage_size) {
+            this.data = new Float32Array(storage_size);
+        } else {
+            this.data.fill(0);
+        }
     }
 
     unsortedBuiltIntermediate() {
@@ -117,7 +129,7 @@ export default class IndexedBinaryBVH {
         }
 
         //set bounds of the bvh
-        copy_box_array(0, data, scratch_aabb_0, 0);
+        array_copy(data, 0, scratch_aabb_0, 0, 6);
 
         this.x0 = scratch_aabb_0[0];
         this.y0 = scratch_aabb_0[1];
@@ -238,7 +250,7 @@ export default class IndexedBinaryBVH {
     }
 
     /**
-     *
+     * @deprecated use a visitor object instead
      * @param {number} startX
      * @param {number} startY
      * @param {number} startZ
@@ -265,22 +277,6 @@ export default class IndexedBinaryBVH {
     }
 }
 
-/**
- *
- * @param {number} source_offset
- * @param {number[]|Float32Array} source
- * @param {number[]|Float32Array} destination
- * @param {number} destination_offset
- */
-function copy_box_array(source_offset, source, destination, destination_offset) {
-    destination[destination_offset] = source[source_offset];
-    destination[destination_offset + 1] = source[source_offset + 1];
-    destination[destination_offset + 2] = source[source_offset + 2];
-    destination[destination_offset + 3] = source[source_offset + 3];
-    destination[destination_offset + 4] = source[source_offset + 4];
-    destination[destination_offset + 5] = source[source_offset + 5];
-}
-
 /**
  *
  * @param {number[]|Float32Array} source
@@ -348,23 +344,23 @@ function writeBox(array, address, x0, y0, z0, x1, y1, z1) {
  * @param {Float32Array} array
  */
 function copyBox(from, to, array) {
-    copy_box_array(from, array, array, to);
+    array_copy(array, from, array, to, 6);
 }
 
 /**
  *
  * @param {number} from
  * @param {number} to
- * @param {Float32Array} array
+ * @param {Float32Array|number[]} array
  */
 function copyBoxZeroSize(from, to, array) {
-    copy_box_array(from, array, scratch_aabb_0, 0);
+    array_copy(array, from, scratch_aabb_0, 0, 3);
 
     scratch_aabb_0[3] = scratch_aabb_0[0];
     scratch_aabb_0[4] = scratch_aabb_0[1];
     scratch_aabb_0[5] = scratch_aabb_0[2];
 
-    copy_box_array(0, scratch_aabb_0, array, to);
+    array_copy(scratch_aabb_0, 0, array, to, 6);
 }
 
 /**

package/core/bvh2/traversal/ThreeClippingPlaneComputingBVHVisitor.js

@@ -40,7 +40,11 @@ export class ThreeClippingPlaneComputingBVHVisitor extends BVHVisitor {
          */
         this.__nearPlaneConstant = 0;
 
-
+        /**
+         *
+         * @type {Float32Array}
+         * @private
+         */
         this.__planes_f32 = new Float32Array(24);
 
         this.near = 0;

package/core/bvh2/traversal/__detailed_box_volume_intersection.js

@@ -7,37 +7,54 @@ import { __process_point_if_within_planes } from "./__process_point_if_within_pl
 import { plane_computeConvex3PlaneIntersection } from "../../geom/3d/plane/plane_computeConvex3PlaneIntersection.js";
 import { EPSILON } from "../../math/MathUtils.js";
 
+/**
+ * Common piece of continuous memory for better cache coherence
+ * @type {ArrayBuffer}
+ * @private
+ */
+const __scratch_buffer = new ArrayBuffer(
+    24 * 4
+    + 24 * 4
+    + 8 * 4
+    + 3 * 4
+);
+
 /**
  *
  * @type {number[]}
  */
-const scratch_aabb_corners = new Float32Array(24);
+const scratch_aabb_corners = new Float32Array(__scratch_buffer, 0, 24);
 
 /**
  *
  * @type {number[]}
  */
-const scratch_aabb_planes = new Float32Array(24);
+const scratch_aabb_planes = new Float32Array(__scratch_buffer, 96, 24);
 
 /**
  *
  * @type {number[]}
  */
-const scratch_corner_out_bitfields = new Uint32Array(8);
+const scratch_corner_out_bitfields = new Uint32Array(__scratch_buffer, 192, 8);
 
 /**
  *
  * @type {number[]}
  */
-const scratch_v3_array = new Float32Array(3);
+const scratch_v3_array = new Float32Array(__scratch_buffer, 224, 3);
 
 /**
+ * Figures out intersection volume between an AABB and a frustum for much tighter bounds
+ *
+ * Especially beneficial when trying to intersect a large AABB against a small frustum,
+ * where where traditionally only AABB corners would be considered,
+ * we're instead able to compute minimum bounds of the overlap of the two
  *
  * @param {AABB3} box
  * @param {number[]} planes
  * @param {number} plane_count
  * @param {number} plane_mask
- * @param {function} callback
+ * @param {function(x:number,y:number,z:number)} callback
  * @param {*} [thisArg]
  * @private
  */

package/core/cache/Cache.d.ts

@@ -4,13 +4,15 @@ export class Cache<K, V> {
                     keyWeigher,
                     valueWeigher,
                     keyHashFunction,
-                    keyEqualityFunction
+                    keyEqualityFunction,
+                    capacity
                 }?: {
         maxWeight?: number,
         keyWeigher?: (key: K) => number,
         valueWeigher?: (value: V) => number,
         keyHashFunction?: (key: K) => number,
-        keyEqualityFunction?: (a: K, b: K) => boolean
+        keyEqualityFunction?: (a: K, b: K) => boolean,
+        capacity?: number
     })
 
     size(): number

package/core/cache/Cache.js

@@ -16,6 +16,7 @@ export class Cache {
      * @param {function(key:Key, value:Value)} [removeListener] will be notified when element is either explicitly removed or evicted
      * @param {function(Key):number} [keyHashFunction]
      * @param {function(Key, Key):boolean} [keyEqualityFunction]
+     * @param {number} capacity initial capacity for the cache, helps prevent early resizing
      * @constructor
      * @template Key, Value
      */
@@ -25,7 +26,8 @@ export class Cache {
                     valueWeigher = returnOne,
                     removeListener = noop,
                     keyHashFunction = returnZero,
-                    keyEqualityFunction = strictEquals
+                    keyEqualityFunction = strictEquals,
+                    capacity
                 } = {}) {
 
         assert.isNumber(maxWeight, 'maxWeight');
@@ -95,7 +97,8 @@ export class Cache {
          */
         this.data = new HashMap({
             keyHashFunction,
-            keyEqualityFunction
+            keyEqualityFunction,
+            capacity
         });
 
         /**

package/core/collection/ArrayUtils.js

@@ -6,9 +6,9 @@
  */
 import { assert } from "../assert.js";
 import { returnZero } from "../function/Functions.js";
-import { randomIntegerBetween } from "../math/MathUtils.js";
 import { min2 } from "../math/min2.js";
 import { HashMap } from "./HashMap.js";
+import { randomIntegerBetween } from "../math/random/randomIntegerBetween.js";
 
 
 /**

package/core/collection/HashMap.d.ts

@@ -1,7 +1,14 @@
 export class HashMap<K, V> implements Iterable<[V, K]> {
-    constructor({keyHashFunction, keyEqualityFunction}: {
+    constructor({
+                    keyHashFunction,
+                    keyEqualityFunction,
+                    capacity,
+                    loadFactor
+                }: {
         keyHashFunction: (k: K) => number,
-        keyEqualityFunction: (a: K, b: K) => boolean
+        keyEqualityFunction: (a: K, b: K) => boolean,
+        capacity?: number,
+        loadFactor?: number
     })
 
     constructor()

package/core/collection/HashSet.d.ts

@@ -1,7 +1,12 @@
 export class HashSet<T> {
-    constructor({keyHashFunction, keyEqualityFunction}: {
+    constructor({
+                    keyHashFunction,
+                    keyEqualityFunction,
+                    capacity
+                }: {
         keyHashFunction: (k: T) => number,
-        keyEqualityFunction: (a: T, b: T) => boolean
+        keyEqualityFunction: (a: T, b: T) => boolean,
+        capacity?: number
     })
 
     constructor()

package/core/collection/HashSet.js

@@ -11,7 +11,11 @@ export class HashSet {
     /**
      * @template T
      */
-    constructor({ keyHashFunction = invokeObjectHash, keyEqualityFunction = invokeObjectEquals } = {}) {
+    constructor({
+                    keyHashFunction = invokeObjectHash,
+                    keyEqualityFunction = invokeObjectEquals,
+                    capacity
+                } = {}) {
 
         /**
          * Using HashMap as a backing, this is not the most efficient approach, but it works
@@ -20,7 +24,8 @@ export class HashSet {
          */
         this.__map = new HashMap({
             keyHashFunction,
-            keyEqualityFunction
+            keyEqualityFunction,
+            capacity
         });
     }
 

package/core/collection/array/arrayQuickSort.js

@@ -5,11 +5,14 @@ const stack = [];
 /**
  * @template T
  * @param {T[]} data
- * @param {function(T):number} keyExtractor
+ * @param {function(T):number} score_function
+ * @param {*} score_function_context
  * @param {number} start
  * @param {number} end
+ * @param {function(T[],number, number):*} [swap_operator]
+ * @param {*} [swap_context]
  */
-export function arrayQuickSort(data, keyExtractor, start, end) {
+export function arrayQuickSort(data, score_function, score_function_context, start, end, swap_operator = arraySwapElements, swap_context = undefined) {
     if (start >= end) {
         // section of 0 size, nothing to sort
         return;
@@ -32,15 +35,15 @@ export function arrayQuickSort(data, keyExtractor, start, end) {
 
         const pivotIndex = (left + right) >> 1;
 
-        const pivot = keyExtractor(data[pivotIndex]);
+        const pivot = score_function.call(score_function_context,data[pivotIndex]);
 
         /* partition */
         while (i <= j) {
-            while (keyExtractor(data[i]) < pivot) {
+            while (score_function.call(score_function_context,data[i]) < pivot) {
                 i++;
             }
 
-            while (keyExtractor(data[j]) > pivot) {
+            while (score_function.call(score_function_context,data[j]) > pivot) {
                 j--;
             }
 
@@ -48,7 +51,7 @@ export function arrayQuickSort(data, keyExtractor, start, end) {
 
                 if (i !== j) {
                     //do swap
-                    arraySwapElements(data, i, j);
+                    swap_operator.call(swap_context, data, i, j);
                 }
 
                 i++;

package/core/collection/array/array_swap.js

@@ -0,0 +1,22 @@
+/**
+ *
+ * @param {T[]|ArrayLike<T>|TypedArray|Uint8ClampedArray|Uint8Array} a
+ * @param {number} a_offset
+ * @param {T[]|ArrayLike<T>|TypedArray|Uint8ClampedArray|Uint8Array} b
+ * @param {number} b_offset
+ * @param {number} length How many elements should be moved
+ */
+export function array_swap(a, a_offset, b, b_offset, length) {
+
+    let i, j, k;
+
+    for (k = 0; k < length; k++) {
+        i = a_offset + k;
+        j = b_offset + k;
+
+        const t = b[j];
+
+        b[j] = a[i];
+        a[i] = t;
+    }
+}

package/core/collection/array/binarySearchHighIndex.js

@@ -1,6 +1,6 @@
 /**
  * @template T,V
- * @param {T[]} array
+ * @param {T[]|ArrayLike<T>|Float32Array} array
  * @param {V} el
  * @param {function(V,T):number} compareFunction
  * @param {number} [minIndex]

package/core/collection/array/computeHashArray.js

@@ -0,0 +1,22 @@
+/**
+ * @template T
+ * @param {T[]} array
+ * @param {function(T):number} elementHashFunction
+ */
+export function computeHashArray(array, elementHashFunction) {
+
+    const numArguments = array.length;
+    let hash = numArguments;
+
+    for (let i = 0; i < numArguments; i++) {
+
+        const singleValue = array[i];
+
+        const elementHash = elementHashFunction(singleValue);
+
+        hash = ((hash << 5) - hash) + elementHash;
+        hash |= 0; // Convert to 32bit integer
+    }
+
+    return hash;
+}

package/core/collection/array/computeHashIntegerArray.js

@@ -0,0 +1,15 @@
+/**
+ * Computes hash on integer values
+ * @param {...number} value
+ * @returns {number}
+ */
+export function computeHashIntegerArray(value) {
+    let hash = 0;
+    const numArguments = arguments.length;
+    for (let i = 0; i < numArguments; i++) {
+        const singleValue = arguments[i];
+        hash = ((hash << 5) - hash) + singleValue;
+        hash |= 0; // Convert to 32bit integer
+    }
+    return hash;
+}

package/core/collection/array/copyArray.js

@@ -25,9 +25,9 @@ export function copyArray(source, target) {
  * Follows Java System.arraycopy interface
  * Copy data from one array to another
  * @template T
- * @param {T[]|ArrayLike<T>|TypedArray|Uint8ClampedArray|Uint8Array} source The source array
+ * @param {T[]|ArrayLike<T>|TypedArray|Uint8ClampedArray|Uint8Array|Float32Array|Float64Array} source The source array
  * @param {number} source_position Starting position where to copy from inside the source array
- * @param {T[]|ArrayLike<T>|TypedArray|Uint8ClampedArray|Uint8Array} destination The destination array
+ * @param {T[]|ArrayLike<T>|TypedArray|Uint8ClampedArray|Uint8Array|Float32Array|Float64Array} destination The destination array
  * @param {number} destination_position Starting position where to copy to inside the destination array
  * @param {number} length How many elements should be copied
  */

package/core/collection/array/typed/typed_array_copy.js

@@ -2,7 +2,7 @@ import { array_copy } from "../copyArray.js";
 
 
 /**
- *
+ * Assumes arrays have the same type
  * @param {TypedArray|Float32Array} source
  * @param {TypedArray|Float32Array} destination
  */

package/core/collection/table/DataType2TypedArrayConstructorMapping.js

@@ -16,4 +16,19 @@ export const DataType2TypedArrayConstructorMapping = {
     [DataType.Float16]: Uint16Array,
     [DataType.Float32]: Float32Array,
     [DataType.Float64]: Float64Array,
+};
+
+/**
+ *
+ * @param {DataType} dt
+ * @returns {constructor|function}
+ */
+export function compute_typed_array_constructor_from_data_type(dt) {
+    const r = DataType2TypedArrayConstructorMapping[dt];
+
+    if (r === undefined) {
+        throw new Error(`Unsupported data type '${dt}'`);
+    }
+
+    return r;
 }

package/core/color/Color.js

@@ -1,11 +1,12 @@
 import { assert } from "../assert.js";
 import Signal from "../events/signal/Signal.js";
-import { computeHashFloat, computeHashIntegerArray } from "../math/MathUtils.js";
 import { parseColor, rgb2hsv } from "./ColorUtils.js";
 import { clamp } from "../math/clamp.js";
 import { min2 } from "../math/min2.js";
 import { max2 } from "../math/max2.js";
 import { min3 } from "../math/min3.js";
+import { computeHashIntegerArray } from "../collection/array/computeHashIntegerArray.js";
+import { computeHashFloat } from "../math/hash/computeHashFloat.js";
 
 class Color {
     /**

package/core/function/FunctionCompiler.js

@@ -1,11 +1,12 @@
 import { assert } from "../assert.js";
 import { Cache } from "../cache/Cache.js";
 import { isArrayEqualStrict } from "../collection/array/isArrayEqualStrict.js";
-import { computeHashArray, computeHashIntegerArray } from "../math/MathUtils.js";
 import { invokeObjectEquals } from "../model/object/invokeObjectEquals.js";
 import { invokeObjectHash } from "../model/object/invokeObjectHash.js";
 import { computeStringHash } from "../primitives/strings/computeStringHash.js";
 import { computeUTF8StringByteSize } from "../primitives/strings/StringUtils.js";
+import { computeHashArray } from "../collection/array/computeHashArray.js";
+import { computeHashIntegerArray } from "../collection/array/computeHashIntegerArray.js";
 
 /**
  * Hash is an integer value, so this is an invalid value for a computed hash

package/core/geom/3d/aabb/aabb3_computeDistanceAbovePlane.js

@@ -1,5 +1,3 @@
-import { computePointDistanceToPlane } from "../../Plane.js";
-
 /**
  * @param {number} plane_normal_x
  * @param {number} plane_normal_y
@@ -14,38 +12,16 @@ import { computePointDistanceToPlane } from "../../Plane.js";
  * @returns {number}
  */
 export function aabb3_computeDistanceAbovePlane(
-    plane_normal_x,
-    plane_normal_y,
-    plane_normal_z,
-    plane_constant,
-    _x0,
-    _y0,
-    _z0,
-    _x1,
-    _y1,
-    _z1
+    plane_normal_x, plane_normal_y, plane_normal_z, plane_constant,
+    _x0, _y0, _z0,
+    _x1, _y1, _z1
 ) {
 
-    let px, py, pz;
-
-    // pick a corner point furthest along the normal
-    if (plane_normal_x > 0) {
-        px = _x1;
-    } else {
-        px = _x0;
-    }
-
-    if (plane_normal_y > 0) {
-        py = _y1;
-    } else {
-        py = _y0;
-    }
-
-    if (plane_normal_z > 0) {
-        pz = _z1;
-    } else {
-        pz = _z0;
-    }
+    // pick a corner point furthest along the plane normal
+    const px = plane_normal_x > 0 ? _x1 : _x0;
+    const py = plane_normal_y > 0 ? _y1 : _y0;
+    const pz = plane_normal_z > 0 ? _z1 : _z0;
 
-    return computePointDistanceToPlane(px, py, pz, plane_normal_x, plane_normal_y, plane_normal_z, plane_constant);
+    // dot(v4,v4) inlined for speed
+    return (plane_normal_x * px + plane_normal_y * py + plane_normal_z * pz) + plane_constant;
 }

package/core/geom/3d/frustum/array_setFromProjectionMatrix.js

@@ -1,5 +1,3 @@
-import { v3_length } from "../../v3_length.js";
-
 /**
  *
  * @param {number[]} destination
@@ -10,10 +8,12 @@ import { v3_length } from "../../v3_length.js";
  * @param {number} w
  */
 function array_set_plane_normalized(destination, destination_offset, x, y, z, w) {
-    const length = v3_length(x, y, z);
+    // compute vector length
+    const length = Math.hypot(x, y, z);
 
     const inverseNormalLength = 1.0 / length;
 
+    // apply normalization
     destination[destination_offset] = x * inverseNormalLength;
     destination[destination_offset + 1] = y * inverseNormalLength;
     destination[destination_offset + 2] = z * inverseNormalLength;

package/core/geom/3d/frustum/frustum3_computeNearestPointToPoint.js

@@ -1,8 +1,8 @@
-import { ray_computeNearestPointToPoint } from "../../LineSegment.js";
 import { computePlanePlaneIntersection, computePointDistanceToPlane } from "../../Plane.js";
 import Vector3 from "../../Vector3.js";
 import { plane3_projectPoint } from "../plane/plane3_projectPoint.js";
 import { plane_three_computeConvex3PlaneIntersection } from "../plane/plane_computeConvex3PlaneIntersection.js";
+import { ray_computeNearestPointToPoint } from "../ray/ray_computeNearestPointToPoint.js";
 
 /**
  *

package/core/geom/3d/line/line3_computeSegmentPointDistance_sqr.js

@@ -0,0 +1,41 @@
+import { clamp } from "../../../math/clamp.js";
+import { v3_distance_sqr } from "../../v3_distance_sqr.js";
+
+/**
+ * Computes shortest distance between a line segment(defined by 2 points) and a point
+ * @param {number} x0
+ * @param {number} y0
+ * @param {number} z0
+ * @param {number} x1
+ * @param {number} y1
+ * @param {number} z1
+ * @param {number} px
+ * @param {number} py
+ * @param {number} pz
+ */
+export function line3_computeSegmentPointDistance_sqr(x0, y0, z0, x1, y1, z1, px, py, pz) {
+    // get line delta
+    const line_delta_x = x1 - x0;
+    const line_delta_y = y1 - y0;
+    const line_delta_z = z1 - z0;
+
+    // find closest point
+    const sp0_x = px - x0;
+    const sp0_y = py - y0;
+    const sp0_z = pz - z0;
+
+    //
+    const d2 = line_delta_x * line_delta_x + line_delta_y * line_delta_y + line_delta_z * line_delta_z;
+
+    const d3 = line_delta_x * sp0_x + line_delta_y * sp0_y + line_delta_z * sp0_z;
+
+    const t = clamp(d3 / d2, 0, 1);
+
+    // compute point on the line
+    const lp_x = line_delta_x * t + x0;
+    const lp_y = line_delta_y * t + y0;
+    const lp_z = line_delta_z * t + z0;
+
+    // compute distance from the point in question to the point on the line
+    return v3_distance_sqr(px, py, pz, lp_x, lp_y, lp_z);
+}

package/core/geom/3d/morton/mortonEncode_magicbits.js

@@ -1,10 +1,11 @@
 /**
  * method to separate bits from a given integer 3 positions apart
+ * we only look at the first 10 bits
  * @param {number} a
  * @returns {number}
  */
 function splitBy3(a) {
-    let x = a & 0x000003ff; // we only look at the first 10 bits
+    let x = a;
     x = (x | x << 16) & 0x30000ff;
     x = (x | x << 8) & 0x0300f00f;
     x = (x | x << 4) & 0x30c30c3;

package/core/geom/3d/morton/reinterpret_float32_as_int32.js

@@ -0,0 +1,13 @@
+const b = new ArrayBuffer(4);
+const b_f32 = new Float32Array(b);
+const b_i32 = new Int32Array(b);
+
+/**
+ *
+ * @param {number} value
+ * @returns {number}
+ */
+export function reinterpret_float32_as_int32(value) {
+    b_f32[0] = value;
+    return b_i32[0];
+}