@woosh/meep-engine 2.120.5 → 2.121.1

package/README.md

@@ -15,7 +15,7 @@ To help get you started, various samples are provided under `/samples` folder. F
 
 Meep is covered by 2,508 unit tests
 
-The aim is not to have 100% coverage, [but to ensure quality](https://about.codecov.io/blog/the-case-against-100-code-coverage/). As a result, the tests are written to cover complex code first and to exhaustively validate critical algorithms.
+The aim is to [ensure quality](https://about.codecov.io/blog/the-case-against-100-code-coverage/). As a result, the tests are written to cover complex code first and to exhaustively validate critical algorithms.
 Most of the test code is significantly larger than the code that is being tested.
 
 ## Features

package/editor/view/node-graph/NodeGraphEditorView.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"NodeGraphEditorView.d.ts","sourceRoot":"","sources":["NodeGraphEditorView.js"],"names":[],"mappings":"AAUA;IACI;;;;;;;OAOG;IACH,yEA+EC;IA5EG;;;OAGG;IACH,QAFU,eAAe,CAEL;IACpB;;;OAGG;IACH,4BAAoB;IAEpB;;;OAGG;IACH,iBAAkB;IAElB,mBAAuC;IA6D3C,eAEC;IAED,yBAgEC;CACJ;iBAxKgB,2BAA2B;gCACG,oBAAoB"}
+{"version":3,"file":"NodeGraphEditorView.d.ts","sourceRoot":"","sources":["NodeGraphEditorView.js"],"names":[],"mappings":"AAUA;IACI;;;;;;;OAOG;IACH,8DANW,SAAS,EAqFnB;IA5EG;;;OAGG;IACH,QAFU,eAAe,CAEL;IACpB;;;OAGG;IACH,QAFU,mBAAmB,CAET;IAEpB;;;OAGG;IACH,OAFU,SAAS,CAED;IAElB,mBAAuC;IA6D3C,eAEC;IAED,yBAgEC;CACJ;iBAxKgB,2BAA2B;gCACG,oBAAoB"}

package/editor/view/node-graph/NodeGraphView.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"NodeGraphView.d.ts","sourceRoot":"","sources":["NodeGraphView.js"],"names":[],"mappings":"AAeA;IAEQ,kBAA6B;IAC7B;;;OAGG;IACH,OAFU,OAAO,CAEU;CAElC;AAOD;IACI;;;;;;OAMG;IACH,sEAiOC;IA9NG;;;OAGG;IACH,QAFU,eAAe,CAEL;IAEpB;;;OAGG;IACH,iBAAkB;IAElB;;;OAGG;IACH,4BAAoB;IAEpB;;;OAGG;IACH,WAFU,KAAK,MAAM,CAAC,CAEK;IAE3B,mBAAuC;IAwM3C,qCA8DC;IAGD;;;;;;;OAOG;IACH,wDAFa,OAAO,CAcnB;IAED;;;;;;OAMG;IACH,oBALW,wBAAwB,UACxB,OAAO,UACP,OAAO,kCA0CjB;IAED;;;;OAIG;IACH,mCAHW,yBAAyB,UACzB,OAAO,QAiBjB;IAED;;;;OAIG;IACH,kCAHW,OAAO,UACP,OAAO,QAUjB;IAED;;;;OAIG;IACH,kCAHW,OAAO,UACP,OAAO,QAUjB;CACJ;oBA9bmB,mCAAmC;oBACnC,mCAAmC;iBAHtC,2BAA2B;iBAM3B,2CAA2C;0CAGlB,sEAAsE"}
+{"version":3,"file":"NodeGraphView.d.ts","sourceRoot":"","sources":["NodeGraphView.js"],"names":[],"mappings":"AAeA;IAEQ,kBAA6B;IAC7B;;;OAGG;IACH,OAFU,OAAO,CAEU;CAElC;AAOD;IACI;;;;;;OAMG;IACH,2DALW,SAAS,EAsOnB;IA9NG;;;OAGG;IACH,QAFU,eAAe,CAEL;IAEpB;;;OAGG;IACH,OAFU,SAAS,CAED;IAElB;;;OAGG;IACH,QAFU,mBAAmB,CAET;IAEpB;;;OAGG;IACH,WAFU,IAAI,CAAC,MAAM,CAAC,CAEK;IAE3B,mBAAuC;IAwM3C,qCA8DC;IAGD;;;;;;;OAOG;IACH,wDAFa,OAAO,CAcnB;IAED;;;;;;OAMG;IACH,oBALW,wBAAwB,UACxB,OAAO,UACP,OAAO,YACP,cAAc,QAyCxB;IAED;;;;OAIG;IACH,mCAHW,yBAAyB,UACzB,OAAO,QAiBjB;IAED;;;;OAIG;IACH,kCAHW,OAAO,UACP,OAAO,QAUjB;IAED;;;;OAIG;IACH,kCAHW,OAAO,UACP,OAAO,QAUjB;CACJ;oBA9bmB,mCAAmC;oBACnC,mCAAmC;iBAHtC,2BAA2B;iBAM3B,2CAA2C;0CAGlB,sEAAsE"}

