@woosh/meep-engine 2.119.100 → 2.119.103

package/editor/view/ecs/ComponentControlView.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"ComponentControlView.d.ts","sourceRoot":"","sources":["ComponentControlView.js"],"names":[],"mappings":"AAUA,sDAwBC;AAED;;;;;GAKG;AACH,6CAJW,MAAM,cACN,MAAM,GACJ,QAAQ,IAAI,CAAC,CAezB;AAED,sDAgDC;AAED;;GAEG;AACH;IACI;;;;;;;;OAQG;IACH,oBAPW,MAAM,6DAGN,IAAI,eAqGd;IA9FG;;MAEC;IAMD,YAAkB;IAEH,wBAAwC;CAqF9D;iBA1NgB,2BAA2B;mBACzB,2CAA2C;4BAElC,4CAA4C"}
+{"version":3,"file":"ComponentControlView.d.ts","sourceRoot":"","sources":["ComponentControlView.js"],"names":[],"mappings":"AAUA,sDAwBC;AAED;;;;;GAKG;AACH,6CAJW,MAAM,cACN,MAAM,GACJ,OAAO,CAAC,IAAI,CAAC,CAezB;AAED,sDAgDC;AAED;;GAEG;AACH,kCAFa,CAAC;IAGV;;;;;;;;OAQG;IACH,oBAPW,MAAM,aACN,GAAC,iBACD,aAAa,eACb,IAAI,eAqGd;IA9FG;;MAEC;IAMD,YAAkB;IAEH,wBAAwC;CAqF9D;iBA1NgB,2BAA2B;mBACzB,2CAA2C;4BAElC,4CAA4C"}

package/package.json

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

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

@@ -1 +1 @@
-{"version":3,"file":"is_typed_array_equals.d.ts","sourceRoot":"","sources":["../../../../../../src/core/collection/array/typed/is_typed_array_equals.js"],"names":[],"mappings":"AAIA;;;;;GAKG;AACH,yCAJW,UAAU,GAAC,WAAW,KACtB,UAAU,GAAC,WAAW,GACpB,OAAO,CAiFnB"}
+{"version":3,"file":"is_typed_array_equals.d.ts","sourceRoot":"","sources":["../../../../../../src/core/collection/array/typed/is_typed_array_equals.js"],"names":[],"mappings":"AAKA;;;;;GAKG;AACH,yCAJW,UAAU,GAAC,WAAW,KACtB,UAAU,GAAC,WAAW,GACpB,OAAO,CAmFnB"}

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

@@ -1,4 +1,5 @@
 //
+import { assert } from "../../../assert.js";
 import { largest_common_alignment_uint32 } from "../../../binary/largest_common_alignment_uint32.js";
 import { isArrayEqualStrict } from "../isArrayEqualStrict.js";
 
