@woosh/meep-engine 2.168.1 → 2.169.1

package/src/core/cache/Cache.js

@@ -48,8 +48,8 @@ export class Cache {
      * Note: setting {@link maxWeight} to 0 is pointless, as the cache will not be able to hold even a single element.
      *
      * @param {number} [maxWeight=Number.POSITIVE_INFINITY] capacity of the cache, measure in "weight"; The weight is computed by summing key and value weights.
-     * @param {function(key:Key):number} [keyWeigher= key=>0] function to compute weight of a key
-     * @param {function(value:Value):number} [valueWeigher= value=>1] function to compute weight of a value
+     * @param {(key: Key) => number} [keyWeigher= key=>0] function to compute weight of a key
+     * @param {(value: Value) => number} [valueWeigher= value=>1] function to compute weight of a value
      * @param {function(Key):number} [keyHashFunction]
      * @param {function(Key, Key):boolean} [keyEqualityFunction]
      * @param {number} [capacity] initial capacity for the cache, helps prevent early resizing
@@ -577,7 +577,7 @@ export class Cache {
 
     /**
      *
-     * @param {function(message:string, key:Key, value:Value)} callback
+     * @param {(message: string, key: Key, value: Value) => void} callback
      * @param {*} [thisArg]
      * @returns {boolean}
      */

package/src/core/cache/LoadingCache.d.ts

@@ -18,7 +18,7 @@ export class LoadingCache<K, V> {
      * @param [keyEqualityFunction]
      * @param [capacity]
      * @param {number} [timeToLive] in seconds, default is 10 seconds
-     * @param {function(key:K):Promise<V>} load
+     * @param {(key: K) => Promise<V>} load
      * @param {boolean} [retryFailed]
      */
     constructor({ maxWeight, keyWeigher, valueWeigher, keyHashFunction, keyEqualityFunction, capacity, timeToLive, load, retryFailed }?: {

package/src/core/cache/LoadingCache.js

@@ -61,7 +61,7 @@ export class LoadingCache {
     #timeToLive = DEFAULT_TIME_TO_LIVE;
 
     /**
-     * @type {function(key:K):Promise<V>}
+     * @type {(key: K) => Promise<V>}
      */
     #load
 
@@ -85,7 +85,7 @@ export class LoadingCache {
      * @param [keyEqualityFunction]
      * @param [capacity]
      * @param {number} [timeToLive] in seconds, default is 10 seconds
-     * @param {function(key:K):Promise<V>} load
+     * @param {(key: K) => Promise<V>} load
      * @param {boolean} [retryFailed]
      */
     constructor({

package/src/core/cache/wtinylfu/CacheWTinylfu.d.ts

@@ -5,8 +5,8 @@ export class CacheWTinylfu {
      * @param {number} [promotionThreshold=1] frequency an item must exceed to be promoted out of Trial (Probation)
      * @param {number} [capacityWindow=1] weight cap of the Window region (burst buffer)
      * @param {number} [capacityProtected=1] weight cap of the Protected region (VIP segment of Main)
-     * @param {function(key:Key):number} [keyWeigher= key=>0] function to compute weight of a key
-     * @param {function(value:Value):number} [valueWeigher= value=>1] function to compute weight of a value
+     * @param {(key: Key) => number} [keyWeigher= key=>0] function to compute weight of a key
+     * @param {(value: Value) => number} [valueWeigher= value=>1] function to compute weight of a value
      * @param {function(Key):number} [keyHashFunction]
      * @param {function(Key, Key):boolean} [keyEqualityFunction]
      */

package/src/core/cache/wtinylfu/CacheWTinylfu.js

@@ -143,8 +143,8 @@ export class CacheWTinylfu {
      * @param {number} [promotionThreshold=1] frequency an item must exceed to be promoted out of Trial (Probation)
      * @param {number} [capacityWindow=1] weight cap of the Window region (burst buffer)
      * @param {number} [capacityProtected=1] weight cap of the Protected region (VIP segment of Main)
-     * @param {function(key:Key):number} [keyWeigher= key=>0] function to compute weight of a key
-     * @param {function(value:Value):number} [valueWeigher= value=>1] function to compute weight of a value
+     * @param {(key: Key) => number} [keyWeigher= key=>0] function to compute weight of a key
+     * @param {(value: Value) => number} [valueWeigher= value=>1] function to compute weight of a value
      * @param {function(Key):number} [keyHashFunction]
      * @param {function(Key, Key):boolean} [keyEqualityFunction]
      */

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

@@ -3,8 +3,8 @@
  * @template T
  * @param {T[]} array
  * @param {T} element
- * @param {function(a:T,b:T):boolean} equals
+ * @param {(a: T, b: T) => boolean} equals
  * @returns {number} index of first match or -1 if no matches found
  */
-export function array_index_by_equality<T>(array: T[], element: T, equals: any): number;
+export function array_index_by_equality<T>(array: T[], element: T, equals: (a: T, b: T) => boolean): number;
 //# sourceMappingURL=array_index_by_equality.d.ts.map

package/src/core/collection/array/array_index_by_equality.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"array_index_by_equality.d.ts","sourceRoot":"","sources":["../../../../../src/core/collection/array/array_index_by_equality.js"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,iFAFa,MAAM,CAclB"}
+{"version":3,"file":"array_index_by_equality.d.ts","sourceRoot":"","sources":["../../../../../src/core/collection/array/array_index_by_equality.js"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,2FAH2B,OAAO,GACrB,MAAM,CAclB"}

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

@@ -3,7 +3,7 @@
  * @template T
  * @param {T[]} array
  * @param {T} element
- * @param {function(a:T,b:T):boolean} equals
+ * @param {(a: T, b: T) => boolean} equals
  * @returns {number} index of first match or -1 if no matches found
  */
 export function array_index_by_equality(array, element, equals) {

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

@@ -3,8 +3,8 @@
  * If multiple elements with the same highest score exist, the result will be first such encountered element
  * @template T
  * @param {T[]} array
- * @param {function(el:T, index:number):number} scoreFunction
+ * @param {(el: T, index: number) => number} scoreFunction
  * @returns {T|undefined}
  */
-export function array_pick_best_element<T>(array: T[], scoreFunction: any): T;
+export function array_pick_best_element<T>(array: T[], scoreFunction: (el: T, index: number) => number): T;
 //# sourceMappingURL=array_pick_best_element.d.ts.map

package/src/core/collection/array/array_pick_best_element.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"array_pick_best_element.d.ts","sourceRoot":"","sources":["../../../../../src/core/collection/array/array_pick_best_element.js"],"names":[],"mappings":"AAEA;;;;;;;GAOG;AACH,8EAkCC"}
+{"version":3,"file":"array_pick_best_element.d.ts","sourceRoot":"","sources":["../../../../../src/core/collection/array/array_pick_best_element.js"],"names":[],"mappings":"AAEA;;;;;;;GAOG;AACH,qFAH0B,MAAM,KAAK,MAAM,KAqC1C"}

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

@@ -5,7 +5,7 @@ import { assert } from "../../assert.js";
  * If multiple elements with the same highest score exist, the result will be first such encountered element
  * @template T
  * @param {T[]} array
- * @param {function(el:T, index:number):number} scoreFunction
+ * @param {(el: T, index: number) => number} scoreFunction
  * @returns {T|undefined}
  */
 export function array_pick_best_element(array, scoreFunction) {

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

@@ -1,8 +1,8 @@
 /**
  * @template T
  * @param {T[]} array
- * @param {function(el:T, index:number):number} scoreFunction
+ * @param {(el: T, index: number) => number} scoreFunction
  * @returns {T[]}
  */
-export function array_pick_best_elements<T>(array: T[], scoreFunction: any): T[];
+export function array_pick_best_elements<T>(array: T[], scoreFunction: (el: T, index: number) => number): T[];
 //# sourceMappingURL=array_pick_best_elements.d.ts.map

package/src/core/collection/array/array_pick_best_elements.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"array_pick_best_elements.d.ts","sourceRoot":"","sources":["../../../../../src/core/collection/array/array_pick_best_elements.js"],"names":[],"mappings":"AAEA;;;;;GAKG;AACH,iFA0CC"}
+{"version":3,"file":"array_pick_best_elements.d.ts","sourceRoot":"","sources":["../../../../../src/core/collection/array/array_pick_best_elements.js"],"names":[],"mappings":"AAEA;;;;;GAKG;AACH,sFAH0B,MAAM,KAAK,MAAM,OA6C1C"}

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

@@ -3,7 +3,7 @@ import { assert } from "../../assert.js";
 /**
  * @template T
  * @param {T[]} array
- * @param {function(el:T, index:number):number} scoreFunction
+ * @param {(el: T, index: number) => number} scoreFunction
  * @returns {T[]}
  */
 export function array_pick_best_elements(array, scoreFunction) {

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

@@ -4,13 +4,12 @@
  * @template T
  * @param {T[]} a
  * @param {T[]} b
- * @param {function(a:T,b:T):boolean} [equals] method to determine equality between two elements
+ * @param {(a: T, b: T) => boolean} [equals] method to determine equality between two elements
  * @returns {{uniqueA:T[], uniqueB:T[], common:T[]}}
  */
-export function array_set_diff<T>(a: T[], b: T[], equals?: typeof strictEquals): {
+export function array_set_diff<T>(a: T[], b: T[], equals?: (a: T, b: T) => boolean): {
     uniqueA: T[];
     uniqueB: T[];
     common: T[];
 };
-import { strictEquals } from "../../function/strictEquals.js";
 //# sourceMappingURL=array_set_diff.d.ts.map

package/src/core/collection/array/array_set_diff.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"array_set_diff.d.ts","sourceRoot":"","sources":["../../../../../src/core/collection/array/array_set_diff.js"],"names":[],"mappings":"AAKA;;;;;;;;GAQG;AACH;;;;EAoCC;6BAhD4B,gCAAgC"}
+{"version":3,"file":"array_set_diff.d.ts","sourceRoot":"","sources":["../../../../../src/core/collection/array/array_set_diff.js"],"names":[],"mappings":"AAKA;;;;;;;;GAQG;AACH,2EAH2B,OAAO;;;;EAuCjC"}

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

@@ -9,7 +9,7 @@ import { array_index_by_equality } from "./array_index_by_equality.js";
  * @template T
  * @param {T[]} a
  * @param {T[]} b
- * @param {function(a:T,b:T):boolean} [equals] method to determine equality between two elements
+ * @param {(a: T, b: T) => boolean} [equals] method to determine equality between two elements
  * @returns {{uniqueA:T[], uniqueB:T[], common:T[]}}
  */
 export function array_set_diff(a, b, equals = strictEquals) {

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

@@ -3,10 +3,10 @@
  * @template T
  * @param {T[]} a
  * @param {T[]} b
- * @param {function(a:T,b:T):number} compare
+ * @param {(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): {
+export function array_set_diff_sorting<T>(a: T[], b: T[], compare: (a: T, b: T) => number): {
     uniqueA: T[];
     uniqueB: T[];
     common: T[];

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

@@ -1 +1 @@
-{"version":3,"file":"array_set_diff_sorting.d.ts","sourceRoot":"","sources":["../../../../../src/core/collection/array/array_set_diff_sorting.js"],"names":[],"mappings":"AAIA;;;;;;;GAOG;AACH;;;;EAyDC"}
+{"version":3,"file":"array_set_diff_sorting.d.ts","sourceRoot":"","sources":["../../../../../src/core/collection/array/array_set_diff_sorting.js"],"names":[],"mappings":"AAIA;;;;;;;GAOG;AACH,mFAH2B,MAAM;;;;EA4DhC"}

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 {(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/array/iterator/ArrayIteratorRandom.d.ts

@@ -3,7 +3,8 @@ export class ArrayIteratorRandom extends AbstractArrayIterator<any> {
     __i: number;
     __sequence: any[];
     __random: (() => number) | {
-        setCurrentSeed: (arg0: v) => number;
+        setCurrentSeed: (v: number) => void;
+        getCurrentSeed: () => number;
     };
     /**
      *

package/src/core/collection/array/iterator/ArrayIteratorRandom.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"ArrayIteratorRandom.d.ts","sourceRoot":"","sources":["../../../../../../src/core/collection/array/iterator/ArrayIteratorRandom.js"],"names":[],"mappings":"AAIA;IACI,cAOC;IAJG,YAAY;IACZ,kBAAoB;IAEpB;;MAA+B;IAGnC;;;OAGG;IACH,WAFW,MAAM,QAIhB;IAED,4BAYC;IAED,wBAgBC;CACJ;sCAnDqC,4BAA4B"}
+{"version":3,"file":"ArrayIteratorRandom.d.ts","sourceRoot":"","sources":["../../../../../../src/core/collection/array/iterator/ArrayIteratorRandom.js"],"names":[],"mappings":"AAIA;IACI,cAOC;IAJG,YAAY;IACZ,kBAAoB;IAEpB;;;MAA+B;IAGnC;;;OAGG;IACH,WAFW,MAAM,QAIhB;IAED,4BAYC;IAED,wBAgBC;CACJ;sCAnDqC,4BAA4B"}

package/src/core/collection/heap/BinaryHeap.d.ts

@@ -12,10 +12,10 @@ export default BinaryHeap;
 declare class BinaryHeap<T> {
     /**
      * @template T
-     * @param {function(el:T):number} min_score_function
+     * @param {(el: T) => number} min_score_function
      * @constructor
      */
-    constructor(min_score_function: any);
+    constructor(min_score_function: (el: T_1) => number);
     /**
      * @private
      * @type {T[]}

package/src/core/collection/heap/BinaryHeap.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"BinaryHeap.d.ts","sourceRoot":"","sources":["../../../../../src/core/collection/heap/BinaryHeap.js"],"names":[],"mappings":";AAEA;;;;;;;;;GASG;AACH;IAaI;;;;OAIG;IACH,qCAUC;IA3BD;;;OAGG;IACH,aAAU;IAEV;;;OAGG;IACH,eAAW;IAWP;;;OAGG;IACH,8BAFuB,MAAM,CAEU;IAI3C;;;OAGG;IACH,iBAkCC;IAED;;;OAGG;IACH,mBAmEC;IAED;;;OAGG;IACH,OAFY,CAAC,CA0BZ;IAED;;;OAGG;IACH,QAFa,CAAC,GAAC,SAAS,CAIvB;IAED;;;;OAIG;IACH,aAHW,CAAC,GACC,OAAO,CAYnB;IAED;;;OAGG;IACH,iBAFW,MAAM,QAehB;IAED;;OAEG;IACH,cAGC;IAED;;;;OAIG;IACH,eAHW,CAAC,GACC,OAAO,CAKnB;IAED;;;OAGG;IACH,WAFa,OAAO,CAInB;IAED;;;OAGG;IACH,QAFa,MAAM,CAIlB;IAED;;;;OAIG;IACH,yBAHW,CAAC,GACC,OAAO,CAanB;IAED;;;OAGG;IACH,SAFW,CAAC,QAUX;IAGL;;;;OAIG;IACH,uBAFU,OAAO,CAEgB;CAPhC"}
+{"version":3,"file":"BinaryHeap.d.ts","sourceRoot":"","sources":["../../../../../src/core/collection/heap/BinaryHeap.js"],"names":[],"mappings":";AAEA;;;;;;;;;GASG;AACH;IAaI;;;;OAIG;IACH,6CAHsB,MAAM,EAa3B;IA3BD;;;OAGG;IACH,aAAU;IAEV;;;OAGG;IACH,eAAW;IAWP;;;OAGG;IACH,8BAFuB,MAAM,CAEU;IAI3C;;;OAGG;IACH,iBAkCC;IAED;;;OAGG;IACH,mBAmEC;IAED;;;OAGG;IACH,OAFY,CAAC,CA0BZ;IAED;;;OAGG;IACH,QAFa,CAAC,GAAC,SAAS,CAIvB;IAED;;;;OAIG;IACH,aAHW,CAAC,GACC,OAAO,CAYnB;IAED;;;OAGG;IACH,iBAFW,MAAM,QAehB;IAED;;OAEG;IACH,cAGC;IAED;;;;OAIG;IACH,eAHW,CAAC,GACC,OAAO,CAKnB;IAED;;;OAGG;IACH,WAFa,OAAO,CAInB;IAED;;;OAGG;IACH,QAFa,MAAM,CAIlB;IAED;;;;OAIG;IACH,yBAHW,CAAC,GACC,OAAO,CAanB;IAED;;;OAGG;IACH,SAFW,CAAC,QAUX;IAGL;;;;OAIG;IACH,uBAFU,OAAO,CAEgB;CAPhC"}

package/src/core/collection/heap/BinaryHeap.js

@@ -25,7 +25,7 @@ class BinaryHeap {
 
     /**
      * @template T
-     * @param {function(el:T):number} min_score_function
+     * @param {(el: T) => number} min_score_function
      * @constructor
      */
     constructor(min_score_function) {

package/src/core/collection/list/List.d.ts

@@ -133,10 +133,10 @@ declare class List<T> {
     removeOneOf(value: T): boolean;
     /**
      *
-     * @param {function(a:T, b:T):number} [compare_function]
+     * @param {(a: T, b: T) => number} [compare_function]
      * @returns {this}
      */
-    sort(compare_function: any): this;
+    sort(compare_function?: (a: T, b: T) => number): this;
     /**
      * Copy of this list
      * The copy is shallow
@@ -152,11 +152,19 @@ declare class List<T> {
      */
     slice(start?: number, end?: number): T[];
     /**
+     * Whether every element satisfies the condition. Vacuously true when empty,
+     * matching Array.prototype.every.
      *
-     * @param {function(element:T):boolean} condition
+     * @param {(element: T) => boolean} condition
      * @returns {boolean}
      */
-    some(condition: any): boolean;
+    every(condition: (element: T) => boolean): boolean;
+    /**
+     *
+     * @param {(element: T) => boolean} condition
+     * @returns {boolean}
+     */
+    some(condition: (element: T) => boolean): boolean;
     /**
      *
      * @param {function(T):boolean} condition must return boolean value
@@ -174,10 +182,10 @@ declare class List<T> {
     removeOneIf(condition: (arg0: T) => boolean, thisArg?: any): boolean;
     /**
      * INVARIANT: List length must not change during the traversal
-     * @param {function(el:T, index:number):?} f
+     * @param {(el: T, index: number) => ?} f
      * @param {*} [thisArg]
      */
-    forEach(f: any, thisArg?: any): void;
+    forEach(f: (el: T, index: number) => unknown, thisArg?: any): void;
     /**
      * @param {function(*,T):*} f
      * @param {*} initial
@@ -192,10 +200,10 @@ declare class List<T> {
     filter(f: (arg0: T) => boolean): Array<T>;
     /**
      *
-     * @param {function(el:T):boolean} matcher
+     * @param {(el: T) => boolean} matcher
      * @returns {T|undefined}
      */
-    find(matcher: any): T | undefined;
+    find(matcher: (el: T) => boolean): T | undefined;
     /**
      *
      * @param {function(T):boolean} matcher
@@ -204,11 +212,11 @@ declare class List<T> {
     findIndex(matcher: (arg0: T) => boolean): number;
     /**
      *
-     * @param {function(el:T):boolean} matcher
-     * @param {function(el:T, index:number):*} callback
+     * @param {(el: T) => boolean} matcher
+     * @param {(el: T, index: number) => *} callback
      * @returns {boolean}
      */
-    visitFirstMatch(matcher: any, callback: any): boolean;
+    visitFirstMatch(matcher: (el: T) => boolean, callback: (el: T, index: number) => any): boolean;
     /**
      *
      * @param {T} v
@@ -241,10 +249,10 @@ declare class List<T> {
     map<R>(callback: (arg0: T) => R, thisArg?: any): R[];
     /**
      * @deprecated use `#reset` directly in combination with `this.on.removed` signal
-     * @param {function(element:T,index:number)} callback
+     * @param {(element: T, index: number) => void} callback
      * @param {*} [thisArg]
      */
-    resetViaCallback(callback: any, thisArg?: any): void;
+    resetViaCallback(callback: (element: T, index: number) => void, thisArg?: any): void;
     /**
      * Clears the list and removes all elements
      */
@@ -287,15 +295,15 @@ declare class List<T> {
     /**
      *
      * @param {BinaryBuffer} buffer
-     * @param {function(buffer:BinaryBuffer)} factory
+     * @param {(buffer: BinaryBuffer) => void} factory
      */
-    fromBinaryBufferViaFactory(buffer: BinaryBuffer, factory: any): void;
+    fromBinaryBufferViaFactory(buffer: BinaryBuffer, factory: (buffer: BinaryBuffer) => void): void;
     /**
      *
      * @param {BinaryBuffer} buffer
-     * @param {function(buffer:BinaryBuffer)} factory
+     * @param {(buffer: BinaryBuffer) => void} factory
      */
-    addFromBinaryBufferViaFactory(buffer: BinaryBuffer, factory: any): void;
+    addFromBinaryBufferViaFactory(buffer: BinaryBuffer, factory: (buffer: BinaryBuffer) => void): void;
     /**
      * @template J
      * @param {J[]} data
@@ -330,5 +338,12 @@ declare class List<T> {
      * @returns {number}
      */
     compare(other: List<T>): number;
+    /**
+     * Iterate the list's elements, so `for...of` and spread work on it the way
+     * they already do on HashMap, HashSet and Deque.
+     *
+     * @returns {Iterator<T>}
+     */
+    [Symbol.iterator](): Iterator<T>;
 }
 //# sourceMappingURL=List.d.ts.map

package/src/core/collection/list/List.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"List.d.ts","sourceRoot":"","sources":["../../../../../src/core/collection/list/List.js"],"names":[],"mappings":";AAQA;;;;;;;GAOG;AACH;IAoDI;;OAEG;IACH,oBAFW,CAAC,EAAE,EAqBb;IAzED;;OAEG;IACH;QACI;;;WAGG;;QAEH;;;WAGG;;QAGH;;;;;WAKG;;MAsBL;IAGF;;;OAGG;IACH,eAFU,CAAC,EAAE,CAEJ;IAkBL;;;OAGG;IACH,QAFU,MAAM,CAEc;IAIlC;;;;OAIG;IACH,WAHW,MAAM,GACJ,CAAC,GAAC,SAAS,CAOvB;IAED;;;;OAIG;IACH,WAHW,MAAM,SACN,CAAC,QAyBX;IAED;;;;OAIG;IACH,QAHW,CAAC,GACC,IAAI,CAUhB;IAED;;;;;;;OAOG;IACH,cAHW,CAAC,GACA,OAAO,CAUlB;IAED;;;;;;;OAOG;IACH,cALW,MAAM,MACN,CAAC,aAoBX;IAED;;;;;OAKG;IACH,sCAFa,MAAM,CAkClB;IAED;;;;;OAKG;IACH,gBAFW,CAAC,EAAE,QAqDb;IAED;;;OAGG;IACH,iBAFW,MAAO,CAAC,CAAC,QAmBnB;IAED;;;;;OAKG;IACH,uBAJW,MAAO,CAAC,CAAC,QAUnB;IAED;;;;;OAKG;IACH,kBAJW,MAAM,eACN,MAAM,GACJ,CAAC,EAAE,CAyBf;IAED;;;;OAIG;IACH,cAHW,MAAM,GACJ,CAAC,CAiBb;IAED;;;;OAIG;IACH,oBAHW,CAAC,EAAE,GACD,OAAO,CAwCnB;IAED;;;;OAIG;IACH,mBAHW,CAAC,GACA,OAAO,CAQlB;IAED;;;;OAIG;IACH,6BAFa,IAAI,CAKhB;IAED;;;;OAIG;IACH,SAFa,KAAM,CAAC,CAAC,CAIpB;IAED;;;;;;OAMG;IACH,cAJW,MAAM,QACN,MAAM,GACL,CAAC,EAAE,CAId;IAED;;;;OAIG;IACH,sBAFa,OAAO,CAWnB;IAED;;;;;OAKG;IACH,2BAJoB,CAAC,KAAE,OAAO,uBAkB7B;IAED;;;;;;OAMG;IACH,8BALoB,CAAC,KAAE,OAAO,kBAElB,OAAO,CAiBlB;IAED;;;;OAIG;IACH,qCASC;IAED;;;;OAIG;IACH,4BAJsB,CAAC,6BAUtB;IAED;;;;OAIG;IACH,iBAHoB,CAAC,KAAE,OAAO,GACjB,MAAO,CAAC,CAAC,CAIrB;IAED;;;;OAIG;IACH,oBAFa,CAAC,GAAC,SAAS,CAcvB;IAED;;;;OAIG;IACH,0BAHoB,CAAC,KAAE,OAAO,GACjB,MAAM,CAiBlB;IAED;;;;;OAKG;IACH,8CAFa,OAAO,CAkBnB;IAED;;;;OAIG;IACH,YAHW,CAAC,GACC,OAAO,CAInB;IAED;;;;OAIG;IACH,qBAHW,CAAC,EAAE,GACD,OAAO,CAanB;IAED;;;OAGG;IACH,WAFa,OAAO,CAInB;IAED;;;;OAIG;IACH,YAHW,CAAC,GACC,MAAM,CAIlB;IAED;;;;;OAKG;IACH,wBAJoB,CAAC,4BAkBpB;IAED;;;;OAIG;IACH,qDAEC;IAED;;OAEG;IACH,cAyBC;IAED;;;;;OAKG;IACH,gBAJW,KAAK,CAAC,CAAC,kDAuCjB;IAED;;;OAGG;IACH,YAFW,KAAK,CAAC,CAAC,GAAC,CAAC,EAAE,QAiBrB;IAED;;;OAGG;IACH,WAFa,CAAC,EAAE,CAIf;IAED,cAEC;IAED;;;;OAIG;IACH,oDAcC;IAED;;;OAGG;IACH,2CAcC;IAED;;;;OAIG;IACH,+DAaC;IAED;;;;OAIG;IACH,qEAIC;IAED;;;;OAIG;IACH,wEAQC;IAED;;;;OAIG;IACH,gEAFuB,CAAC,QAWvB;IAED;;;;OAIG;IACH,QAFa,MAAM,CAgBlB;IAED;;;OAGG;IACH,SAFa,CAAC,GAAC,SAAS,CAIvB;IAED;;;OAGG;IACH,QAFY,CAAC,GAAC,SAAS,CAItB;IAED;;;;OAIG;IACH,0BAFa,OAAO,CAgCnB;IAED;;;;OAIG;IACH,eAHW,KAAK,CAAC,CAAC,GACL,MAAM,CA0BlB;CACJ"}
+{"version":3,"file":"List.d.ts","sourceRoot":"","sources":["../../../../../src/core/collection/list/List.js"],"names":[],"mappings":";AAQA;;;;;;;GAOG;AACH;IAoDI;;OAEG;IACH,oBAFW,CAAC,EAAE,EAqBb;IAzED;;OAEG;IACH;QACI;;;WAGG;;QAEH;;;WAGG;;QAGH;;;;;WAKG;;MAsBL;IAGF;;;OAGG;IACH,eAFU,CAAC,EAAE,CAEJ;IAkBL;;;OAGG;IACH,QAFU,MAAM,CAEc;IAIlC;;;;OAIG;IACH,WAHW,MAAM,GACJ,CAAC,GAAC,SAAS,CAOvB;IAED;;;;OAIG;IACH,WAHW,MAAM,SACN,CAAC,QAyBX;IAED;;;;OAIG;IACH,QAHW,CAAC,GACC,IAAI,CAUhB;IAED;;;;;;;OAOG;IACH,cAHW,CAAC,GACA,OAAO,CAUlB;IAED;;;;;;;OAOG;IACH,cALW,MAAM,MACN,CAAC,aAoBX;IAED;;;;;OAKG;IACH,sCAFa,MAAM,CAkClB;IAED;;;;;OAKG;IACH,gBAFW,CAAC,EAAE,QAqDb;IAED;;;OAGG;IACH,iBAFW,MAAO,CAAC,CAAC,QAmBnB;IAED;;;;;OAKG;IACH,uBAJW,MAAO,CAAC,CAAC,QAUnB;IAED;;;;;OAKG;IACH,kBAJW,MAAM,eACN,MAAM,GACJ,CAAC,EAAE,CAyBf;IAED;;;;OAIG;IACH,cAHW,MAAM,GACJ,CAAC,CAiBb;IAED;;;;OAIG;IACH,oBAHW,CAAC,EAAE,GACD,OAAO,CAwCnB;IAED;;;;OAIG;IACH,mBAHW,CAAC,GACA,OAAO,CAQlB;IAED;;;;OAIG;IACH,4BAHe,CAAC,KAAK,CAAC,KAAK,MAAM,GACpB,IAAI,CAKhB;IAED;;;;OAIG;IACH,SAFa,KAAM,CAAC,CAAC,CAIpB;IAED;;;;;;OAMG;IACH,cAJW,MAAM,QACN,MAAM,GACL,CAAC,EAAE,CAId;IAED;;;;;;OAMG;IACH,2BAHqB,CAAC,KAAK,OAAO,GACrB,OAAO,CAanB;IAgBD;;;;OAIG;IACH,0BAHqB,CAAC,KAAK,OAAO,GACrB,OAAO,CAWnB;IAED;;;;;OAKG;IACH,2BAJoB,CAAC,KAAE,OAAO,uBAkB7B;IAED;;;;;;OAMG;IACH,8BALoB,CAAC,KAAE,OAAO,kBAElB,OAAO,CAiBlB;IAED;;;;OAIG;IACH,gBAHgB,CAAC,SAAS,MAAM,mCAY/B;IAED;;;;OAIG;IACH,4BAJsB,CAAC,6BAUtB;IAED;;;;OAIG;IACH,iBAHoB,CAAC,KAAE,OAAO,GACjB,MAAO,CAAC,CAAC,CAIrB;IAED;;;;OAIG;IACH,mBAHgB,CAAC,KAAK,OAAO,GAChB,CAAC,GAAC,SAAS,CAcvB;IAED;;;;OAIG;IACH,0BAHoB,CAAC,KAAE,OAAO,GACjB,MAAM,CAiBlB;IAED;;;;;OAKG;IACH,8BAJgB,CAAC,KAAK,OAAO,iBACb,CAAC,SAAS,MAAM,WACnB,OAAO,CAkBnB;IAED;;;;OAIG;IACH,YAHW,CAAC,GACC,OAAO,CAInB;IAED;;;;OAIG;IACH,qBAHW,CAAC,EAAE,GACD,OAAO,CAanB;IAED;;;OAGG;IACH,WAFa,OAAO,CAInB;IAED;;;;OAIG;IACH,YAHW,CAAC,GACC,MAAM,CAIlB;IAED;;;;;OAKG;IACH,wBAJoB,CAAC,4BAkBpB;IAED;;;;OAIG;IACH,qCAHqB,CAAC,SAAS,MAAM,KAAK,IAAI,uBAK7C;IAED;;OAEG;IACH,cAyBC;IAED;;;;;OAKG;IACH,gBAJW,KAAK,CAAC,CAAC,kDAuCjB;IAED;;;OAGG;IACH,YAFW,KAAK,CAAC,CAAC,GAAC,CAAC,EAAE,QAiBrB;IAED;;;OAGG;IACH,WAFa,CAAC,EAAE,CAIf;IAED,cAEC;IAED;;;;OAIG;IACH,oDAcC;IAED;;;OAGG;IACH,2CAcC;IAED;;;;OAIG;IACH,+DAaC;IAED;;;;OAIG;IACH,oFAFqC,IAAI,QAMxC;IAED;;;;OAIG;IACH,uFAFqC,IAAI,QAUxC;IAED;;;;OAIG;IACH,gEAFuB,CAAC,QAWvB;IAED;;;;OAIG;IACH,QAFa,MAAM,CAgBlB;IAED;;;OAGG;IACH,SAFa,CAAC,GAAC,SAAS,CAIvB;IAED;;;OAGG;IACH,QAFY,CAAC,GAAC,SAAS,CAItB;IAED;;;;OAIG;IACH,0BAFa,OAAO,CAgCnB;IAED;;;;OAIG;IACH,eAHW,KAAK,CAAC,CAAC,GACL,MAAM,CA0BlB;IArjBD;;;;;OAKG;IACH,qBAFa,SAAS,CAAC,CAAC,CAQvB;CA0iBJ"}

package/src/core/collection/list/List.js

@@ -440,7 +440,7 @@ class List {
 
     /**
      *
-     * @param {function(a:T, b:T):number} [compare_function]
+     * @param {(a: T, b: T) => number} [compare_function]
      * @returns {this}
      */
     sort(compare_function) {
@@ -469,8 +469,42 @@ class List {
     }
 
     /**
+     * Whether every element satisfies the condition. Vacuously true when empty,
+     * matching Array.prototype.every.
      *
-     * @param {function(element:T):boolean} condition
+     * @param {(element: T) => boolean} condition
+     * @returns {boolean}
+     */
+    every(condition) {
+        const l = this.length;
+        const data = this.data;
+
+        for (let i = 0; i < l; i++) {
+            if (!condition(data[i])) {
+                return false;
+            }
+        }
+
+        return true;
+    }
+
+    /**
+     * Iterate the list's elements, so `for...of` and spread work on it the way
+     * they already do on HashMap, HashSet and Deque.
+     *
+     * @returns {Iterator<T>}
+     */
+    * [Symbol.iterator]() {
+        const data = this.data;
+
+        for (let i = 0; i < this.length; i++) {
+            yield data[i];
+        }
+    }
+
+    /**
+     *
+     * @param {(element: T) => boolean} condition
      * @returns {boolean}
      */
     some(condition) {
@@ -531,7 +565,7 @@ class List {
 
     /**
      * INVARIANT: List length must not change during the traversal
-     * @param {function(el:T, index:number):?} f
+     * @param {(el: T, index: number) => ?} f
      * @param {*} [thisArg]
      */
     forEach(f, thisArg) {
@@ -569,7 +603,7 @@ class List {
 
     /**
      *
-     * @param {function(el:T):boolean} matcher
+     * @param {(el: T) => boolean} matcher
      * @returns {T|undefined}
      */
     find(matcher) {
@@ -610,8 +644,8 @@ class List {
 
     /**
      *
-     * @param {function(el:T):boolean} matcher
-     * @param {function(el:T, index:number):*} callback
+     * @param {(el: T) => boolean} matcher
+     * @param {(el: T, index: number) => *} callback
      * @returns {boolean}
      */
     visitFirstMatch(matcher, callback) {
@@ -700,7 +734,7 @@ class List {
 
     /**
      * @deprecated use `#reset` directly in combination with `this.on.removed` signal
-     * @param {function(element:T,index:number)} callback
+     * @param {(element: T, index: number) => void} callback
      * @param {*} [thisArg]
      */
     resetViaCallback(callback, thisArg) {
@@ -877,7 +911,7 @@ class List {
     /**
      *
      * @param {BinaryBuffer} buffer
-     * @param {function(buffer:BinaryBuffer)} factory
+     * @param {(buffer: BinaryBuffer) => void} factory
      */
     fromBinaryBufferViaFactory(buffer, factory) {
         this.reset();
@@ -888,7 +922,7 @@ class List {
     /**
      *
      * @param {BinaryBuffer} buffer
-     * @param {function(buffer:BinaryBuffer)} factory
+     * @param {(buffer: BinaryBuffer) => void} factory
      */
     addFromBinaryBufferViaFactory(buffer, factory) {
         const length = buffer.readUint32();

package/src/core/collection/list/SortedListProjection.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"SortedListProjection.d.ts","sourceRoot":"","sources":["../../../../../src/core/collection/list/SortedListProjection.js"],"names":[],"mappings":"AAGA;;GAEG;AACH;IACI;;;;OAIG;IACH,mBAHW,KAAK,CAAC,CAAC,qBACE,CAAC,QAAC,CAAC,KAAE,MAAM,EAoB9B;IAjBG;;;OAGG;IACH,OAFU,KAAK,CAAC,CAAC,CAEC;IAElB;;;OAGG;IACH,QAFU,KAAK,CAAC,CAAC,CAEO;IAExB;;;OAGG;IACH,mBAFmB,CAAC,QAAE,CAAC,KAAG,MAAM,CAEJ;IAGhC,aAIC;IAED,eAEC;IAED;;;OAGG;IACH,mBAFW,CAAC,QAMX;IAGD,cAUC;CAEJ;iBAhEgB,WAAW"}
+{"version":3,"file":"SortedListProjection.d.ts","sourceRoot":"","sources":["../../../../../src/core/collection/list/SortedListProjection.js"],"names":[],"mappings":"AAGA;;GAEG;AACH;IACI;;;;OAIG;IACH,mBAHW,KAAK,CAAC,CAAC,qBACE,CAAC,QAAC,CAAC,KAAE,MAAM,EAoB9B;IAjBG;;;OAGG;IACH,OAFU,KAAK,CAAC,CAAC,CAEC;IAElB;;;OAGG;IACH,QAFU,KAAK,CAAC,CAAC,CAEO;IAExB;;;OAGG;IACH,mBAFmB,CAAC,QAAE,CAAC,KAAG,MAAM,CAEJ;IAGhC,aAIC;IAED,eAEC;IAED;;;OAGG;IACH,mBAFW,CAAC,QASX;IAGD,cAUC;CAEJ;iBAnEgB,WAAW"}

package/src/core/collection/list/SortedListProjection.js

@@ -45,9 +45,12 @@ export class SortedListProjection {
      * @param {T} el
      */
     handleAddition(el) {
+        // binarySearchLowIndex returns the index of the largest element <= el,
+        // or -1 when el sorts below everything. The insertion point is one past
+        // that in both cases.
         const where = binarySearchLowIndex(this.output.data, el, this.comparator);
 
-        this.output.insert(where, el);
+        this.output.insert(where + 1, el);
     }
 
 

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

@@ -14,11 +14,34 @@ export class BiMap<K, V> {
      */
     backward: Map<V, K>;
     /**
+     * Note the argument order: the pair is stored as value-then-key, which is
+     * how the only in-tree consumer (EncodingBinaryBuffer) calls it. The
+     * parameter names used to claim the opposite, which made every accessor
+     * below look inverted.
      *
+     * @param {V} value
      * @param {K} key
+     */
+    add(value: V, key: K): void;
+    /**
+     * Remove a pair by its value.
+     *
      * @param {V} value
+     * @returns {boolean} whether a pair was removed
+     */
+    deleteByValue(value: V): boolean;
+    /**
+     * Remove a pair by its key.
+     *
+     * @param {K} key
+     * @returns {boolean} whether a pair was removed
+     */
+    deleteByKey(key: K): boolean;
+    /**
+     * @returns {number}
      */
-    add(key: K, value: V): void;
+    get size(): number;
+    clear(): void;
     /**
      *
      * @param {V} value
@@ -32,6 +55,6 @@ export class BiMap<K, V> {
      */
     getValueByKey(address: K): V | undefined;
     get: (address: any) => any;
-    set: (key: any, value: any) => void;
+    set: (value: any, key: any) => void;
 }
 //# sourceMappingURL=BiMap.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"BiMap.d.ts","sourceRoot":"","sources":["../../../../../src/core/collection/map/BiMap.js"],"names":[],"mappings":"AAAA;;;GAGG;AACH;IAEI;;;OAGG;IACH,SAFU,IAAI,CAAC,EAAE,CAAC,CAAC,CAEC;IACpB;;;OAGG;IACH,UAFU,IAAI,CAAC,EAAE,CAAC,CAAC,CAEE;IAGrB;;;;OAIG;IACH,SAHW,CAAC,SACD,CAAC,QAKX;IAED;;;;OAIG;IACH,qBAHW,CAAC,GACC,CAAC,GAAC,SAAS,CAIvB;IAED;;;;OAIG;IACH,uBAHW,CAAC,GACC,CAAC,GAAC,SAAS,CAIvB;IAGL,2BAAmB;IACnB,oCAAmB;CAHlB"}
+{"version":3,"file":"BiMap.d.ts","sourceRoot":"","sources":["../../../../../src/core/collection/map/BiMap.js"],"names":[],"mappings":"AAAA;;;GAGG;AACH;IAEI;;;OAGG;IACH,SAFU,IAAI,CAAC,EAAE,CAAC,CAAC,CAEC;IACpB;;;OAGG;IACH,UAFU,IAAI,CAAC,EAAE,CAAC,CAAC,CAEE;IAGrB;;;;;;;;OAQG;IACH,WAHW,CAAC,OACD,CAAC,QAKX;IAED;;;;;OAKG;IACH,qBAHW,CAAC,GACC,OAAO,CAanB;IAED;;;;;OAKG;IACH,iBAHW,CAAC,GACC,OAAO,CAanB;IAED;;OAEG;IACH,mBAEC;IAED,cAGC;IAED;;;;OAIG;IACH,qBAHW,CAAC,GACC,CAAC,GAAC,SAAS,CAIvB;IAED;;;;OAIG;IACH,uBAHW,CAAC,GACC,CAAC,GAAC,SAAS,CAIvB;IAGL,2BAAmB;IACnB,oCAAmB;CAHlB"}