@woosh/meep-engine 2.122.5 → 2.122.7

package/src/core/geom/Vector3.js

@@ -64,13 +64,74 @@ export class Vector3 {
         this.onChanged = new Signal();
     }
 
+    /**
+     *
+     * @return {number}
+     */
+    get 0() {
+        return this.x;
+    }
+
+    /**
+     *
+     * @return {number}
+     */
+    get 1() {
+        return this.y;
+    }
+
+    /**
+     *
+     * @return {number}
+     */
+    get 2() {
+        return this.z;
+    }
+
+    /**
+     *
+     * @param {number} v
+     */
+    set 0(v) {
+        this.x = v;
+    }
+
+    /**
+     *
+     * @param {number} v
+     */
+    set 1(v) {
+        this.y = v;
+    }
+
+    /**
+     *
+     * @param {number} v
+     */
+    set 2(v) {
+        this.z = v;
+    }
+
+    /**
+     *
+     * @return {Generator<number>}
+     */
+    * [Symbol.iterator]() {
+
+        yield this.x;
+        yield this.y;
+        yield this.z;
+
+    }
+
     /**
      *
      * @param {number[]|Float32Array} array
-     * @param {number} offset
+     * @param {number} [offset]
+     * @returns {this}
      */
-    readFromArray(array, offset = 0) {
-        this.set(
+    fromArray(array, offset = 0) {
+        return this.set(
             array[offset],
             array[offset + 1],
             array[offset + 2]
@@ -78,11 +139,11 @@ export class Vector3 {
     }
 
     /**
-     *
-     * @param {number[]|Float32Array} array
-     * @param {number} offset
+     * @param {number[]|Float32Array|ArrayLike} [array]
+     * @param {number} [offset]
+     * @returns {number[]}
      */
-    writeToArray(array = [], offset = 0) {
+    toArray(array = [], offset = 0) {
         array[offset] = this.x;
         array[offset + 1] = this.y;
         array[offset + 2] = this.z;
@@ -118,7 +179,10 @@ export class Vector3 {
             this.z = z;
 
             if (this.onChanged.hasHandlers()) {
-                this.onChanged.send6(x, y, z, oldX, oldY, oldZ);
+                this.onChanged.send6(
+                    x, y, z,
+                    oldX, oldY, oldZ
+                );
             }
 
         }
@@ -324,21 +388,21 @@ export class Vector3 {
     }
 
     /**
-     * Subtract scalar value from each component of the vector
+     * Add a scalar value to each component of the vector
      * @param {number} val
      * @returns {this}
      */
-    subScalar(val) {
-        return this.set(this.x - val, this.y - val, this.z - val);
+    addScalar(val) {
+        return this.set(this.x + val, this.y + val, this.z + val);
     }
 
     /**
-     * Add a scalar value to each component of the vector
+     * Subtract scalar value from each component of the vector
      * @param {number} val
      * @returns {this}
      */
-    addScalar(val) {
-        return this.set(this.x + val, this.y + val, this.z + val);
+    subScalar(val) {
+        return this.addScalar(-val);
     }
 
     /**
@@ -534,11 +598,7 @@ export class Vector3 {
     distanceSqrTo(other) {
         assert.defined(other, "other");
 
-        const dx = this.x - other.x;
-        const dy = this.y - other.y;
-        const dz = this.z - other.z;
-
-        return v3_length_sqr(dx, dy, dz);
+        return this._distanceSqrTo(other.x, other.y, other.z);
     }
 
     /**
@@ -549,7 +609,11 @@ export class Vector3 {
      * @return {number}
      */
     _distanceSqrTo(x, y, z) {
-        return v3_length_sqr(this.x - x, this.y - y, this.z - z);
+        return v3_length_sqr(
+            this.x - x,
+            this.y - y,
+            this.z - z
+        );
     }
 
     /**
@@ -672,7 +736,7 @@ export class Vector3 {
         const _y = (m4[1] * x + m4[5] * y + m4[9] * z + m4[13]) * w;
         const _z = (m4[2] * x + m4[6] * y + m4[10] * z + m4[14]) * w;
 
-       return this.set(_x, _y, _z);
+        return this.set(_x, _y, _z);
     }
 
     /**
@@ -729,7 +793,7 @@ export class Vector3 {
         const _y = matrix4[13];
         const _z = matrix4[14];
 
-       return this.set(_x, _y, _z);
+        return this.set(_x, _y, _z);
     }
 
     /**
@@ -859,7 +923,7 @@ export class Vector3 {
         const _y = radius * cos_phi;
         const _z = radius * sin_phi * cos_theta;
 
-       return this.set(_x, _y, _z);
+        return this.set(_x, _y, _z);
     }
 
     /**
@@ -958,39 +1022,6 @@ export class Vector3 {
         return x ^ (y << 1) ^ (z << 2);
     }
 
-
-    get 0() {
-        return this.x;
-    }
-
-    get 1() {
-        return this.y;
-    }
-
-    get 2() {
-        return this.z;
-    }
-
-    set 0(v) {
-        this.x = v;
-    }
-
-    set 1(v) {
-        this.y = v;
-    }
-
-    set 2(v) {
-        this.z = v;
-    }
-
-    * [Symbol.iterator]() {
-
-        yield this.x;
-        yield this.y;
-        yield this.z;
-
-    }
-
     /**
      * Dot product
      * @param {Vector3|Vector4} a
@@ -1033,42 +1064,6 @@ export class Vector3 {
     static fromScalar(value) {
         return new Vector3(value, value, value);
     }
-
-
-    /**
-     *
-     * @param {THREE.Matrix4} matrix4
-     * @deprecated use {@link @applyMatrix4} directly instead, pass `mat.elements`
-     */
-    applyMatrix4_three(matrix4) {
-        throw new Error("use applyMatrix4 instead")
-    }
-
-    /**
-     * @deprecated use non-three.js version instead
-     * @param {THREE.Matrix4} m
-     */
-    transformDirection_three(m) {
-        throw new Error("use applyDirectionMatrix4 instead")
-    }
-
-    /**
-     * @deprecated use non-three.js version instead
-     * @param {THREE.Matrix3} m
-     * @returns {Vector3}
-     */
-    applyMatrix3_three(m) {
-        throw new Error("use applyMatrix3 instead")
-    }
-
-    /**
-     * @deprecated use non-three.js version instead
-     * @param {THREE.Matrix4} matrix4
-     */
-    threejs_setFromMatrixPosition(matrix4) {
-        throw new Error("use setFromMatrixPosition instead")
-    }
-
 }
 
 // Aliases
@@ -1076,12 +1071,21 @@ export class Vector3 {
 Vector3.prototype.distanceToSquared = Vector3.prototype.distanceSqrTo;
 
 Vector3.prototype.lengthSq = Vector3.prototype.lengthSqr;
-Vector3.prototype.fromArray = Vector3.prototype.readFromArray;
-Vector3.prototype.toArray = Vector3.prototype.writeToArray;
 /**
- * @deprecated use `toArray` instead
+ * @readonly
+ * @deprecated Use {@link fromArray} instead
+ */
+Vector3.prototype.readFromArray = Vector3.prototype.fromArray;
+/**
+ * @readonly
+ * @deprecated Use {@link toArray} instead
+ */
+Vector3.prototype.writeToArray = Vector3.prototype.toArray;
+/**
+ * @readonly
+ * @deprecated use {@link toArray} instead
  */
-Vector3.prototype.asArray = Vector3.prototype.writeToArray;
+Vector3.prototype.asArray = Vector3.prototype.toArray;
 
 
 /**

package/src/core/geom/packing/computeBoundingSphereOfSpheres.d.ts

@@ -1 +1,12 @@
-export function computeBoundingSphereOfSpheres(result: ArrayLike<number>, data: ArrayLike<number>, offset: number, count: number, dimensions: number): void;
+/**
+ * Computes bounding sphere of a number of spheres
+ * NOTE: implementation does not produce a very tight sphere, here is a good resource for a better implementation:
+ *          https://github.com/CGAL/cgal/blob/master/Bounding_volumes/include/CGAL/Min_sphere_of_spheres_d/Min_sphere_of_spheres_d_support_set.h
+ * @param {number[]|Float32Array|Float64Array} result
+ * @param {number[]|Float32Array|Float64Array} data
+ * @param {number} offset
+ * @param {number} count
+ * @param {number} dimensions
+ */
+export function computeBoundingSphereOfSpheres(result: number[] | Float32Array | Float64Array, data: number[] | Float32Array | Float64Array, offset: number, count: number, dimensions: number): void;
+//# sourceMappingURL=computeBoundingSphereOfSpheres.d.ts.map

package/src/core/geom/packing/max-rect/MaxRectanglesPacker.d.ts

@@ -1,7 +1,9 @@
 /**
- * Packs rectangles into a finite area, packer is incremental and supports both insertions and removals of rectangles
+ * Packs rectangles into a finite area, packer is incremental and supports both insertions and removals of rectangles.
  * Implementation of "max rectangles" packing algorithm.
- * Useful for packing texture atlases
+ * Useful for packing texture atlases.
+ *
+ * @see "A Thousand Ways to Pack the Bin - A Practical Approach to Two-Dimensional Rectangle Bin Packing" 2010 Jukka Jylänki
  */
 export class MaxRectanglesPacker {
     /**
@@ -17,26 +19,29 @@ export class MaxRectanglesPacker {
      */
     free: QuadTreeNode<any>;
     /**
-     *
+     * Currently held boxes.
+     * Managed internally, do not modify.
+     * @readonly
      * @type {AABB2[]}
      */
-    boxes: AABB2[];
+    readonly boxes: AABB2[];
     /**
      *
-     * @param {AABB2} box
-     * @returns {boolean}
+     * @param {AABB2} box exact box to remove
+     * @returns {boolean} true when box is removed, false if not found
      */
     remove(box: AABB2): boolean;
     /**
      *
      * @param {AABB2[]} boxes
-     * @returns {number} how many failed to be removed
+     * @returns {number} How many failed to be removed. Failure represents box that was not packed in the first place.
      */
     removeMany(boxes: AABB2[]): number;
     /**
-     *
+     * Pack a given box.
+     * Atomic, if box fails packing - the existing data structure is unchanged.
      * @param {AABB2} box
-     * @returns {boolean}
+     * @returns {boolean} true if box was successfully added into the packing, false otherwise
      */
     add(box: AABB2): boolean;
     /**
@@ -69,9 +74,7 @@ export class MaxRectanglesPacker {
      * @returns {boolean} false if packing fails after resize, true otherwise
      */
     resize(width: number, height: number): boolean;
-    validate(): boolean;
 }
 import Vector2 from "../../Vector2.js";
 import { QuadTreeNode } from "../../2d/quad-tree/QuadTreeNode.js";
-import AABB2 from "../../2d/aabb/AABB2.js";
 //# sourceMappingURL=MaxRectanglesPacker.d.ts.map

package/src/core/geom/packing/max-rect/MaxRectanglesPacker.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"MaxRectanglesPacker.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/packing/max-rect/MaxRectanglesPacker.js"],"names":[],"mappings":"AAWA;;;;GAIG;AACH;IACI;;;;OAIG;IACH,mBAHW,MAAM,UACN,MAAM,EAmBhB;IAhBG,cAAsC;IAEtC;;;OAGG;IACH,wBAAiD;IAKjD;;;OAGG;IACH,OAFU,KAAK,EAAE,CAEF;IAGnB;;;;OAIG;IACH,YAHW,KAAK,GACH,OAAO,CAoBnB;IAED;;;;OAIG;IACH,kBAHW,KAAK,EAAE,GACL,MAAM,CAgBlB;IAED;;;;OAIG;IACH,SAHW,KAAK,GACH,OAAO,CAanB;IAED;;;;;;OAMG;IACH,UAJW,MAAM,KACN,MAAM,GACL,OAAO,CAIlB;IAED;;;;OAIG;IACH,eAHW,KAAK,EAAE,GACL,OAAO,CAiDnB;IAED;;;OAGG;IACH,UAFa,OAAO,CAWnB;IAED;;OAEG;IACH,cAKC;IAED;;;;;OAKG;IACH,cAJW,MAAM,UACN,MAAM,GACJ,OAAO,CA2BnB;IAED,oBAsBC;CACJ;oBAtPmB,kBAAkB;6BADT,oCAAoC;kBAF/C,wBAAwB"}
+{"version":3,"file":"MaxRectanglesPacker.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/packing/max-rect/MaxRectanglesPacker.js"],"names":[],"mappings":"AAUA;;;;;;GAMG;AACH;IACI;;;;OAIG;IACH,mBAHW,MAAM,UACN,MAAM,EAqBhB;IAlBG,cAAsC;IAEtC;;;OAGG;IACH,wBAAiD;IAKjD;;;;;OAKG;IACH,gBAFU,KAAK,EAAE,CAEF;IAGnB;;;;OAIG;IACH,YAHW,KAAK,GACH,OAAO,CAoBnB;IAED;;;;OAIG;IACH,kBAHW,KAAK,EAAE,GACL,MAAM,CAgBlB;IAED;;;;;OAKG;IACH,SAHW,KAAK,GACH,OAAO,CAanB;IAED;;;;;;OAMG;IACH,UAJW,MAAM,KACN,MAAM,GACL,OAAO,CAIlB;IAED;;;;OAIG;IACH,eAHW,KAAK,EAAE,GACL,OAAO,CAiDnB;IAED;;;OAGG;IACH,UAFa,OAAO,CAWnB;IAED;;OAEG;IACH,cAKC;IAED;;;;;OAKG;IACH,cAJW,MAAM,UACN,MAAM,GACJ,OAAO,CAmCnB;CAEJ;oBA5OmB,kBAAkB;6BADT,oCAAoC"}

package/src/core/geom/packing/max-rect/MaxRectanglesPacker.js

@@ -1,6 +1,5 @@
 import { assert } from "../../../assert.js";
 import BinaryHeap from "../../../collection/heap/BinaryHeap.js";
-import AABB2 from "../../2d/aabb/AABB2.js";
 import { QuadTreeDatum } from "../../2d/quad-tree/QuadTreeDatum.js";
 import { QuadTreeNode } from "../../2d/quad-tree/QuadTreeNode.js";
 import Vector2 from "../../Vector2.js";
@@ -10,9 +9,11 @@ import { packOneBox } from "./packOneBox.js";
 import { removeRedundantBoxes } from "./removeRedundantBoxes.js";
 
 /**
- * Packs rectangles into a finite area, packer is incremental and supports both insertions and removals of rectangles
+ * Packs rectangles into a finite area, packer is incremental and supports both insertions and removals of rectangles.
  * Implementation of "max rectangles" packing algorithm.
- * Useful for packing texture atlases
+ * Useful for packing texture atlases.
+ *
+ * @see "A Thousand Ways to Pack the Bin - A Practical Approach to Two-Dimensional Rectangle Bin Packing" 2010 Jukka Jylänki
  */
 export class MaxRectanglesPacker {
     /**
@@ -33,7 +34,9 @@ export class MaxRectanglesPacker {
         this.free.add(null, 0, 0, width, height);
 
         /**
-         *
+         * Currently held boxes.
+         * Managed internally, do not modify.
+         * @readonly
          * @type {AABB2[]}
          */
         this.boxes = [];
@@ -41,8 +44,8 @@ export class MaxRectanglesPacker {
 
     /**
      *
-     * @param {AABB2} box
-     * @returns {boolean}
+     * @param {AABB2} box exact box to remove
+     * @returns {boolean} true when box is removed, false if not found
      */
     remove(box) {
         const i = this.boxes.indexOf(box);
@@ -54,7 +57,7 @@ export class MaxRectanglesPacker {
 
         this.boxes.splice(i, 1);
 
-        //introduce a free node in the unoccupied space
+        // introduce a free node in the unoccupied space
         this.free.insertDatum(new QuadTreeDatum(box.x0, box.y0, box.x1, box.y1));
 
 
@@ -67,7 +70,7 @@ export class MaxRectanglesPacker {
     /**
      *
      * @param {AABB2[]} boxes
-     * @returns {number} how many failed to be removed
+     * @returns {number} How many failed to be removed. Failure represents box that was not packed in the first place.
      */
     removeMany(boxes) {
         let failures = 0;
@@ -86,9 +89,10 @@ export class MaxRectanglesPacker {
     }
 
     /**
-     *
+     * Pack a given box.
+     * Atomic, if box fails packing - the existing data structure is unchanged.
      * @param {AABB2} box
-     * @returns {boolean}
+     * @returns {boolean} true if box was successfully added into the packing, false otherwise
      */
     add(box) {
         const success = packOneBox(box, this.free);
@@ -120,8 +124,8 @@ export class MaxRectanglesPacker {
      * @returns {boolean}
      */
     addMany(boxes) {
-        assert.defined(boxes,'boxes');
-        assert.isArray(boxes,'boxes');
+        assert.defined(boxes, 'boxes');
+        assert.isArray(boxes, 'boxes');
 
         // assert.ok(this.validate());
 
@@ -200,6 +204,14 @@ export class MaxRectanglesPacker {
      * @returns {boolean} false if packing fails after resize, true otherwise
      */
     resize(width, height) {
+        assert.isNumber(width, 'width');
+        assert.isNumber(height, 'height');
+
+        assert.isFiniteNumber(width, 'width');
+        assert.isFiniteNumber(height, 'height');
+
+        assert.greaterThan(width, 0, 'width');
+        assert.greaterThan(height, 0, 'height');
 
         // assert.ok(this.validate());
 
@@ -209,7 +221,7 @@ export class MaxRectanglesPacker {
         this.size.set(width, height);
 
         if (oldWidth > width || oldHeight > height) {
-            //canvas was made smaller in at least one dimension, re-pack is required
+            // canvas was made smaller in at least one dimension, re-pack is required
             return this.repack();
         }
 
@@ -226,29 +238,6 @@ export class MaxRectanglesPacker {
         return true;
     }
 
-    validate() {
-
-        const boxes = this.boxes;
-        const numPatches = boxes.length;
-        let i, j;
-
-        for (i = 0; i < numPatches; i++) {
-            const p0 = boxes[i];
-
-
-            for (j = i + 1; j < numPatches; j++) {
-                const p1 = boxes[j];
-
-                if (p0.computeOverlap(p1, new AABB2())) {
-                    console.warn("Overlap", p0, p1);
-                    return false;
-                }
-
-            }
-        }
-
-        return true;
-    }
 }
 
 

package/src/core/geom/packing/max-rect/aabb2_validate_packing.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=aabb2_validate_packing.d.ts.map

package/src/core/geom/packing/max-rect/aabb2_validate_packing.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"aabb2_validate_packing.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/packing/max-rect/aabb2_validate_packing.js"],"names":[],"mappings":""}

package/src/core/geom/packing/max-rect/aabb2_validate_packing.js

@@ -0,0 +1,29 @@
+import AABB2 from "../../2d/aabb/AABB2.js";
+
+/**
+ *
+ * @param {AABB2[]} boxes
+ * @return {boolean}
+ */
+function validate(boxes) {
+
+    const numPatches = boxes.length;
+    let i, j;
+
+    for (i = 0; i < numPatches; i++) {
+        const p0 = boxes[i];
+
+
+        for (j = i + 1; j < numPatches; j++) {
+            const p1 = boxes[j];
+
+            if (p0.computeOverlap(p1, new AABB2())) {
+                console.warn("Overlap", p0, p1);
+                return false;
+            }
+
+        }
+    }
+
+    return true;
+}

package/src/core/geom/packing/max-rect/packMaxRectangles.d.ts

@@ -1,9 +1,6 @@
 /**
  * Packs {@link AABB2} boxes into defined bounds
  *
- * Based on paper "A Thousand Ways to Pack the Bin - A Practical Approach to Two-Dimensional Rectangle Bin Packing" 2010 Jukka Jylänki
- * Method presented called Maximal Rectangles
- *
  * @param {number} width
  * @param {number} height
  * @param {AABB2[]} boxes

package/src/core/geom/packing/max-rect/packMaxRectangles.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"packMaxRectangles.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/packing/max-rect/packMaxRectangles.js"],"names":[],"mappings":"AAEA;;;;;;;;;;GAUG;AACH,yCALW,MAAM,UACN,MAAM,SACN,KAAK,EAAE,GACL,OAAO,CAOnB"}
+{"version":3,"file":"packMaxRectangles.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/packing/max-rect/packMaxRectangles.js"],"names":[],"mappings":"AAEA;;;;;;;GAOG;AACH,yCALW,MAAM,UACN,MAAM,SACN,KAAK,EAAE,GACL,OAAO,CAOnB"}

package/src/core/geom/packing/max-rect/packMaxRectangles.js

@@ -3,9 +3,6 @@ import { MaxRectanglesPacker } from "./MaxRectanglesPacker.js";
 /**
  * Packs {@link AABB2} boxes into defined bounds
  *
- * Based on paper "A Thousand Ways to Pack the Bin - A Practical Approach to Two-Dimensional Rectangle Bin Packing" 2010 Jukka Jylänki
- * Method presented called Maximal Rectangles
- *
  * @param {number} width
  * @param {number} height
  * @param {AABB2[]} boxes

package/src/core/geom/packing/miniball/Miniball.d.ts

@@ -1,6 +1,7 @@
 /**
  * Computes the miniball of the given point set.
- * @class
+ *
+ * @copyright Company Named Limited (c) 2025
  */
 export class Miniball {
     /**

package/src/core/geom/packing/miniball/Miniball.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"Miniball.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/packing/miniball/Miniball.js"],"names":[],"mappings":"AAwBA;;;GAGG;AACH;IACI;;;;;OAKG;IACH,oBAFW,QAAQ,EAoGlB;IA/FG;;;OAGG;IACH,WAFU,MAAM,CAEE;IAClB;;;OAGG;IACH,WAFU,MAAM,CAEE;IAClB;;;OAGG;IACH,iBAFU,MAAM,CAEQ;IACxB;;;;;;;;;;OAUG;IACH,wBAAwB;IACxB;;;;OAIG;IACH,iBAAiB;IACjB;;;OAGG;IACH,SAFU,MAAM,CAEA;IAEhB;;OAEG;IACH,GAFU,QAAQ,CAEH;IAEf;;;;OAIG;IACH,eAA2B;IAI3B;;;OAGG;IACH,KAFU,MAAM,CAEU;IAM1B;;;;OAIG;IACH,iBAA4D;IAE5D;;;OAGG;IACH,aAFU,MAAM,EAAE,GAAC,YAAY,CAEkD;IAEjF;;;OAGG;IACH,eAFU,MAAM,EAAE,GAAC,YAAY,CAEwD;IAEvF;;;OAGG;IACH,SAFU,MAAM,EAAE,GAAC,YAAY,CAEsD;IAErF;;;;OAIG;IACH,kBAAgC;IAIpC;;;;;;;OAOG;IACH,WAFY,OAAO,CAIlB;IAED;;;;;;OAMG;IACH,UAFY,MAAM,CAIjB;IAED;;;;;;OAMG;IACH,UAFY,MAAM,EAAE,CAInB;IAED;;;OAGG;IACH,eAFa,OAAO,CAInB;IAED;;;;;;OAMG;IACH,QAJY,MAAM,CAMjB;IAED;;;;;;;;OAQG;IACH,iBAkCC;IAED;;OAEG;IACH,yBAGC;IAED;;OAEG;IACH,qBAcC;IAED;;;;;;;;;;OAUG;IACH,gBA4CC;IAED;;;;;;;;OAQG;IACH,kBAFY,OAAO,CA4BlB;IAED;;;;;;;;OAQG;IACH,yBAyDC;IAGD;;;OAGG;IACH,YAFY,MAAM,CAkBjB;CACJ;wBAlbuB,cAAc"}
+{"version":3,"file":"Miniball.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/packing/miniball/Miniball.js"],"names":[],"mappings":"AAwBA;;;;GAIG;AACH;IACI;;;;;OAKG;IACH,oBAFW,QAAQ,EAoGlB;IA/FG;;;OAGG;IACH,WAFU,MAAM,CAEE;IAClB;;;OAGG;IACH,WAFU,MAAM,CAEE;IAClB;;;OAGG;IACH,iBAFU,MAAM,CAEQ;IACxB;;;;;;;;;;OAUG;IACH,wBAAwB;IACxB;;;;OAIG;IACH,iBAAiB;IACjB;;;OAGG;IACH,SAFU,MAAM,CAEA;IAEhB;;OAEG;IACH,GAFU,QAAQ,CAEH;IAEf;;;;OAIG;IACH,eAA2B;IAI3B;;;OAGG;IACH,KAFU,MAAM,CAEU;IAM1B;;;;OAIG;IACH,iBAA4D;IAE5D;;;OAGG;IACH,aAFU,MAAM,EAAE,GAAC,YAAY,CAEkD;IAEjF;;;OAGG;IACH,eAFU,MAAM,EAAE,GAAC,YAAY,CAEwD;IAEvF;;;OAGG;IACH,SAFU,MAAM,EAAE,GAAC,YAAY,CAEsD;IAErF;;;;OAIG;IACH,kBAAgC;IAIpC;;;;;;;OAOG;IACH,WAFY,OAAO,CAIlB;IAED;;;;;;OAMG;IACH,UAFY,MAAM,CAIjB;IAED;;;;;;OAMG;IACH,UAFY,MAAM,EAAE,CAInB;IAED;;;OAGG;IACH,eAFa,OAAO,CAInB;IAED;;;;;;OAMG;IACH,QAJY,MAAM,CAMjB;IAED;;;;;;;;OAQG;IACH,iBAkCC;IAED;;OAEG;IACH,yBAGC;IAED;;OAEG;IACH,qBAcC;IAED;;;;;;;;;;OAUG;IACH,gBA4CC;IAED;;;;;;;;OAQG;IACH,kBAFY,OAAO,CA4BlB;IAED;;;;;;;;OAQG;IACH,yBAyDC;IAGD;;;OAGG;IACH,YAFY,MAAM,CAkBjB;CACJ;wBAnbuB,cAAc"}

package/src/core/geom/packing/miniball/Miniball.js

@@ -24,7 +24,8 @@ const MAX_ITERATIONS = 10000;
 
 /**
  * Computes the miniball of the given point set.
- * @class
+ *
+ * @copyright Company Named Limited (c) 2025
  */
 export class Miniball {
     /**

package/src/core/math/spline/v3_computeCatmullRomSplineUniformDistance.js

@@ -32,7 +32,7 @@ export function v3_computeCatmullRomSplineUniformDistance(
     for (let i = 0; i < samples; i++) {
         const v3 = new Vector3();
 
-        v3.readFromArray(result_array, i * 3);
+        v3.fromArray(result_array, i * 3);
 
         result[i] = v3;
 

package/src/engine/asset/loaders/image/png/crc32.d.ts

@@ -1,11 +1,16 @@
 /**
- * 32-bit cyclic redundancy checksum
- * Returns CRC of the bytes buf[0..len-1]
+ * 32-bit Cyclic Redundancy Checksum.
  * @see https://en.wikipedia.org/wiki/Cyclic_redundancy_check
  * @param {Uint8Array} buffer byte buffer
- * @param {number} offset
- * @param {number} length how many bytes to include in checksum calculation
- * @return {number}
+ * @param {number} [offset=0] where to start in the input buffer
+ * @param {number} [length=buffer.length] how many bytes to include in checksum calculation
+ * @return {number} Unsigned 32-bit integer value
+ * @copyright Company Named Limited (c) 2025
+ *
+ * @example
+ *      const buffer = new BinaryBuffer();
+ *      buffer.writeASCIIString("Hello World");
+ *      const checksum = crc32(buffer.raw_bytes, 0, buffer.position);
  */
-export function crc32(buffer: Uint8Array, offset: number, length: number): number;
+export function crc32(buffer: Uint8Array, offset?: number, length?: number): number;
 //# sourceMappingURL=crc32.d.ts.map

package/src/engine/asset/loaders/image/png/crc32.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"crc32.d.ts","sourceRoot":"","sources":["../../../../../../../src/engine/asset/loaders/image/png/crc32.js"],"names":[],"mappings":"AAuDA;;;;;;;;GAQG;AACH,8BALW,UAAU,UACV,MAAM,UACN,MAAM,GACL,MAAM,CAIjB"}
+{"version":3,"file":"crc32.d.ts","sourceRoot":"","sources":["../../../../../../../src/engine/asset/loaders/image/png/crc32.js"],"names":[],"mappings":"AAuEA;;;;;;;;;;;;;GAaG;AACH,8BAXW,UAAU,WACV,MAAM,WACN,MAAM,GACL,MAAM,CAcjB"}