@woosh/meep-engine 2.35.17 → 2.36.2

package/core/binary/BinaryBuffer.js

@@ -864,23 +864,6 @@ BinaryBuffer.prototype.writeUTF8String = function (string) {
     this.position = at;
 };
 
-/**
- *
- * @param {number} length
- * @returns {string}
- */
-BinaryBuffer.prototype.readASCIICharacters = function (length) {
-    let result = "";
-
-    for (let i = 0; i < length; i++) {
-        const code = this.readUint8();
-
-        result += String.fromCharCode(code);
-    }
-
-    return result;
-};
-
 /**
  * Adapted from https://github.com/samthor/fast-text-encoding/blob/master/text.js
  * @licence Original license is Apache 2.0
@@ -954,6 +937,48 @@ BinaryBuffer.prototype.readUTF8String = function () {
     return result;
 };
 
+/**
+ *
+ * @param {string} string
+ */
+BinaryBuffer.prototype.writeASCIIString = function (string) {
+    const char_count = string.length;
+
+    const start = this.position;
+    const end = start + char_count;
+
+    this.ensureCapacity(end);
+
+    for (let i = 0; i < char_count; i++) {
+        const char_code = string.charCodeAt(i);
+
+        if (char_code > 0xFF) {
+            throw new Error(`Character ${String.fromCharCode(char_code)} can\'t be represented by a US-ASCII byte.`);
+        }
+
+        this.__data_uint8[start + i] = char_code;
+    }
+
+    this.position = end;
+};
+
+/**
+ *
+ * @param {number} length
+ * @returns {string}
+ */
+BinaryBuffer.prototype.readASCIICharacters = function (length) {
+    let result = "";
+
+    for (let i = 0; i < length; i++) {
+        const code = this.readUint8();
+
+        result += String.fromCharCode(code);
+    }
+
+    return result;
+};
+
 /**
  *
  * @param {BinaryBuffer} source

package/core/bvh2/BinaryNode.js

@@ -15,7 +15,7 @@ import { BVHVisitor } from "./traversal/BVHVisitor.js";
 import { traverseBinaryNodeUsingVisitor } from "./traversal/traverseBinaryNodeUsingVisitor.js";
 import { aabb3_intersect_aabb3 } from "./aabb3/aabb3_intersect_aabb3.js";
 import { aabb3_box_surface_area_2 } from "./aabb3/aabb3_box_surface_area_2.js";
-import { aabb3_combined_surface_area } from "./aabb3_combined_surface_area.js";
+import { aabb3_combined_surface_area } from "./aabb3/aabb3_combined_surface_area.js";
 
 
 /**

package/core/bvh2/aabb3/AABB3.js

@@ -9,10 +9,10 @@ import computeMortonCode from "../../geom/3d/morton/Morton.js";
 import { aabb3_build_corners } from "../../geom/3d/aabb/aabb3_build_corners.js";
 import { assert } from "../../assert.js";
 import { aabb3_intersects_frustum_degree } from "./aabb3_intersects_frustum_degree.js";
-import { aabb3_intersects_frustum } from "./aabb3_intersects_frustum_array.js";
 import { aabb3_intersects_line_segment } from "./aabb3_intersects_line_segment.js";
 import { aabb3_intersects_ray } from "./aabb3_intersects_ray.js";
 import { aabb3_compute_surface_area } from "./aabb3_compute_surface_area.js";
+import { aabb3_intersects_frustum_array } from "./aabb3_intersects_frustum_array.js";
 
 
 export class AABB3 {
@@ -903,7 +903,7 @@ export class AABB3 {
         const y1 = this.y1;
         const z1 = this.z1;
 
-        return aabb3_intersects_frustum(x0, y0, z0, x1, y1, z1, frustum);
+        return aabb3_intersects_frustum_array(x0, y0, z0, x1, y1, z1, frustum);
     }
 
     /**

package/core/bvh2/aabb3/aabb3_array_combine.js

@@ -0,0 +1,20 @@
+//
+
+import { min2 } from "../../math/min2.js";
+import { max2 } from "../../math/max2.js";
+
+/**
+ *
+ * @param {ArrayLike<number>|number[]} result
+ * @param {ArrayLike<number>|number[]} a
+ * @param {ArrayLike<number>|number[]} b
+ */
+export function aabb3_array_combine(result, a, b) {
+    result[0] = min2(a[0], b[0]);
+    result[1] = min2(a[1], b[1]);
+    result[2] = min2(a[2], b[2]);
+
+    result[3] = max2(a[3], b[3]);
+    result[4] = max2(a[4], b[4]);
+    result[5] = max2(a[5], b[5]);
+}

package/core/bvh2/aabb3/aabb3_array_intersects_frustum_array.js

