@woosh/meep-engine 2.105.0 → 2.106.1

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

@@ -5,9 +5,6 @@
  * @template Key,Value
  */
 export class AbstractAsyncMap {
-    constructor() {
-
-    }
 
     /**
      *

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

@@ -1,20 +1,16 @@
 /**
  * Wraps synchronous {@link Map}-implementing object
+ * @template K,V
  */
-export class AsyncMapWrapper extends AbstractAsyncMap<any, any> {
+export class AsyncMapWrapper<K, V> extends AbstractAsyncMap<any, any> {
     /**
      *
-     * @param {Map} [source]
+     * @param {Map<K,V>} [source]
      */
-    constructor(source?: Map<any, any>);
-    /**
-     *
-     * @type {Map}
-     * @private
-     */
-    private _source;
-    get(key: any): Promise<any>;
+    constructor(source?: Map<K, V>);
+    get(key: any): Promise<V>;
     set(key: any, value: any): Promise<void>;
+    #private;
 }
 import { AbstractAsyncMap } from "./AbstractAsyncMap.js";
 //# sourceMappingURL=AsyncMapWrapper.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"AsyncMapWrapper.d.ts","sourceRoot":"","sources":["../../../../../src/core/collection/map/AsyncMapWrapper.js"],"names":[],"mappings":"AAEA;;GAEG;AACH;IACI;;;OAGG;IACH,oCAQC;IANG;;;;OAIG;IACH,gBAAqB;IAGzB,4BAEC;IAED,yCAEC;CACJ;iCA3BgC,uBAAuB"}
+{"version":3,"file":"AsyncMapWrapper.d.ts","sourceRoot":"","sources":["../../../../../src/core/collection/map/AsyncMapWrapper.js"],"names":[],"mappings":"AAEA;;;GAGG;AACH;IAUI;;;OAGG;IACH,qBAFW,IAAI,CAAC,EAAC,CAAC,CAAC,EAKlB;IAED,0BAEC;IAED,yCAEC;;CACJ;iCAhCgC,uBAAuB"}

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

@@ -2,27 +2,32 @@ import { AbstractAsyncMap } from "./AbstractAsyncMap.js";
 
 /**
  * Wraps synchronous {@link Map}-implementing object
+ * @template K,V
  */
 export class AsyncMapWrapper extends AbstractAsyncMap {
+
+    /**
+     *
+     * @type {Map<K,V>}
+     * @private
+     */
+    #source = null;
+
+
     /**
      *
-     * @param {Map} [source]
+     * @param {Map<K,V>} [source]
      */
     constructor(source = new Map()) {
         super();
-        /**
-         *
-         * @type {Map}
-         * @private
-         */
-        this._source = source;
+        this.#source = source;
     }
 
     async get(key) {
-        return this._source.get(key);
+        return this.#source.get(key);
     }
 
     async set(key, value) {
-        this._source.set(key, value);
+        this.#source.set(key, value);
     }
 }

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":"AAiBA;;;;;;;;;;;;GAYG;AACH,uFAIC;AA8FD;;;;;;;GAOG;AACH;IA+DI;;;;;;OAMG;IACH,4FALuB,MAAM,EAsC5B;IAlBG;;;;;OAKG;IACH,iCAAsC;IACtC;;;;;OAKG;IACH,qCAA8C;IAOlD,mBAEC;IAED;;;OAGG;IACH,kBAFa,MAAM,CAIlB;IAkJD;;;;OAIG;IACH,SAHW,CAAC,SACD,CAAC,QAsEX;IAED;;;;OAIG;IACH,SAHW,CAAC,GACC,CAAC,GAAC,SAAS,CA+BvB;IAED;;;;;;;;OAQG;IACH,kBALW,CAAC,kBACQ,CAAC,KAAE,CAAC,0BAEZ,CAAC,CAcZ;IAED;;;;;OAKG;IACH,cAJW,CAAC,SACD,CAAC,GACA,CAAC,CAYZ;IAuBD;;;;OAIG;IACH,YAHW,CAAC,GACC,OAAO,CA+CnB;IAED;;;;;OAKG;IACH,4CAFa,OAAO,CA+BnB;IAOD;;OAEG;IACH,gBAkDC;IAmBD,2CAwBC;IAED;;;;OAIG;IACH,SAHW,CAAC,GACC,OAAO,CAInB;IAED;;OAEG;IACH,cA6BC;IA+BD;;;OAGG;IACH,UAFa,SAAS,CAAC,CAAC,CAOvB;IAED;;;OAGG;IACH,QAFa,SAAS,CAAC,CAAC,CAMvB;IAhDD,yDA2BC;;CAsBJ"}
+{"version":3,"file":"HashMap.d.ts","sourceRoot":"","sources":["../../../../../src/core/collection/map/HashMap.js"],"names":[],"mappings":"AAiBA;;;;;;;;;;;;GAYG;AACH,uFAIC;AA8FD;;;;;;;GAOG;AACH;IA+DI;;;;;;OAMG;IACH,4FALuB,MAAM,EAsC5B;IAlBG;;;;;OAKG;IACH,iCAAsC;IACtC;;;;;OAKG;IACH,qCAA8C;IAOlD,mBAEC;IAED;;;OAGG;IACH,kBAFa,MAAM,CAIlB;IAiKD;;;;OAIG;IACH,SAHW,CAAC,SACD,CAAC,QA0EX;IAED;;;;OAIG;IACH,SAHW,CAAC,GACC,CAAC,GAAC,SAAS,CA+BvB;IAED;;;;;;;;OAQG;IACH,kBALW,CAAC,kBACQ,CAAC,KAAE,CAAC,0BAEZ,CAAC,CAgBZ;IAED;;;;;OAKG;IACH,cAJW,CAAC,SACD,CAAC,GACA,CAAC,CAYZ;IAuBD;;;;OAIG;IACH,YAHW,CAAC,GACC,OAAO,CA+CnB;IAED;;;;;OAKG;IACH,4CAFa,OAAO,CA+BnB;IAOD;;OAEG;IACH,gBAsDC;IAmBD,2CA0BC;IAED;;;;OAIG;IACH,SAHW,CAAC,GACC,OAAO,CAInB;IAED;;OAEG;IACH,cA6BC;IA+BD;;;OAGG;IACH,UAFa,SAAS,CAAC,CAAC,CAOvB;IAED;;;OAGG;IACH,QAFa,SAAS,CAAC,CAAC,CAMvB;IAhDD,yDA2BC;;CAsBJ"}

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

@@ -271,6 +271,8 @@ export class HashMap {
         this.#bin_count = 2 ** this.#bin_count_power_of_two;
         this.#bin_count_mask = this.#bin_count - 1;
 
+        const old_entry_allocation_count = this.#entries_allocated_count;
+
         this.#entries_allocated_count = 2 ** this.#entries_count_power_of_two;
 
         const BinsArray = UintArrayForCount(this.#entries_allocated_count + ENTRY_BASE);
@@ -282,7 +284,7 @@ export class HashMap {
 
         this.#entries = new_entries;
 
-        array_copy(old_entries, 0, new_entries, 0, min2(old_entries.length, this.#entries_allocated_count));
+        array_copy(old_entries, 0, new_entries, 0, min2(old_entry_allocation_count, this.#entries_allocated_count));
 
         if (this.#size > 0) {
             // re-hash
@@ -316,6 +318,8 @@ export class HashMap {
     #build_key_hash(key) {
         const original = this.keyHashFunction(key);
 
+        assert.isInteger(original, 'hash');
+
         return original === RESERVED_HASH ? RESERVED_HASH_SUBSTITUTE : original;
     }
 
@@ -356,12 +360,23 @@ export class HashMap {
         this.#entries_bound++;
 
         if (this.#entries[i] !== undefined) {
+
+            // entry exists, let's reuse it
+
             const entry = this.#entries[i];
+
+            assert.equal(entry.hash, RESERVED_HASH, 'Entry is occupied');
+
             entry.hash = hash;
             entry.key = k;
             entry.value = v;
+
         } else {
+
+            // entry slot is empty
+
             this.#entries[i] = new HashMapEntry(k, v, hash);
+
         }
 
         return i;
@@ -441,7 +456,11 @@ export class HashMap {
                 assert.equal(this.#entries[entry_index].value, value, 'entry.value');
                 assert.equal(this.#entries[entry_index].key, key, 'entry.key');
 
-                this.#bins[bin_index] = entry_index + ENTRY_BASE;
+                const bin_value = entry_index + ENTRY_BASE;
+
+                this.#bins[bin_index] = bin_value;
+
+                assert.equal(bin_value, this.#bins[bin_index], 'Bin value write error');
 
                 break;
 
@@ -516,6 +535,8 @@ export class HashMap {
      * @return {V}
      */
     getOrCompute(key, compute, compute_context) {
+        assert.isFunction(compute, 'compute');
+
         const existing = this.get(key);
 
         if (existing !== undefined) {
@@ -675,7 +696,11 @@ export class HashMap {
 
         let written_entries = 0;
 
-        for (let existing_entry_index = this.#entries_start; existing_entry_index < entries_bound; existing_entry_index++) {
+        for (
+            let existing_entry_index = this.#entries_start;
+            existing_entry_index < entries_bound;
+            existing_entry_index++
+        ) {
             const entry = entries[existing_entry_index];
 
             const hash = entry.hash;
@@ -735,6 +760,8 @@ export class HashMap {
     }
 
     forEach(callback, thisArg) {
+        assert.isFunction(callback, 'callback');
+
         const count = this.#bin_count;
         const entries = this.#entries;
         const bins = this.#bins;

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

@@ -8,9 +8,18 @@ export class ObservedMap<K, V> {
      * @constructor
      */
     constructor(source?: Map<any, any>);
-    on: {
-        set: Signal<any, any, any, any, any, any, any, any>;
-        deleted: Signal<any, any, any, any, any, any, any, any>;
+    /**
+     * @readonly
+     */
+    readonly on: {
+        /**
+         * @type {Signal}
+         */
+        set: Signal;
+        /**
+         * @type {Signal}
+         */
+        deleted: Signal;
     };
     /**
      *

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

@@ -1 +1 @@
-{"version":3,"file":"ObservedMap.d.ts","sourceRoot":"","sources":["../../../../../src/core/collection/map/ObservedMap.js"],"names":[],"mappings":"AAEA;;;GAGG;AACH;IACI;;;OAGG;IACH,oCAWC;IAVG;;;MAGC;IAED;;;OAGG;IACH,oBAAkB;IAGtB;;;;OAIG;IACH,SAHW,CAAC,GACC,CAAC,GAAC,SAAS,CAIvB;IAED;;;;;OAKG;IACH,SAJW,CAAC,SACD,CAAC,yBAQX;IAED;;;;OAIG;IACH,YAHW,CAAC,GACC,OAAO,CAUnB;IAED;;;;OAIG;IACH,iDAEC;IAED;;;OAGG;IACH,mBAEC;CACJ;mBA7EkB,+BAA+B"}
+{"version":3,"file":"ObservedMap.d.ts","sourceRoot":"","sources":["../../../../../src/core/collection/map/ObservedMap.js"],"names":[],"mappings":"AAEA;;;GAGG;AACH;IAeI;;;OAGG;IACH,oCAOC;IAzBD;;OAEG;IACH;QACI;;WAEG;aADO,MAAM;QAGhB;;WAEG;iBADO,MAAM;MAGlB;IAQE;;;OAGG;IACH,oBAAkB;IAGtB;;;;OAIG;IACH,SAHW,CAAC,GACC,CAAC,GAAC,SAAS,CAIvB;IAED;;;;;OAKG;IACH,SAJW,CAAC,SACD,CAAC,yBAQX;IAED;;;;OAIG;IACH,YAHW,CAAC,GACC,OAAO,CAUnB;IAED;;;;OAIG;IACH,iDAEC;IAED;;;OAGG;IACH,mBAEC;CACJ;mBAvFkB,+BAA+B"}

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

@@ -5,15 +5,25 @@ import Signal from "../../events/signal/Signal.js";
  * @template K,V
  */
 export class ObservedMap {
+    /**
+     * @readonly
+     */
+    on = {
+        /**
+         * @type {Signal}
+         */
+        set: new Signal(),
+        /**
+         * @type {Signal}
+         */
+        deleted: new Signal()
+    };
+
     /**
      * @template K,V
      * @constructor
      */
     constructor(source = new Map()) {
-        this.on = {
-            set: new Signal(),
-            deleted: new Signal()
-        };
 
         /**
          *

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":"AAYA;;;GAGG;AACH;IACI;;;OAGG;IACH,uBAFW,MAAM,EAoChB;IA5BG;;;;;;OAMG;IACH,eAA6B;IAE7B;;;;OAIG;IACH,eAAe;IACf;;;;OAIG;IACH,eAAe;IAEf;;;;OAIG;IACH,iBAA4B;IAGhC;;;;OAIG;IACH,oBASC;IAED;;;;;OAKG;IACH,iCAMC;IAED;;;;;OAKG;IACH,qCAGC;IAED,2BAwCC;IAED;;;OAGG;IACH,WAFY,OAAO,CAIlB;IAED,cAeC;IAED;;OAEG;IACH,QAFa,MAAM,CAalB;IAED;;;;;OAKG;IACH,0BAqCC;IAED;;;;OAIG;IACH,UAHW,CAAC,GACC,OAAO,CAYnB;IAED;;;;;OAKG;IACH,mBAiBC;IAED;;;;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;IAOL,gBAAoB;IACpB,uBAAoB;IACpB,eAAmB;IAEnB;;OAEG;IACH,sBAAmB;CAblB"}
+{"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;IAqFD;;;OAGG;IACH,WAFY,OAAO,CAIlB;IAED,cAeC;IAED;;OAEG;IACH,QAFa,MAAM,CAalB;IA+CD;;;;OAIG;IACH,UAHW,CAAC,GACC,OAAO,CAYnB;IA2BD;;;;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;IAOL,gBAAoB;IACpB,uBAAoB;IACpB,eAAmB;IAEnB;;OAEG;IACH,sBAAmB;;CAblB"}

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

@@ -10,11 +10,42 @@ const STATUS_FULL = 0;
 const STATUS_EMPTY = 1;
 const STATUS_NORMAL = 2;
 
+const EMPTY_ARRAY = new Array(0);
+
 /**
  * Double-ended queue backed by an array
  * @template T
  */
 export class Deque {
+
+    /**
+     * Using static array allocator to preserve data locality.
+     * Initialization via "[]" would give us a dynamically sized array,
+     * but it would have unpredictable locality as array may or may not have it's elements stored next to each other in memory
+     * @type {T[]}
+     * @private
+     */
+    #data=EMPTY_ARRAY;
+    /**
+     *
+     * @type {number}
+     * @private
+     */
+    #head = 0;
+    /**
+     *
+     * @type {number}
+     * @private
+     */
+    #tail = 0;
+
+    /**
+     *
+     * @type {number}
+     * @private
+     */
+    #status = STATUS_EMPTY;
+
     /**
      * @template T
      * @param {number} [min_size]
@@ -25,34 +56,8 @@ export class Deque {
 
         const size = ceilPowerOfTwo(max2(1, min_size));
 
-        /**
-         * Using static array allocator to preserve data locality.
-         * Initialization via "[]" would give us a dynamically sized array,
-         * but it would have unpredictable locality as array may or may not have it's elements stored next to each other in memory
-         * @type {T[]}
-         * @private
-         */
-        this.__data = new Array(size);
-
-        /**
-         *
-         * @type {number}
-         * @private
-         */
-        this.__head = 0;
-        /**
-         *
-         * @type {number}
-         * @private
-         */
-        this.__tail = 0;
+        this.#data = new Array(size);
 
-        /**
-         *
-         * @type {number}
-         * @private
-         */
-        this.__status = STATUS_EMPTY;
     }
 
     /**
@@ -60,14 +65,14 @@ export class Deque {
      * @param {boolean} adding
      * @private
      */
-    resetStatus(adding) {
-        const head = this.__head;
-        const tail = this.__tail;
+    #reset_status(adding) {
+        const head = this.#head;
+        const tail = this.#tail;
 
         if (head === tail) {
-            this.__status = adding ? STATUS_FULL : STATUS_EMPTY;
+            this.#status = adding ? STATUS_FULL : STATUS_EMPTY;
         } else {
-            this.__status = STATUS_NORMAL;
+            this.#status = STATUS_NORMAL;
         }
     }
 
@@ -77,10 +82,10 @@ export class Deque {
      * @returns {number}
      * @private
      */
-    __circular_next_position(current) {
+    #circular_next_position(current) {
         const next = current + 1;
 
-        const length = this.__data.length;
+        const length = this.#data.length;
 
         return (next >= length) ? 0 : next;
     }
@@ -91,20 +96,20 @@ export class Deque {
      * @returns {number}
      * @private
      */
-    __circular_previous_position(current) {
+    #circular_previous_position(current) {
         const prev = current - 1;
-        return (prev < 0) ? (this.__data.length - 1) : prev;
+        return (prev < 0) ? (this.#data.length - 1) : prev;
     }
 
-    __check_and_expand() {
-        const status = this.__status;
+    #check_and_expand() {
+        const status = this.#status;
 
         if (status !== STATUS_FULL) {
             // queue still has space, we're done
             return;
         }
 
-        const length = this.__data.length;
+        const length = this.#data.length;
 
         if (UINT32_MAX === length) {
             throw new Error('Maximum array size exceeded');
@@ -123,19 +128,19 @@ export class Deque {
          */
         const new_data = new Array(new_length);
 
-        const head = this.__head;
+        const head = this.#head;
 
         // copy the front portion
-        array_copy(this.__data, head, new_data, 0, length - head);
+        array_copy(this.#data, head, new_data, 0, length - head);
         // copy the remainder
-        array_copy(this.__data, 0, new_data, length - head, head);
+        array_copy(this.#data, 0, new_data, length - head, head);
 
-        this.__head = 0;
-        this.__tail = length;
+        this.#head = 0;
+        this.#tail = length;
 
-        this.__status = STATUS_NORMAL;
+        this.#status = STATUS_NORMAL;
 
-        this.__data = new_data;
+        this.#data = new_data;
     }
 
     /**
@@ -147,34 +152,34 @@ export class Deque {
     }
 
     clear() {
-        if (this.__status !== STATUS_EMPTY) {
-            let cursor = this.__head;
-            const tail = this.__tail;
+        if (this.#status !== STATUS_EMPTY) {
+            let cursor = this.#head;
+            const tail = this.#tail;
 
             do {
-                this.__data[cursor] = undefined;
-                cursor = this.__circular_next_position(cursor);
+                this.#data[cursor] = undefined;
+                cursor = this.#circular_next_position(cursor);
             } while (cursor !== tail);
 
-            this.__status = STATUS_EMPTY;
+            this.#status = STATUS_EMPTY;
         }
 
-        this.__head = 0;
-        this.__tail = 0;
+        this.#head = 0;
+        this.#tail = 0;
     }
 
     /**
      * @returns {number}
      */
     size() {
-        const data = this.__data;
+        const data = this.#data;
 
-        if (this.__status === STATUS_FULL) {
+        if (this.#status === STATUS_FULL) {
             return data.length;
         }
 
-        const head = this.__head;
-        const tail = this.__tail;
+        const head = this.#head;
+        const tail = this.#tail;
 
         return (head <= tail) ? (tail - head) : (tail + data.length - head);
     }
@@ -185,43 +190,43 @@ export class Deque {
      * @param {boolean} shift_front should we shift elements before the removed element or after?
      * @private
      */
-    __remove_internal(current, shift_front) {
+    #remove_internal(current, shift_front) {
         let cursor = current;
 
         if (shift_front) {
 
             // shift towards tail
 
-            const head = this.__head;
+            const head = this.#head;
 
             while (cursor !== head) {
-                const next = this.__circular_previous_position(cursor);
-                this.__data[cursor] = this.__data[next];
+                const next = this.#circular_previous_position(cursor);
+                this.#data[cursor] = this.#data[next];
                 cursor = next;
             }
 
-            this.__head = this.__circular_next_position(head);
+            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];
+                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;
+        this.#data[cursor] = undefined;
 
-        this.resetStatus(false);
+        this.#reset_status(false);
     }
 
     /**
@@ -230,13 +235,13 @@ export class Deque {
      * @returns {boolean}
      */
     remove(e) {
-        const i = this.__index_of(e);
+        const i = this.#index_of(e);
 
         if (i === -1) {
             return false;
         }
 
-        this.__remove_internal(i, true);
+        this.#remove_internal(i, true);
 
         return true;
     }
@@ -247,14 +252,14 @@ export class Deque {
      * @returns {number}
      * @private
      */
-    __index_of(e) {
+    #index_of(e) {
         const size = this.size();
 
-        const data = this.__data;
+        const data = this.#data;
         const capacity = data.length;
 
         for (let i = 0; i < size; i++) {
-            const index = (this.__head + i) % capacity;
+            const index = (this.#head + i) % capacity;
 
             const el = data[index];
 
@@ -272,7 +277,7 @@ export class Deque {
      * @returns {boolean}
      */
     has(e) {
-        return this.__index_of(e) !== -1;
+        return this.#index_of(e) !== -1;
     }
 
     /**
@@ -280,10 +285,10 @@ export class Deque {
      * @param {T} e
      */
     addFirst(e) {
-        this.__check_and_expand();
-        this.__head = this.__circular_previous_position(this.__head);
-        this.__data[this.__head] = e;
-        this.resetStatus(true);
+        this.#check_and_expand();
+        this.#head = this.#circular_previous_position(this.#head);
+        this.#data[this.#head] = e;
+        this.#reset_status(true);
     }
 
     /**
@@ -291,10 +296,10 @@ export class Deque {
      * @returns {T|undefined}
      */
     removeFirst() {
-        const element = this.__data[this.__head];
-        this.__data[this.__head] = undefined;
-        this.__head = this.__circular_next_position(this.__head);
-        this.resetStatus(false);
+        const element = this.#data[this.#head];
+        this.#data[this.#head] = undefined;
+        this.#head = this.#circular_next_position(this.#head);
+        this.#reset_status(false);
         return element;
     }
 
@@ -303,7 +308,7 @@ export class Deque {
      * @returns {T|undefined}
      */
     getFirst() {
-        return this.__data[this.__head];
+        return this.#data[this.#head];
     }
 
     /**
@@ -311,10 +316,10 @@ export class Deque {
      * @param {T} e
      */
     addLast(e) {
-        this.__check_and_expand();
-        this.__data[this.__tail] = e;
-        this.__tail = this.__circular_next_position(this.__tail);
-        this.resetStatus(true);
+        this.#check_and_expand();
+        this.#data[this.#tail] = e;
+        this.#tail = this.#circular_next_position(this.#tail);
+        this.#reset_status(true);
     }
 
     /**
@@ -322,11 +327,11 @@ export class Deque {
      * @returns {T}
      */
     removeLast() {
-        const last = this.__circular_previous_position(this.__tail);
-        const element = this.__data[last];
-        this.__data[last] = undefined;
-        this.__tail = last;
-        this.resetStatus(false);
+        const last = this.#circular_previous_position(this.#tail);
+        const element = this.#data[last];
+        this.#data[last] = undefined;
+        this.#tail = last;
+        this.#reset_status(false);
         return element;
     }
 
@@ -336,8 +341,8 @@ export class Deque {
      * @returns {T|undefined}
      */
     getLast() {
-        const last = this.__circular_previous_position(this.__tail);
-        return this.__data[last];
+        const last = this.#circular_previous_position(this.#tail);
+        return this.#data[last];
     }
 }
 

package/src/core/collection/set/ArraySet.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ArraySet.d.ts","sourceRoot":"","sources":["../../../../../src/core/collection/set/ArraySet.js"],"names":[],"mappings":";AAOA;;GAEG;AACH;IAiBI;;;;;;OAMG;IACH,yBAIC;IA3BD;;OAEG;IACH;;;MAGE;IAEF;;;OAGG;IACH,aAAU;IAEV,eAAW;IAeX;;;OAGG;IACH,yBAEC;IAED;;;OAGG;IACH,oBAWC;IAED;;;OAGG;IACH,uBAWC;IAED;;;;;OAKG;IACH,wBAIC;IAED;;;OAGG;IACH,WAFa,OAAO,CAInB;IAED;;OAEG;IACH,cAIC;IAED;;;OAGG;IACH,iBAFW,QAAS,QAMnB;IAED;;;OAGG;IACH,qBAFW,QAAS,QAuBnB;IAED;;;;OAIG;IACH,2CAIC;IAED;;;OAGG;IACH,WAFa,GAAG,CAIf;CACJ;mBAjKkB,+BAA+B"}

package/src/core/collection/set/{Set.js → ArraySet.js}

@@ -8,7 +8,7 @@ import Signal from "../../events/signal/Signal.js";
 /**
  * Structure with event signals for observing changes.
  */
-class Set {
+class ArraySet {
     /**
      * @readonly
      */
@@ -167,4 +167,4 @@ class Set {
 }
 
 
-export default Set;
+export default ArraySet;

package/src/core/collection/set/set_remove.d.ts

@@ -2,8 +2,8 @@
  * Remove all elements of B from A.
  * This operation mutates A
  * @template T
- * @param {Set<T>} a
- * @param {Set<T>} b
+ * @param {Set<T>} from
+ * @param {Set<T>} to_be_removed
  */
-export function set_remove<T>(a: Set<T>, b: Set<T>): void;
+export function set_remove<T>(from: Set<T>, to_be_removed: Set<T>): void;
 //# sourceMappingURL=set_remove.d.ts.map

package/src/core/collection/set/set_remove.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"set_remove.d.ts","sourceRoot":"","sources":["../../../../../src/core/collection/set/set_remove.js"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,0DASC"}
+{"version":3,"file":"set_remove.d.ts","sourceRoot":"","sources":["../../../../../src/core/collection/set/set_remove.js"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,yEASC"}