@woosh/meep-engine 2.122.6 → 2.123.0

package/src/core/color/kelvin/prototype_kelvin_to_rgb.js

@@ -30,11 +30,11 @@ for (let i = 0; i < sampler.width; i++) {
     sRGB_to_linear(color, 0, color, 0);
 
     for (let j = 0; j < sampler.height; j++) {
-        sampler.set(i, j, color);
-        // sampler.set(i, j, [f, f, f, 1]);
+        sampler.write(i, j, color);
+        // sampler.write(i, j, [f, f, f, 1]);
 
     }
-    // sampler.set(i, sampler.height - 1, [f, f, f, 1]);
+    // sampler.write(i, sampler.height - 1, [f, f, f, 1]);
 }
 
 console.log(sampler);

package/src/core/geom/3d/tetrahedra/triangle/prototype.js

@@ -111,7 +111,7 @@ async function main() {
 
             color.set(depth, depth, depth, 1);
 
-            sampler.set(x, y, color)
+            sampler.write(x, y, color)
         }
     }
 

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/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"}

package/src/engine/asset/loaders/image/png/crc32.js

@@ -1,3 +1,5 @@
+import { assert } from "../../../../../core/assert.js";
+
 /*
  * Ported from C source at https://www.w3.org/TR/PNG-CRCAppendix.html
  * See also ISO 3309 [ISO-3309] or ITU-T V.42 [ITU-V42] for a formal specification
@@ -12,13 +14,18 @@ const crc_table = new Uint32Array(256);
 // Precompute checksum table
 for (let n = 0; n < 256; n++) {
     let c = n;
+
     for (let k = 0; k < 8; k++) {
-        if (c & 1) {
+
+        if ((c & 1) !== 0) {
+            // CRC32b polynomial
             c = 0xedb88320 ^ (c >>> 1);
         } else {
             c = c >>> 1;
         }
+
     }
+
     crc_table[n] = c;
 }
 
@@ -28,40 +35,58 @@ const INITIAL = 0xffffffff;
  * Update a running CRC with the bytes buf[0..len-1]--the CRC
  * should be initialized to all 1's, and the transmitted value
  * is the 1's complement of the final running CRC (see the crc32() routine below)).
- * @param {number} crc
- * @param {Uint8Array} buf
+ * @param {number} input_crc starting CRC value
+ * @param {Uint8Array} buffer
  * @param {number} offset
- * @param {number} len
+ * @param {number} length
  * @return {number}
  */
 function update_crc(
-    crc,
-    buf,
+    input_crc,
+    buffer,
     offset,
-    len,
+    length,
 ) {
-    let c = crc;
+    assert.isNonNegativeInteger(input_crc, 'input_crc');
+    assert.defined(buffer, 'buffer');
+    assert.isNonNegativeInteger(offset, 'offset');
+    assert.isNonNegativeInteger(length, 'length');
+
+    let crc = input_crc;
 
-    const end = offset + len;
+    const end = offset + length;
 
     for (let n = offset; n < end; n++) {
-        const lookup_index = (c ^ buf[n]) & 0xff;
 
-        c = crc_table[lookup_index] ^ (c >>> 8);
+        const byte = buffer[n];
+
+        const lookup_index = (crc ^ byte) & 0xff;
+
+        crc = crc_table[lookup_index] ^ (crc >>> 8);
+
     }
 
-    return c;
+    return crc;
 }
 
 /**
- * 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, offset, length) {
+export function crc32(
+    buffer,
+    offset=0,
+    length=buffer.length,
+) {
     return (update_crc(INITIAL, buffer, offset, length) ^ INITIAL) >>> 0;
 }

package/src/engine/ecs/terrain/overlay/TerrainOverlay.js

@@ -244,7 +244,7 @@ export class TerrainOverlay {
      * @param {number} y
      */
     clearPoint(x, y) {
-        this.sampler.set(x, y, COLOR_UINT_8_TRANSPARENT);
+        this.sampler.write(x, y, COLOR_UINT_8_TRANSPARENT);
     }
 
     /**

package/src/engine/ecs/terrain/util/paintTerrainOverlayViaLookupTable.js

@@ -72,7 +72,7 @@ export function paintTerrainOverlayViaLookupTable({
             if (Number.isNaN(p)) {
                 // handle NaN values by writing special color
 
-                buffer.set(i, j, NAN_COLOR);
+                buffer.write(i, j, NAN_COLOR);
 
                 NaN_count++;
 
@@ -87,7 +87,7 @@ export function paintTerrainOverlayViaLookupTable({
 
             lut.sample(position, colorSample);
 
-            buffer.set(i, j, colorSample);
+            buffer.write(i, j, colorSample);
         }
     }
 

package/src/engine/graphics/particles/particular/engine/parameter/ParameterSheet.js

@@ -172,7 +172,7 @@ function buildParameterSampler(parameter, length) {
 
             for (k = 0; k < trackThickness; k++) {
                 //write sampled value to the sampler
-                sampler2D.set(j, i * trackThickness + k, encodedValue);
+                sampler2D.write(j, i * trackThickness + k, encodedValue);
             }
         }
     }

package/src/engine/graphics/particles/particular/engine/utils/volume/lut_to_sampler.js

@@ -18,7 +18,7 @@ export function lut_to_sampler(lut, width, height) {
         s[3] = 255;
 
         for (let j = 0; j < height; j++) {
-            sampler.set(i, j, s);
+            sampler.write(i, j, s);
         }
 
     }

package/src/engine/graphics/render/forward_plus/materials/FPlusDebugMaterial.js

@@ -152,7 +152,7 @@ export class FPlusDebugMaterial extends ShaderMaterial {
         for (let i = 0; i < heatmap_sampler.width; i++) {
             heatmap_lut.sample(i / (heatmap_sampler.width - 1), r);
 
-            heatmap_sampler.set(i, 0, r);
+            heatmap_sampler.write(i, 0, r);
         }
 
         const heatmap_texture = sampler2d_to_texture(heatmap_sampler);

package/src/engine/graphics/render/forward_plus/prototype/prototypeLightManager.js

@@ -566,7 +566,7 @@ function prepare_scene_decal_0() {
                 sample[2] = 255;
                 sample[3] = Math.round((1 - smoothstep(distance, 0.5, 1)) * 255);
 
-                s.set(x, y, sample);
+                s.write(x, y, sample);
             }
         }
 

package/src/engine/graphics/sh3/sky/hosek/prototype_hosek.js

@@ -56,12 +56,12 @@ for (let i = 0; i < sampler.width; i++) {
 
         sky(color, 0, direction, 0);
 
-        sampler.set(i, j, color);
+        sampler.write(i, j, color);
 
-        // sampler.set(i, j, [f, f, f, 1]);
+        // sampler.write(i, j, [f, f, f, 1]);
 
     }
-    // sampler.set(i, sampler.height - 1, [f, f, f, 1]);
+    // sampler.write(i, sampler.height - 1, [f, f, f, 1]);
 }
 
 console.log(sampler);

package/src/engine/graphics/texture/sampler/Sampler2D.d.ts

@@ -336,7 +336,7 @@ export class Sampler2D {
     /**
      * @deprecated use {@link write} instead
      */
