@woosh/meep-engine 2.118.2 → 2.118.4

package/build/meep.module.js

@@ -1765,6 +1765,12 @@ function lerp$1(a, b, fraction) {
     return (b - a) * fraction + a;
 }
 
+/**
+ * equal to `Math.pow(2,32) - 1`
+ * @type {number}
+ */
+const UINT32_MAX = 4294967295;
+
 /**
  *
  * @param {number} v
@@ -1772,12 +1778,12 @@ function lerp$1(a, b, fraction) {
  */
 function computeHashFloat(v) {
     //we break the number up into fractional and whole parts
-    const whole = v | 0;
+    const whole = v >> 0;
 
     const fraction = v - whole;
 
     //fractional part is scaled up into int32 range, this inexact method, as it will produce 0 hash for values below a certain threshold
-    const fractionHash = fraction * 1367130550;
+    const fractionHash = fraction * UINT32_MAX;
 
     //take XOR of both parts
     return fractionHash ^ whole;
@@ -2122,10 +2128,8 @@ function v3_slerp(
 
 /**
  * @author Alex Goldring
- * @copyright Alex Goldring 2015
+ * @copyright Alex Goldring 2015-2024
  */
-
-
 let Vector3$1 = class Vector3 {
     /**
      *
@@ -3015,7 +3019,7 @@ let Vector3$1 = class Vector3 {
      * @deprecated use dedicated method directly instead
      */
     fromBinaryBufferFloat32_EqualityEncoded(buffer) {
-        throw  new Error('deprecated, use v3_binary_equality_decode')
+        throw new Error('deprecated, use v3_binary_equality_decode')
     }
 
     hash() {
@@ -3176,19 +3180,7 @@ Vector3$1.prototype.isVector3 = true;
  * @readonly
  * @type {string}
  */
-Vector3$1.typeName = "Vector3";
-
-/**
- * @deprecated use {@link v3_dot} directly instead
- * @param {number} x0
- * @param {number} y0
- * @param {number} z0
- * @param {number} x1
- * @param {number} y1
- * @param {number} z1
- * @returns {number}
- */
-Vector3$1._dot = v3_dot;
+Vector3$1.typeName = "Vector3";
 
 const scratch_v3_a = new Vector3$1();
 const scratch_v3_b = new Vector3$1();
@@ -50299,6 +50291,7 @@ function float_to_uint8(v) {
  * @returns {number}
  */
 function uint8_to_float(v) {
+
     return v / 255;
 }
 
@@ -51201,18 +51194,28 @@ const context_cache = new WeakMap();
 /**
  *
  * @param {HTMLCanvasElement} canvas
- * @returns {Sampler2D}
+ * @returns {CanvasRenderingContext2D}
  */
-function html_canvas_to_sampler2d(canvas) {
-    const width = canvas.width;
-    const height = canvas.height;
-
+function html_canvas_to_rendering_context2d_cached(canvas) {
     let context = context_cache.get(canvas);
 
     if (context === undefined) {
         context = canvas.getContext("2d");
         context_cache.set(canvas, context);
     }
+    return context;
+}
+
+/**
+ *
+ * @param {HTMLCanvasElement} canvas
+ * @returns {Sampler2D}
+ */
+function html_canvas_to_sampler2d(canvas) {
+    const width = canvas.width;
+    const height = canvas.height;
+
+    const context = html_canvas_to_rendering_context2d_cached(canvas);
 
     const imageData = context.getImageData(0, 0, width, height);
 
@@ -52057,12 +52060,6 @@ class TerrainPreview {
     }
 }
 
-/**
- * equal to `Math.pow(2,32) - 1`
- * @type {number}
- */
-const UINT32_MAX = 4294967295;
-
 /**
  * This is essentially a {@link memcopy} implementation for ArrayBuffers
  * NOTE: allocates light-weight typed arrays under the hood, so beware of potential GC implications. Generally not an issue, unless you're copying very large number of very small arrays, consider alternatives such as {@link array_copy} instead
@@ -53919,9 +53916,9 @@ class Color {
 
     /**
      *
-     * @param {number} r
-     * @param {number} g
-     * @param {number} b
+     * @param {number} r [0..255]
+     * @param {number} g [0..255]
+     * @param {number} b [0..255]
      */
     setRGBUint8(r, g, b) {
         this.setRGB(
@@ -55308,13 +55305,17 @@ function v3_morton_encode_bounded(x, y, z, bounds) {
 function max3(a, b, c) {
 
     let v = a;
+
     if (v < b) {
         v = b;
     }
+
     if (v < c) {
         v = c;
     }
+
     return v;
+
 }
 
 /**
@@ -76449,6 +76450,17 @@ function murmur3_32(key, seed) {
     return h1 >>> 0;
 }
 
+/**
+ *
+ * @param {HTMLCanvasElement} canvas
+ * @returns {number}
+ */
+function computeHtmlCanvasElementHash(canvas) {
+    const sampler = html_canvas_to_sampler2d(canvas);
+
+    return sampler.hash();
+}
+
 /**
  * Guards against cases where ImageBitmap doesn't exist
  * @param {*} image
@@ -76693,6 +76705,10 @@ function computeImageDataHash(image) {
 
         result = computeStringHash(image.src);
 
+    }else if(image instanceof HTMLCanvasElement) {
+
+        result = computeHtmlCanvasElementHash(image);
+
     }
 
     let width = 0;
@@ -85291,6 +85307,13 @@ const STATUS_FULL = 0;
 const STATUS_EMPTY = 1;
 const STATUS_NORMAL = 2;
 
+/**
+ * When growing underlying array, how much to grow by. This is a multiplier.
+ * Must be greater than 1
+ * @type {number}
+ */
+const GROWTH_FACTOR = 2;
+
 const EMPTY_ARRAY = new Array(0);
 
 /**
@@ -85307,14 +85330,16 @@ class Deque {
      * @private
      */
     #data = EMPTY_ARRAY;
+
     /**
-     *
+     * Index of the front of the queue inside the internal data array
      * @type {number}
      * @private
      */
     #head = 0;
+
     /**
-     *
+     * Index of the back of the queue inside the internal data array
      * @type {number}
      * @private
      */
@@ -85396,7 +85421,7 @@ class Deque {
         }
 
         // double existing length
-        let new_length = length * 2;
+        let new_length = length * GROWTH_FACTOR;
 
         if (new_length > UINT32_MAX) {
             // clamp to max uint32 value
@@ -85469,41 +85494,23 @@ class Deque {
     /**
      *
      * @param {number} current
-     * @param {boolean} shift_front should we shift elements before the removed element or after?
      * @private
      */
-    #remove_internal(current, shift_front) {
+    #remove_internal_shift_backward(current) {
         let cursor = current;
 
-        if (shift_front) {
-
-            // shift towards tail
-
-            const head = this.#head;
+        // shift towards head, this has a better data access pattern than shifting the other way as we're going through the data in forward sequence
 
-            while (cursor !== head) {
-                const next = this.#circular_previous_position(cursor);
-                this.#data[cursor] = this.#data[next];
-                cursor = next;
-            }
-
-            this.#head = this.#circular_next_position(head);
-
-        } else {
-
-            // shift towards head
-
-            const tail = this.#tail;
+        const tail = this.#tail;
 
-            while (cursor !== tail) {
-                const next = this.#circular_next_position(cursor);
-                this.#data[cursor] = this.#data[next];
-                cursor = next;
-            }
+        while (cursor !== tail) {
+            const next = this.#circular_next_position(cursor);
+            this.#data[cursor] = this.#data[next];
+            cursor = next;
+        }
 
-            this.#tail = this.#circular_previous_position(tail);
+        this.#tail = this.#circular_previous_position(tail);
 
-        }
 
         // fill in slot of last moved element
         this.#data[cursor] = undefined;
@@ -85523,7 +85530,7 @@ class Deque {
             return false;
         }
 
-        this.#remove_internal(i, true);
+        this.#remove_internal_shift_backward(i);
 
         return true;
     }
@@ -85685,12 +85692,21 @@ class Deque {
 Stack methods
  */
 
+/**
+ * Stack operation. Alias of {@link Deque.prototype.getFirst}
+ */
 Deque.prototype.peek = Deque.prototype.getFirst;
+/**
+ * Stack operation. Alias of {@link Deque.prototype.addFirst}
+ */
 Deque.prototype.push = Deque.prototype.addFirst;
+/**
+ * Stack operation. Alias of {@link Deque.prototype.removeFirst}
+ */
 Deque.prototype.pop = Deque.prototype.removeFirst;
 
 /**
- * Standard queue method
+ * Alias of {@link Deque.prototype.addLast}
  */
 Deque.prototype.add = Deque.prototype.addLast;
 
@@ -103210,59 +103226,49 @@ GUIElement.serializable = true;
 
 class ViewportPosition {
     /**
-     *
-     * @constructor
+     * Clip-scale position, on-screen values are in range of 0 to 1
+     * @type {Vector2}
      */
-    constructor(options) {
-        /**
-         * Clip-scale position, on-screen values are in range of 0 to 1
-         * @type {Vector2}
-         */
-        this.position = new Vector2();
-
-        /**
-         * Fixed offset in pixels
-         * @type {Vector2}
-         */
-        this.offset = new Vector2();
-        /**
-         * ranges from 0..1 in both X and Y, controls anchor point of element positioning
-         * @type {Vector2}
-         */
-        this.anchor = new Vector2(0, 0);
+    position = new Vector2();
 
+    /**
+     * Fixed offset in pixels
+     * @type {Vector2}
+     */
+    offset = new Vector2();
+    /**
+     * ranges from 0..1 in both X and Y, controls anchor point of element positioning
+     * @type {Vector2}
+     */
+    anchor = new Vector2(0, 0);
 
-        /**
-         * Makes display element avoid overlap with GUI elements
-         * @see GUIElement
-         * @type {boolean}
-         */
-        this.resolveGuiCollisions = false;
 
-        /**
-         * How far should the HUD stay away from the edge if it's sticky
-         * @see stickToScreenEdge
-         * @type {number}
-         */
-        this.screenEdgeWidth = 10;
+    /**
+     * Makes display element avoid overlap with GUI elements
+     * @see GUIElement
+     * @type {boolean}
+     */
+    resolveGuiCollisions = false;
 
+    /**
+     * How far should the HUD stay away from the edge if it's sticky
+     * @see stickToScreenEdge
+     * @type {number}
+     */
+    screenEdgeWidth = 10;
 
-        /**
-         * Controls whenever or not HUD should remain on the screen when it gets to the edge
-         * @type {boolean}
-         */
-        this.stickToScreenEdge = false;
 
-        /**
-         * Can be used to enable and disable positioning
-         * @type {ObservedBoolean}
-         */
-        this.enabled = new ObservedBoolean(true);
+    /**
+     * Controls whenever or not HUD should remain on the screen when it gets to the edge
+     * @type {boolean}
+     */
+    stickToScreenEdge = false;
 
-        if (options !== undefined) {
-            this.fromJSON(options);
-        }
-    }
+    /**
+     * Can be used to enable and disable positioning
+     * @type {ObservedBoolean}
+     */
+    enabled = new ObservedBoolean(true);
 
     /**
      *

package/package.json

@@ -5,7 +5,7 @@
   "description": "Fully featured ECS game engine written in JavaScript",
   "type": "module",
   "author": "Alexander Goldring",
-  "version": "2.118.2",
+  "version": "2.118.4",
   "main": "build/meep.module.js",
   "module": "build/meep.module.js",
   "exports": {
@@ -42,8 +42,8 @@
   "dependencies": {
     "gl-matrix": "3.4.3",
     "opentype.js": "1.3.3",
-    "robust-predicates": "3.0.2",
-    "pako": "2.0.3"
+    "pako": "2.0.3",
+    "robust-predicates": "3.0.2"
   },
   "peerDependencies": {
     "three": ">=0.135.0"
@@ -58,10 +58,10 @@
     "@babel/preset-env": "7.22.15",
     "@rollup/plugin-commonjs": "25.0.2",
     "@rollup/plugin-node-resolve": "15.1.0",
-    "@rollup/plugin-terser": "0.4.3",
     "@rollup/plugin-strip": "3.0.2",
-    "@types/three": "^0.135.0",
+    "@rollup/plugin-terser": "0.4.3",
     "@types/jest": "29.5.12",
+    "@types/three": "^0.135.0",
     "babel-jest": "29.5.0",
     "jest": "29.6.4",
     "jest-environment-jsdom": "29.6.4",

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

@@ -1,3 +1,6 @@
+/**
+ * The values are based on the endianness flag of {@link DataView } methods
+ */
 export type EndianType = boolean;
 export namespace EndianType {
     let BigEndian: boolean;

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

@@ -1 +1 @@
-{"version":3,"file":"EndianType.d.ts","sourceRoot":"","sources":["../../../../src/core/binary/EndianType.js"],"names":[],"mappings":"yBAEU,OAAO"}
+{"version":3,"file":"EndianType.d.ts","sourceRoot":"","sources":["../../../../src/core/binary/EndianType.js"],"names":[],"mappings":";;;yBAGU,OAAO"}

package/src/core/binary/EndianType.js

@@ -1,5 +1,6 @@
 /**
- *
+ * The values are based on the endianness flag of {@link DataView} methods
+ * @readonly
  * @enum {boolean}
  */
 export const EndianType = {

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

@@ -1 +1 @@
-{"version":3,"file":"uint8_to_float.d.ts","sourceRoot":"","sources":["../../../../src/core/binary/uint8_to_float.js"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,kCAHW,MAAM,GACJ,MAAM,CAIlB"}
+{"version":3,"file":"uint8_to_float.d.ts","sourceRoot":"","sources":["../../../../src/core/binary/uint8_to_float.js"],"names":[],"mappings":"AAEA;;;;GAIG;AACH,kCAHW,MAAM,GACJ,MAAM,CAOlB"}

package/src/core/binary/uint8_to_float.js

@@ -1,8 +1,13 @@
+import { assert } from "../assert.js";
+
 /**
  *
  * @param {number} v
  * @returns {number}
  */
 export function uint8_to_float(v) {
+    assert.lessThanOrEqual(v, 255);
+    assert.greaterThanOrEqual(v, 0);
+
     return v / 255;
 }

package/src/core/collection/queue/Deque.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"Deque.d.ts","sourceRoot":"","sources":["../../../../../src/core/collection/queue/Deque.js"],"names":[],"mappings":"AAcA;;;GAGG;AACH;IA8BI;;;OAGG;IACH,uBAFW,MAAM,EAUhB;IAuFD;;;OAGG;IACH,WAFY,OAAO,CAIlB;IAED,cAeC;IAED;;;OAGG;IACH,QAFa,MAAM,CAalB;IA+CD;;;;OAIG;IACH,UAHW,CAAC,GACC,OAAO,CAYnB;IA4BD;;;;OAIG;IACH,WAFa,OAAO,CAInB;IAED;;;OAGG;IACH,YAFW,CAAC,QAOX;IAED;;;OAGG;IACH,eAFa,CAAC,GAAC,SAAS,CAQvB;IAED;;;OAGG;IACH,YAFa,CAAC,GAAC,SAAS,CAIvB;IAED;;;OAGG;IACH,WAFW,CAAC,QAOX;IAED;;;OAGG;IACH,cAFa,CAAC,CASb;IAGD;;;OAGG;IACH,WAFa,CAAC,GAAC,SAAS,CAKvB;IAED;;;;OAIG;IACH,yBAHW,MAAM,GACJ,CAAC,GAAC,SAAS,CAmBvB;IAED;;;;;OAKG;IACH,iBAJW,CAAC,EAAE,kBACH,MAAM,GACJ,CAAC,EAAE,CAUf;IAoBL,gBAAoB;IACpB,uBAAoB;IACpB,eAAmB;IAEnB;;OAEG;IACH,sBAAmB;IAzBf;;;OAGG;IACH,qBAFa,UAAU,CAAC,EAAC,IAAI,CAAC,CAS7B;;CACJ"}
+{"version":3,"file":"Deque.d.ts","sourceRoot":"","sources":["../../../../../src/core/collection/queue/Deque.js"],"names":[],"mappings":"AAqBA;;;GAGG;AACH;IAgCI;;;OAGG;IACH,uBAFW,MAAM,EAUhB;IAuFD;;;OAGG;IACH,WAFY,OAAO,CAIlB;IAED,cAeC;IAED;;;OAGG;IACH,QAFa,MAAM,CAalB;IA6BD;;;;OAIG;IACH,UAHW,CAAC,GACC,OAAO,CAYnB;IA4BD;;;;OAIG;IACH,WAFa,OAAO,CAInB;IAED;;;OAGG;IACH,YAFW,CAAC,QAOX;IAED;;;OAGG;IACH,eAFa,CAAC,GAAC,SAAS,CAQvB;IAED;;;OAGG;IACH,YAFa,CAAC,GAAC,SAAS,CAIvB;IAED;;;OAGG;IACH,WAFW,CAAC,QAOX;IAED;;;OAGG;IACH,cAFa,CAAC,CASb;IAGD;;;OAGG;IACH,WAFa,CAAC,GAAC,SAAS,CAKvB;IAED;;;;OAIG;IACH,yBAHW,MAAM,GACJ,CAAC,GAAC,SAAS,CAmBvB;IAED;;;;;OAKG;IACH,iBAJW,CAAC,EAAE,kBACH,MAAM,GACJ,CAAC,EAAE,CAUf;IAoBL;;OAEG;IACH,gBAAoB;IACpB;;OAEG;IACH,uBAAoB;IACpB;;OAEG;IACH,eAAmB;IAEnB;;OAEG;IACH,sBAAmB;IAlCf;;;OAGG;IACH,qBAFa,UAAU,CAAC,EAAC,IAAI,CAAC,CAS7B;;CACJ"}

package/src/core/collection/queue/Deque.js

@@ -10,6 +10,13 @@ const STATUS_FULL = 0;
 const STATUS_EMPTY = 1;
 const STATUS_NORMAL = 2;
 
+/**
+ * When growing underlying array, how much to grow by. This is a multiplier.
+ * Must be greater than 1
+ * @type {number}
+ */
+const GROWTH_FACTOR = 2;
+
 const EMPTY_ARRAY = new Array(0);
 
 /**
@@ -26,14 +33,16 @@ export class Deque {
      * @private
      */
     #data = EMPTY_ARRAY;
+
     /**
-     *
+     * Index of the front of the queue inside the internal data array
      * @type {number}
      * @private
      */
     #head = 0;
+
     /**
-     *
+     * Index of the back of the queue inside the internal data array
      * @type {number}
      * @private
      */
@@ -117,7 +126,7 @@ export class Deque {
         }
 
         // double existing length
-        let new_length = length * 2;
+        let new_length = length * GROWTH_FACTOR;
 
         if (new_length > UINT32_MAX) {
             // clamp to max uint32 value
@@ -190,41 +199,23 @@ export class Deque {
     /**
      *
      * @param {number} current
-     * @param {boolean} shift_front should we shift elements before the removed element or after?
      * @private
      */
-    #remove_internal(current, shift_front) {
+    #remove_internal_shift_backward(current) {
         let cursor = current;
 
-        if (shift_front) {
-
-            // shift towards tail
-
-            const head = this.#head;
-
-            while (cursor !== head) {
-                const next = this.#circular_previous_position(cursor);
-                this.#data[cursor] = this.#data[next];
-                cursor = next;
-            }
-
-            this.#head = this.#circular_next_position(head);
-
-        } else {
-
-            // shift towards head
+        // shift towards head, this has a better data access pattern than shifting the other way as we're going through the data in forward sequence
 
-            const tail = this.#tail;
+        const tail = this.#tail;
 
-            while (cursor !== tail) {
-                const next = this.#circular_next_position(cursor);
-                this.#data[cursor] = this.#data[next];
-                cursor = next;
-            }
+        while (cursor !== tail) {
+            const next = this.#circular_next_position(cursor);
+            this.#data[cursor] = this.#data[next];
+            cursor = next;
+        }
 
-            this.#tail = this.#circular_previous_position(tail);
+        this.#tail = this.#circular_previous_position(tail);
 
-        }
 
         // fill in slot of last moved element
         this.#data[cursor] = undefined;
@@ -244,7 +235,7 @@ export class Deque {
             return false;
         }
 
-        this.#remove_internal(i, true);
+        this.#remove_internal_shift_backward(i);
 
         return true;
     }
@@ -407,11 +398,20 @@ export class Deque {
 Stack methods
  */
 
+/**
+ * Stack operation. Alias of {@link Deque.prototype.getFirst}
+ */
 Deque.prototype.peek = Deque.prototype.getFirst;
+/**
+ * Stack operation. Alias of {@link Deque.prototype.addFirst}
+ */
 Deque.prototype.push = Deque.prototype.addFirst;
+/**
+ * Stack operation. Alias of {@link Deque.prototype.removeFirst}
+ */
 Deque.prototype.pop = Deque.prototype.removeFirst;
 
 /**
- * Standard queue method
+ * Alias of {@link Deque.prototype.addLast}
  */
 Deque.prototype.add = Deque.prototype.addLast;

package/src/core/collection/table/RowFirstTable.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"RowFirstTable.d.ts","sourceRoot":"","sources":["../../../../../src/core/collection/table/RowFirstTable.js"],"names":[],"mappings":"AA+BA;;;;GAIG;AACH;IACI;;;;;OAKG;IACH,oDAHW,OAAO,EAiDjB;IAzCG;;;OAGG;IACH,wBAAgB;IAEhB;;;OAGG;IACH,MAFU,WAAW,CAE4D;IAEjF;;;OAGG;IACH,QAFU,MAAM,CAED;IAEf;;;OAGG;IACH,UAFU,MAAM,CAEgB;IAEhC;;;OAGG;IACH,UAFU,QAAQ,CAEqB;IAEvC;;;OAGG;IACH,IAFU;QAAC,KAAK,EAAE,MAAM,CAAA;KAAC,CAOxB;IAIL;;;OAGG;IACH,8BAEC;IAED;;;OAGG;IACH,6BAEC;IAED;;;OAGG;IACH,4BAFqB,QAAQ,QAAE,MAAM,QAAE,MAAM,EAAE,KAAG,IAAI,CAIrD;IAED;;;OAGG;IACH,6BAFqB,QAAQ,QAAE,MAAM,QAAE,MAAM,EAAE,KAAG,IAAI,CAIrD;IAGD;;;;OAIG;IACH,uDAMC;IAED;;;OAGG;IACH,QAFa,MAAM,CA+BlB;IAED;;;OAGG;IACH,sBAFW,MAAM,QAgDhB;IAED;;OAEG;IACH,aAEC;IAED;;;OAGG;IACH,kBAFW,MAAM,QAsBhB;IAED;;;;;OAKG;IACH,0BAJW,MAAM,gBACN,MAAM,SACN,MAAM,QAmBhB;IAED;;;;;OAKG;IACH,yBAJW,MAAM,gBACN,MAAM,GACJ,MAAM,CAmBlB;IAED;;;;OAIG;IACH,kBAHW,MAAM,aACN,MAAM,QAyBhB;IAED;;;;;;OAMG;IACH,kBAHW,MAAM,aACN,MAAM,QAwBhB;IAED;;;;;OAKG;IACH,kBAFY,MAAM,CAYjB;IAED;;;;OAIG;IACH,eAHW,MAAO,MAAM,CAAC,GACZ,MAAM,CAUlB;IAED;;;;OAIG;IACH,eAHW,MAAM,4BA8ChB;IAED;;;;OAIG;IACH,gBAHW,MAAM,UACN,MAAM,QAwBhB;IAED;;;;OAIG;IACH,YAFW,aAAa,QAmBvB;IAED;;;OAGG;IACH,cAHW,aAAa,GACX,OAAO,CAmCnB;IAED;;;;;OAKG;IACH,eAJW,MAAM,WACN,MAAM,EAAE,GACN,MAAM,EAAE,CAUpB;IAED;;;;OAIG;IACH,gBAHW,MAAM,UACN,MAAM,EAAE,QAUlB;IAED;;OAEG;IACH,qBA4BC;IAED;;OAEG;IACH,cAIC;IAED;;;OAGG;IACH,iBAFa,MAAM,CAIlB;IAED;;;OAGG;IACH,cAFa,MAAM,EAAE,EAAE,CAetB;IAED;;OAEG;IACH,uBAIC;IAED;;OAEG;IACH,mBAEC;IAGL;;OAEG;IACH,gBAtHe,MAAM,WACN,MAAM,EAAE,KACN,MAAM,EAAE,CAoHK;IAC9B;;OAEG;IACH,gBA1Ge,MAAM,UACN,MAAM,EAAE,UAyGO;CAT7B;mBAhpBkB,+BAA+B"}
+{"version":3,"file":"RowFirstTable.d.ts","sourceRoot":"","sources":["../../../../../src/core/collection/table/RowFirstTable.js"],"names":[],"mappings":"AA+BA;;;;GAIG;AACH;IACI;;;;;OAKG;IACH,oDAHW,OAAO,EAiDjB;IAzCG;;;OAGG;IACH,wBAAgB;IAEhB;;;OAGG;IACH,MAFU,WAAW,CAE4D;IAEjF;;;OAGG;IACH,QAFU,MAAM,CAED;IAEf;;;OAGG;IACH,UAFU,MAAM,CAEgB;IAEhC;;;OAGG;IACH,UAFU,QAAQ,CAEqB;IAEvC;;;OAGG;IACH,IAFU;QAAC,KAAK,EAAE,MAAM,CAAA;KAAC,CAOxB;IAIL;;;OAGG;IACH,8BAEC;IAED;;;OAGG;IACH,6BAEC;IAED;;;OAGG;IACH,4BAFqB,QAAQ,QAAE,MAAM,QAAE,MAAM,EAAE,KAAG,IAAI,CAIrD;IAED;;;OAGG;IACH,6BAFqB,QAAQ,QAAE,MAAM,QAAE,MAAM,EAAE,KAAG,IAAI,CAIrD;IAGD;;;;OAIG;IACH,uDAMC;IAED;;;OAGG;IACH,QAFa,MAAM,CA+BlB;IAED;;;OAGG;IACH,sBAFW,MAAM,QAgDhB;IAED;;OAEG;IACH,aAEC;IAED;;;OAGG;IACH,kBAFW,MAAM,QAsBhB;IAED;;;;;OAKG;IACH,0BAJW,MAAM,gBACN,MAAM,SACN,MAAM,QAmBhB;IAED;;;;;OAKG;IACH,yBAJW,MAAM,gBACN,MAAM,GACJ,MAAM,CAmBlB;IAED;;;;OAIG;IACH,kBAHW,MAAM,aACN,MAAM,QAyBhB;IAED;;;;;;OAMG;IACH,kBAHW,MAAM,aACN,MAAM,QAwBhB;IAED;;;;;OAKG;IACH,kBAFY,MAAM,CAYjB;IAED;;;;OAIG;IACH,eAHW,MAAO,MAAM,CAAC,GACZ,MAAM,CAYlB;IAED;;;;OAIG;IACH,eAHW,MAAM,4BA8ChB;IAED;;;;OAIG;IACH,gBAHW,MAAM,UACN,MAAM,QAwBhB;IAED;;;;OAIG;IACH,YAFW,aAAa,QAmBvB;IAED;;;OAGG;IACH,cAHW,aAAa,GACX,OAAO,CAmCnB;IAED;;;;;OAKG;IACH,eAJW,MAAM,WACN,MAAM,EAAE,GACN,MAAM,EAAE,CAUpB;IAED;;;;OAIG;IACH,gBAHW,MAAM,UACN,MAAM,EAAE,QAUlB;IAED;;OAEG;IACH,qBA4BC;IAED;;OAEG;IACH,cAIC;IAED;;;OAGG;IACH,iBAFa,MAAM,CAIlB;IAED;;;OAGG;IACH,cAFa,MAAM,EAAE,EAAE,CAetB;IAED;;OAEG;IACH,uBAIC;IAED;;OAEG;IACH,mBAEC;IAGL;;OAEG;IACH,gBAtHe,MAAM,WACN,MAAM,EAAE,KACN,MAAM,EAAE,CAoHK;IAC9B;;OAEG;IACH,gBA1Ge,MAAM,UACN,MAAM,EAAE,UAyGO;CAT7B;mBAlpBkB,+BAA+B"}

package/src/core/collection/table/RowFirstTable.js

@@ -390,6 +390,8 @@ export class RowFirstTable {
      * @returns {number} index of newly added row
      */
     addRow(values) {
+        assert.isArrayLike(values, 'values');
+
         const rowIndex = this.createEmptyRow();
 
         this.spec.writeRowMethod(this.dataView, this.spec.bytesPerRecord * rowIndex, values);

package/src/core/color/Color.js

@@ -152,9 +152,9 @@ export class Color {
 
     /**
      *
-     * @param {number} r
-     * @param {number} g
-     * @param {number} b
+     * @param {number} r [0..255]
+     * @param {number} g [0..255]
+     * @param {number} b [0..255]
      */
     setRGBUint8(r, g, b) {
         this.setRGB(

package/src/core/color/kelvin/rgb_to_kelvin.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"rgb_to_kelvin.d.ts","sourceRoot":"","sources":["../../../../../src/core/color/kelvin/rgb_to_kelvin.js"],"names":[],"mappings":"AAIA;;;;;GAKG;AACH,qCAHW,MAAM,EAAE,GAAC,UAAU,MAAM,CAAC,GAAC;IAAC,CAAC,EAAC,MAAM,CAAC;IAAA,CAAC,EAAC,MAAM,CAAC;IAAA,CAAC,EAAC,MAAM,CAAA;CAAC,iBACvD,MAAM,UAyBhB"}
+{"version":3,"file":"rgb_to_kelvin.d.ts","sourceRoot":"","sources":["../../../../../src/core/color/kelvin/rgb_to_kelvin.js"],"names":[],"mappings":"AAIA;;;;;GAKG;AACH,qCAHW,MAAM,EAAE,GAAC,UAAU,MAAM,CAAC,GAAC;IAAC,CAAC,EAAC,MAAM,CAAC;IAAA,CAAC,EAAC,MAAM,CAAC;IAAA,CAAC,EAAC,MAAM,CAAA;CAAC,iBACvD,MAAM,UAkChB"}

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

@@ -13,16 +13,25 @@ export function rgb_to_kelvin(input, input_offset = 0) {
     const g = input[input_offset + 1];
     const b = input[input_offset + 2];
 
+    const blue_red_ratio = b / r;
+
     // use solver to reverse function, slow but hey - it works
-    var temperature;
-    var epsilon=0.4;
-    var minTemperature = 1000;
-    var maxTemperature = 40000;
+    let temperature;
+
+    const epsilon = 0.4;
+
+    let minTemperature = 1000;
+    let maxTemperature = 40000;
 
     while (maxTemperature - minTemperature > epsilon) {
-        temperature = (maxTemperature + minTemperature) / 2;
-         kelvin_to_rgb(scratch_rgb,0,temperature);
-        if ((scratch_rgb[2] / scratch_rgb[0]) >= (b / r)) {
+
+        temperature = (maxTemperature + minTemperature) * 0.5;
+
+        kelvin_to_rgb(scratch_rgb, 0, temperature);
+
+        const br = scratch_rgb[2] / scratch_rgb[0];
+
+        if (br >= blue_red_ratio) {
             maxTemperature = temperature;
         } else {
             minTemperature = temperature;

package/src/core/geom/3d/tetrahedra/tetrahedral_mesh_find_tets_attached_to_vertex.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tetrahedral_mesh_find_tets_attached_to_vertex.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/3d/tetrahedra/tetrahedral_mesh_find_tets_attached_to_vertex.js"],"names":[],"mappings":"AAEA;;;;;;;GAOG;AACH,sEANW,MAAM,EAAE,iBACR,MAAM,uCAEN,MAAM,GACJ,MAAM,CAyBlB"}