@woosh/meep-engine 2.39.33 → 2.39.34

package/core/binary/EncodingBinaryBuffer.js

@@ -36,62 +36,59 @@ class Dictionary {
 }
 
 
-function EncodingBinaryBuffer() {
-    BinaryBuffer.call(this);
-    this.__dictionary = new Dictionary();
-}
-
-EncodingBinaryBuffer.prototype = Object.create(BinaryBuffer.prototype);
+export class EncodingBinaryBuffer extends BinaryBuffer {
+    constructor() {
+        super();
+        this.__dictionary = new Dictionary();
+    }
 
-EncodingBinaryBuffer.prototype.writeUTF8String = function (value) {
-    const address = this.__dictionary.getAddress(value);
+    writeUTF8String(value) {
+        const address = this.__dictionary.getAddress(value);
 
-    if (address === undefined) {
-        this.writeUint8(0); //mark as complete value
+        if (address === undefined) {
+            this.writeUint8(0); //mark as complete value
 
-        const address1 = this.position;
+            const address1 = this.position;
 
-        BinaryBuffer.prototype.writeUTF8String.call(this, value);
+            super.writeUTF8String(value);
 
-        this.__dictionary.add(value, address1);
-    } else {
-        //write as reference
-        this.writeUint32LE(1 | (address << 1));
+            this.__dictionary.add(value, address1);
+        } else {
+            //write as reference
+            this.writeUint32LE(1 | (address << 1));
+        }
     }
-};
 
-EncodingBinaryBuffer.prototype.readUTF8String = function () {
-    const header0 = this.readUint8();
+    readUTF8String() {
+        const header0 = this.readUint8();
 
-    if (header0 === 0) {
-        //complete value
-        return BinaryBuffer.prototype.readUTF8String.call(this);
-    } else {
-        this.position--;
+        if (header0 === 0) {
+            //complete value
+            return super.readUTF8String();
+        } else {
+            this.position--;
 
-        const header = this.readUint32LE();
+            const header = this.readUint32LE();
 
-        const address = header >> 1;
+            const address = header >> 1;
 
-        let value = this.__dictionary.getValue(address);
+            let value = this.__dictionary.getValue(address);
 
-        if (value === undefined) {
-            //remember position
-            const p = this.position;
+            if (value === undefined) {
+                //remember position
+                const p = this.position;
 
-            this.position = address;
+                this.position = address;
 
-            value = BinaryBuffer.prototype.readUTF8String.call(this);
+                value = super.readUTF8String();
 
-            //restore position
-            this.position = p;
+                //restore position
+                this.position = p;
 
-            this.__dictionary.add(value, address);
-        }
+                this.__dictionary.add(value, address);
+            }
 
-        return value;
+            return value;
+        }
     }
-};
-
-
-export { EncodingBinaryBuffer };
+}

package/core/bvh2/bvh3/ExplicitBinaryBoundingVolumeHierarchy.d.ts

@@ -1,3 +1,23 @@
 export class ExplicitBinaryBoundingVolumeHierarchy {
+    readonly root: number
 
+    allocate_node(): number
+
+    release_node(node: number): void
+
+    insert_leaf(node: number): void
+
+    remove_leaf(node: number): void
+
+    collect_nodes_all(destination: ArrayLike<number>, destination_offset: number): void
+
+    node_set_aabb(node: number, aabb: ArrayLike<number>): void
+
+    node_get_aabb(node: number, aabb: ArrayLike<number>): void
+
+    node_set_user_data(node: number, data: number): void
+
+    node_get_user_data(node: number): number
+
+    release_all(): void
 }

package/core/bvh2/bvh3/ExplicitBinaryBoundingVolumeHierarchy.js

@@ -49,12 +49,6 @@ const ELEMENT_WORD_COUNT = 10;
  */
 const INITIAL_CAPACITY = 128;
 
-/**
- *
- * @type {number[]}
- */
-const scratch_stack = [];
-
 /**
  * Bounding Volume Hierarchy implementation. Stores unsigned integer values at leaves, these are typically IDs or Index values.
  * Highly optimized both in terms of memory usage and CPU. Most of the code inlined. No allocation are performed during usage (except for growing the tree capacity).
@@ -300,7 +294,7 @@ export class ExplicitBinaryBoundingVolumeHierarchy {
     /**
      *
      * @param {number} id
-     * @param {number[]} aabb
+     * @param {number[]|ArrayLike<number>} aabb
      */
     node_set_aabb(id, aabb) {
         assert.isNonNegativeInteger(id, 'id');
@@ -882,36 +876,12 @@ export class ExplicitBinaryBoundingVolumeHierarchy {
 
     /**
      * Release all nodes, this essentially resets the tree to empty state
+     * NOTE: For performance reasons, released memory is not reset, this means that attempting to access cleared nodes' memory will yield garbage data
      */
     release_all() {
-        let cursor = 0;
-        const stack = scratch_stack;
-
-        const root = this.__root;
-
-        if (root !== NULL_NODE) {
-            stack[cursor++] = root;
-        }
-
-        const uint32 = this.__data_uint32;
-
-        while (cursor > 0) {
-            cursor--;
-
-            const node = stack[cursor];
-
-            const node_address = node * ELEMENT_WORD_COUNT;
-
-            const child1 = uint32[node_address + COLUMN_CHILD_1];
-            const child2 = uint32[node_address + COLUMN_CHILD_2];
-
-            if (child1 !== NULL_NODE) {
-                stack[cursor++] = child2;
-                stack[cursor++] = child1;
-            }
-
-            this.release_node(node);
-        }
+        this.__root = NULL_NODE;
+        this.__size = 0;
+        this.__free_pointer = 0;
     }
 
     /**

package/core/bvh2/bvh3/ExplicitBinaryBoundingVolumeHierarchy.spec.js

@@ -143,3 +143,22 @@ test("add and remove 5 nodes", () => {
     }
 
 });
+
+
+test("release_all from empty doesn't throw", () => {
+    const bvh = new ExplicitBinaryBoundingVolumeHierarchy();
+
+    expect(() => bvh.release_all()).not.toThrow();
+});
+
+test("release_all with 1 leaf", () => {
+    const bvh = new ExplicitBinaryBoundingVolumeHierarchy();
+
+    const a = bvh.allocate_node();
+
+    bvh.insert_leaf(a);
+
+    bvh.release_all();
+
+    expect(bvh.root).toBe(NULL_NODE);
+});

package/editor/tools/v2/BlenderCameraOrientationGizmo.js

@@ -57,7 +57,7 @@ class DirectionStyle {
     }
 }
 
-function apply_hierarchical_options(source, target) {
+function apply_hierarchical_options_from_json(source, target) {
     for (const prop_name in source) {
         if (!target.hasOwnProperty(prop_name)) {
             console.warn(`Property '${prop_name}' doesn't exist, valid properties are : ${Object.keys(target)}`);
@@ -71,7 +71,7 @@ function apply_hierarchical_options(source, target) {
             if (typeof existing_target_value.fromJSON === "function") {
                 existing_target_value.fromJSON(source_value);
             } else {
-                apply_hierarchical_options(source_value, existing_target_value);
+                apply_hierarchical_options_from_json(source_value, existing_target_value);
             }
         } else {
             target[prop_name] = source_value;
@@ -153,7 +153,7 @@ export class BlenderCameraOrientationGizmo extends CanvasView {
         };
 
         // read options
-        apply_hierarchical_options(options, this.options);
+        apply_hierarchical_options_from_json(options, this.options);
 
         // Generate list of axes
         this.bubbles = [

package/engine/ecs/speaker/VoiceSystem.js

@@ -28,6 +28,8 @@ import { AnimationBehavior } from "../../animation/keyed2/behavior/AnimationBeha
 import AnimationTrack from "../../animation/keyed2/AnimationTrack.js";
 import TransitionFunctions from "../../animation/TransitionFunctions.js";
 import AnimationTrackPlayback from "../../animation/keyed2/AnimationTrackPlayback.js";
+import { globalMetrics } from "../../metrics/GlobalMetrics.js";
+import { MetricsCategory } from "../../metrics/MetricsCategory.js";
 
 /**
  * Delay before the user notices the text and begins to read
@@ -443,5 +445,11 @@ export class VoiceSystem extends AbstractContextSystem {
 
         entityBuilder
             .build(ecd);
+
+        // send metrics
+        globalMetrics.record('ecs.system.voice', {
+            category: MetricsCategory.System,
+            label: line_id
+        });
     }
 }

package/engine/metrics/GoogleAnalyticsMetrics.js

@@ -1,7 +1,8 @@
 import { MetricsGateway } from "./MetricsGateway.js";
 
 // const GOOGLE_ANALYTICS_KEY = 'UA-66021000-1'; //Lazy-Kitty.com
-const GOOGLE_ANALYTICS_KEY = 'UA-138821093-1'; //Itch.com
+// const GOOGLE_ANALYTICS_KEY = 'UA-138821093-1'; //Itch.com
+const GOOGLE_ANALYTICS_KEY = 'G-ZBGZD4ZMZ1'; //ASKARA
 
 function loadGTAG(MEASUREMENT_ID) {
 

package/package.json

@@ -5,7 +5,7 @@
   "productName": "Meep",
   "description": "production-ready JavaScript game engine based on Entity Component System Architecture",
   "author": "Alexander Goldring",
-  "version": "2.39.33",
+  "version": "2.39.34",
   "dependencies": {
     "gl-matrix": "3.4.3",
     "fast-levenshtein": "2.0.6",