-    set: (x: number, y: number, texel: number[] | ArrayLike<number>) => void;
+    set(): void;
     /**
      * @readonly
      * @type {boolean}

package/src/engine/graphics/texture/sampler/Sampler2D.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"Sampler2D.d.ts","sourceRoot":"","sources":["../../../../../../src/engine/graphics/texture/sampler/Sampler2D.js"],"names":[],"mappings":"AAqBA;;;;GAIG;AACH;IAi7BI;;;;;;OAMG;IACH,8BALW,GAAG,SACH,GAAG,UACH,GAAG,GACF,SAAS,CAKpB;IAED;;;;;;OAMG;IACH,uBALW,GAAG,SACH,GAAG,UACH,GAAG,GACF,SAAS,CAKpB;IAED;;;;;;OAMG;IACH,wBALW,GAAG,SACH,GAAG,UACH,GAAG,GACF,SAAS,CAKpB;IAED;;;;;;OAMG;IACH,wBALW,GAAG,SACH,GAAG,UACH,GAAG,GACF,SAAS,CAKpB;IAED;;;;;;OAMG;IACH,sBALW,GAAG,SACH,GAAG,UACH,GAAG,GACF,SAAS,CAKpB;IAED;;;;;;OAMG;IACH,uBALW,GAAG,SACH,GAAG,UACH,GAAG,GACF,SAAS,CAKpB;IAED;;;;;;OAMG;IACH,uBALW,GAAG,SACH,GAAG,UACH,GAAG,GACF,SAAS,CAKpB;IAED;;;;;;OAMG;IACH,yBALW,GAAG,SACH,GAAG,UACH,GAAG,GACF,SAAS,CAKpB;IAED;;;;;;OAMG;IACH,yBALW,GAAG,SACH,GAAG,UACH,GAAG,GACF,SAAS,CAKpB;IA1hCD;;;;;;;OAOG;IACH,mBANW,SAAS,CAAC,MAAM,CAAC,GAAC,MAAM,EAAE,GAAC,iBAAiB,GAAC,UAAU,GAAC,WAAW,GAAC,WAAW,GAAC,SAAS,GAAC,UAAU,GAAC,UAAU,GAAC,YAAY,GAAC,YAAY,aACzI,MAAM,UACN,MAAM,WACN,MAAM,EAmDhB;IA7BG;;;OAGG;IACH,OAFU,MAAM,CAEE;IAElB;;;OAGG;IACH,QAFU,MAAM,CAEI;IAEpB;;;OAGG;IACH,UAFU,MAAM,CAEQ;IAExB;;;OAGG;IACH,MAFU,MAAM,EAAE,GAAC,iBAAiB,GAAC,UAAU,GAAC,WAAW,GAAC,WAAW,GAAC,SAAS,GAAC,UAAU,GAAC,UAAU,GAAC,YAAY,GAAC,YAAY,CAEjH;IAEhB;;;OAGG;IACH,SAFU,MAAM,CAEA;IAGpB;;;;;OAKG;IACH,sBAJW,MAAM,KACN,MAAM,UACN,MAAM,EAAE,QAQlB;IAED;;;;;;OAMG;IACH,6BALW,MAAM,KACN,MAAM,WACN,MAAM,GACJ,MAAM,CAOlB;IAED;;;;;;;OAOG;IACH,2BALW,MAAM,KACN,MAAM,WACN,MAAM,GACJ,MAAM,CA2DlB;IAED;;;;;OAKG;IACH,mBAJW,MAAM,KACN,MAAM,UACN,MAAM,EAAE,QAQlB;IAED;;;;;;OAMG;IACH,iBALW,MAAM,KACN,MAAM,UACN,MAAM,EAAE,GAAC,YAAY,GAAC,YAAY,iBAClC,MAAM,QAUhB;IAED;;;;;;OAMG;IACH,0BALW,MAAM,KACN,MAAM,WACN,MAAM,GACJ,MAAM,CAOlB;IAED;;;;;;;OAOG;IACH,wBALW,MAAM,KACN,MAAM,WACN,MAAM,GACJ,MAAM,CAgFlB;IAED;;;;;;OAMG;IACH,oBALW,MAAM,KACN,MAAM,UACN,MAAM,EAAE,GAAC,YAAY,kBACrB,MAAM,QAUhB;IAED;;;;;;OAMG;IACH,kBALW,MAAM,KACN,MAAM,UACN,MAAM,EAAE,GAAC,YAAY,GAAC,YAAY,kBAClC,MAAM,QAWhB;IAED;;;;;;OAMG;IACH,2BALW,MAAM,KACN,MAAM,WACN,MAAM,GACL,MAAM,CAOjB;IAED;;;;;;OAMG;IACH,yBALW,MAAM,KACN,MAAM,WACN,MAAM,GACJ,MAAM,CAiFlB;IAED;;;;;OAKG;IACH,mBAJW,MAAM,KACN,MAAM,UACN,MAAM,EAAE,GAAC,SAAS,CAAC,MAAM,CAAC,QAcpC;IAED;;;;;;OAMG;IACH,eALW,MAAM,KACN,MAAM,WACN,MAAM,GACJ,MAAM,CAalB;IAED;;;;;OAKG;IACH,QAJW,MAAM,KACN,MAAM,UACN,MAAM,EAAE,QAalB;IAED;;;;;OAKG;IACH,SAJW,MAAM,KACN,MAAM,SACN,MAAM,EAAE,GAAC,SAAS,CAAC,MAAM,CAAC,QAepC;IAED;;;;;OAKG;IACH,eAJW,MAAM,KACN,MAAM,GACJ,MAAM,CAIlB;IAED;;;;OAIG;IACH,mBAHW,MAAM,UACN,OAAO,QASjB;IAED;;;;;;;;;OASG;IACH,aARW,SAAS,qHAoDnB;IAGD;;;;;;;OAOG;IACH,oEA8BC;IAED;;;;OAIG;IACH,2BAHW,MAAM,SACN,MAAM,QAYhB;IAED;;;;;;;OAOG;IACH,QANW,MAAM,KACN,MAAM,SACN,MAAM,UACN,MAAM,SACN,KAAK,CAAE,MAAM,CAAC,QAqCxB;IAED;;;;;;OAMG;IACH,gBALW,MAAM,KACN,MAAM,WACN,MAAM,SACN,MAAM,QAqBhB;IAGD;;;;;;;OAOG;IACH,wBALW,MAAM,WACN,MAAM,UACN,MAAM,sBAyBhB;IAED;;;;;OAKG;IACH,UAJW,MAAM,KACN,MAAM,iBACN,OAAO,QAyDjB;IAED;;;OAGG;IACH,mBAFY,MAAM,CAejB;IAED;;;;OAIG;IACH,cAHW,SAAS,GACR,OAAO,CAiBlB;IAED;;;OAGG;IACH,QAFY,MAAM,CAgCjB;IAGD;;OAEG;IACH,SAFa,SAAS,CAerB;IAED;;;;;;MAUC;IAED;;;;;;aAwBC;IAiHL;;OAEG;IACH,SA9jBe,MAAM,KACN,MAAM,SACN,MAAM,EAAE,GAAC,SAAS,CAAC,MAAM,CAAC,UA4jBlB;IAEvB;;;OAGG;IACH,sBAFU,OAAO,CAEc;CAZ9B;;kBAgBS,MAAM"}
+{"version":3,"file":"Sampler2D.d.ts","sourceRoot":"","sources":["../../../../../../src/engine/graphics/texture/sampler/Sampler2D.js"],"names":[],"mappings":"AAqBA;;;;GAIG;AACH;IAi7BI;;;;;;OAMG;IACH,8BALW,GAAG,SACH,GAAG,UACH,GAAG,GACF,SAAS,CAKpB;IAED;;;;;;OAMG;IACH,uBALW,GAAG,SACH,GAAG,UACH,GAAG,GACF,SAAS,CAKpB;IAED;;;;;;OAMG;IACH,wBALW,GAAG,SACH,GAAG,UACH,GAAG,GACF,SAAS,CAKpB;IAED;;;;;;OAMG;IACH,wBALW,GAAG,SACH,GAAG,UACH,GAAG,GACF,SAAS,CAKpB;IAED;;;;;;OAMG;IACH,sBALW,GAAG,SACH,GAAG,UACH,GAAG,GACF,SAAS,CAKpB;IAED;;;;;;OAMG;IACH,uBALW,GAAG,SACH,GAAG,UACH,GAAG,GACF,SAAS,CAKpB;IAED;;;;;;OAMG;IACH,uBALW,GAAG,SACH,GAAG,UACH,GAAG,GACF,SAAS,CAKpB;IAED;;;;;;OAMG;IACH,yBALW,GAAG,SACH,GAAG,UACH,GAAG,GACF,SAAS,CAKpB;IAED;;;;;;OAMG;IACH,yBALW,GAAG,SACH,GAAG,UACH,GAAG,GACF,SAAS,CAKpB;IA1hCD;;;;;;;OAOG;IACH,mBANW,SAAS,CAAC,MAAM,CAAC,GAAC,MAAM,EAAE,GAAC,iBAAiB,GAAC,UAAU,GAAC,WAAW,GAAC,WAAW,GAAC,SAAS,GAAC,UAAU,GAAC,UAAU,GAAC,YAAY,GAAC,YAAY,aACzI,MAAM,UACN,MAAM,WACN,MAAM,EAmDhB;IA7BG;;;OAGG;IACH,OAFU,MAAM,CAEE;IAElB;;;OAGG;IACH,QAFU,MAAM,CAEI;IAEpB;;;OAGG;IACH,UAFU,MAAM,CAEQ;IAExB;;;OAGG;IACH,MAFU,MAAM,EAAE,GAAC,iBAAiB,GAAC,UAAU,GAAC,WAAW,GAAC,WAAW,GAAC,SAAS,GAAC,UAAU,GAAC,UAAU,GAAC,YAAY,GAAC,YAAY,CAEjH;IAEhB;;;OAGG;IACH,SAFU,MAAM,CAEA;IAGpB;;;;;OAKG;IACH,sBAJW,MAAM,KACN,MAAM,UACN,MAAM,EAAE,QAQlB;IAED;;;;;;OAMG;IACH,6BALW,MAAM,KACN,MAAM,WACN,MAAM,GACJ,MAAM,CAOlB;IAED;;;;;;;OAOG;IACH,2BALW,MAAM,KACN,MAAM,WACN,MAAM,GACJ,MAAM,CA2DlB;IAED;;;;;OAKG;IACH,mBAJW,MAAM,KACN,MAAM,UACN,MAAM,EAAE,QAQlB;IAED;;;;;;OAMG;IACH,iBALW,MAAM,KACN,MAAM,UACN,MAAM,EAAE,GAAC,YAAY,GAAC,YAAY,iBAClC,MAAM,QAUhB;IAED;;;;;;OAMG;IACH,0BALW,MAAM,KACN,MAAM,WACN,MAAM,GACJ,MAAM,CAOlB;IAED;;;;;;;OAOG;IACH,wBALW,MAAM,KACN,MAAM,WACN,MAAM,GACJ,MAAM,CAgFlB;IAED;;;;;;OAMG;IACH,oBALW,MAAM,KACN,MAAM,UACN,MAAM,EAAE,GAAC,YAAY,kBACrB,MAAM,QAUhB;IAED;;;;;;OAMG;IACH,kBALW,MAAM,KACN,MAAM,UACN,MAAM,EAAE,GAAC,YAAY,GAAC,YAAY,kBAClC,MAAM,QAWhB;IAED;;;;;;OAMG;IACH,2BALW,MAAM,KACN,MAAM,WACN,MAAM,GACL,MAAM,CAOjB;IAED;;;;;;OAMG;IACH,yBALW,MAAM,KACN,MAAM,WACN,MAAM,GACJ,MAAM,CAiFlB;IAED;;;;;OAKG;IACH,mBAJW,MAAM,KACN,MAAM,UACN,MAAM,EAAE,GAAC,SAAS,CAAC,MAAM,CAAC,QAcpC;IAED;;;;;;OAMG;IACH,eALW,MAAM,KACN,MAAM,WACN,MAAM,GACJ,MAAM,CAalB;IAED;;;;;OAKG;IACH,QAJW,MAAM,KACN,MAAM,UACN,MAAM,EAAE,QAalB;IAED;;;;;OAKG;IACH,SAJW,MAAM,KACN,MAAM,SACN,MAAM,EAAE,GAAC,SAAS,CAAC,MAAM,CAAC,QAepC;IAED;;;;;OAKG;IACH,eAJW,MAAM,KACN,MAAM,GACJ,MAAM,CAIlB;IAED;;;;OAIG;IACH,mBAHW,MAAM,UACN,OAAO,QASjB;IAED;;;;;;;;;OASG;IACH,aARW,SAAS,qHAoDnB;IAGD;;;;;;;OAOG;IACH,oEA8BC;IAED;;;;OAIG;IACH,2BAHW,MAAM,SACN,MAAM,QAYhB;IAED;;;;;;;OAOG;IACH,QANW,MAAM,KACN,MAAM,SACN,MAAM,UACN,MAAM,SACN,KAAK,CAAE,MAAM,CAAC,QAqCxB;IAED;;;;;;OAMG;IACH,gBALW,MAAM,KACN,MAAM,WACN,MAAM,SACN,MAAM,QAqBhB;IAGD;;;;;;;OAOG;IACH,wBALW,MAAM,WACN,MAAM,UACN,MAAM,sBAyBhB;IAED;;;;;OAKG;IACH,UAJW,MAAM,KACN,MAAM,iBACN,OAAO,QAyDjB;IAED;;;OAGG;IACH,mBAFY,MAAM,CAejB;IAED;;;;OAIG;IACH,cAHW,SAAS,GACR,OAAO,CAiBlB;IAED;;;OAGG;IACH,QAFY,MAAM,CAgCjB;IAGD;;OAEG;IACH,SAFa,SAAS,CAerB;IAED;;;;;;MAUC;IAED;;;;;;aAwBC;IA8GD;;OAEG;IACH,YAEC;IAIL;;;OAGG;IACH,sBAFU,OAAO,CAEc;CAN9B;;kBAUS,MAAM"}

package/src/engine/graphics/texture/sampler/Sampler2D.js

@@ -1077,13 +1077,14 @@ export class Sampler2D {
         return new Sampler2D(data, itemSize, width, height);
     }
 
-}
-
+    /**
+     * @deprecated use {@link write} instead
+     */
+    set(){
+        throw new Error("Deprecated, use 'write' instead")
+    }
 
