@woosh/meep-engine 2.118.5 → 2.118.6

package/package.json

@@ -5,7 +5,7 @@
   "description": "Fully featured ECS game engine written in JavaScript",
   "type": "module",
   "author": "Alexander Goldring",
-  "version": "2.118.5",
+  "version": "2.118.6",
   "main": "build/meep.module.js",
   "module": "build/meep.module.js",
   "exports": {
@@ -62,9 +62,9 @@
     "@rollup/plugin-terser": "0.4.3",
     "@types/jest": "29.5.12",
     "@types/three": "^0.135.0",
-    "babel-jest": "29.5.0",
-    "jest": "29.6.4",
-    "jest-environment-jsdom": "29.6.4",
+    "babel-jest": "29.7.0",
+    "jest": "29.7.0",
+    "jest-environment-jsdom": "29.7.0",
     "jest-junit": "16.0.0",
     "rollup": "3.26.2",
     "typescript": "5.2.2"

package/src/core/binary/BitSet.d.ts

@@ -108,11 +108,6 @@ export class BitSet {
      * @param {number} endIndex clear up to here, excluding this position
      */
     clearRange(startIndex: number, endIndex: number): void;
-    /**
-     *
-     * @param {BitSet} set
-     */
-    and(set: BitSet): void;
     /**
      * Returns the value of the bit with the specified index.
      * @param {int} bitIndex

package/src/core/binary/BitSet.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"BitSet.d.ts","sourceRoot":"","sources":["../../../../src/core/binary/BitSet.js"],"names":[],"mappings":"AAgCA;IAyiBI;;;;OAIG;IACH,oBAHW,MAAM,GACJ,MAAM,CASlB;IApjBD;;;;OAIG;IACH,+BAFW,MAAM,EA8BhB;IAzBG;;;;OAIG;IACH,iBAAiB;IAEjB;;;;OAIG;IACH,mBAA4C;IAE5C;;;;OAIG;IACH,sBAA0D;IAE1D;;OAEG;IACH,gBAFU,MAAM,CAEmB;IAGvC,sBAEC;IAED;;;OAGG;IACH,mBAFW,MAAM,QAOhB;IAED;;;OAGG;IACH,uBAFW,MAAM,QAUhB;IAED;;;OAGG;IACH,QAFa,MAAM,CAIlB;IAED;;;OAGG;IACH,YAFa,MAAM,CAIlB;IAED;;;;OAIG;IACH,iBAsBC;IAED,uBAMC;IAED;;;;OAIG;IACH,oBAyBC;IAED;;;;OAIG;IACH,oCAqCC;IAED;;;;OAIG;IACH,4BAFa,MAAM,CAuDlB;IAED;;;;OAIG;IACH,8BAFa,MAAM,CAkDlB;IAED;;;;OAIG;IACH,2BAFW,OAAO,QAmCjB;IAED;;;OAGG;IACH,2BAEC;IAED;;;;OAIG;IACH,qBAHW,MAAM,YACN,MAAM,QAWhB;IAED;;;;OAIG;IACH,uBAHW,MAAM,YACN,MAAM,QAShB;IAED;;;OAGG;IACH,SAFW,MAAM,QAIhB;IAED;;;;OAIG;IACH,oBAFa,OAAO,CAkBnB;IAED;;;;OAIG;IACH,iBAHW,MAAM,GACJ,OAAO,CAUnB;IAED;;;;OAIG;IACH,mBAHW,MAAM,GACJ,OAAO,CAUnB;IAED;;;;;OAKG;IACH,sBAJW,MAAM,eACN,MAAM,aACN,MAAM,QAShB;IAED;;;;;OAKG;IACH,qBAJW,MAAM,eACN,MAAM,aACN,MAAM,QAShB;IAED;;;;;OAKG;IACH,gBAJW,MAAM,eACN,MAAM,aACN,MAAM,QAQhB;IAED;;OAEG;IACH,cAgBC;IAED;;;OAGG;IACH,YAFW,MAAM,QAoChB;CAeJ"}
+{"version":3,"file":"BitSet.d.ts","sourceRoot":"","sources":["../../../../src/core/binary/BitSet.js"],"names":[],"mappings":"AAgCA;IAiiBI;;;;OAIG;IACH,oBAHW,MAAM,GACJ,MAAM,CASlB;IA5iBD;;;;OAIG;IACH,+BAFW,MAAM,EA8BhB;IAzBG;;;;OAIG;IACH,iBAAiB;IAEjB;;;;OAIG;IACH,mBAA4C;IAE5C;;;;OAIG;IACH,sBAA0D;IAE1D;;OAEG;IACH,gBAFU,MAAM,CAE2B;IAG/C,sBAEC;IAED;;;OAGG;IACH,mBAFW,MAAM,QAOhB;IAED;;;OAGG;IACH,uBAFW,MAAM,QAUhB;IAED;;;OAGG;IACH,QAFa,MAAM,CAIlB;IAED;;;OAGG;IACH,YAFa,MAAM,CAIlB;IAED;;;;OAIG;IACH,iBAsBC;IAED,uBAMC;IAED;;;;OAIG;IACH,oBAyBC;IAED;;;;OAIG;IACH,oCAqCC;IAED;;;;OAIG;IACH,4BAFa,MAAM,CAuDlB;IAED;;;;OAIG;IACH,8BAFa,MAAM,CAkDlB;IAED;;;;OAIG;IACH,2BAFW,OAAO,QAmCjB;IAED;;;OAGG;IACH,2BAEC;IAED;;;;OAIG;IACH,qBAHW,MAAM,YACN,MAAM,QAWhB;IAED;;;;OAIG;IACH,uBAHW,MAAM,YACN,MAAM,QAShB;IAED;;;;OAIG;IACH,oBAFa,OAAO,CAkBnB;IAED;;;;OAIG;IACH,iBAHW,MAAM,GACJ,OAAO,CAUnB;IAED;;;;OAIG;IACH,mBAHW,MAAM,GACJ,OAAO,CAUnB;IAED;;;;;OAKG;IACH,sBAJW,MAAM,eACN,MAAM,aACN,MAAM,QAShB;IAED;;;;;OAKG;IACH,qBAJW,MAAM,eACN,MAAM,aACN,MAAM,QAShB;IAED;;;;;OAKG;IACH,gBAJW,MAAM,eACN,MAAM,aACN,MAAM,QAQhB;IAED;;OAEG;IACH,cAgBC;IAED;;;OAGG;IACH,YAFW,MAAM,QAoChB;CAeJ"}

package/src/core/binary/BitSet.js

@@ -16,7 +16,7 @@ const GROW_FACTOR = 1.3;
  * @constant
  * @type {number}
  */
-const SHRINK_FACTOR = 0.5;
+const DEFAULT_SHRINK_FACTOR = 0.5;
 
 /**
  * Minimum number of bits to increase the capacity by
@@ -63,7 +63,7 @@ export class BitSet {
         /**
          * @type {number}
          */
-        this.__shrinkFactor = SHRINK_FACTOR;
+        this.__shrinkFactor = DEFAULT_SHRINK_FACTOR;
     }
 
     preventShrink() {
@@ -417,14 +417,6 @@ export class BitSet {
         }
     }
 
-    /**
-     *
-     * @param {BitSet} set
-     */
-    and(set) {
-        throw new Error("NIY");
-    }
-
     /**
      * Returns the value of the bit with the specified index.
      * @param {int} bitIndex

package/src/core/binary/base64/Base64.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"Base64.d.ts","sourceRoot":"","sources":["../../../../../src/core/binary/base64/Base64.js"],"names":[],"mappings":"AAgOA;IACI;;;;OAIG;IACH,qBAHW,WAAW,GACT,MAAM,CAOlB;IAED;;;;OAIG;IACH,qBAHW,MAAM,GACJ,WAAW,CAUvB;CACJ"}

package/src/core/binary/largest_common_alignment_uint32.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"largest_common_alignment_uint32.d.ts","sourceRoot":"","sources":["../../../../src/core/binary/largest_common_alignment_uint32.js"],"names":[],"mappings":"AAEA;;;;;;GAMG;AACH,0DALW,MAAM,YACN,MAAM,eACN,MAAM,GACJ,MAAM,CAoBlB"}

package/src/core/{collection/array/typed → binary}/largest_common_alignment_uint32.js

@@ -1,4 +1,4 @@
-import { assert } from "../../../assert.js";
+import { assert } from "../assert.js";
 
 /**
  *

package/src/core/collection/CuckooFilter.d.ts

@@ -13,28 +13,54 @@ export class CuckooFilter {
     constructor({ fpp, maxKeys }?: number);
     /**
      * how many bits are needed per tag
+     * @readonly
      * @type {number}
      */
-    bits_per_tag: number;
-    tag_hash_mask: number;
+    readonly bits_per_tag: number;
+    /**
+     * @readonly
+     * @type {number}
+     */
+    readonly tag_hash_mask: number;
     /**
      * compute how many buckets we'll need
+     * @readonly
      * @type {number}
      */
-    bucket_count: number;
+    readonly bucket_count: number;
     /**
      * Actual data storage
+     * @readonly
      * @type {BitSet}
      */
-    data: BitSet;
+    readonly data: BitSet;
+    /**
+     * @private
+     * @type {number}
+     */
+    private __count;
+    /**
+     *
+     * @type {boolean}
+     * @private
+     */
+    private __victim_exists;
     /**
      *
      * @type {number}
+     * @private
+     */
+    private __victim_tag;
+    /**
+     *
+     * @type {number}
+     * @private
+     */
+    private __victim_index;
+    /**
+     *
+     * @returns {number}
      */
-    __count: number;
-    __victim_exists: boolean;
-    __victim_tag: number;
-    __victim_index: number;
     get count(): number;
     /**
      *

package/src/core/collection/CuckooFilter.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"CuckooFilter.d.ts","sourceRoot":"","sources":["../../../../src/core/collection/CuckooFilter.js"],"names":[],"mappings":"AAqDA;;;;;GAKG;AACH;IACI;;;;OAIG;IACH,+BAHW,MAAM,EA2ChB;IA5BG;;;OAGG;IACH,cAFU,MAAM,CAEgC;IAChD,sBAA8D;IAE9D;;;OAGG;IACH,cAFU,MAAM,CAE8C;IAE9D;;;OAGG;IACH,MAFU,MAAM,CAEQ;IAExB;;;OAGG;IACH,SAFU,MAAM,CAEA;IAEhB,yBAA4B;IAC5B,qBAAqB;IACrB,uBAAuB;IAG3B,oBAEC;IAED;;;;;;OAMG;IACH,uBAEC;IAED;;;;;;;;;OASG;IACH,mBAkBC;IAED;;;;;;OAMG;IACH,yBASC;IAED;;;;;;OAMG;IACH,0BAUC;IAED;;;;;OAKG;IACH,oBAIC;IAED;;;;;;OAMG;IACH,2BAUC;IAED;;;;;;;OAOG;IACH,2BALW,MAAM,kBACN,MAAM,OACN,MAAM,GACJ,MAAM,CAelB;IAED;;;;;;OAMG;IACH,0BALW,MAAM,kBACN,MAAM,OACN,MAAM,GACJ,OAAO,CAanB;IAED;;;;;;;;OAQG;IACH,wBAsBC;IAED;;;;;;;OAOG;IACH,gCAaC;IAED;;;;;OAKG;IACH,yCASC;IAED;;;;;;;;;;OAUG;IACH,mCAIC;IAED;;;;;OAKG;IACH,gCAWC;IAED;;;;;;;;;;;;;;;OAeG;IACH,aAJW,MAAM,GACJ,OAAO,CA8CnB;IAED,+BAcC;IAED;;;;;;;OAOG;IACH,sBAMC;IAED;;;;;;;;;;;;;;;;;OAiBG;IACH,aAJW,MAAM,GACJ,OAAO,CA6BnB;IAGD;;;;;;OAMG;IACH,mBAHW,MAAM,GACJ,OAAO,CAUnB;CACJ;uBA/gBsB,qBAAqB"}
+{"version":3,"file":"CuckooFilter.d.ts","sourceRoot":"","sources":["../../../../src/core/collection/CuckooFilter.js"],"names":[],"mappings":"AAqDA;;;;;GAKG;AACH;IACI;;;;OAIG;IACH,+BAHW,MAAM,EAmEhB;IApDG;;;;OAIG;IACH,uBAFU,MAAM,CAEgC;IAEhD;;;OAGG;IACH,wBAFU,MAAM,CAE8C;IAE9D;;;;OAIG;IACH,uBAFU,MAAM,CAE8C;IAE9D;;;;OAIG;IACH,eAFU,MAAM,CAEQ;IAExB;;;OAGG;IACH,gBAAgB;IAEhB;;;;OAIG;IACH,wBAA4B;IAC5B;;;;OAIG;IACH,qBAAqB;IAErB;;;;OAIG;IACH,uBAAuB;IAG3B;;;OAGG;IACH,oBAEC;IAED;;;;;;OAMG;IACH,uBAEC;IAED;;;;;;;;;OASG;IACH,mBAkBC;IAED;;;;;;OAMG;IACH,yBASC;IAED;;;;;;OAMG;IACH,0BAUC;IAED;;;;;OAKG;IACH,oBAIC;IAED;;;;;;OAMG;IACH,2BAUC;IAED;;;;;;;OAOG;IACH,2BALW,MAAM,kBACN,MAAM,OACN,MAAM,GACJ,MAAM,CAelB;IAED;;;;;;OAMG;IACH,0BALW,MAAM,kBACN,MAAM,OACN,MAAM,GACJ,OAAO,CAanB;IAED;;;;;;;;OAQG;IACH,wBAsBC;IAED;;;;;;;OAOG;IACH,gCAaC;IAED;;;;;OAKG;IACH,yCASC;IAED;;;;;;;;;;OAUG;IACH,mCAIC;IAED;;;;;OAKG;IACH,gCAWC;IAED;;;;;;;;;;;;;;;OAeG;IACH,aAJW,MAAM,GACJ,OAAO,CA8CnB;IAED,+BAcC;IAED;;;;;;;OAOG;IACH,sBAMC;IAED;;;;;;;;;;;;;;;;;OAiBG;IACH,aAJW,MAAM,GACJ,OAAO,CA6BnB;IAGD;;;;;;OAMG;IACH,mBAHW,MAAM,GACJ,OAAO,CAUnB;CACJ;uBA3iBsB,qBAAqB"}

package/src/core/collection/CuckooFilter.js

@@ -77,34 +77,62 @@ export class CuckooFilter {
 
         /**
          * how many bits are needed per tag
+         * @readonly
          * @type {number}
          */
         this.bits_per_tag = computeBitsPerTagForFPP(fpp);
+
+        /**
+         * @readonly
+         * @type {number}
+         */
         this.tag_hash_mask = createMaskFromBitCount(this.bits_per_tag);
 
         /**
          * compute how many buckets we'll need
+         * @readonly
          * @type {number}
          */
         this.bucket_count = computeBucketsNeeded(maxKeys, BUCKET_SIZE);
 
         /**
          * Actual data storage
+         * @readonly
          * @type {BitSet}
          */
         this.data = new BitSet();
 
         /**
-         *
+         * @private
          * @type {number}
          */
         this.__count = 0;
 
+        /**
+         *
+         * @type {boolean}
+         * @private
+         */
         this.__victim_exists = false;
+        /**
+         *
+         * @type {number}
+         * @private
+         */
         this.__victim_tag = 0;
+
+        /**
+         *
+         * @type {number}
+         * @private
+         */
         this.__victim_index = 0;
     }
 