@@ -64,7 +65,9 @@ export function is_typed_array_equals(a, b) {
 
     const bytes_per_element = a_constructor.BYTES_PER_ELEMENT;
 
-    const alignment = largest_common_alignment_uint32(a_offset, b_offset,byte_length);
+    assert.isNonNegativeInteger(bytes_per_element, 'constructor.BYTES_PER_ELEMENT');
+
+    const alignment = largest_common_alignment_uint32(a_offset, b_offset, byte_length);
 
     if (
         bytes_per_element < 4

package/src/core/collection/list/List.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"List.d.ts","sourceRoot":"","sources":["../../../../../src/core/collection/list/List.js"],"names":[],"mappings":";AAaA;;;;GAIG;AACH,mBAFa,CAAC;IAyBV;;OAEG;IACH,oBAFW,CAAC,EAAE,EAoBb;IA3CD;;OAEG;IACH;QACI;;;WAGG;wBADO,MAAM,CAAC,CAAC,EAAC,MAAM,CAAC;QAG1B;;;WAGG;0BADO,MAAM,CAAC,CAAC,EAAC,MAAM,CAAC;MAG5B;IAEF;;;OAGG;IACH,eAFU,CAAC,EAAE,CAEJ;IAkBL;;;OAGG;IACH,QAFU,MAAM,CAEc;IAGlC;;;;OAIG;IACH,WAHW,MAAM,GACJ,CAAC,GAAC,SAAS,CAOvB;IAED;;;;OAIG;IACH,WAHW,MAAM,SACN,CAAC,QAyBX;IAED;;;;OAIG;IACH,QAHW,CAAC,GACC,IAAI,CAUhB;IAED;;;;;;;OAOG;IACH,cAHW,CAAC,GACA,OAAO,CAUlB;IAED;;;;;;;OAOG;IACH,cALW,MAAM,MACN,CAAC,aAoBX;IAED;;;;;OAKG;IACH,iBAJW,GAAG,YACH,GAAG,GACD,MAAM,CAkClB;IAED;;;;;OAKG;IACH,gBAFW,CAAC,EAAE,QAqDb;IAED;;;OAGG;IACH,iBAFW,KAAK,CAAE,CAAC,CAAC,QAmBnB;IAED;;;OAGG;IACH,uBAFW,KAAK,CAAE,CAAC,CAAC,QAQnB;IAED;;;;;OAKG;IACH,kBAJW,MAAM,eACN,MAAM,GACJ,CAAC,EAAE,CAyBf;IAED;;;;OAIG;IACH,cAHW,MAAM,GACJ,CAAC,CAiBb;IAED;;;;OAIG;IACH,oBAHW,CAAC,EAAE,GACD,OAAO,CAwCnB;IAED;;;;OAIG;IACH,mBAHW,CAAC,GACA,OAAO,CAQlB;IAED;;;;OAIG;IACH,6BAFa,IAAI,CAKhB;IAED;;;OAGG;IACH,SAFa,IAAI,CAAE,CAAC,CAAC,CAIpB;IAED;;;;;;OAMG;IACH,cAJW,MAAM,QACN,MAAM,GACL,CAAC,EAAE,CAId;IAED;;;;OAIG;IACH,sBAFa,OAAO,CAWnB;IAED;;;;OAIG;IACH,oBAHW,CAAS,IAAC,EAAD,CAAC,KAAE,OAAO,YACnB,GAAC,QAgBX;IAED;;;;;OAKG;IACH,uBAJW,CAAS,IAAC,EAAD,CAAC,KAAE,OAAO,YACnB,GAAC,GACA,OAAO,CAgBlB;IAED;;;;OAIG;IACH,0BAFW,GAAC,QAWX;IAED;;;;OAIG;IACH,UAJW,CAAS,IAAC,EAAD,GAAC,EAAC,IAAC,EAAD,CAAC,KAAE,GAAC,WACf,GAAC,GACC,GAAC,CAQb;IAED;;;;OAIG;IACH,UAHW,CAAS,IAAC,EAAD,CAAC,KAAE,OAAO,GACjB,KAAK,CAAE,CAAC,CAAC,CAIrB;IAED;;;;OAIG;IACH,oBAFa,CAAC,GAAC,SAAS,CAcvB;IAED;;;;OAIG;IACH,mBAHW,CAAS,IAAC,EAAD,CAAC,KAAE,OAAO,GACjB,MAAM,CAiBlB;IAED;;;;;OAKG;IACH,8CAFa,OAAO,CAkBnB;IAED;;;;OAIG;IACH,YAHW,CAAC,GACC,OAAO,CAInB;IAED;;;;OAIG;IACH,qBAHW,CAAC,EAAE,GACD,OAAO,CAanB;IAED;;;OAGG;IACH,WAFa,OAAO,CAInB;IAED;;;;OAIG;IACH,YAHW,CAAC,GACC,MAAM,CAIlB;IAED;;;;;OAKG;IACH,IALa,CAAC,YACH,CAAS,IAAC,EAAD,CAAC,KAAE,CAAC,YACb,GAAC,GACC,CAAC,EAAE,CAgBf;IAED;;;;OAIG;IACH,0CAFW,GAAC,QAsBX;IAED,cAyBC;IAED;;;;;OAKG;IACH,gBAJW,IAAI,CAAC,CAAC,CAAC,uCAEP,GAAC,QAqCX;IAED;;;OAGG;IACH,YAFW,IAAI,CAAC,CAAC,CAAC,GAAC,CAAC,EAAE,QAarB;IAED;;;OAGG;IACH,WAFa,CAAC,EAAE,CAIf;IAED,cAEC;IAED;;;;OAIG;IACH,SAJa,CAAC,QACH,CAAC,EAAE,+BAiBb;IAED;;;OAGG;IACH,uBAFW,YAAY,QAgBtB;IAED;;;;OAIG;IACH,yBAHW,YAAY,0BAgBtB;IAED;;;;OAIG;IACH,mCAHW,YAAY,sBAOtB;IAED;;;;OAIG;IACH,sCAHW,YAAY,sBAWtB;IAED;;;;OAIG;IACH,sBAJa,CAAC,QACH,CAAC,EAAE,WACH,CAAS,IAAC,EAAD,CAAC,KAAE,CAAC,QAWvB;IAED;;;OAGG;IACH,QAFa,MAAM,CAgBlB;IAED;;;OAGG;IACH,SAFa,CAAC,GAAC,SAAS,CAIvB;IAED;;;OAGG;IACH,QAFY,CAAC,GAAC,SAAS,CAItB;IAED;;;OAGG;IACH,kCA8BC;IAED;;;;OAIG;IACH,eAHW,IAAI,CAAC,CAAC,CAAC,GACL,MAAM,CA0BlB;CACJ;mBAh+BkB,+BAA+B"}
+{"version":3,"file":"List.d.ts","sourceRoot":"","sources":["../../../../../src/core/collection/list/List.js"],"names":[],"mappings":";AAaA;;;;GAIG;AACH,mBAFa,CAAC;IAyBV;;OAEG;IACH,oBAFW,CAAC,EAAE,EAoBb;IA3CD;;OAEG;IACH;QACI;;;WAGG;wBADO,MAAM,CAAC,CAAC,EAAC,MAAM,CAAC;QAG1B;;;WAGG;0BADO,MAAM,CAAC,CAAC,EAAC,MAAM,CAAC;MAG5B;IAEF;;;OAGG;IACH,eAFU,CAAC,EAAE,CAEJ;IAkBL;;;OAGG;IACH,QAFU,MAAM,CAEc;IAGlC;;;;OAIG;IACH,WAHW,MAAM,GACJ,CAAC,GAAC,SAAS,CAOvB;IAED;;;;OAIG;IACH,WAHW,MAAM,SACN,CAAC,QAyBX;IAED;;;;OAIG;IACH,QAHW,CAAC,GACC,IAAI,CAUhB;IAED;;;;;;;OAOG;IACH,cAHW,CAAC,GACA,OAAO,CAUlB;IAED;;;;;;;OAOG;IACH,cALW,MAAM,MACN,CAAC,aAoBX;IAED;;;;;OAKG;IACH,iBAJW,GAAG,YACH,GAAG,GACD,MAAM,CAkClB;IAED;;;;;OAKG;IACH,gBAFW,CAAC,EAAE,QAqDb;IAED;;;OAGG;IACH,iBAFW,KAAK,CAAE,CAAC,CAAC,QAmBnB;IAED;;;OAGG;IACH,uBAFW,KAAK,CAAE,CAAC,CAAC,QAQnB;IAED;;;;;OAKG;IACH,kBAJW,MAAM,eACN,MAAM,GACJ,CAAC,EAAE,CAyBf;IAED;;;;OAIG;IACH,cAHW,MAAM,GACJ,CAAC,CAiBb;IAED;;;;OAIG;IACH,oBAHW,CAAC,EAAE,GACD,OAAO,CAwCnB;IAED;;;;OAIG;IACH,mBAHW,CAAC,GACA,OAAO,CAQlB;IAED;;;;OAIG;IACH,6BAFa,IAAI,CAKhB;IAED;;;;OAIG;IACH,SAFa,IAAI,CAAE,CAAC,CAAC,CAIpB;IAED;;;;;;OAMG;IACH,cAJW,MAAM,QACN,MAAM,GACL,CAAC,EAAE,CAId;IAED;;;;OAIG;IACH,sBAFa,OAAO,CAWnB;IAED;;;;OAIG;IACH,oBAHW,CAAS,IAAC,EAAD,CAAC,KAAE,OAAO,YACnB,GAAC,QAgBX;IAED;;;;;OAKG;IACH,uBAJW,CAAS,IAAC,EAAD,CAAC,KAAE,OAAO,YACnB,GAAC,GACA,OAAO,CAgBlB;IAED;;;;OAIG;IACH,0BAFW,GAAC,QAWX;IAED;;;;OAIG;IACH,UAJW,CAAS,IAAC,EAAD,GAAC,EAAC,IAAC,EAAD,CAAC,KAAE,GAAC,WACf,GAAC,GACC,GAAC,CAQb;IAED;;;;OAIG;IACH,UAHW,CAAS,IAAC,EAAD,CAAC,KAAE,OAAO,GACjB,KAAK,CAAE,CAAC,CAAC,CAIrB;IAED;;;;OAIG;IACH,oBAFa,CAAC,GAAC,SAAS,CAcvB;IAED;;;;OAIG;IACH,mBAHW,CAAS,IAAC,EAAD,CAAC,KAAE,OAAO,GACjB,MAAM,CAiBlB;IAED;;;;;OAKG;IACH,8CAFa,OAAO,CAkBnB;IAED;;;;OAIG;IACH,YAHW,CAAC,GACC,OAAO,CAInB;IAED;;;;OAIG;IACH,qBAHW,CAAC,EAAE,GACD,OAAO,CAanB;IAED;;;OAGG;IACH,WAFa,OAAO,CAInB;IAED;;;;OAIG;IACH,YAHW,CAAC,GACC,MAAM,CAIlB;IAED;;;;;OAKG;IACH,IALa,CAAC,YACH,CAAS,IAAC,EAAD,CAAC,KAAE,CAAC,YACb,GAAC,GACC,CAAC,EAAE,CAgBf;IAED;;;;OAIG;IACH,0CAFW,GAAC,QAsBX;IAED,cAyBC;IAED;;;;;OAKG;IACH,gBAJW,IAAI,CAAC,CAAC,CAAC,uCAEP,GAAC,QAqCX;IAED;;;OAGG;IACH,YAFW,IAAI,CAAC,CAAC,CAAC,GAAC,CAAC,EAAE,QAarB;IAED;;;OAGG;IACH,WAFa,CAAC,EAAE,CAIf;IAED,cAEC;IAED;;;;OAIG;IACH,SAJa,CAAC,QACH,CAAC,EAAE,+BAiBb;IAED;;;OAGG;IACH,uBAFW,YAAY,QAgBtB;IAED;;;;OAIG;IACH,yBAHW,YAAY,0BAgBtB;IAED;;;;OAIG;IACH,mCAHW,YAAY,sBAOtB;IAED;;;;OAIG;IACH,sCAHW,YAAY,sBAWtB;IAED;;;;OAIG;IACH,sBAJa,CAAC,QACH,CAAC,EAAE,WACH,CAAS,IAAC,EAAD,CAAC,KAAE,CAAC,QAWvB;IAED;;;OAGG;IACH,QAFa,MAAM,CAgBlB;IAED;;;OAGG;IACH,SAFa,CAAC,GAAC,SAAS,CAIvB;IAED;;;OAGG;IACH,QAFY,CAAC,GAAC,SAAS,CAItB;IAED;;;OAGG;IACH,kCA8BC;IAED;;;;OAIG;IACH,eAHW,IAAI,CAAC,CAAC,CAAC,GACL,MAAM,CA0BlB;CACJ;mBAj+BkB,+BAA+B"}

package/src/core/collection/list/List.js

@@ -420,6 +420,7 @@ class List {
 
     /**
      * Copy of this list
+     * The copy is shallow
      * @returns {List.<T>}
      */
     clone() {

package/src/core/geom/3d/topology/struct/binary/BinaryElementPool.d.ts

@@ -162,6 +162,7 @@ export class BinaryElementPool {
     release(id: number): void;
     /**
      * Removed all data from the pool
+     * Note that initial allocation pointer is set to 0
      */
     clear(): void;
 }

package/src/core/geom/3d/topology/struct/binary/BinaryElementPool.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"BinaryElementPool.d.ts","sourceRoot":"","sources":["../../../../../../../../src/core/geom/3d/topology/struct/binary/BinaryElementPool.js"],"names":[],"mappings":"AAyBA;;GAEG;AACH;IAwBI;;;;;OAKG;IACH,uBAJW,MAAM,qBACN,MAAM,sBACN,OAAO,EAkDjB;IA5ED;;;;OAIG;IACH,eAAY;IAEZ;;;;;OAKG;IACH,uBAAmB;IAEnB;;;;OAIG;IACH,eAAW;IAeP;;;;OAIG;IACH,oBAA4B;IAG5B;;;;OAIG;IACH,sBAA8F;IAC9F;;;;OAIG;IACH,qBAAsD;IACtD;;;;OAIG;IACH,sBAAwD;IACxD;;;;OAIG;IACH,uBAA0D;IAC1D,iCAAiD;IAEjD;;;;OAIG;IACH,mBAAkC;IAItC;;;;OAIG;IACH,wBAHW,WAAW,2BACX,MAAM,QAsBhB;IAED,+BAEC;IAED;;;OAGG;IACH,iBAFY,MAAM,CAIjB;IAED;;;;OAIG;IACH,YAFY,MAAM,CAIjB;IAED;;;OAGG;IACH,gBAFY,MAAM,CAIjB;IAED;;;OAGG;IACH,gBAFY,MAAM,CAIjB;IAGD;;;OAGG;IACH,mBAFY,WAAW,CAItB;IAED;;;OAGG;IACH,oBAFY,YAAY,CAIvB;IAED;;OAEG;IACH,aAEC;IAED;;;;OAIG;IACH,oBAHW,MAAM,GACL,MAAM,CAMjB;IAED;;;;;OAKG;IACH,iBAHW,MAAM,GACL,MAAM,CAIjB;IAED;;;;OAIG;IACH,iBAHW,MAAM,GACL,OAAO,CAsBlB;IAED;;;;OAIG;IACH,uBAwBC;IAED;;;;OAIG;IACH,wBAQC;IAED;;;OAGG;IACH,0BAFW,MAAM,QAMhB;IAGD;;;OAGG;IACH,YAFY,MAAM,CAqBjB;IAED;;;;OAIG;IACH,2BAHW,MAAM,GACL,MAAM,CAcjB;IAED;;;;OAIG;IACH,YAFW,MAAM,QAYhB;IAED;;OAEG;IACH,cAGC;CACJ"}
+{"version":3,"file":"BinaryElementPool.d.ts","sourceRoot":"","sources":["../../../../../../../../src/core/geom/3d/topology/struct/binary/BinaryElementPool.js"],"names":[],"mappings":"AAyBA;;GAEG;AACH;IAwBI;;;;;OAKG;IACH,uBAJW,MAAM,qBACN,MAAM,sBACN,OAAO,EAkDjB;IA5ED;;;;OAIG;IACH,eAAY;IAEZ;;;;;OAKG;IACH,uBAAmB;IAEnB;;;;OAIG;IACH,eAAW;IAeP;;;;OAIG;IACH,oBAA4B;IAG5B;;;;OAIG;IACH,sBAA8F;IAC9F;;;;OAIG;IACH,qBAAsD;IACtD;;;;OAIG;IACH,sBAAwD;IACxD;;;;OAIG;IACH,uBAA0D;IAC1D,iCAAiD;IAEjD;;;;OAIG;IACH,mBAAkC;IAItC;;;;OAIG;IACH,wBAHW,WAAW,2BACX,MAAM,QAsBhB;IAED,+BAEC;IAED;;;OAGG;IACH,iBAFY,MAAM,CAIjB;IAED;;;;OAIG;IACH,YAFY,MAAM,CAIjB;IAED;;;OAGG;IACH,gBAFY,MAAM,CAIjB;IAED;;;OAGG;IACH,gBAFY,MAAM,CAIjB;IAGD;;;OAGG;IACH,mBAFY,WAAW,CAItB;IAED;;;OAGG;IACH,oBAFY,YAAY,CAIvB;IAED;;OAEG;IACH,aAEC;IAED;;;;OAIG;IACH,oBAHW,MAAM,GACL,MAAM,CAMjB;IAED;;;;;OAKG;IACH,iBAHW,MAAM,GACL,MAAM,CAIjB;IAED;;;;OAIG;IACH,iBAHW,MAAM,GACL,OAAO,CAsBlB;IAED;;;;OAIG;IACH,uBAwBC;IAED;;;;OAIG;IACH,wBAQC;IAED;;;OAGG;IACH,0BAFW,MAAM,QAMhB;IAGD;;;OAGG;IACH,YAFY,MAAM,CAqBjB;IAED;;;;OAIG;IACH,2BAHW,MAAM,GACL,MAAM,CAcjB;IAED;;;;OAIG;IACH,YAFW,MAAM,QAYhB;IAED;;;OAGG;IACH,cAGC;CACJ"}

package/src/core/geom/3d/topology/struct/binary/BinaryElementPool.js

@@ -362,6 +362,7 @@ export class BinaryElementPool {
 
     /**
      * Removed all data from the pool
+     * Note that initial allocation pointer is set to 0
      */
     clear() {
         this.__size = 0;

package/src/core/geom/3d/topology/struct/binary/io/bt_edge_create.d.ts

@@ -0,0 +1,9 @@
+/**
+ *
+ * @param {BinaryTopology} mesh
+ * @param {number} v0
+ * @param {number} v1
+ * @return {number} ID of the newly created edge
+ */
+export function bt_edge_create(mesh: BinaryTopology, v0: number, v1: number): number;
+//# sourceMappingURL=bt_edge_create.d.ts.map

package/src/core/geom/3d/topology/struct/binary/io/bt_edge_create.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"bt_edge_create.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/core/geom/3d/topology/struct/binary/io/bt_edge_create.js"],"names":[],"mappings":"AA8DA;;;;;;GAMG;AACH,qCALW,cAAc,MACd,MAAM,MACN,MAAM,GACL,MAAM,CAsCjB"}

package/src/core/geom/3d/topology/struct/binary/io/{create_edge.js → bt_edge_create.js}

@@ -65,9 +65,9 @@ function edge_link_disk(mesh, edge_source, edge_new, vertex) {
  * @param {BinaryTopology} mesh
  * @param {number} v0
  * @param {number} v1
- * @return {number}
+ * @return {number} ID of the newly created edge
  */
-export function create_edge(mesh, v0, v1) {
+export function bt_edge_create(mesh, v0, v1) {
     const edge_id = mesh.edges.allocate();
 
     mesh.edge_write_vertex1(edge_id, v0);

package/src/core/geom/3d/topology/struct/binary/io/bt_edge_get_or_create.d.ts

@@ -0,0 +1,10 @@
+/**
+ * Ensure an edge between two vertices
+ * NOTE: works without having to use a separate hash map, resulting in faster execution and smaller RAM requirement
+ * @param {BinaryTopology} mesh
+ * @param {number} v0
+ * @param {number} v1
+ * @returns {number} edge ID
+ */
+export function bt_edge_get_or_create(mesh: BinaryTopology, v0: number, v1: number): number;
+//# sourceMappingURL=bt_edge_get_or_create.d.ts.map

package/src/core/geom/3d/topology/struct/binary/io/bt_edge_get_or_create.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"bt_edge_get_or_create.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/core/geom/3d/topology/struct/binary/io/bt_edge_get_or_create.js"],"names":[],"mappings":"AAGA;;;;;;;GAOG;AACH,4CALW,cAAc,MACd,MAAM,MACN,MAAM,GACJ,MAAM,CAmClB"}

package/src/core/geom/3d/topology/struct/binary/io/bt_edge_get_or_create.js

@@ -0,0 +1,45 @@
+import { NULL_POINTER } from "../BinaryTopology.js";
+import { bt_edge_create } from "./bt_edge_create.js";
+
+/**
+ * Ensure an edge between two vertices
+ * NOTE: works without having to use a separate hash map, resulting in faster execution and smaller RAM requirement
+ * @param {BinaryTopology} mesh
+ * @param {number} v0
+ * @param {number} v1
+ * @returns {number} edge ID
+ */
+export function bt_edge_get_or_create(mesh, v0, v1) {
+    const first_edge = mesh.vertex_read_edge(v0);
+
+    if (first_edge !== NULL_POINTER) {
+
+        // iterate over all edges around the vertex
+        let edge = first_edge;
+
+        do {
+            const edge_v1 = mesh.edge_read_vertex1(edge);
+            const edge_v2 = mesh.edge_read_vertex2(edge);
+
+            if (edge_v1 === v1 || edge_v2 === v1) {
+                // found edge that connects between v0 and v1
+                return edge;
+            }
+
+            if (edge_v1 === v0) {
+                edge = mesh.edge_read_v1_disk_next(edge);
+            } else if (edge_v2 === v0) {
+                edge = mesh.edge_read_v2_disk_next(edge);
+            } else {
+                // invalid edge connection
+                throw new Error('Invalid edge, not connected to first vertex');
+            }
+
+        } while (edge !== first_edge);
+
+    }
+
+    // if match is found - return the match, else create a new edge and assign
+
+    return bt_edge_create(mesh, v0, v1);
+}

package/src/core/geom/3d/topology/struct/binary/io/bt_index_geometry_to_topology.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"bt_index_geometry_to_topology.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/core/geom/3d/topology/struct/binary/io/bt_index_geometry_to_topology.js"],"names":[],"mappings":"AAIA;;;;;;;;GAQG;AACH,mDALW,cAAc,WACd,MAAM,EAAE,oBACR,MAAM,EAAE,mBACR,MAAM,EAAE,QAoGlB"}
+{"version":3,"file":"bt_index_geometry_to_topology.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/core/geom/3d/topology/struct/binary/io/bt_index_geometry_to_topology.js"],"names":[],"mappings":"AAIA;;;;;;;;GAQG;AACH,mDALW,cAAc,WACd,MAAM,EAAE,oBACR,MAAM,EAAE,mBACR,MAAM,EAAE,QAwGlB"}

