data-structure-typed 2.1.2 → 2.2.1

package/dist/esm/index.mjs

@@ -1,10 +1,11 @@
 var __defProp = Object.defineProperty;
-var __defNormalProp = (obj, key, value) => key in obj ? __defProp(obj, key, { enumerable: true, configurable: true, writable: true, value }) : obj[key] = value;
 var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
-var __publicField = (obj, key, value) => __defNormalProp(obj, typeof key !== "symbol" ? key + "" : key, value);
 
 // src/data-structures/base/iterable-entry-base.ts
-var _IterableEntryBase = class _IterableEntryBase {
+var IterableEntryBase = class {
+  static {
+    __name(this, "IterableEntryBase");
+  }
   /**
    * Default iterator yielding `[key, value]` entries.
    * @returns Iterator of `[K, V]`.
@@ -53,7 +54,7 @@ var _IterableEntryBase = class _IterableEntryBase {
   every(predicate, thisArg) {
     let index = 0;
     for (const item of this) {
-      if (!predicate.call(thisArg, item[0], item[1], index++, this)) {
+      if (!predicate.call(thisArg, item[1], item[0], index++, this)) {
         return false;
       }
     }
@@ -69,7 +70,7 @@ var _IterableEntryBase = class _IterableEntryBase {
   some(predicate, thisArg) {
     let index = 0;
     for (const item of this) {
-      if (predicate.call(thisArg, item[0], item[1], index++, this)) {
+      if (predicate.call(thisArg, item[1], item[0], index++, this)) {
         return true;
       }
     }
@@ -85,7 +86,7 @@ var _IterableEntryBase = class _IterableEntryBase {
     let index = 0;
     for (const item of this) {
       const [key, value] = item;
-      callbackfn.call(thisArg, key, value, index++, this);
+      callbackfn.call(thisArg, value, key, index++, this);
     }
   }
   /**
@@ -99,7 +100,7 @@ var _IterableEntryBase = class _IterableEntryBase {
     let index = 0;
     for (const item of this) {
       const [key, value] = item;
-      if (callbackfn.call(thisArg, key, value, index++, this)) return item;
+      if (callbackfn.call(thisArg, value, key, index++, this)) return item;
     }
     return;
   }
@@ -173,11 +174,12 @@ var _IterableEntryBase = class _IterableEntryBase {
     console.log(this.toVisual());
   }
 };
-__name(_IterableEntryBase, "IterableEntryBase");
-var IterableEntryBase = _IterableEntryBase;
 
 // src/data-structures/base/iterable-element-base.ts
-var _IterableElementBase = class _IterableElementBase {
+var IterableElementBase = class {
+  static {
+    __name(this, "IterableElementBase");
+  }
   /**
    * Create a new iterable base.
    *
@@ -188,19 +190,19 @@ var _IterableElementBase = class _IterableElementBase {
    * Time O(1), Space O(1).
    */
   constructor(options) {
-    /**
-     * The converter used to transform a raw element (`R`) into a public element (`E`).
-     *
-     * @remarks
-     * Time O(1), Space O(1).
-     */
-    __publicField(this, "_toElementFn");
     if (options) {
       const { toElementFn } = options;
       if (typeof toElementFn === "function") this._toElementFn = toElementFn;
       else if (toElementFn) throw new TypeError("toElementFn must be a function type");
     }
   }
+  /**
+   * The converter used to transform a raw element (`R`) into a public element (`E`).
+   *
+   * @remarks
+   * Time O(1), Space O(1).
+   */
+  _toElementFn;
   /**
    * Exposes the current `toElementFn`, if configured.
    *
@@ -395,8 +397,6 @@ var _IterableElementBase = class _IterableElementBase {
     console.log(this.toVisual());
   }
 };
-__name(_IterableElementBase, "IterableElementBase");
-var IterableElementBase = _IterableElementBase;
 
 // src/utils/utils.ts
 var uuidV4 = /* @__PURE__ */ __name(function() {
@@ -517,7 +517,10 @@ function toBinaryString(num, digit = 32) {
 __name(toBinaryString, "toBinaryString");
 
 // src/data-structures/hash/hash-map.ts
-var _HashMap = class _HashMap extends IterableEntryBase {
+var HashMap = class extends IterableEntryBase {
+  static {
+    __name(this, "HashMap");
+  }
   /**
    * Create a HashMap and optionally bulk-insert entries.
    * @remarks Time O(N), Space O(N)
@@ -527,11 +530,6 @@ var _HashMap = class _HashMap extends IterableEntryBase {
    */
   constructor(entryOrRawElements = [], options) {
     super();
-    __publicField(this, "_store", {});
-    __publicField(this, "_objMap", /* @__PURE__ */ new Map());
-    __publicField(this, "_toEntryFn");
-    __publicField(this, "_size", 0);
-    __publicField(this, "_hashFn", /* @__PURE__ */ __name((key) => String(key), "_hashFn"));
     if (options) {
       const { hashFn, toEntryFn } = options;
       if (hashFn) this._hashFn = hashFn;
@@ -539,6 +537,7 @@ var _HashMap = class _HashMap extends IterableEntryBase {
     }
     if (entryOrRawElements) this.setMany(entryOrRawElements);
   }
+  _store = {};
   /**
    * Get the internal store for non-object keys.
    * @remarks Time O(1), Space O(1)
@@ -547,6 +546,7 @@ var _HashMap = class _HashMap extends IterableEntryBase {
   get store() {
     return this._store;
   }
+  _objMap = /* @__PURE__ */ new Map();
   /**
    * Get the internal Map used for object/function keys.
    * @remarks Time O(1), Space O(1)
@@ -555,6 +555,7 @@ var _HashMap = class _HashMap extends IterableEntryBase {
   get objMap() {
     return this._objMap;
   }
+  _toEntryFn;
   /**
    * Get the raw→entry converter function if present.
    * @remarks Time O(1), Space O(1)
@@ -563,6 +564,7 @@ var _HashMap = class _HashMap extends IterableEntryBase {
   get toEntryFn() {
     return this._toEntryFn;
   }
+  _size = 0;
   /**
    * Get the number of distinct keys stored.
    * @remarks Time O(1), Space O(1)
@@ -571,6 +573,7 @@ var _HashMap = class _HashMap extends IterableEntryBase {
   get size() {
     return this._size;
   }
+  _hashFn = /* @__PURE__ */ __name((key) => String(key), "_hashFn");
   /**
    * Get the current hash function for non-object keys.
    * @remarks Time O(1), Space O(1)
@@ -646,10 +649,9 @@ var _HashMap = class _HashMap extends IterableEntryBase {
    * @returns Value or undefined.
    */
   get(key) {
-    var _a;
     if (this._isObjKey(key)) return this.objMap.get(key);
     const strKey = this._getNoObjKey(key);
-    return (_a = this._store[strKey]) == null ? void 0 : _a.value;
+    return this._store[strKey]?.value;
   }
   /**
    * Check if a key exists.
@@ -713,7 +715,7 @@ var _HashMap = class _HashMap extends IterableEntryBase {
   map(callbackfn, thisArg) {
     const out = this._createLike();
     let index = 0;
-    for (const [key, value] of this) out.set(key, callbackfn.call(thisArg, key, value, index++, this));
+    for (const [key, value] of this) out.set(key, callbackfn.call(thisArg, value, key, index++, this));
     return out;
   }
   /**
@@ -726,7 +728,7 @@ var _HashMap = class _HashMap extends IterableEntryBase {
   filter(predicate, thisArg) {
     const out = this._createLike();
     let index = 0;
-    for (const [key, value] of this) if (predicate.call(thisArg, key, value, index++, this)) out.set(key, value);
+    for (const [key, value] of this) if (predicate.call(thisArg, value, key, index++, this)) out.set(key, value);
     return out;
   }
   /**
@@ -774,9 +776,11 @@ var _HashMap = class _HashMap extends IterableEntryBase {
     return strKey;
   }
 };
-__name(_HashMap, "HashMap");
-var HashMap = _HashMap;
-var _LinkedHashMap = class _LinkedHashMap extends IterableEntryBase {
+var LinkedHashMap = class extends IterableEntryBase {
+  static {
+    __name(this, "LinkedHashMap");
+  }
+  _sentinel;
   /**
    * Create a LinkedHashMap and optionally bulk-insert entries.
    * @remarks Time O(N), Space O(N)
@@ -786,22 +790,6 @@ var _LinkedHashMap = class _LinkedHashMap extends IterableEntryBase {
    */
   constructor(entryOrRawElements = [], options) {
     super();
-    __publicField(this, "_sentinel");
-    __publicField(this, "_hashFn", /* @__PURE__ */ __name((key) => String(key), "_hashFn"));
-    __publicField(this, "_objHashFn", /* @__PURE__ */ __name((key) => key, "_objHashFn"));
-    __publicField(this, "_noObjMap", {});
-    __publicField(this, "_objMap", /* @__PURE__ */ new WeakMap());
-    __publicField(this, "_head");
-    __publicField(this, "_tail");
-    __publicField(this, "_toEntryFn", /* @__PURE__ */ __name((rawElement) => {
-      if (this.isEntry(rawElement)) {
-        return rawElement;
-      }
-      throw new Error(
-        "If `entryOrRawElements` does not adhere to [key,value], provide `options.toEntryFn` to transform raw records."
-      );
-    }, "_toEntryFn"));
-    __publicField(this, "_size", 0);
     this._sentinel = {};
     this._sentinel.prev = this._sentinel.next = this._head = this._tail = this._sentinel;
     if (options) {
@@ -812,9 +800,11 @@ var _LinkedHashMap = class _LinkedHashMap extends IterableEntryBase {
     }
     if (entryOrRawElements) this.setMany(entryOrRawElements);
   }
+  _hashFn = /* @__PURE__ */ __name((key) => String(key), "_hashFn");
   get hashFn() {
     return this._hashFn;
   }
+  _objHashFn = /* @__PURE__ */ __name((key) => key, "_objHashFn");
   /**
    * Get the hash function for object/weak keys.
    * @remarks Time O(1), Space O(1)
@@ -823,6 +813,7 @@ var _LinkedHashMap = class _LinkedHashMap extends IterableEntryBase {
   get objHashFn() {
     return this._objHashFn;
   }
+  _noObjMap = {};
   /**
    * Get the internal record for non-object keys.
    * @remarks Time O(1), Space O(1)
@@ -831,9 +822,11 @@ var _LinkedHashMap = class _LinkedHashMap extends IterableEntryBase {
   get noObjMap() {
     return this._noObjMap;
   }
+  _objMap = /* @__PURE__ */ new WeakMap();
   get objMap() {
     return this._objMap;
   }
+  _head;
   /**
    * Get the head node (first entry) sentinel link.
    * @remarks Time O(1), Space O(1)
@@ -842,6 +835,7 @@ var _LinkedHashMap = class _LinkedHashMap extends IterableEntryBase {
   get head() {
     return this._head;
   }
+  _tail;
   /**
    * Get the tail node (last entry) sentinel link.
    * @remarks Time O(1), Space O(1)
@@ -850,9 +844,18 @@ var _LinkedHashMap = class _LinkedHashMap extends IterableEntryBase {
   get tail() {
     return this._tail;
   }
+  _toEntryFn = /* @__PURE__ */ __name((rawElement) => {
+    if (this.isEntry(rawElement)) {
+      return rawElement;
+    }
+    throw new Error(
+      "If `entryOrRawElements` does not adhere to [key,value], provide `options.toEntryFn` to transform raw records."
+    );
+  }, "_toEntryFn");
   get toEntryFn() {
     return this._toEntryFn;
   }
+  _size = 0;
   get size() {
     return this._size;
   }
@@ -1050,7 +1053,7 @@ var _LinkedHashMap = class _LinkedHashMap extends IterableEntryBase {
     const out = this._createLike();
     let index = 0;
     for (const [key, value] of this) {
-      if (predicate.call(thisArg, key, value, index, this)) out.set(key, value);
+      if (predicate.call(thisArg, value, key, index, this)) out.set(key, value);
       index++;
     }
     return out;
@@ -1068,7 +1071,7 @@ var _LinkedHashMap = class _LinkedHashMap extends IterableEntryBase {
     const out = this._createLike();
     let index = 0;
     for (const [key, value] of this) {
-      const [newKey, newValue] = callback.call(thisArg, key, value, index, this);
+      const [newKey, newValue] = callback.call(thisArg, value, key, index, this);
       out.set(newKey, newValue);
       index++;
     }
@@ -1095,22 +1098,22 @@ var _LinkedHashMap = class _LinkedHashMap extends IterableEntryBase {
     return new Ctor(entries, options);
   }
 };
-__name(_LinkedHashMap, "LinkedHashMap");
-var LinkedHashMap = _LinkedHashMap;
 
 // src/data-structures/base/linear-base.ts
-var _LinkedListNode = class _LinkedListNode {
+var LinkedListNode = class {
+  static {
+    __name(this, "LinkedListNode");
+  }
   /**
    * Initialize a node.
    * @param value - Element value.
    * @remarks Time O(1), Space O(1)
    */
   constructor(value) {
-    __publicField(this, "_value");
-    __publicField(this, "_next");
     this._value = value;
     this._next = void 0;
   }
+  _value;
   /**
    * Element payload getter.
    * @returns Element value.
@@ -1127,6 +1130,7 @@ var _LinkedListNode = class _LinkedListNode {
   set value(value) {
     this._value = value;
   }
+  _next;
   /**
    * Next node getter.
    * @returns Next node or `undefined`.
@@ -1144,9 +1148,10 @@ var _LinkedListNode = class _LinkedListNode {
     this._next = value;
   }
 };
-__name(_LinkedListNode, "LinkedListNode");
-var LinkedListNode = _LinkedListNode;
-var _LinearBase = class _LinearBase extends IterableElementBase {
+var LinearBase = class _LinearBase extends IterableElementBase {
+  static {
+    __name(this, "LinearBase");
+  }
   /**
    * Construct a linear container with runtime options.
    * @param options - `{ maxLen?, ... }` bounds/behavior options.
@@ -1154,12 +1159,12 @@ var _LinearBase = class _LinearBase extends IterableElementBase {
    */
   constructor(options) {
     super(options);
-    __publicField(this, "_maxLen", -1);
     if (options) {
       const { maxLen } = options;
       if (typeof maxLen === "number" && maxLen > 0 && maxLen % 1 === 0) this._maxLen = maxLen;
     }
   }
+  _maxLen = -1;
   /**
    * Upper bound for length (if positive), or `-1` when unbounded.
    * @returns Maximum allowed length.
@@ -1292,7 +1297,7 @@ var _LinearBase = class _LinearBase extends IterableElementBase {
     return array;
   }
   reduceRight(callbackfn, initialValue) {
-    let accumulator = initialValue != null ? initialValue : 0;
+    let accumulator = initialValue ?? 0;
     for (let i = this.length - 1; i >= 0; i--) {
       accumulator = callbackfn(accumulator, this.at(i), i, this);
     }
@@ -1334,9 +1339,10 @@ var _LinearBase = class _LinearBase extends IterableElementBase {
     return this;
   }
 };
-__name(_LinearBase, "LinearBase");
-var LinearBase = _LinearBase;
-var _LinearLinkedBase = class _LinearLinkedBase extends LinearBase {
+var LinearLinkedBase = class extends LinearBase {
+  static {
+    __name(this, "LinearLinkedBase");
+  }
   constructor(options) {
     super(options);
     if (options) {
@@ -1466,7 +1472,7 @@ var _LinearLinkedBase = class _LinearLinkedBase extends LinearBase {
     return removedList;
   }
   reduceRight(callbackfn, initialValue) {
-    let accumulator = initialValue != null ? initialValue : 0;
+    let accumulator = initialValue ?? 0;
     let index = this.length - 1;
     for (const item of this._getReverseIterator()) {
       accumulator = callbackfn(accumulator, item, index--, this);
@@ -1474,11 +1480,12 @@ var _LinearLinkedBase = class _LinearLinkedBase extends LinearBase {
     return accumulator;
   }
 };
-__name(_LinearLinkedBase, "LinearLinkedBase");
-var LinearLinkedBase = _LinearLinkedBase;
 
 // src/data-structures/linked-list/singly-linked-list.ts
-var _SinglyLinkedListNode = class _SinglyLinkedListNode extends LinkedListNode {
+var SinglyLinkedListNode = class extends LinkedListNode {
+  static {
+    __name(this, "SinglyLinkedListNode");
+  }
   /**
    * Create a list node.
    * @remarks Time O(1), Space O(1)
@@ -1487,10 +1494,10 @@ var _SinglyLinkedListNode = class _SinglyLinkedListNode extends LinkedListNode {
    */
   constructor(value) {
     super(value);
-    __publicField(this, "_next");
     this._value = value;
     this._next = void 0;
   }
+  _next;
   /**
    * Get the next node.
    * @remarks Time O(1), Space O(1)
@@ -1509,9 +1516,11 @@ var _SinglyLinkedListNode = class _SinglyLinkedListNode extends LinkedListNode {
     this._next = value;
   }
 };
-__name(_SinglyLinkedListNode, "SinglyLinkedListNode");
-var SinglyLinkedListNode = _SinglyLinkedListNode;
-var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
+var SinglyLinkedList = class extends LinearLinkedBase {
+  static {
+    __name(this, "SinglyLinkedList");
+  }
+  _equals = Object.is;
   /**
    * Create a SinglyLinkedList and optionally bulk-insert elements.
    * @remarks Time O(N), Space O(N)
@@ -1521,12 +1530,9 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
    */
   constructor(elements = [], options) {
     super(options);
-    __publicField(this, "_equals", Object.is);
-    __publicField(this, "_head");
-    __publicField(this, "_tail");
-    __publicField(this, "_length", 0);
     this.pushMany(elements);
   }
+  _head;
   /**
    * Get the head node.
    * @remarks Time O(1), Space O(1)
@@ -1535,6 +1541,7 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
   get head() {
     return this._head;
   }
+  _tail;
   /**
    * Get the tail node.
    * @remarks Time O(1), Space O(1)
@@ -1543,6 +1550,7 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
   get tail() {
     return this._tail;
   }
+  _length = 0;
   /**
    * Get the number of elements.
    * @remarks Time O(1), Space O(1)
@@ -1557,8 +1565,7 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
    * @returns First element or undefined.
    */
   get first() {
-    var _a;
-    return (_a = this.head) == null ? void 0 : _a.value;
+    return this.head?.value;
   }
   /**
    * Get the last element value.
@@ -1566,8 +1573,7 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
    * @returns Last element or undefined.
    */
   get last() {
-    var _a;
-    return (_a = this.tail) == null ? void 0 : _a.value;
+    return this.tail?.value;
   }
   /**
    * Create a new list from an iterable of elements.
@@ -2046,7 +2052,7 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
    * @returns A new SinglyLinkedList with mapped values.
    */
   map(callback, options, thisArg) {
-    const out = this._createLike([], { ...options != null ? options : {}, maxLen: this._maxLen });
+    const out = this._createLike([], { ...options ?? {}, maxLen: this._maxLen });
     let index = 0;
     for (const value of this) out.push(callback.call(thisArg, value, index++, this));
     return out;
@@ -2171,8 +2177,6 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     return this._createLike([], options);
   }
 };
-__name(_SinglyLinkedList, "SinglyLinkedList");
-var SinglyLinkedList = _SinglyLinkedList;
 function elementOrPredicate(input, equals) {
   if (input instanceof SinglyLinkedListNode) return (node) => node === input;
   if (typeof input === "function") return input;
@@ -2182,7 +2186,10 @@ function elementOrPredicate(input, equals) {
 __name(elementOrPredicate, "elementOrPredicate");
 
 // src/data-structures/linked-list/doubly-linked-list.ts
-var _DoublyLinkedListNode = class _DoublyLinkedListNode extends LinkedListNode {
+var DoublyLinkedListNode = class extends LinkedListNode {
+  static {
+    __name(this, "DoublyLinkedListNode");
+  }
   /**
    * Create a node.
    * @remarks Time O(1), Space O(1)
@@ -2191,12 +2198,11 @@ var _DoublyLinkedListNode = class _DoublyLinkedListNode extends LinkedListNode {
    */
   constructor(value) {
     super(value);
-    __publicField(this, "_next");
-    __publicField(this, "_prev");
     this._value = value;
     this._next = void 0;
     this._prev = void 0;
   }
+  _next;
   /**
    * Get the next node link.
    * @remarks Time O(1), Space O(1)
@@ -2214,6 +2220,7 @@ var _DoublyLinkedListNode = class _DoublyLinkedListNode extends LinkedListNode {
   set next(value) {
     this._next = value;
   }
+  _prev;
   /**
    * Get the previous node link.
    * @remarks Time O(1), Space O(1)
@@ -2232,9 +2239,11 @@ var _DoublyLinkedListNode = class _DoublyLinkedListNode extends LinkedListNode {
     this._prev = value;
   }
 };
-__name(_DoublyLinkedListNode, "DoublyLinkedListNode");
-var DoublyLinkedListNode = _DoublyLinkedListNode;
-var _DoublyLinkedList = class _DoublyLinkedList extends LinearLinkedBase {
+var DoublyLinkedList = class extends LinearLinkedBase {
+  static {
+    __name(this, "DoublyLinkedList");
+  }
+  _equals = Object.is;
   /**
    * Create a DoublyLinkedList and optionally bulk-insert elements.
    * @remarks Time O(N), Space O(N)
@@ -2244,18 +2253,15 @@ var _DoublyLinkedList = class _DoublyLinkedList extends LinearLinkedBase {
    */
   constructor(elements = [], options) {
     super(options);
-    __publicField(this, "_equals", Object.is);
-    __publicField(this, "_head");
-    __publicField(this, "_tail");
-    __publicField(this, "_length", 0);
     this._head = void 0;
     this._tail = void 0;
     this._length = 0;
-    if ((options == null ? void 0 : options.maxLen) && Number.isInteger(options.maxLen) && options.maxLen > 0) {
+    if (options?.maxLen && Number.isInteger(options.maxLen) && options.maxLen > 0) {
       this._maxLen = options.maxLen;
     }
     this.pushMany(elements);
   }
+  _head;
   /**
    * Get the head node.
    * @remarks Time O(1), Space O(1)
@@ -2264,6 +2270,7 @@ var _DoublyLinkedList = class _DoublyLinkedList extends LinearLinkedBase {
   get head() {
     return this._head;
   }
+  _tail;
   /**
    * Get the tail node.
    * @remarks Time O(1), Space O(1)
@@ -2272,6 +2279,7 @@ var _DoublyLinkedList = class _DoublyLinkedList extends LinearLinkedBase {
   get tail() {
     return this._tail;
   }
+  _length = 0;
   /**
    * Get the number of elements.
    * @remarks Time O(1), Space O(1)
@@ -2286,8 +2294,7 @@ var _DoublyLinkedList = class _DoublyLinkedList extends LinearLinkedBase {
    * @returns First element or undefined.
    */
   get first() {
-    var _a;
-    return (_a = this.head) == null ? void 0 : _a.value;
+    return this.head?.value;
   }
   /**
    * Get the last element value.
@@ -2295,8 +2302,7 @@ var _DoublyLinkedList = class _DoublyLinkedList extends LinearLinkedBase {
    * @returns Last element or undefined.
    */
   get last() {
-    var _a;
-    return (_a = this.tail) == null ? void 0 : _a.value;
+    return this.tail?.value;
   }
   /**
    * Create a new list from an array of elements.
@@ -2711,7 +2717,7 @@ var _DoublyLinkedList = class _DoublyLinkedList extends LinearLinkedBase {
    * @returns A new DoublyLinkedList with mapped values.
    */
   map(callback, options, thisArg) {
-    const out = this._createLike([], { ...options != null ? options : {}, maxLen: this._maxLen });
+    const out = this._createLike([], { ...options ?? {}, maxLen: this._maxLen });
     let index = 0;
     for (const v of this) out.push(callback.call(thisArg, v, index++, this));
     return out;
@@ -2797,28 +2803,26 @@ var _DoublyLinkedList = class _DoublyLinkedList extends LinearLinkedBase {
     }
   }
 };
-__name(_DoublyLinkedList, "DoublyLinkedList");
-var DoublyLinkedList = _DoublyLinkedList;
 
 // src/data-structures/linked-list/skip-linked-list.ts
-var _SkipListNode = class _SkipListNode {
+var SkipListNode = class {
+  static {
+    __name(this, "SkipListNode");
+  }
+  key;
+  value;
+  forward;
   constructor(key, value, level) {
-    __publicField(this, "key");
-    __publicField(this, "value");
-    __publicField(this, "forward");
     this.key = key;
     this.value = value;
     this.forward = new Array(level);
   }
 };
-__name(_SkipListNode, "SkipListNode");
-var SkipListNode = _SkipListNode;
-var _SkipList = class _SkipList {
+var SkipList = class {
+  static {
+    __name(this, "SkipList");
+  }
   constructor(elements = [], options) {
-    __publicField(this, "_head", new SkipListNode(void 0, void 0, this.maxLevel));
-    __publicField(this, "_level", 0);
-    __publicField(this, "_maxLevel", 16);
-    __publicField(this, "_probability", 0.5);
     if (options) {
       const { maxLevel, probability } = options;
       if (typeof maxLevel === "number") this._maxLevel = maxLevel;
@@ -2828,15 +2832,19 @@ var _SkipList = class _SkipList {
       for (const [key, value] of elements) this.add(key, value);
     }
   }
+  _head = new SkipListNode(void 0, void 0, this.maxLevel);
   get head() {
     return this._head;
   }
+  _level = 0;
   get level() {
     return this._level;
   }
+  _maxLevel = 16;
   get maxLevel() {
     return this._maxLevel;
   }
+  _probability = 0.5;
   get probability() {
     return this._probability;
   }
@@ -2942,11 +2950,13 @@ var _SkipList = class _SkipList {
     return level;
   }
 };
-__name(_SkipList, "SkipList");
-var SkipList = _SkipList;
 
 // src/data-structures/stack/stack.ts
-var _Stack = class _Stack extends IterableElementBase {
+var Stack = class extends IterableElementBase {
+  static {
+    __name(this, "Stack");
+  }
+  _equals = Object.is;
   /**
    * Create a Stack and optionally bulk-push elements.
    * @remarks Time O(N), Space O(N)
@@ -2956,10 +2966,9 @@ var _Stack = class _Stack extends IterableElementBase {
    */
   constructor(elements = [], options) {
     super(options);
-    __publicField(this, "_equals", Object.is);
-    __publicField(this, "_elements", []);
     this.pushMany(elements);
   }
+  _elements = [];
   /**
    * Get the backing array of elements.
    * @remarks Time O(1), Space O(1)
@@ -3134,7 +3143,7 @@ var _Stack = class _Stack extends IterableElementBase {
    * @returns A new Stack with mapped elements.
    */
   map(callback, options, thisArg) {
-    const out = this._createLike([], { ...options != null ? options : {} });
+    const out = this._createLike([], { ...options ?? {} });
     let index = 0;
     for (const v of this) {
       out.push(thisArg === void 0 ? callback(v, index, this) : callback.call(thisArg, v, index, this));
@@ -3194,11 +3203,12 @@ var _Stack = class _Stack extends IterableElementBase {
     for (let i = 0; i < this.elements.length; i++) yield this.elements[i];
   }
 };
-__name(_Stack, "Stack");
-var Stack = _Stack;
 
 // src/data-structures/queue/queue.ts
-var _Queue = class _Queue extends LinearBase {
+var Queue = class _Queue extends LinearBase {
+  static {
+    __name(this, "Queue");
+  }
   /**
    * Create a Queue and optionally bulk-insert elements.
    * @remarks Time O(N), Space O(N)
@@ -3208,15 +3218,13 @@ var _Queue = class _Queue extends LinearBase {
    */
   constructor(elements = [], options) {
     super(options);
-    __publicField(this, "_elements", []);
-    __publicField(this, "_offset", 0);
-    __publicField(this, "_autoCompactRatio", 0.5);
     if (options) {
       const { autoCompactRatio = 0.5 } = options;
       this._autoCompactRatio = autoCompactRatio;
     }
     this.pushMany(elements);
   }
+  _elements = [];
   /**
    * Get the underlying array buffer.
    * @remarks Time O(1), Space O(1)
@@ -3225,6 +3233,7 @@ var _Queue = class _Queue extends LinearBase {
   get elements() {
     return this._elements;
   }
+  _offset = 0;
   /**
    * Get the current start offset into the array.
    * @remarks Time O(1), Space O(1)
@@ -3233,6 +3242,7 @@ var _Queue = class _Queue extends LinearBase {
   get offset() {
     return this._offset;
   }
+  _autoCompactRatio = 0.5;
   /**
    * Get the compaction threshold (offset/size).
    * @remarks Time O(1), Space O(1)
@@ -3477,11 +3487,10 @@ var _Queue = class _Queue extends LinearBase {
    * @returns A new Queue with mapped elements.
    */
   map(callback, options, thisArg) {
-    var _a, _b;
     const out = new this.constructor([], {
-      toElementFn: options == null ? void 0 : options.toElementFn,
-      maxLen: (_a = options == null ? void 0 : options.maxLen) != null ? _a : this._maxLen,
-      autoCompactRatio: (_b = options == null ? void 0 : options.autoCompactRatio) != null ? _b : this._autoCompactRatio
+      toElementFn: options?.toElementFn,
+      maxLen: options?.maxLen ?? this._maxLen,
+      autoCompactRatio: options?.autoCompactRatio ?? this._autoCompactRatio
     });
     let index = 0;
     for (const v of this)
@@ -3496,14 +3505,13 @@ var _Queue = class _Queue extends LinearBase {
    * @returns A new queue with mapped elements (same element type).
    */
   mapSame(callback, thisArg) {
-    var _a;
     const Ctor = this.constructor;
     const out = new Ctor([], {
       toElementFn: this.toElementFn,
       maxLen: this._maxLen,
       autoCompactRatio: this._autoCompactRatio
     });
-    (_a = out._setAutoCompactRatio) == null ? void 0 : _a.call(out, this._autoCompactRatio);
+    out._setAutoCompactRatio?.(this._autoCompactRatio);
     let index = 0;
     for (const v of this) {
       const mv = thisArg === void 0 ? callback(v, index++, this) : callback.call(thisArg, v, index++, this);
@@ -3563,9 +3571,10 @@ var _Queue = class _Queue extends LinearBase {
     return new Ctor(elements, options);
   }
 };
-__name(_Queue, "Queue");
-var Queue = _Queue;
-var _LinkedListQueue = class _LinkedListQueue extends SinglyLinkedList {
+var LinkedListQueue = class extends SinglyLinkedList {
+  static {
+    __name(this, "LinkedListQueue");
+  }
   /**
    * Deep clone this linked-list-based queue.
    * @remarks Time O(N), Space O(N)
@@ -3577,11 +3586,13 @@ var _LinkedListQueue = class _LinkedListQueue extends SinglyLinkedList {
     return out;
   }
 };
-__name(_LinkedListQueue, "LinkedListQueue");
-var LinkedListQueue = _LinkedListQueue;
 
 // src/data-structures/queue/deque.ts
-var _Deque = class _Deque extends LinearBase {
+var Deque = class extends LinearBase {
+  static {
+    __name(this, "Deque");
+  }
+  _equals = Object.is;
   /**
    * Create a Deque and optionally bulk-insert elements.
    * @remarks Time O(N), Space O(N)
@@ -3591,15 +3602,6 @@ var _Deque = class _Deque extends LinearBase {
    */
   constructor(elements = [], options) {
     super(options);
-    __publicField(this, "_equals", Object.is);
-    __publicField(this, "_bucketSize", 1 << 12);
-    __publicField(this, "_bucketFirst", 0);
-    __publicField(this, "_firstInBucket", 0);
-    __publicField(this, "_bucketLast", 0);
-    __publicField(this, "_lastInBucket", 0);
-    __publicField(this, "_bucketCount", 0);
-    __publicField(this, "_buckets", []);
-    __publicField(this, "_length", 0);
     if (options) {
       const { bucketSize } = options;
       if (typeof bucketSize === "number") this._bucketSize = bucketSize;
@@ -3619,6 +3621,7 @@ var _Deque = class _Deque extends LinearBase {
     this._firstInBucket = this._lastInBucket = this._bucketSize - _size % this._bucketSize >> 1;
     this.pushMany(elements);
   }
+  _bucketSize = 1 << 12;
   /**
    * Get the current bucket size.
    * @remarks Time O(1), Space O(1)
@@ -3627,6 +3630,7 @@ var _Deque = class _Deque extends LinearBase {
   get bucketSize() {
     return this._bucketSize;
   }
+  _bucketFirst = 0;
   /**
    * Get the index of the first bucket in use.
    * @remarks Time O(1), Space O(1)
@@ -3635,6 +3639,7 @@ var _Deque = class _Deque extends LinearBase {
   get bucketFirst() {
     return this._bucketFirst;
   }
+  _firstInBucket = 0;
   /**
    * Get the index inside the first bucket.
    * @remarks Time O(1), Space O(1)
@@ -3643,6 +3648,7 @@ var _Deque = class _Deque extends LinearBase {
   get firstInBucket() {
     return this._firstInBucket;
   }
+  _bucketLast = 0;
   /**
    * Get the index of the last bucket in use.
    * @remarks Time O(1), Space O(1)
@@ -3651,6 +3657,7 @@ var _Deque = class _Deque extends LinearBase {
   get bucketLast() {
     return this._bucketLast;
   }
+  _lastInBucket = 0;
   /**
    * Get the index inside the last bucket.
    * @remarks Time O(1), Space O(1)
@@ -3659,6 +3666,7 @@ var _Deque = class _Deque extends LinearBase {
   get lastInBucket() {
     return this._lastInBucket;
   }
+  _bucketCount = 0;
   /**
    * Get the number of buckets allocated.
    * @remarks Time O(1), Space O(1)
@@ -3667,6 +3675,7 @@ var _Deque = class _Deque extends LinearBase {
   get bucketCount() {
     return this._bucketCount;
   }
+  _buckets = [];
   /**
    * Get the internal buckets array.
    * @remarks Time O(1), Space O(1)
@@ -3675,6 +3684,7 @@ var _Deque = class _Deque extends LinearBase {
   get buckets() {
     return this._buckets;
   }
+  _length = 0;
   /**
    * Get the number of elements in the deque.
    * @remarks Time O(1), Space O(1)
@@ -4190,7 +4200,7 @@ var _Deque = class _Deque extends LinearBase {
    */
   map(callback, options, thisArg) {
     const out = this._createLike([], {
-      ...options != null ? options : {},
+      ...options ?? {},
       bucketSize: this._bucketSize,
       maxLen: this._maxLen
     });
@@ -4304,11 +4314,13 @@ var _Deque = class _Deque extends LinearBase {
     }
   }
 };
-__name(_Deque, "Deque");
-var Deque = _Deque;
 
 // src/data-structures/heap/heap.ts
-var _Heap = class _Heap extends IterableElementBase {
+var Heap = class _Heap extends IterableElementBase {
+  static {
+    __name(this, "Heap");
+  }
+  _equals = Object.is;
   /**
    * Create a Heap and optionally bulk-insert elements.
    * @remarks Time O(N), Space O(N)
@@ -4318,23 +4330,13 @@ var _Heap = class _Heap extends IterableElementBase {
    */
   constructor(elements = [], options) {
     super(options);
-    __publicField(this, "_equals", Object.is);
-    __publicField(this, "_elements", []);
-    __publicField(this, "_DEFAULT_COMPARATOR", /* @__PURE__ */ __name((a, b) => {
-      if (typeof a === "object" || typeof b === "object") {
-        throw TypeError("When comparing object types, define a custom comparator in options.");
-      }
-      if (a > b) return 1;
-      if (a < b) return -1;
-      return 0;
-    }, "_DEFAULT_COMPARATOR"));
-    __publicField(this, "_comparator", this._DEFAULT_COMPARATOR);
     if (options) {
       const { comparator } = options;
       if (comparator) this._comparator = comparator;
     }
     this.addMany(elements);
   }
+  _elements = [];
   /**
    * Get the backing array of the heap.
    * @remarks Time O(1), Space O(1)
@@ -4357,8 +4359,7 @@ var _Heap = class _Heap extends IterableElementBase {
    * @returns Last element or undefined.
    */
   get leaf() {
-    var _a;
-    return (_a = this.elements[this.size - 1]) != null ? _a : void 0;
+    return this.elements[this.size - 1] ?? void 0;
   }
   /**
    * Create a heap of the same class from an iterable.
@@ -4631,7 +4632,7 @@ var _Heap = class _Heap extends IterableElementBase {
    * @returns A new heap with mapped elements.
    */
   map(callback, options, thisArg) {
-    const { comparator, toElementFn, ...rest } = options != null ? options : {};
+    const { comparator, toElementFn, ...rest } = options ?? {};
     if (!comparator) throw new TypeError("Heap.map requires options.comparator for EM");
     const out = this._createLike([], { ...rest, comparator, toElementFn });
     let i = 0;
@@ -4657,6 +4658,15 @@ var _Heap = class _Heap extends IterableElementBase {
     }
     return out;
   }
+  _DEFAULT_COMPARATOR = /* @__PURE__ */ __name((a, b) => {
+    if (typeof a === "object" || typeof b === "object") {
+      throw TypeError("When comparing object types, define a custom comparator in options.");
+    }
+    if (a > b) return 1;
+    if (a < b) return -1;
+    return 0;
+  }, "_DEFAULT_COMPARATOR");
+  _comparator = this._DEFAULT_COMPARATOR;
   /**
   * Get the comparator used to order elements.
   * @remarks Time O(1), Space O(1)
@@ -4710,7 +4720,7 @@ var _Heap = class _Heap extends IterableElementBase {
    */
   _createInstance(options) {
     const Ctor = this.constructor;
-    const next = new Ctor([], { comparator: this.comparator, toElementFn: this.toElementFn, ...options != null ? options : {} });
+    const next = new Ctor([], { comparator: this.comparator, toElementFn: this.toElementFn, ...options ?? {} });
     return next;
   }
   /**
@@ -4738,25 +4748,27 @@ var _Heap = class _Heap extends IterableElementBase {
     return this._createLike([], options);
   }
 };
-__name(_Heap, "Heap");
-var Heap = _Heap;
-var _FibonacciHeapNode = class _FibonacciHeapNode {
+var FibonacciHeapNode = class {
+  static {
+    __name(this, "FibonacciHeapNode");
+  }
+  element;
+  degree;
+  left;
+  right;
+  child;
+  parent;
+  marked;
   constructor(element, degree = 0) {
-    __publicField(this, "element");
-    __publicField(this, "degree");
-    __publicField(this, "left");
-    __publicField(this, "right");
-    __publicField(this, "child");
-    __publicField(this, "parent");
-    __publicField(this, "marked");
     this.element = element;
     this.degree = degree;
     this.marked = false;
   }
 };
-__name(_FibonacciHeapNode, "FibonacciHeapNode");
-var FibonacciHeapNode = _FibonacciHeapNode;
-var _FibonacciHeap = class _FibonacciHeap {
+var FibonacciHeap = class {
+  static {
+    __name(this, "FibonacciHeap");
+  }
   /**
    * Create a FibonacciHeap.
    * @remarks Time O(1), Space O(1)
@@ -4764,14 +4776,11 @@ var _FibonacciHeap = class _FibonacciHeap {
    * @returns New FibonacciHeap instance.
    */
   constructor(comparator) {
-    __publicField(this, "_root");
-    __publicField(this, "_size", 0);
-    __publicField(this, "_min");
-    __publicField(this, "_comparator");
     this.clear();
     this._comparator = comparator || this._defaultComparator;
     if (typeof this.comparator !== "function") throw new Error("FibonacciHeap: comparator must be a function.");
   }
+  _root;
   /**
    * Get the circular root list head.
    * @remarks Time O(1), Space O(1)
@@ -4780,9 +4789,11 @@ var _FibonacciHeap = class _FibonacciHeap {
   get root() {
     return this._root;
   }
+  _size = 0;
   get size() {
     return this._size;
   }
+  _min;
   /**
    * Get the current minimum node.
    * @remarks Time O(1), Space O(1)
@@ -4791,6 +4802,7 @@ var _FibonacciHeap = class _FibonacciHeap {
   get min() {
     return this._min;
   }
+  _comparator;
   get comparator() {
     return this._comparator;
   }
@@ -4967,11 +4979,12 @@ var _FibonacciHeap = class _FibonacciHeap {
     }
   }
 };
-__name(_FibonacciHeap, "FibonacciHeap");
-var FibonacciHeap = _FibonacciHeap;
 
 // src/data-structures/heap/max-heap.ts
-var _MaxHeap = class _MaxHeap extends Heap {
+var MaxHeap = class extends Heap {
+  static {
+    __name(this, "MaxHeap");
+  }
   /**
    * Create a max-heap. For objects, supply a custom comparator.
    * @param elements Optional initial elements.
@@ -4993,11 +5006,12 @@ var _MaxHeap = class _MaxHeap extends Heap {
     });
   }
 };
-__name(_MaxHeap, "MaxHeap");
-var MaxHeap = _MaxHeap;
 
 // src/data-structures/heap/min-heap.ts
-var _MinHeap = class _MinHeap extends Heap {
+var MinHeap = class extends Heap {
+  static {
+    __name(this, "MinHeap");
+  }
   /**
    * Create a min-heap.
    * @param elements Optional initial elements.
@@ -5007,36 +5021,39 @@ var _MinHeap = class _MinHeap extends Heap {
     super(elements, options);
   }
 };
-__name(_MinHeap, "MinHeap");
-var MinHeap = _MinHeap;
 
 // src/data-structures/graph/abstract-graph.ts
-var _AbstractVertex = class _AbstractVertex {
+var AbstractVertex = class {
+  static {
+    __name(this, "AbstractVertex");
+  }
+  key;
+  value;
   constructor(key, value) {
-    __publicField(this, "key");
-    __publicField(this, "value");
     this.key = key;
     this.value = value;
   }
 };
-__name(_AbstractVertex, "AbstractVertex");
-var AbstractVertex = _AbstractVertex;
-var _AbstractEdge = class _AbstractEdge {
+var AbstractEdge = class {
+  static {
+    __name(this, "AbstractEdge");
+  }
+  value;
+  weight;
   constructor(weight, value) {
-    __publicField(this, "value");
-    __publicField(this, "weight");
-    __publicField(this, "_hashCode");
     this.weight = weight !== void 0 ? weight : 1;
     this.value = value;
     this._hashCode = uuidV4();
   }
+  _hashCode;
   get hashCode() {
     return this._hashCode;
   }
 };
-__name(_AbstractEdge, "AbstractEdge");
-var AbstractEdge = _AbstractEdge;
-var _AbstractGraph = class _AbstractGraph extends IterableEntryBase {
+var AbstractGraph = class extends IterableEntryBase {
+  static {
+    __name(this, "AbstractGraph");
+  }
   /**
    * Construct a graph with runtime defaults.
    * @param options - `GraphOptions<V>` in `options.graph` (e.g. `vertexValueInitializer`, `defaultEdgeWeight`).
@@ -5044,14 +5061,14 @@ var _AbstractGraph = class _AbstractGraph extends IterableEntryBase {
    */
   constructor(options) {
     super();
-    __publicField(this, "_options", { defaultEdgeWeight: 1 });
-    __publicField(this, "_vertexMap", /* @__PURE__ */ new Map());
-    const graph = options == null ? void 0 : options.graph;
-    this._options = { defaultEdgeWeight: 1, ...graph != null ? graph : {} };
+    const graph = options?.graph;
+    this._options = { defaultEdgeWeight: 1, ...graph ?? {} };
   }
+  _options = { defaultEdgeWeight: 1 };
   get options() {
     return this._options;
   }
+  _vertexMap = /* @__PURE__ */ new Map();
   get vertexMap() {
     return this._vertexMap;
   }
@@ -5209,10 +5226,9 @@ var _AbstractGraph = class _AbstractGraph extends IterableEntryBase {
    * @remarks Time O(L), Space O(1) where L is path length
    */
   getPathSumWeight(path) {
-    var _a;
     let sum = 0;
     for (let i = 0; i < path.length; i++) {
-      sum += ((_a = this.getEdge(path[i], path[i + 1])) == null ? void 0 : _a.weight) || 0;
+      sum += this.getEdge(path[i], path[i + 1])?.weight || 0;
     }
     return sum;
   }
@@ -5274,7 +5290,6 @@ var _AbstractGraph = class _AbstractGraph extends IterableEntryBase {
    * @remarks Time O((V + E) log V) weighted / O(V + E) unweighted, Space O(V + E)
    */
   getMinPathBetween(v1, v2, isWeight, isDFS = false) {
-    var _a, _b;
     if (isWeight === void 0) isWeight = false;
     if (isWeight) {
       if (isDFS) {
@@ -5292,7 +5307,7 @@ var _AbstractGraph = class _AbstractGraph extends IterableEntryBase {
         }
         return allPaths[minIndex] || void 0;
       } else {
-        return (_b = (_a = this.dijkstra(v1, v2, true, true)) == null ? void 0 : _a.minPath) != null ? _b : [];
+        return this.dijkstra(v1, v2, true, true)?.minPath ?? [];
       }
     } else {
       let minPath = [];
@@ -5421,7 +5436,6 @@ var _AbstractGraph = class _AbstractGraph extends IterableEntryBase {
     return { distMap, preMap, seen, paths, minDist, minPath };
   }
   dijkstra(src, dest = void 0, getMinDist = false, genPaths = false) {
-    var _a;
     let minDist = Number.MAX_SAFE_INTEGER;
     let minDest = void 0;
     let minPath = [];
@@ -5459,8 +5473,8 @@ var _AbstractGraph = class _AbstractGraph extends IterableEntryBase {
     }, "getPaths");
     while (heap.size > 0) {
       const curHeapNode = heap.poll();
-      const dist = curHeapNode == null ? void 0 : curHeapNode.key;
-      const cur = curHeapNode == null ? void 0 : curHeapNode.value;
+      const dist = curHeapNode?.key;
+      const cur = curHeapNode?.value;
       if (dist !== void 0) {
         if (cur) {
           seen.add(cur);
@@ -5476,7 +5490,7 @@ var _AbstractGraph = class _AbstractGraph extends IterableEntryBase {
           const neighbors = this.getNeighbors(cur);
           for (const neighbor of neighbors) {
             if (!seen.has(neighbor)) {
-              const weight = (_a = this.getEdge(cur, neighbor)) == null ? void 0 : _a.weight;
+              const weight = this.getEdge(cur, neighbor)?.weight;
               if (typeof weight === "number") {
                 const distSrcToNeighbor = distMap.get(neighbor);
                 if (distSrcToNeighbor !== void 0) {
@@ -5599,7 +5613,6 @@ var _AbstractGraph = class _AbstractGraph extends IterableEntryBase {
    * @remarks Time O(V^3), Space O(V^2)
    */
   floydWarshall() {
-    var _a;
     const idAndVertices = [...this._vertexMap];
     const n = idAndVertices.length;
     const costs = [];
@@ -5613,7 +5626,7 @@ var _AbstractGraph = class _AbstractGraph extends IterableEntryBase {
     }
     for (let i = 0; i < n; i++) {
       for (let j = 0; j < n; j++) {
-        costs[i][j] = ((_a = this.getEdge(idAndVertices[i][1], idAndVertices[j][1])) == null ? void 0 : _a.weight) || Number.MAX_SAFE_INTEGER;
+        costs[i][j] = this.getEdge(idAndVertices[i][1], idAndVertices[j][1])?.weight || Number.MAX_SAFE_INTEGER;
       }
     }
     for (let k = 0; k < n; k++) {
@@ -5677,7 +5690,7 @@ var _AbstractGraph = class _AbstractGraph extends IterableEntryBase {
     const filtered = [];
     let index = 0;
     for (const [key, value] of this) {
-      if (predicate.call(thisArg, key, value, index, this)) {
+      if (predicate.call(thisArg, value, key, index, this)) {
         filtered.push([key, value]);
       }
       index++;
@@ -5692,7 +5705,7 @@ var _AbstractGraph = class _AbstractGraph extends IterableEntryBase {
     const filtered = [];
     let index = 0;
     for (const [key, value] of this) {
-      if (predicate.call(thisArg, key, value, index, this)) {
+      if (predicate.call(thisArg, value, key, index, this)) {
         filtered.push([key, value]);
       }
       index++;
@@ -5703,7 +5716,7 @@ var _AbstractGraph = class _AbstractGraph extends IterableEntryBase {
     const mapped = [];
     let index = 0;
     for (const [key, value] of this) {
-      mapped.push(callback.call(thisArg, key, value, index, this));
+      mapped.push(callback.call(thisArg, value, key, index, this));
       index++;
     }
     return mapped;
@@ -5756,7 +5769,7 @@ var _AbstractGraph = class _AbstractGraph extends IterableEntryBase {
   _createInstance(_options) {
     const Ctor = this.constructor;
     const instance = new Ctor();
-    const graph = _options == null ? void 0 : _options.graph;
+    const graph = _options?.graph;
     if (graph) instance._options = { ...instance._options, ...graph };
     else instance._options = { ...instance._options, ...this._options };
     return instance;
@@ -5835,29 +5848,32 @@ var _AbstractGraph = class _AbstractGraph extends IterableEntryBase {
     return vertexOrKey instanceof AbstractVertex ? vertexOrKey.key : vertexOrKey;
   }
 };
-__name(_AbstractGraph, "AbstractGraph");
-var AbstractGraph = _AbstractGraph;
 
 // src/data-structures/graph/directed-graph.ts
-var _DirectedVertex = class _DirectedVertex extends AbstractVertex {
+var DirectedVertex = class extends AbstractVertex {
+  static {
+    __name(this, "DirectedVertex");
+  }
   constructor(key, value) {
     super(key, value);
   }
 };
-__name(_DirectedVertex, "DirectedVertex");
-var DirectedVertex = _DirectedVertex;
-var _DirectedEdge = class _DirectedEdge extends AbstractEdge {
+var DirectedEdge = class extends AbstractEdge {
+  static {
+    __name(this, "DirectedEdge");
+  }
+  src;
+  dest;
   constructor(src, dest, weight, value) {
     super(weight, value);
-    __publicField(this, "src");
-    __publicField(this, "dest");
     this.src = src;
     this.dest = dest;
   }
 };
-__name(_DirectedEdge, "DirectedEdge");
-var DirectedEdge = _DirectedEdge;
-var _DirectedGraph = class _DirectedGraph extends AbstractGraph {
+var DirectedGraph = class _DirectedGraph extends AbstractGraph {
+  static {
+    __name(this, "DirectedGraph");
+  }
   /**
    * Construct a directed graph with runtime defaults.
    * @param options - `GraphOptions<V>` (e.g. `vertexValueInitializer`, `defaultEdgeWeight`).
@@ -5865,15 +5881,15 @@ var _DirectedGraph = class _DirectedGraph extends AbstractGraph {
    */
   constructor(options) {
     super(options);
-    __publicField(this, "_outEdgeMap", /* @__PURE__ */ new Map());
-    __publicField(this, "_inEdgeMap", /* @__PURE__ */ new Map());
   }
+  _outEdgeMap = /* @__PURE__ */ new Map();
   get outEdgeMap() {
     return this._outEdgeMap;
   }
   set outEdgeMap(v) {
     this._outEdgeMap = v;
   }
+  _inEdgeMap = /* @__PURE__ */ new Map();
   get inEdgeMap() {
     return this._inEdgeMap;
   }
@@ -5926,8 +5942,7 @@ var _DirectedGraph = class _DirectedGraph extends AbstractGraph {
    * @remarks Time O(1), Space O(1)
    */
   createEdge(src, dest, weight, value) {
-    var _a;
-    return new DirectedEdge(src, dest, (_a = weight != null ? weight : this.options.defaultEdgeWeight) != null ? _a : 1, value);
+    return new DirectedEdge(src, dest, weight ?? this.options.defaultEdgeWeight ?? 1, value);
   }
   /**
    * Get the unique edge from `src` to `dest`, if present.
@@ -5998,7 +6013,7 @@ var _DirectedGraph = class _DirectedGraph extends AbstractGraph {
     if (src && dest) {
       const srcOutEdges = this._outEdgeMap.get(src);
       if (srcOutEdges && srcOutEdges.length > 0) {
-        arrayRemove(srcOutEdges, (edge) => edge.src === src.key && edge.dest === (dest == null ? void 0 : dest.key));
+        arrayRemove(srcOutEdges, (edge) => edge.src === src.key && edge.dest === dest?.key);
       }
       const destInEdges = this._inEdgeMap.get(dest);
       if (destInEdges && destInEdges.length > 0) {
@@ -6120,7 +6135,7 @@ var _DirectedGraph = class _DirectedGraph extends AbstractGraph {
    * @remarks Time O(V + E), Space O(V)
    */
   topologicalSort(propertyName) {
-    propertyName = propertyName != null ? propertyName : "key";
+    propertyName = propertyName ?? "key";
     const statusMap = /* @__PURE__ */ new Map();
     for (const entry of this.vertexMap) {
       statusMap.set(entry[1], 0);
@@ -6313,27 +6328,30 @@ var _DirectedGraph = class _DirectedGraph extends AbstractGraph {
     }
   }
 };
-__name(_DirectedGraph, "DirectedGraph");
-var DirectedGraph = _DirectedGraph;
 
 // src/data-structures/graph/undirected-graph.ts
-var _UndirectedVertex = class _UndirectedVertex extends AbstractVertex {
+var UndirectedVertex = class extends AbstractVertex {
+  static {
+    __name(this, "UndirectedVertex");
+  }
   constructor(key, value) {
     super(key, value);
   }
 };
-__name(_UndirectedVertex, "UndirectedVertex");
-var UndirectedVertex = _UndirectedVertex;
-var _UndirectedEdge = class _UndirectedEdge extends AbstractEdge {
+var UndirectedEdge = class extends AbstractEdge {
+  static {
+    __name(this, "UndirectedEdge");
+  }
+  endpoints;
   constructor(v1, v2, weight, value) {
     super(weight, value);
-    __publicField(this, "endpoints");
     this.endpoints = [v1, v2];
   }
 };
-__name(_UndirectedEdge, "UndirectedEdge");
-var UndirectedEdge = _UndirectedEdge;
-var _UndirectedGraph = class _UndirectedGraph extends AbstractGraph {
+var UndirectedGraph = class _UndirectedGraph extends AbstractGraph {
+  static {
+    __name(this, "UndirectedGraph");
+  }
   /**
    * Construct an undirected graph with runtime defaults.
    * @param options - `GraphOptions<V>` (e.g. `vertexValueInitializer`, `defaultEdgeWeight`).
@@ -6341,9 +6359,9 @@ var _UndirectedGraph = class _UndirectedGraph extends AbstractGraph {
    */
   constructor(options) {
     super(options);
-    __publicField(this, "_edgeMap");
     this._edgeMap = /* @__PURE__ */ new Map();
   }
+  _edgeMap;
   get edgeMap() {
     return this._edgeMap;
   }
@@ -6396,8 +6414,7 @@ var _UndirectedGraph = class _UndirectedGraph extends AbstractGraph {
    * @remarks Time O(1), Space O(1)
    */
   createEdge(v1, v2, weight, value) {
-    var _a;
-    return new UndirectedEdge(v1, v2, (_a = weight != null ? weight : this.options.defaultEdgeWeight) != null ? _a : 1, value);
+    return new UndirectedEdge(v1, v2, weight ?? this.options.defaultEdgeWeight ?? 1, value);
   }
   /**
    * Get an undirected edge between two vertices, if present.
@@ -6407,13 +6424,12 @@ var _UndirectedGraph = class _UndirectedGraph extends AbstractGraph {
    * @remarks Time O(1) avg, Space O(1)
    */
   getEdge(v1, v2) {
-    var _a;
     let edgeMap = [];
     if (v1 !== void 0 && v2 !== void 0) {
       const vertex1 = this._getVertex(v1);
       const vertex2 = this._getVertex(v2);
       if (vertex1 && vertex2) {
-        edgeMap = (_a = this._edgeMap.get(vertex1)) == null ? void 0 : _a.filter((e) => e.endpoints.includes(vertex2.key));
+        edgeMap = this._edgeMap.get(vertex1)?.filter((e) => e.endpoints.includes(vertex2.key));
       }
     }
     return edgeMap ? edgeMap[0] || void 0 : void 0;
@@ -6506,10 +6522,9 @@ var _UndirectedGraph = class _UndirectedGraph extends AbstractGraph {
    * @remarks Time O(1) avg, Space O(1)
    */
   degreeOf(vertexOrKey) {
-    var _a;
     const vertex = this._getVertex(vertexOrKey);
     if (vertex) {
-      return ((_a = this._edgeMap.get(vertex)) == null ? void 0 : _a.length) || 0;
+      return this._edgeMap.get(vertex)?.length || 0;
     } else {
       return 0;
     }
@@ -6702,29 +6717,32 @@ var _UndirectedGraph = class _UndirectedGraph extends AbstractGraph {
     return true;
   }
 };
-__name(_UndirectedGraph, "UndirectedGraph");
-var UndirectedGraph = _UndirectedGraph;
 
 // src/data-structures/graph/map-graph.ts
-var _MapVertex = class _MapVertex extends DirectedVertex {
+var MapVertex = class extends DirectedVertex {
+  static {
+    __name(this, "MapVertex");
+  }
+  lat;
+  long;
   constructor(key, value, lat, long) {
     super(key, value);
-    __publicField(this, "lat");
-    __publicField(this, "long");
     this.lat = lat;
     this.long = long;
   }
 };
-__name(_MapVertex, "MapVertex");
-var MapVertex = _MapVertex;
-var _MapEdge = class _MapEdge extends DirectedEdge {
+var MapEdge = class extends DirectedEdge {
+  static {
+    __name(this, "MapEdge");
+  }
   constructor(src, dest, weight, value) {
     super(src, dest, weight, value);
   }
 };
-__name(_MapEdge, "MapEdge");
-var MapEdge = _MapEdge;
-var _MapGraph = class _MapGraph extends DirectedGraph {
+var MapGraph = class _MapGraph extends DirectedGraph {
+  static {
+    __name(this, "MapGraph");
+  }
   /**
    * Construct a MapGraph.
    * @param originCoord - Origin coordinate `[lat, long]` used as default.
@@ -6733,14 +6751,14 @@ var _MapGraph = class _MapGraph extends DirectedGraph {
    */
   constructor(originCoord, bottomRight) {
     super();
-    __publicField(this, "_originCoord", [0, 0]);
-    __publicField(this, "_bottomRight");
     this._originCoord = originCoord;
     this._bottomRight = bottomRight;
   }
+  _originCoord = [0, 0];
   get originCoord() {
     return this._originCoord;
   }
+  _bottomRight;
   get bottomRight() {
     return this._bottomRight;
   }
@@ -6792,13 +6810,11 @@ var _MapGraph = class _MapGraph extends DirectedGraph {
    */
   _createInstance(options) {
     const { originCoord, bottomRight } = options || {};
-    const oc = originCoord != null ? originCoord : this.originCoord;
-    const br = bottomRight != null ? bottomRight : this.bottomRight;
+    const oc = originCoord ?? this.originCoord;
+    const br = bottomRight ?? this.bottomRight;
     return new _MapGraph(oc, br);
   }
 };
-__name(_MapGraph, "MapGraph");
-var MapGraph = _MapGraph;
 
 // src/common/index.ts
 var DFSOperation = /* @__PURE__ */ ((DFSOperation2) => {
@@ -6806,7 +6822,7 @@ var DFSOperation = /* @__PURE__ */ ((DFSOperation2) => {
   DFSOperation2[DFSOperation2["PROCESS"] = 1] = "PROCESS";
   return DFSOperation2;
 })(DFSOperation || {});
-var _Range = class _Range {
+var Range = class {
   constructor(low, high, includeLow = true, includeHigh = true) {
     this.low = low;
     this.high = high;
@@ -6815,6 +6831,9 @@ var _Range = class _Range {
     if (!(isComparable(low) && isComparable(high))) throw new RangeError("low or high is not comparable");
     if (low > high) throw new RangeError("low must be less than or equal to high");
   }
+  static {
+    __name(this, "Range");
+  }
   // Determine whether a key is within the range
   isInRange(key, comparator) {
     const lowCheck = this.includeLow ? comparator(key, this.low) >= 0 : comparator(key, this.low) > 0;
@@ -6822,11 +6841,15 @@ var _Range = class _Range {
     return lowCheck && highCheck;
   }
 };
-__name(_Range, "Range");
-var Range = _Range;
 
 // src/data-structures/binary-tree/binary-tree.ts
-var _BinaryTreeNode = class _BinaryTreeNode {
+var BinaryTreeNode = class {
+  static {
+    __name(this, "BinaryTreeNode");
+  }
+  key;
+  value;
+  parent = void 0;
   /**
    * Creates an instance of BinaryTreeNode.
    * @remarks Time O(1), Space O(1)
@@ -6835,17 +6858,10 @@ var _BinaryTreeNode = class _BinaryTreeNode {
    * @param [value] - The value associated with the key.
    */
   constructor(key, value) {
-    __publicField(this, "key");
-    __publicField(this, "value");
-    __publicField(this, "parent");
-    __publicField(this, "_left");
-    __publicField(this, "_right");
-    __publicField(this, "_height", 0);
-    __publicField(this, "_color", "BLACK");
-    __publicField(this, "_count", 1);
     this.key = key;
     this.value = value;
   }
+  _left = void 0;
   /**
    * Gets the left child of the node.
    * @remarks Time O(1), Space O(1)
@@ -6867,6 +6883,7 @@ var _BinaryTreeNode = class _BinaryTreeNode {
     }
     this._left = v;
   }
+  _right = void 0;
   /**
    * Gets the right child of the node.
    * @remarks Time O(1), Space O(1)
@@ -6888,6 +6905,7 @@ var _BinaryTreeNode = class _BinaryTreeNode {
     }
     this._right = v;
   }
+  _height = 0;
   /**
    * Gets the height of the node (used in self-balancing trees).
    * @remarks Time O(1), Space O(1)
@@ -6906,6 +6924,7 @@ var _BinaryTreeNode = class _BinaryTreeNode {
   set height(value) {
     this._height = value;
   }
+  _color = "BLACK";
   /**
    * Gets the color of the node (used in Red-Black trees).
    * @remarks Time O(1), Space O(1)
@@ -6924,6 +6943,7 @@ var _BinaryTreeNode = class _BinaryTreeNode {
   set color(value) {
     this._color = value;
   }
+  _count = 1;
   /**
    * Gets the count of nodes in the subtree rooted at this node (used in order-statistic trees).
    * @remarks Time O(1), Space O(1)
@@ -6960,9 +6980,11 @@ var _BinaryTreeNode = class _BinaryTreeNode {
     return "MAL_NODE";
   }
 };
-__name(_BinaryTreeNode, "BinaryTreeNode");
-var BinaryTreeNode = _BinaryTreeNode;
-var _BinaryTree = class _BinaryTree extends IterableEntryBase {
+var BinaryTree = class extends IterableEntryBase {
+  static {
+    __name(this, "BinaryTree");
+  }
+  iterationType = "ITERATIVE";
   /**
    * Creates an instance of BinaryTree.
    * @remarks Time O(N * M), where N is the number of items in `keysNodesEntriesOrRaws` and M is the tree size at insertion time (due to O(M) `add` operation). Space O(N) for storing the nodes.
@@ -6972,22 +6994,6 @@ var _BinaryTree = class _BinaryTree extends IterableEntryBase {
    */
   constructor(keysNodesEntriesOrRaws = [], options) {
     super();
-    __publicField(this, "iterationType", "ITERATIVE");
-    __publicField(this, "_isMapMode", true);
-    __publicField(this, "_isDuplicate", false);
-    __publicField(this, "_store", /* @__PURE__ */ new Map());
-    __publicField(this, "_root");
-    __publicField(this, "_size", 0);
-    __publicField(this, "_NIL", new BinaryTreeNode(NaN));
-    __publicField(this, "_toEntryFn");
-    /**
-     * (Protected) Default callback function, returns the node's key.
-     * @remarks Time O(1)
-     *
-     * @param node - The node.
-     * @returns The node's key or undefined.
-     */
-    __publicField(this, "_DEFAULT_NODE_CALLBACK", /* @__PURE__ */ __name((node) => node ? node.key : void 0, "_DEFAULT_NODE_CALLBACK"));
     if (options) {
       const { iterationType, toEntryFn, isMapMode, isDuplicate } = options;
       if (iterationType) this.iterationType = iterationType;
@@ -6998,6 +7004,7 @@ var _BinaryTree = class _BinaryTree extends IterableEntryBase {
     }
     if (keysNodesEntriesOrRaws) this.addMany(keysNodesEntriesOrRaws);
   }
+  _isMapMode = true;
   /**
    * Gets whether the tree is in Map mode.
    * @remarks In Map mode (default), values are stored in an external Map, and nodes only hold keys. If false, values are stored directly on the nodes. Time O(1)
@@ -7007,6 +7014,7 @@ var _BinaryTree = class _BinaryTree extends IterableEntryBase {
   get isMapMode() {
     return this._isMapMode;
   }
+  _isDuplicate = false;
   /**
    * Gets whether the tree allows duplicate keys.
    * @remarks Time O(1)
@@ -7016,6 +7024,7 @@ var _BinaryTree = class _BinaryTree extends IterableEntryBase {
   get isDuplicate() {
     return this._isDuplicate;
   }
+  _store = /* @__PURE__ */ new Map();
   /**
    * Gets the external value store (used in Map mode).
    * @remarks Time O(1)
@@ -7025,6 +7034,7 @@ var _BinaryTree = class _BinaryTree extends IterableEntryBase {
   get store() {
     return this._store;
   }
+  _root;
   /**
    * Gets the root node of the tree.
    * @remarks Time O(1)
@@ -7034,6 +7044,7 @@ var _BinaryTree = class _BinaryTree extends IterableEntryBase {
   get root() {
     return this._root;
   }
+  _size = 0;
   /**
    * Gets the number of nodes in the tree.
    * @remarks Time O(1)
@@ -7043,6 +7054,7 @@ var _BinaryTree = class _BinaryTree extends IterableEntryBase {
   get size() {
     return this._size;
   }
+  _NIL = new BinaryTreeNode(NaN);
   /**
    * Gets the sentinel NIL node (used in self-balancing trees like Red-Black Tree).
    * @remarks Time O(1)
@@ -7052,6 +7064,7 @@ var _BinaryTree = class _BinaryTree extends IterableEntryBase {
   get NIL() {
     return this._NIL;
   }
+  _toEntryFn;
   /**
    * Gets the function used to convert raw data objects (R) into [key, value] entries.
    * @remarks Time O(1)
@@ -7211,7 +7224,7 @@ var _BinaryTree = class _BinaryTree extends IterableEntryBase {
     if (newNode === void 0) return false;
     if (!this._root) {
       this._setRoot(newNode);
-      if (this._isMapMode) this._setValue(newNode == null ? void 0 : newNode.key, newValue);
+      if (this._isMapMode) this._setValue(newNode?.key, newValue);
       this._size = 1;
       return true;
     }
@@ -7243,7 +7256,7 @@ var _BinaryTree = class _BinaryTree extends IterableEntryBase {
       } else if (potentialParent.right === void 0) {
         potentialParent.right = newNode;
       }
-      if (this._isMapMode) this._setValue(newNode == null ? void 0 : newNode.key, newValue);
+      if (this._isMapMode) this._setValue(newNode?.key, newValue);
       this._size++;
       return true;
     }
@@ -7308,7 +7321,7 @@ var _BinaryTree = class _BinaryTree extends IterableEntryBase {
     if (!this._root) return deletedResult;
     const curr = this.getNode(keyNodeOrEntry);
     if (!curr) return deletedResult;
-    const parent = curr == null ? void 0 : curr.parent;
+    const parent = curr?.parent;
     let needBalanced;
     let orgCurrent = curr;
     if (!curr.left && !curr.right && !parent) {
@@ -7413,13 +7426,12 @@ var _BinaryTree = class _BinaryTree extends IterableEntryBase {
    * @returns The associated value, or undefined.
    */
   get(keyNodeEntryOrPredicate, startNode = this._root, iterationType = this.iterationType) {
-    var _a;
     if (this._isMapMode) {
       const key = this._extractKey(keyNodeEntryOrPredicate);
       if (key === null || key === void 0) return;
       return this._store.get(key);
     }
-    return (_a = this.getNode(keyNodeEntryOrPredicate, startNode, iterationType)) == null ? void 0 : _a.value;
+    return this.getNode(keyNodeEntryOrPredicate, startNode, iterationType)?.value;
   }
   has(keyNodeEntryOrPredicate, startNode = this._root, iterationType = this.iterationType) {
     return this.search(keyNodeEntryOrPredicate, true, (node) => node, startNode, iterationType).length > 0;
@@ -7507,7 +7519,7 @@ var _BinaryTree = class _BinaryTree extends IterableEntryBase {
     let distEnsured = this.ensureNode(dist);
     const beginRootEnsured = this.ensureNode(startNode);
     let depth = 0;
-    while (distEnsured == null ? void 0 : distEnsured.parent) {
+    while (distEnsured?.parent) {
       if (distEnsured === beginRootEnsured) {
         return depth;
       }
@@ -7980,7 +7992,7 @@ var _BinaryTree = class _BinaryTree extends IterableEntryBase {
   filter(predicate, thisArg) {
     const out = this._createInstance();
     let i = 0;
-    for (const [k, v] of this) if (predicate.call(thisArg, k, v, i++, this)) out.add([k, v]);
+    for (const [k, v] of this) if (predicate.call(thisArg, v, k, i++, this)) out.add([k, v]);
     return out;
   }
   /**
@@ -7998,7 +8010,7 @@ var _BinaryTree = class _BinaryTree extends IterableEntryBase {
   map(cb, options, thisArg) {
     const out = this._createLike([], options);
     let i = 0;
-    for (const [k, v] of this) out.add(cb.call(thisArg, k, v, i++, this));
+    for (const [k, v] of this) out.add(cb.call(thisArg, v, k, i++, this));
     return out;
   }
   /**
@@ -8069,10 +8081,10 @@ var _BinaryTree = class _BinaryTree extends IterableEntryBase {
       const dfs = /* @__PURE__ */ __name((node) => {
         if (!shouldVisitRoot(node)) return;
         const visitLeft = /* @__PURE__ */ __name(() => {
-          if (shouldVisitLeft(node) && (node == null ? void 0 : node.left) !== void 0) dfs(node == null ? void 0 : node.left);
+          if (shouldVisitLeft(node) && node?.left !== void 0) dfs(node?.left);
         }, "visitLeft");
         const visitRight = /* @__PURE__ */ __name(() => {
-          if (shouldVisitRight(node) && (node == null ? void 0 : node.right) !== void 0) dfs(node == null ? void 0 : node.right);
+          if (shouldVisitRight(node) && node?.right !== void 0) dfs(node?.right);
         }, "visitRight");
         switch (pattern) {
           case "IN":
@@ -8105,12 +8117,10 @@ var _BinaryTree = class _BinaryTree extends IterableEntryBase {
     } else {
       const stack = [{ opt: 0 /* VISIT */, node: startNode }];
       const pushLeft = /* @__PURE__ */ __name((cur) => {
-        var _a;
-        if (shouldVisitLeft(cur.node)) stack.push({ opt: 0 /* VISIT */, node: (_a = cur.node) == null ? void 0 : _a.left });
+        if (shouldVisitLeft(cur.node)) stack.push({ opt: 0 /* VISIT */, node: cur.node?.left });
       }, "pushLeft");
       const pushRight = /* @__PURE__ */ __name((cur) => {
-        var _a;
-        if (shouldVisitRight(cur.node)) stack.push({ opt: 0 /* VISIT */, node: (_a = cur.node) == null ? void 0 : _a.right });
+        if (shouldVisitRight(cur.node)) stack.push({ opt: 0 /* VISIT */, node: cur.node?.right });
       }, "pushRight");
       const pushRoot = /* @__PURE__ */ __name((cur) => {
         if (shouldVisitRoot(cur.node)) stack.push({ opt: 1 /* PROCESS */, node: cur.node });
@@ -8182,6 +8192,14 @@ var _BinaryTree = class _BinaryTree extends IterableEntryBase {
       }
     }
   }
+  /**
+   * (Protected) Default callback function, returns the node's key.
+   * @remarks Time O(1)
+   *
+   * @param node - The node.
+   * @returns The node's key or undefined.
+   */
+  _DEFAULT_NODE_CALLBACK = /* @__PURE__ */ __name((node) => node ? node.key : void 0, "_DEFAULT_NODE_CALLBACK");
   /**
    * (Protected) Snapshots the current tree's configuration options.
    * @remarks Time O(1)
@@ -8207,7 +8225,7 @@ var _BinaryTree = class _BinaryTree extends IterableEntryBase {
    */
   _createInstance(options) {
     const Ctor = this.constructor;
-    return new Ctor([], { ...this._snapshotOptions(), ...options != null ? options : {} });
+    return new Ctor([], { ...this._snapshotOptions(), ...options ?? {} });
   }
   /**
    * (Protected) Creates a new instance of the same tree constructor, potentially with different generic types.
@@ -8220,7 +8238,7 @@ var _BinaryTree = class _BinaryTree extends IterableEntryBase {
    */
   _createLike(iter = [], options) {
     const Ctor = this.constructor;
-    return new Ctor(iter, { ...this._snapshotOptions(), ...options != null ? options : {} });
+    return new Ctor(iter, { ...this._snapshotOptions(), ...options ?? {} });
   }
   /**
    * (Protected) Converts a key, node, or entry into a standardized [node, value] tuple.
@@ -8238,7 +8256,7 @@ var _BinaryTree = class _BinaryTree extends IterableEntryBase {
       const [key, entryValue] = keyNodeOrEntry;
       if (key === void 0) return [void 0, void 0];
       else if (key === null) return [null, void 0];
-      const finalValue = value != null ? value : entryValue;
+      const finalValue = value ?? entryValue;
       return [this.createNode(key, finalValue), finalValue];
     }
     return [this.createNode(keyNodeOrEntry, value), value];
@@ -8445,11 +8463,15 @@ var _BinaryTree = class _BinaryTree extends IterableEntryBase {
     this._store.clear();
   }
 };
-__name(_BinaryTree, "BinaryTree");
-var BinaryTree = _BinaryTree;
 
 // src/data-structures/binary-tree/bst.ts
-var _BSTNode = class _BSTNode extends BinaryTreeNode {
+var BSTNode = class {
+  static {
+    __name(this, "BSTNode");
+  }
+  key;
+  value;
+  parent = void 0;
   /**
    * Creates an instance of BSTNode.
    * @remarks Time O(1), Space O(1)
@@ -8458,11 +8480,10 @@ var _BSTNode = class _BSTNode extends BinaryTreeNode {
    * @param [value] - The value associated with the key.
    */
   constructor(key, value) {
-    super(key, value);
-    __publicField(this, "parent");
-    __publicField(this, "_left");
-    __publicField(this, "_right");
+    this.key = key;
+    this.value = value;
   }
+  _left = void 0;
   /**
    * Gets the left child of the node.
    * @remarks Time O(1), Space O(1)
@@ -8482,6 +8503,7 @@ var _BSTNode = class _BSTNode extends BinaryTreeNode {
     if (v) v.parent = this;
     this._left = v;
   }
+  _right = void 0;
   /**
    * Gets the right child of the node.
    * @remarks Time O(1), Space O(1)
@@ -8501,10 +8523,85 @@ var _BSTNode = class _BSTNode extends BinaryTreeNode {
     if (v) v.parent = this;
     this._right = v;
   }
+  _height = 0;
+  /**
+   * Gets the height of the node (used in self-balancing trees).
+   * @remarks Time O(1), Space O(1)
+   *
+   * @returns The height.
+   */
+  get height() {
+    return this._height;
+  }
+  /**
+   * Sets the height of the node.
+   * @remarks Time O(1), Space O(1)
+   *
+   * @param value - The new height.
+   */
+  set height(value) {
+    this._height = value;
+  }
+  _color = "BLACK";
+  /**
+   * Gets the color of the node (used in Red-Black trees).
+   * @remarks Time O(1), Space O(1)
+   *
+   * @returns The node's color.
+   */
+  get color() {
+    return this._color;
+  }
+  /**
+   * Sets the color of the node.
+   * @remarks Time O(1), Space O(1)
+   *
+   * @param value - The new color.
+   */
+  set color(value) {
+    this._color = value;
+  }
+  _count = 1;
+  /**
+   * Gets the count of nodes in the subtree rooted at this node (used in order-statistic trees).
+   * @remarks Time O(1), Space O(1)
+   *
+   * @returns The subtree node count.
+   */
+  get count() {
+    return this._count;
+  }
+  /**
+   * Sets the count of nodes in the subtree.
+   * @remarks Time O(1), Space O(1)
+   *
+   * @param value - The new count.
+   */
+  set count(value) {
+    this._count = value;
+  }
+  /**
+   * Gets the position of the node relative to its parent.
+   * @remarks Time O(1), Space O(1)
+   *
+   * @returns The family position (e.g., 'ROOT', 'LEFT', 'RIGHT').
+   */
+  get familyPosition() {
+    if (!this.parent) {
+      return this.left || this.right ? "ROOT" : "ISOLATED";
+    }
+    if (this.parent.left === this) {
+      return this.left || this.right ? "ROOT_LEFT" : "LEFT";
+    } else if (this.parent.right === this) {
+      return this.left || this.right ? "ROOT_RIGHT" : "RIGHT";
+    }
+    return "MAL_NODE";
+  }
 };
-__name(_BSTNode, "BSTNode");
-var BSTNode = _BSTNode;
-var _BST = class _BST extends BinaryTree {
+var BST = class extends BinaryTree {
+  static {
+    __name(this, "BST");
+  }
   /**
    * Creates an instance of BST.
    * @remarks Time O(N log N) or O(N^2) depending on `isBalanceAdd` in `addMany` and input order. Space O(N).
@@ -8514,33 +8611,6 @@ var _BST = class _BST extends BinaryTree {
    */
   constructor(keysNodesEntriesOrRaws = [], options) {
     super([], options);
-    __publicField(this, "_root");
-    __publicField(this, "_isReverse", false);
-    /**
-     * The default comparator function.
-     * @remarks Time O(1) (or O(C) if `specifyComparable` is used, C is complexity of that function).
-     */
-    __publicField(this, "_comparator", /* @__PURE__ */ __name((a, b) => {
-      if (isComparable(a) && isComparable(b)) {
-        if (a > b) return 1;
-        if (a < b) return -1;
-        return 0;
-      }
-      if (this._specifyComparable) {
-        const va = this._specifyComparable(a);
-        const vb = this._specifyComparable(b);
-        if (va > vb) return 1;
-        if (va < vb) return -1;
-        return 0;
-      }
-      if (typeof a === "object" || typeof b === "object") {
-        throw TypeError(
-          `When comparing object types, a custom specifyComparable must be defined in the constructor's options.`
-        );
-      }
-      return 0;
-    }, "_comparator"));
-    __publicField(this, "_specifyComparable");
     if (options) {
       const { specifyComparable, isReverse } = options;
       if (typeof specifyComparable === "function") this._specifyComparable = specifyComparable;
@@ -8548,6 +8618,7 @@ var _BST = class _BST extends BinaryTree {
     }
     if (keysNodesEntriesOrRaws) this.addMany(keysNodesEntriesOrRaws);
   }
+  _root = void 0;
   /**
    * Gets the root node of the tree.
    * @remarks Time O(1)
@@ -8557,6 +8628,7 @@ var _BST = class _BST extends BinaryTree {
   get root() {
     return this._root;
   }
+  _isReverse = false;
   /**
    * Gets whether the tree's comparison logic is reversed.
    * @remarks Time O(1)
@@ -8566,6 +8638,30 @@ var _BST = class _BST extends BinaryTree {
   get isReverse() {
     return this._isReverse;
   }
+  /**
+   * The default comparator function.
+   * @remarks Time O(1) (or O(C) if `specifyComparable` is used, C is complexity of that function).
+   */
+  _comparator = /* @__PURE__ */ __name((a, b) => {
+    if (isComparable(a) && isComparable(b)) {
+      if (a > b) return 1;
+      if (a < b) return -1;
+      return 0;
+    }
+    if (this._specifyComparable) {
+      const va = this._specifyComparable(a);
+      const vb = this._specifyComparable(b);
+      if (va > vb) return 1;
+      if (va < vb) return -1;
+      return 0;
+    }
+    if (typeof a === "object" || typeof b === "object") {
+      throw TypeError(
+        `When comparing object types, a custom specifyComparable must be defined in the constructor's options.`
+      );
+    }
+    return 0;
+  }, "_comparator");
   /**
    * Gets the comparator function used by the tree.
    * @remarks Time O(1)
@@ -8575,6 +8671,7 @@ var _BST = class _BST extends BinaryTree {
   get comparator() {
     return this._comparator;
   }
+  _specifyComparable;
   /**
    * Gets the function used to extract a comparable value from a complex key.
    * @remarks Time O(1)
@@ -8604,8 +8701,7 @@ var _BST = class _BST extends BinaryTree {
    * @returns The resolved node, or undefined if not found.
    */
   ensureNode(keyNodeOrEntry, iterationType = this.iterationType) {
-    var _a;
-    return (_a = super.ensureNode(keyNodeOrEntry, iterationType)) != null ? _a : void 0;
+    return super.ensureNode(keyNodeOrEntry, iterationType) ?? void 0;
   }
   /**
    * Checks if the given item is a `BSTNode` instance.
@@ -8678,8 +8774,7 @@ var _BST = class _BST extends BinaryTree {
    * @returns The first matching node, or undefined if not found.
    */
   getNode(keyNodeEntryOrPredicate, startNode = this._root, iterationType = this.iterationType) {
-    var _a;
-    return (_a = this.getNodes(keyNodeEntryOrPredicate, true, startNode, iterationType)[0]) != null ? _a : void 0;
+    return this.getNodes(keyNodeEntryOrPredicate, true, startNode, iterationType)[0] ?? void 0;
   }
   /**
    * Searches the tree for nodes matching a predicate, key, or range.
@@ -8784,7 +8879,7 @@ var _BST = class _BST extends BinaryTree {
     if (newNode === void 0) return false;
     if (this._root === void 0) {
       this._setRoot(newNode);
-      if (this._isMapMode) this._setValue(newNode == null ? void 0 : newNode.key, newValue);
+      if (this._isMapMode) this._setValue(newNode?.key, newValue);
       this._size++;
       return true;
     }
@@ -8797,7 +8892,7 @@ var _BST = class _BST extends BinaryTree {
       } else if (this._compare(current.key, newNode.key) > 0) {
         if (current.left === void 0) {
           current.left = newNode;
-          if (this._isMapMode) this._setValue(newNode == null ? void 0 : newNode.key, newValue);
+          if (this._isMapMode) this._setValue(newNode?.key, newValue);
           this._size++;
           return true;
         }
@@ -8805,7 +8900,7 @@ var _BST = class _BST extends BinaryTree {
       } else {
         if (current.right === void 0) {
           current.right = newNode;
-          if (this._isMapMode) this._setValue(newNode == null ? void 0 : newNode.key, newValue);
+          if (this._isMapMode) this._setValue(newNode?.key, newValue);
           this._size++;
           return true;
         }
@@ -8828,10 +8923,10 @@ var _BST = class _BST extends BinaryTree {
    */
   addMany(keysNodesEntriesOrRaws, values, isBalanceAdd = true, iterationType = this.iterationType) {
     const inserted = [];
-    const valuesIterator = values == null ? void 0 : values[Symbol.iterator]();
+    const valuesIterator = values?.[Symbol.iterator]();
     if (!isBalanceAdd) {
       for (let kve of keysNodesEntriesOrRaws) {
-        const val = valuesIterator == null ? void 0 : valuesIterator.next().value;
+        const val = valuesIterator?.next().value;
         if (this.isRaw(kve)) kve = this._toEntryFn(kve);
         inserted.push(this.add(kve, val));
       }
@@ -8840,7 +8935,7 @@ var _BST = class _BST extends BinaryTree {
     const realBTNExemplars = [];
     let i = 0;
     for (const kve of keysNodesEntriesOrRaws) {
-      realBTNExemplars.push({ key: kve, value: valuesIterator == null ? void 0 : valuesIterator.next().value, orgIndex: i++ });
+      realBTNExemplars.push({ key: kve, value: valuesIterator?.next().value, orgIndex: i++ });
     }
     const sorted = realBTNExemplars.sort(({ key: a }, { key: b }) => {
       let keyA, keyB;
@@ -9021,7 +9116,7 @@ var _BST = class _BST extends BinaryTree {
     const out = this._createLike([], options);
     let index = 0;
     for (const [key, value] of this) {
-      out.add(callback.call(thisArg, key, value, index++, this));
+      out.add(callback.call(thisArg, value, key, index++, this));
     }
     return out;
   }
@@ -9062,7 +9157,7 @@ var _BST = class _BST extends BinaryTree {
    */
   _createInstance(options) {
     const Ctor = this.constructor;
-    return new Ctor([], { ...this._snapshotOptions(), ...options != null ? options : {} });
+    return new Ctor([], { ...this._snapshotOptions(), ...options ?? {} });
   }
   /**
    * (Protected) Creates a new instance of the same BST constructor, potentially with different generic types.
@@ -9075,7 +9170,7 @@ var _BST = class _BST extends BinaryTree {
    */
   _createLike(iter = [], options) {
     const Ctor = this.constructor;
-    return new Ctor(iter, { ...this._snapshotOptions(), ...options != null ? options : {} });
+    return new Ctor(iter, { ...this._snapshotOptions(), ...options ?? {} });
   }
   /**
    * (Protected) Snapshots the current BST's configuration options.
@@ -9102,7 +9197,7 @@ var _BST = class _BST extends BinaryTree {
   _keyValueNodeOrEntryToNodeAndValue(keyNodeOrEntry, value) {
     const [node, entryValue] = super._keyValueNodeOrEntryToNodeAndValue(keyNodeOrEntry, value);
     if (node === null) return [void 0, void 0];
-    return [node, value != null ? value : entryValue];
+    return [node, value ?? entryValue];
   }
   /**
    * (Protected) Sets the root node and clears its parent reference.
@@ -9133,7 +9228,6 @@ var _BST = class _BST extends BinaryTree {
    * @returns True if the node was found and deleted, false otherwise.
    */
   _deleteByKey(key) {
-    var _a;
     let node = this._root;
     while (node) {
       const cmp = this._compare(node.key, key);
@@ -9142,7 +9236,7 @@ var _BST = class _BST extends BinaryTree {
     }
     if (!node) return false;
     const transplant = /* @__PURE__ */ __name((u, v) => {
-      const p = u == null ? void 0 : u.parent;
+      const p = u?.parent;
       if (!p) {
         this._setRoot(v);
       } else if (p.left === u) {
@@ -9172,15 +9266,18 @@ var _BST = class _BST extends BinaryTree {
       succ.left = node.left;
       if (succ.left) succ.left.parent = succ;
     }
-    this._size = Math.max(0, ((_a = this._size) != null ? _a : 0) - 1);
+    this._size = Math.max(0, (this._size ?? 0) - 1);
     return true;
   }
 };
-__name(_BST, "BST");
-var BST = _BST;
 
 // src/data-structures/binary-tree/binary-indexed-tree.ts
-var _BinaryIndexedTree = class _BinaryIndexedTree {
+var BinaryIndexedTree = class {
+  static {
+    __name(this, "BinaryIndexedTree");
+  }
+  _freq;
+  _max;
   /**
    * The constructor initializes the properties of an object, including default frequency, maximum
    * value, a freqMap data structure, the most significant bit, and the count of negative frequencies.
@@ -9188,17 +9285,13 @@ var _BinaryIndexedTree = class _BinaryIndexedTree {
    * value of 0.
    */
   constructor({ frequency = 0, max }) {
-    __publicField(this, "_freq");
-    __publicField(this, "_max");
-    __publicField(this, "_freqMap");
-    __publicField(this, "_msb");
-    __publicField(this, "_negativeCount");
     this._freq = frequency;
     this._max = max;
     this._freqMap = { 0: 0 };
     this._msb = getMSB(max);
     this._negativeCount = frequency < 0 ? max : 0;
   }
+  _freqMap;
   /**
    * The function returns the frequency map of numbers.
    * @returns The `_freqMap` property, which is a record with number keys and number values, is being
@@ -9207,6 +9300,7 @@ var _BinaryIndexedTree = class _BinaryIndexedTree {
   get freqMap() {
     return this._freqMap;
   }
+  _msb;
   /**
    * The function returns the value of the _msb property.
    * @returns The `_msb` property of the object.
@@ -9214,6 +9308,7 @@ var _BinaryIndexedTree = class _BinaryIndexedTree {
   get msb() {
     return this._msb;
   }
+  _negativeCount;
   /**
    * The function returns the value of the _negativeCount property.
    * @returns The method is returning the value of the variable `_negativeCount`, which is of type
@@ -9462,11 +9557,12 @@ var _BinaryIndexedTree = class _BinaryIndexedTree {
     return left;
   }
 };
-__name(_BinaryIndexedTree, "BinaryIndexedTree");
-var BinaryIndexedTree = _BinaryIndexedTree;
 
 // src/data-structures/binary-tree/segment-tree.ts
-var _SegmentTreeNode = class _SegmentTreeNode {
+var SegmentTreeNode = class {
+  static {
+    __name(this, "SegmentTreeNode");
+  }
   /**
    * The constructor initializes the properties of a SegmentTreeNode object.
    * @param {number} start - The `start` parameter represents the starting index of the segment covered
@@ -9479,17 +9575,12 @@ var _SegmentTreeNode = class _SegmentTreeNode {
    * of type `SegmentTreeNodeVal`. It represents the value associated with the segment tree node.
    */
   constructor(start, end, sum, value) {
-    __publicField(this, "_start", 0);
-    __publicField(this, "_end", 0);
-    __publicField(this, "_value");
-    __publicField(this, "_sum", 0);
-    __publicField(this, "_left");
-    __publicField(this, "_right");
     this._start = start;
     this._end = end;
     this._sum = sum;
     this._value = value || void 0;
   }
+  _start = 0;
   /**
    * The function returns the value of the protected variable _start.
    * @returns The start value, which is of type number.
@@ -9504,6 +9595,7 @@ var _SegmentTreeNode = class _SegmentTreeNode {
   set start(value) {
     this._start = value;
   }
+  _end = 0;
   /**
    * The function returns the value of the protected variable `_end`.
    * @returns The value of the protected property `_end`.
@@ -9519,6 +9611,7 @@ var _SegmentTreeNode = class _SegmentTreeNode {
   set end(value) {
     this._end = value;
   }
+  _value = void 0;
   /**
    * The function returns the value of a segment tree node.
    * @returns The value being returned is either a `SegmentTreeNodeVal` object or `undefined`.
@@ -9534,6 +9627,7 @@ var _SegmentTreeNode = class _SegmentTreeNode {
   set value(value) {
     this._value = value;
   }
+  _sum = 0;
   /**
    * The function returns the value of the sum property.
    * @returns The method is returning the value of the variable `_sum`.
@@ -9548,6 +9642,7 @@ var _SegmentTreeNode = class _SegmentTreeNode {
   set sum(value) {
     this._sum = value;
   }
+  _left = void 0;
   /**
    * The function returns the left child of a segment tree node.
    * @returns The `left` property of the `SegmentTreeNode` object is being returned. It is of type
@@ -9564,6 +9659,7 @@ var _SegmentTreeNode = class _SegmentTreeNode {
   set left(value) {
     this._left = value;
   }
+  _right = void 0;
   /**
    * The function returns the right child of a segment tree node.
    * @returns The `getRight()` method is returning a value of type `SegmentTreeNode` or `undefined`.
@@ -9581,9 +9677,10 @@ var _SegmentTreeNode = class _SegmentTreeNode {
     this._right = value;
   }
 };
-__name(_SegmentTreeNode, "SegmentTreeNode");
-var SegmentTreeNode = _SegmentTreeNode;
-var _SegmentTree = class _SegmentTree {
+var SegmentTree = class {
+  static {
+    __name(this, "SegmentTree");
+  }
   /**
    * The constructor initializes the values, start, end, and root properties of an object.
    * @param {number[]} values - An array of numbers that will be used to build a binary search tree.
@@ -9594,10 +9691,6 @@ var _SegmentTree = class _SegmentTree {
    * included in the range. If not provided, it defaults to the index of the last element in the "values" array.
    */
   constructor(values, start, end) {
-    __publicField(this, "_values", []);
-    __publicField(this, "_start", 0);
-    __publicField(this, "_end");
-    __publicField(this, "_root");
     start = start || 0;
     end = end || values.length - 1;
     this._values = values;
@@ -9610,6 +9703,7 @@ var _SegmentTree = class _SegmentTree {
       this._values = [];
     }
   }
+  _values = [];
   /**
    * The function returns an array of numbers.
    * @returns An array of numbers is being returned.
@@ -9617,6 +9711,7 @@ var _SegmentTree = class _SegmentTree {
   get values() {
     return this._values;
   }
+  _start = 0;
   /**
    * The function returns the value of the protected variable _start.
    * @returns The start value, which is of type number.
@@ -9624,6 +9719,7 @@ var _SegmentTree = class _SegmentTree {
   get start() {
     return this._start;
   }
+  _end;
   /**
    * The function returns the value of the protected variable `_end`.
    * @returns The value of the protected property `_end`.
@@ -9631,6 +9727,7 @@ var _SegmentTree = class _SegmentTree {
   get end() {
     return this._end;
   }
+  _root;
   /**
    * The function returns the root node of a segment tree.
    * @returns The `root` property of the class `SegmentTreeNode` or `undefined` if it is not defined.
@@ -9745,11 +9842,15 @@ var _SegmentTree = class _SegmentTree {
     return dfs(root, indexA, indexB);
   }
 };
-__name(_SegmentTree, "SegmentTree");
-var SegmentTree = _SegmentTree;
 
 // src/data-structures/binary-tree/avl-tree.ts
-var _AVLTreeNode = class _AVLTreeNode extends BSTNode {
+var AVLTreeNode = class {
+  static {
+    __name(this, "AVLTreeNode");
+  }
+  key;
+  value;
+  parent = void 0;
   /**
    * Creates an instance of AVLTreeNode.
    * @remarks Time O(1), Space O(1)
@@ -9758,11 +9859,10 @@ var _AVLTreeNode = class _AVLTreeNode extends BSTNode {
    * @param [value] - The value associated with the key.
    */
   constructor(key, value) {
-    super(key, value);
-    __publicField(this, "parent");
-    __publicField(this, "_left");
-    __publicField(this, "_right");
+    this.key = key;
+    this.value = value;
   }
+  _left = void 0;
   /**
    * Gets the left child of the node.
    * @remarks Time O(1), Space O(1)
@@ -9784,6 +9884,7 @@ var _AVLTreeNode = class _AVLTreeNode extends BSTNode {
     }
     this._left = v;
   }
+  _right = void 0;
   /**
    * Gets the right child of the node.
    * @remarks Time O(1), Space O(1)
@@ -9805,10 +9906,85 @@ var _AVLTreeNode = class _AVLTreeNode extends BSTNode {
     }
     this._right = v;
   }
+  _height = 0;
+  /**
+   * Gets the height of the node (used in self-balancing trees).
+   * @remarks Time O(1), Space O(1)
+   *
+   * @returns The height.
+   */
+  get height() {
+    return this._height;
+  }
+  /**
+   * Sets the height of the node.
+   * @remarks Time O(1), Space O(1)
+   *
+   * @param value - The new height.
+   */
+  set height(value) {
+    this._height = value;
+  }
+  _color = "BLACK";
+  /**
+   * Gets the color of the node (used in Red-Black trees).
+   * @remarks Time O(1), Space O(1)
+   *
+   * @returns The node's color.
+   */
+  get color() {
+    return this._color;
+  }
+  /**
+   * Sets the color of the node.
+   * @remarks Time O(1), Space O(1)
+   *
+   * @param value - The new color.
+   */
+  set color(value) {
+    this._color = value;
+  }
+  _count = 1;
+  /**
+   * Gets the count of nodes in the subtree rooted at this node (used in order-statistic trees).
+   * @remarks Time O(1), Space O(1)
+   *
+   * @returns The subtree node count.
+   */
+  get count() {
+    return this._count;
+  }
+  /**
+   * Sets the count of nodes in the subtree.
+   * @remarks Time O(1), Space O(1)
+   *
+   * @param value - The new count.
+   */
+  set count(value) {
+    this._count = value;
+  }
+  /**
+   * Gets the position of the node relative to its parent.
+   * @remarks Time O(1), Space O(1)
+   *
+   * @returns The family position (e.g., 'ROOT', 'LEFT', 'RIGHT').
+   */
+  get familyPosition() {
+    if (!this.parent) {
+      return this.left || this.right ? "ROOT" : "ISOLATED";
+    }
+    if (this.parent.left === this) {
+      return this.left || this.right ? "ROOT_LEFT" : "LEFT";
+    } else if (this.parent.right === this) {
+      return this.left || this.right ? "ROOT_RIGHT" : "RIGHT";
+    }
+    return "MAL_NODE";
+  }
 };
-__name(_AVLTreeNode, "AVLTreeNode");
-var AVLTreeNode = _AVLTreeNode;
-var _AVLTree = class _AVLTree extends BST {
+var AVLTree = class extends BST {
+  static {
+    __name(this, "AVLTree");
+  }
   /**
    * Creates an instance of AVLTree.
    * @remarks Time O(N log N) (from `addMany` with balanced add). Space O(N).
@@ -9917,7 +10093,7 @@ var _AVLTree = class _AVLTree extends BST {
     const out = this._createLike([], options);
     let index = 0;
     for (const [key, value] of this) {
-      out.add(callback.call(thisArg, key, value, index++, this));
+      out.add(callback.call(thisArg, value, key, index++, this));
     }
     return out;
   }
@@ -9931,7 +10107,7 @@ var _AVLTree = class _AVLTree extends BST {
    */
   _createInstance(options) {
     const Ctor = this.constructor;
-    return new Ctor([], { ...this._snapshotOptions(), ...options != null ? options : {} });
+    return new Ctor([], { ...this._snapshotOptions(), ...options ?? {} });
   }
   /**
    * (Protected) Creates a new instance of the same AVLTree constructor, potentially with different generic types.
@@ -9944,7 +10120,7 @@ var _AVLTree = class _AVLTree extends BST {
    */
   _createLike(iter = [], options) {
     const Ctor = this.constructor;
-    return new Ctor(iter, { ...this._snapshotOptions(), ...options != null ? options : {} });
+    return new Ctor(iter, { ...this._snapshotOptions(), ...options ?? {} });
   }
   /**
    * (Protected) Swaps properties of two nodes, including height.
@@ -10013,7 +10189,7 @@ var _AVLTree = class _AVLTree extends BST {
     if (A === this.root) {
       if (B) this._setRoot(B);
     } else {
-      if ((parentOfA == null ? void 0 : parentOfA.left) === A) {
+      if (parentOfA?.left === A) {
         parentOfA.left = B;
       } else {
         if (parentOfA) parentOfA.right = B;
@@ -10196,11 +10372,15 @@ var _AVLTree = class _AVLTree extends BST {
     return super._replaceNode(oldNode, newNode);
   }
 };
-__name(_AVLTree, "AVLTree");
-var AVLTree = _AVLTree;
 
 // src/data-structures/binary-tree/red-black-tree.ts
-var _RedBlackTreeNode = class _RedBlackTreeNode extends BSTNode {
+var RedBlackTreeNode = class {
+  static {
+    __name(this, "RedBlackTreeNode");
+  }
+  key;
+  value;
+  parent = void 0;
   /**
    * Create a Red-Black Tree and optionally bulk-insert items.
    * @remarks Time O(n log n), Space O(n)
@@ -10210,12 +10390,11 @@ var _RedBlackTreeNode = class _RedBlackTreeNode extends BSTNode {
    * @returns New RedBlackTree instance.
    */
   constructor(key, value, color = "BLACK") {
-    super(key, value);
-    __publicField(this, "parent");
-    __publicField(this, "_left");
-    __publicField(this, "_right");
-    this._color = color;
+    this.key = key;
+    this.value = value;
+    this.color = color;
   }
+  _left = void 0;
   /**
    * Get the left child pointer.
    * @remarks Time O(1), Space O(1)
@@ -10236,6 +10415,7 @@ var _RedBlackTreeNode = class _RedBlackTreeNode extends BSTNode {
     }
     this._left = v;
   }
+  _right = void 0;
   /**
    * Get the right child pointer.
    * @remarks Time O(1), Space O(1)
@@ -10256,32 +10436,107 @@ var _RedBlackTreeNode = class _RedBlackTreeNode extends BSTNode {
     }
     this._right = v;
   }
-};
-__name(_RedBlackTreeNode, "RedBlackTreeNode");
-var RedBlackTreeNode = _RedBlackTreeNode;
-var _RedBlackTree = class _RedBlackTree extends BST {
-  constructor(keysNodesEntriesOrRaws = [], options) {
-    super([], options);
-    __publicField(this, "_root");
-    this._root = this.NIL;
-    if (keysNodesEntriesOrRaws) {
-      this.addMany(keysNodesEntriesOrRaws);
-    }
-  }
+  _height = 0;
   /**
-   * Get the current root node.
+   * Gets the height of the node (used in self-balancing trees).
    * @remarks Time O(1), Space O(1)
-   * @returns Root node, or undefined.
+   *
+   * @returns The height.
    */
-  get root() {
-    return this._root;
+  get height() {
+    return this._height;
   }
   /**
-   * Create a red-black node for the given key/value (value ignored in map mode).
+   * Sets the height of the node.
    * @remarks Time O(1), Space O(1)
-   * @param key - See parameter type for details.
-   * @param [value] - See parameter type for details.
-   * @param color - See parameter type for details.
+   *
+   * @param value - The new height.
+   */
+  set height(value) {
+    this._height = value;
+  }
+  _color = "BLACK";
+  /**
+   * Gets the color of the node (used in Red-Black trees).
+   * @remarks Time O(1), Space O(1)
+   *
+   * @returns The node's color.
+   */
+  get color() {
+    return this._color;
+  }
+  /**
+   * Sets the color of the node.
+   * @remarks Time O(1), Space O(1)
+   *
+   * @param value - The new color.
+   */
+  set color(value) {
+    this._color = value;
+  }
+  _count = 1;
+  /**
+   * Gets the count of nodes in the subtree rooted at this node (used in order-statistic trees).
+   * @remarks Time O(1), Space O(1)
+   *
+   * @returns The subtree node count.
+   */
+  get count() {
+    return this._count;
+  }
+  /**
+   * Sets the count of nodes in the subtree.
+   * @remarks Time O(1), Space O(1)
+   *
+   * @param value - The new count.
+   */
+  set count(value) {
+    this._count = value;
+  }
+  /**
+   * Gets the position of the node relative to its parent.
+   * @remarks Time O(1), Space O(1)
+   *
+   * @returns The family position (e.g., 'ROOT', 'LEFT', 'RIGHT').
+   */
+  get familyPosition() {
+    if (!this.parent) {
+      return this.left || this.right ? "ROOT" : "ISOLATED";
+    }
+    if (this.parent.left === this) {
+      return this.left || this.right ? "ROOT_LEFT" : "LEFT";
+    } else if (this.parent.right === this) {
+      return this.left || this.right ? "ROOT_RIGHT" : "RIGHT";
+    }
+    return "MAL_NODE";
+  }
+};
+var RedBlackTree = class extends BST {
+  static {
+    __name(this, "RedBlackTree");
+  }
+  constructor(keysNodesEntriesOrRaws = [], options) {
+    super([], options);
+    this._root = this.NIL;
+    if (keysNodesEntriesOrRaws) {
+      this.addMany(keysNodesEntriesOrRaws);
+    }
+  }
+  _root;
+  /**
+   * Get the current root node.
+   * @remarks Time O(1), Space O(1)
+   * @returns Root node, or undefined.
+   */
+  get root() {
+    return this._root;
+  }
+  /**
+   * Create a red-black node for the given key/value (value ignored in map mode).
+   * @remarks Time O(1), Space O(1)
+   * @param key - See parameter type for details.
+   * @param [value] - See parameter type for details.
+   * @param color - See parameter type for details.
    * @returns A new RedBlackTreeNode instance.
    */
   createNode(key, value, color = "BLACK") {
@@ -10406,17 +10661,17 @@ var _RedBlackTree = class _RedBlackTree extends BST {
     const out = this._createLike([], options);
     let index = 0;
     for (const [key, value] of this) {
-      out.add(callback.call(thisArg, key, value, index++, this));
+      out.add(callback.call(thisArg, value, key, index++, this));
     }
     return out;
   }
   _createInstance(options) {
     const Ctor = this.constructor;
-    return new Ctor([], { ...this._snapshotOptions(), ...options != null ? options : {} });
+    return new Ctor([], { ...this._snapshotOptions(), ...options ?? {} });
   }
   _createLike(iter = [], options) {
     const Ctor = this.constructor;
-    return new Ctor(iter, { ...this._snapshotOptions(), ...options != null ? options : {} });
+    return new Ctor(iter, { ...this._snapshotOptions(), ...options ?? {} });
   }
   _setRoot(v) {
     if (v) {
@@ -10435,16 +10690,15 @@ var _RedBlackTree = class _RedBlackTree extends BST {
    * @returns Status string: 'CREATED' or 'UPDATED'.
    */
   _insert(node) {
-    var _a, _b;
-    let current = this.root;
+    let current = this.root ?? this.NIL;
     let parent = void 0;
-    while (this.isRealNode(current)) {
+    while (current !== this.NIL) {
       parent = current;
       const compared = this._compare(node.key, current.key);
       if (compared < 0) {
-        current = (_a = current.left) != null ? _a : this.NIL;
+        current = current.left ?? this.NIL;
       } else if (compared > 0) {
-        current = (_b = current.right) != null ? _b : this.NIL;
+        current = current.right ?? this.NIL;
       } else {
         this._replaceNode(current, node);
         return "UPDATED";
@@ -10490,11 +10744,10 @@ var _RedBlackTree = class _RedBlackTree extends BST {
    * @returns void
    */
   _insertFixup(z) {
-    var _a, _b, _c, _d, _e;
-    while (((_a = z == null ? void 0 : z.parent) == null ? void 0 : _a.color) === "RED") {
-      if (z.parent === ((_b = z.parent.parent) == null ? void 0 : _b.left)) {
+    while (z?.parent?.color === "RED") {
+      if (z.parent === z.parent.parent?.left) {
         const y = z.parent.parent.right;
-        if ((y == null ? void 0 : y.color) === "RED") {
+        if (y?.color === "RED") {
           z.parent.color = "BLACK";
           y.color = "BLACK";
           z.parent.parent.color = "RED";
@@ -10504,15 +10757,15 @@ var _RedBlackTree = class _RedBlackTree extends BST {
             z = z.parent;
             this._leftRotate(z);
           }
-          if (z && this.isRealNode(z.parent) && this.isRealNode(z.parent.parent)) {
+          if (z && z.parent && z.parent.parent) {
             z.parent.color = "BLACK";
             z.parent.parent.color = "RED";
             this._rightRotate(z.parent.parent);
           }
         }
       } else {
-        const y = (_e = (_d = (_c = z == null ? void 0 : z.parent) == null ? void 0 : _c.parent) == null ? void 0 : _d.left) != null ? _e : void 0;
-        if ((y == null ? void 0 : y.color) === "RED") {
+        const y = z?.parent?.parent?.left ?? void 0;
+        if (y?.color === "RED") {
           z.parent.color = "BLACK";
           y.color = "BLACK";
           z.parent.parent.color = "RED";
@@ -10522,7 +10775,7 @@ var _RedBlackTree = class _RedBlackTree extends BST {
             z = z.parent;
             this._rightRotate(z);
           }
-          if (z && this.isRealNode(z.parent) && this.isRealNode(z.parent.parent)) {
+          if (z && z.parent && z.parent.parent) {
             z.parent.color = "BLACK";
             z.parent.parent.color = "RED";
             this._leftRotate(z.parent.parent);
@@ -10539,7 +10792,6 @@ var _RedBlackTree = class _RedBlackTree extends BST {
    * @returns void
    */
   _deleteFixup(node) {
-    var _a, _b, _c, _d;
     if (!node || node === this.root || node.color === "BLACK") {
       if (node) {
         node.color = "BLACK";
@@ -10553,17 +10805,17 @@ var _RedBlackTree = class _RedBlackTree extends BST {
       }
       if (node === parent.left) {
         let sibling = parent.right;
-        if ((sibling == null ? void 0 : sibling.color) === "RED") {
+        if (sibling?.color === "RED") {
           sibling.color = "BLACK";
           parent.color = "RED";
           this._leftRotate(parent);
           sibling = parent.right;
         }
-        if (((_b = (_a = sibling == null ? void 0 : sibling.left) == null ? void 0 : _a.color) != null ? _b : "BLACK") === "BLACK") {
+        if ((sibling?.left?.color ?? "BLACK") === "BLACK") {
           if (sibling) sibling.color = "RED";
           node = parent;
         } else {
-          if (sibling == null ? void 0 : sibling.left) sibling.left.color = "BLACK";
+          if (sibling?.left) sibling.left.color = "BLACK";
           if (sibling) sibling.color = parent.color;
           parent.color = "BLACK";
           this._rightRotate(parent);
@@ -10571,17 +10823,17 @@ var _RedBlackTree = class _RedBlackTree extends BST {
         }
       } else {
         let sibling = parent.left;
-        if ((sibling == null ? void 0 : sibling.color) === "RED") {
+        if (sibling?.color === "RED") {
           sibling.color = "BLACK";
           if (parent) parent.color = "RED";
           this._rightRotate(parent);
           if (parent) sibling = parent.left;
         }
-        if (((_d = (_c = sibling == null ? void 0 : sibling.right) == null ? void 0 : _c.color) != null ? _d : "BLACK") === "BLACK") {
+        if ((sibling?.right?.color ?? "BLACK") === "BLACK") {
           if (sibling) sibling.color = "RED";
           node = parent;
         } else {
-          if (sibling == null ? void 0 : sibling.right) sibling.right.color = "BLACK";
+          if (sibling?.right) sibling.right.color = "BLACK";
           if (sibling) sibling.color = parent.color;
           if (parent) parent.color = "BLACK";
           this._leftRotate(parent);
@@ -10605,7 +10857,7 @@ var _RedBlackTree = class _RedBlackTree extends BST {
     }
     const y = x.right;
     x.right = y.left;
-    if (this.isRealNode(y.left)) {
+    if (y.left && y.left !== this.NIL) {
       y.left.parent = x;
     }
     y.parent = x.parent;
@@ -10631,7 +10883,7 @@ var _RedBlackTree = class _RedBlackTree extends BST {
     }
     const x = y.left;
     y.left = x.right;
-    if (this.isRealNode(x.right)) {
+    if (x.right && x.right !== this.NIL) {
       x.right.parent = y;
     }
     x.parent = y.parent;
@@ -10646,11 +10898,15 @@ var _RedBlackTree = class _RedBlackTree extends BST {
     y.parent = x;
   }
 };
-__name(_RedBlackTree, "RedBlackTree");
-var RedBlackTree = _RedBlackTree;
 
 // src/data-structures/binary-tree/avl-tree-multi-map.ts
-var _AVLTreeMultiMapNode = class _AVLTreeMultiMapNode extends AVLTreeNode {
+var AVLTreeMultiMapNode = class {
+  static {
+    __name(this, "AVLTreeMultiMapNode");
+  }
+  key;
+  value;
+  parent = void 0;
   /**
    * Create an AVLTreeMultiMap node with a value bucket.
    * @remarks Time O(1), Space O(1)
@@ -10658,12 +10914,11 @@ var _AVLTreeMultiMapNode = class _AVLTreeMultiMapNode extends AVLTreeNode {
    * @param value - Initial array of values.
    * @returns New AVLTreeMultiMapNode instance.
    */
-  constructor(key, value) {
-    super(key, value);
-    __publicField(this, "parent");
-    __publicField(this, "_left");
-    __publicField(this, "_right");
+  constructor(key, value = []) {
+    this.key = key;
+    this.value = value;
   }
+  _left = void 0;
   /**
    * Get the left child pointer.
    * @remarks Time O(1), Space O(1)
@@ -10684,6 +10939,7 @@ var _AVLTreeMultiMapNode = class _AVLTreeMultiMapNode extends AVLTreeNode {
     }
     this._left = v;
   }
+  _right = void 0;
   /**
    * Get the right child pointer.
    * @remarks Time O(1), Space O(1)
@@ -10704,10 +10960,85 @@ var _AVLTreeMultiMapNode = class _AVLTreeMultiMapNode extends AVLTreeNode {
     }
     this._right = v;
   }
+  _height = 0;
+  /**
+   * Gets the height of the node (used in self-balancing trees).
+   * @remarks Time O(1), Space O(1)
+   *
+   * @returns The height.
+   */
+  get height() {
+    return this._height;
+  }
+  /**
+   * Sets the height of the node.
+   * @remarks Time O(1), Space O(1)
+   *
+   * @param value - The new height.
+   */
+  set height(value) {
+    this._height = value;
+  }
+  _color = "BLACK";
+  /**
+   * Gets the color of the node (used in Red-Black trees).
+   * @remarks Time O(1), Space O(1)
+   *
+   * @returns The node's color.
+   */
+  get color() {
+    return this._color;
+  }
+  /**
+   * Sets the color of the node.
+   * @remarks Time O(1), Space O(1)
+   *
+   * @param value - The new color.
+   */
+  set color(value) {
+    this._color = value;
+  }
+  _count = 1;
+  /**
+   * Gets the count of nodes in the subtree rooted at this node (used in order-statistic trees).
+   * @remarks Time O(1), Space O(1)
+   *
+   * @returns The subtree node count.
+   */
+  get count() {
+    return this._count;
+  }
+  /**
+   * Sets the count of nodes in the subtree.
+   * @remarks Time O(1), Space O(1)
+   *
+   * @param value - The new count.
+   */
+  set count(value) {
+    this._count = value;
+  }
+  /**
+   * Gets the position of the node relative to its parent.
+   * @remarks Time O(1), Space O(1)
+   *
+   * @returns The family position (e.g., 'ROOT', 'LEFT', 'RIGHT').
+   */
+  get familyPosition() {
+    if (!this.parent) {
+      return this.left || this.right ? "ROOT" : "ISOLATED";
+    }
+    if (this.parent.left === this) {
+      return this.left || this.right ? "ROOT_LEFT" : "LEFT";
+    } else if (this.parent.right === this) {
+      return this.left || this.right ? "ROOT_RIGHT" : "RIGHT";
+    }
+    return "MAL_NODE";
+  }
 };
-__name(_AVLTreeMultiMapNode, "AVLTreeMultiMapNode");
-var AVLTreeMultiMapNode = _AVLTreeMultiMapNode;
-var _AVLTreeMultiMap = class _AVLTreeMultiMap extends AVLTree {
+var AVLTreeMultiMap = class extends AVLTree {
+  static {
+    __name(this, "AVLTreeMultiMap");
+  }
   /**
    * Create an AVLTreeMultiMap and optionally bulk-insert items.
    * @remarks Time O(N log N), Space O(N)
@@ -10724,6 +11055,16 @@ var _AVLTreeMultiMap = class _AVLTreeMultiMap extends AVLTree {
   createNode(key, value = []) {
     return new AVLTreeMultiMapNode(key, this._isMapMode ? [] : value);
   }
+  /**
+   * Checks if the given item is a `AVLTreeMultiMapNode` instance.
+   * @remarks Time O(1), Space O(1)
+   *
+   * @param keyNodeOrEntry - The item to check.
+   * @returns True if it's a AVLTreeMultiMapNode, false otherwise.
+   */
+  isNode(keyNodeOrEntry) {
+    return keyNodeOrEntry instanceof AVLTreeMultiMapNode;
+  }
   /**
    * Insert a value or a list of values into the multimap. If the key exists, values are appended.
    * @remarks Time O(log N + M), Space O(1)
@@ -10832,7 +11173,7 @@ var _AVLTreeMultiMap = class _AVLTreeMultiMap extends AVLTree {
   map(callback, options, thisArg) {
     const out = this._createLike([], options);
     let i = 0;
-    for (const [k, v] of this) out.add(callback.call(thisArg, k, v, i++, this));
+    for (const [k, v] of this) out.add(callback.call(thisArg, v, k, i++, this));
     return out;
   }
   /**
@@ -10845,9 +11186,8 @@ var _AVLTreeMultiMap = class _AVLTreeMultiMap extends AVLTree {
    * @returns An empty like-kind instance.
    */
   _createInstance(options) {
-    var _a, _b;
     const Ctor = this.constructor;
-    return new Ctor([], { ...(_b = (_a = this._snapshotOptions) == null ? void 0 : _a.call(this)) != null ? _b : {}, ...options != null ? options : {} });
+    return new Ctor([], { ...this._snapshotOptions?.() ?? {}, ...options ?? {} });
   }
   /**
    * (Protected) Create a like-kind instance and seed it from an iterable.
@@ -10860,16 +11200,19 @@ var _AVLTreeMultiMap = class _AVLTreeMultiMap extends AVLTree {
    * @returns A like-kind AVLTree built from the iterable.
    */
   _createLike(iter = [], options) {
-    var _a, _b;
     const Ctor = this.constructor;
-    return new Ctor(iter, { ...(_b = (_a = this._snapshotOptions) == null ? void 0 : _a.call(this)) != null ? _b : {}, ...options != null ? options : {} });
+    return new Ctor(iter, { ...this._snapshotOptions?.() ?? {}, ...options ?? {} });
   }
 };
-__name(_AVLTreeMultiMap, "AVLTreeMultiMap");
-var AVLTreeMultiMap = _AVLTreeMultiMap;
 
 // src/data-structures/binary-tree/tree-multi-map.ts
-var _TreeMultiMapNode = class _TreeMultiMapNode extends RedBlackTreeNode {
+var TreeMultiMapNode = class {
+  static {
+    __name(this, "TreeMultiMapNode");
+  }
+  key;
+  value;
+  parent = void 0;
   /**
    * Create a TreeMultiMap node with an optional value bucket.
    * @remarks Time O(1), Space O(1)
@@ -10877,12 +11220,12 @@ var _TreeMultiMapNode = class _TreeMultiMapNode extends RedBlackTreeNode {
    * @param [value] - Initial array of values.
    * @returns New TreeMultiMapNode instance.
    */
-  constructor(key, value) {
-    super(key, value);
-    __publicField(this, "parent");
-    __publicField(this, "_left");
-    __publicField(this, "_right");
+  constructor(key, value = [], color = "BLACK") {
+    this.key = key;
+    this.value = value;
+    this.color = color;
   }
+  _left = void 0;
   /**
    * Get the left child pointer.
    * @remarks Time O(1), Space O(1)
@@ -10903,6 +11246,7 @@ var _TreeMultiMapNode = class _TreeMultiMapNode extends RedBlackTreeNode {
     }
     this._left = v;
   }
+  _right = void 0;
   /**
    * Get the right child pointer.
    * @remarks Time O(1), Space O(1)
@@ -10923,10 +11267,85 @@ var _TreeMultiMapNode = class _TreeMultiMapNode extends RedBlackTreeNode {
     }
     this._right = v;
   }
+  _height = 0;
+  /**
+   * Gets the height of the node (used in self-balancing trees).
+   * @remarks Time O(1), Space O(1)
+   *
+   * @returns The height.
+   */
+  get height() {
+    return this._height;
+  }
+  /**
+   * Sets the height of the node.
+   * @remarks Time O(1), Space O(1)
+   *
+   * @param value - The new height.
+   */
+  set height(value) {
+    this._height = value;
+  }
+  _color = "BLACK";
+  /**
+   * Gets the color of the node (used in Red-Black trees).
+   * @remarks Time O(1), Space O(1)
+   *
+   * @returns The node's color.
+   */
+  get color() {
+    return this._color;
+  }
+  /**
+   * Sets the color of the node.
+   * @remarks Time O(1), Space O(1)
+   *
+   * @param value - The new color.
+   */
+  set color(value) {
+    this._color = value;
+  }
+  _count = 1;
+  /**
+   * Gets the count of nodes in the subtree rooted at this node (used in order-statistic trees).
+   * @remarks Time O(1), Space O(1)
+   *
+   * @returns The subtree node count.
+   */
+  get count() {
+    return this._count;
+  }
+  /**
+   * Sets the count of nodes in the subtree.
+   * @remarks Time O(1), Space O(1)
+   *
+   * @param value - The new count.
+   */
+  set count(value) {
+    this._count = value;
+  }
+  /**
+   * Gets the position of the node relative to its parent.
+   * @remarks Time O(1), Space O(1)
+   *
+   * @returns The family position (e.g., 'ROOT', 'LEFT', 'RIGHT').
+   */
+  get familyPosition() {
+    if (!this.parent) {
+      return this.left || this.right ? "ROOT" : "ISOLATED";
+    }
+    if (this.parent.left === this) {
+      return this.left || this.right ? "ROOT_LEFT" : "LEFT";
+    } else if (this.parent.right === this) {
+      return this.left || this.right ? "ROOT_RIGHT" : "RIGHT";
+    }
+    return "MAL_NODE";
+  }
 };
-__name(_TreeMultiMapNode, "TreeMultiMapNode");
-var TreeMultiMapNode = _TreeMultiMapNode;
-var _TreeMultiMap = class _TreeMultiMap extends RedBlackTree {
+var TreeMultiMap = class extends RedBlackTree {
+  static {
+    __name(this, "TreeMultiMap");
+  }
   /**
    * Create a TreeMultiMap and optionally bulk-insert items.
    * @remarks Time O(N log N), Space O(N)
@@ -10943,6 +11362,16 @@ var _TreeMultiMap = class _TreeMultiMap extends RedBlackTree {
   createNode(key, value = []) {
     return new TreeMultiMapNode(key, this._isMapMode ? [] : value);
   }
+  /**
+   * Checks if the given item is a `TreeMultiMapNode` instance.
+   * @remarks Time O(1), Space O(1)
+   *
+   * @param keyNodeOrEntry - The item to check.
+   * @returns True if it's a TreeMultiMapNode, false otherwise.
+   */
+  isNode(keyNodeOrEntry) {
+    return keyNodeOrEntry instanceof TreeMultiMapNode;
+  }
   /**
    * Insert a value or a list of values into the multimap. If the key exists, values are appended.
    * @remarks Time O(log N + M), Space O(1)
@@ -11023,7 +11452,7 @@ var _TreeMultiMap = class _TreeMultiMap extends RedBlackTree {
   map(callback, options, thisArg) {
     const out = this._createLike([], options);
     let i = 0;
-    for (const [k, v] of this) out.add(callback.call(thisArg, k, v, i++, this));
+    for (const [k, v] of this) out.add(callback.call(thisArg, v, k, i++, this));
     return out;
   }
   /**
@@ -11036,9 +11465,8 @@ var _TreeMultiMap = class _TreeMultiMap extends RedBlackTree {
    * @returns An empty like-kind instance.
    */
   _createInstance(options) {
-    var _a, _b;
     const Ctor = this.constructor;
-    return new Ctor([], { ...(_b = (_a = this._snapshotOptions) == null ? void 0 : _a.call(this)) != null ? _b : {}, ...options != null ? options : {} });
+    return new Ctor([], { ...this._snapshotOptions?.() ?? {}, ...options ?? {} });
   }
   /**
    * (Protected) Create a like-kind instance and seed it from an iterable.
@@ -11051,16 +11479,19 @@ var _TreeMultiMap = class _TreeMultiMap extends RedBlackTree {
    * @returns A like-kind RedBlackTree built from the iterable.
    */
   _createLike(iter = [], options) {
-    var _a, _b;
     const Ctor = this.constructor;
-    return new Ctor(iter, { ...(_b = (_a = this._snapshotOptions) == null ? void 0 : _a.call(this)) != null ? _b : {}, ...options != null ? options : {} });
+    return new Ctor(iter, { ...this._snapshotOptions?.() ?? {}, ...options ?? {} });
   }
 };
-__name(_TreeMultiMap, "TreeMultiMap");
-var TreeMultiMap = _TreeMultiMap;
 
 // src/data-structures/binary-tree/tree-counter.ts
-var _TreeCounterNode = class _TreeCounterNode extends RedBlackTreeNode {
+var TreeCounterNode = class {
+  static {
+    __name(this, "TreeCounterNode");
+  }
+  key;
+  value;
+  parent = void 0;
   /**
    * Create a tree counter node.
    * @remarks Time O(1), Space O(1)
@@ -11071,12 +11502,12 @@ var _TreeCounterNode = class _TreeCounterNode extends RedBlackTreeNode {
    * @returns New TreeCounterNode instance.
    */
   constructor(key, value, count = 1, color = "BLACK") {
-    super(key, value, color);
-    __publicField(this, "parent");
-    __publicField(this, "_left");
-    __publicField(this, "_right");
+    this.key = key;
+    this.value = value;
+    this.color = color;
     this.count = count;
   }
+  _left = void 0;
   /**
    * Get the left child pointer.
    * @remarks Time O(1), Space O(1)
@@ -11097,6 +11528,7 @@ var _TreeCounterNode = class _TreeCounterNode extends RedBlackTreeNode {
     }
     this._left = v;
   }
+  _right = void 0;
   /**
    * Get the right child pointer.
    * @remarks Time O(1), Space O(1)
@@ -11117,10 +11549,85 @@ var _TreeCounterNode = class _TreeCounterNode extends RedBlackTreeNode {
     }
     this._right = v;
   }
+  _height = 0;
+  /**
+   * Gets the height of the node (used in self-balancing trees).
+   * @remarks Time O(1), Space O(1)
+   *
+   * @returns The height.
+   */
+  get height() {
+    return this._height;
+  }
+  /**
+   * Sets the height of the node.
+   * @remarks Time O(1), Space O(1)
+   *
+   * @param value - The new height.
+   */
+  set height(value) {
+    this._height = value;
+  }
+  _color = "BLACK";
+  /**
+   * Gets the color of the node (used in Red-Black trees).
+   * @remarks Time O(1), Space O(1)
+   *
+   * @returns The node's color.
+   */
+  get color() {
+    return this._color;
+  }
+  /**
+   * Sets the color of the node.
+   * @remarks Time O(1), Space O(1)
+   *
+   * @param value - The new color.
+   */
+  set color(value) {
+    this._color = value;
+  }
+  _count = 1;
+  /**
+   * Gets the count of nodes in the subtree rooted at this node (used in order-statistic trees).
+   * @remarks Time O(1), Space O(1)
+   *
+   * @returns The subtree node count.
+   */
+  get count() {
+    return this._count;
+  }
+  /**
+   * Sets the count of nodes in the subtree.
+   * @remarks Time O(1), Space O(1)
+   *
+   * @param value - The new count.
+   */
+  set count(value) {
+    this._count = value;
+  }
+  /**
+   * Gets the position of the node relative to its parent.
+   * @remarks Time O(1), Space O(1)
+   *
+   * @returns The family position (e.g., 'ROOT', 'LEFT', 'RIGHT').
+   */
+  get familyPosition() {
+    if (!this.parent) {
+      return this.left || this.right ? "ROOT" : "ISOLATED";
+    }
+    if (this.parent.left === this) {
+      return this.left || this.right ? "ROOT_LEFT" : "LEFT";
+    } else if (this.parent.right === this) {
+      return this.left || this.right ? "ROOT_RIGHT" : "RIGHT";
+    }
+    return "MAL_NODE";
+  }
 };
-__name(_TreeCounterNode, "TreeCounterNode");
-var TreeCounterNode = _TreeCounterNode;
-var _TreeCounter = class _TreeCounter extends RedBlackTree {
+var TreeCounter = class extends RedBlackTree {
+  static {
+    __name(this, "TreeCounter");
+  }
   /**
    * Create a TreeCounter and optionally bulk-insert items.
    * @remarks Time O(N log N), Space O(N)
@@ -11130,9 +11637,9 @@ var _TreeCounter = class _TreeCounter extends RedBlackTree {
    */
   constructor(keysNodesEntriesOrRaws = [], options) {
     super([], options);
-    __publicField(this, "_count", 0);
     if (keysNodesEntriesOrRaws) this.addMany(keysNodesEntriesOrRaws);
   }
+  _count = 0;
   /**
    * Get the total aggregate count across all nodes.
    * @remarks Time O(1), Space O(1)
@@ -11172,7 +11679,7 @@ var _TreeCounter = class _TreeCounter extends RedBlackTree {
    */
   add(keyNodeOrEntry, value, count = 1) {
     const [newNode, newValue] = this._keyValueNodeOrEntryToNodeAndValue(keyNodeOrEntry, value, count);
-    const orgCount = (newNode == null ? void 0 : newNode.count) || 0;
+    const orgCount = newNode?.count || 0;
     const isSuccessAdded = super.add(newNode, newValue);
     if (isSuccessAdded) {
       this._count += orgCount;
@@ -11326,7 +11833,7 @@ var _TreeCounter = class _TreeCounter extends RedBlackTree {
     const out = this._createLike([], options);
     let index = 0;
     for (const [key, value] of this) {
-      out.add(callback.call(thisArg, key, value, index++, this));
+      out.add(callback.call(thisArg, value, key, index++, this));
     }
     return out;
   }
@@ -11352,7 +11859,7 @@ var _TreeCounter = class _TreeCounter extends RedBlackTree {
    */
   _createInstance(options) {
     const Ctor = this.constructor;
-    return new Ctor([], { ...this._snapshotOptions(), ...options != null ? options : {} });
+    return new Ctor([], { ...this._snapshotOptions(), ...options ?? {} });
   }
   /**
    * (Protected) Create a like-kind instance and seed it from an iterable.
@@ -11368,7 +11875,7 @@ var _TreeCounter = class _TreeCounter extends RedBlackTree {
     const Ctor = this.constructor;
     return new Ctor(iter, {
       ...this._snapshotOptions(),
-      ...options != null ? options : {}
+      ...options ?? {}
     });
   }
   /**
@@ -11385,7 +11892,7 @@ var _TreeCounter = class _TreeCounter extends RedBlackTree {
     if (this.isEntry(keyNodeOrEntry)) {
       const [key, entryValue] = keyNodeOrEntry;
       if (key === void 0 || key === null) return [void 0, void 0];
-      const finalValue = value != null ? value : entryValue;
+      const finalValue = value ?? entryValue;
       return [this.createNode(key, finalValue, "BLACK", count), finalValue];
     }
     return [this.createNode(keyNodeOrEntry, value, "BLACK", count), value];
@@ -11430,11 +11937,15 @@ var _TreeCounter = class _TreeCounter extends RedBlackTree {
     return super._replaceNode(oldNode, newNode);
   }
 };
-__name(_TreeCounter, "TreeCounter");
-var TreeCounter = _TreeCounter;
 
 // src/data-structures/binary-tree/avl-tree-counter.ts
-var _AVLTreeCounterNode = class _AVLTreeCounterNode extends AVLTreeNode {
+var AVLTreeCounterNode = class {
+  static {
+    __name(this, "AVLTreeCounterNode");
+  }
+  key;
+  value;
+  parent = void 0;
   /**
    * Create an AVL counter node.
    * @remarks Time O(1), Space O(1)
@@ -11444,12 +11955,11 @@ var _AVLTreeCounterNode = class _AVLTreeCounterNode extends AVLTreeNode {
    * @returns New AVLTreeCounterNode instance.
    */
   constructor(key, value, count = 1) {
-    super(key, value);
-    __publicField(this, "parent");
-    __publicField(this, "_left");
-    __publicField(this, "_right");
+    this.key = key;
+    this.value = value;
     this.count = count;
   }
+  _left = void 0;
   /**
    * Get the left child pointer.
    * @remarks Time O(1), Space O(1)
@@ -11470,6 +11980,7 @@ var _AVLTreeCounterNode = class _AVLTreeCounterNode extends AVLTreeNode {
     }
     this._left = v;
   }
+  _right = void 0;
   /**
    * Get the right child pointer.
    * @remarks Time O(1), Space O(1)
@@ -11490,10 +12001,85 @@ var _AVLTreeCounterNode = class _AVLTreeCounterNode extends AVLTreeNode {
     }
     this._right = v;
   }
+  _height = 0;
+  /**
+   * Gets the height of the node (used in self-balancing trees).
+   * @remarks Time O(1), Space O(1)
+   *
+   * @returns The height.
+   */
+  get height() {
+    return this._height;
+  }
+  /**
+   * Sets the height of the node.
+   * @remarks Time O(1), Space O(1)
+   *
+   * @param value - The new height.
+   */
+  set height(value) {
+    this._height = value;
+  }
+  _color = "BLACK";
+  /**
+   * Gets the color of the node (used in Red-Black trees).
+   * @remarks Time O(1), Space O(1)
+   *
+   * @returns The node's color.
+   */
+  get color() {
+    return this._color;
+  }
+  /**
+   * Sets the color of the node.
+   * @remarks Time O(1), Space O(1)
+   *
+   * @param value - The new color.
+   */
+  set color(value) {
+    this._color = value;
+  }
+  _count = 1;
+  /**
+   * Gets the count of nodes in the subtree rooted at this node (used in order-statistic trees).
+   * @remarks Time O(1), Space O(1)
+   *
+   * @returns The subtree node count.
+   */
+  get count() {
+    return this._count;
+  }
+  /**
+   * Sets the count of nodes in the subtree.
+   * @remarks Time O(1), Space O(1)
+   *
+   * @param value - The new count.
+   */
+  set count(value) {
+    this._count = value;
+  }
+  /**
+   * Gets the position of the node relative to its parent.
+   * @remarks Time O(1), Space O(1)
+   *
+   * @returns The family position (e.g., 'ROOT', 'LEFT', 'RIGHT').
+   */
+  get familyPosition() {
+    if (!this.parent) {
+      return this.left || this.right ? "ROOT" : "ISOLATED";
+    }
+    if (this.parent.left === this) {
+      return this.left || this.right ? "ROOT_LEFT" : "LEFT";
+    } else if (this.parent.right === this) {
+      return this.left || this.right ? "ROOT_RIGHT" : "RIGHT";
+    }
+    return "MAL_NODE";
+  }
 };
-__name(_AVLTreeCounterNode, "AVLTreeCounterNode");
-var AVLTreeCounterNode = _AVLTreeCounterNode;
-var _AVLTreeCounter = class _AVLTreeCounter extends AVLTree {
+var AVLTreeCounter = class extends AVLTree {
+  static {
+    __name(this, "AVLTreeCounter");
+  }
   /**
    * Create a AVLTreeCounter instance
    * @remarks Time O(n), Space O(n)
@@ -11503,9 +12089,9 @@ var _AVLTreeCounter = class _AVLTreeCounter extends AVLTree {
    */
   constructor(keysNodesEntriesOrRaws = [], options) {
     super([], options);
-    __publicField(this, "_count", 0);
     if (keysNodesEntriesOrRaws) this.addMany(keysNodesEntriesOrRaws);
   }
+  _count = 0;
   get count() {
     return this._count;
   }
@@ -11541,7 +12127,7 @@ var _AVLTreeCounter = class _AVLTreeCounter extends AVLTree {
   add(keyNodeOrEntry, value, count = 1) {
     const [newNode, newValue] = this._keyValueNodeOrEntryToNodeAndValue(keyNodeOrEntry, value, count);
     if (newNode === void 0) return false;
-    const orgNodeCount = (newNode == null ? void 0 : newNode.count) || 0;
+    const orgNodeCount = newNode?.count || 0;
     const inserted = super.add(newNode, newValue);
     if (inserted) {
       this._count += orgNodeCount;
@@ -11556,12 +12142,11 @@ var _AVLTreeCounter = class _AVLTreeCounter extends AVLTree {
    * @returns Array of deletion results including deleted node and a rebalance hint when present.
    */
   delete(keyNodeOrEntry, ignoreCount = false) {
-    var _a;
     const deletedResult = [];
     if (!this.root) return deletedResult;
-    const curr = (_a = this.getNode(keyNodeOrEntry)) != null ? _a : void 0;
+    const curr = this.getNode(keyNodeOrEntry) ?? void 0;
     if (!curr) return deletedResult;
-    const parent = (curr == null ? void 0 : curr.parent) ? curr.parent : void 0;
+    const parent = curr?.parent ? curr.parent : void 0;
     let needBalanced = void 0, orgCurrent = curr;
     if (curr.count > 1 && !ignoreCount) {
       curr.count--;
@@ -11673,7 +12258,7 @@ var _AVLTreeCounter = class _AVLTreeCounter extends AVLTree {
     const out = this._createLike([], options);
     let index = 0;
     for (const [key, value] of this) {
-      out.add(callback.call(thisArg, key, value, index++, this));
+      out.add(callback.call(thisArg, value, key, index++, this));
     }
     return out;
   }
@@ -11688,7 +12273,7 @@ var _AVLTreeCounter = class _AVLTreeCounter extends AVLTree {
    */
   _createInstance(options) {
     const Ctor = this.constructor;
-    return new Ctor([], { ...this._snapshotOptions(), ...options != null ? options : {} });
+    return new Ctor([], { ...this._snapshotOptions(), ...options ?? {} });
   }
   /**
    * (Protected) Create a like-kind instance and seed it from an iterable.
@@ -11702,7 +12287,7 @@ var _AVLTreeCounter = class _AVLTreeCounter extends AVLTree {
    */
   _createLike(iter = [], options) {
     const Ctor = this.constructor;
-    return new Ctor(iter, { ...this._snapshotOptions(), ...options != null ? options : {} });
+    return new Ctor(iter, { ...this._snapshotOptions(), ...options ?? {} });
   }
   /**
    * (Protected) Normalize input into a node plus its effective value and count.
@@ -11718,7 +12303,7 @@ var _AVLTreeCounter = class _AVLTreeCounter extends AVLTree {
     if (this.isEntry(keyNodeOrEntry)) {
       const [key, entryValue] = keyNodeOrEntry;
       if (key === void 0 || key === null) return [void 0, void 0];
-      const finalValue = value != null ? value : entryValue;
+      const finalValue = value ?? entryValue;
       return [this.createNode(key, finalValue, count), finalValue];
     }
     return [this.createNode(keyNodeOrEntry, value, count), value];
@@ -11763,20 +12348,22 @@ var _AVLTreeCounter = class _AVLTreeCounter extends AVLTree {
     return super._replaceNode(oldNode, newNode);
   }
 };
-__name(_AVLTreeCounter, "AVLTreeCounter");
-var AVLTreeCounter = _AVLTreeCounter;
 
 // src/data-structures/priority-queue/priority-queue.ts
-var _PriorityQueue = class _PriorityQueue extends Heap {
+var PriorityQueue = class extends Heap {
+  static {
+    __name(this, "PriorityQueue");
+  }
   constructor(elements = [], options) {
     super(elements, options);
   }
 };
-__name(_PriorityQueue, "PriorityQueue");
-var PriorityQueue = _PriorityQueue;
 
 // src/data-structures/priority-queue/min-priority-queue.ts
-var _MinPriorityQueue = class _MinPriorityQueue extends PriorityQueue {
+var MinPriorityQueue = class extends PriorityQueue {
+  static {
+    __name(this, "MinPriorityQueue");
+  }
   /**
    * Creates a min-priority queue.
    * @param elements Optional initial elements to insert.
@@ -11787,11 +12374,12 @@ var _MinPriorityQueue = class _MinPriorityQueue extends PriorityQueue {
     super(elements, options);
   }
 };
-__name(_MinPriorityQueue, "MinPriorityQueue");
-var MinPriorityQueue = _MinPriorityQueue;
 
 // src/data-structures/priority-queue/max-priority-queue.ts
-var _MaxPriorityQueue = class _MaxPriorityQueue extends PriorityQueue {
+var MaxPriorityQueue = class extends PriorityQueue {
+  static {
+    __name(this, "MaxPriorityQueue");
+  }
   /**
    * Creates a max-priority queue.
    * @param elements Optional initial elements to insert.
@@ -11815,11 +12403,12 @@ var _MaxPriorityQueue = class _MaxPriorityQueue extends PriorityQueue {
     });
   }
 };
-__name(_MaxPriorityQueue, "MaxPriorityQueue");
-var MaxPriorityQueue = _MaxPriorityQueue;
 
 // src/data-structures/matrix/matrix.ts
-var _Matrix = class _Matrix {
+var Matrix = class _Matrix {
+  static {
+    __name(this, "Matrix");
+  }
   /**
    * The constructor function initializes a matrix object with the provided data and options, or with
    * default values if no options are provided.
@@ -11828,22 +12417,18 @@ var _Matrix = class _Matrix {
    * properties:
    */
   constructor(data, options) {
-    __publicField(this, "_rows", 0);
-    __publicField(this, "_cols", 0);
-    __publicField(this, "_data");
-    var _a, _b, _c;
     if (options) {
       const { rows, cols, addFn, subtractFn, multiplyFn } = options;
       if (typeof rows === "number" && rows > 0) this._rows = rows;
       else this._rows = data.length;
       if (typeof cols === "number" && cols > 0) this._cols = cols;
-      else this._cols = ((_a = data[0]) == null ? void 0 : _a.length) || 0;
+      else this._cols = data[0]?.length || 0;
       if (addFn) this._addFn = addFn;
       if (subtractFn) this._subtractFn = subtractFn;
       if (multiplyFn) this._multiplyFn = multiplyFn;
     } else {
       this._rows = data.length;
-      this._cols = (_c = (_b = data[0]) == null ? void 0 : _b.length) != null ? _c : 0;
+      this._cols = data[0]?.length ?? 0;
     }
     if (data.length > 0) {
       this._data = data;
@@ -11854,6 +12439,7 @@ var _Matrix = class _Matrix {
       }
     }
   }
+  _rows = 0;
   /**
    * The function returns the number of rows.
    * @returns The number of rows.
@@ -11861,6 +12447,7 @@ var _Matrix = class _Matrix {
   get rows() {
     return this._rows;
   }
+  _cols = 0;
   /**
    * The function returns the value of the protected variable _cols.
    * @returns The number of columns.
@@ -11868,6 +12455,7 @@ var _Matrix = class _Matrix {
   get cols() {
     return this._cols;
   }
+  _data;
   /**
    * The function returns a two-dimensional array of numbers.
    * @returns The data property, which is a two-dimensional array of numbers.
@@ -12066,7 +12654,6 @@ var _Matrix = class _Matrix {
    * @returns a Matrix object, which represents the inverse of the original matrix.
    */
   inverse() {
-    var _a;
     if (this.rows !== this.cols) {
       throw new Error("Matrix must be square for inversion.");
     }
@@ -12093,7 +12680,7 @@ var _Matrix = class _Matrix {
         throw new Error("Matrix is singular, and its inverse does not exist.");
       }
       augmentedMatrix._swapRows(i, pivotRow);
-      const pivotElement = (_a = augmentedMatrix.get(i, i)) != null ? _a : 1;
+      const pivotElement = augmentedMatrix.get(i, i) ?? 1;
       if (pivotElement === 0) {
         throw new Error("Matrix is singular, and its inverse does not exist (division by zero).");
       }
@@ -12236,11 +12823,14 @@ var _Matrix = class _Matrix {
     }
   }
 };
-__name(_Matrix, "Matrix");
-var Matrix = _Matrix;
 
 // src/data-structures/matrix/navigator.ts
-var _Character = class _Character {
+var Character = class _Character {
+  static {
+    __name(this, "Character");
+  }
+  direction;
+  turn;
   /**
    * The constructor function takes in a direction and turning object and sets the direction and turn properties of the
    * Character class.
@@ -12250,26 +12840,25 @@ var _Character = class _Character {
    * turning direction. It is used to determine the new direction when the character turns.
    */
   constructor(direction, turning) {
-    __publicField(this, "direction");
-    __publicField(this, "turn");
     this.direction = direction;
     this.turn = () => new _Character(turning[direction], turning);
   }
 };
-__name(_Character, "Character");
-var Character = _Character;
-var _Navigator = class _Navigator {
+var Navigator = class {
+  static {
+    __name(this, "Navigator");
+  }
+  onMove;
+  _matrix;
+  _cur;
+  _character;
+  _VISITED;
   /**
    * The constructor initializes the Navigator object with the given parameters and sets the current position as visited
    * in the matrix.
    * @param  - - `matrix`: a 2D array representing the grid or map
    */
   constructor({ matrix, turning, onMove, init: { cur, charDir, VISITED } }) {
-    __publicField(this, "onMove");
-    __publicField(this, "_matrix");
-    __publicField(this, "_cur");
-    __publicField(this, "_character");
-    __publicField(this, "_VISITED");
     this._matrix = matrix;
     this._cur = cur;
     this._character = new Character(charDir, turning);
@@ -12347,24 +12936,23 @@ var _Navigator = class _Navigator {
     if (this.onMove) this.onMove(this._cur);
   }
 };
-__name(_Navigator, "Navigator");
-var Navigator = _Navigator;
 
 // src/data-structures/trie/trie.ts
-var _TrieNode = class _TrieNode {
+var TrieNode = class {
+  static {
+    __name(this, "TrieNode");
+  }
   /**
    * Create a Trie node with a character key.
    * @remarks Time O(1), Space O(1)
    * @returns New TrieNode instance.
    */
   constructor(key) {
-    __publicField(this, "_key");
-    __publicField(this, "_children");
-    __publicField(this, "_isEnd");
     this._key = key;
     this._isEnd = false;
     this._children = /* @__PURE__ */ new Map();
   }
+  _key;
   /**
    * Get the character key of this node.
    * @remarks Time O(1), Space O(1)
@@ -12382,6 +12970,7 @@ var _TrieNode = class _TrieNode {
   set key(value) {
     this._key = value;
   }
+  _children;
   /**
    * Get the child map of this node.
    * @remarks Time O(1), Space O(1)
@@ -12399,6 +12988,7 @@ var _TrieNode = class _TrieNode {
   set children(value) {
     this._children = value;
   }
+  _isEnd;
   /**
    * Check whether this node marks the end of a word.
    * @remarks Time O(1), Space O(1)
@@ -12417,9 +13007,10 @@ var _TrieNode = class _TrieNode {
     this._isEnd = value;
   }
 };
-__name(_TrieNode, "TrieNode");
-var TrieNode = _TrieNode;
-var _Trie = class _Trie extends IterableElementBase {
+var Trie = class extends IterableElementBase {
+  static {
+    __name(this, "Trie");
+  }
   /**
    * Create a Trie and optionally bulk-insert words.
    * @remarks Time O(totalChars), Space O(totalChars)
@@ -12429,9 +13020,6 @@ var _Trie = class _Trie extends IterableElementBase {
    */
   constructor(words = [], options) {
     super(options);
-    __publicField(this, "_size", 0);
-    __publicField(this, "_caseSensitive", true);
-    __publicField(this, "_root", new TrieNode(""));
     if (options) {
       const { caseSensitive } = options;
       if (caseSensitive !== void 0) this._caseSensitive = caseSensitive;
@@ -12440,6 +13028,7 @@ var _Trie = class _Trie extends IterableElementBase {
       this.addMany(words);
     }
   }
+  _size = 0;
   /**
    * Get the number of stored words.
    * @remarks Time O(1), Space O(1)
@@ -12448,6 +13037,7 @@ var _Trie = class _Trie extends IterableElementBase {
   get size() {
     return this._size;
   }
+  _caseSensitive = true;
   /**
    * Get whether comparisons are case-sensitive.
    * @remarks Time O(1), Space O(1)
@@ -12456,6 +13046,7 @@ var _Trie = class _Trie extends IterableElementBase {
   get caseSensitive() {
     return this._caseSensitive;
   }
+  _root = new TrieNode("");
   /**
    * Get the root node.
    * @remarks Time O(1), Space O(1)
@@ -12785,7 +13376,7 @@ var _Trie = class _Trie extends IterableElementBase {
     const next = new Ctor([], {
       toElementFn: this.toElementFn,
       caseSensitive: this.caseSensitive,
-      ...options != null ? options : {}
+      ...options ?? {}
     });
     return next;
   }
@@ -12841,11 +13432,12 @@ var _Trie = class _Trie extends IterableElementBase {
     return str;
   }
 };
-__name(_Trie, "Trie");
-var Trie = _Trie;
 
 // src/data-structures/tree/tree.ts
-var _TreeNode = class _TreeNode {
+var TreeNode = class _TreeNode {
+  static {
+    __name(this, "TreeNode");
+  }
   /**
    * The constructor function initializes a TreeNode object with a key, optional value, and optional
    * children.
@@ -12857,13 +13449,11 @@ var _TreeNode = class _TreeNode {
    * default value is an empty array.
    */
   constructor(key, value, children) {
-    __publicField(this, "_key");
-    __publicField(this, "_value");
-    __publicField(this, "_children");
     this._key = key;
     this._value = value || void 0;
     if (children) this._children = children;
   }
+  _key;
   /**
    * The function returns the value of the protected variable _key.
    * @returns The value of the `_key` property, which is a string.
@@ -12879,6 +13469,7 @@ var _TreeNode = class _TreeNode {
   set key(value) {
     this._key = value;
   }
+  _value;
   /**
    * The function returns the value stored in a variable, or undefined if the variable is empty.
    * @returns The value of the variable `_value` is being returned.
@@ -12894,6 +13485,7 @@ var _TreeNode = class _TreeNode {
   set value(value) {
     this._value = value;
   }
+  _children;
   /**
    * The function returns an array of TreeNode objects or undefined.
    * @returns The `children` property is being returned. It is of type `TreeNode<V>[] | undefined`,
@@ -12949,8 +13541,6 @@ var _TreeNode = class _TreeNode {
     return maxDepth;
   }
 };
-__name(_TreeNode, "TreeNode");
-var TreeNode = _TreeNode;
 /**
  * data-structure-typed
  *