@woosh/meep-engine 2.75.5 → 2.75.6

package/build/meep.module.js

@@ -58131,6 +58131,19 @@ class AABB3 {
         this.setBounds(Number.NEGATIVE_INFINITY, Number.NEGATIVE_INFINITY, Number.NEGATIVE_INFINITY, Number.POSITIVE_INFINITY, Number.POSITIVE_INFINITY, Number.POSITIVE_INFINITY);
     }
 
+    /**
+     *
+     * @param {number} x
+     * @param {number} y
+     * @param {number} z
+     */
+    _translate(x,y,z){
+        this.setBounds(
+            this.x0 + x, this.y0 + y, this.z0 + z,
+            this.x1 + x, this.y1 + y, this.z1 + z
+        );
+    }
+
     /**
      *
      * @param {number} x
@@ -61433,41 +61446,6 @@ const GridTransformKind = {
     Direct: 1
 };
 
-/**
- * Performs equality check via {@link #equals} method on first object
- * @template T
- * @param {T} a
- * @param {T} b
- * @return {boolean}
- */
-function invokeObjectEquals(a, b) {
-    return a.equals(b);
-}
-
-/**
- * @template T
- * @param {T} object
- * @return {number}
- */
-function invokeObjectHash(object) {
-    return object.hash();
-}
-
-/**
- * Is the number a power of two?
- * e.g. 2,4,8,16 etc.
- * NOTE: only valid for non-negative integers
- * @param {number} value
- * @returns {boolean}
- */
-function isPowerOfTwo(value) {
-    assert.isNonNegativeInteger(value, 'value');
-
-
-    return (value & (value - 1)) === 0 && value !== 0;
-
-}
-
 /**
  * Count trailing zeroes
  * adapted from https://github.com/git/git/blob/bcd6bc478adc4951d57ec597c44b12ee74bc88fb/ewah/ewok.h#L44
@@ -61510,21 +61488,38 @@ function ctz32(x) {
 }
 
 /**
- *
- * @param {number} count
- * @returns {function}
+ * Is the number a power of two?
+ * e.g. 2,4,8,16 etc.
+ * NOTE: only valid for non-negative integers
+ * @param {number} value
+ * @returns {boolean}
  */
-function UintArrayForCount(count) {
+function isPowerOfTwo(value) {
+    assert.isNonNegativeInteger(value, 'value');
 
-    if (count <= 256) {
-        return Uint8Array;
-    } else if (count <= 65536) {
-        return Uint16Array;
-    } else if (count <= 4294967295) {
-        return Uint32Array;
-    } else {
-        throw new Error(`Unsupported size ${count}`)
-    }
+
+    return (value & (value - 1)) === 0 && value !== 0;
+
+}
+
+/**
+ * Performs equality check via {@link #equals} method on first object
+ * @template T
+ * @param {T} a
+ * @param {T} b
+ * @return {boolean}
+ */
+function invokeObjectEquals(a, b) {
+    return a.equals(b);
+}
+
+/**
+ * @template T
+ * @param {T} object
+ * @return {number}
+ */
+function invokeObjectHash(object) {
+    return object.hash();
 }
 
 /**
@@ -61540,6 +61535,24 @@ function arraySwapElements(array, index0, index1) {
     array[index1] = t;
 }
 
+/**
+ *
+ * @param {number} count
+ * @returns {function}
+ */
+function UintArrayForCount(count) {
+
+    if (count <= 256) {
+        return Uint8Array;
+    } else if (count <= 65536) {
+        return Uint16Array;
+    } else if (count <= 4294967295) {
+        return Uint32Array;
+    } else {
+        throw new Error(`Unsupported size ${count}`)
+    }
+}
+
 /*
  * Heavily inspired by ruby's "new" (circa 2016) hash table implementation
  * @see https://github.com/ruby/ruby/blob/82995d4615e993f1d13f3e826b93fbd65c47e19e/st.c
@@ -61909,15 +61922,17 @@ class HashMap {
     }
 
     #rebuild_if_necessary() {
-        if (this.#entries_bound === this.#entries_allocated_count) {
-            if (this.#size === this.#entries_allocated_count) {
-                // used up all allocated entries
-                // bin count must always be larger than end of the entries table
-                this.#grow();
-            } else {
-                // exhausted entries array, perform compaction
-                this.rebuild();
-            }
+        if (this.#entries_bound !== this.#entries_allocated_count) {
+            return;
+        }
+
+        if (this.#size === this.#entries_allocated_count) {
+            // used up all allocated entries
+            // bin count must always be larger than end of the entries table
+            this.#grow();
+        } else {
+            // exhausted entries array, perform compaction
+            this.rebuild();
         }
     }
 
@@ -65389,22 +65404,6 @@ class OffsetScaleTransform2D {
     }
 }
 
-/**
- * Created by Alex on 25/08/2016.
- */
-
-
-/**
- * @readonly
- * @enum {number}
- */
-const TaskSignal = {
-    EndSuccess: 0,
-    EndFailure: 1,
-    Continue: 2,
-    Yield: 3
-};
-
 /**
  * @template T
  * @param {T[]} array
@@ -65422,6 +65421,22 @@ function array_push_if_unique(array, element) {
     return false;
 }
 
+/**
+ * Created by Alex on 25/08/2016.
+ */
+
+
+/**
+ * @readonly
+ * @enum {number}
+ */
+const TaskSignal = {
+    EndSuccess: 0,
+    EndFailure: 1,
+    Continue: 2,
+    Yield: 3
+};
+
 /**
  * Created by Alex on 22/05/2016.
  */
@@ -65784,7 +65799,6 @@ function countTask(initial, limit, callback) {
             }
 
             i = initialValue;
-
         },
         cycleFunction: cycle,
         computeProgress: function () {
@@ -92881,6 +92895,9 @@ class PointerDevice {
         down: new Signal(),
         up: new Signal(),
         move: new Signal(),
+        /**
+         * @type {Signal<Vector2, (MouseEvent|TouchEvent)>}
+         */
         tap: new Signal(),
         drag: new Signal(),
         dragStart: new Signal(),

package/package.json

@@ -5,7 +5,7 @@
   "description": "Fully featured ECS game engine written in JavaScript",
   "type": "module",
   "author": "Alexander Goldring",
-  "version": "2.75.5",
+  "version": "2.75.6",
   "main": "build/meep.module.js",
   "module": "build/meep.module.js",
   "exports": {