package/src/core/geom/3d/topology/struct/binary/io/bt_index_geometry_to_topology.js

@@ -1,5 +1,5 @@
 import { NULL_POINTER } from "../BinaryTopology.js";
-import { create_edge } from "./create_edge.js";
+import { bt_edge_get_or_create } from "./bt_edge_get_or_create.js";
 
 
 /**
@@ -29,12 +29,13 @@ export function bt_index_geometry_to_topology(
     // ingest all vertices
     const vertex_count = vertex_positions.length / 3;
 
-    const vertex_allocation_offset = out.vertices.allocate_continuous(vertex_count);
+    // NOTE: we ignore vertex offset, because after clear - it is guaranteed to be 0
+    out.vertices.allocate_continuous(vertex_count);
 
     for (let i = 0; i < vertex_count; i++) {
         const i3 = i * 3;
 
-        const vertex_id = i + vertex_allocation_offset;
+        const vertex_id = i;
 
         out.vertex_write_coordinate(vertex_id, vertex_positions, i3);
 
@@ -49,7 +50,8 @@ export function bt_index_geometry_to_topology(
     const face_count = indices.length / 3;
 
     // create faces
-    const face_allocation_offset = out.faces.allocate_continuous(face_count);
+    // NOTE: we ignore vertex offset, because after clear - it is guaranteed to be 0
+    out.faces.allocate_continuous(face_count);
 
     // reserve some memory to avoid extra allocations
     out.loops.ensure_capacity(face_count * 3);
@@ -62,16 +64,16 @@ export function bt_index_geometry_to_topology(
         const b = indices[i3 + 1];
         const c = indices[i3 + 2];
 
-        const vertex_a = a + vertex_allocation_offset;
-        const vertex_b = b + vertex_allocation_offset;
-        const vertex_c = c + vertex_allocation_offset;
+        const vertex_a = a;
+        const vertex_b = b;
+        const vertex_c = c;
 
-        const face_id = i + face_allocation_offset;
+        const face_id = i ;
 
         // create edges
-        const edge_ab = get_or_create_edge_2(vertex_a, vertex_b, out);
-        const edge_bc = get_or_create_edge_2(vertex_b, vertex_c, out);
-        const edge_ca = get_or_create_edge_2(vertex_c, vertex_a, out);
+        const edge_ab = bt_edge_get_or_create(out, vertex_a, vertex_b);
+        const edge_bc = bt_edge_get_or_create(out, vertex_b, vertex_c);
+        const edge_ca = bt_edge_get_or_create(out, vertex_c, vertex_a);
 
         // allocate loops
         const loop_a = out.loop_create();
@@ -80,17 +82,19 @@ export function bt_index_geometry_to_topology(
 
         // write loops
         out.loop_write_vertex(loop_a, vertex_a);
+        out.loop_write_face(loop_a, face_id);
+
         out.loop_write_vertex(loop_b, vertex_b);
+        out.loop_write_face(loop_b, face_id);
+
         out.loop_write_vertex(loop_c, vertex_c);
+        out.loop_write_face(loop_c, face_id);
 
         // link loops to edges
-        link_loop_to_edge(loop_a, edge_ab, out);
-        link_loop_to_edge(loop_b, edge_bc, out);
-        link_loop_to_edge(loop_c, edge_ca, out);
+        link_loop_to_edge(out, loop_a, edge_ab);
+        link_loop_to_edge(out, loop_b, edge_bc);
+        link_loop_to_edge(out, loop_c, edge_ca);
 
-        out.loop_write_face(loop_a, face_id);
-        out.loop_write_face(loop_b, face_id);
-        out.loop_write_face(loop_c, face_id);
 
         /*
         NOTE: Vertices (#BMLoop.v & #BMLoop.next.v) always contain vertices from (#BMEdge.v1 & #BMEdge.v2).
@@ -113,11 +117,11 @@ export function bt_index_geometry_to_topology(
 
 /**
  *
+ * @param {BinaryTopology} mesh
  * @param {number} loop_id
  * @param {number} edge_id
- * @param {BinaryTopology} mesh
  */
