@woosh/meep-engine 2.168.1 → 2.169.1

package/src/core/IdPool.d.ts

@@ -29,9 +29,9 @@ declare class IdPool {
     isUsed(id: number): boolean;
     /**
      * Traverse all IDs currently in use
-     * @param {function(id:number)} visitor
+     * @param {(id: number) => void} visitor
      */
-    traverseUsed(visitor: any): void;
+    traverseUsed(visitor: (id: number) => void): void;
     /**
      *
      * @param {number} id

package/src/core/IdPool.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"IdPool.d.ts","sourceRoot":"","sources":["../../../src/core/IdPool.js"],"names":[],"mappings":";AAGA;;;GAGG;AACH;IAOI;;;;OAIG;IACH,QAFa,MAAM,CAIlB;IAED;;;OAGG;IACH,OAFa,MAAM,CAQlB;IAED;;;;OAIG;IACH,gBAHW,MAAM,GACL,OAAO,CASlB;IAED;;;;OAIG;IACH,WAHW,MAAM,GACJ,OAAO,CAInB;IAED;;;OAGG;IACH,iCASC;IAED;;;OAGG;IACH,YAFW,MAAM,QAIhB;IAED;;OAEG;IACH,cAEC;;CACJ"}
+{"version":3,"file":"IdPool.d.ts","sourceRoot":"","sources":["../../../src/core/IdPool.js"],"names":[],"mappings":";AAGA;;;GAGG;AACH;IAOI;;;;OAIG;IACH,QAFa,MAAM,CAIlB;IAED;;;OAGG;IACH,OAFa,MAAM,CAQlB;IAED;;;;OAIG;IACH,gBAHW,MAAM,GACL,OAAO,CASlB;IAED;;;;OAIG;IACH,WAHW,MAAM,GACJ,OAAO,CAInB;IAED;;;OAGG;IACH,2BAFgB,MAAM,KAAK,IAAI,QAW9B;IAED;;;OAGG;IACH,YAFW,MAAM,QAIhB;IAED;;OAEG;IACH,cAEC;;CACJ"}

package/src/core/IdPool.js

@@ -58,7 +58,7 @@ class IdPool {
 
     /**
      * Traverse all IDs currently in use
-     * @param {function(id:number)} visitor
+     * @param {(id: number) => void} visitor
      */
     traverseUsed(visitor) {
         assert.isFunction(visitor, "visitor");

package/src/core/binary/32BitEncoder.d.ts

@@ -1,11 +1,10 @@
 /**
  * Builds an encoder/decoder to simplify process of reading/writing various parts of a 32 bit field
  * @param {number[]} bitCounts
- * @returns {{encode: function(...number):number, decode: function(value:number, result:number[]):void}}
+ * @returns {{encode: function(...number):number, decode: (value: number, result: number[]) => void}}
  */
 export function create32BitCodec(bitCounts: number[]): {
     encode: (...args: number[]) => number;
-    decode: (arg0: value) => number;
-    result: number[];
+    decode: (value: number, result: number[]) => void;
 };
 //# sourceMappingURL=32BitEncoder.d.ts.map

package/src/core/binary/32BitEncoder.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"32BitEncoder.d.ts","sourceRoot":"","sources":["../../../../src/core/binary/32BitEncoder.js"],"names":[],"mappings":"AAGA;;;;GAIG;AACH,4CAHW,MAAM,EAAE;sBACe,MAAM,OAAE,MAAM;6BAAyB,MAAM;YAAS,MAAM,EAAE;EA8D/F"}
+{"version":3,"file":"32BitEncoder.d.ts","sourceRoot":"","sources":["../../../../src/core/binary/32BitEncoder.js"],"names":[],"mappings":"AAGA;;;;GAIG;AACH,4CAHW,MAAM,EAAE;sBACe,MAAM,OAAE,MAAM;oBAAkB,MAAM,UAAU,MAAM,EAAE,KAAK,IAAI;EA8DlG"}

package/src/core/binary/32BitEncoder.js

@@ -4,7 +4,7 @@ import { assert } from "../assert.js";
 /**
  * Builds an encoder/decoder to simplify process of reading/writing various parts of a 32 bit field
  * @param {number[]} bitCounts
- * @returns {{encode: function(...number):number, decode: function(value:number, result:number[]):void}}
+ * @returns {{encode: function(...number):number, decode: (value: number, result: number[]) => void}}
  */
 export function create32BitCodec(bitCounts) {
     assert.isArray(bitCounts, 'bitCounts');

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

@@ -1 +1 @@
-{"version":3,"file":"BinaryBuffer.d.ts","sourceRoot":"","sources":["../../../../src/core/binary/BinaryBuffer.js"],"names":[],"mappings":"AA+BA;;;;;;;;;;;;;;;;;;GAkBG;AACH;IAivCI;;;;OAIG;IACH,4BAHW,UAAU,GACT,YAAY,CAUvB;IAED;;;;OAIG;IACH,0BAHW,WAAW,GACV,YAAY,CAQvB;IAED;;;;;OAKG;IACH,8BAJW,YAAY,UACZ,YAAY,GACV,MAAM,CAQlB;IAED;;;;;OAKG;IACH,2BAJW,YAAY,UACZ,YAAY,GACV,MAAM,CAQlB;IAED;;;;;OAKG;IACH,yBAJW,YAAY,UACZ,YAAY,GACV,MAAM,CAQlB;IAED;;;;;OAKG;IACH,0BAJW,YAAY,UACZ,YAAY,GACV,MAAM,CAQlB;IAED;;;;;OAKG;IACH,0BAJW,YAAY,UACZ,YAAY,GACV,MAAM,CAQlB;IAED;;;;;OAKG;IACH,2BAJW,YAAY,UACZ,YAAY,GACV,MAAM,CAQlB;IAED;;;;;OAKG;IACH,2BAJW,YAAY,UACZ,YAAY,GACV,MAAM,CAQlB;IAED;;;;;;OAMG;IACH,yBALW,YAAY,UACZ,YAAY,UACZ,MAAM,GACJ,UAAU,CActB;IAh4CD;;;;;OAKG;IACH,YAFU,UAAU,GAAC,OAAO,CAES;IAErC;;;;;OAKG;IACH,UAFU,MAAM,CAEH;IASb;;OAEG;IACH,sBAEC;IAZD;;OAEG;IACH,mBAEC;IASD;;;OAGG;IACH,UAFU,MAAM,CAEgB;IAEhC;;;;;;OAMG;IACH,aAA6C;IAE7C;;;;OAIG;IACH,iBAAmC;IAEnC;;;;OAIG;IACH,qBAAyC;IAEzC;;;;OAIG;IACH,qBAAmB;IAEnB;;;OAGG;IACH,4BAEC;IAED;;;;;;OAMG;IACH,sBAFW,WAAW,QAYrB;IAED;;;;OAIG;IACH,QAFa,YAAY,CAMxB;IAED;;;;OAIG;IACH,iBAFW,MAAM,QAMhB;IAED;;;;;;;;OAQG;IACH,sBAJW,MAAM,QAqChB;IAED;;;OAGG;IACH,6BAFW,MAAM,QAuBhB;IAED;;;OAGG;IACH,eAFa,MAAM,CAMlB;IAED;;;OAGG;IACH,eAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,eAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,YAFY,MAAM,CAQjB;IAED;;;OAGG;IACH,aAFY,MAAM,CAQjB;IAED;;;OAGG;IACH,aAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,aAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,aAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,cAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,gBAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,gBAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,cAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,gBAFa,MAAM,CAUlB;IAED;;;OAGG;IACH,gBAFa,MAAM,CAUlB;IAED;;;OAGG;IACH,cAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,gBAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,gBAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,cAFa,MAAM,CAQlB;IAED;;;;;OAKG;IACH,4BAFW,UAAU,sBAFV,MAAM,UACN,MAAM,QAOhB;IAED;;;;;OAKG;IACH,6BAFW,WAAW,sBAFX,MAAM,UACN,MAAM,QAOhB;IAED;;;;;OAKG;IACH,6BAFW,WAAW,GAAC,MAAM,EAAE,GAAC,UAAU,MAAM,CAAC,sBAFtC,MAAM,UACN,MAAM,QAOhB;IAED;;;;;OAKG;IACH,2BAFW,SAAS,sBAFT,MAAM,UACN,MAAM,QAOhB;IAED;;;;;OAKG;IACH,4BAFW,UAAU,sBAFV,MAAM,UACN,MAAM,QAOhB;IAED;;;;;OAKG;IACH,4BAFW,UAAU,sBAFV,MAAM,UACN,MAAM,QAOhB;IAED;;;;;OAKG;IACH,8BAFW,YAAY,GAAC,MAAM,EAAE,sBAFrB,MAAM,UACN,MAAM,QAOhB;IAED;;;;;OAKG;IACH,8BAFW,YAAY,sBAFZ,MAAM,UACN,MAAM,QAOhB;IAED;;;;;OAKG;IACH,0BAFW,YAAY,GAAC,MAAM,EAAE,iBAFrB,MAAM,UACN,MAAM,QAUhB;IAED;;;;;OAKG;IACH,0BAFW,YAAY,GAAC,MAAM,EAAE,iBAFrB,MAAM,UACN,MAAM,QAUhB;IAED;;;;;OAKG;IACH,8BAFW,YAAY,GAAC,MAAM,EAAE,sBAFrB,MAAM,UACN,MAAM,QAOhB;IAED;;;OAGG;IACH,oBAFW,MAAM,QAMhB;IAED;;;OAGG;IACH,oBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,oBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,iBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,kBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,kBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,kBAFW,MAAM,QAShB;IAED;;;;;OAKG;IACH,uBAJW,SAAS,GAAC,MAAM,EAAE,GAAC,UAAU,MAAM,CAAC,iBACpC,MAAM,UACN,MAAM,QAYhB;IAED;;;;;OAKG;IACH,wBAJW,UAAU,GAAC,MAAM,EAAE,GAAC,UAAU,MAAM,CAAC,iBACrC,MAAM,UACN,MAAM,QAYhB;IAED;;;;;OAKG;IACH,wBAJW,UAAU,GAAC,MAAM,EAAE,GAAC,UAAU,MAAM,CAAC,iBACrC,MAAM,UACN,MAAM,QAYhB;IAED;;;OAGG;IACH,kBAFW,MAAM,QAShB;IAED;;;;;OAKG;IACH,wBAJW,UAAU,GAAC,MAAM,EAAE,iBACnB,MAAM,UACN,MAAM,QAQhB;IAED;;;OAGG;IACH,mBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,qBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,qBAFW,MAAM,QAShB;IAED;;;;;OAKG;IACH,yBAJW,WAAW,GAAC,MAAM,EAAE,iBACpB,MAAM,UACN,MAAM,QAQhB;IAED;;;OAGG;IACH,mBAFW,MAAM,QAQhB;IAED;;;OAGG;IACH,qBAFW,MAAM,QAgBhB;IAED;;;OAGG;IACH,qBAFW,MAAM,QAgBhB;IAED;;;;;;OAMG;IACH,oBAFW,MAAM,QAuBhB;IAED;;;OAGG;IACH,eAFa,MAAM,CAqBlB;IAED;;;OAGG;IACH,mBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,qBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,qBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,mBAFW,MAAM,QAShB;IAED;;;;;OAKG;IACH,yBAJW,WAAW,GAAC,MAAM,EAAE,GAAC,UAAU,MAAM,CAAC,iBACtC,MAAM,UACN,MAAM,QAYhB;IAED;;;;;OAKG;IACH,kBAJW,UAAU,GAAC,iBAAiB,iBAC5B,MAAM,UACN,MAAM,QAgChB;IAED;;;;;OAKG;IACH,uBAJW,UAAU,sBACV,MAAM,UACN,MAAM,QAiBhB;IAED;;;OAGG;IACH,wBAFW,MAAM,QAqFhB;IAED;;;OAGG;IACH,kBAFa,MAAM,CAuElB;IAED;;;;;;;;OAQG;IACH,yBAFW,MAAM,QAuBhB;IAED;;;;;;;;;OASG;IACH,4BAJW,MAAM,oBACN,OAAO,GACL,MAAM,CAoBlB;IAED;;;;OAIG;IACH,YAFY,MAAM,CAIjB;IAED;;;;;;;;;;;OAWG;IACH,eAFY,MAAM,CAcjB;IAsJL;;;OAGG;IACH,yBAFU,OAAO,CAEoB;CANpC;2BA76C0B,iBAAiB"}
+{"version":3,"file":"BinaryBuffer.d.ts","sourceRoot":"","sources":["../../../../src/core/binary/BinaryBuffer.js"],"names":[],"mappings":"AA+BA;;;;;;;;;;;;;;;;;;GAkBG;AACH;IA4vCI;;;;OAIG;IACH,4BAHW,UAAU,GACT,YAAY,CAUvB;IAED;;;;OAIG;IACH,0BAHW,WAAW,GACV,YAAY,CAQvB;IAED;;;;;OAKG;IACH,8BAJW,YAAY,UACZ,YAAY,GACV,MAAM,CAQlB;IAED;;;;;OAKG;IACH,2BAJW,YAAY,UACZ,YAAY,GACV,MAAM,CAQlB;IAED;;;;;OAKG;IACH,yBAJW,YAAY,UACZ,YAAY,GACV,MAAM,CAQlB;IAED;;;;;OAKG;IACH,0BAJW,YAAY,UACZ,YAAY,GACV,MAAM,CAQlB;IAED;;;;;OAKG;IACH,0BAJW,YAAY,UACZ,YAAY,GACV,MAAM,CAQlB;IAED;;;;;OAKG;IACH,2BAJW,YAAY,UACZ,YAAY,GACV,MAAM,CAQlB;IAED;;;;;OAKG;IACH,2BAJW,YAAY,UACZ,YAAY,GACV,MAAM,CAQlB;IAED;;;;;;OAMG;IACH,yBALW,YAAY,UACZ,YAAY,UACZ,MAAM,GACJ,UAAU,CActB;IA34CD;;;;;OAKG;IACH,YAFU,UAAU,GAAC,OAAO,CAES;IAErC;;;;;OAKG;IACH,UAFU,MAAM,CAEH;IASb;;OAEG;IACH,sBAEC;IAZD;;OAEG;IACH,mBAEC;IASD;;;OAGG;IACH,UAFU,MAAM,CAEgB;IAEhC;;;;;;OAMG;IACH,aAA6C;IAE7C;;;;OAIG;IACH,iBAAmC;IAEnC;;;;OAIG;IACH,qBAAyC;IAEzC;;;;OAIG;IACH,qBAAmB;IAEnB;;;OAGG;IACH,4BAEC;IAED;;;;;;OAMG;IACH,sBAFW,WAAW,QAYrB;IAED;;;;OAIG;IACH,QAFa,YAAY,CAMxB;IAED;;;;OAIG;IACH,iBAFW,MAAM,QAMhB;IAED;;;;;;;;OAQG;IACH,sBAJW,MAAM,QAqChB;IAED;;;OAGG;IACH,6BAFW,MAAM,QAuBhB;IAED;;;OAGG;IACH,eAFa,MAAM,CAMlB;IAED;;;OAGG;IACH,eAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,eAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,YAFY,MAAM,CAQjB;IAED;;;OAGG;IACH,aAFY,MAAM,CAQjB;IAED;;;OAGG;IACH,aAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,aAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,aAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,cAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,gBAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,gBAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,cAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,gBAFa,MAAM,CAUlB;IAED;;;OAGG;IACH,gBAFa,MAAM,CAUlB;IAED;;;OAGG;IACH,cAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,gBAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,gBAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,cAFa,MAAM,CAQlB;IAED;;;;;OAKG;IACH,4BAFW,UAAU,sBAFV,MAAM,UACN,MAAM,QAOhB;IAED;;;;;OAKG;IACH,6BAFW,WAAW,sBAFX,MAAM,UACN,MAAM,QAOhB;IAED;;;;;OAKG;IACH,6BAFW,WAAW,GAAC,MAAM,EAAE,GAAC,UAAU,MAAM,CAAC,sBAFtC,MAAM,UACN,MAAM,QAOhB;IAED;;;;;OAKG;IACH,2BAFW,SAAS,sBAFT,MAAM,UACN,MAAM,QAOhB;IAED;;;;;OAKG;IACH,4BAFW,UAAU,sBAFV,MAAM,UACN,MAAM,QAOhB;IAED;;;;;OAKG;IACH,4BAFW,UAAU,sBAFV,MAAM,UACN,MAAM,QAOhB;IAED;;;;;OAKG;IACH,8BAFW,YAAY,GAAC,MAAM,EAAE,sBAFrB,MAAM,UACN,MAAM,QAOhB;IAED;;;;;OAKG;IACH,8BAFW,YAAY,sBAFZ,MAAM,UACN,MAAM,QAOhB;IAED;;;;;OAKG;IACH,0BAFW,YAAY,GAAC,MAAM,EAAE,iBAFrB,MAAM,UACN,MAAM,QAUhB;IAED;;;;;OAKG;IACH,0BAFW,YAAY,GAAC,MAAM,EAAE,iBAFrB,MAAM,UACN,MAAM,QAUhB;IAED;;;;;OAKG;IACH,8BAFW,YAAY,GAAC,MAAM,EAAE,sBAFrB,MAAM,UACN,MAAM,QAOhB;IAED;;;OAGG;IACH,oBAFW,MAAM,QAMhB;IAED;;;OAGG;IACH,oBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,oBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,iBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,kBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,kBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,kBAFW,MAAM,QAShB;IAED;;;;;OAKG;IACH,uBAJW,SAAS,GAAC,MAAM,EAAE,GAAC,UAAU,MAAM,CAAC,iBACpC,MAAM,UACN,MAAM,QAYhB;IAED;;;;;OAKG;IACH,wBAJW,UAAU,GAAC,MAAM,EAAE,GAAC,UAAU,MAAM,CAAC,iBACrC,MAAM,UACN,MAAM,QAYhB;IAED;;;;;OAKG;IACH,wBAJW,UAAU,GAAC,MAAM,EAAE,GAAC,UAAU,MAAM,CAAC,iBACrC,MAAM,UACN,MAAM,QAYhB;IAED;;;OAGG;IACH,kBAFW,MAAM,QAShB;IAED;;;;;OAKG;IACH,wBAJW,UAAU,GAAC,MAAM,EAAE,iBACnB,MAAM,UACN,MAAM,QAQhB;IAED;;;OAGG;IACH,mBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,qBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,qBAFW,MAAM,QAShB;IAED;;;;;OAKG;IACH,yBAJW,WAAW,GAAC,MAAM,EAAE,iBACpB,MAAM,UACN,MAAM,QAQhB;IAED;;;OAGG;IACH,mBAFW,MAAM,QAQhB;IAED;;;OAGG;IACH,qBAFW,MAAM,QAgBhB;IAED;;;OAGG;IACH,qBAFW,MAAM,QAgBhB;IAED;;;;;;OAMG;IACH,oBAFW,MAAM,QAuBhB;IAED;;;OAGG;IACH,eAFa,MAAM,CAqBlB;IAED;;;OAGG;IACH,mBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,qBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,qBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,mBAFW,MAAM,QAShB;IAED;;;;;OAKG;IACH,yBAJW,WAAW,GAAC,MAAM,EAAE,GAAC,UAAU,MAAM,CAAC,iBACtC,MAAM,UACN,MAAM,QAYhB;IAED;;;;;OAKG;IACH,kBAJW,UAAU,GAAC,iBAAiB,iBAC5B,MAAM,UACN,MAAM,QAgChB;IAED;;;;;OAKG;IACH,uBAJW,UAAU,sBACV,MAAM,UACN,MAAM,QAiBhB;IAED;;;OAGG;IACH,wBAFW,MAAM,QAgGhB;IAED;;;OAGG;IACH,kBAFa,MAAM,CAuElB;IAED;;;;;;;;OAQG;IACH,yBAFW,MAAM,QAuBhB;IAED;;;;;;;;;OASG;IACH,4BAJW,MAAM,oBACN,OAAO,GACL,MAAM,CAoBlB;IAED;;;;OAIG;IACH,YAFY,MAAM,CAIjB;IAED;;;;;;;;;;;OAWG;IACH,eAFY,MAAM,CAcjB;IAsJL;;;OAGG;IACH,yBAFU,OAAO,CAEoB;CANpC;2BAx7C0B,iBAAiB"}

package/src/core/binary/BinaryBuffer.js

@@ -1104,13 +1104,24 @@ export class BinaryBuffer {
                     }
                 }
                 if (value >= 0xd800 && value <= 0xdbff) {
-                    continue;  // drop lone surrogate
+                    // Unpaired high surrogate. Skipping it would emit no bytes
+                    // for a code unit the length header already counted, and the
+                    // reader -- which stops on the code-unit count -- would then
+                    // run past the end of the string into the next field.
+                    // Substitute U+FFFD, which is what TextEncoder does and
+                    // keeps one code unit in, one code unit out.
+                    value = 0xfffd;
                 }
             }
 
             // expand the buffer if we couldn't write 4 bytes
             if (cursor + 4 > capacity) {
 
+                // setCapacity only preserves bytes below `position`, and the
+                // loop writes ahead of it, so publish the cursor first or the
+                // string body written so far is dropped by the reallocation
+                this.position = cursor;
+
                 this.ensureCapacity(cursor + 4);
 
                 // rebind variables

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

@@ -23,7 +23,11 @@ export class BitImage2 {
     height: number;
     words_per_row: number;
     data: Uint32Array;
-    /** @param {number} x @param {number} y @returns {number} 0 or 1 */
+    /**
+     * @param {number} x
+     * @param {number} y
+     * @returns {number} 0 or 1
+     */
     get(x: number, y: number): number;
     /**
      * Set the bit at (x, y). x must be < width (no out-of-row bits).

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

@@ -1 +1 @@
-{"version":3,"file":"BitImage2.d.ts","sourceRoot":"","sources":["../../../../src/core/binary/BitImage2.js"],"names":[],"mappings":"AAEA;;;;;;;;;;;;;;GAcG;AACH;IACI;;;OAGG;IACH,mBAHW,MAAM,UACN,MAAM,EAUhB;IAJG,cAAkB;IAClB,eAAoB;IACpB,sBAAuD;IACvD,kBAAqE;IAGzE,mEAAmE;IACnE,OADY,MAAM,KAAY,MAAM,GAAc,MAAM,CAGvD;IAED;;;;;OAKG;IACH,OAHW,MAAM,KACN,MAAM,QAIhB;IAED,sBAAsB;IACtB,cAEC;IAED,2CAA2C;IAC3C,eADc,MAAM,CAanB;IAED;;;;;;;;OAQG;IACH,eALW,SAAS,MACT,MAAM,MACN,MAAM,GACJ,OAAO,CAkCnB;IAED;;;;;;;OAOG;IACH,eAJW,SAAS,MACT,MAAM,MACN,MAAM,QAwBhB;IAED;;;;;OAKG;IACH,eAFW,MAAM,QA0BhB;IAED;;;;;;;OAOG;IACH,2BAHW,MAAM,cACN,MAAM,QA0BhB;IAED;;;;;;OAMG;IACH,cAFa,SAAS,CAMrB;IAED;;;;;;OAMG;IACH,qBAFW,SAAS,QAcnB;CACJ"}
+{"version":3,"file":"BitImage2.d.ts","sourceRoot":"","sources":["../../../../src/core/binary/BitImage2.js"],"names":[],"mappings":"AAEA;;;;;;;;;;;;;;GAcG;AACH;IACI;;;OAGG;IACH,mBAHW,MAAM,UACN,MAAM,EAUhB;IAJG,cAAkB;IAClB,eAAoB;IACpB,sBAAuD;IACvD,kBAAqE;IAGzE;;;;OAIG;IACH,OAJW,MAAM,KACN,MAAM,GACJ,MAAM,CAIlB;IAED;;;;;OAKG;IACH,OAHW,MAAM,KACN,MAAM,QAIhB;IAED,sBAAsB;IACtB,cAEC;IAED,2CAA2C;IAC3C,eADc,MAAM,CAanB;IAED;;;;;;;;OAQG;IACH,eALW,SAAS,MACT,MAAM,MACN,MAAM,GACJ,OAAO,CAkCnB;IAED;;;;;;;OAOG;IACH,eAJW,SAAS,MACT,MAAM,MACN,MAAM,QAwBhB;IAED;;;;;OAKG;IACH,eAFW,MAAM,QA0BhB;IAED;;;;;;;OAOG;IACH,2BAHW,MAAM,cACN,MAAM,QA0BhB;IAED;;;;;;OAMG;IACH,cAFa,SAAS,CAMrB;IAED;;;;;;OAMG;IACH,qBAFW,SAAS,QAcnB;CACJ"}

package/src/core/binary/BitImage2.js

@@ -30,7 +30,11 @@ export class BitImage2 {
         this.data = new Uint32Array(this.words_per_row * Math.max(1, height));
     }
 
-    /** @param {number} x @param {number} y @returns {number} 0 or 1 */
+    /**
+     * @param {number} x
+     * @param {number} y
+     * @returns {number} 0 or 1
+     */
     get(x, y) {
         return (this.data[y * this.words_per_row + (x >>> 5)] >>> (x & 31)) & 1;
     }

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

@@ -353,10 +353,10 @@ export class BVH {
     release_all(): void;
     /**
      *
-     * @param {function(node:number, tree:BVH):void} callback
+     * @param {(node: number, tree: BVH) => void} callback
      * @param {*} [ctx]
      */
-    traverse(callback: any, ctx?: any): void;
+    traverse(callback: (node: number, tree: BVH) => void, ctx?: any): void;
     /**
      *
      * @param {number[]} destination

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,8BAA+B;AAC/B,+BAAgC;AAChC,+BAAgC;AAChC,8BAA+B;AAE/B;;;;;GAKG;AACH,+BAFU,MAAM,CAE+B;AAE/C;;;GAGG;AACH,wBAFU,MAAM,CAEoB;AAcpC;;;;;GAKG;AACH,iCAFU,MAAM,CAEqB;AAiBrC;;;;;;;;GAQG;AACH;IAEI;;;;OAIG;IACH,sBAAuE;IAYvE;;;;;OAKG;IACH,kCAeC;IA/BD;;;;;OAKG;IACH,+BAEC;IAyBD;;;;OAIG;IACH,uBAAsD;IAUtD;;;;OAIG;IACH,sBAAoD;IAEpD;;;;OAIG;IACH,mBAA8B;IApB9B;;;OAGG;IACH,iCAEC;IAgBD;;;;OAIG;IACH,eAAW;IAEX;;;;OAIG;IACH,eAAY;IAEZ;;;;OAIG;IACH,uBAAmB;IAEnB;;;;OAIG;IACH,eAAmB;IAUnB;;;OAGG;IACH,sBAEC;IAdD;;;OAGG;IACH,mBAEC;IAUD;;;;OAIG;IACH,mBAEC;IAUD;;;OAGG;IACH,+BAMC;IAlBD;;;OAGG;IACH,4BAEC;IAcD,wBAgBC;IAED;;;;OAIG;IACH,uBA6BC;IAED;;OAEG;IACH,aAIC;IAED;;;;;;;OAOG;IACH,4BAFW,MAAM,QAQhB;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,UAAU,MAAM,CAAC,QAAM,QAsB1C;IAED;;;;OAIG;IACH,mBAHW,MAAM,QACN,MAAM,EAAE,QAYlB;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,yBAmCC;IAED;;;;OAIG;IACH,kBAHW,MAAM,GACJ,IAAI,CA6ChB;IAED;;;;;;;;;;;OAWG;IACH,uBAoMC;IAED;;;;;;;;;;;;;;;;;;;OAmBG;IACH,uBAwHC;IAED;;;;;;OAMG;IACH,6BAJW,MAAM,WACN,MAAM,WACN,MAAM,QAWhB;IAED;;;;;;;OAOG;IACH,kCAJW,MAAM,WACN,MAAM,WACN,MAAM,QAmBhB;IAED;;;OAGG;IACH,oBAIC;IAED;;;;OAIG;IACH,yCA8BC;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;IAGL;;;;OAIG;IACH,gBAFU,OAAO,CAEE;CAPlB"}
+{"version":3,"file":"BVH.d.ts","sourceRoot":"","sources":["../../../../../src/core/bvh2/bvh3/BVH.js"],"names":[],"mappings":"AASA,8BAA+B;AAC/B,+BAAgC;AAChC,+BAAgC;AAChC,8BAA+B;AAE/B;;;;;GAKG;AACH,+BAFU,MAAM,CAE+B;AAE/C;;;GAGG;AACH,wBAFU,MAAM,CAEoB;AAcpC;;;;;GAKG;AACH,iCAFU,MAAM,CAEqB;AAiBrC;;;;;;;;GAQG;AACH;IAEI;;;;OAIG;IACH,sBAAuE;IAYvE;;;;;OAKG;IACH,kCAeC;IA/BD;;;;;OAKG;IACH,+BAEC;IAyBD;;;;OAIG;IACH,uBAAsD;IAUtD;;;;OAIG;IACH,sBAAoD;IAEpD;;;;OAIG;IACH,mBAA8B;IApB9B;;;OAGG;IACH,iCAEC;IAgBD;;;;OAIG;IACH,eAAW;IAEX;;;;OAIG;IACH,eAAY;IAEZ;;;;OAIG;IACH,uBAAmB;IAEnB;;;;OAIG;IACH,eAAmB;IAUnB;;;OAGG;IACH,sBAEC;IAdD;;;OAGG;IACH,mBAEC;IAUD;;;;OAIG;IACH,mBAEC;IAUD;;;OAGG;IACH,+BAMC;IAlBD;;;OAGG;IACH,4BAEC;IAcD,wBAgBC;IAED;;;;OAIG;IACH,uBA6BC;IAED;;OAEG;IACH,aAIC;IAED;;;;;;;OAOG;IACH,4BAFW,MAAM,QAQhB;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,UAAU,MAAM,CAAC,QAAM,QAsB1C;IAED;;;;OAIG;IACH,mBAHW,MAAM,QACN,MAAM,EAAE,QAYlB;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,yBAmCC;IAED;;;;OAIG;IACH,kBAHW,MAAM,GACJ,IAAI,CA6ChB;IAED;;;;;;;;;;;OAWG;IACH,uBAoMC;IAED;;;;;;;;;;;;;;;;;;;OAmBG;IACH,uBAwHC;IAED;;;;;;OAMG;IACH,6BAJW,MAAM,WACN,MAAM,WACN,MAAM,QAWhB;IAED;;;;;;;OAOG;IACH,kCAJW,MAAM,WACN,MAAM,WACN,MAAM,QAmBhB;IAED;;;OAGG;IACH,oBAIC;IAED;;;;OAIG;IACH,0BAHkB,MAAM,QAAQ,GAAG,KAAK,IAAI,mBAiC3C;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;IAGL;;;;OAIG;IACH,gBAFU,OAAO,CAEE;CAPlB"}

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

@@ -1296,7 +1296,7 @@ export class BVH {
 
     /**
      *
-     * @param {function(node:number, tree:BVH):void} callback
+     * @param {(node: number, tree: BVH) => void} callback
      * @param {*} [ctx]
      */
     traverse(callback, ctx) {

package/src/core/bvh2/bvh3/query/bvh_query_user_data_nearest_to_point_filtered.d.ts

@@ -15,9 +15,9 @@
  * @param {number} x
  * @param {number} y
  * @param {number} z
- * @param {function(userData:number):boolean} filter keep a leaf iff this returns true for its user data
+ * @param {(userData: number) => boolean} filter keep a leaf iff this returns true for its user data
  * @param {number} [max_distance=Infinity] how far to search
  * @returns {number} user data of the nearest passing leaf, or -1 if none qualifies
  */
-export function bvh_query_user_data_nearest_to_point_filtered(bvh: BVH, x: number, y: number, z: number, filter: any, max_distance?: number): number;
+export function bvh_query_user_data_nearest_to_point_filtered(bvh: BVH, x: number, y: number, z: number, filter: (userData: number) => boolean, max_distance?: number): number;
 //# sourceMappingURL=bvh_query_user_data_nearest_to_point_filtered.d.ts.map

package/src/core/bvh2/bvh3/query/bvh_query_user_data_nearest_to_point_filtered.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"bvh_query_user_data_nearest_to_point_filtered.d.ts","sourceRoot":"","sources":["../../../../../../src/core/bvh2/bvh3/query/bvh_query_user_data_nearest_to_point_filtered.js"],"names":[],"mappings":"AAMA;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,2EAPW,MAAM,KACN,MAAM,KACN,MAAM,8BAEN,MAAM,GACJ,MAAM,CA4DlB"}
+{"version":3,"file":"bvh_query_user_data_nearest_to_point_filtered.d.ts","sourceRoot":"","sources":["../../../../../../src/core/bvh2/bvh3/query/bvh_query_user_data_nearest_to_point_filtered.js"],"names":[],"mappings":"AAMA;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,2EAPW,MAAM,KACN,MAAM,KACN,MAAM,qBACK,MAAM,KAAK,OAAO,iBAC7B,MAAM,GACJ,MAAM,CA4DlB"}

package/src/core/bvh2/bvh3/query/bvh_query_user_data_nearest_to_point_filtered.js

@@ -1,86 +1,86 @@
-import { SCRATCH_UINT32_TRAVERSAL_STACK } from "../../../collection/SCRATCH_UINT32_TRAVERSAL_STACK.js";
-import { aabb3_unsigned_distance_sqr_to_point } from "../../../geom/3d/aabb/aabb3_unsigned_distance_sqr_to_point.js";
-import { COLUMN_CHILD_1, COLUMN_CHILD_2, ELEMENT_WORD_COUNT, NULL_NODE } from "../BVH.js";
-
-const stack = SCRATCH_UINT32_TRAVERSAL_STACK;
-
-/**
- * Nearest leaf to a point whose user data PASSES `filter` — the branch-and-bound search of
- * {@link bvh_query_user_data_nearest_to_point}, except a leaf only becomes the new best when
- * `filter(userData)` returns true. Branches farther than the current best PASSING leaf are still pruned, so
- * `filter` runs only on leaves nearer than the best so far — typically a handful, not every leaf. Lets a
- * caller reject candidates by an external predicate the BVH itself can't express (e.g. line-of-sight from
- * the query point).
- *
- * Re-entrancy: this consumer keeps the shared traversal `pointer` live (advances the global pointer while
- * walking), so per the {@link SCRATCH_UINT32_TRAVERSAL_STACK} contract `filter` MAY itself run a nested
- * BVH walk (it pushes above this live frame and drains back). `filter` must not throw (a throw mid-walk
- * leaves the shared pointer elevated).
- *
- * @param {BVH} bvh
- * @param {number} x
- * @param {number} y
- * @param {number} z
- * @param {function(userData:number):boolean} filter keep a leaf iff this returns true for its user data
- * @param {number} [max_distance=Infinity] how far to search
- * @returns {number} user data of the nearest passing leaf, or -1 if none qualifies
- */
-export function bvh_query_user_data_nearest_to_point_filtered(bvh, x, y, z, filter, max_distance = Infinity) {
-    const root = bvh.root;
-
-    if (root === NULL_NODE) {
-        return -1;
-    }
-
-    const stack_top = stack.pointer++;
-
-    stack[stack_top] = root;
-
-    let best_user_data = -1;
-    let best_distance_sqr = max_distance * max_distance;
-
-    // bind data directly to avoid extra copies reading out AABBs
-    const float32 = bvh.__data_float32;
-    const uint32 = bvh.__data_uint32;
-
-    do {
-        stack.pointer--;
-
-        const node = stack[stack.pointer];
-
-        const address = node * ELEMENT_WORD_COUNT;
-
-        const distance_sqr = aabb3_unsigned_distance_sqr_to_point(
-            float32[address], float32[address + 1], float32[address + 2],
-            float32[address + 3], float32[address + 4], float32[address + 5],
-            x, y, z
-        );
-
-        if (distance_sqr >= best_distance_sqr) {
-            // node (or its whole subtree) can't beat the best passing leaf
-            continue;
-        }
-
-        const child_1 = uint32[address + COLUMN_CHILD_1];
-
-        if (child_1 !== NULL_NODE) {
-
-            // not a leaf — push children onto the traversal stack
-            stack[stack.pointer++] = child_1;
-            stack[stack.pointer++] = uint32[address + COLUMN_CHILD_2];
-
-        } else {
-
-            // leaf nearer than the current best — accept only if it passes the predicate
-            const user_data = bvh.node_get_user_data(node);
-
-            if (filter(user_data)) {
-                best_distance_sqr = distance_sqr;
-                best_user_data = user_data;
-            }
-
-        }
-    } while (stack.pointer > stack_top)
-
-    return best_user_data;
-}
+import { SCRATCH_UINT32_TRAVERSAL_STACK } from "../../../collection/SCRATCH_UINT32_TRAVERSAL_STACK.js";
+import { aabb3_unsigned_distance_sqr_to_point } from "../../../geom/3d/aabb/aabb3_unsigned_distance_sqr_to_point.js";
+import { COLUMN_CHILD_1, COLUMN_CHILD_2, ELEMENT_WORD_COUNT, NULL_NODE } from "../BVH.js";
+
+const stack = SCRATCH_UINT32_TRAVERSAL_STACK;
+
+/**
+ * Nearest leaf to a point whose user data PASSES `filter` — the branch-and-bound search of
+ * {@link bvh_query_user_data_nearest_to_point}, except a leaf only becomes the new best when
+ * `filter(userData)` returns true. Branches farther than the current best PASSING leaf are still pruned, so
+ * `filter` runs only on leaves nearer than the best so far — typically a handful, not every leaf. Lets a
+ * caller reject candidates by an external predicate the BVH itself can't express (e.g. line-of-sight from
+ * the query point).
+ *
+ * Re-entrancy: this consumer keeps the shared traversal `pointer` live (advances the global pointer while
+ * walking), so per the {@link SCRATCH_UINT32_TRAVERSAL_STACK} contract `filter` MAY itself run a nested
+ * BVH walk (it pushes above this live frame and drains back). `filter` must not throw (a throw mid-walk
+ * leaves the shared pointer elevated).
+ *
+ * @param {BVH} bvh
+ * @param {number} x
+ * @param {number} y
+ * @param {number} z
+ * @param {(userData: number) => boolean} filter keep a leaf iff this returns true for its user data
+ * @param {number} [max_distance=Infinity] how far to search
+ * @returns {number} user data of the nearest passing leaf, or -1 if none qualifies
+ */
+export function bvh_query_user_data_nearest_to_point_filtered(bvh, x, y, z, filter, max_distance = Infinity) {
+    const root = bvh.root;
+
+    if (root === NULL_NODE) {
+        return -1;
+    }
+
+    const stack_top = stack.pointer++;
+
+    stack[stack_top] = root;
+
+    let best_user_data = -1;
+    let best_distance_sqr = max_distance * max_distance;
+
+    // bind data directly to avoid extra copies reading out AABBs
+    const float32 = bvh.__data_float32;
+    const uint32 = bvh.__data_uint32;
+
+    do {
+        stack.pointer--;
+
+        const node = stack[stack.pointer];
+
+        const address = node * ELEMENT_WORD_COUNT;
+
+        const distance_sqr = aabb3_unsigned_distance_sqr_to_point(
+            float32[address], float32[address + 1], float32[address + 2],
+            float32[address + 3], float32[address + 4], float32[address + 5],
+            x, y, z
+        );
+
+        if (distance_sqr >= best_distance_sqr) {
+            // node (or its whole subtree) can't beat the best passing leaf
+            continue;
+        }
+
+        const child_1 = uint32[address + COLUMN_CHILD_1];
+
+        if (child_1 !== NULL_NODE) {
+
+            // not a leaf — push children onto the traversal stack
+            stack[stack.pointer++] = child_1;
+            stack[stack.pointer++] = uint32[address + COLUMN_CHILD_2];
+
+        } else {
+
+            // leaf nearer than the current best — accept only if it passes the predicate
+            const user_data = bvh.node_get_user_data(node);
+
+            if (filter(user_data)) {
+                best_distance_sqr = distance_sqr;
+                best_user_data = user_data;
+            }
+
+        }
+    } while (stack.pointer > stack_top)
+
+    return best_user_data;
+}

package/src/core/bvh2/traversal/aabb3_detailed_volume_intersection_callback_based.d.ts

@@ -14,8 +14,8 @@
  * @param {number[]} planes
  * @param {number} plane_count
  * @param {number} plane_mask
- * @param {function(x:number,y:number,z:number)} callback
+ * @param {(x: number, y: number, z: number) => void} callback
  * @param {*} [thisArg]
  */
-export function aabb3_detailed_volume_intersection_callback_based(x0: number, y0: number, z0: number, x1: number, y1: number, z1: number, plane_mask: number, planes: number[], plane_count: number, callback: any, thisArg?: any): void;
+export function aabb3_detailed_volume_intersection_callback_based(x0: number, y0: number, z0: number, x1: number, y1: number, z1: number, plane_mask: number, planes: number[], plane_count: number, callback: (x: number, y: number, z: number) => void, thisArg?: any): void;
 //# sourceMappingURL=aabb3_detailed_volume_intersection_callback_based.d.ts.map

package/src/core/bvh2/traversal/aabb3_detailed_volume_intersection_callback_based.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"aabb3_detailed_volume_intersection_callback_based.d.ts","sourceRoot":"","sources":["../../../../../src/core/bvh2/traversal/aabb3_detailed_volume_intersection_callback_based.js"],"names":[],"mappings":"AASA;;;;;;;;;;;;;;;;;;GAkBG;AACH,sEAZW,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,cAGN,MAAM,UAFN,MAAM,EAAE,eACR,MAAM,sCAsChB"}
+{"version":3,"file":"aabb3_detailed_volume_intersection_callback_based.d.ts","sourceRoot":"","sources":["../../../../../src/core/bvh2/traversal/aabb3_detailed_volume_intersection_callback_based.js"],"names":[],"mappings":"AASA;;;;;;;;;;;;;;;;;;GAkBG;AACH,sEAZW,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,cAGN,MAAM,UAFN,MAAM,EAAE,eACR,MAAM,gBAEF,MAAM,KAAK,MAAM,KAAK,MAAM,KAAK,IAAI,uBAoCnD"}

package/src/core/bvh2/traversal/aabb3_detailed_volume_intersection_callback_based.js

@@ -23,7 +23,7 @@ const scratch_points_data = [];
  * @param {number[]} planes
  * @param {number} plane_count
  * @param {number} plane_mask
- * @param {function(x:number,y:number,z:number)} callback
+ * @param {(x: number, y: number, z: number) => void} callback
  * @param {*} [thisArg]
  */
 export function aabb3_detailed_volume_intersection_callback_based(

package/src/core/bvh8/build/NodeProxy.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"NodeProxy.d.ts","sourceRoot":"","sources":["../../../../../src/core/bvh8/build/NodeProxy.js"],"names":[],"mappings":"AAQA;IAEI;;;OAGG;IACH,YAFU,eAAe,EAAE,CAEZ;IAEf,4BAAiC;IACjC,6BAAyB;IAEzB;;;OAGG;IACH,UAFU,SAAS,EAAE,CAER;IAEb,qBAGE;IAEF,eAAU;IAEV,sBAcC;IAED,wBAAoB;IAEpB;;;;OAIG;IACH,oCAHW,SAAS,GACP,MAAM,CAYlB;IAED,oEAMC;IAED;;;OAGG;IACH,8BAEC;IAED,+BAcC;IAED;;;;;OAKG;IACH,uBAJW,MAAM,UACN,MAAM,EAAE,GAAC,YAAY,GACnB,OAAO,CAsDnB;IAED,0BAOC;IAED;;OAEG;IACH,8DAaC;IAED;;;;;;OAMG;IACH,sBALW,SAAS,eACT,MAAM,EAAE,kBACR,MAAM,EAAE,GACP,OAAO,CAwElB;IAED;;;;OAIG;IACH,2BAHW,MAAM,GACJ,SAAS,GAAC,SAAS,CAqB/B;IAED;;;;OAIG;IACH,cAFY,MAAM,CAUjB;IAGL,qBAA+B;CAF9B;gCA3S+B,sBAAsB"}
+{"version":3,"file":"NodeProxy.d.ts","sourceRoot":"","sources":["../../../../../src/core/bvh8/build/NodeProxy.js"],"names":[],"mappings":"AAQA;IAEI;;;OAGG;IACH,YAFU,eAAe,EAAE,CAEZ;IAEf,4BAAiC;IACjC,6BAAyB;IAEzB;;;OAGG;IACH,UAFU,SAAS,EAAE,CAER;IAEb,qBAGE;IAEF,eAAU;IAEV,sBAcC;IAED,wBAAoB;IAEpB;;;;OAIG;IACH,oCAHW,SAAS,GACP,MAAM,CAYlB;IAED,oEAMC;IAED;;;OAGG;IACH,8BAEC;IAED,+BAcC;IAED;;;;;OAKG;IACH,uBAJW,MAAM,UACN,MAAM,EAAE,GAAC,YAAY,GACnB,OAAO,CAsDnB;IAED,0BAOC;IAED;;OAEG;IACH,8DAaC;IAED;;;;;;OAMG;IACH,sBALW,SAAS,eACT,MAAM,EAAE,kBACR,MAAM,EAAE,GACP,OAAO,CA8ElB;IAED;;;;OAIG;IACH,2BAHW,MAAM,GACJ,SAAS,GAAC,SAAS,CAqB/B;IAED;;;;OAIG;IACH,cAFY,MAAM,CAUjB;IAGL,qBAA+B;CAF9B;gCAjT+B,sBAAsB"}