@woosh/meep-engine 2.122.3 → 2.122.4

package/package.json

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

package/src/core/bvh2/bvh3/BVH.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"BVH.d.ts","sourceRoot":"","sources":["../../../../../src/core/bvh2/bvh3/BVH.js"],"names":[],"mappings":"AASA,4BAA6B,CAAC,CAAC;AAC/B,6BAA8B,CAAC,CAAC;AAChC,6BAA8B,CAAC,CAAC;AAChC,4BAA6B,CAAC,CAAC;AAE/B;;;;;GAKG;AACH,+BAFU,MAAM,CAE+B;AAE/C;;;GAGG;AACH,wBAFU,MAAM,CAEoB;AAcpC;;;;;GAKG;AACH,iCAFU,MAAM,CAEqB;AAiBrC;;;;;;GAMG;AACH;IAEI;;;;OAIG;IACH,sBAA2E;IAE3E;;;;;OAKG;IACH,mBAFa,WAAW,CAIvB;IAED;;;;OAIG;IACH,uBAAsD;IAEtD;;;OAGG;IACH,oBAFY,YAAY,CAIvB;IAED;;;;OAIG;IACH,sBAAoD;IAEpD;;;;OAIG;IACH,mBAA8B;IAE9B;;;;OAIG;IACH,eAAW;IAEX;;;;OAIG;IACH,eAAY;IAEZ;;;;OAIG;IACH,uBAAmB;IAEnB;;;;OAIG;IACH,eAAmB;IAUnB;;;OAGG;IACH,YAFW,MAAM,EAIhB;IAdD;;;OAGG;IACH,YAFa,MAAM,CAIlB;IAUD;;;;OAIG;IACH,YAFY,MAAM,CAIjB;IAUD;;;OAGG;IACH,qBAFW,MAAM,EAQhB;IAlBD;;;OAGG;IACH,qBAFa,MAAM,CAIlB;IAcD,wBAgBC;IAED;;;;OAIG;IACH,uBA6BC;IAED;;OAEG;IACH,aAIC;IAED;;;OAGG;IACH,iBAFa,MAAM,CAqDlB;IAED;;;;OAIG;IACH,iBAFW,MAAM,QAMhB;IAED;;;;OAIG;IACH,iBAHW,MAAM,GACJ,OAAO,CAOnB;IAED;;;;OAIG;IACH,uBAHW,MAAM,GACJ,MAAM,CAKlB;IAED;;;;OAIG;IACH,uBAHW,MAAM,SACN,MAAM,QAOhB;IAED;;;;OAIG;IACH,oBAHW,MAAM,GACJ,MAAM,CAKlB;IAED;;;;OAIG;IACH,sBAHW,MAAM,UACN,MAAM,QAIhB;IAED;;;;OAIG;IACH,oBAHW,MAAM,GACJ,MAAM,CAKlB;IAED;;;;OAIG;IACH,sBAHW,MAAM,UACN,MAAM,QAIhB;IAED;;;;OAIG;IACH,oBAHW,MAAM,GACJ,MAAM,CAKlB;IAED;;;;OAIG;IACH,sBAHW,MAAM,UACN,MAAM,QAIhB;IAGD;;;;OAIG;IACH,oBAHW,MAAM,GACJ,MAAM,CAKlB;IAED;;;;OAIG;IACH,oBAHW,MAAM,UACN,MAAM,QAKhB;IAED;;;;OAIG;IACH,kBAHW,MAAM,UACN,MAAM,EAAE,GAAC,YAAY,QAe/B;IAED;;;;OAIG;IACH,kBAHW,MAAM,QACN,MAAM,EAAE,GAAC,SAAS,CAAC,MAAM,CAAC,GAAC,KAAK,QAsB1C;IAED;;;;OAIG;IACH,mBAHW,MAAM,QACN,MAAM,EAAE,QAWlB;IAED;;;;;;;;;OASG;IACH,4BARW,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,QAmBhB;IAED;;;;OAIG;IACH,0BAHW,MAAM,GACJ,MAAM,CAoBlB;IAED;;;;;OAKG;IACH,wCAJW,MAAM,WACN,MAAM,GACJ,MAAM,CAoClB;IAED;;;;;OAKG;IACH,oCAJW,MAAM,WACN,MAAM,WACN,MAAM,QAgBhB;IAED;;;;OAIG;IACH,kBAHW,MAAM,GACJ,IAAI,CA0GhB;IAED;;;;;OAKG;IACH,wBAqBC;IAED;;;;OAIG;IACH,yBA4BC;IAED;;;;OAIG;IACH,kBAHW,MAAM,GACJ,IAAI,CA6ChB;IAED;;;;;;OAMG;IACH,gBAoMC;IAED;;;;;;OAMG;IACH,6BAJW,MAAM,WACN,MAAM,WACN,MAAM,QAiBhB;IAED;;;OAGG;IACH,oBAIC;IAED;;;;OAIG;IACH,8BAFW,GAAC,QAgCX;IAED;;;;;OAKG;IACH,+BAJW,MAAM,EAAE,sBACR,MAAM,GACJ,MAAM,CAWlB;IAED;;;;;OAKG;IACH,0BA6BC;IAED;;;;;OAKG;IACH,cAJW,MAAM,KACN,MAAM,GACJ,OAAO,CAsCnB;CACJ"}
+{"version":3,"file":"BVH.d.ts","sourceRoot":"","sources":["../../../../../src/core/bvh2/bvh3/BVH.js"],"names":[],"mappings":"AASA,4BAA6B,CAAC,CAAC;AAC/B,6BAA8B,CAAC,CAAC;AAChC,6BAA8B,CAAC,CAAC;AAChC,4BAA6B,CAAC,CAAC;AAE/B;;;;;GAKG;AACH,+BAFU,MAAM,CAE+B;AAE/C;;;GAGG;AACH,wBAFU,MAAM,CAEoB;AAcpC;;;;;GAKG;AACH,iCAFU,MAAM,CAEqB;AAiBrC;;;;;;GAMG;AACH;IAEI;;;;OAIG;IACH,sBAA2E;IAE3E;;;;;OAKG;IACH,mBAFa,WAAW,CAIvB;IAED;;;;OAIG;IACH,uBAAsD;IAEtD;;;OAGG;IACH,oBAFY,YAAY,CAIvB;IAED;;;;OAIG;IACH,sBAAoD;IAEpD;;;;OAIG;IACH,mBAA8B;IAE9B;;;;OAIG;IACH,eAAW;IAEX;;;;OAIG;IACH,eAAY;IAEZ;;;;OAIG;IACH,uBAAmB;IAEnB;;;;OAIG;IACH,eAAmB;IAUnB;;;OAGG;IACH,YAFW,MAAM,EAIhB;IAdD;;;OAGG;IACH,YAFa,MAAM,CAIlB;IAUD;;;;OAIG;IACH,YAFY,MAAM,CAIjB;IAUD;;;OAGG;IACH,qBAFW,MAAM,EAQhB;IAlBD;;;OAGG;IACH,qBAFa,MAAM,CAIlB;IAcD,wBAgBC;IAED;;;;OAIG;IACH,uBA6BC;IAED;;OAEG;IACH,aAIC;IAED;;;OAGG;IACH,iBAFa,MAAM,CAqDlB;IAED;;;;OAIG;IACH,iBAFW,MAAM,QAMhB;IAED;;;;OAIG;IACH,iBAHW,MAAM,GACJ,OAAO,CAOnB;IAED;;;;OAIG;IACH,uBAHW,MAAM,GACJ,MAAM,CAKlB;IAED;;;;OAIG;IACH,uBAHW,MAAM,SACN,MAAM,QAOhB;IAED;;;;OAIG;IACH,oBAHW,MAAM,GACJ,MAAM,CAKlB;IAED;;;;OAIG;IACH,sBAHW,MAAM,UACN,MAAM,QAIhB;IAED;;;;OAIG;IACH,oBAHW,MAAM,GACJ,MAAM,CAKlB;IAED;;;;OAIG;IACH,sBAHW,MAAM,UACN,MAAM,QAIhB;IAED;;;;OAIG;IACH,oBAHW,MAAM,GACJ,MAAM,CAKlB;IAED;;;;OAIG;IACH,sBAHW,MAAM,UACN,MAAM,QAIhB;IAGD;;;;OAIG;IACH,oBAHW,MAAM,GACJ,MAAM,CAKlB;IAED;;;;OAIG;IACH,oBAHW,MAAM,UACN,MAAM,QAKhB;IAED;;;;OAIG;IACH,kBAHW,MAAM,UACN,MAAM,EAAE,GAAC,YAAY,QAe/B;IAED;;;;OAIG;IACH,kBAHW,MAAM,QACN,MAAM,EAAE,GAAC,SAAS,CAAC,MAAM,CAAC,GAAC,KAAK,QAsB1C;IAED;;;;OAIG;IACH,mBAHW,MAAM,QACN,MAAM,EAAE,QAWlB;IAED;;;;;;;;;OASG;IACH,4BARW,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,QAmBhB;IAED;;;;OAIG;IACH,0BAHW,MAAM,GACJ,MAAM,CAoBlB;IAED;;;;;OAKG;IACH,wCAJW,MAAM,WACN,MAAM,GACJ,MAAM,CAoClB;IAED;;;;;OAKG;IACH,oCAJW,MAAM,WACN,MAAM,WACN,MAAM,QAgBhB;IAED;;;;OAIG;IACH,kBAHW,MAAM,GACJ,IAAI,CA0GhB;IAED;;;;;OAKG;IACH,wBAqBC;IAED;;;;OAIG;IACH,yBA4BC;IAED;;;;OAIG;IACH,kBAHW,MAAM,GACJ,IAAI,CA6ChB;IAED;;;;;;OAMG;IACH,gBAoMC;IAED;;;;;;OAMG;IACH,6BAJW,MAAM,WACN,MAAM,WACN,MAAM,QAMhB;IAED;;;;;;;OAOG;IACH,kCAJW,MAAM,WACN,MAAM,WACN,MAAM,QAmBhB;IAED;;;OAGG;IACH,oBAIC;IAED;;;;OAIG;IACH,8BAFW,GAAC,QAgCX;IAED;;;;;OAKG;IACH,+BAJW,MAAM,EAAE,sBACR,MAAM,GACJ,MAAM,CAWlB;IAED;;;;;OAKG;IACH,0BA6BC;IAED;;;;;OAKG;IACH,cAJW,MAAM,KACN,MAAM,GACJ,OAAO,CAsCnB;CACJ"}