package/editor/view/node-graph/NodeView.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"NodeView.d.ts","sourceRoot":"","sources":["NodeView.js"],"names":[],"mappings":"AAWA;IACI;;;;;;;OAOG;IACH,0FA4GC;IAzGG;;;OAGG;IACH,mBAAgB;IAChB;;;OAGG;IACH,uBAAoB;IAEpB,mBAAuC;IAgG3C,eAGC;CACJ;iBA/HgB,2BAA2B"}
+{"version":3,"file":"NodeView.d.ts","sourceRoot":"","sources":["NodeView.js"],"names":[],"mappings":"AAWA;IACI;;;;;;;OAOG;IACH,4EANW,YAAY,EAkHtB;IAzGG;;;OAGG;IACH,MAFU,YAAY,CAEN;IAChB;;;OAGG;IACH,QAFU,cAAc,CAEJ;IAEpB,mBAAuC;IAgG3C,eAGC;CACJ;iBA/HgB,2BAA2B"}

package/editor/view/node-graph/PortView.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"PortView.d.ts","sourceRoot":"","sources":["PortView.js"],"names":[],"mappings":"AAUA;IACI;;;;;OAKG;IACH,gDA8CC;IA3CG;;;OAGG;IACH,WAAgB;IAChB;;;OAGG;IACH,uBAAoB;IAEpB,mBAAuC;IAkC3C,eAEC;CACJ;iBApEgB,2BAA2B"}
+{"version":3,"file":"PortView.d.ts","sourceRoot":"","sources":["PortView.js"],"names":[],"mappings":"AAUA;IACI;;;;;OAKG;IACH,0CAJW,IAAI,EAkDd;IA3CG;;;OAGG;IACH,MAFU,IAAI,CAEE;IAChB;;;OAGG;IACH,QAFU,cAAc,CAEJ;IAEpB,mBAAuC;IAkC3C,eAEC;CACJ;iBApEgB,2BAA2B"}

package/package.json

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

package/src/core/codegen/LineBuilder.d.ts