@@ -0,0 +1,20 @@
+import { aabb3_intersects_frustum_array } from "./aabb3_intersects_frustum_array.js";
+
+/**
+ *
+ * @param {Float32Array|number[]} aabb
+ * @param {Float32Array|number[]} frustum
+ * @return {boolean}
+ */
+export function aabb3_array_intersects_frustum_array(aabb, frustum) {
+
+    const x0 = aabb[0];
+    const y0 = aabb[1];
+    const z0 = aabb[2];
+    const x1 = aabb[3];
+    const y1 = aabb[4];
+    const z1 = aabb[5];
+
+    return aabb3_intersects_frustum_array(x0, y0, z0, x1, y1, z1, frustum);
+}
+

package/core/bvh2/aabb3/aabb3_array_intersects_ray.js

@@ -18,3 +18,4 @@ export function aabb3_array_intersects_ray(aabb, origin_x, origin_y, origin_z, d
         direction_x, direction_y, direction_z
     );
 }
+

package/core/bvh2/aabb3/aabb3_array_intersects_ray_array.js

@@ -0,0 +1,14 @@
+import { aabb3_intersects_ray } from "./aabb3_intersects_ray.js";
+
+/**
+ *
+ * @param {ArrayLike<number>|number[]|Float32Array} aabb bounding box, order: x0,y0,z0,x1,y1,z1
+ * @param {ArrayLike<number>|number[]|Float32Array} ray ray data, order: origin_x, origin_y, origin_z, direction_x, direction_y, direction_z
+ * @returns {boolean}
+ */
+export function aabb3_array_intersects_ray_array(aabb, ray) {
+    return aabb3_intersects_ray(aabb[0], aabb[1], aabb[2], aabb[3], aabb[4], aabb[5],
+        ray[0], ray[1], ray[2],
+        ray[3], ray[4], ray[5]
+    );
+}

package/core/bvh2/{aabb3_combined_surface_area.js → aabb3/aabb3_combined_surface_area.js}

@@ -1,6 +1,6 @@
-import { min2 } from "../math/min2.js";
-import { max2 } from "../math/max2.js";
-import { aabb3_compute_half_surface_area } from "./aabb3/aabb3_compute_half_surface_area.js";
+import { min2 } from "../../math/min2.js";
+import { max2 } from "../../math/max2.js";
+import { aabb3_compute_half_surface_area } from "./aabb3_compute_half_surface_area.js";
 
 /**
  *

package/core/bvh2/aabb3/aabb3_intersects_frustum_array.js

@@ -1,23 +1,5 @@
 import { aabb3_computeDistanceAbovePlane } from "../../geom/3d/aabb/aabb3_computeDistanceAbovePlane.js";
 
-/**
- *
- * @param {Float32Array|number[]} aabb
- * @param {Float32Array|number[]} frustum
- * @return {boolean}
- */
-export function aabb3_intersects_frustum_array(aabb, frustum) {
-
-    const x0 = aabb[0];
-    const y0 = aabb[1];
-    const z0 = aabb[2];
-    const x1 = aabb[3];
-    const y1 = aabb[4];
-    const z1 = aabb[5];
-
-    return aabb3_intersects_frustum(x0, y0, z0, x1, y1, z1, frustum);
-}
-
 /**
  *
  * @param {number} x0
@@ -29,7 +11,7 @@ export function aabb3_intersects_frustum_array(aabb, frustum) {
  * @param {ArrayLike<number>|number[]|Float32Array|Float64Array} frustum
  * @return {boolean}
  */
-export function aabb3_intersects_frustum(x0, y0, z0, x1, y1, z1, frustum) {
+export function aabb3_intersects_frustum_array(x0, y0, z0, x1, y1, z1, frustum) {
     for (let i = 0; i < 24; i += 4) {
 
         const plane_x = frustum[i];

package/core/bvh2/bvh3/BVHNodeProxy.js

@@ -0,0 +1,53 @@
+export class BVHNodeProxy {
+    constructor() {
+        /**
+         *
+         * @type {number}
+         * @private
+         */
+        this.__node = -1;
+
+        /**
+         *
+         * @type {ExplicitBinaryBoundingVolumeHierarchy|null}
+         * @private
+         */
+        this.__tree = null;
+    }
+
+    /**
+     *
+     * @param {number} node
+     * @param {ExplicitBinaryBoundingVolumeHierarchy} tree
+     */
+    bind(node, tree) {
+        this.__node = node;
+        this.__tree = tree;
+    }
+
+    /**
+     *
+     * @param {number} x0
+     * @param {number} y0
+     * @param {number} z0
+     * @param {number} x1
+     * @param {number} y1
+     * @param {number} z1
+     */
+    set_bounds(x0, y0, z0, x1, y1, z1) {
+        this.__tree.node_set_aabb_primitive(this.__node,
+            x0, y0, z0, x1, y1, z1
+        );
+    }
+
+    disconnect() {
+        this.__tree.remove_leaf(this.__node);
+    }
+
+    destroy() {
+        this.__tree.release_node(this.__node);
+
+        this.__tree = null;
+        this.__node = -1;
+    }
+}