data-structure-typed 2.1.1 → 2.2.0

package/dist/{index.js → esm-legacy/index.mjs}

@@ -1,11 +1,10 @@
 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 {
-  static {
-    __name(this, "IterableEntryBase");
-  }
+var _IterableEntryBase = class _IterableEntryBase {
   /**
    * Default iterator yielding `[key, value]` entries.
    * @returns Iterator of `[K, V]`.
@@ -174,12 +173,11 @@ var IterableEntryBase = class {
     console.log(this.toVisual());
   }
 };
+__name(_IterableEntryBase, "IterableEntryBase");
+var IterableEntryBase = _IterableEntryBase;
 
 // src/data-structures/base/iterable-element-base.ts
-var IterableElementBase = class {
-  static {
-    __name(this, "IterableElementBase");
-  }
+var _IterableElementBase = class _IterableElementBase {
   /**
    * Create a new iterable base.
    *
@@ -190,19 +188,19 @@ var IterableElementBase = class {
    * 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.
    *
@@ -397,6 +395,8 @@ var IterableElementBase = class {
     console.log(this.toVisual());
   }
 };
+__name(_IterableElementBase, "IterableElementBase");
+var IterableElementBase = _IterableElementBase;
 
 // src/utils/utils.ts
 var uuidV4 = /* @__PURE__ */ __name(function() {
@@ -517,10 +517,7 @@ function toBinaryString(num, digit = 32) {
 __name(toBinaryString, "toBinaryString");
 
 // src/data-structures/hash/hash-map.ts
-var HashMap = class extends IterableEntryBase {
-  static {
-    __name(this, "HashMap");
-  }
+var _HashMap = class _HashMap extends IterableEntryBase {
   /**
    * Create a HashMap and optionally bulk-insert entries.
    * @remarks Time O(N), Space O(N)
@@ -530,6 +527,11 @@ var HashMap = class 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;
@@ -537,7 +539,6 @@ var HashMap = class extends IterableEntryBase {
     }
     if (entryOrRawElements) this.setMany(entryOrRawElements);
   }
-  _store = {};
   /**
    * Get the internal store for non-object keys.
    * @remarks Time O(1), Space O(1)
@@ -546,7 +547,6 @@ var HashMap = class 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,7 +555,6 @@ var HashMap = class extends IterableEntryBase {
   get objMap() {
     return this._objMap;
   }
-  _toEntryFn;
   /**
    * Get the raw→entry converter function if present.
    * @remarks Time O(1), Space O(1)
@@ -564,7 +563,6 @@ var HashMap = class extends IterableEntryBase {
   get toEntryFn() {
     return this._toEntryFn;
   }
-  _size = 0;
   /**
    * Get the number of distinct keys stored.
    * @remarks Time O(1), Space O(1)
@@ -573,7 +571,6 @@ var HashMap = class 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)
@@ -649,9 +646,10 @@ var HashMap = class 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 this._store[strKey]?.value;
+    return (_a = this._store[strKey]) == null ? void 0 : _a.value;
   }
   /**
    * Check if a key exists.
@@ -776,11 +774,9 @@ var HashMap = class extends IterableEntryBase {
     return strKey;
   }
 };
-var LinkedHashMap = class extends IterableEntryBase {
-  static {
-    __name(this, "LinkedHashMap");
-  }
-  _sentinel;
+__name(_HashMap, "HashMap");
+var HashMap = _HashMap;
+var _LinkedHashMap = class _LinkedHashMap extends IterableEntryBase {
   /**
    * Create a LinkedHashMap and optionally bulk-insert entries.
    * @remarks Time O(N), Space O(N)
@@ -790,6 +786,22 @@ var LinkedHashMap = class 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) {
@@ -800,11 +812,9 @@ var LinkedHashMap = class 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)
@@ -813,7 +823,6 @@ var LinkedHashMap = class extends IterableEntryBase {
   get objHashFn() {
     return this._objHashFn;
   }
-  _noObjMap = {};
   /**
    * Get the internal record for non-object keys.
    * @remarks Time O(1), Space O(1)
@@ -822,11 +831,9 @@ var LinkedHashMap = class 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)
@@ -835,7 +842,6 @@ var LinkedHashMap = class extends IterableEntryBase {
   get head() {
     return this._head;
   }
-  _tail;
   /**
    * Get the tail node (last entry) sentinel link.
    * @remarks Time O(1), Space O(1)
@@ -844,18 +850,9 @@ var LinkedHashMap = class 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;
   }
@@ -1098,22 +1095,22 @@ var LinkedHashMap = class extends IterableEntryBase {
     return new Ctor(entries, options);
   }
 };
+__name(_LinkedHashMap, "LinkedHashMap");
+var LinkedHashMap = _LinkedHashMap;
 
 // src/data-structures/base/linear-base.ts
-var LinkedListNode = class {
-  static {
-    __name(this, "LinkedListNode");
-  }
+var _LinkedListNode = class _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.
@@ -1130,7 +1127,6 @@ var LinkedListNode = class {
   set value(value) {
     this._value = value;
   }
-  _next;
   /**
    * Next node getter.
    * @returns Next node or `undefined`.
@@ -1148,10 +1144,9 @@ var LinkedListNode = class {
     this._next = value;
   }
 };
-var LinearBase = class _LinearBase extends IterableElementBase {
-  static {
-    __name(this, "LinearBase");
-  }
+__name(_LinkedListNode, "LinkedListNode");
+var LinkedListNode = _LinkedListNode;
+var _LinearBase = class _LinearBase extends IterableElementBase {
   /**
    * Construct a linear container with runtime options.
    * @param options - `{ maxLen?, ... }` bounds/behavior options.
@@ -1159,12 +1154,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.
@@ -1297,7 +1292,7 @@ var LinearBase = class _LinearBase extends IterableElementBase {
     return array;
   }
   reduceRight(callbackfn, initialValue) {
-    let accumulator = initialValue ?? 0;
+    let accumulator = initialValue != null ? initialValue : 0;
     for (let i = this.length - 1; i >= 0; i--) {
       accumulator = callbackfn(accumulator, this.at(i), i, this);
     }
@@ -1339,10 +1334,9 @@ var LinearBase = class _LinearBase extends IterableElementBase {
     return this;
   }
 };
-var LinearLinkedBase = class extends LinearBase {
-  static {
-    __name(this, "LinearLinkedBase");
-  }
+__name(_LinearBase, "LinearBase");
+var LinearBase = _LinearBase;
+var _LinearLinkedBase = class _LinearLinkedBase extends LinearBase {
   constructor(options) {
     super(options);
     if (options) {
@@ -1472,7 +1466,7 @@ var LinearLinkedBase = class extends LinearBase {
     return removedList;
   }
   reduceRight(callbackfn, initialValue) {
-    let accumulator = initialValue ?? 0;
+    let accumulator = initialValue != null ? initialValue : 0;
     let index = this.length - 1;
     for (const item of this._getReverseIterator()) {
       accumulator = callbackfn(accumulator, item, index--, this);
@@ -1480,12 +1474,11 @@ var LinearLinkedBase = class extends LinearBase {
     return accumulator;
   }
 };
+__name(_LinearLinkedBase, "LinearLinkedBase");
+var LinearLinkedBase = _LinearLinkedBase;
 
 // src/data-structures/linked-list/singly-linked-list.ts
-var SinglyLinkedListNode = class extends LinkedListNode {
-  static {
-    __name(this, "SinglyLinkedListNode");
-  }
+var _SinglyLinkedListNode = class _SinglyLinkedListNode extends LinkedListNode {
   /**
    * Create a list node.
    * @remarks Time O(1), Space O(1)
@@ -1494,10 +1487,10 @@ var SinglyLinkedListNode = class 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)
@@ -1516,11 +1509,9 @@ var SinglyLinkedListNode = class extends LinkedListNode {
     this._next = value;
   }
 };
-var SinglyLinkedList = class extends LinearLinkedBase {
-  static {
-    __name(this, "SinglyLinkedList");
-  }
-  _equals = Object.is;
+__name(_SinglyLinkedListNode, "SinglyLinkedListNode");
+var SinglyLinkedListNode = _SinglyLinkedListNode;
+var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
   /**
    * Create a SinglyLinkedList and optionally bulk-insert elements.
    * @remarks Time O(N), Space O(N)
@@ -1530,9 +1521,12 @@ var SinglyLinkedList = class 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)
@@ -1541,7 +1535,6 @@ var SinglyLinkedList = class extends LinearLinkedBase {
   get head() {
     return this._head;
   }
-  _tail;
   /**
    * Get the tail node.
    * @remarks Time O(1), Space O(1)
@@ -1550,7 +1543,6 @@ var SinglyLinkedList = class extends LinearLinkedBase {
   get tail() {
     return this._tail;
   }
-  _length = 0;
   /**
    * Get the number of elements.
    * @remarks Time O(1), Space O(1)
@@ -1565,7 +1557,8 @@ var SinglyLinkedList = class extends LinearLinkedBase {
    * @returns First element or undefined.
    */
   get first() {
-    return this.head?.value;
+    var _a;
+    return (_a = this.head) == null ? void 0 : _a.value;
   }
   /**
    * Get the last element value.
@@ -1573,7 +1566,8 @@ var SinglyLinkedList = class extends LinearLinkedBase {
    * @returns Last element or undefined.
    */
   get last() {
-    return this.tail?.value;
+    var _a;
+    return (_a = this.tail) == null ? void 0 : _a.value;
   }
   /**
    * Create a new list from an iterable of elements.
@@ -2052,7 +2046,7 @@ var SinglyLinkedList = class extends LinearLinkedBase {
    * @returns A new SinglyLinkedList with mapped values.
    */
   map(callback, options, thisArg) {
-    const out = this._createLike([], { ...options ?? {}, maxLen: this._maxLen });
+    const out = this._createLike([], { ...options != null ? options : {}, maxLen: this._maxLen });
     let index = 0;
     for (const value of this) out.push(callback.call(thisArg, value, index++, this));
     return out;
@@ -2063,7 +2057,7 @@ var SinglyLinkedList = class extends LinearLinkedBase {
    * @param value - Value to wrap in a node.
    * @returns A new SinglyLinkedListNode instance.
    */
-  _createNode(value) {
+  createNode(value) {
     return new SinglyLinkedListNode(value);
   }
   /**
@@ -2083,7 +2077,7 @@ var SinglyLinkedList = class extends LinearLinkedBase {
    */
   _ensureNode(elementOrNode) {
     if (this.isNode(elementOrNode)) return elementOrNode;
-    return this._createNode(elementOrNode);
+    return this.createNode(elementOrNode);
   }
   /**
    * (Protected) Normalize input into a node predicate.
@@ -2177,6 +2171,8 @@ var SinglyLinkedList = class 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;
@@ -2186,10 +2182,7 @@ function elementOrPredicate(input, equals) {
 __name(elementOrPredicate, "elementOrPredicate");
 
 // src/data-structures/linked-list/doubly-linked-list.ts
-var DoublyLinkedListNode = class extends LinkedListNode {
-  static {
-    __name(this, "DoublyLinkedListNode");
-  }
+var _DoublyLinkedListNode = class _DoublyLinkedListNode extends LinkedListNode {
   /**
    * Create a node.
    * @remarks Time O(1), Space O(1)
@@ -2198,11 +2191,12 @@ var DoublyLinkedListNode = class 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)
@@ -2220,7 +2214,6 @@ var DoublyLinkedListNode = class extends LinkedListNode {
   set next(value) {
     this._next = value;
   }
-  _prev;
   /**
    * Get the previous node link.
    * @remarks Time O(1), Space O(1)
@@ -2239,11 +2232,9 @@ var DoublyLinkedListNode = class extends LinkedListNode {
     this._prev = value;
   }
 };
-var DoublyLinkedList = class extends LinearLinkedBase {
-  static {
-    __name(this, "DoublyLinkedList");
-  }
-  _equals = Object.is;
+__name(_DoublyLinkedListNode, "DoublyLinkedListNode");
+var DoublyLinkedListNode = _DoublyLinkedListNode;
+var _DoublyLinkedList = class _DoublyLinkedList extends LinearLinkedBase {
   /**
    * Create a DoublyLinkedList and optionally bulk-insert elements.
    * @remarks Time O(N), Space O(N)
@@ -2253,15 +2244,18 @@ var DoublyLinkedList = class 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?.maxLen && Number.isInteger(options.maxLen) && options.maxLen > 0) {
+    if ((options == null ? void 0 : 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)
@@ -2270,7 +2264,6 @@ var DoublyLinkedList = class extends LinearLinkedBase {
   get head() {
     return this._head;
   }
-  _tail;
   /**
    * Get the tail node.
    * @remarks Time O(1), Space O(1)
@@ -2279,7 +2272,6 @@ var DoublyLinkedList = class extends LinearLinkedBase {
   get tail() {
     return this._tail;
   }
-  _length = 0;
   /**
    * Get the number of elements.
    * @remarks Time O(1), Space O(1)
@@ -2294,7 +2286,8 @@ var DoublyLinkedList = class extends LinearLinkedBase {
    * @returns First element or undefined.
    */
   get first() {
-    return this.head?.value;
+    var _a;
+    return (_a = this.head) == null ? void 0 : _a.value;
   }
   /**
    * Get the last element value.
@@ -2302,7 +2295,8 @@ var DoublyLinkedList = class extends LinearLinkedBase {
    * @returns Last element or undefined.
    */
   get last() {
-    return this.tail?.value;
+    var _a;
+    return (_a = this.tail) == null ? void 0 : _a.value;
   }
   /**
    * Create a new list from an array of elements.
@@ -2717,7 +2711,7 @@ var DoublyLinkedList = class extends LinearLinkedBase {
    * @returns A new DoublyLinkedList with mapped values.
    */
   map(callback, options, thisArg) {
-    const out = this._createLike([], { ...options ?? {}, maxLen: this._maxLen });
+    const out = this._createLike([], { ...options != null ? options : {}, maxLen: this._maxLen });
     let index = 0;
     for (const v of this) out.push(callback.call(thisArg, v, index++, this));
     return out;
@@ -2803,26 +2797,28 @@ var DoublyLinkedList = class extends LinearLinkedBase {
     }
   }
 };
+__name(_DoublyLinkedList, "DoublyLinkedList");
+var DoublyLinkedList = _DoublyLinkedList;
 
 // src/data-structures/linked-list/skip-linked-list.ts
-var SkipListNode = class {
-  static {
-    __name(this, "SkipListNode");
-  }
-  key;
-  value;
-  forward;
+var _SkipListNode = class _SkipListNode {
   constructor(key, value, level) {
+    __publicField(this, "key");
+    __publicField(this, "value");
+    __publicField(this, "forward");
     this.key = key;
     this.value = value;
     this.forward = new Array(level);
   }
 };
-var SkipList = class {
-  static {
-    __name(this, "SkipList");
-  }
+__name(_SkipListNode, "SkipListNode");
+var SkipListNode = _SkipListNode;
+var _SkipList = class _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;
@@ -2832,19 +2828,15 @@ var SkipList = class {
       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;
   }
@@ -2950,13 +2942,11 @@ var SkipList = class {
     return level;
   }
 };
+__name(_SkipList, "SkipList");
+var SkipList = _SkipList;
 
 // src/data-structures/stack/stack.ts
-var Stack = class extends IterableElementBase {
-  static {
-    __name(this, "Stack");
-  }
-  _equals = Object.is;
+var _Stack = class _Stack extends IterableElementBase {
   /**
    * Create a Stack and optionally bulk-push elements.
    * @remarks Time O(N), Space O(N)
@@ -2966,9 +2956,10 @@ var Stack = class 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)
@@ -3143,7 +3134,7 @@ var Stack = class extends IterableElementBase {
    * @returns A new Stack with mapped elements.
    */
   map(callback, options, thisArg) {
-    const out = this._createLike([], { ...options ?? {} });
+    const out = this._createLike([], { ...options != null ? options : {} });
     let index = 0;
     for (const v of this) {
       out.push(thisArg === void 0 ? callback(v, index, this) : callback.call(thisArg, v, index, this));
@@ -3203,12 +3194,11 @@ var Stack = class 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 {
-  static {
-    __name(this, "Queue");
-  }
+var _Queue = class _Queue extends LinearBase {
   /**
    * Create a Queue and optionally bulk-insert elements.
    * @remarks Time O(N), Space O(N)
@@ -3218,13 +3208,15 @@ 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)
@@ -3233,7 +3225,6 @@ 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)
@@ -3242,7 +3233,6 @@ 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)
@@ -3487,10 +3477,11 @@ 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?.toElementFn,
-      maxLen: options?.maxLen ?? this._maxLen,
-      autoCompactRatio: options?.autoCompactRatio ?? this._autoCompactRatio
+      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
     });
     let index = 0;
     for (const v of this)
@@ -3505,13 +3496,14 @@ 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
     });
-    out._setAutoCompactRatio?.(this._autoCompactRatio);
+    (_a = out._setAutoCompactRatio) == null ? void 0 : _a.call(out, 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);
@@ -3571,10 +3563,9 @@ var Queue = class _Queue extends LinearBase {
     return new Ctor(elements, options);
   }
 };
-var LinkedListQueue = class extends SinglyLinkedList {
-  static {
-    __name(this, "LinkedListQueue");
-  }
+__name(_Queue, "Queue");
+var Queue = _Queue;
+var _LinkedListQueue = class _LinkedListQueue extends SinglyLinkedList {
   /**
    * Deep clone this linked-list-based queue.
    * @remarks Time O(N), Space O(N)
@@ -3586,13 +3577,11 @@ var LinkedListQueue = class extends SinglyLinkedList {
     return out;
   }
 };
+__name(_LinkedListQueue, "LinkedListQueue");
+var LinkedListQueue = _LinkedListQueue;
 
 // src/data-structures/queue/deque.ts
-var Deque = class extends LinearBase {
-  static {
-    __name(this, "Deque");
-  }
-  _equals = Object.is;
+var _Deque = class _Deque extends LinearBase {
   /**
    * Create a Deque and optionally bulk-insert elements.
    * @remarks Time O(N), Space O(N)
@@ -3602,6 +3591,15 @@ var Deque = class 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;
@@ -3621,7 +3619,6 @@ var Deque = class 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)
@@ -3630,7 +3627,6 @@ var Deque = class 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)
@@ -3639,7 +3635,6 @@ var Deque = class extends LinearBase {
   get bucketFirst() {
     return this._bucketFirst;
   }
-  _firstInBucket = 0;
   /**
    * Get the index inside the first bucket.
    * @remarks Time O(1), Space O(1)
@@ -3648,7 +3643,6 @@ var Deque = class 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)
@@ -3657,7 +3651,6 @@ var Deque = class extends LinearBase {
   get bucketLast() {
     return this._bucketLast;
   }
-  _lastInBucket = 0;
   /**
    * Get the index inside the last bucket.
    * @remarks Time O(1), Space O(1)
@@ -3666,7 +3659,6 @@ var Deque = class extends LinearBase {
   get lastInBucket() {
     return this._lastInBucket;
   }
-  _bucketCount = 0;
   /**
    * Get the number of buckets allocated.
    * @remarks Time O(1), Space O(1)
@@ -3675,7 +3667,6 @@ var Deque = class extends LinearBase {
   get bucketCount() {
     return this._bucketCount;
   }
-  _buckets = [];
   /**
    * Get the internal buckets array.
    * @remarks Time O(1), Space O(1)
@@ -3684,7 +3675,6 @@ var Deque = class extends LinearBase {
   get buckets() {
     return this._buckets;
   }
-  _length = 0;
   /**
    * Get the number of elements in the deque.
    * @remarks Time O(1), Space O(1)
@@ -4200,7 +4190,7 @@ var Deque = class extends LinearBase {
    */
   map(callback, options, thisArg) {
     const out = this._createLike([], {
-      ...options ?? {},
+      ...options != null ? options : {},
       bucketSize: this._bucketSize,
       maxLen: this._maxLen
     });
@@ -4314,13 +4304,11 @@ var Deque = class extends LinearBase {
     }
   }
 };
+__name(_Deque, "Deque");
+var Deque = _Deque;
 
 // src/data-structures/heap/heap.ts
-var Heap = class _Heap extends IterableElementBase {
-  static {
-    __name(this, "Heap");
-  }
-  _equals = Object.is;
+var _Heap = class _Heap extends IterableElementBase {
   /**
    * Create a Heap and optionally bulk-insert elements.
    * @remarks Time O(N), Space O(N)
@@ -4330,13 +4318,23 @@ 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)
@@ -4359,7 +4357,8 @@ var Heap = class _Heap extends IterableElementBase {
    * @returns Last element or undefined.
    */
   get leaf() {
-    return this.elements[this.size - 1] ?? void 0;
+    var _a;
+    return (_a = this.elements[this.size - 1]) != null ? _a : void 0;
   }
   /**
    * Create a heap of the same class from an iterable.
@@ -4632,7 +4631,7 @@ var Heap = class _Heap extends IterableElementBase {
    * @returns A new heap with mapped elements.
    */
   map(callback, options, thisArg) {
-    const { comparator, toElementFn, ...rest } = options ?? {};
+    const { comparator, toElementFn, ...rest } = options != null ? options : {};
     if (!comparator) throw new TypeError("Heap.map requires options.comparator for EM");
     const out = this._createLike([], { ...rest, comparator, toElementFn });
     let i = 0;
@@ -4658,15 +4657,6 @@ 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)
@@ -4720,7 +4710,7 @@ var Heap = class _Heap extends IterableElementBase {
    */
   _createInstance(options) {
     const Ctor = this.constructor;
-    const next = new Ctor([], { comparator: this.comparator, toElementFn: this.toElementFn, ...options ?? {} });
+    const next = new Ctor([], { comparator: this.comparator, toElementFn: this.toElementFn, ...options != null ? options : {} });
     return next;
   }
   /**
@@ -4748,27 +4738,25 @@ var Heap = class _Heap extends IterableElementBase {
     return this._createLike([], options);
   }
 };
-var FibonacciHeapNode = class {
-  static {
-    __name(this, "FibonacciHeapNode");
-  }
-  element;
-  degree;
-  left;
-  right;
-  child;
-  parent;
-  marked;
+__name(_Heap, "Heap");
+var Heap = _Heap;
+var _FibonacciHeapNode = class _FibonacciHeapNode {
   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;
   }
 };
-var FibonacciHeap = class {
-  static {
-    __name(this, "FibonacciHeap");
-  }
+__name(_FibonacciHeapNode, "FibonacciHeapNode");
+var FibonacciHeapNode = _FibonacciHeapNode;
+var _FibonacciHeap = class _FibonacciHeap {
   /**
    * Create a FibonacciHeap.
    * @remarks Time O(1), Space O(1)
@@ -4776,11 +4764,14 @@ var FibonacciHeap = class {
    * @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)
@@ -4789,11 +4780,9 @@ var FibonacciHeap = class {
   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)
@@ -4802,7 +4791,6 @@ var FibonacciHeap = class {
   get min() {
     return this._min;
   }
-  _comparator;
   get comparator() {
     return this._comparator;
   }
@@ -4822,7 +4810,7 @@ var FibonacciHeap = class {
    * @returns This heap.
    */
   push(element) {
-    const node = this._createNode(element);
+    const node = this.createNode(element);
     node.left = node;
     node.right = node;
     this.mergeWithRoot(node);
@@ -4921,7 +4909,7 @@ var FibonacciHeap = class {
     this._size += heapToMerge.size;
     heapToMerge.clear();
   }
-  _createNode(element) {
+  createNode(element) {
     return new FibonacciHeapNode(element);
   }
   isEmpty() {
@@ -4979,12 +4967,11 @@ var FibonacciHeap = class {
     }
   }
 };
+__name(_FibonacciHeap, "FibonacciHeap");
+var FibonacciHeap = _FibonacciHeap;
 
 // src/data-structures/heap/max-heap.ts
-var MaxHeap = class extends Heap {
-  static {
-    __name(this, "MaxHeap");
-  }
+var _MaxHeap = class _MaxHeap extends Heap {
   /**
    * Create a max-heap. For objects, supply a custom comparator.
    * @param elements Optional initial elements.
@@ -5006,12 +4993,11 @@ var MaxHeap = class extends Heap {
     });
   }
 };
+__name(_MaxHeap, "MaxHeap");
+var MaxHeap = _MaxHeap;
 
 // src/data-structures/heap/min-heap.ts
-var MinHeap = class extends Heap {
-  static {
-    __name(this, "MinHeap");
-  }
+var _MinHeap = class _MinHeap extends Heap {
   /**
    * Create a min-heap.
    * @param elements Optional initial elements.
@@ -5021,39 +5007,36 @@ var MinHeap = class extends Heap {
     super(elements, options);
   }
 };
+__name(_MinHeap, "MinHeap");
+var MinHeap = _MinHeap;
 
 // src/data-structures/graph/abstract-graph.ts
-var AbstractVertex = class {
-  static {
-    __name(this, "AbstractVertex");
-  }
-  key;
-  value;
+var _AbstractVertex = class _AbstractVertex {
   constructor(key, value) {
+    __publicField(this, "key");
+    __publicField(this, "value");
     this.key = key;
     this.value = value;
   }
 };
-var AbstractEdge = class {
-  static {
-    __name(this, "AbstractEdge");
-  }
-  value;
-  weight;
+__name(_AbstractVertex, "AbstractVertex");
+var AbstractVertex = _AbstractVertex;
+var _AbstractEdge = class _AbstractEdge {
   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;
   }
 };
-var AbstractGraph = class extends IterableEntryBase {
-  static {
-    __name(this, "AbstractGraph");
-  }
+__name(_AbstractEdge, "AbstractEdge");
+var AbstractEdge = _AbstractEdge;
+var _AbstractGraph = class _AbstractGraph extends IterableEntryBase {
   /**
    * Construct a graph with runtime defaults.
    * @param options - `GraphOptions<V>` in `options.graph` (e.g. `vertexValueInitializer`, `defaultEdgeWeight`).
@@ -5061,14 +5044,14 @@ var AbstractGraph = class extends IterableEntryBase {
    */
   constructor(options) {
     super();
-    const graph = options?.graph;
-    this._options = { defaultEdgeWeight: 1, ...graph ?? {} };
+    __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 : {} };
   }
-  _options = { defaultEdgeWeight: 1 };
   get options() {
     return this._options;
   }
-  _vertexMap = /* @__PURE__ */ new Map();
   get vertexMap() {
     return this._vertexMap;
   }
@@ -5226,9 +5209,10 @@ var AbstractGraph = class 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 += this.getEdge(path[i], path[i + 1])?.weight || 0;
+      sum += ((_a = this.getEdge(path[i], path[i + 1])) == null ? void 0 : _a.weight) || 0;
     }
     return sum;
   }
@@ -5290,6 +5274,7 @@ var AbstractGraph = class 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) {
@@ -5307,7 +5292,7 @@ var AbstractGraph = class extends IterableEntryBase {
         }
         return allPaths[minIndex] || void 0;
       } else {
-        return this.dijkstra(v1, v2, true, true)?.minPath ?? [];
+        return (_b = (_a = this.dijkstra(v1, v2, true, true)) == null ? void 0 : _a.minPath) != null ? _b : [];
       }
     } else {
       let minPath = [];
@@ -5436,6 +5421,7 @@ var AbstractGraph = class 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 = [];
@@ -5473,8 +5459,8 @@ var AbstractGraph = class extends IterableEntryBase {
     }, "getPaths");
     while (heap.size > 0) {
       const curHeapNode = heap.poll();
-      const dist = curHeapNode?.key;
-      const cur = curHeapNode?.value;
+      const dist = curHeapNode == null ? void 0 : curHeapNode.key;
+      const cur = curHeapNode == null ? void 0 : curHeapNode.value;
       if (dist !== void 0) {
         if (cur) {
           seen.add(cur);
@@ -5490,7 +5476,7 @@ var AbstractGraph = class extends IterableEntryBase {
           const neighbors = this.getNeighbors(cur);
           for (const neighbor of neighbors) {
             if (!seen.has(neighbor)) {
-              const weight = this.getEdge(cur, neighbor)?.weight;
+              const weight = (_a = this.getEdge(cur, neighbor)) == null ? void 0 : _a.weight;
               if (typeof weight === "number") {
                 const distSrcToNeighbor = distMap.get(neighbor);
                 if (distSrcToNeighbor !== void 0) {
@@ -5613,6 +5599,7 @@ var AbstractGraph = class extends IterableEntryBase {
    * @remarks Time O(V^3), Space O(V^2)
    */
   floydWarshall() {
+    var _a;
     const idAndVertices = [...this._vertexMap];
     const n = idAndVertices.length;
     const costs = [];
@@ -5626,7 +5613,7 @@ var AbstractGraph = class extends IterableEntryBase {
     }
     for (let i = 0; i < n; i++) {
       for (let j = 0; j < n; j++) {
-        costs[i][j] = this.getEdge(idAndVertices[i][1], idAndVertices[j][1])?.weight || Number.MAX_SAFE_INTEGER;
+        costs[i][j] = ((_a = this.getEdge(idAndVertices[i][1], idAndVertices[j][1])) == null ? void 0 : _a.weight) || Number.MAX_SAFE_INTEGER;
       }
     }
     for (let k = 0; k < n; k++) {
@@ -5769,7 +5756,7 @@ var AbstractGraph = class extends IterableEntryBase {
   _createInstance(_options) {
     const Ctor = this.constructor;
     const instance = new Ctor();
-    const graph = _options?.graph;
+    const graph = _options == null ? void 0 : _options.graph;
     if (graph) instance._options = { ...instance._options, ...graph };
     else instance._options = { ...instance._options, ...this._options };
     return instance;
@@ -5848,32 +5835,29 @@ var AbstractGraph = class 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 extends AbstractVertex {
-  static {
-    __name(this, "DirectedVertex");
-  }
+var _DirectedVertex = class _DirectedVertex extends AbstractVertex {
   constructor(key, value) {
     super(key, value);
   }
 };
-var DirectedEdge = class extends AbstractEdge {
-  static {
-    __name(this, "DirectedEdge");
-  }
-  src;
-  dest;
+__name(_DirectedVertex, "DirectedVertex");
+var DirectedVertex = _DirectedVertex;
+var _DirectedEdge = class _DirectedEdge extends AbstractEdge {
   constructor(src, dest, weight, value) {
     super(weight, value);
+    __publicField(this, "src");
+    __publicField(this, "dest");
     this.src = src;
     this.dest = dest;
   }
 };
-var DirectedGraph = class _DirectedGraph extends AbstractGraph {
-  static {
-    __name(this, "DirectedGraph");
-  }
+__name(_DirectedEdge, "DirectedEdge");
+var DirectedEdge = _DirectedEdge;
+var _DirectedGraph = class _DirectedGraph extends AbstractGraph {
   /**
    * Construct a directed graph with runtime defaults.
    * @param options - `GraphOptions<V>` (e.g. `vertexValueInitializer`, `defaultEdgeWeight`).
@@ -5881,15 +5865,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;
   }
@@ -5942,7 +5926,8 @@ var DirectedGraph = class _DirectedGraph extends AbstractGraph {
    * @remarks Time O(1), Space O(1)
    */
   createEdge(src, dest, weight, value) {
-    return new DirectedEdge(src, dest, weight ?? this.options.defaultEdgeWeight ?? 1, value);
+    var _a;
+    return new DirectedEdge(src, dest, (_a = weight != null ? weight : this.options.defaultEdgeWeight) != null ? _a : 1, value);
   }
   /**
    * Get the unique edge from `src` to `dest`, if present.
@@ -6013,7 +5998,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?.key);
+        arrayRemove(srcOutEdges, (edge) => edge.src === src.key && edge.dest === (dest == null ? void 0 : dest.key));
       }
       const destInEdges = this._inEdgeMap.get(dest);
       if (destInEdges && destInEdges.length > 0) {
@@ -6135,7 +6120,7 @@ var DirectedGraph = class _DirectedGraph extends AbstractGraph {
    * @remarks Time O(V + E), Space O(V)
    */
   topologicalSort(propertyName) {
-    propertyName = propertyName ?? "key";
+    propertyName = propertyName != null ? propertyName : "key";
     const statusMap = /* @__PURE__ */ new Map();
     for (const entry of this.vertexMap) {
       statusMap.set(entry[1], 0);
@@ -6328,30 +6313,27 @@ var DirectedGraph = class _DirectedGraph extends AbstractGraph {
     }
   }
 };
+__name(_DirectedGraph, "DirectedGraph");
+var DirectedGraph = _DirectedGraph;
 
 // src/data-structures/graph/undirected-graph.ts
-var UndirectedVertex = class extends AbstractVertex {
-  static {
-    __name(this, "UndirectedVertex");
-  }
+var _UndirectedVertex = class _UndirectedVertex extends AbstractVertex {
   constructor(key, value) {
     super(key, value);
   }
 };
-var UndirectedEdge = class extends AbstractEdge {
-  static {
-    __name(this, "UndirectedEdge");
-  }
-  endpoints;
+__name(_UndirectedVertex, "UndirectedVertex");
+var UndirectedVertex = _UndirectedVertex;
+var _UndirectedEdge = class _UndirectedEdge extends AbstractEdge {
   constructor(v1, v2, weight, value) {
     super(weight, value);
+    __publicField(this, "endpoints");
     this.endpoints = [v1, v2];
   }
 };
-var UndirectedGraph = class _UndirectedGraph extends AbstractGraph {
-  static {
-    __name(this, "UndirectedGraph");
-  }
+__name(_UndirectedEdge, "UndirectedEdge");
+var UndirectedEdge = _UndirectedEdge;
+var _UndirectedGraph = class _UndirectedGraph extends AbstractGraph {
   /**
    * Construct an undirected graph with runtime defaults.
    * @param options - `GraphOptions<V>` (e.g. `vertexValueInitializer`, `defaultEdgeWeight`).
@@ -6359,9 +6341,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;
   }
@@ -6414,7 +6396,8 @@ var UndirectedGraph = class _UndirectedGraph extends AbstractGraph {
    * @remarks Time O(1), Space O(1)
    */
   createEdge(v1, v2, weight, value) {
-    return new UndirectedEdge(v1, v2, weight ?? this.options.defaultEdgeWeight ?? 1, value);
+    var _a;
+    return new UndirectedEdge(v1, v2, (_a = weight != null ? weight : this.options.defaultEdgeWeight) != null ? _a : 1, value);
   }
   /**
    * Get an undirected edge between two vertices, if present.
@@ -6424,12 +6407,13 @@ 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 = this._edgeMap.get(vertex1)?.filter((e) => e.endpoints.includes(vertex2.key));
+        edgeMap = (_a = this._edgeMap.get(vertex1)) == null ? void 0 : _a.filter((e) => e.endpoints.includes(vertex2.key));
       }
     }
     return edgeMap ? edgeMap[0] || void 0 : void 0;
@@ -6522,9 +6506,10 @@ 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 this._edgeMap.get(vertex)?.length || 0;
+      return ((_a = this._edgeMap.get(vertex)) == null ? void 0 : _a.length) || 0;
     } else {
       return 0;
     }
@@ -6717,32 +6702,29 @@ var UndirectedGraph = class _UndirectedGraph extends AbstractGraph {
     return true;
   }
 };
+__name(_UndirectedGraph, "UndirectedGraph");
+var UndirectedGraph = _UndirectedGraph;
 
 // src/data-structures/graph/map-graph.ts
-var MapVertex = class extends DirectedVertex {
-  static {
-    __name(this, "MapVertex");
-  }
-  lat;
-  long;
+var _MapVertex = class _MapVertex extends DirectedVertex {
   constructor(key, value, lat, long) {
     super(key, value);
+    __publicField(this, "lat");
+    __publicField(this, "long");
     this.lat = lat;
     this.long = long;
   }
 };
-var MapEdge = class extends DirectedEdge {
-  static {
-    __name(this, "MapEdge");
-  }
+__name(_MapVertex, "MapVertex");
+var MapVertex = _MapVertex;
+var _MapEdge = class _MapEdge extends DirectedEdge {
   constructor(src, dest, weight, value) {
     super(src, dest, weight, value);
   }
 };
-var MapGraph = class _MapGraph extends DirectedGraph {
-  static {
-    __name(this, "MapGraph");
-  }
+__name(_MapEdge, "MapEdge");
+var MapEdge = _MapEdge;
+var _MapGraph = class _MapGraph extends DirectedGraph {
   /**
    * Construct a MapGraph.
    * @param originCoord - Origin coordinate `[lat, long]` used as default.
@@ -6751,14 +6733,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;
   }
@@ -6810,11 +6792,13 @@ var MapGraph = class _MapGraph extends DirectedGraph {
    */
   _createInstance(options) {
     const { originCoord, bottomRight } = options || {};
-    const oc = originCoord ?? this.originCoord;
-    const br = bottomRight ?? this.bottomRight;
+    const oc = originCoord != null ? originCoord : this.originCoord;
+    const br = bottomRight != null ? bottomRight : this.bottomRight;
     return new _MapGraph(oc, br);
   }
 };
+__name(_MapGraph, "MapGraph");
+var MapGraph = _MapGraph;
 
 // src/common/index.ts
 var DFSOperation = /* @__PURE__ */ ((DFSOperation2) => {
@@ -6822,7 +6806,7 @@ var DFSOperation = /* @__PURE__ */ ((DFSOperation2) => {
   DFSOperation2[DFSOperation2["PROCESS"] = 1] = "PROCESS";
   return DFSOperation2;
 })(DFSOperation || {});
-var Range = class {
+var _Range = class _Range {
   constructor(low, high, includeLow = true, includeHigh = true) {
     this.low = low;
     this.high = high;
@@ -6831,9 +6815,6 @@ var Range = class {
     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;
@@ -6841,15 +6822,11 @@ var Range = class {
     return lowCheck && highCheck;
   }
 };
+__name(_Range, "Range");
+var Range = _Range;
 
 // src/data-structures/binary-tree/binary-tree.ts
-var BinaryTreeNode = class {
-  static {
-    __name(this, "BinaryTreeNode");
-  }
-  key;
-  value;
-  parent = void 0;
+var _BinaryTreeNode = class _BinaryTreeNode {
   /**
    * Creates an instance of BinaryTreeNode.
    * @remarks Time O(1), Space O(1)
@@ -6858,10 +6835,17 @@ var BinaryTreeNode = class {
    * @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)
@@ -6883,7 +6867,6 @@ var BinaryTreeNode = class {
     }
     this._left = v;
   }
-  _right = void 0;
   /**
    * Gets the right child of the node.
    * @remarks Time O(1), Space O(1)
@@ -6905,7 +6888,6 @@ var BinaryTreeNode = class {
     }
     this._right = v;
   }
-  _height = 0;
   /**
    * Gets the height of the node (used in self-balancing trees).
    * @remarks Time O(1), Space O(1)
@@ -6924,7 +6906,6 @@ var BinaryTreeNode = class {
   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)
@@ -6943,7 +6924,6 @@ var BinaryTreeNode = class {
   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)
@@ -6980,11 +6960,9 @@ var BinaryTreeNode = class {
     return "MAL_NODE";
   }
 };
-var BinaryTree = class extends IterableEntryBase {
-  static {
-    __name(this, "BinaryTree");
-  }
-  iterationType = "ITERATIVE";
+__name(_BinaryTreeNode, "BinaryTreeNode");
+var BinaryTreeNode = _BinaryTreeNode;
+var _BinaryTree = class _BinaryTree extends IterableEntryBase {
   /**
    * 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.
@@ -6994,6 +6972,22 @@ var BinaryTree = class 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;
@@ -7004,7 +6998,6 @@ var BinaryTree = class 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)
@@ -7014,7 +7007,6 @@ var BinaryTree = class extends IterableEntryBase {
   get isMapMode() {
     return this._isMapMode;
   }
-  _isDuplicate = false;
   /**
    * Gets whether the tree allows duplicate keys.
    * @remarks Time O(1)
@@ -7024,7 +7016,6 @@ var BinaryTree = class extends IterableEntryBase {
   get isDuplicate() {
     return this._isDuplicate;
   }
-  _store = /* @__PURE__ */ new Map();
   /**
    * Gets the external value store (used in Map mode).
    * @remarks Time O(1)
@@ -7034,7 +7025,6 @@ var BinaryTree = class extends IterableEntryBase {
   get store() {
     return this._store;
   }
-  _root;
   /**
    * Gets the root node of the tree.
    * @remarks Time O(1)
@@ -7044,7 +7034,6 @@ var BinaryTree = class extends IterableEntryBase {
   get root() {
     return this._root;
   }
-  _size = 0;
   /**
    * Gets the number of nodes in the tree.
    * @remarks Time O(1)
@@ -7054,7 +7043,6 @@ var BinaryTree = class 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)
@@ -7064,7 +7052,6 @@ var BinaryTree = class 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)
@@ -7082,7 +7069,7 @@ var BinaryTree = class extends IterableEntryBase {
    * @param [value] - The value for the new node (used if not in Map mode).
    * @returns The newly created node.
    */
-  _createNode(key, value) {
+  createNode(key, value) {
     return new BinaryTreeNode(key, this._isMapMode ? void 0 : value);
   }
   /**
@@ -7224,7 +7211,7 @@ var BinaryTree = class extends IterableEntryBase {
     if (newNode === void 0) return false;
     if (!this._root) {
       this._setRoot(newNode);
-      if (this._isMapMode) this._setValue(newNode?.key, newValue);
+      if (this._isMapMode) this._setValue(newNode == null ? void 0 : newNode.key, newValue);
       this._size = 1;
       return true;
     }
@@ -7256,7 +7243,7 @@ var BinaryTree = class extends IterableEntryBase {
       } else if (potentialParent.right === void 0) {
         potentialParent.right = newNode;
       }
-      if (this._isMapMode) this._setValue(newNode?.key, newValue);
+      if (this._isMapMode) this._setValue(newNode == null ? void 0 : newNode.key, newValue);
       this._size++;
       return true;
     }
@@ -7321,7 +7308,7 @@ var BinaryTree = class extends IterableEntryBase {
     if (!this._root) return deletedResult;
     const curr = this.getNode(keyNodeOrEntry);
     if (!curr) return deletedResult;
-    const parent = curr?.parent;
+    const parent = curr == null ? void 0 : curr.parent;
     let needBalanced;
     let orgCurrent = curr;
     if (!curr.left && !curr.right && !parent) {
@@ -7426,12 +7413,13 @@ var BinaryTree = class 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 this.getNode(keyNodeEntryOrPredicate, startNode, iterationType)?.value;
+    return (_a = this.getNode(keyNodeEntryOrPredicate, startNode, iterationType)) == null ? void 0 : _a.value;
   }
   has(keyNodeEntryOrPredicate, startNode = this._root, iterationType = this.iterationType) {
     return this.search(keyNodeEntryOrPredicate, true, (node) => node, startNode, iterationType).length > 0;
@@ -7519,7 +7507,7 @@ var BinaryTree = class extends IterableEntryBase {
     let distEnsured = this.ensureNode(dist);
     const beginRootEnsured = this.ensureNode(startNode);
     let depth = 0;
-    while (distEnsured?.parent) {
+    while (distEnsured == null ? void 0 : distEnsured.parent) {
       if (distEnsured === beginRootEnsured) {
         return depth;
       }
@@ -8081,10 +8069,10 @@ var BinaryTree = class extends IterableEntryBase {
       const dfs = /* @__PURE__ */ __name((node) => {
         if (!shouldVisitRoot(node)) return;
         const visitLeft = /* @__PURE__ */ __name(() => {
-          if (shouldVisitLeft(node) && node?.left !== void 0) dfs(node?.left);
+          if (shouldVisitLeft(node) && (node == null ? void 0 : node.left) !== void 0) dfs(node == null ? void 0 : node.left);
         }, "visitLeft");
         const visitRight = /* @__PURE__ */ __name(() => {
-          if (shouldVisitRight(node) && node?.right !== void 0) dfs(node?.right);
+          if (shouldVisitRight(node) && (node == null ? void 0 : node.right) !== void 0) dfs(node == null ? void 0 : node.right);
         }, "visitRight");
         switch (pattern) {
           case "IN":
@@ -8117,10 +8105,12 @@ var BinaryTree = class extends IterableEntryBase {
     } else {
       const stack = [{ opt: 0 /* VISIT */, node: startNode }];
       const pushLeft = /* @__PURE__ */ __name((cur) => {
-        if (shouldVisitLeft(cur.node)) stack.push({ opt: 0 /* VISIT */, node: cur.node?.left });
+        var _a;
+        if (shouldVisitLeft(cur.node)) stack.push({ opt: 0 /* VISIT */, node: (_a = cur.node) == null ? void 0 : _a.left });
       }, "pushLeft");
       const pushRight = /* @__PURE__ */ __name((cur) => {
-        if (shouldVisitRight(cur.node)) stack.push({ opt: 0 /* VISIT */, node: cur.node?.right });
+        var _a;
+        if (shouldVisitRight(cur.node)) stack.push({ opt: 0 /* VISIT */, node: (_a = cur.node) == null ? void 0 : _a.right });
       }, "pushRight");
       const pushRoot = /* @__PURE__ */ __name((cur) => {
         if (shouldVisitRoot(cur.node)) stack.push({ opt: 1 /* PROCESS */, node: cur.node });
@@ -8192,14 +8182,6 @@ var BinaryTree = class 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)
@@ -8225,7 +8207,7 @@ var BinaryTree = class extends IterableEntryBase {
    */
   _createInstance(options) {
     const Ctor = this.constructor;
-    return new Ctor([], { ...this._snapshotOptions(), ...options ?? {} });
+    return new Ctor([], { ...this._snapshotOptions(), ...options != null ? options : {} });
   }
   /**
    * (Protected) Creates a new instance of the same tree constructor, potentially with different generic types.
@@ -8238,7 +8220,7 @@ var BinaryTree = class extends IterableEntryBase {
    */
   _createLike(iter = [], options) {
     const Ctor = this.constructor;
-    return new Ctor(iter, { ...this._snapshotOptions(), ...options ?? {} });
+    return new Ctor(iter, { ...this._snapshotOptions(), ...options != null ? options : {} });
   }
   /**
    * (Protected) Converts a key, node, or entry into a standardized [node, value] tuple.
@@ -8256,10 +8238,10 @@ var BinaryTree = class 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 ?? entryValue;
-      return [this._createNode(key, finalValue), finalValue];
+      const finalValue = value != null ? value : entryValue;
+      return [this.createNode(key, finalValue), finalValue];
     }
-    return [this._createNode(keyNodeOrEntry, value), value];
+    return [this.createNode(keyNodeOrEntry, value), value];
   }
   /**
    * (Protected) Helper for cloning. Performs a BFS and adds all nodes to the new tree.
@@ -8344,7 +8326,7 @@ var BinaryTree = class extends IterableEntryBase {
     destNode = this.ensureNode(destNode);
     if (srcNode && destNode) {
       const { key, value } = destNode;
-      const tempNode = this._createNode(key, value);
+      const tempNode = this.createNode(key, value);
       if (tempNode) {
         destNode.key = srcNode.key;
         if (!this._isMapMode) destNode.value = srcNode.value;
@@ -8463,13 +8445,11 @@ var BinaryTree = class extends IterableEntryBase {
     this._store.clear();
   }
 };
+__name(_BinaryTree, "BinaryTree");
+var BinaryTree = _BinaryTree;
 
 // src/data-structures/binary-tree/bst.ts
-var BSTNode = class extends BinaryTreeNode {
-  static {
-    __name(this, "BSTNode");
-  }
-  parent = void 0;
+var _BSTNode = class _BSTNode {
   /**
    * Creates an instance of BSTNode.
    * @remarks Time O(1), Space O(1)
@@ -8478,9 +8458,17 @@ var BSTNode = class extends BinaryTreeNode {
    * @param [value] - The value associated with the key.
    */
   constructor(key, value) {
-    super(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)
@@ -8500,7 +8488,6 @@ var BSTNode = class 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)
@@ -8520,11 +8507,81 @@ var BSTNode = class extends BinaryTreeNode {
     if (v) v.parent = this;
     this._right = v;
   }
-};
-var BST = class extends BinaryTree {
-  static {
-    __name(this, "BST");
+  /**
+   * 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;
+  }
+  /**
+   * 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;
+  }
+  /**
+   * 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 {
   /**
    * 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).
@@ -8534,6 +8591,33 @@ var BST = class 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;
@@ -8541,7 +8625,6 @@ var BST = class extends BinaryTree {
     }
     if (keysNodesEntriesOrRaws) this.addMany(keysNodesEntriesOrRaws);
   }
-  _root = void 0;
   /**
    * Gets the root node of the tree.
    * @remarks Time O(1)
@@ -8551,7 +8634,6 @@ var BST = class extends BinaryTree {
   get root() {
     return this._root;
   }
-  _isReverse = false;
   /**
    * Gets whether the tree's comparison logic is reversed.
    * @remarks Time O(1)
@@ -8561,30 +8643,6 @@ var BST = class 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)
@@ -8594,7 +8652,6 @@ var BST = class 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)
@@ -8612,7 +8669,7 @@ var BST = class extends BinaryTree {
    * @param [value] - The value for the new node (used if not in Map mode).
    * @returns The newly created BSTNode.
    */
-  _createNode(key, value) {
+  createNode(key, value) {
     return new BSTNode(key, this._isMapMode ? void 0 : value);
   }
   /**
@@ -8624,7 +8681,8 @@ var BST = class extends BinaryTree {
    * @returns The resolved node, or undefined if not found.
    */
   ensureNode(keyNodeOrEntry, iterationType = this.iterationType) {
-    return super.ensureNode(keyNodeOrEntry, iterationType) ?? void 0;
+    var _a;
+    return (_a = super.ensureNode(keyNodeOrEntry, iterationType)) != null ? _a : void 0;
   }
   /**
    * Checks if the given item is a `BSTNode` instance.
@@ -8697,7 +8755,8 @@ var BST = class extends BinaryTree {
    * @returns The first matching node, or undefined if not found.
    */
   getNode(keyNodeEntryOrPredicate, startNode = this._root, iterationType = this.iterationType) {
-    return this.getNodes(keyNodeEntryOrPredicate, true, startNode, iterationType)[0] ?? void 0;
+    var _a;
+    return (_a = this.getNodes(keyNodeEntryOrPredicate, true, startNode, iterationType)[0]) != null ? _a : void 0;
   }
   /**
    * Searches the tree for nodes matching a predicate, key, or range.
@@ -8802,7 +8861,7 @@ var BST = class extends BinaryTree {
     if (newNode === void 0) return false;
     if (this._root === void 0) {
       this._setRoot(newNode);
-      if (this._isMapMode) this._setValue(newNode?.key, newValue);
+      if (this._isMapMode) this._setValue(newNode == null ? void 0 : newNode.key, newValue);
       this._size++;
       return true;
     }
@@ -8815,7 +8874,7 @@ var BST = class 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?.key, newValue);
+          if (this._isMapMode) this._setValue(newNode == null ? void 0 : newNode.key, newValue);
           this._size++;
           return true;
         }
@@ -8823,7 +8882,7 @@ var BST = class extends BinaryTree {
       } else {
         if (current.right === void 0) {
           current.right = newNode;
-          if (this._isMapMode) this._setValue(newNode?.key, newValue);
+          if (this._isMapMode) this._setValue(newNode == null ? void 0 : newNode.key, newValue);
           this._size++;
           return true;
         }
@@ -8846,10 +8905,10 @@ var BST = class extends BinaryTree {
    */
   addMany(keysNodesEntriesOrRaws, values, isBalanceAdd = true, iterationType = this.iterationType) {
     const inserted = [];
-    const valuesIterator = values?.[Symbol.iterator]();
+    const valuesIterator = values == null ? void 0 : values[Symbol.iterator]();
     if (!isBalanceAdd) {
       for (let kve of keysNodesEntriesOrRaws) {
-        const val = valuesIterator?.next().value;
+        const val = valuesIterator == null ? void 0 : valuesIterator.next().value;
         if (this.isRaw(kve)) kve = this._toEntryFn(kve);
         inserted.push(this.add(kve, val));
       }
@@ -8858,7 +8917,7 @@ var BST = class extends BinaryTree {
     const realBTNExemplars = [];
     let i = 0;
     for (const kve of keysNodesEntriesOrRaws) {
-      realBTNExemplars.push({ key: kve, value: valuesIterator?.next().value, orgIndex: i++ });
+      realBTNExemplars.push({ key: kve, value: valuesIterator == null ? void 0 : valuesIterator.next().value, orgIndex: i++ });
     }
     const sorted = realBTNExemplars.sort(({ key: a }, { key: b }) => {
       let keyA, keyB;
@@ -9080,7 +9139,7 @@ var BST = class extends BinaryTree {
    */
   _createInstance(options) {
     const Ctor = this.constructor;
-    return new Ctor([], { ...this._snapshotOptions(), ...options ?? {} });
+    return new Ctor([], { ...this._snapshotOptions(), ...options != null ? options : {} });
   }
   /**
    * (Protected) Creates a new instance of the same BST constructor, potentially with different generic types.
@@ -9093,7 +9152,7 @@ var BST = class extends BinaryTree {
    */
   _createLike(iter = [], options) {
     const Ctor = this.constructor;
-    return new Ctor(iter, { ...this._snapshotOptions(), ...options ?? {} });
+    return new Ctor(iter, { ...this._snapshotOptions(), ...options != null ? options : {} });
   }
   /**
    * (Protected) Snapshots the current BST's configuration options.
@@ -9120,7 +9179,7 @@ var BST = class extends BinaryTree {
   _keyValueNodeOrEntryToNodeAndValue(keyNodeOrEntry, value) {
     const [node, entryValue] = super._keyValueNodeOrEntryToNodeAndValue(keyNodeOrEntry, value);
     if (node === null) return [void 0, void 0];
-    return [node, value ?? entryValue];
+    return [node, value != null ? value : entryValue];
   }
   /**
    * (Protected) Sets the root node and clears its parent reference.
@@ -9151,6 +9210,7 @@ var BST = class 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);
@@ -9159,7 +9219,7 @@ var BST = class extends BinaryTree {
     }
     if (!node) return false;
     const transplant = /* @__PURE__ */ __name((u, v) => {
-      const p = u?.parent;
+      const p = u == null ? void 0 : u.parent;
       if (!p) {
         this._setRoot(v);
       } else if (p.left === u) {
@@ -9189,18 +9249,15 @@ var BST = class extends BinaryTree {
       succ.left = node.left;
       if (succ.left) succ.left.parent = succ;
     }
-    this._size = Math.max(0, (this._size ?? 0) - 1);
+    this._size = Math.max(0, ((_a = this._size) != null ? _a : 0) - 1);
     return true;
   }
 };
+__name(_BST, "BST");
+var BST = _BST;
 
 // src/data-structures/binary-tree/binary-indexed-tree.ts
-var BinaryIndexedTree = class {
-  static {
-    __name(this, "BinaryIndexedTree");
-  }
-  _freq;
-  _max;
+var _BinaryIndexedTree = class _BinaryIndexedTree {
   /**
    * 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.
@@ -9208,13 +9265,17 @@ var BinaryIndexedTree = class {
    * 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
@@ -9223,7 +9284,6 @@ var BinaryIndexedTree = class {
   get freqMap() {
     return this._freqMap;
   }
-  _msb;
   /**
    * The function returns the value of the _msb property.
    * @returns The `_msb` property of the object.
@@ -9231,7 +9291,6 @@ var BinaryIndexedTree = class {
   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
@@ -9480,12 +9539,11 @@ var BinaryIndexedTree = class {
     return left;
   }
 };
+__name(_BinaryIndexedTree, "BinaryIndexedTree");
+var BinaryIndexedTree = _BinaryIndexedTree;
 
 // src/data-structures/binary-tree/segment-tree.ts
-var SegmentTreeNode = class {
-  static {
-    __name(this, "SegmentTreeNode");
-  }
+var _SegmentTreeNode = class _SegmentTreeNode {
   /**
    * The constructor initializes the properties of a SegmentTreeNode object.
    * @param {number} start - The `start` parameter represents the starting index of the segment covered
@@ -9498,12 +9556,17 @@ var SegmentTreeNode = class {
    * 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.
@@ -9518,7 +9581,6 @@ var SegmentTreeNode = class {
   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`.
@@ -9534,7 +9596,6 @@ var SegmentTreeNode = class {
   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`.
@@ -9550,7 +9611,6 @@ var SegmentTreeNode = class {
   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`.
@@ -9565,7 +9625,6 @@ var SegmentTreeNode = class {
   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
@@ -9582,7 +9641,6 @@ var SegmentTreeNode = class {
   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`.
@@ -9600,10 +9658,9 @@ var SegmentTreeNode = class {
     this._right = value;
   }
 };
-var SegmentTree = class {
-  static {
-    __name(this, "SegmentTree");
-  }
+__name(_SegmentTreeNode, "SegmentTreeNode");
+var SegmentTreeNode = _SegmentTreeNode;
+var _SegmentTree = class _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.
@@ -9614,6 +9671,10 @@ var SegmentTree = class {
    * 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;
@@ -9626,7 +9687,6 @@ var SegmentTree = class {
       this._values = [];
     }
   }
-  _values = [];
   /**
    * The function returns an array of numbers.
    * @returns An array of numbers is being returned.
@@ -9634,7 +9694,6 @@ var SegmentTree = class {
   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.
@@ -9642,7 +9701,6 @@ var SegmentTree = class {
   get start() {
     return this._start;
   }
-  _end;
   /**
    * The function returns the value of the protected variable `_end`.
    * @returns The value of the protected property `_end`.
@@ -9650,7 +9708,6 @@ var SegmentTree = class {
   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.
@@ -9765,13 +9822,11 @@ var SegmentTree = class {
     return dfs(root, indexA, indexB);
   }
 };
+__name(_SegmentTree, "SegmentTree");
+var SegmentTree = _SegmentTree;
 
 // src/data-structures/binary-tree/avl-tree.ts
-var AVLTreeNode = class extends BSTNode {
-  static {
-    __name(this, "AVLTreeNode");
-  }
-  parent = void 0;
+var _AVLTreeNode = class _AVLTreeNode {
   /**
    * Creates an instance of AVLTreeNode.
    * @remarks Time O(1), Space O(1)
@@ -9780,9 +9835,17 @@ var AVLTreeNode = class extends BSTNode {
    * @param [value] - The value associated with the key.
    */
   constructor(key, value) {
-    super(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)
@@ -9804,7 +9867,6 @@ var AVLTreeNode = class extends BSTNode {
     }
     this._left = v;
   }
-  _right = void 0;
   /**
    * Gets the right child of the node.
    * @remarks Time O(1), Space O(1)
@@ -9826,11 +9888,81 @@ var AVLTreeNode = class extends BSTNode {
     }
     this._right = v;
   }
-};
-var AVLTree = class extends BST {
-  static {
-    __name(this, "AVLTree");
+  /**
+   * 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;
+  }
+  /**
+   * 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;
+  }
+  /**
+   * 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 {
   /**
    * Creates an instance of AVLTree.
    * @remarks Time O(N log N) (from `addMany` with balanced add). Space O(N).
@@ -9850,7 +9982,7 @@ var AVLTree = class extends BST {
    * @param [value] - The value for the new node.
    * @returns The newly created AVLTreeNode.
    */
-  _createNode(key, value) {
+  createNode(key, value) {
     return new AVLTreeNode(key, this._isMapMode ? void 0 : value);
   }
   /**
@@ -9953,7 +10085,7 @@ var AVLTree = class extends BST {
    */
   _createInstance(options) {
     const Ctor = this.constructor;
-    return new Ctor([], { ...this._snapshotOptions(), ...options ?? {} });
+    return new Ctor([], { ...this._snapshotOptions(), ...options != null ? options : {} });
   }
   /**
    * (Protected) Creates a new instance of the same AVLTree constructor, potentially with different generic types.
@@ -9966,7 +10098,7 @@ var AVLTree = class extends BST {
    */
   _createLike(iter = [], options) {
     const Ctor = this.constructor;
-    return new Ctor(iter, { ...this._snapshotOptions(), ...options ?? {} });
+    return new Ctor(iter, { ...this._snapshotOptions(), ...options != null ? options : {} });
   }
   /**
    * (Protected) Swaps properties of two nodes, including height.
@@ -9981,7 +10113,7 @@ var AVLTree = class extends BST {
     const destNodeEnsured = this.ensureNode(destNode);
     if (srcNodeEnsured && destNodeEnsured) {
       const { key, value, height } = destNodeEnsured;
-      const tempNode = this._createNode(key, value);
+      const tempNode = this.createNode(key, value);
       if (tempNode) {
         tempNode.height = height;
         destNodeEnsured.key = srcNodeEnsured.key;
@@ -10035,7 +10167,7 @@ var AVLTree = class extends BST {
     if (A === this.root) {
       if (B) this._setRoot(B);
     } else {
-      if (parentOfA?.left === A) {
+      if ((parentOfA == null ? void 0 : parentOfA.left) === A) {
         parentOfA.left = B;
       } else {
         if (parentOfA) parentOfA.right = B;
@@ -10218,13 +10350,11 @@ var AVLTree = class 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 extends BSTNode {
-  static {
-    __name(this, "RedBlackTreeNode");
-  }
-  parent = void 0;
+var _RedBlackTreeNode = class _RedBlackTreeNode {
   /**
    * Create a Red-Black Tree and optionally bulk-insert items.
    * @remarks Time O(n log n), Space O(n)
@@ -10234,10 +10364,18 @@ var RedBlackTreeNode = class extends BSTNode {
    * @returns New RedBlackTree instance.
    */
   constructor(key, value, color = "BLACK") {
-    super(key, value);
-    this._color = color;
+    __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;
+    this.color = color;
   }
-  _left = void 0;
   /**
    * Get the left child pointer.
    * @remarks Time O(1), Space O(1)
@@ -10258,7 +10396,6 @@ var RedBlackTreeNode = class extends BSTNode {
     }
     this._left = v;
   }
-  _right = void 0;
   /**
    * Get the right child pointer.
    * @remarks Time O(1), Space O(1)
@@ -10279,36 +10416,106 @@ var RedBlackTreeNode = class extends BSTNode {
     }
     this._right = v;
   }
-};
-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.
+   * 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 value - The new height.
+   */
+  set height(value) {
+    this._height = value;
+  }
+  /**
+   * 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;
+  }
+  /**
+   * 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(_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);
+    }
+  }
+  /**
+   * 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") {
+  createNode(key, value, color = "BLACK") {
     return new RedBlackTreeNode(key, this._isMapMode ? void 0 : value, color);
   }
   /**
@@ -10436,11 +10643,11 @@ var RedBlackTree = class extends BST {
   }
   _createInstance(options) {
     const Ctor = this.constructor;
-    return new Ctor([], { ...this._snapshotOptions(), ...options ?? {} });
+    return new Ctor([], { ...this._snapshotOptions(), ...options != null ? options : {} });
   }
   _createLike(iter = [], options) {
     const Ctor = this.constructor;
-    return new Ctor(iter, { ...this._snapshotOptions(), ...options ?? {} });
+    return new Ctor(iter, { ...this._snapshotOptions(), ...options != null ? options : {} });
   }
   _setRoot(v) {
     if (v) {
@@ -10459,15 +10666,16 @@ var RedBlackTree = class extends BST {
    * @returns Status string: 'CREATED' or 'UPDATED'.
    */
   _insert(node) {
-    let current = this.root;
+    var _a, _b, _c;
+    let current = (_a = this.root) != null ? _a : 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 = current.left ?? this.NIL;
+        current = (_b = current.left) != null ? _b : this.NIL;
       } else if (compared > 0) {
-        current = current.right ?? this.NIL;
+        current = (_c = current.right) != null ? _c : this.NIL;
       } else {
         this._replaceNode(current, node);
         return "UPDATED";
@@ -10513,10 +10721,11 @@ var RedBlackTree = class extends BST {
    * @returns void
    */
   _insertFixup(z) {
-    while (z?.parent?.color === "RED") {
-      if (z.parent === z.parent.parent?.left) {
+    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)) {
         const y = z.parent.parent.right;
-        if (y?.color === "RED") {
+        if ((y == null ? void 0 : y.color) === "RED") {
           z.parent.color = "BLACK";
           y.color = "BLACK";
           z.parent.parent.color = "RED";
@@ -10526,15 +10735,15 @@ var RedBlackTree = class 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 = z?.parent?.parent?.left ?? void 0;
-        if (y?.color === "RED") {
+        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") {
           z.parent.color = "BLACK";
           y.color = "BLACK";
           z.parent.parent.color = "RED";
@@ -10544,7 +10753,7 @@ var RedBlackTree = class 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);
@@ -10561,6 +10770,7 @@ var RedBlackTree = class extends BST {
    * @returns void
    */
   _deleteFixup(node) {
+    var _a, _b, _c, _d;
     if (!node || node === this.root || node.color === "BLACK") {
       if (node) {
         node.color = "BLACK";
@@ -10574,17 +10784,17 @@ var RedBlackTree = class extends BST {
       }
       if (node === parent.left) {
         let sibling = parent.right;
-        if (sibling?.color === "RED") {
+        if ((sibling == null ? void 0 : sibling.color) === "RED") {
           sibling.color = "BLACK";
           parent.color = "RED";
           this._leftRotate(parent);
           sibling = parent.right;
         }
-        if ((sibling?.left?.color ?? "BLACK") === "BLACK") {
+        if (((_b = (_a = sibling == null ? void 0 : sibling.left) == null ? void 0 : _a.color) != null ? _b : "BLACK") === "BLACK") {
           if (sibling) sibling.color = "RED";
           node = parent;
         } else {
-          if (sibling?.left) sibling.left.color = "BLACK";
+          if (sibling == null ? void 0 : sibling.left) sibling.left.color = "BLACK";
           if (sibling) sibling.color = parent.color;
           parent.color = "BLACK";
           this._rightRotate(parent);
@@ -10592,17 +10802,17 @@ var RedBlackTree = class extends BST {
         }
       } else {
         let sibling = parent.left;
-        if (sibling?.color === "RED") {
+        if ((sibling == null ? void 0 : sibling.color) === "RED") {
           sibling.color = "BLACK";
           if (parent) parent.color = "RED";
           this._rightRotate(parent);
           if (parent) sibling = parent.left;
         }
-        if ((sibling?.right?.color ?? "BLACK") === "BLACK") {
+        if (((_d = (_c = sibling == null ? void 0 : sibling.right) == null ? void 0 : _c.color) != null ? _d : "BLACK") === "BLACK") {
           if (sibling) sibling.color = "RED";
           node = parent;
         } else {
-          if (sibling?.right) sibling.right.color = "BLACK";
+          if (sibling == null ? void 0 : sibling.right) sibling.right.color = "BLACK";
           if (sibling) sibling.color = parent.color;
           if (parent) parent.color = "BLACK";
           this._leftRotate(parent);
@@ -10626,7 +10836,7 @@ var RedBlackTree = class 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;
@@ -10652,7 +10862,7 @@ var RedBlackTree = class 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;
@@ -10667,13 +10877,11 @@ var RedBlackTree = class extends BST {
     y.parent = x;
   }
 };
+__name(_RedBlackTree, "RedBlackTree");
+var RedBlackTree = _RedBlackTree;
 
 // src/data-structures/binary-tree/avl-tree-multi-map.ts
-var AVLTreeMultiMapNode = class extends AVLTreeNode {
-  static {
-    __name(this, "AVLTreeMultiMapNode");
-  }
-  parent = void 0;
+var _AVLTreeMultiMapNode = class _AVLTreeMultiMapNode {
   /**
    * Create an AVLTreeMultiMap node with a value bucket.
    * @remarks Time O(1), Space O(1)
@@ -10681,10 +10889,18 @@ var AVLTreeMultiMapNode = class extends AVLTreeNode {
    * @param value - Initial array of values.
    * @returns New AVLTreeMultiMapNode instance.
    */
-  constructor(key, value) {
-    super(key, value);
+  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;
   /**
    * Get the left child pointer.
    * @remarks Time O(1), Space O(1)
@@ -10705,7 +10921,6 @@ var AVLTreeMultiMapNode = class extends AVLTreeNode {
     }
     this._left = v;
   }
-  _right = void 0;
   /**
    * Get the right child pointer.
    * @remarks Time O(1), Space O(1)
@@ -10726,11 +10941,81 @@ var AVLTreeMultiMapNode = class extends AVLTreeNode {
     }
     this._right = v;
   }
-};
-var AVLTreeMultiMap = class extends AVLTree {
-  static {
-    __name(this, "AVLTreeMultiMap");
+  /**
+   * 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;
+  }
+  /**
+   * 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;
+  }
+  /**
+   * 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 {
   /**
    * Create an AVLTreeMultiMap and optionally bulk-insert items.
    * @remarks Time O(N log N), Space O(N)
@@ -10744,9 +11029,19 @@ var AVLTreeMultiMap = class extends AVLTree {
       this.addMany(keysNodesEntriesOrRaws);
     }
   }
-  _createNode(key, value = []) {
+  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)
@@ -10868,8 +11163,9 @@ var AVLTreeMultiMap = class extends AVLTree {
    * @returns An empty like-kind instance.
    */
   _createInstance(options) {
+    var _a, _b;
     const Ctor = this.constructor;
-    return new Ctor([], { ...this._snapshotOptions?.() ?? {}, ...options ?? {} });
+    return new Ctor([], { ...(_b = (_a = this._snapshotOptions) == null ? void 0 : _a.call(this)) != null ? _b : {}, ...options != null ? options : {} });
   }
   /**
    * (Protected) Create a like-kind instance and seed it from an iterable.
@@ -10882,17 +11178,16 @@ var AVLTreeMultiMap = class 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, { ...this._snapshotOptions?.() ?? {}, ...options ?? {} });
+    return new Ctor(iter, { ...(_b = (_a = this._snapshotOptions) == null ? void 0 : _a.call(this)) != null ? _b : {}, ...options != null ? options : {} });
   }
 };
+__name(_AVLTreeMultiMap, "AVLTreeMultiMap");
+var AVLTreeMultiMap = _AVLTreeMultiMap;
 
 // src/data-structures/binary-tree/tree-multi-map.ts
-var TreeMultiMapNode = class extends RedBlackTreeNode {
-  static {
-    __name(this, "TreeMultiMapNode");
-  }
-  parent = void 0;
+var _TreeMultiMapNode = class _TreeMultiMapNode {
   /**
    * Create a TreeMultiMap node with an optional value bucket.
    * @remarks Time O(1), Space O(1)
@@ -10900,10 +11195,19 @@ var TreeMultiMapNode = class extends RedBlackTreeNode {
    * @param [value] - Initial array of values.
    * @returns New TreeMultiMapNode instance.
    */
-  constructor(key, value) {
-    super(key, value);
+  constructor(key, value = [], color = "BLACK") {
+    __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;
+    this.color = color;
   }
-  _left = void 0;
   /**
    * Get the left child pointer.
    * @remarks Time O(1), Space O(1)
@@ -10924,7 +11228,6 @@ var TreeMultiMapNode = class extends RedBlackTreeNode {
     }
     this._left = v;
   }
-  _right = void 0;
   /**
    * Get the right child pointer.
    * @remarks Time O(1), Space O(1)
@@ -10945,11 +11248,81 @@ var TreeMultiMapNode = class extends RedBlackTreeNode {
     }
     this._right = v;
   }
-};
-var TreeMultiMap = class extends RedBlackTree {
-  static {
-    __name(this, "TreeMultiMap");
+  /**
+   * 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;
+  }
+  /**
+   * 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;
+  }
+  /**
+   * 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 {
   /**
    * Create a TreeMultiMap and optionally bulk-insert items.
    * @remarks Time O(N log N), Space O(N)
@@ -10963,9 +11336,19 @@ var TreeMultiMap = class extends RedBlackTree {
       this.addMany(keysNodesEntriesOrRaws);
     }
   }
-  _createNode(key, value = []) {
+  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)
@@ -11059,8 +11442,9 @@ var TreeMultiMap = class extends RedBlackTree {
    * @returns An empty like-kind instance.
    */
   _createInstance(options) {
+    var _a, _b;
     const Ctor = this.constructor;
-    return new Ctor([], { ...this._snapshotOptions?.() ?? {}, ...options ?? {} });
+    return new Ctor([], { ...(_b = (_a = this._snapshotOptions) == null ? void 0 : _a.call(this)) != null ? _b : {}, ...options != null ? options : {} });
   }
   /**
    * (Protected) Create a like-kind instance and seed it from an iterable.
@@ -11073,17 +11457,16 @@ var TreeMultiMap = class 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, { ...this._snapshotOptions?.() ?? {}, ...options ?? {} });
+    return new Ctor(iter, { ...(_b = (_a = this._snapshotOptions) == null ? void 0 : _a.call(this)) != null ? _b : {}, ...options != null ? options : {} });
   }
 };
+__name(_TreeMultiMap, "TreeMultiMap");
+var TreeMultiMap = _TreeMultiMap;
 
 // src/data-structures/binary-tree/tree-counter.ts
-var TreeCounterNode = class extends RedBlackTreeNode {
-  static {
-    __name(this, "TreeCounterNode");
-  }
-  parent = void 0;
+var _TreeCounterNode = class _TreeCounterNode {
   /**
    * Create a tree counter node.
    * @remarks Time O(1), Space O(1)
@@ -11094,10 +11477,19 @@ var TreeCounterNode = class extends RedBlackTreeNode {
    * @returns New TreeCounterNode instance.
    */
   constructor(key, value, count = 1, color = "BLACK") {
-    super(key, value, color);
+    __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;
+    this.color = color;
     this.count = count;
   }
-  _left = void 0;
   /**
    * Get the left child pointer.
    * @remarks Time O(1), Space O(1)
@@ -11118,7 +11510,6 @@ var TreeCounterNode = class extends RedBlackTreeNode {
     }
     this._left = v;
   }
-  _right = void 0;
   /**
    * Get the right child pointer.
    * @remarks Time O(1), Space O(1)
@@ -11139,11 +11530,81 @@ var TreeCounterNode = class extends RedBlackTreeNode {
     }
     this._right = v;
   }
-};
-var TreeCounter = class extends RedBlackTree {
-  static {
-    __name(this, "TreeCounter");
+  /**
+   * 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;
+  }
+  /**
+   * 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;
+  }
+  /**
+   * 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 {
   /**
    * Create a TreeCounter and optionally bulk-insert items.
    * @remarks Time O(N log N), Space O(N)
@@ -11153,9 +11614,9 @@ var TreeCounter = class 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)
@@ -11174,7 +11635,7 @@ var TreeCounter = class extends RedBlackTree {
     this.dfs((node) => sum += node ? node.count : 0);
     return sum;
   }
-  _createNode(key, value, color = "BLACK", count) {
+  createNode(key, value, color = "BLACK", count) {
     return new TreeCounterNode(key, this._isMapMode ? void 0 : value, count, color);
   }
   /**
@@ -11195,7 +11656,7 @@ var TreeCounter = class extends RedBlackTree {
    */
   add(keyNodeOrEntry, value, count = 1) {
     const [newNode, newValue] = this._keyValueNodeOrEntryToNodeAndValue(keyNodeOrEntry, value, count);
-    const orgCount = newNode?.count || 0;
+    const orgCount = (newNode == null ? void 0 : newNode.count) || 0;
     const isSuccessAdded = super.add(newNode, newValue);
     if (isSuccessAdded) {
       this._count += orgCount;
@@ -11375,7 +11836,7 @@ var TreeCounter = class extends RedBlackTree {
    */
   _createInstance(options) {
     const Ctor = this.constructor;
-    return new Ctor([], { ...this._snapshotOptions(), ...options ?? {} });
+    return new Ctor([], { ...this._snapshotOptions(), ...options != null ? options : {} });
   }
   /**
    * (Protected) Create a like-kind instance and seed it from an iterable.
@@ -11391,7 +11852,7 @@ var TreeCounter = class extends RedBlackTree {
     const Ctor = this.constructor;
     return new Ctor(iter, {
       ...this._snapshotOptions(),
-      ...options ?? {}
+      ...options != null ? options : {}
     });
   }
   /**
@@ -11408,10 +11869,10 @@ var TreeCounter = class extends RedBlackTree {
     if (this.isEntry(keyNodeOrEntry)) {
       const [key, entryValue] = keyNodeOrEntry;
       if (key === void 0 || key === null) return [void 0, void 0];
-      const finalValue = value ?? entryValue;
-      return [this._createNode(key, finalValue, "BLACK", count), finalValue];
+      const finalValue = value != null ? value : entryValue;
+      return [this.createNode(key, finalValue, "BLACK", count), finalValue];
     }
-    return [this._createNode(keyNodeOrEntry, value, "BLACK", count), value];
+    return [this.createNode(keyNodeOrEntry, value, "BLACK", count), value];
   }
   /**
    * (Protected) Swap keys/values/counters between the source and destination nodes.
@@ -11425,7 +11886,7 @@ var TreeCounter = class extends RedBlackTree {
     destNode = this.ensureNode(destNode);
     if (srcNode && destNode) {
       const { key, value, count, color } = destNode;
-      const tempNode = this._createNode(key, value, color, count);
+      const tempNode = this.createNode(key, value, color, count);
       if (tempNode) {
         tempNode.color = color;
         destNode.key = srcNode.key;
@@ -11453,13 +11914,11 @@ var TreeCounter = class 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 extends AVLTreeNode {
-  static {
-    __name(this, "AVLTreeCounterNode");
-  }
-  parent = void 0;
+var _AVLTreeCounterNode = class _AVLTreeCounterNode {
   /**
    * Create an AVL counter node.
    * @remarks Time O(1), Space O(1)
@@ -11469,10 +11928,18 @@ var AVLTreeCounterNode = class extends AVLTreeNode {
    * @returns New AVLTreeCounterNode instance.
    */
   constructor(key, value, count = 1) {
-    super(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;
     this.count = count;
   }
-  _left = void 0;
   /**
    * Get the left child pointer.
    * @remarks Time O(1), Space O(1)
@@ -11493,7 +11960,6 @@ var AVLTreeCounterNode = class extends AVLTreeNode {
     }
     this._left = v;
   }
-  _right = void 0;
   /**
    * Get the right child pointer.
    * @remarks Time O(1), Space O(1)
@@ -11514,11 +11980,81 @@ var AVLTreeCounterNode = class extends AVLTreeNode {
     }
     this._right = v;
   }
-};
-var AVLTreeCounter = class extends AVLTree {
-  static {
-    __name(this, "AVLTreeCounter");
+  /**
+   * 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;
+  }
+  /**
+   * 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;
+  }
+  /**
+   * 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 {
   /**
    * Create a AVLTreeCounter instance
    * @remarks Time O(n), Space O(n)
@@ -11528,9 +12064,9 @@ var AVLTreeCounter = class extends AVLTree {
    */
   constructor(keysNodesEntriesOrRaws = [], options) {
     super([], options);
+    __publicField(this, "_count", 0);
     if (keysNodesEntriesOrRaws) this.addMany(keysNodesEntriesOrRaws);
   }
-  _count = 0;
   get count() {
     return this._count;
   }
@@ -11544,7 +12080,7 @@ var AVLTreeCounter = class extends AVLTree {
     this.dfs((node) => sum += node.count);
     return sum;
   }
-  _createNode(key, value, count) {
+  createNode(key, value, count) {
     return new AVLTreeCounterNode(key, this._isMapMode ? void 0 : value, count);
   }
   /**
@@ -11566,7 +12102,7 @@ var AVLTreeCounter = class extends AVLTree {
   add(keyNodeOrEntry, value, count = 1) {
     const [newNode, newValue] = this._keyValueNodeOrEntryToNodeAndValue(keyNodeOrEntry, value, count);
     if (newNode === void 0) return false;
-    const orgNodeCount = newNode?.count || 0;
+    const orgNodeCount = (newNode == null ? void 0 : newNode.count) || 0;
     const inserted = super.add(newNode, newValue);
     if (inserted) {
       this._count += orgNodeCount;
@@ -11581,11 +12117,12 @@ var AVLTreeCounter = class 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 = this.getNode(keyNodeOrEntry) ?? void 0;
+    const curr = (_a = this.getNode(keyNodeOrEntry)) != null ? _a : void 0;
     if (!curr) return deletedResult;
-    const parent = curr?.parent ? curr.parent : void 0;
+    const parent = (curr == null ? void 0 : curr.parent) ? curr.parent : void 0;
     let needBalanced = void 0, orgCurrent = curr;
     if (curr.count > 1 && !ignoreCount) {
       curr.count--;
@@ -11712,7 +12249,7 @@ var AVLTreeCounter = class extends AVLTree {
    */
   _createInstance(options) {
     const Ctor = this.constructor;
-    return new Ctor([], { ...this._snapshotOptions(), ...options ?? {} });
+    return new Ctor([], { ...this._snapshotOptions(), ...options != null ? options : {} });
   }
   /**
    * (Protected) Create a like-kind instance and seed it from an iterable.
@@ -11726,7 +12263,7 @@ var AVLTreeCounter = class extends AVLTree {
    */
   _createLike(iter = [], options) {
     const Ctor = this.constructor;
-    return new Ctor(iter, { ...this._snapshotOptions(), ...options ?? {} });
+    return new Ctor(iter, { ...this._snapshotOptions(), ...options != null ? options : {} });
   }
   /**
    * (Protected) Normalize input into a node plus its effective value and count.
@@ -11742,10 +12279,10 @@ var AVLTreeCounter = class extends AVLTree {
     if (this.isEntry(keyNodeOrEntry)) {
       const [key, entryValue] = keyNodeOrEntry;
       if (key === void 0 || key === null) return [void 0, void 0];
-      const finalValue = value ?? entryValue;
-      return [this._createNode(key, finalValue, count), finalValue];
+      const finalValue = value != null ? value : entryValue;
+      return [this.createNode(key, finalValue, count), finalValue];
     }
-    return [this._createNode(keyNodeOrEntry, value, count), value];
+    return [this.createNode(keyNodeOrEntry, value, count), value];
   }
   /**
    * (Protected) Swap keys/values/counters between the source and destination nodes.
@@ -11759,7 +12296,7 @@ var AVLTreeCounter = class extends AVLTree {
     destNode = this.ensureNode(destNode);
     if (srcNode && destNode) {
       const { key, value, count, height } = destNode;
-      const tempNode = this._createNode(key, value, count);
+      const tempNode = this.createNode(key, value, count);
       if (tempNode) {
         tempNode.height = height;
         destNode.key = srcNode.key;
@@ -11787,22 +12324,20 @@ var AVLTreeCounter = class extends AVLTree {
     return super._replaceNode(oldNode, newNode);
   }
 };
+__name(_AVLTreeCounter, "AVLTreeCounter");
+var AVLTreeCounter = _AVLTreeCounter;
 
 // src/data-structures/priority-queue/priority-queue.ts
-var PriorityQueue = class extends Heap {
-  static {
-    __name(this, "PriorityQueue");
-  }
+var _PriorityQueue = class _PriorityQueue extends Heap {
   constructor(elements = [], options) {
     super(elements, options);
   }
 };
+__name(_PriorityQueue, "PriorityQueue");
+var PriorityQueue = _PriorityQueue;
 
 // src/data-structures/priority-queue/min-priority-queue.ts
-var MinPriorityQueue = class extends PriorityQueue {
-  static {
-    __name(this, "MinPriorityQueue");
-  }
+var _MinPriorityQueue = class _MinPriorityQueue extends PriorityQueue {
   /**
    * Creates a min-priority queue.
    * @param elements Optional initial elements to insert.
@@ -11813,12 +12348,11 @@ var MinPriorityQueue = class extends PriorityQueue {
     super(elements, options);
   }
 };
+__name(_MinPriorityQueue, "MinPriorityQueue");
+var MinPriorityQueue = _MinPriorityQueue;
 
 // src/data-structures/priority-queue/max-priority-queue.ts
-var MaxPriorityQueue = class extends PriorityQueue {
-  static {
-    __name(this, "MaxPriorityQueue");
-  }
+var _MaxPriorityQueue = class _MaxPriorityQueue extends PriorityQueue {
   /**
    * Creates a max-priority queue.
    * @param elements Optional initial elements to insert.
@@ -11842,12 +12376,11 @@ var MaxPriorityQueue = class extends PriorityQueue {
     });
   }
 };
+__name(_MaxPriorityQueue, "MaxPriorityQueue");
+var MaxPriorityQueue = _MaxPriorityQueue;
 
 // src/data-structures/matrix/matrix.ts
-var Matrix = class _Matrix {
-  static {
-    __name(this, "Matrix");
-  }
+var _Matrix = class _Matrix {
   /**
    * The constructor function initializes a matrix object with the provided data and options, or with
    * default values if no options are provided.
@@ -11856,18 +12389,22 @@ 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 = data[0]?.length || 0;
+      else this._cols = ((_a = data[0]) == null ? void 0 : _a.length) || 0;
       if (addFn) this._addFn = addFn;
       if (subtractFn) this._subtractFn = subtractFn;
       if (multiplyFn) this._multiplyFn = multiplyFn;
     } else {
       this._rows = data.length;
-      this._cols = data[0]?.length ?? 0;
+      this._cols = (_c = (_b = data[0]) == null ? void 0 : _b.length) != null ? _c : 0;
     }
     if (data.length > 0) {
       this._data = data;
@@ -11878,7 +12415,6 @@ var Matrix = class _Matrix {
       }
     }
   }
-  _rows = 0;
   /**
    * The function returns the number of rows.
    * @returns The number of rows.
@@ -11886,7 +12422,6 @@ 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.
@@ -11894,7 +12429,6 @@ 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.
@@ -12093,6 +12627,7 @@ 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.");
     }
@@ -12119,7 +12654,7 @@ var Matrix = class _Matrix {
         throw new Error("Matrix is singular, and its inverse does not exist.");
       }
       augmentedMatrix._swapRows(i, pivotRow);
-      const pivotElement = augmentedMatrix.get(i, i) ?? 1;
+      const pivotElement = (_a = augmentedMatrix.get(i, i)) != null ? _a : 1;
       if (pivotElement === 0) {
         throw new Error("Matrix is singular, and its inverse does not exist (division by zero).");
       }
@@ -12262,14 +12797,11 @@ var Matrix = class _Matrix {
     }
   }
 };
+__name(_Matrix, "Matrix");
+var Matrix = _Matrix;
 
 // src/data-structures/matrix/navigator.ts
-var Character = class _Character {
-  static {
-    __name(this, "Character");
-  }
-  direction;
-  turn;
+var _Character = class _Character {
   /**
    * The constructor function takes in a direction and turning object and sets the direction and turn properties of the
    * Character class.
@@ -12279,25 +12811,26 @@ 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);
   }
 };
-var Navigator = class {
-  static {
-    __name(this, "Navigator");
-  }
-  onMove;
-  _matrix;
-  _cur;
-  _character;
-  _VISITED;
+__name(_Character, "Character");
+var Character = _Character;
+var _Navigator = class _Navigator {
   /**
    * 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);
@@ -12375,23 +12908,24 @@ var Navigator = class {
     if (this.onMove) this.onMove(this._cur);
   }
 };
+__name(_Navigator, "Navigator");
+var Navigator = _Navigator;
 
 // src/data-structures/trie/trie.ts
-var TrieNode = class {
-  static {
-    __name(this, "TrieNode");
-  }
+var _TrieNode = class _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)
@@ -12409,7 +12943,6 @@ var TrieNode = class {
   set key(value) {
     this._key = value;
   }
-  _children;
   /**
    * Get the child map of this node.
    * @remarks Time O(1), Space O(1)
@@ -12427,7 +12960,6 @@ var TrieNode = class {
   set children(value) {
     this._children = value;
   }
-  _isEnd;
   /**
    * Check whether this node marks the end of a word.
    * @remarks Time O(1), Space O(1)
@@ -12446,10 +12978,9 @@ var TrieNode = class {
     this._isEnd = value;
   }
 };
-var Trie = class extends IterableElementBase {
-  static {
-    __name(this, "Trie");
-  }
+__name(_TrieNode, "TrieNode");
+var TrieNode = _TrieNode;
+var _Trie = class _Trie extends IterableElementBase {
   /**
    * Create a Trie and optionally bulk-insert words.
    * @remarks Time O(totalChars), Space O(totalChars)
@@ -12459,6 +12990,9 @@ var Trie = class 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;
@@ -12467,7 +13001,6 @@ var Trie = class extends IterableElementBase {
       this.addMany(words);
     }
   }
-  _size = 0;
   /**
    * Get the number of stored words.
    * @remarks Time O(1), Space O(1)
@@ -12476,7 +13009,6 @@ var Trie = class extends IterableElementBase {
   get size() {
     return this._size;
   }
-  _caseSensitive = true;
   /**
    * Get whether comparisons are case-sensitive.
    * @remarks Time O(1), Space O(1)
@@ -12485,7 +13017,6 @@ var Trie = class extends IterableElementBase {
   get caseSensitive() {
     return this._caseSensitive;
   }
-  _root = new TrieNode("");
   /**
    * Get the root node.
    * @remarks Time O(1), Space O(1)
@@ -12815,7 +13346,7 @@ var Trie = class extends IterableElementBase {
     const next = new Ctor([], {
       toElementFn: this.toElementFn,
       caseSensitive: this.caseSensitive,
-      ...options ?? {}
+      ...options != null ? options : {}
     });
     return next;
   }
@@ -12871,12 +13402,11 @@ var Trie = class extends IterableElementBase {
     return str;
   }
 };
+__name(_Trie, "Trie");
+var Trie = _Trie;
 
 // src/data-structures/tree/tree.ts
-var TreeNode = class _TreeNode {
-  static {
-    __name(this, "TreeNode");
-  }
+var _TreeNode = class _TreeNode {
   /**
    * The constructor function initializes a TreeNode object with a key, optional value, and optional
    * children.
@@ -12888,11 +13418,13 @@ 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.
@@ -12908,7 +13440,6 @@ 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.
@@ -12924,7 +13455,6 @@ 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`,
@@ -12980,6 +13510,8 @@ var TreeNode = class _TreeNode {
     return maxDepth;
   }
 };
+__name(_TreeNode, "TreeNode");
+var TreeNode = _TreeNode;
 /**
  * data-structure-typed
  *
@@ -13009,5 +13541,5 @@ var TreeNode = class _TreeNode {
  */
 
 export { AVLTree, AVLTreeCounter, AVLTreeCounterNode, AVLTreeMultiMap, AVLTreeMultiMapNode, AVLTreeNode, AbstractEdge, AbstractGraph, AbstractVertex, BST, BSTNode, BinaryIndexedTree, BinaryTree, BinaryTreeNode, Character, DFSOperation, Deque, DirectedEdge, DirectedGraph, DirectedVertex, DoublyLinkedList, DoublyLinkedListNode, FibonacciHeap, FibonacciHeapNode, HashMap, Heap, IterableElementBase, IterableEntryBase, LinkedHashMap, LinkedListQueue, MapEdge, MapGraph, MapVertex, Matrix, MaxHeap, MaxPriorityQueue, MinHeap, MinPriorityQueue, Navigator, PriorityQueue, Queue, Range, RedBlackTree, RedBlackTreeNode, SegmentTree, SegmentTreeNode, SinglyLinkedList, SinglyLinkedListNode, SkipList, SkipListNode, Stack, TreeCounter, TreeCounterNode, TreeMultiMap, TreeMultiMapNode, TreeNode, Trie, TrieNode, UndirectedEdge, UndirectedGraph, UndirectedVertex, arrayRemove, asyncTrampoline, calcMinUnitsRequired, getMSB, isComparable, isTrampolineThunk, isWeakKey, makeAsyncTrampoline, makeTrampoline, makeTrampolineThunk, rangeCheck, roundFixed, throwRangeError, toBinaryString, trampoline, uuidV4 };
-//# sourceMappingURL=index.js.map
-//# sourceMappingURL=index.js.map
+//# sourceMappingURL=index.mjs.map
+//# sourceMappingURL=index.mjs.map