+    /**
+     *
+     * @returns {number}
+     */
     get count() {
         return this.__count;
     }

package/src/core/collection/array/typed/array_buffer_copy.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"array_buffer_copy.d.ts","sourceRoot":"","sources":["../../../../../../src/core/collection/array/typed/array_buffer_copy.js"],"names":[],"mappings":"AAGA;;;;;;;;GAQG;AACH,0CANW,WAAW,iBACX,MAAM,UACN,WAAW,iBACX,MAAM,eACN,MAAM,QA2ChB"}
+{"version":3,"file":"array_buffer_copy.d.ts","sourceRoot":"","sources":["../../../../../../src/core/collection/array/typed/array_buffer_copy.js"],"names":[],"mappings":"AAGA;;;;;;;;GAQG;AACH,0CANW,WAAW,iBACX,MAAM,UACN,WAAW,iBACX,MAAM,eACN,MAAM,QA6ChB"}

package/src/core/collection/array/typed/array_buffer_copy.js

@@ -1,5 +1,5 @@
 import { assert } from "../../../assert.js";
-import { largest_common_alignment_uint32 } from "./largest_common_alignment_uint32.js";
+import { largest_common_alignment_uint32 } from "../../../binary/largest_common_alignment_uint32.js";
 
 /**
  * This is essentially a {@link memcopy} implementation for ArrayBuffers
@@ -18,6 +18,8 @@ export function array_buffer_copy(
     assert.isNonNegativeInteger(source_offset, 'source_offset');
     assert.isNonNegativeInteger(target_offset, 'target_offset');
     assert.isNonNegativeInteger(byte_length, 'byte_length');
+    assert.ok(source instanceof ArrayBuffer || source instanceof SharedArrayBuffer,'source is not an ArrayBuffer');
+    assert.ok(target instanceof ArrayBuffer || target instanceof SharedArrayBuffer,'source is not an ArrayBuffer');
 
     /**
      * @type {Uint8Array|Uint16Array|Uint32Array}

package/src/core/collection/array/typed/is_array_buffer_equals.js

@@ -1,6 +1,6 @@
 import { assert } from "../../../assert.js";
+import { largest_common_alignment_uint32 } from "../../../binary/largest_common_alignment_uint32.js";
 import { isArrayEqualStrict } from "../isArrayEqualStrict.js";
-import { largest_common_alignment_uint32 } from "./largest_common_alignment_uint32.js";
 
 /**
  *

package/src/core/collection/array/typed/is_typed_array_equals.js

@@ -1,6 +1,6 @@
 //
+import { largest_common_alignment_uint32 } from "../../../binary/largest_common_alignment_uint32.js";
 import { isArrayEqualStrict } from "../isArrayEqualStrict.js";
-import { largest_common_alignment_uint32 } from "./largest_common_alignment_uint32.js";
 
 /**
  * Optimized equality method for typed arrays, typically significantly faster than `isArrayEqualStrict`, especially for larger arrays

package/src/core/collection/map/HashMap.js

@@ -358,17 +358,17 @@ export class HashMap {
 
         this.__entries_bound++;
 
-        if (this.__entries[i] !== undefined) {
+        const existing_entry = this.__entries[i];
 
-            // entry exists, let's reuse it
+        if (existing_entry !== undefined) {
 
-            const entry = this.__entries[i];
+            // entry exists, let's reuse it
 
-            assert.equal(entry.hash, RESERVED_HASH, 'Entry is occupied');
+            assert.equal(existing_entry.hash, RESERVED_HASH, 'Entry is occupied');
 
-            entry.hash = hash;
-            entry.key = k;
-            entry.value = v;
+            existing_entry.hash = hash;
+            existing_entry.key = k;
+            existing_entry.value = v;
 
         } else {
 

package/src/core/geom/2d/aabb/AABB2.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"AABB2.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/2d/aabb/AABB2.js"],"names":[],"mappings":";AAYA;;;GAGG;AACH;IACI;;;;;;OAMG;IACH,gEA+BC;IApBG;;;OAGG;IACH,WAAY;IACZ;;;OAGG;IACH,WAAY;IACZ;;;OAGG;IACH,WAAY;IACZ;;;OAGG;IACH,WAAY;IAGhB;;;OAGG;IACH,gBAFW,MAAM,QAQhB;IAED;;;OAGG;IACH,iBAFW,MAAM,QAQhB;IAED;;;OAGG;IACH,WAFW,MAAM,QAMhB;IAED;;;OAGG;IACH,aAFW,MAAM,QAIhB;IAED;;;OAGG;IACH,gBAFW,MAAM,EAAE,QA8BlB;IAED;;;OAGG;IACH,sBAFW,MAAM,QAShB;IAED;;;;;OAKG;IACH,sBAJW,KAAK,UACL,KAAK,GACH,OAAO,CAcnB;IAED;;;;OAIG;IACH,qBAHW,KAAK,GACH,OAAO,CAcnB;IAED;;;;;;;OAOG;IACH,0EAMC;IAED;;;;OAIG;IACH,qBAHW,MAAM,KACN,MAAM,QAKhB;IAED;;;OAGG;IACH,QAFa,MAAM,CAIlB;IAED;;;OAGG;IACH,QAFa,MAAM,CAIlB;IAED;;;;;;OAMG;IACH,0BALW,OAAO,MACP,OAAO,UACP,OAAO,GACL,OAAO,CA0BnB;IAED;;;;OAIG;IACH,kCAHW,OAAO,UACP,OAAO,QAmBjB;IAED;;;;OAIG;IACH,wBAHW,KAAK,GACH,MAAM,CAIlB;IAED;;;;;;;OAOG;IACH,sBANW,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,GACJ,MAAM,CA4BlB;IAED;;;OAGG;IACH,eAFa,MAAM,CASlB;IAED;;;OAGG;IACH,sBAFY,MAAM,CAYjB;IAED;;;;;OAKG;IACH,iBAJW,MAAM,KACN,MAAM,GACJ,OAAO,CAInB;IAED;;;OAGG;IACH,mBAFW,KAAK,QAIf;IAED;;;OAGG;IACH,mBAFW,OAAO,WAMjB;IAED;;;OAGG;IACH,sBAEC;IAED;;;OAGG;IACH,sBAGC;IAED;;;OAGG;IACH,YAFa,MAAM,CAIlB;IAED;;;OAGG;IACH,oBAEC;IAED;;;OAGG;IACH,aAFa,MAAM,CAIlB;IAED;;;OAGG;IACH,qBAEC;IAED;;;;;;;OAOG;IACH,0DAiBC;IAED;;;;OAIG;IACH,eAHW,MAAM,KACN,MAAM,QAOhB;IAED;;;;OAIG;IACH,aAHW,MAAM,UACN,MAAM,QAIhB;IAED;;;OAGG;IACH,SAFa,KAAK,CAIjB;IAED;;;;OAIG;IACH,YAHW,KAAK,GACH,KAAK,CAIjB;IAED;;;;OAIG;IACH,cAHW,KAAK,GACH,OAAO,CAOnB;IAED;;;;;;OAMG;IACH,UALW,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,QAQhB;IAED;;;;;;OAMG;IACH,uBALW,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,QAsBhB;IAED;;OAEG;IACH,oCAEC;IAED,mBAEC;IAED;;;;;MAOC;IAED,0BAEC;CACJ;;;qBAqCS,KAAK;qBAML,KAAK;;oBA1mBK,kBAAkB;AAkkBtC;;;;;;;GAOG;AACH,gDANW,KAAK,MACL,KAAK,MACL,OAAO,MACP,OAAO,GACL,OAAO,CAsBnB"}
+{"version":3,"file":"AABB2.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/2d/aabb/AABB2.js"],"names":[],"mappings":";AAYA;;;GAGG;AACH;IACI;;;;;;OAMG;IACH,gEA+BC;IApBG;;;OAGG;IACH,WAAY;IACZ;;;OAGG;IACH,WAAY;IACZ;;;OAGG;IACH,WAAY;IACZ;;;OAGG;IACH,WAAY;IAGhB;;;OAGG;IACH,gBAFW,MAAM,QAQhB;IAED;;;OAGG;IACH,iBAFW,MAAM,QAQhB;IAED;;;OAGG;IACH,WAFW,MAAM,QAMhB;IAED;;;OAGG;IACH,aAFW,MAAM,QAIhB;IAED;;;OAGG;IACH,gBAFW,MAAM,EAAE,QA8BlB;IAED;;;OAGG;IACH,sBAFW,MAAM,QAShB;IAED;;;;;OAKG;IACH,sBAJW,KAAK,UACL,KAAK,GACH,OAAO,CAcnB;IAED;;;;OAIG;IACH,qBAHW,KAAK,GACH,OAAO,CAcnB;IAED;;;;;;;OAOG;IACH,0EAMC;IAED;;;;OAIG;IACH,qBAHW,MAAM,KACN,MAAM,QAKhB;IAED;;;;;;OAMG;IACH,0BALW,OAAO,MACP,OAAO,UACP,OAAO,GACL,OAAO,CA0BnB;IAED;;;;OAIG;IACH,kCAHW,OAAO,UACP,OAAO,QAmBjB;IAED;;;;OAIG;IACH,wBAHW,KAAK,GACH,MAAM,CAIlB;IAED;;;;;;;OAOG;IACH,sBANW,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,GACJ,MAAM,CA4BlB;IAED;;;OAGG;IACH,eAFa,MAAM,CASlB;IAED;;;OAGG;IACH,sBAFY,MAAM,CAYjB;IAED;;;;;OAKG;IACH,iBAJW,MAAM,KACN,MAAM,GACJ,OAAO,CAInB;IAED;;;OAGG;IACH,mBAFW,KAAK,QAIf;IAED;;;OAGG;IACH,mBAFW,OAAO,WAOjB;IAED;;;;OAIG;IACH,QAFa,MAAM,CAIlB;IAED;;;;OAIG;IACH,QAFa,MAAM,CAIlB;IAED;;;OAGG;IACH,sBAEC;IAED;;;OAGG;IACH,sBAGC;IAED;;;OAGG;IACH,YAFa,MAAM,CAIlB;IAED;;;OAGG;IACH,oBAEC;IAED;;;OAGG;IACH,aAFa,MAAM,CAIlB;IAED;;;OAGG;IACH,qBAEC;IAED;;;;;;;OAOG;IACH,0DAiBC;IAED;;;;OAIG;IACH,eAHW,MAAM,KACN,MAAM,QAOhB;IAED;;;;OAIG;IACH,aAHW,MAAM,UACN,MAAM,QAOhB;IAED;;;OAGG;IACH,SAFa,KAAK,CAIjB;IAED;;;;OAIG;IACH,YAHW,KAAK,GACH,KAAK,CAIjB;IAED;;;;OAIG;IACH,cAHW,KAAK,GACH,OAAO,CAOnB;IAED;;;;;;OAMG;IACH,UALW,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,QAQhB;IAED;;;;;;OAMG;IACH,uBALW,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,QAsBhB;IAED;;OAEG;IACH,oCAEC;IAED,mBAEC;IAED;;;;;MAOC;IAED,0BAEC;IAED;;;;OAIG;IACH,iBAJW,MAAM,EAAE,GAAC,YAAY,WACrB,MAAM,GACJ,MAAM,EAAE,GAAC,YAAY,CAUjC;CACJ;;;qBAqCS,KAAK;qBAML,KAAK;;oBA/nBK,kBAAkB;AAulBtC;;;;;;;GAOG;AACH,gDANW,KAAK,MACL,KAAK,MACL,OAAO,MACP,OAAO,GACL,OAAO,CAsBnB"}

package/src/core/geom/2d/aabb/AABB2.js

@@ -209,22 +209,6 @@ class AABB2 {
         this._expandToFit(x, y, x, y);
     }
 
-    /**
-     * retrieve midpoint of AABB along X axis
-     * @returns {number}
-     */
-    midX() {
-        return (this.x1 + this.x0) / 2;
-    }
-
-    /**
-     * retrieve midpoint of AABB along Y axis
-     * @returns {number}
-     */
-    midY() {
-        return (this.y1 + this.y0) / 2;
-    }
-
     /**
      * NOTE: only 1 intersection point is produced
      * @param {Vector2} p0
@@ -376,16 +360,35 @@ class AABB2 {
 
     /**
      *
-     * @param {Vector2} result
+     * @param {Vector2} [result]
      */
     getCenter(result = new Vector2()) {
+
         result.set(this.centerX, this.centerY);
 
         return result;
     }
 
     /**
-     *
+     * retrieve midpoint of AABB along X axis
+     * @deprecated use {@link centerX} instead
+     * @returns {number}
+     */
+    midX() {
+        return this.centerX;
+    }
+
+    /**
+     * retrieve midpoint of AABB along Y axis
+     * @deprecated use {@link centerY} instead
+     * @returns {number}
+     */
+    midY() {
+        return this.centerY;
+    }
+
+    /**
+     * midpoint along X axis
      * @return {number}
      */
     get centerX() {
@@ -393,7 +396,7 @@ class AABB2 {
     }
 
     /**
-     *
+     * midpoint along Y axis
      * @return {number}
      */
     get centerY() {
@@ -478,7 +481,10 @@ class AABB2 {
      * @param {number} deltaY
      */
     move(deltaX, deltaY) {
-        this.set(this.x0 + deltaX, this.y0 + deltaY, this.x1 + deltaX, this.y1 + deltaY);
+        this.set(
+            this.x0 + deltaX, this.y0 + deltaY,
+            this.x1 + deltaX, this.y1 + deltaY
+        );
     }
 
     /**
@@ -577,6 +583,21 @@ class AABB2 {
     fromJSON(json) {
         this.set(json.x0, json.y0, json.x1, json.y1);
     }
+
+    /**
+     * @param {number[]|Float32Array} target
+     * @param {number} offset
+     * @returns {number[]|Float32Array}
+     */
+    toArray(target=[], offset=0){
+
+        target[offset] = this.x0;
+        target[offset+1] = this.y0;
+        target[offset+2] = this.x1;
+        target[offset+3] = this.y1;
+
+        return target;
+    }
 }
 
 
@@ -590,8 +611,8 @@ class AABB2 {
  */
 function computeLineBetweenTwoBoxes(b0, b1, p0, p1) {
     //compute box centers
-    const c0 = new Vector2(b0.midX(), b0.midY());
-    const c1 = new Vector2(b1.midX(), b1.midY());
+    const c0 = new Vector2(b0.centerX, b0.centerY);
+    const c1 = new Vector2(b1.centerX, b1.centerY);
 
     const i0 = b0.lineIntersectionPoint(c0, c1, p0);
 

package/src/core/geom/2d/aabb/aabb2_compute_center_from_multiple.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"aabb2_compute_center_from_multiple.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/2d/aabb/aabb2_compute_center_from_multiple.js"],"names":[],"mappings":"AAEA;;;;GAIG;AACH,0DAHW,YAAa,GACX,OAAO,CAanB;oBAlBmB,kBAAkB"}
+{"version":3,"file":"aabb2_compute_center_from_multiple.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/2d/aabb/aabb2_compute_center_from_multiple.js"],"names":[],"mappings":"AAEA;;;;GAIG;AACH,0DAHW,YAAa,GACX,OAAO,CAkBnB;oBAvBmB,kBAAkB"}

package/src/core/geom/2d/aabb/aabb2_compute_center_from_multiple.js

@@ -9,10 +9,15 @@ export function aabb2_compute_center_from_multiple(boxes) {
     const numBoxes = boxes.length;
 
     const center = new Vector2();
+
     for (let i = 0; i < numBoxes; i++) {
+
         const box = boxes[i];
-        center._add(box.midX(), box.midY());
+
+        center._add(box.centerX, box.centerY);
+
     }
+
     center.multiplyScalar(1 / numBoxes);
 
     return center;

package/src/core/geom/2d/quad-tree/QuadTreeDatum.d.ts

@@ -5,12 +5,10 @@
 export class QuadTreeDatum<D> extends AABB2 {
     /**
      *
-     * @param {Number} [x0=0]
-     * @param {Number} [y0=0]
-     * @param {Number} [x1=0]
-     * @param {Number} [y1=0]
+     * @type {QuadTreeNode|null}
      */
-    constructor(x0?: number, y0?: number, x1?: number, y1?: number);
+    constructor(x0: number, y0: number, x1: number, y1: number);
+    constructor();
     /**
      *
      * @type {D|null}

package/src/core/geom/2d/quad-tree/QuadTreeDatum.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"QuadTreeDatum.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/2d/quad-tree/QuadTreeDatum.js"],"names":[],"mappings":"AAGA;;;GAGG;AACH;IACI;;;;;;OAMG;IACH,gEAcC;IAXG;;;OAGG;IACH,MAFU,CAAC,GAAC,IAAI,CAEA;IAEhB;;;OAGG;IACH,YAFU,eAAa,IAAI,CAEL;IAG1B,mBA2BC;IAED;;;;;;OAMG;IACH,WALW,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,QA8BhB;IAED;;;;OAIG;IACH,SAHW,MAAM,MACN,MAAM,QAUhB;IAGL,yBAAuC;CAFtC;kBA9GiB,wBAAwB"}
+{"version":3,"file":"QuadTreeDatum.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/2d/quad-tree/QuadTreeDatum.js"],"names":[],"mappings":"AAGA;;;GAGG;AACH;IAQI;;;OAGG;IACH,4DAAD;IAAC,cACJ;IAXI;;;OAGG;IACH,MAFU,CAAC,GAAC,IAAI,CAEJ;IAEZ;;;OAGG;IACH,YAFU,eAAa,IAAI,CAET;IAElB,mBA2BC;IAED;;;;;;OAMG;IACH,WALW,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,QA8BhB;IAED;;;;OAIG;IACH,SAHW,MAAM,MACN,MAAM,QAUhB;IAGL,yBAAuC;CAFtC;kBApGiB,wBAAwB"}

package/src/core/geom/2d/quad-tree/QuadTreeDatum.js

@@ -6,28 +6,18 @@ import AABB2 from "../../2d/aabb/AABB2.js";
  * @extends {AABB2}
  */
 export class QuadTreeDatum extends AABB2 {
+
     /**
      *
-     * @param {Number} [x0=0]
-     * @param {Number} [y0=0]
-     * @param {Number} [x1=0]
-     * @param {Number} [y1=0]
+     * @type {D|null}
      */
-    constructor(x0, y0, x1, y1) {
-        super(x0, y0, x1, y1);
-
-        /**
-         *
-         * @type {D|null}
-         */
-        this.data = null;
-
-        /**
-         *
-         * @type {QuadTreeNode|null}
-         */
-        this.parentNode = null;
-    }
+    data = null;
+
+    /**
+     *
+     * @type {QuadTreeNode|null}
+     */
+    parentNode = null;
 
     disconnect() {
         const parentNode = this.parentNode;

package/src/core/geom/2d/rectangle_to_aabb.d.ts

@@ -0,0 +1,8 @@
+/**
+ *
+ * @param {Rectangle} rect
+ * @returns {AABB2}
+ */
+export function rectangle_to_aabb(rect: Rectangle): AABB2;
+import AABB2 from "./aabb/AABB2.js";
+//# sourceMappingURL=rectangle_to_aabb.d.ts.map

package/src/core/geom/2d/rectangle_to_aabb.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"rectangle_to_aabb.d.ts","sourceRoot":"","sources":["../../../../../src/core/geom/2d/rectangle_to_aabb.js"],"names":[],"mappings":"AAEA;;;;GAIG;AACH,oDAFa,KAAK,CAuBjB;kBA5BiB,iBAAiB"}

package/src/core/geom/2d/rectangle_to_aabb.js

@@ -0,0 +1,29 @@
+import AABB2 from "./aabb/AABB2.js";
+
+/**
+ *
+ * @param {Rectangle} rect
+ * @returns {AABB2}
+ */
+export function rectangle_to_aabb(rect) {
+    const position = rect.position;
+
+    const x0 = position.x;
+    const y0 = position.y;
+
+    const size = rect.size;
+
+    let x1 = x0;
+    let y1 = y0;
+
+    // sanitize bounds
+    if (size.x > 0) {
+        x1 += size.x;
+    }
+
+    if (size.y > 0) {
+        y1 += size.y;
+    }
+
+    return new AABB2(x0, y0, x1, y1);
+}

package/src/core/geom/3d/tetrahedra/TetrahedralMesh.js

@@ -1,6 +1,6 @@
 import { orient3d } from "robust-predicates";
 import { assert } from "../../../assert.js";
-import { Base64 } from "../../../binary/Base64.js";
+import { Base64 } from "../../../binary/base64/Base64.js";
 import { BinaryBuffer } from "../../../binary/BinaryBuffer.js";
 import { EndianType } from "../../../binary/EndianType.js";
 import { array_copy } from "../../../collection/array/array_copy.js";

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

@@ -9,5 +9,5 @@
  * @returns {SquareMatrix}
  */
 export function graph_compute_distance_matrix<T>(graph: Graph<T>, node_array: T[], targets: number[], node_index_map: Map<T, number>): SquareMatrix;
-import { SquareMatrix } from "./SquareMatrix.js";
+import { SquareMatrix } from "../math/matrix/SquareMatrix.js";
 //# sourceMappingURL=graph_compute_distance_matrix.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"graph_compute_distance_matrix.d.ts","sourceRoot":"","sources":["../../../../src/core/graph/graph_compute_distance_matrix.js"],"names":[],"mappings":"AAKA;;;;;;;;;GASG;AACH,4FAJW,MAAM,EAAE,mCAEN,YAAY,CAyFxB;6BAnG4B,mBAAmB"}
+{"version":3,"file":"graph_compute_distance_matrix.d.ts","sourceRoot":"","sources":["../../../../src/core/graph/graph_compute_distance_matrix.js"],"names":[],"mappings":"AAKA;;;;;;;;;GASG;AACH,4FAJW,MAAM,EAAE,mCAEN,YAAY,CAyFxB;6BAnG4B,gCAAgC"}

package/src/core/graph/graph_compute_distance_matrix.js

@@ -1,7 +1,7 @@
 import { BitSet } from "../binary/BitSet.js";
 import { BinaryDataType } from "../binary/type/BinaryDataType.js";
 import BinaryHeap from "../collection/heap/BinaryHeap.js";
-import { SquareMatrix } from "./SquareMatrix.js";
+import { SquareMatrix } from "../math/matrix/SquareMatrix.js";
 
 /**
  * Produce a distance matrix from an input graph, tracing distances from each node to every node specified in target vector

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

@@ -7,5 +7,5 @@
  * @param {Map<T,number>} node_indices
  */
 export function graph_compute_laplacian_matrix<T>(graph: Graph<T>, result: SquareMatrix, node_indices: Map<T, number>): void;
-import { SquareMatrix } from "./SquareMatrix.js";
+import { SquareMatrix } from "../math/matrix/SquareMatrix.js";
 //# sourceMappingURL=graph_compute_laplacian_matrix.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"graph_compute_laplacian_matrix.d.ts","sourceRoot":"","sources":["../../../../src/core/graph/graph_compute_laplacian_matrix.js"],"names":[],"mappings":"AAKA;;;;;;;GAOG;AACH,2EAHW,YAAY,sCAWtB;6BAlB4B,mBAAmB"}
+{"version":3,"file":"graph_compute_laplacian_matrix.d.ts","sourceRoot":"","sources":["../../../../src/core/graph/graph_compute_laplacian_matrix.js"],"names":[],"mappings":"AAKA;;;;;;;GAOG;AACH,2EAHW,YAAY,sCAWtB;6BApB4B,gCAAgC"}

package/src/core/graph/graph_compute_laplacian_matrix.js

@@ -1,7 +1,7 @@
 import { BinaryDataType } from "../binary/type/BinaryDataType.js";
+import { SquareMatrix } from "../math/matrix/SquareMatrix.js";
 import { graph_compute_adjacency_matrix } from "./graph_compute_adjacency_matrix.js";
 import { graph_compute_degree_matrix } from "./graph_compute_degree_matrix.js";
-import { SquareMatrix } from "./SquareMatrix.js";
 
 /**
  * Laplacian matrix (graph Laplacian)

package/src/core/graph/layout/CircleLayout.js

@@ -249,8 +249,8 @@ function computeBoundingBox(circles) {
  */
 export function centerCircleCollectionOn(circles, center) {
     const bBox = computeBoundingBox(circles);
-    const dX = bBox.midX() - center.x;
-    const dY = bBox.midY() - center.y;
+    const dX = bBox.centerX - center.x;
+    const dY = bBox.centerY - center.y;
     circles.forEach(function (b) {
         if (b.locked) {
             //node is locked and can't be moved

package/src/core/graph/layout/box/BoxLayouter.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"BoxLayouter.d.ts","sourceRoot":"","sources":["../../../../../../src/core/graph/layout/box/BoxLayouter.js"],"names":[],"mappings":"AAmaA;;;;GAIG;AACH,+CAHW,KAAK,EAAE,UACP,OAAO,QASjB;kBAzaiB,gCAAgC;oBAC9B,0BAA0B;AAib9C;;;;;GAKG;AACH,mCAJW,MAAO,KAAK,CAAC,yBAEb,OAAO,QA0FjB;AArGD,gDAKC"}
+{"version":3,"file":"BoxLayouter.d.ts","sourceRoot":"","sources":["../../../../../../src/core/graph/layout/box/BoxLayouter.js"],"names":[],"mappings":"AAyaA;;;;GAIG;AACH,+CAHW,KAAK,EAAE,UACP,OAAO,QASjB;kBA/aiB,gCAAgC;oBAC9B,0BAA0B;AAub9C;;;;;GAKG;AACH,mCAJW,MAAO,KAAK,CAAC,yBAEb,OAAO,QA0FjB;AArGD,gDAKC"}