-function link_loop_to_edge(loop_id, edge_id, mesh) {
+function link_loop_to_edge(mesh, loop_id, edge_id) {
     mesh.loop_write_edge(loop_id, edge_id);
 
     /**
@@ -127,11 +131,12 @@ function link_loop_to_edge(loop_id, edge_id, mesh) {
     const existing_loop = mesh.edge_read_loop(edge_id);
 
     if (existing_loop === NULL_POINTER) {
+
         // no loops connected yet
         mesh.edge_write_loop(edge_id, loop_id);
 
-
     } else {
+
         // insert loop between existing loop and the next one
         const next = mesh.loop_read_radial_next(existing_loop);
 
@@ -140,49 +145,9 @@ function link_loop_to_edge(loop_id, edge_id, mesh) {
 
         mesh.loop_write_radial_next(loop_id, next);
         mesh.loop_write_radial_prev(loop_id, existing_loop);
+
     }
 
 }
 
 
-/**
- * Ensure an edge between two vertices
- * NOTE: works without having to use a separate hash map, resulting in faster execution and smaller RAM requirement
- * @param {number} v0
- * @param {number} v1
- * @param {BinaryTopology} mesh
- */
-function get_or_create_edge_2(v0, v1, mesh) {
-    const first_edge = mesh.vertex_read_edge(v0);
-
-    if (first_edge !== NULL_POINTER) {
-
-        // iterate over all edges around the vertex
-        let edge = first_edge;
-
-        do {
-            const edge_v1 = mesh.edge_read_vertex1(edge);
-            const edge_v2 = mesh.edge_read_vertex2(edge);
-
-            if (edge_v1 === v1 || edge_v2 === v1) {
-                // found edge that connects between v0 and v1
-                return edge;
-            }
-
-            if (edge_v1 === v0) {
-                edge = mesh.edge_read_v1_disk_next(edge);
-            } else if (edge_v2 === v0) {
-                edge = mesh.edge_read_v2_disk_next(edge);
-            } else {
-                // invalid edge connection
-                throw new Error('Invalid edge, not connected to first vertex');
-            }
-
-        } while (edge !== first_edge);
-
-    }
-
-    // if match is found - return the match, else create a new edge and assign
-
-    return create_edge(mesh, v0, v1);
-}

package/src/core/geom/3d/topology/struct/binary/io/get_or_create_edge_map.js

@@ -1,5 +1,5 @@
+import { bt_edge_create } from "./bt_edge_create.js";
 import { OrderedEdge } from "./OrderedEdge.js";
-import { create_edge } from "./create_edge.js";
 
 /**
  *
@@ -18,7 +18,7 @@ function get_or_create_edge_map(v0, v1, map, mesh) {
     }
 
     // doesn't exist - create
-    const edge_id = create_edge(mesh, v0, v1);
+    const edge_id = bt_edge_create(mesh, v0, v1);
 
     map.set(scratch_ordered_edge, edge_id);
 

package/src/core/math/clamp.js

@@ -1,9 +1,9 @@
 /**
  * Constrain a value to lie between specified min/max values
  * @param {number} value
- * @param {number} min
- * @param {number} max
- * @returns {number}
+ * @param {number} min lower limit
+ * @param {number} max upper limit
+ * @returns {number} constrained value
  */
 export function clamp(value, min, max) {
     if (value < min) {

package/src/core/math/hash/computeObjectHash.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"computeObjectHash.d.ts","sourceRoot":"","sources":["../../../../../src/core/math/hash/computeObjectHash.js"],"names":[],"mappings":"AAGA;;;;;GAKG;AACH,sDAHW,MAAM,GACJ,MAAM,CA8ClB"}
+{"version":3,"file":"computeObjectHash.d.ts","sourceRoot":"","sources":["../../../../../src/core/math/hash/computeObjectHash.js"],"names":[],"mappings":"AAGA;;;;;GAKG;AACH,sDAHW,MAAM,GACJ,MAAM,CAgDlB"}

package/src/core/math/hash/computeObjectHash.js

@@ -1,5 +1,5 @@
-import { computeStringHash } from "../../primitives/strings/computeStringHash.js";
 import { computeHashFloat } from "../../primitives/numbers/computeHashFloat.js";
+import { computeStringHash } from "../../primitives/strings/computeStringHash.js";
 
 /**
  * Recursively computes object hash
@@ -32,6 +32,8 @@ export function computeObjectHash(value, depth = 3) {
             hash = 3;
         } else {
 
+            // TODO implement special path for arrays and typed arrays
+
             for (let p in value) {
 
                 const pNameHash = computeStringHash(p);

package/src/core/math/inverseLerp.d.ts

@@ -1,9 +1,14 @@
 /**
  * Compute fraction of linear interpolation
+ * @example
+ *  inverseLerp(1, 5, 1) === 0
+ *  inverseLerp(1, 5, 5) === 1
+ *  inverseLerp(1, 5, 3) === 0.5
+ *
  * @param {number} a
  * @param {number} b
  * @param {number} value
- * @returns {number} fraction
+ * @returns {number} fraction of where the {@link value{} lies between {@link a} and {@link b}
  */
 export function inverseLerp(a: number, b: number, value: number): number;
 //# sourceMappingURL=inverseLerp.d.ts.map

package/src/core/math/inverseLerp.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"inverseLerp.d.ts","sourceRoot":"","sources":["../../../../src/core/math/inverseLerp.js"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,+BALW,MAAM,KACN,MAAM,SACN,MAAM,GACJ,MAAM,CAgBlB"}
+{"version":3,"file":"inverseLerp.d.ts","sourceRoot":"","sources":["../../../../src/core/math/inverseLerp.js"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AACH,+BALW,MAAM,KACN,MAAM,SACN,MAAM,GACJ,MAAM,CAgBlB"}

package/src/core/math/inverseLerp.js

@@ -1,9 +1,14 @@
 /**
  * Compute fraction of linear interpolation
+ * @example
+ *  inverseLerp(1, 5, 1) === 0
+ *  inverseLerp(1, 5, 5) === 1
+ *  inverseLerp(1, 5, 3) === 0.5
+ *
  * @param {number} a
  * @param {number} b
  * @param {number} value
- * @returns {number} fraction
+ * @returns {number} fraction of where the {@link value{} lies between {@link a} and {@link b}
  */
 export function inverseLerp(a, b, value) {
     const range = b - a;

package/src/core/model/DebouncedObservedBoolean.d.ts

@@ -35,7 +35,6 @@ export class DebouncedObservedBoolean extends ObservedBoolean {
      * @param {boolean} v
      */
     set(v: boolean): this;
-    __value: any;
     /**
      *
      * @param {boolean} v
@@ -43,7 +42,6 @@ export class DebouncedObservedBoolean extends ObservedBoolean {
      * @private
      */
     private __handleSourceChange;
-    getValue(): any;
 }
 import ObservedBoolean from "./ObservedBoolean.js";
 //# sourceMappingURL=DebouncedObservedBoolean.d.ts.map

package/src/core/model/DebouncedObservedBoolean.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"DebouncedObservedBoolean.d.ts","sourceRoot":"","sources":["../../../../src/core/model/DebouncedObservedBoolean.js"],"names":[],"mappings":"2CAYU,MAAM;;;;;;AAQhB;;GAEG;AACH;IACI;;;;;OAKG;IACH,oBAJW,eAAe,QACf,MAAM,SACN,4BAA4B,GAAC,MAAM,EAY7C;IAPG,0BAAsB;IAEtB,aAAgB;IAEhB,wBAAqB;IAErB,aAAgB;IAGpB,aAGC;IAED,eAGC;IAGD;;;OAGG;IACH,uBAKC;IAED;;OAEG;IACH,0BAOC;IAED;;;OAGG;IACH,OAFW,OAAO,QAYjB;IANO,aAAgB;IAQxB;;;;;OAKG;IACH,6BAYC;IAED,gBAEC;CAEJ;4BAhH2B,sBAAsB"}
+{"version":3,"file":"DebouncedObservedBoolean.d.ts","sourceRoot":"","sources":["../../../../src/core/model/DebouncedObservedBoolean.js"],"names":[],"mappings":"2CAYU,MAAM;;;;;;AAQhB;;GAEG;AACH;IACI;;;;;OAKG;IACH,oBAJW,eAAe,QACf,MAAM,SACN,4BAA4B,GAAC,MAAM,EAY7C;IAPG,0BAAsB;IAEtB,aAAgB;IAEhB,wBAAqB;IAErB,aAAgB;IAGpB,aAGC;IAED,eAGC;IAGD;;;OAGG;IACH,uBAKC;IAED;;OAEG;IACH,0BAOC;IAED;;;OAGG;IACH,OAFW,OAAO,QAYjB;IAED;;;;;OAKG;IACH,6BAYC;CAMJ;4BAhH2B,sBAAsB"}

package/src/core/model/ObservedBoolean.d.ts

@@ -1,11 +1,81 @@
-import Signal from "../events/signal/Signal";
-
-export default class ObservedBoolean {
-    readonly onChanged: Signal<boolean, boolean>
-
-    constructor(value: boolean)
-
-    set(value: boolean): ObservedBoolean
-
-    getValue(): boolean
-}
+export default ObservedBoolean;
+declare class ObservedBoolean extends Boolean {
+    /**
+     *
+     * @param {boolean} value
+     * @constructor
+     */
+    constructor(value: boolean);
+    /**
+     * @readonly
+     * @type {Signal<boolean,boolean>}
+     */
+    readonly onChanged: Signal<boolean, boolean>;
+    /**
+     *
+     * @type {boolean}
+     * @private
+     */
+    private __value;
+    /**
+     *
+     * @param {boolean} value
+     * @returns {ObservedBoolean}
+     */
+    set(value: boolean): ObservedBoolean;
+    setTrue(): void;
+    setFalse(): void;
+    /**
+     *
+     * @param {ObservedBoolean} other
+     */
+    copy(other: ObservedBoolean): void;
+    /**
+     *
+     * @param {ObservedBoolean} other
+     * @returns {boolean}
+     */
+    equals(other: ObservedBoolean): boolean;
+    /**
+     *
+     * @return {number}
+     */
+    hashCode(): number;
+    /**
+     *
+     * @param {function(boolean)} f
+     */
+    process(f: (arg0: boolean) => any): void;
+    /**
+     *
+     * @returns {Boolean}
+     */
+    getValue(): boolean;
+    /**
+     * Flip value. If value is true - it becomes false, if it was false it becomes true
+     */
+    invert(): void;
+    toJSON(): boolean;
+    fromJSON(obj: any): void;
+    /**
+     *
+     * @param {BinaryBuffer} buffer
+     */
+    toBinaryBuffer(buffer: BinaryBuffer): void;
+    /**
+     *
+     * @param {BinaryBuffer} buffer
+     */
+    fromBinaryBuffer(buffer: BinaryBuffer): void;
+    /**
+     * @readonly
+     * @type {boolean}
+     */
+    readonly isObservedBoolean: boolean;
+}
+declare namespace ObservedBoolean {
+    let FALSE: ObservedBoolean;
+    let TRUE: ObservedBoolean;
+}
+import Signal from "../events/signal/Signal.js";
+//# sourceMappingURL=ObservedBoolean.d.ts.map

package/src/core/model/ObservedBoolean.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"ObservedBoolean.d.ts","sourceRoot":"","sources":["../../../../src/core/model/ObservedBoolean.js"],"names":[],"mappings":";AAGA;IACI;;;;OAIG;IACH,mBAHW,OAAO,EAgBjB;IARG;;;;OAIG;IACH,gBAAoB;IAEpB,0DAA6B;IAmBjC;;;;OAIG;IACH,qBAFa,eAAe,CAa3B;IAED,gBAEC;IAED,iBAEC;IAED;;;OAGG;IACH,YAFW,eAAe,QAIzB;IAED;;;;OAIG;IACH,cAHW,eAAe,GACb,OAAO,CAInB;IAED;;;OAGG;IACH,YAFY,MAAM,CAIjB;IAED;;;OAGG;IACH,WAFW,CAAS,IAAO,EAAP,OAAO,QAAC,QAK3B;IAED;;;OAGG;IACH,oBAEC;IAED;;OAEG;IACH,eAEC;IAED,kBAEC;IAED,yBAEC;IAED;;;OAGG;IACH,uBAFW,YAAY,QAItB;IAED;;;OAGG;IACH,yBAFW,YAAY,QAKtB;IAML;;;OAGG;IACH,4BAFU,OAAO,CAE0B;CAT1C;;;;;mBA1IkB,4BAA4B"}
+{"version":3,"file":"ObservedBoolean.d.ts","sourceRoot":"","sources":["../../../../src/core/model/ObservedBoolean.js"],"names":[],"mappings":";AAGA;IAQI;;;;OAIG;IACH,mBAHW,OAAO,EAcjB;IAtBD;;;OAGG;IACH,oBAFU,MAAM,CAAC,OAAO,EAAC,OAAO,CAAC,CAER;IAYrB;;;;OAIG;IACH,gBAAoB;IAmBxB;;;;OAIG;IACH,WAHW,OAAO,GACL,eAAe,CAa3B;IAED,gBAEC;IAED,iBAEC;IAED;;;OAGG;IACH,YAFW,eAAe,QAIzB;IAED;;;;OAIG;IACH,cAHW,eAAe,GACb,OAAO,CAInB;IAED;;;OAGG;IACH,YAFY,MAAM,CAIjB;IAED;;;OAGG;IACH,WAFW,CAAS,IAAO,EAAP,OAAO,QAAC,QAK3B;IAED;;;OAGG;IACH,oBAEC;IAED;;OAEG;IACH,eAEC;IAED,kBAEC;IAED,yBAEC;IAED;;;OAGG;IACH,uBAFW,YAAY,QAItB;IAED;;;OAGG;IACH,yBAFW,YAAY,QAKtB;IAeL;;;OAGG;IACH,4BAFU,OAAO,CAE0B;CAlB1C;;eAIS,eAAe;cAMf,eAAe;;mBAzJN,4BAA4B"}

package/src/core/model/ObservedBoolean.js

@@ -2,6 +2,13 @@ import { assert } from "../assert.js";
 import Signal from "../events/signal/Signal.js";
 
 class ObservedBoolean extends Boolean {
+
+    /**
+     * @readonly
+     * @type {Signal<boolean,boolean>}
+     */
+    onChanged = new Signal();
+
     /**
      *
      * @param {boolean} value
@@ -14,17 +21,15 @@ class ObservedBoolean extends Boolean {
 
         /**
          *
-         * @type {Boolean}
+         * @type {boolean}
          * @private
          */
         this.__value = value;
-
-        this.onChanged = new Signal();
     }
 
     /**
      *
-     * @returns {Boolean}
+     * @returns {boolean}
      */
     valueOf() {
         return this.__value;
@@ -40,7 +45,7 @@ class ObservedBoolean extends Boolean {
 
     /**
      *
-     * @param {Boolean} value
+     * @param {boolean} value
      * @returns {ObservedBoolean}
      */
     set(value) {
@@ -139,7 +144,16 @@ class ObservedBoolean extends Boolean {
     }
 }
 
+/**
+ * @readonly
+ * @type {ObservedBoolean}
+ */
 ObservedBoolean.FALSE = Object.freeze(new ObservedBoolean(false));
+
+/**
+ * @readonly
+ * @type {ObservedBoolean}
+ */
 ObservedBoolean.TRUE = Object.freeze(new ObservedBoolean(true));
 
 /**