@@ -37,7 +37,7 @@ declare class LineBuilder {
      */
     indent(): LineBuilder;
     /**
-     *
+     * NOTE: clamps indentation to 0 (can't go negative)
      * @returns {LineBuilder}
      */
     dedent(): LineBuilder;
@@ -54,7 +54,7 @@ declare class LineBuilder {
     addLines(lines: LineBuilder): void;
     clear(): void;
     /**
-     *
+     * Renders out an indented string of lines
      * @returns {string}
      */
     build(): string;

package/src/core/codegen/LineBuilder.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"LineBuilder.d.ts","sourceRoot":"","sources":["../../../../src/core/codegen/LineBuilder.js"],"names":[],"mappings":";AA+BA;;GAEG;AACH;IAmJI;;;;OAIG;IACH,sBAJW,MAAM,mBACN,MAAM,GACJ,WAAW,CAuBvB;IA/JD;;;;OAIG;IACH,mBAFY,MAAM,CAIjB;IAED;;;OAGG;IACH,cAFU,MAAM,CAEqB;IAErC;;;OAGG;IACH,aAFY,MAAM,CAIjB;IAED;;;;OAIG;IACH,wBAFW,MAAM,GADL,OAAO,CAoBlB;IAED;;;OAGG;IACH,UAFa,WAAW,CAKvB;IAED;;;OAGG;IACH,UAFa,WAAW,CAOvB;IAED;;;;OAIG;IACH,eAHW,MAAM,GACJ,WAAW,CASvB;IAED;;;OAGG;IACH,gBAFW,WAAW,QAiBrB;IAED,cAGC;IAED;;;OAGG;IACH,SAFa,MAAM,CAsBlB;IA8BD,mBAEC;;CACJ"}
+{"version":3,"file":"LineBuilder.d.ts","sourceRoot":"","sources":["../../../../src/core/codegen/LineBuilder.js"],"names":[],"mappings":";AAgCA;;GAEG;AACH;IAuJI;;;;OAIG;IACH,sBAJW,MAAM,mBACN,MAAM,GACJ,WAAW,CAuBvB;IAnKD;;;;OAIG;IACH,mBAFY,MAAM,CAIjB;IAED;;;OAGG;IACH,cAFU,MAAM,CAEqB;IAErC;;;OAGG;IACH,aAFY,MAAM,CAIjB;IAED;;;;OAIG;IACH,wBAFW,MAAM,GADL,OAAO,CAoBlB;IAED;;;OAGG;IACH,UAFa,WAAW,CAKvB;IAED;;;OAGG;IACH,UAFa,WAAW,CAQvB;IAED;;;;OAIG;IACH,eAHW,MAAM,GACJ,WAAW,CASvB;IAED;;;OAGG;IACH,gBAFW,WAAW,QAiBrB;IAED,cAGC;IAED;;;OAGG;IACH,SAFa,MAAM,CAyBlB;IA8BD,mBAEC;;CACJ"}

package/src/core/codegen/LineBuilder.js

@@ -1,4 +1,5 @@
 import { assert } from "../assert.js";
+import { string_repeat } from "../primitives/strings/string_repeat.js";
 
 class Line {
     /**
@@ -103,13 +104,14 @@ class LineBuilder {
     }
 
     /**
-     *
+     * NOTE: clamps indentation to 0 (can't go negative)
      * @returns {LineBuilder}
      */
     dedent() {
-        assert.greaterThan(this.#indentation, 0, 'indentation is already at 0');
 
-        this.#indentation--;
+        // clamp to 0
+        this.#indentation = Math.max(0, this.#indentation - 1);
+
         return this;
     }
 
@@ -154,23 +156,26 @@ class LineBuilder {
     }
 
     /**
-     *
+     * Renders out an indented string of lines
      * @returns {string}
      */
     build() {
         const result = [];
 
-        let i, j, l;
-
         const lines = this.#lines;
+        const line_count = lines.length;
+
+        const indent_string = string_repeat(' ', this.indentSpaces);
 
-        for (i = 0, l = lines.length; i < l; i++) {
+        for (let i = 0; i < line_count; i++) {
             const line = lines[i];
 
             let indentString = '';
 
-            for (j = 0; j < line.indentation * this.indentSpaces; j++) {
-                indentString += ' ';
+            const indent_count = line.indentation;
+
+            for (let j = 0; j < indent_count; j++) {
+                indentString += indent_string;
             }
 
             result.push(indentString + line.text);

package/src/core/collection/array/array_set_diff_sorting.d.ts

@@ -3,7 +3,7 @@
  * @template T
  * @param {T[]} a
  * @param {T[]} b
- * @param {function(a:T,b:T):number} [compare]
+ * @param {function(a:T,b:T):number} compare
  * @returns {{uniqueA:T[], uniqueB:T[], common:T[]}}
  */
 export function array_set_diff_sorting<T>(a: T[], b: T[], compare: any): {

package/src/core/collection/array/array_set_diff_sorting.js

@@ -7,7 +7,7 @@ import { assert } from "../../assert.js";
  * @template T
  * @param {T[]} a
  * @param {T[]} b
- * @param {function(a:T,b:T):number} [compare]
+ * @param {function(a:T,b:T):number} compare
  * @returns {{uniqueA:T[], uniqueB:T[], common:T[]}}
  */
 export function array_set_diff_sorting(a, b, compare) {

package/src/core/collection/map/HashMap.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"HashMap.d.ts","sourceRoot":"","sources":["../../../../../src/core/collection/map/HashMap.js"],"names":[],"mappings":"AAgBA;;;;;;;;;;;;GAYG;AACH,uFAIC;AAgGD;;;;;;;GAOG;AACH,qBAHa,CAAC,EAAC,CAAC;IAkEZ;;;;;;OAMG;IACH,6EALW,CAAS,IAAC,EAAD,GAAC,KAAE,MAAM,EAsC5B;IAtGD;;;;OAIG;IACH,QAFU,WAAW,CAED;IAEpB;;;OAGG;IACH,WAFU,KAAK,CAAC,YAAY,CAAC,CAAC,EAAC,CAAC,CAAC,CAAC,CAET;IAEzB;;;OAGG;IACH,iBAFU,MAAM,CAEI;IAEpB;;;OAGG;IACH,iBAFU,MAAM,CAEI;IAEpB;;;OAGG;IACH,QAFU,MAAM,CAEL;IAEX,oBAAgB;IAEhB;;;OAGG;IACH,2BAFU,MAAM,CAEc;IAE9B,iCAA6B;IAE7B,qCAAiC;IAEjC;;;OAGG;IACH,kBAFU,MAAM,CAEK;IAErB;;;;OAIG;IACH,sBAAoC;IAEpC;;;OAGG;IACH,WAFU,MAAM,CAEF;IAwBV;;;;;OAKG;IACH,iCAAsC;IACtC;;;;;OAKG;IACH,qCAA8C;IAOlD,mBAEC;IAED;;;OAGG;IACH,kBAFa,MAAM,CAIlB;IA2CD;;;;;OAKG;IACH,0BAUC;IAuGD;;;;OAIG;IACH,SAHW,CAAC,SACD,CAAC,QA0EX;IAED;;;;OAIG;IACH,SAHW,CAAC,GACC,CAAC,GAAC,SAAS,CA+BvB;IAED;;;;;;;;OAQG;IACH,kBALW,CAAC,WACD,CAAS,IAAC,EAAD,CAAC,KAAE,CAAC,oBACb,GAAC,GACA,CAAC,CAgBZ;IAED;;;;;OAKG;IACH,cAJW,CAAC,SACD,CAAC,GACA,CAAC,CAaZ;IAwBD;;;;OAIG;IACH,YAHW,CAAC,GACC,OAAO,CA+CnB;IAED;;;;;OAKG;IACH,sCAHW,GAAC,GACC,OAAO,CA+BnB;IAOD;;OAEG;IACH,gBA0DC;IAmBD,2CA0BC;IAED;;;;OAIG;IACH,SAHW,CAAC,GACC,OAAO,CAInB;IAED;;OAEG;IACH,cA6BC;IA+BD;;;OAGG;IACH,WAFa,QAAQ,CAAC,CAAC,CAAC,EAAC,CAAC,CAAC,CAAC,CAM3B;IAED;;;OAGG;IACH,UAFa,QAAQ,CAAC,CAAC,CAAC,CAOvB;IAED;;;OAGG;IACH,QAFa,QAAQ,CAAC,CAAC,CAAC,CAMvB;IA1DD,yDA2BC;;CAgCJ;AA/1BD;;GAEG;AACH,2BAFa,CAAC,EAAC,CAAC;IAGZ;;;;;OAKG;IACH,iBAJW,CAAC,SACD,CAAC,QACD,MAAM,EAsBhB;IAlBG;;;OAGG;IACH,KAFU,CAAC,CAEG;IAEd;;;OAGG;IACH,OAFU,CAAC,CAEO;IAElB;;;OAGG;IACH,MAFU,MAAM,CAEA;IAKxB,wBAAqC;CAFpC"}
+{"version":3,"file":"HashMap.d.ts","sourceRoot":"","sources":["../../../../../src/core/collection/map/HashMap.js"],"names":[],"mappings":"AAgBA;;;;;;;;;;;;GAYG;AACH,uFAIC;AAgGD;;;;;;;GAOG;AACH,qBAHa,CAAC,EAAC,CAAC;IAyFZ;;;;;;OAMG;IACH,6EALW,CAAS,IAAC,EAAD,GAAC,KAAE,MAAM,EAsC5B;IA7HD;;;;;OAKG;IACH,eAAoB;IAEpB;;;;OAIG;IACH,kBAAyB;IAEzB;;;;OAIG;IACH,wBAAoB;IAEpB;;;;OAIG;IACH,wBAAoB;IAEpB;;;;OAIG;IACH,eAAW;IAEX;;;;OAIG;IACH,oBAAgB;IAEhB;;;;OAIG;IACH,kCAA8B;IAE9B;;;;OAIG;IACH,iCAA6B;IAE7B;;;;OAIG;IACH,qCAAiC;IAEjC;;;;OAIG;IACH,yBAAqB;IAErB;;;;OAIG;IACH,sBAAoC;IAEpC;;;;OAIG;IACH,kBAAc;IAwBV;;;;;OAKG;IACH,iCAAsC;IACtC;;;;;OAKG;IACH,qCAA8C;IAOlD;;;OAGG;IACH,YAFY,MAAM,CAIjB;IAED;;;OAGG;IACH,kBAFa,MAAM,CAIlB;IA2CD;;;;;OAKG;IACH,0BAUC;IAuGD;;;;OAIG;IACH,SAHW,CAAC,SACD,CAAC,QA0EX;IAED;;;;OAIG;IACH,SAHW,CAAC,GACC,CAAC,GAAC,SAAS,CA+BvB;IAED;;;;;;;;OAQG;IACH,kBALW,CAAC,WACD,CAAS,IAAC,EAAD,CAAC,KAAE,CAAC,oBACb,GAAC,GACA,CAAC,CAgBZ;IAED;;;;;OAKG;IACH,cAJW,CAAC,SACD,CAAC,GACA,CAAC,CAaZ;IAwBD;;;;OAIG;IACH,YAHW,CAAC,GACC,OAAO,CA+CnB;IAED;;;;;OAKG;IACH,sCAHW,GAAC,GACC,OAAO,CA+BnB;IAOD;;OAEG;IACH,gBA0DC;IAmBD,2CA0BC;IAED;;;;OAIG;IACH,SAHW,CAAC,GACC,OAAO,CAInB;IAED;;OAEG;IACH,cA6BC;IA+BD;;;OAGG;IACH,WAFa,QAAQ,CAAC,CAAC,CAAC,EAAC,CAAC,CAAC,CAAC,CAM3B;IAED;;;OAGG;IACH,UAFa,QAAQ,CAAC,CAAC,CAAC,CAOvB;IAED;;;OAGG;IACH,QAFa,QAAQ,CAAC,CAAC,CAAC,CAMvB;IA1DD,yDA2BC;;CAgCJ"}

package/src/core/collection/map/HashMap.js

@@ -140,48 +140,70 @@ export class HashMap {
      * Index pointers to entries array,
      * number of bins is always power or two
      * @type {Uint32Array}
+     * @private
      */
     __bins = EMPTY_BINS;
 
     /**
      * Note that dead entries are marked as such with a special reserved hash values, so records can be reused for new entries
      * @type {Array<HashMapEntry<K,V>>}
+     * @private
      */
     __entries = new Array(0);
 
     /**
      * Pointer to the end of allocated entries segment
      * @type {number}
+     * @private
      */
     __entries_bound = 0;
 
     /**
      *
      * @type {number}
+     * @private
      */
     __entries_start = 0;
 
     /**
      * number of records in the map
      * @type {number}
+     * @private
      */
     __size = 0;
 
+    /**
+     *
+     * @type {number}
+     * @private
+     */
     __bin_count = 0;
 
     /**
      * Always exactly half of the number of bins
      * @type {number}
+     * @private
      */
     __entries_allocated_count = 0;
 
+    /**
+     *
+     * @type {number}
+     * @private
+     */
     __bin_count_power_of_two = 0;
 
+    /**
+     *
+     * @type {number}
+     * @private
+     */
     __entries_count_power_of_two = 0;
 
     /**
      * Mask used to map from hash to a bin index
      * @type {number}
+     * @private
      */
     __bin_count_mask = 0;
 
@@ -194,14 +216,15 @@ export class HashMap {
 
     /**
      * Used to track modifications to prevent concurrent changes during iteration
+     * @private
      * @type {number}
      */
     __version = 0;
 
     /**
      * @template K, V
-     * @param {function(K):number} [keyHashFunction]
-     * @param {function(K,K):boolean} [keyEqualityFunction]
+     * @param {function(K):number} [keyHashFunction] function to compute hash of a given key
+     * @param {function(K,K):boolean} [keyEqualityFunction] function to compute equality between two keys
      * @param {number} [capacity] initial number of buckets in the hash table
      * @param {number} [loadFactor] a measure of how full the hash table is allowed to get before its capacity is automatically increased
      */
@@ -240,6 +263,10 @@ export class HashMap {
         this.#setBinCount(ceilPowerOfTwo(capacity));
     }
 
+    /**
+     *
+     * @return {number}
+     */
     get size() {
         return this.__size;
     }

package/src/core/color/oklab/find_cusp.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"find_cusp.d.ts","sourceRoot":"","sources":["../../../../../src/core/color/oklab/find_cusp.js"],"names":[],"mappings":"AAOA;;;;;;;GAOG;AACH,kCAJW,MAAM,EAAE,KACR,MAAM,KACN,MAAM,QAahB"}
+{"version":3,"file":"find_cusp.d.ts","sourceRoot":"","sources":["../../../../../src/core/color/oklab/find_cusp.js"],"names":[],"mappings":"AAOA;;;;;;;GAOG;AACH,kCAJW,MAAM,EAAE,KACR,MAAM,KACN,MAAM,QAgBhB"}

package/src/core/color/oklab/find_cusp.js

@@ -19,7 +19,10 @@ export function find_cusp(output, a, b) {
 
     // Convert to linear sRGB to find the first point where at least one of r,g or b >= 1:
     oklab_to_linear_srgb(rgb_at_max, 1, S_cusp * a, S_cusp * b);
-    const L_cusp = Math.cbrt(1. / max3(rgb_at_max[0], rgb_at_max[1], rgb_at_max[2]));
+
+    const max_component = max3(rgb_at_max[0], rgb_at_max[1], rgb_at_max[2]);
+
+    const L_cusp = Math.cbrt(1. / max_component);
     const C_cusp = L_cusp * S_cusp;
 
     output[0] = L_cusp;

package/src/core/color/oklab/oklab_to_linear_srgb.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"oklab_to_linear_srgb.d.ts","sourceRoot":"","sources":["../../../../../src/core/color/oklab/oklab_to_linear_srgb.js"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,6CALW,MAAM,EAAE,KACR,MAAM,KACN,MAAM,KACN,MAAM,QAchB"}
+{"version":3,"file":"oklab_to_linear_srgb.d.ts","sourceRoot":"","sources":["../../../../../src/core/color/oklab/oklab_to_linear_srgb.js"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,6CALW,MAAM,EAAE,KACR,MAAM,KACN,MAAM,KACN,MAAM,QAehB"}

package/src/core/color/oklab/oklab_to_linear_srgb.js

@@ -11,6 +11,7 @@ export function oklab_to_linear_srgb(output, L, a, b) {
     const m_ = L - 0.1055613458 * a - 0.0638541728 * b;
     const s_ = L - 0.0894841775 * a - 1.2914855480 * b;
 
+    // cube
     const l = l_ * l_ * l_;
     const m = m_ * m_ * m_;
     const s = s_ * s_ * s_;

package/src/core/color/operations/color_lighten.d.ts

@@ -1,7 +1,7 @@
 /**
  *
  * @param {Color} input
- * @param {number} amount
+ * @param {number} [amount]
  * @returns {Color}
  */
 export function color_lighten(input: Color, amount?: number): Color;

package/src/core/color/operations/color_lighten.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"color_lighten.d.ts","sourceRoot":"","sources":["../../../../../src/core/color/operations/color_lighten.js"],"names":[],"mappings":"AAQA;;;;;GAKG;AACH,qCAJW,KAAK,WACL,MAAM,GACJ,KAAK,CAejB;sBAzBqB,aAAa"}
+{"version":3,"file":"color_lighten.d.ts","sourceRoot":"","sources":["../../../../../src/core/color/operations/color_lighten.js"],"names":[],"mappings":"AAQA;;;;;GAKG;AACH,qCAJW,KAAK,WACL,MAAM,GACJ,KAAK,CAoBjB;sBA9BqB,aAAa"}

package/src/core/color/operations/color_lighten.js

@@ -9,13 +9,18 @@ const hsv = [0, 0, 0];
 /**
  *
  * @param {Color} input
- * @param {number} amount
+ * @param {number} [amount]
  * @returns {Color}
  */
 export function color_lighten(input, amount = 1) {
     assert.isNumber(amount, 'amount');
     assert.greaterThanOrEqual(amount, 0, 'amount');
 
+    if (amount === 0) {
+        // skip allocation, no change
+        return input;
+    }
+
     const r = new Color();
 
     linear_srgb_to_okhsv(hsv, input.r, input.g, input.b);

package/src/core/geom/2d/aabb/aabb2_intersects_point.d.ts

@@ -0,0 +1,12 @@
+/**
+ *
+ * @param {number} x0
+ * @param {number} y0
+ * @param {number} x1
+ * @param {number} y1
+ * @param {number} px
+ * @param {number} py
+ * @return {boolean}
+ */
+export function aabb2_intersects_point(x0: number, y0: number, x1: number, y1: number, px: number, py: number): boolean;
+//# sourceMappingURL=aabb2_intersects_point.d.ts.map

package/src/core/geom/2d/aabb/aabb2_intersects_point.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"aabb2_intersects_point.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/2d/aabb/aabb2_intersects_point.js"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AACH,2CARW,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,GACL,OAAO,CAQlB"}

package/src/core/geom/2d/aabb/aabb2_intersects_point.js

@@ -0,0 +1,17 @@
+/**
+ *
+ * @param {number} x0
+ * @param {number} y0
+ * @param {number} x1
+ * @param {number} y1
+ * @param {number} px
+ * @param {number} py
+ * @return {boolean}
+ */
+export function aabb2_intersects_point(
+    x0, y0,
+    x1, y1,
+    px, py
+) {
+    return x0 <= px && x1 >= px && y0 <= py && y1 >= py;
+}

package/src/core/geom/2d/quad-tree/QuadTreeNode.d.ts

@@ -3,7 +3,8 @@
  * @extends AABB2
  */
 export class QuadTreeNode<D> extends AABB2 {
-    constructor(x0?: number, y0?: number, x1?: number, y1?: number);
+    constructor(x0: number, y0: number, x1: number, y1: number);
+    constructor();
     /**
      *
      * @type {QuadTreeNode|null}
@@ -29,6 +30,10 @@ export class QuadTreeNode<D> extends AABB2 {
      * @type {QuadTreeNode|null}
      */
     parentNode: QuadTreeNode<any> | null;
+    /**
+     *
+     * @type {number}
+     */
     treeDataCount: number;
     /**
      *
@@ -98,12 +103,12 @@ export class QuadTreeNode<D> extends AABB2 {
     traverseData(visitor: (arg0: QuadTreeDatum<D>) => any, thisArg?: any): void;
     /**
      *
-     * @param {function(QuadTreeNode):boolean} visitor
+     * @param {function(QuadTreeNode<D>):boolean} visitor
      * @param {*} [thisArg]
      */
-    traversePreOrder(visitor: (arg0: QuadTreeNode<any>) => boolean, thisArg?: any): void;
+    traversePreOrder(visitor: (arg0: QuadTreeNode<D>) => boolean, thisArg?: any): void;
     /**
-     *
+     * @deprecated use {@link qt_collect_by_point}
      * @param {number} x
      * @param {number} y
      * @param {function(QuadTreeDatum<D>, x:number,y:number):boolean?} visitor
@@ -111,7 +116,7 @@ export class QuadTreeNode<D> extends AABB2 {
      */
     traversePointIntersections(x: number, y: number, visitor: any, thisArg?: any): void;
     /**
-     *
+     * @deprecated use {@link qt_collect_by_point} directly
      * @param {Array<QuadTreeDatum<D>>} result
      * @param {number} x
      * @param {number} y
@@ -119,7 +124,7 @@ export class QuadTreeNode<D> extends AABB2 {
      */
     requestDatumIntersectionsPoint(result: Array<QuadTreeDatum<D>>, x: number, y: number): number;
     /**
-     *
+     * @deprecated use {@link qt_collect_by_box} instead
      * @param {Array<QuadTreeDatum<D>>} result
      * @param {number} x0
      * @param {number} y0
@@ -130,6 +135,7 @@ export class QuadTreeNode<D> extends AABB2 {
     requestDatumIntersectionsRectangle(result: Array<QuadTreeDatum<D>>, x0: number, y0: number, x1: number, y1: number): number;
     /**
      * NOTE: touching is not counted as intersection
+     * @deprecated use {@link qt_collect_by_box} instead
      * @param {number} x0
      * @param {number} y0
      * @param {number} x1
@@ -138,6 +144,11 @@ export class QuadTreeNode<D> extends AABB2 {
      * @param {*} [thisArg]
      */
     traverseRectangleIntersections(x0: number, y0: number, x1: number, y1: number, visitor: (arg0: QuadTreeDatum<D>) => any, thisArg?: any): void;
+    /**
+     * @readonly
+     * @type {boolean}
+     */
+    readonly isQuadTreeNode: boolean;
 }
 import AABB2 from "../../2d/aabb/AABB2.js";
 import { QuadTreeDatum } from "./QuadTreeDatum.js";

package/src/core/geom/2d/quad-tree/QuadTreeNode.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"QuadTreeNode.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/2d/quad-tree/QuadTreeNode.js"],"names":[],"mappings":"AAUA;;;GAGG;AACH,0BAHa,CAAC;IAIV,gEAsCC;IAnCG;;;OAGG;IACH,SAFU,oBAAa,IAAI,CAER;IACnB;;;OAGG;IACH,UAFU,oBAAa,IAAI,CAEP;IACpB;;;OAGG;IACH,YAFU,oBAAa,IAAI,CAEL;IACtB;;;OAGG;IACH,aAFU,oBAAa,IAAI,CAEJ;IAEvB;;;OAGG;IACH,YAFU,oBAAa,IAAI,CAEL;IAEtB,sBAAsB;IAGtB;;;OAGG;IACH,MAFU,aAAa,CAAC,CAAC,CAAC,EAAE,CAEd;IAGlB,qBAeC;IAED,wBAYC;IAED;;;;;;OAMG;IACH,WALW,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,QAkBhB;IAED;;;;;;;;OAQG;IACH,IARa,CAAC,QACH,CAAC,MACD,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,sBAWhB;IAED;;;OAGG;IACH,6CAuEC;IAED;;;OAGG;IACH,iBAaC;IAED;;;OAGG;IACH,WAFY,OAAO,CAIlB;IAED,cA8BC;IAED;;OAEG;IACH,mBAKC;IAED;;;OAGG;IACH,8CAiBC;IAED;;OAEG;IACH,qBA2DC;IAED,cASC;IAED,cAQC;IAED;;OAEG;IACH,mBAFW,CAAC,EAAE,QAUb;IAED;;;;OAIG;IACH,sBAHW,CAAS,IAAgB,EAAhB,aAAa,CAAC,CAAC,CAAC,QAAC,YAC1B,GAAC,QAeX;IAED;;;;OAIG;IACH,0BAHW,CAAS,IAAY,wBAAE,OAAO,YAC9B,GAAC,QAgBX;IAED;;;;;;OAMG;IACH,8BALW,MAAM,KACN,MAAM,0BAEN,GAAC,QA0CX;IAED;;;;;;OAMG;IACH,uCALW,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,KACvB,MAAM,KACN,MAAM,GACJ,MAAM,CAYlB;IAED;;;;;;;;OAQG;IACH,2CAPW,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,MACvB,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,GACJ,MAAM,CAWlB;IAED;;;;;;;;OAQG;IACH,mCAPW,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,WACN,CAAS,IAAgB,EAAhB,aAAa,CAAC,CAAC,CAAC,QAAC,YAC1B,GAAC,QA0CX;CAEJ;kBA9jBiB,wBAAwB;8BACZ,oBAAoB"}
+{"version":3,"file":"QuadTreeNode.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/2d/quad-tree/QuadTreeNode.js"],"names":[],"mappings":"AAYA;;;GAGG;AACH,0BAHa,CAAC;;;IAIV;;;OAGG;IACH,SAFU,oBAAa,IAAI,CAEZ;IACf;;;OAGG;IACH,UAFU,oBAAa,IAAI,CAEX;IAChB;;;OAGG;IACH,YAFU,oBAAa,IAAI,CAET;IAClB;;;OAGG;IACH,aAFU,oBAAa,IAAI,CAER;IAEnB;;;OAGG;IACH,YAFU,oBAAa,IAAI,CAET;IAElB;;;OAGG;IACH,eAFU,MAAM,CAEE;IAGlB;;;OAGG;IACH,MAFU,aAAa,CAAC,CAAC,CAAC,EAAE,CAElB;IAEV,qBAeC;IAED,wBAYC;IAED;;;;;;OAMG;IACH,WALW,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,QAkBhB;IAED;;;;;;;;OAQG;IACH,IARa,CAAC,QACH,CAAC,MACD,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,sBAWhB;IAED;;;OAGG;IACH,6CAuEC;IAED;;;OAGG;IACH,iBAaC;IAED;;;OAGG;IACH,WAFY,OAAO,CAIlB;IAED,cA8BC;IAED;;OAEG;IACH,mBAKC;IAED;;;OAGG;IACH,8CAiBC;IAED;;OAEG;IACH,qBA2DC;IAED,cASC;IAED,cAQC;IAED;;OAEG;IACH,mBAFW,CAAC,EAAE,QAUb;IAED;;;;OAIG;IACH,sBAHW,CAAS,IAAgB,EAAhB,aAAa,CAAC,CAAC,CAAC,QAAC,YAC1B,GAAC,QAeX;IAED;;;;OAIG;IACH,0BAHW,CAAS,IAAe,EAAf,YAAY,CAAC,CAAC,CAAC,KAAE,OAAO,YACjC,GAAC,QAgBX;IAED;;;;;;OAMG;IACH,8BALW,MAAM,KACN,MAAM,0BAEN,GAAC,QASX;IAED;;;;;;OAMG;IACH,uCALW,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,KACvB,MAAM,KACN,MAAM,GACJ,MAAM,CAIlB;IAED;;;;;;;;OAQG;IACH,2CAPW,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,MACvB,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,GACJ,MAAM,CAIlB;IAED;;;;;;;;;OASG;IACH,mCAPW,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,WACN,CAAS,IAAgB,EAAhB,aAAa,CAAC,CAAC,CAAC,QAAC,YAC1B,GAAC,QA0CX;IAIL;;;OAGG;IACH,yBAFU,OAAO,CAEoB;CANpC;kBAjhBiB,wBAAwB;8BAGZ,oBAAoB"}