-/**
- * @deprecated use {@link write} instead
- */
-Sampler2D.prototype.set = Sampler2D.prototype.write;
+}
 
 /**
  * @readonly

package/src/engine/graphics/texture/sampler/debug/prototypeSamplerFiltering.js

@@ -155,7 +155,7 @@ function test_sampling(source, engine) {
 
                         input.sampleNearestUV(x / (out.width - 1), y / (out.height - 1), sample);
 
-                        out.set(x, y, sample);
+                        out.write(x, y, sample);
                     }
                 }
             },
@@ -173,7 +173,7 @@ function test_sampling(source, engine) {
 
                         input.sampleBilinearUV(x / (out.width - 1), y / (out.height - 1), sample);
 
-                        out.set(x, y, sample);
+                        out.write(x, y, sample);
                     }
                 }
             },
@@ -190,7 +190,7 @@ function test_sampling(source, engine) {
 
                         input.sampleBicubicUV(x / (out.width - 1), y / (out.height - 1), sample);
 
-                        out.set(x, y, sample);
+                        out.write(x, y, sample);
                     }
                 }
             },
@@ -207,7 +207,7 @@ function test_sampling(source, engine) {
 
                         input.sampleCatmullRomUV(x / (out.width - 1), y / (out.height - 1), sample);
 
-                        out.set(x, y, sample);
+                        out.write(x, y, sample);
                     }
                 }
             },

package/src/engine/graphics/texture/sampler/sampler2d_paint.js

@@ -72,7 +72,7 @@ export function sampler2d_paint(
 
             blendFunction(c1, c0, c3);
 
-            destination.set(d_x, d_y, c3);
+            destination.write(d_x, d_y, c3);
 
         }
     }