package/src/core/bvh2/bvh3/BVH.js

@@ -1053,14 +1053,30 @@ export class BVH {
     node_assign_children(parent, child_1, child_2) {
         this.node_set_combined_aabb(parent, child_1, child_2);
 
-        this.node_set_child1(parent, child_1);
-        this.node_set_child2(parent, child_2);
+        this.node_assign_children_only(parent, child_1, child_2);
+    }
+
+    /**
+     * Utility method for assigning both children at once
+     * Children must be valid nodes (non-null)
+     * Does not update bounds.
+     * @param {number} parent
+     * @param {number} child_1
+     * @param {number} child_2
+     */
+    node_assign_children_only(parent, child_1, child_2) {
+        assert.isNonNegativeInteger(parent, 'parent');
+        assert.isNonNegativeInteger(child_1, 'child_1');
+        assert.isNonNegativeInteger(child_2, 'child_2');
 
         this.node_set_parent(child_1, parent);
         this.node_set_parent(child_2, parent);
 
+        this.node_set_child1(parent, child_1);
+        this.node_set_child2(parent, child_2);
+
         this.node_set_height(parent,
-            1+ Math.max(
+            1 + Math.max(
                 this.node_get_height(child_1),
                 this.node_get_height(child_2),
             )

package/src/core/bvh2/bvh3/ebvh_build_for_geometry_morton.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"ebvh_build_for_geometry_morton.d.ts","sourceRoot":"","sources":["../../../../../src/core/bvh2/bvh3/ebvh_build_for_geometry_morton.js"],"names":[],"mappings":"AAYA;;;;;;;;;GASG;AACH,oDAPW,GAAG,eACH,MAAM,EAAE,GAAC,WAAW,GAAC,WAAW,kBAChC,MAAM,EAAE,GAAC,YAAY,GAAC,YAAY,iBAClC,WAAW,WACX,KAAK,YACL,MAAM,QAsHhB;sBAvIqB,6BAA6B"}
+{"version":3,"file":"ebvh_build_for_geometry_morton.d.ts","sourceRoot":"","sources":["../../../../../src/core/bvh2/bvh3/ebvh_build_for_geometry_morton.js"],"names":[],"mappings":"AAWA;;;;;;;;;GASG;AACH,oDAPW,GAAG,eACH,MAAM,EAAE,GAAC,WAAW,GAAC,WAAW,kBAChC,MAAM,EAAE,GAAC,YAAY,GAAC,YAAY,iBAClC,WAAW,WACX,KAAK,YACL,MAAM,QAsHhB;sBAtIqB,6BAA6B"}

package/src/core/bvh2/bvh3/ebvh_build_for_geometry_morton.js

@@ -8,7 +8,6 @@ import { max2 } from "../../math/max2.js";
 import { build_triangle_morton_codes } from "./build_triangle_morton_codes.js";
 import { COLUMN_CHILD_1, COLUMN_HEIGHT, COLUMN_USER_DATA, ELEMENT_WORD_COUNT, NULL_NODE } from "./BVH.js";
 import { ebvh_build_hierarchy } from "./ebvh_build_hierarchy.js";
-import { ebvh_nodes_sort_sah_local4 } from "./ebvh_nodes_sort_sah_local4.js";
 
 /**
  * Build the BVH bottom-up using spatial hash sorting

package/src/core/bvh2/bvh3/ebvh_build_hierarchy_radix.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"ebvh_build_hierarchy_radix.d.ts","sourceRoot":"","sources":["../../../../../src/core/bvh2/bvh3/ebvh_build_hierarchy_radix.js"],"names":[],"mappings":"AA0MA;;;;;;;;GAQG;AACH,gDAPW,GAAG,cACH,MAAM,EAAE,GAAC,WAAW,uBACpB,MAAM,EAAE,cACR,MAAM,kBACN,MAAM,EAAE,GACN,MAAM,CAiElB"}
+{"version":3,"file":"ebvh_build_hierarchy_radix.d.ts","sourceRoot":"","sources":["../../../../../src/core/bvh2/bvh3/ebvh_build_hierarchy_radix.js"],"names":[],"mappings":"AA4MA;;;;;;;;GAQG;AACH,gDAPW,GAAG,cACH,MAAM,EAAE,GAAC,WAAW,uBACpB,MAAM,EAAE,cACR,MAAM,kBACN,MAAM,EAAE,GACN,MAAM,CAqElB"}

package/src/core/bvh2/bvh3/ebvh_build_hierarchy_radix.js

@@ -2,6 +2,7 @@ import { assert } from "../../assert.js";
 import { clz32 } from "../../binary/clz32.js";
 import { clamp } from "../../math/clamp.js";
 import { NULL_NODE } from "./BVH.js";
+import { ebvh_update_hierarchy_bounds } from "./ebvh_update_hierarchy_bounds.js";
 
 /**
  *
@@ -57,10 +58,10 @@ function find_split(
 
 /**
  *
- * @param indexA
- * @param indexB
- * @param elementCount
- * @param mortonCodes
+ * @param {number} indexA
+ * @param {number} indexB
+ * @param {number} elementCount
+ * @param {number[]} mortonCodes
  * @return {number}
  * @see https://github.com/turanszkij/WickedEngine/blob/506749de321c2ab66fd33fbe41efb95afbbb7ff8/WickedEngine/shaders/bvh_hierarchyCS.hlsl#L28C1-L48C2
  */
@@ -122,6 +123,7 @@ function determineRangeW(output, sortedMortonCodes, numTriangles, idx) {
 
 }
 
+
 /**
  * @see https://github.com/mbartling/cuda-bvh/blob/7f2f98d9d29956c3559632e59104ba66f31f80b8/kernels/bvh.cu#L276C1-L352C2
  * @param {number[]|Uint32Array} output
@@ -227,7 +229,8 @@ export function ebvh_build_hierarchy_radix(
     const range = new Uint32Array(2);
 
     // Construct internal nodes.
-    for (let idx = 0; idx < leaf_count - 1; idx++) // in parallel
+    const intermediate_node_count = leaf_count - 1;
+    for (let idx = 0; idx < intermediate_node_count; idx++) // in parallel
     {
         // Find out which range of objects the node corresponds to.
         // (This is where the magic happens!)
@@ -263,7 +266,7 @@ export function ebvh_build_hierarchy_radix(
         // Record parent-child relationships.
         const parent = internal_nodes[idx];
 
-        bvh.node_assign_children(parent, childA, childB);
+        bvh.node_assign_children_only(parent, childA, childB);
     }
 
     // Node 0 is the root.
@@ -271,5 +274,8 @@ export function ebvh_build_hierarchy_radix(
 
     bvh.node_set_parent(root, NULL_NODE);
 
+    // update bounds
+    ebvh_update_hierarchy_bounds(bvh, root);
+
     return root;
 }

package/src/core/bvh2/bvh3/ebvh_update_hierarchy_bounds.d.ts

@@ -0,0 +1,8 @@
+/**
+ * Traverses the tree bottom-up, updating bounds as it goes
+ * @param {BVH} bvh
+ * @param {number} root
+ * @returns {void}
+ */
+export function ebvh_update_hierarchy_bounds(bvh: BVH, root?: number): void;
+//# sourceMappingURL=ebvh_update_hierarchy_bounds.d.ts.map

package/src/core/bvh2/bvh3/ebvh_update_hierarchy_bounds.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ebvh_update_hierarchy_bounds.d.ts","sourceRoot":"","sources":["../../../../../src/core/bvh2/bvh3/ebvh_update_hierarchy_bounds.js"],"names":[],"mappings":"AAOA;;;;;GAKG;AACH,kDAJW,GAAG,SACH,MAAM,GACJ,IAAI,CAuIhB"}

package/src/core/bvh2/bvh3/ebvh_update_hierarchy_bounds.js

@@ -0,0 +1,147 @@
+import { assert } from "../../assert.js";
+import { NULL_NODE } from "./BVH.js";
+
+const CAME_FROM_TYPE_PARENT = 0;
+const CAME_FROM_TYPE_CHILD_1 = 1;
+const CAME_FROM_TYPE_CHILD_2 = 2;
+
+/**
+ * Traverses the tree bottom-up, updating bounds as it goes
+ * @param {BVH} bvh
+ * @param {number} root
+ * @returns {void}
+ */
+export function ebvh_update_hierarchy_bounds(bvh, root = bvh.root) {
+    assert.isNonNegativeInteger(root, 'root');
+
+    if (root === NULL_NODE) {
+        // special case
+        return;
+    }
+
+    if (bvh.node_is_leaf(root)) {
+        // special case
+        return;
+    }
+
+    // we traverse depth-first using stack-less scheme
+    let came_from_node = root;
+
+    let came_from_type = CAME_FROM_TYPE_PARENT;
+
+    let node = bvh.node_get_child1(came_from_node);
+    if (node === NULL_NODE) {
+        node = bvh.node_get_child2(came_from_node);
+    }
+
+    if (node === NULL_NODE) {
+        // no children, done
+        return;
+    }
+
+    // do a stackless traversal
+    while (true) {
+
+
+        if (
+            came_from_type === CAME_FROM_TYPE_CHILD_2
+        ) {
+            // moving up last time, lets calculate
+            const child_1 = bvh.node_get_child1(node);
+            const child_2 = bvh.node_get_child2(node);
+
+            bvh.node_set_combined_aabb(node, child_1, child_2);
+        }
+
+        // only add to treelet when traversing up, not down
+
+        if (bvh.node_is_leaf(node)) {
+
+            assert.equal(came_from_type, CAME_FROM_TYPE_PARENT);
+
+            const parent = came_from_node;
+            const parent_child_1 = bvh.node_get_child1(parent);
+
+            if (parent_child_1 === node) {
+                came_from_type = CAME_FROM_TYPE_CHILD_1;
+            } else {
+                came_from_type = CAME_FROM_TYPE_CHILD_2;
+            }
+
+            came_from_node = node;
+
+            node = parent;
+        } else if (came_from_type === CAME_FROM_TYPE_CHILD_2) {
+            // finishing traversal of this branch
+            came_from_node = node;
+            const parent = bvh.node_get_parent(node);
+
+            if (bvh.node_get_child1(parent) === node) {
+                came_from_type = CAME_FROM_TYPE_CHILD_1;
+            } else {
+                came_from_type = CAME_FROM_TYPE_CHILD_2;
+            }
+
+            if (node === root) {
+                // traversed all the way back up
+                break;
+            }
+
+            node = parent;
+
+        } else if (came_from_type === CAME_FROM_TYPE_CHILD_1) {
+            // traversing up from left child
+            const child2 = bvh.node_get_child2(node);
+
+            came_from_node = node;
+
+            if (child2 === NULL_NODE) {
+                // no right child, finish this branch
+                came_from_type = CAME_FROM_TYPE_CHILD_2; // indicate end
+
+                node = bvh.node_get_parent(node);
+            } else {
+                came_from_type = CAME_FROM_TYPE_PARENT;
+                node = child2;
+            }
+
+        } else if (came_from_type === CAME_FROM_TYPE_PARENT) {
+            const child1 = bvh.node_get_child1(node);
+            const child2 = bvh.node_get_child1(node);
+
+            if (child1 !== NULL_NODE) {
+                came_from_type = CAME_FROM_TYPE_PARENT;
+                came_from_node = node;
+                node = child1;
+            } else if (child2 !== NULL_NODE) {
+                came_from_type = CAME_FROM_TYPE_PARENT;
+                came_from_node = node;
+                node = child2;
+            } else {
+                // this should not happen, as this would mean that node is empty and completely pointless
+                // we remove the node and traverse up
+
+
+                const parent_child1 = bvh.node_get_child1(came_from_node);
+
+                bvh.release_node(node);
+
+                if (parent_child1 === node) {
+                    // we are left child
+                    bvh.node_set_child1(came_from_node, NULL_NODE);
+                    came_from_node = NULL_NODE;
+                    came_from_type = CAME_FROM_TYPE_CHILD_1;
+                } else {
+                    bvh.node_set_child2(came_from_node, NULL_NODE);
+                    came_from_node = NULL_NODE;
+                    came_from_type = CAME_FROM_TYPE_CHILD_2;
+                }
+
+                node = came_from_node;
+            }
+
+
+        }
+
+    }
+}

package/src/core/geom/Vector1.d.ts

@@ -1,35 +1,177 @@
-import Signal from "../events/signal/Signal";
-
-export default class Vector1 {
-    x: number
-
-    0: number
-
-    readonly onChanged: Signal<number,number>
-
-    constructor()
-
-    constructor(x: number)
-
-    set(v: number) : void
-
-    getValue(): number
-
-    _add(v: number): void
-
-    _sub(v: number): void
-
-    isZero(): boolean
-
-    process(callback: (x) => any): void
-
-    toJSON(): any
-
-    fromJSON(j: any): void
-
-    readFromArray(array: ArrayLike<number>, offset?: number): void
-
-    writeToArray(array: ArrayLike<number>, offset?: number): void
-
-    asArray(): number[]
-}
+/**
+ * @author Alex Goldring
+ * @copyright Company Named Limited (c) 2025
+ */
+export class Vector1 extends Number {
+    /**
+     *
+     * @param {Vector1} a
+     * @param {Vector1} b
+     * @return {number}
+     */
+    static compare(a: Vector1, b: Vector1): number;
+    /**
+     *
+     * @param {number} [x=0]
+     * @constructor
+     * @class
+     * @property {number} x
+     */
+    constructor(x?: number);
+    x: number;
+    onChanged: Signal<any, any, any, any, any, any, any, any>;
+    /**
+     *
+     * @returns {string}
+     */
+    toString(): string;
+    /**
+     * Currently held value
+     * @returns {number}
+     */
+    getValue(): number;
+    /**
+     * Useful for sorting
+     * @param {Vector1} other
+     * @returns {number}
+     */
+    compareTo(other: Vector1): number;
+    /**
+     *
+     * @param {number} x
+     * @returns {Vector1}
+     */
+    set(x: number): Vector1;
+    /**
+     * Set value without triggering {@link #onChanged} signal
+     * @param {number} x
+     */
+    setSilent(x: number): void;
+    /**
+     *
+     * @return {boolean}
+     */
+    isZero(): boolean;
+    /**
+     * Increase value by 1.
+     * `value++`
+     */
+    increment(): void;
+    /**
+     * Decrease value by 1.
+     * `value--`
+     */
+    decrement(): void;
+    /**
+     *
+     * @param {Number} v
+     * @return {Vector1}
+     */
+    _add(v: number): Vector1;
+    /**
+     *
+     * @param {Vector1|Vector2|Vector3|Vector4} other
+     */
+    add(other: Vector1 | Vector2 | Vector3 | Vector4): Vector1;
+    /**
+     *
+     * @param {Number} v
+     * @return {Vector1}
+     */
+    _sub(v: number): Vector1;
+    /**
+     *
+     * @param {Vector1} other
+     * @returns {Vector1}
+     */
+    sub(other: Vector1): Vector1;
+    /**
+     *
+     * @param {Vector1} other
+     * @returns {Vector1}
+     */
+    multiply(other: Vector1): Vector1;
+    /**
+     *
+     * @param {number} v
+     */
+    multiplyScalar(v: number): void;
+    /**
+     *
+     * @param {number} low
+     * @param {number} high
+     * @returns {Vector1}
+     */
+    clamp(low: number, high: number): Vector1;
+    /**
+     * Negate sign of the value, if value is 7, it will become -7 and vice versa
+     * Zero is unaffected
+     */
+    negate(): void;
+    /**
+     *
+     * @param {Vector1|Vector2|Vector3|Vector4} other
+     */
+    copy(other: Vector1 | Vector2 | Vector3 | Vector4): void;
+    /**
+     *
+     * @returns {Vector1}
+     */
+    clone(): Vector1;
+    /**
+     *
+     * @param {Vector1} other
+     * @returns {boolean}
+     */
+    equals(other: Vector1): boolean;
+    /**
+     * @returns {number}
+     */
+    hash(): number;
+    /**
+     *
+     * @param {function(newValue:number, oldValue:number)} handler
+     */
+    process(handler: any): void;
+    toJSON(): number;
+    fromJSON(val: any): void;
+    /**
+     *
+     * @param {number[]} array
+     * @param {number} offset
+     */
+    readFromArray(array: number[], offset?: number): void;
+    /**
+     *
+     * @param {number[]} array
+     * @param {number} offset
+     */
+    writeToArray(array: number[], offset?: number): void;
+    asArray(): number[];
+    /**
+     *
+     * @param {BinaryBuffer} buffer
+     */
+    toBinaryBuffer(buffer: BinaryBuffer): void;
+    /**
+     *
+     * @param {BinaryBuffer} buffer
+     */
+    fromBinaryBuffer(buffer: BinaryBuffer): void;
+    set 0(v: number);
+    get 0(): number;
+    /**
+     * @readonly
+     * @type {boolean}
+     */
+    readonly isVector1: boolean;
+    [Symbol.iterator](): Generator<number, void, unknown>;
+}
+export namespace Vector1 {
+    let typeName: string;
+    let zero: Vector1;
+    let one: Vector1;
+}
+export default Vector1;
+import Signal from "../events/signal/Signal.js";
+//# sourceMappingURL=Vector1.d.ts.map

package/src/core/graph/Edge.d.ts

@@ -12,7 +12,6 @@ export class Edge<N> {
      * @template N
      * @param {N} a
      * @param {N} b
-     * @constructor
      */
     constructor(a: N_1, b: N_1);
     /**

package/src/core/graph/Edge.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"Edge.d.ts","sourceRoot":"","sources":["../../../../src/core/graph/Edge.js"],"names":[],"mappings":"gCAKU,MAAM;;;;;;AAQhB;;GAEG;AACH,kBAFa,CAAC;IAGV;;;;;OAKG;IACH,eAJW,GAAC,KACD,GAAC,EAsBX;IAfG;;;OAGG;IACH,OAFU,GAAC,CAEG;IACd;;;OAGG;IACH,QAFU,GAAC,CAEI;IAEf;;OAEG;IACH,WAFU,iBAAiB,CAEkB;IAGjD;;;;OAIG;IACH,eAHW,CAAC,GACA,OAAO,CAIlB;IAED;;;;;OAKG;IACH,2BAJW,CAAC,UACD,CAAC,GACC,OAAO,CASnB;IAED;;;;OAIG;IACH,YAHW,CAAC,GACC,CAAC,CAIb;IAED;;;OAGG;IACH,sBAFa,OAAO,CAInB;IAED;;;OAGG;IACH,uBAFa,OAAO,CAInB;IAED;;;;OAIG;IACH,wBAHW,CAAC,GACC,OAAO,CAKnB;IAED;;;;OAIG;IACH,yBAHW,CAAC,GACC,OAAO,CAKnB;IAED;;;OAGG;IACH,aAFa,CAAC,EAAE,CAIf;IAED,mBAEC;IAIL;;;OAGG;IACH,QAFU,OAAO,CAEI;CANpB"}
+{"version":3,"file":"Edge.d.ts","sourceRoot":"","sources":["../../../../src/core/graph/Edge.js"],"names":[],"mappings":"gCAKU,MAAM;;;;;;AAQhB;;GAEG;AACH,kBAFa,CAAC;IAGV;;;;OAIG;IACH,eAHW,GAAC,KACD,GAAC,EAsBX;IAhBG;;;OAGG;IACH,OAFU,GAAC,CAEG;IAEd;;;OAGG;IACH,QAFU,GAAC,CAEI;IAEf;;OAEG;IACH,WAFU,iBAAiB,CAEkB;IAGjD;;;;OAIG;IACH,eAHW,CAAC,GACA,OAAO,CAIlB;IAED;;;;;OAKG;IACH,2BAJW,CAAC,UACD,CAAC,GACC,OAAO,CASnB;IAED;;;;OAIG;IACH,YAHW,CAAC,GACC,CAAC,CAIb;IAED;;;OAGG;IACH,sBAFa,OAAO,CAInB;IAED;;;OAGG;IACH,uBAFa,OAAO,CAInB;IAED;;;;OAIG;IACH,wBAHW,CAAC,GACC,OAAO,CAKnB;IAED;;;;OAIG;IACH,yBAHW,CAAC,GACC,OAAO,CAKnB;IAED;;;OAGG;IACH,aAFa,CAAC,EAAE,CAIf;IAED,mBAEC;IAIL;;;OAGG;IACH,QAFU,OAAO,CAEI;CANpB"}

package/src/core/graph/Edge.js

@@ -19,7 +19,6 @@ export class Edge {
      * @template N
      * @param {N} a
      * @param {N} b
-     * @constructor
      */
     constructor(a, b) {
         assert.defined(a, 'a');
@@ -30,6 +29,7 @@ export class Edge {
          * @type {N}
          */
         this.first = a;
+
         /**
          *
          * @type {N}

package/src/core/graph/v2/Graph.d.ts

@@ -1,4 +1,7 @@
 /**
+ * Graph structure, consisting of nodes(vertices) and directed edges.
+ * @see https://en.wikipedia.org/wiki/Graph_(discrete_mathematics)
+ * @see https://en.wikipedia.org/wiki/Graph_(abstract_data_type)
  * @template N
  */
 export class Graph<N> {
@@ -55,9 +58,13 @@ export class Graph<N> {
      * @param {*} [thisArg]
      */
     traverseNodes(visitor: (arg0: N) => any, thisArg?: any): void;
+    /**
+     * Number of nodes in the graph
+     * @return {number}
+     */
     get nodeCount(): number;
     /**
-     *
+     * @deprecated use {@link nodeCount} property instead
      * @returns {number}
      */
     getNodeCount(): number;
@@ -65,11 +72,13 @@ export class Graph<N> {
      *
      * @param {function(N):boolean} filter
      * @param {*} [thisArg]
-     * @returns {N|undefined}
+     * @returns {N|undefined} first node that is matched by the filter
      */
     findNode(filter: (arg0: N) => boolean, thisArg?: any): N | undefined;
     /**
-     *
+     * Access internal representation of a node.
+     * Useful for performance optimization.
+     * Do not modify obtained value.
      * @param {N} node
      * @returns {NodeContainer<N>|undefined}
      */
@@ -96,24 +105,25 @@ export class Graph<N> {
      */
     getEdges(): Set<Edge<N>>;
     /**
-     *
+     * Introduce a new edge into the graph. Nodes must already be a part of the graph.
      * @param {N} source
      * @param {N} target
      * @param {EdgeDirectionType} [direction] Undirected by default
      * @returns {Edge<N>}
+     * @throws {Error} if one or both nodes are not part of the graph
      */
     createEdge(source: N, target: N, direction?: EdgeDirectionType): Edge<N>;
     /**
      * Both nodes that the edge is attached to must be present
      * @param {Edge<N>} edge
      * @returns {boolean} true if edge was added, false if edge was already present
-     * @throws if one or both nodes are not contained in the graph
+     * @throws {Error} if one or both nodes are not contained in the graph
      */
     addEdge(edge: Edge<N>): boolean;
     /**
      *
      * @param {Edge<N>} edge
-     * @returns {boolean}
+     * @returns {boolean} true if edge was removed, false if edge was not found
      */
     removeEdge(edge: Edge<N>): boolean;
     /**
@@ -128,9 +138,14 @@ export class Graph<N> {
      * @param {*} [thisArg]
      */
     traverseEdges(visitor: (arg0: Edge<N>) => any, thisArg?: any): void;
+    /**
+     * Number of edges in the graph
+     * @return {number}
+     */
     get edgeCount(): number;
     /**
-     *
+     * checks if there is an edge between two given nodes.
+     * Direction is ignored.
      * @param {N} a
      * @param {N} b
      * @returns {boolean}
@@ -152,9 +167,9 @@ export class Graph<N> {
     getAnyDirectedEdge(from: N, to: N): Edge<N> | undefined;
     /**
      *
-     * @param {Edge<N>[]} result
+     * @param {Edge<N>[]} result found edges will be put here
      * @param {N} node
-     * @returns {number}
+     * @returns {number} number of edges found
      */
     getAttachedEdges(result: Edge<N>[], node: N): number;
     /**

package/src/core/graph/v2/Graph.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"Graph.d.ts","sourceRoot":"","sources":["../../../../../src/core/graph/v2/Graph.js"],"names":[],"mappings":"AAyBA;;GAEG;AACH,mBAFa,CAAC;IAIV;;;;;OAKG;IACH,yBAAoB;IACpB;;;;;OAKG;IACH,yBAAoB;IAEpB;;OAEG;IACH;QACI;;WAEG;mBADO,MAAM,CAAC,CAAC,EAAC,IAAI,CAAC;QAGxB;;WAEG;qBADO,MAAM,CAAC,CAAC,EAAC,IAAI,CAAC;;;MAK1B;IAGF;;;;OAIG;IACH,cAHW,CAAC,GACC,OAAO,CAInB;IAED;;;;OAIG;IACH,cAHW,CAAC,GACC,OAAO,CAenB;IAED;;;;OAIG;IACH,iBAHW,CAAC,GACC,OAAO,CAiBnB;IAED;;;;OAIG;IACH,uBAHW,CAAS,IAAC,EAAD,CAAC,QAAC,YACX,GAAC,QAMX;IAED,wBAEC;IAED;;;OAGG;IACH,gBAFa,MAAM,CAIlB;IAED;;;;;OAKG;IACH,iBAJW,CAAS,IAAC,EAAD,CAAC,KAAE,OAAO,YACnB,GAAC,GACC,CAAC,GAAC,SAAS,CAgBvB;IAED;;;;OAIG;IACH,uBAHW,CAAC,GACC,aAAa,CAAC,CAAC,CAAC,GAAC,SAAS,CAItC;IAED;;;;OAIG;IACH,oBAHW,CAAC,GACA,MAAM,CAUjB;IAED;;;OAGG;IACH,aAFa,CAAC,EAAE,CAIf;IAED;;;OAGG;IACH,YAFY,QAAQ,CAAC,CAAC,CAAC,CAItB;IAED;;;OAGG;IACH,YAFY,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAIvB;IAED;;;;;;OAMG;IACH,mBALW,CAAC,UACD,CAAC,cACD,iBAAiB,GACf,IAAI,CAAC,CAAC,CAAC,CAgBnB;IAED;;;;;OAKG;IACH,cAJW,IAAI,CAAC,CAAC,CAAC,GACL,OAAO,CA4BnB;IAED;;;;OAIG;IACH,iBAHW,IAAI,CAAC,CAAC,CAAC,GACL,OAAO,CAwBnB;IAED;;;;OAIG;IACH,cAHW,IAAI,CAAC,CAAC,CAAC,GACL,OAAO,CAQnB;IAED;;;;OAIG;IACH,uBAHW,CAAS,IAAO,EAAP,IAAI,CAAC,CAAC,CAAC,QAAC,YACjB,GAAC,QAMX;IAED,wBAEC;IAED;;;;;OAKG;IACH,qBAJW,CAAC,KACD,CAAC,GACC,OAAO,CAWnB;IAED;;;;;OAKG;IACH,qBAJW,CAAC,KACD,CAAC,GACC,IAAI,CAAC,CAAC,CAAC,GAAC,SAAS,CAiB7B;IAED;;;;;OAKG;IACH,yBAJW,CAAC,MACD,CAAC,GACC,IAAI,CAAC,CAAC,CAAC,GAAC,SAAS,CAU7B;IAED;;;;;OAKG;IACH,yBAJW,IAAI,CAAC,CAAC,CAAC,EAAE,QACT,CAAC,GACC,MAAM,CA2BlB;IAED;;;;OAIG;IACH,oBAHW,CAAC,GACC,CAAC,EAAE,CAUf;IAED;;;;OAIG;IACH,mBAHW,CAAC,GACC,OAAO,CAYnB;IAED;;;;;OAKG;IACH,gBAJW,CAAC,QACD,CAAC,GACC,IAAI,GAAC,CAAC,EAAE,CA4EpB;IAED;;OAEG;IACH,cAGC;IAED;;;OAGG;IACH,YAFW,KAAK,CAAC,CAAC,CAAC,QAOlB;IAED;;OAEG;IACH,SAFa,KAAK,CAAC,CAAC,CAAC,CAQpB;CACJ;mBAtiBkB,+BAA+B;8BAEpB,oBAAoB;qBADV,YAAY;kCAAZ,YAAY"}
+{"version":3,"file":"Graph.d.ts","sourceRoot":"","sources":["../../../../../src/core/graph/v2/Graph.js"],"names":[],"mappings":"AAyBA;;;;;GAKG;AACH,mBAFa,CAAC;IAIV;;;;;OAKG;IACH,yBAAoB;IAEpB;;;;;OAKG;IACH,yBAAoB;IAEpB;;OAEG;IACH;QACI;;WAEG;mBADO,MAAM,CAAC,CAAC,EAAC,IAAI,CAAC;QAGxB;;WAEG;qBADO,MAAM,CAAC,CAAC,EAAC,IAAI,CAAC;;;MAK1B;IAGF;;;;OAIG;IACH,cAHW,CAAC,GACC,OAAO,CAMnB;IAED;;;;OAIG;IACH,cAHW,CAAC,GACC,OAAO,CAenB;IAED;;;;OAIG;IACH,iBAHW,CAAC,GACC,OAAO,CAkBnB;IAED;;;;OAIG;IACH,uBAHW,CAAS,IAAC,EAAD,CAAC,QAAC,YACX,GAAC,QAMX;IAED;;;OAGG;IACH,iBAFY,MAAM,CAIjB;IAED;;;OAGG;IACH,gBAFa,MAAM,CAIlB;IAED;;;;;OAKG;IACH,iBAJW,CAAS,IAAC,EAAD,CAAC,KAAE,OAAO,YACnB,GAAC,GACC,CAAC,GAAC,SAAS,CAgBvB;IAED;;;;;;OAMG;IACH,uBAHW,CAAC,GACC,aAAa,CAAC,CAAC,CAAC,GAAC,SAAS,CAMtC;IAED;;;;OAIG;IACH,oBAHW,CAAC,GACA,MAAM,CAYjB;IAED;;;OAGG;IACH,aAFa,CAAC,EAAE,CAIf;IAED;;;OAGG;IACH,YAFY,QAAQ,CAAC,CAAC,CAAC,CAItB;IAED;;;OAGG;IACH,YAFY,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAIvB;IAED;;;;;;;OAOG;IACH,mBANW,CAAC,UACD,CAAC,cACD,iBAAiB,GACf,IAAI,CAAC,CAAC,CAAC,CAoBnB;IAED;;;;;OAKG;IACH,cAJW,IAAI,CAAC,CAAC,CAAC,GACL,OAAO,CA4BnB;IAED;;;;OAIG;IACH,iBAHW,IAAI,CAAC,CAAC,CAAC,GACL,OAAO,CAwBnB;IAED;;;;OAIG;IACH,cAHW,IAAI,CAAC,CAAC,CAAC,GACL,OAAO,CAQnB;IAED;;;;OAIG;IACH,uBAHW,CAAS,IAAO,EAAP,IAAI,CAAC,CAAC,CAAC,QAAC,YACjB,GAAC,QAMX;IAED;;;OAGG;IACH,iBAFY,MAAM,CAIjB;IAED;;;;;;OAMG;IACH,qBAJW,CAAC,KACD,CAAC,GACC,OAAO,CAcnB;IAED;;;;;OAKG;IACH,qBAJW,CAAC,KACD,CAAC,GACC,IAAI,CAAC,CAAC,CAAC,GAAC,SAAS,CAmB7B;IAED;;;;;OAKG;IACH,yBAJW,CAAC,MACD,CAAC,GACC,IAAI,CAAC,CAAC,CAAC,GAAC,SAAS,CAc7B;IAED;;;;;OAKG;IACH,yBAJW,IAAI,CAAC,CAAC,CAAC,EAAE,QACT,CAAC,GACC,MAAM,CA2BlB;IAED;;;;OAIG;IACH,oBAHW,CAAC,GACC,CAAC,EAAE,CAYf;IAED;;;;OAIG;IACH,mBAHW,CAAC,GACC,OAAO,CAanB;IAED;;;;;OAKG;IACH,gBAJW,CAAC,QACD,CAAC,GACC,IAAI,GAAC,CAAC,EAAE,CA4EpB;IAED;;OAEG;IACH,cAGC;IAED;;;OAGG;IACH,YAFW,KAAK,CAAC,CAAC,CAAC,QAOlB;IAED;;OAEG;IACH,SAFa,KAAK,CAAC,CAAC,CAAC,CAQpB;CACJ;mBA5kBkB,+BAA+B;8BAEpB,oBAAoB;qBADV,YAAY;kCAAZ,YAAY"}

package/src/core/graph/v2/Graph.js

@@ -24,6 +24,9 @@ function construct_path(goal_node_container, came_from) {
 }
 
 /**
+ * Graph structure, consisting of nodes(vertices) and directed edges.
+ * @see https://en.wikipedia.org/wiki/Graph_(discrete_mathematics)
+ * @see https://en.wikipedia.org/wiki/Graph_(abstract_data_type)
  * @template N
  */
 export class Graph {
@@ -35,6 +38,7 @@ export class Graph {
      * @private
      */
     __nodes = new Map();
+
     /**
      *
      * @type {Set<Edge<N>>}
@@ -66,6 +70,8 @@ export class Graph {
      * @returns {boolean}
      */
     hasNode(node) {
+        assert.defined(node, 'node');
+
         return this.__nodes.has(node);
     }
 
@@ -95,6 +101,7 @@ export class Graph {
      * @returns {boolean}
      */
     removeNode(node) {
+        assert.defined(node, 'node');
 
         const context = this.__nodes.get(node);
         if (context === undefined) {
@@ -122,12 +129,16 @@ export class Graph {
         }
     }
 
+    /**
+     * Number of nodes in the graph
+     * @return {number}
+     */
     get nodeCount() {
         return this.__nodes.size;
     }
 
     /**
-     *
+     * @deprecated use {@link nodeCount} property instead
      * @returns {number}
      */
     getNodeCount() {
@@ -138,7 +149,7 @@ export class Graph {
      *
      * @param {function(N):boolean} filter
      * @param {*} [thisArg]
-     * @returns {N|undefined}
+     * @returns {N|undefined} first node that is matched by the filter
      */
     findNode(filter, thisArg) {
         const nodes = this.__nodes;
@@ -157,11 +168,15 @@ export class Graph {
     }
 
     /**
-     *
+     * Access internal representation of a node.
+     * Useful for performance optimization.
+     * Do not modify obtained value.
      * @param {N} node
      * @returns {NodeContainer<N>|undefined}
      */
     getNodeContainer(node) {
+        assert.defined(node, 'node');
+
         return this.__nodes.get(node);
     }
 
@@ -171,6 +186,8 @@ export class Graph {
      * @return {number}
      */
     getNodeDegree(node) {
+        assert.defined(node, 'node');
+
         const container = this.__nodes.get(node);
 
         if (container === undefined) {
@@ -205,17 +222,21 @@ export class Graph {
     }
 
     /**
-     *
+     * Introduce a new edge into the graph. Nodes must already be a part of the graph.
      * @param {N} source
      * @param {N} target
      * @param {EdgeDirectionType} [direction] Undirected by default
      * @returns {Edge<N>}
+     * @throws {Error} if one or both nodes are not part of the graph
      */
     createEdge(
         source,
         target,
         direction = EdgeDirectionType.Undirected
     ) {
+        assert.defined(source, 'source');
+        assert.defined(target, 'target');
+
         assert.enum(direction, EdgeDirectionType, 'direction');
 
         const edge = new Edge(source, target);
@@ -231,7 +252,7 @@ export class Graph {
      * Both nodes that the edge is attached to must be present
      * @param {Edge<N>} edge
      * @returns {boolean} true if edge was added, false if edge was already present
-     * @throws if one or both nodes are not contained in the graph
+     * @throws {Error} if one or both nodes are not contained in the graph
      */
     addEdge(edge) {
         if (this.hasEdge(edge)) {
@@ -263,7 +284,7 @@ export class Graph {
     /**
      *
      * @param {Edge<N>} edge
-     * @returns {boolean}
+     * @returns {boolean} true if edge was removed, false if edge was not found
      */
     removeEdge(edge) {
         if (!this.hasEdge(edge)) {
@@ -313,21 +334,29 @@ export class Graph {
         }
     }
 
+    /**
+     * Number of edges in the graph
+     * @return {number}
+     */
     get edgeCount() {
         return this.__edges.size;
     }
 
     /**
-     *
+     * checks if there is an edge between two given nodes.
+     * Direction is ignored.
      * @param {N} a
      * @param {N} b
      * @returns {boolean}
      */
     edgeExistsBetween(a, b) {
+        assert.defined(a, 'a');
+        assert.defined(b, 'b');
+
         const context_a = this.__nodes.get(a);
 
         if (context_a === undefined) {
-            // a is not in the graph
+            // 'a' is not in the graph
             return false;
         }
 
@@ -341,6 +370,8 @@ export class Graph {
      * @returns {Edge<N>|undefined}
      */
     getAnyEdgeBetween(a, b) {
+        assert.defined(a, 'a');
+        assert.defined(b, 'b');
 
         const context_a = this.__nodes.get(a);
 
@@ -364,9 +395,13 @@ export class Graph {
      * @returns {Edge<N>|undefined}
      */
     getAnyDirectedEdge(from, to) {
+        assert.defined(from, 'from');
+        assert.defined(to, 'to');
+
         const ctx_a = this.__nodes.get(from);
 
         if (ctx_a === undefined) {
+            // 'from' doesn't exist
             return undefined;
         }
 
@@ -375,9 +410,9 @@ export class Graph {
 
     /**
      *
-     * @param {Edge<N>[]} result
+     * @param {Edge<N>[]} result found edges will be put here
      * @param {N} node
-     * @returns {number}
+     * @returns {number} number of edges found
      */
     getAttachedEdges(result, node) {
         assert.defined(result, 'result');
@@ -412,6 +447,8 @@ export class Graph {
      * @returns {N[]}
      */
     getNeighbours(node) {
+        assert.defined(node, 'node');
+
         const container = this.__nodes.get(node);
 
         if (container === undefined) {
@@ -427,6 +464,7 @@ export class Graph {
      * @returns {boolean}
      */
     nodeHasEdges(node) {
+        assert.defined(node, 'node');
 
         const context = this.__nodes.get(node);
 

package/src/engine/ecs/animation/AnimationClip.d.ts

@@ -43,8 +43,8 @@ export class AnimationClip {
     toJSON(): {
         name: string;
         repeatCount: number;
-        weight: any;
-        timeScale: any;
+        weight: number;
+        timeScale: number;
         flags: number;
     };
     /**

package/src/engine/ecs/fow/FogOfWarRevealer.d.ts

@@ -2,7 +2,7 @@ export class FogOfWarRevealer {
     static fromJSON(j: any): FogOfWarRevealer;
     radius: Vector1;
     toJSON(): {
-        radius: any;
+        radius: number;
     };
     fromJSON({ radius }: {
         radius: any;

package/src/engine/graphics/ecs/water/Water.d.ts

@@ -60,7 +60,7 @@ declare class Water {
     writeShaderUniforms(): void;
     fromJSON(json: any): void;
     toJSON(): {
-        level: any;
+        level: number;
         color: any;
     };
 }

package/src/engine/intelligence/behavior/ecs/WaitForEventBehavior.d.ts

@@ -1,3 +1,7 @@
+/**
+ * Wait for a given entity event via {@link EntityComponentDataset#addEntityEventListener}
+ * No failure condition, will wait forever until the event is detected
+ */
 export class WaitForEventBehavior extends EntityBehavior {
     /**
      *
@@ -11,12 +15,13 @@ export class WaitForEventBehavior extends EntityBehavior {
      */
     event: string;
     /**
-     *
+     * Has the even occurred already?
      * @type {boolean}
      */
     detected: boolean;
     /**
      * Entity to listen event on
+     * If value is negative - will assume value of the entity to which the behavior is bound
      * @type {number}
      */
     target: number;
@@ -25,10 +30,7 @@ export class WaitForEventBehavior extends EntityBehavior {
         target?: number;
     }): void;
     tick(timeDelta: any): BehaviorStatus.Running | BehaviorStatus.Succeeded;
-    /**
-     * @private
-     */
-    private listener;
+    #private;
 }
 export namespace WaitForEventBehavior {
     let typeName: string;

package/src/engine/intelligence/behavior/ecs/WaitForEventBehavior.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"WaitForEventBehavior.d.ts","sourceRoot":"","sources":["../../../../../../src/engine/intelligence/behavior/ecs/WaitForEventBehavior.js"],"names":[],"mappings":"AAIA;IA6BI;;;;OAIG;IACH,4BAFY,oBAAoB,CAQ/B;IArCD;;;OAGG;IACH,OAFU,MAAM,CAEL;IAEX;;;OAGG;IACH,UAFU,OAAO,CAEA;IAEjB;;;OAGG;IACH,QAFU,MAAM,CAEJ;IAGZ;;;aAKC;IAeD,wEAMC;IAED;;OAEG;IACH,iBAIC;CAoBJ;;kBAIS,MAAM;;+BAnFe,qBAAqB;+BADrB,sBAAsB"}
+{"version":3,"file":"WaitForEventBehavior.d.ts","sourceRoot":"","sources":["../../../../../../src/engine/intelligence/behavior/ecs/WaitForEventBehavior.js"],"names":[],"mappings":"AAIA;;;GAGG;AACH;IA6BI;;;;OAIG;IACH,4BAFY,oBAAoB,CAQ/B;IAtCD;;;OAGG;IACH,OAFU,MAAM,CAEL;IAEX;;;OAGG;IACH,UAFU,OAAO,CAEA;IAEjB;;;;OAIG;IACH,QAFU,MAAM,CAEJ;IAEZ;;;aAMC;IAeD,wEAMC;;CA0BJ;;kBAIS,MAAM;;+BApFe,qBAAqB;+BADrB,sBAAsB"}

package/src/engine/intelligence/behavior/ecs/WaitForEventBehavior.js

@@ -2,9 +2,12 @@ import { assert } from "../../../../core/assert.js";
 import { BehaviorStatus } from "../BehaviorStatus.js";
 import { EntityBehavior } from "./EntityBehavior.js";
 
+/**
+ * Wait for a given entity event via {@link EntityComponentDataset#addEntityEventListener}
+ * No failure condition, will wait forever until the event is detected
+ */
 export class WaitForEventBehavior extends EntityBehavior {
 
-
     /**
      * Event name
      * @type {string}
@@ -12,20 +15,21 @@ export class WaitForEventBehavior extends EntityBehavior {
     event = "";
 
     /**
-     *
+     * Has the even occurred already?
      * @type {boolean}
      */
     detected = false;
 
     /**
      * Entity to listen event on
+     * If value is negative - will assume value of the entity to which the behavior is bound
      * @type {number}
      */
-    target = -1;
-
+    target = -1; // TODO replace target with an EntityReference instead for tighter binding
 
     fromJSON({ event, target = -1 }) {
         assert.isString(event, 'event');
+        assert.isInteger(target, 'target');
 
         this.event = event;
         this.target = target;
@@ -52,13 +56,10 @@ export class WaitForEventBehavior extends EntityBehavior {
         return BehaviorStatus.Running;
     }
 
-    /**
-     * @private
-     */
-    listener() {
+    #listener() {
         this.detected = true;
 
-        this.ecd.removeEntityEventListener(this.target, this.event, this.listener, this);
+        this.ecd.removeEntityEventListener(this.target, this.event, this.#listener, this);
     }
 
     initialize(context) {
@@ -67,17 +68,17 @@ export class WaitForEventBehavior extends EntityBehavior {
         //reset detection flag
         this.detected = false;
 
-        if (this.target === -1) {
+        if (this.target < 0) {
             this.target = this.entity;
         }
 
-        this.ecd.addEntityEventListener(this.target, this.event, this.listener, this);
+        this.ecd.addEntityEventListener(this.target, this.event, this.#listener, this);
     }
 
     finalize() {
         super.finalize();
 
-        this.ecd.removeEntityEventListener(this.target, this.event, this.listener, this);
+        this.ecd.removeEntityEventListener(this.target, this.event, this.#listener, this);
     }
 }
 

package/src/engine/intelligence/behavior/util/DelayBehavior.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"DelayBehavior.d.ts","sourceRoot":"","sources":["../../../../../../src/engine/intelligence/behavior/util/DelayBehavior.js"],"names":[],"mappings":"AAIA;;GAEG;AACH;IAuBI;;;;OAIG;IACH,4BAFY,aAAa,CAMxB;IAED;;;;OAIG;IACH,qBAHW,MAAM,GACL,aAAa,CAYxB;IAhDD,cAeC;IAZG;;;OAGG;IACH,OAFU,MAAM,CAEF;IAEd;;;;OAIG;IACH,gBAAgB;IAGpB;;;aAGC;IA8BD,2BAIC;IAED,wEAQC;CACJ;yBAzEwB,gBAAgB;+BACV,sBAAsB"}
+{"version":3,"file":"DelayBehavior.d.ts","sourceRoot":"","sources":["../../../../../../src/engine/intelligence/behavior/util/DelayBehavior.js"],"names":[],"mappings":"AAIA;;GAEG;AACH;IAoBI;;;;OAIG;IACH,4BAFY,aAAa,CAMxB;IAED;;;;OAIG;IACH,qBAHW,MAAM,GACL,aAAa,CAYxB;;IA5CD;;;OAGG;IACH,OAFU,MAAM,CAEN;IAEV;;;;OAIG;IACH,gBAAY;IAEZ;;;aAGC;IA8BD,2BAIC;IAED,wEAQC;CACJ;yBArEwB,gBAAgB;+BACV,sBAAsB"}

package/src/engine/intelligence/behavior/util/DelayBehavior.js

@@ -1,27 +1,24 @@
+import { assert } from "../../../../core/assert.js";
 import { Behavior } from "../Behavior.js";
 import { BehaviorStatus } from "../BehaviorStatus.js";
-import { assert } from "../../../../core/assert.js";
 
 /**
  * Wait for a certain amount of time
  */
 export class DelayBehavior extends Behavior {
-    constructor() {
-        super();
 
-        /**
-         * Delay value in seconds
-         * @type {number}
-         */
-        this.value = 0;
+    /**
+     * Delay value in seconds
+     * @type {number}
+     */
+    value = 0;
 
-        /**
-         * Time elapsed
-         * @private
-         * @type {number}
-         */
-        this.elapsed = 0;
-    }
+    /**
+     * Time elapsed
+     * @private
+     * @type {number}
+     */
+    elapsed = 0;
 
     fromJSON({ value, elapsed = 0 }) {
         this.value = value;

package/src/engine/sound/ecs/emitter/SoundEmitter.d.ts

@@ -193,7 +193,7 @@ export class SoundEmitter {
         isPositioned: boolean;
         isAttenuated: boolean;
         channel: any;
-        volume: any;
+        volume: number;
         tracks: any;
         distanceMin: number;
         distanceMax: number;