data-structure-typed 1.43.3 → 1.44.0

package/dist/umd/data-structure-typed.js

@@ -4,6 +4,12 @@ var dataStructureTyped = (() => {
   var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
   var __getOwnPropNames = Object.getOwnPropertyNames;
   var __hasOwnProp = Object.prototype.hasOwnProperty;
+  var __knownSymbol = (name, symbol) => {
+    if (symbol = Symbol[name])
+      return symbol;
+    throw Error("Symbol." + name + " is not defined");
+  };
+  var __defNormalProp = (obj, key, value) => key in obj ? __defProp(obj, key, { enumerable: true, configurable: true, writable: true, value }) : obj[key] = value;
   var __export = (target, all) => {
     for (var name in all)
       __defProp(target, name, { get: all[name], enumerable: true });
@@ -17,6 +23,67 @@ var dataStructureTyped = (() => {
     return to;
   };
   var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+  var __publicField = (obj, key, value) => {
+    __defNormalProp(obj, typeof key !== "symbol" ? key + "" : key, value);
+    return value;
+  };
+  var __async = (__this, __arguments, generator) => {
+    return new Promise((resolve, reject) => {
+      var fulfilled = (value) => {
+        try {
+          step(generator.next(value));
+        } catch (e) {
+          reject(e);
+        }
+      };
+      var rejected = (value) => {
+        try {
+          step(generator.throw(value));
+        } catch (e) {
+          reject(e);
+        }
+      };
+      var step = (x) => x.done ? resolve(x.value) : Promise.resolve(x.value).then(fulfilled, rejected);
+      step((generator = generator.apply(__this, __arguments)).next());
+    });
+  };
+  var __await = function(promise, isYieldStar) {
+    this[0] = promise;
+    this[1] = isYieldStar;
+  };
+  var __yieldStar = (value) => {
+    var obj = value[__knownSymbol("asyncIterator")];
+    var isAwait = false;
+    var method;
+    var it = {};
+    if (obj == null) {
+      obj = value[__knownSymbol("iterator")]();
+      method = (k) => it[k] = (x) => obj[k](x);
+    } else {
+      obj = obj.call(value);
+      method = (k) => it[k] = (v) => {
+        if (isAwait) {
+          isAwait = false;
+          if (k === "throw")
+            throw v;
+          return v;
+        }
+        isAwait = true;
+        return {
+          done: false,
+          value: new __await(new Promise((resolve) => {
+            var x = obj[k](v);
+            if (!(x instanceof Object))
+              throw TypeError("Object expected");
+            resolve(x);
+          }), 1)
+        };
+      };
+    }
+    return it[__knownSymbol("iterator")] = () => it, method("next"), "throw" in obj ? method("throw") : it.throw = (x) => {
+      throw x;
+    }, "return" in obj && method("return"), it;
+  };
 
   // src/index.ts
   var src_exports = {};
@@ -98,37 +165,35 @@ var dataStructureTyped = (() => {
 
   // src/data-structures/hash/hash-table.ts
   var HashTableNode = class {
-    key;
-    value;
-    next;
     constructor(key, value) {
+      __publicField(this, "key");
+      __publicField(this, "value");
+      __publicField(this, "next");
       this.key = key;
       this.value = value;
       this.next = null;
     }
   };
-  var HashTable = class _HashTable {
-    static DEFAULT_CAPACITY = 16;
-    static LOAD_FACTOR = 0.75;
+  var _HashTable = class _HashTable {
     constructor(capacity = _HashTable.DEFAULT_CAPACITY, hashFn) {
+      __publicField(this, "_capacity");
+      __publicField(this, "_size");
+      __publicField(this, "_buckets");
+      __publicField(this, "_hashFn");
       this._hashFn = hashFn || this._defaultHashFn;
       this._capacity = Math.max(capacity, _HashTable.DEFAULT_CAPACITY);
       this._size = 0;
       this._buckets = new Array(this._capacity).fill(null);
     }
-    _capacity;
     get capacity() {
       return this._capacity;
     }
-    _size;
     get size() {
       return this._size;
     }
-    _buckets;
     get buckets() {
       return this._buckets;
     }
-    _hashFn;
     get hashFn() {
       return this._hashFn;
     }
@@ -316,15 +381,18 @@ var dataStructureTyped = (() => {
       this._capacity = newCapacity;
     }
   };
+  __publicField(_HashTable, "DEFAULT_CAPACITY", 16);
+  __publicField(_HashTable, "LOAD_FACTOR", 0.75);
+  var HashTable = _HashTable;
 
   // src/data-structures/hash/coordinate-map.ts
   var CoordinateMap = class extends Map {
     constructor(joint) {
       super();
+      __publicField(this, "_joint", "_");
       if (joint !== void 0)
         this._joint = joint;
     }
-    _joint = "_";
     get joint() {
       return this._joint;
     }
@@ -374,10 +442,10 @@ var dataStructureTyped = (() => {
   var CoordinateSet = class extends Set {
     constructor(joint) {
       super();
+      __publicField(this, "_joint", "_");
       if (joint !== void 0)
         this._joint = joint;
     }
-    _joint = "_";
     get joint() {
       return this._joint;
     }
@@ -436,6 +504,12 @@ var dataStructureTyped = (() => {
      * default hash function converts the key to a string, calculates the sum of the
      */
     constructor(initialCapacity = 16, loadFactor = 0.75, hashFn) {
+      __publicField(this, "_initialCapacity");
+      __publicField(this, "_loadFactor");
+      __publicField(this, "_capacityMultiplier");
+      __publicField(this, "_size");
+      __publicField(this, "_table");
+      __publicField(this, "_hashFn");
       this._initialCapacity = initialCapacity;
       this._loadFactor = loadFactor;
       this._capacityMultiplier = 2;
@@ -450,27 +524,21 @@ var dataStructureTyped = (() => {
         return hash % this.table.length;
       });
     }
-    _initialCapacity;
     get initialCapacity() {
       return this._initialCapacity;
     }
-    _loadFactor;
     get loadFactor() {
       return this._loadFactor;
     }
-    _capacityMultiplier;
     get capacityMultiplier() {
       return this._capacityMultiplier;
     }
-    _size;
     get size() {
       return this._size;
     }
-    _table;
     get table() {
       return this._table;
     }
-    _hashFn;
     get hashFn() {
       return this._hashFn;
     }
@@ -568,14 +636,14 @@ var dataStructureTyped = (() => {
 
   // src/data-structures/linked-list/singly-linked-list.ts
   var SinglyLinkedListNode = class {
-    value;
-    next;
     /**
      * The constructor function initializes an instance of a class with a given value and sets the next property to null.
      * @param {E} value - The "value" parameter is of type E, which means it can be any data type. It represents the value that
      * will be stored in the node of a linked list.
      */
     constructor(value) {
+      __publicField(this, "value");
+      __publicField(this, "next");
       this.value = value;
       this.next = null;
     }
@@ -585,19 +653,19 @@ var dataStructureTyped = (() => {
      * The constructor initializes the linked list with an empty head, tail, and length.
      */
     constructor() {
+      __publicField(this, "_head");
+      __publicField(this, "_tail");
+      __publicField(this, "_length");
       this._head = null;
       this._tail = null;
       this._length = 0;
     }
-    _head;
     get head() {
       return this._head;
     }
-    _tail;
     get tail() {
       return this._tail;
     }
-    _length;
     get length() {
       return this._length;
     }
@@ -1272,15 +1340,15 @@ var dataStructureTyped = (() => {
 
   // src/data-structures/linked-list/doubly-linked-list.ts
   var DoublyLinkedListNode = class {
-    value;
-    next;
-    prev;
     /**
      * The constructor function initializes the value, next, and previous properties of an object.
      * @param {E} value - The "value" parameter is the value that will be stored in the node. It can be of any data type, as it
      * is defined as a generic type "E".
      */
     constructor(value) {
+      __publicField(this, "value");
+      __publicField(this, "next");
+      __publicField(this, "prev");
       this.value = value;
       this.next = null;
       this.prev = null;
@@ -1291,19 +1359,19 @@ var dataStructureTyped = (() => {
      * The constructor initializes the linked list with an empty head, tail, and length.
      */
     constructor() {
+      __publicField(this, "_head");
+      __publicField(this, "_tail");
+      __publicField(this, "_length");
       this._head = null;
       this._tail = null;
       this._length = 0;
     }
-    _head;
     get head() {
       return this._head;
     }
-    _tail;
     get tail() {
       return this._tail;
     }
-    _length;
     get length() {
       return this._length;
     }
@@ -1500,7 +1568,8 @@ var dataStructureTyped = (() => {
      * @returns The method `getFirst()` returns the first node of the doubly linked list, or `null` if the list is empty.
      */
     getFirst() {
-      return this.head?.value;
+      var _a;
+      return (_a = this.head) == null ? void 0 : _a.value;
     }
     /**
      * Time Complexity: O(n), where n is the number of elements in the linked list.
@@ -1514,7 +1583,8 @@ var dataStructureTyped = (() => {
      * @returns The method `getLast()` returns the last node of the doubly linked list, or `null` if the list is empty.
      */
     getLast() {
-      return this.tail?.value;
+      var _a;
+      return (_a = this.tail) == null ? void 0 : _a.value;
     }
     /**
      * Time Complexity: O(n), where n is the number of elements in the linked list.
@@ -2029,10 +2099,10 @@ var dataStructureTyped = (() => {
 
   // src/data-structures/linked-list/skip-linked-list.ts
   var SkipListNode = class {
-    key;
-    value;
-    forward;
     constructor(key, value, level) {
+      __publicField(this, "key");
+      __publicField(this, "value");
+      __publicField(this, "forward");
       this.key = key;
       this.value = value;
       this.forward = new Array(level);
@@ -2047,24 +2117,24 @@ var dataStructureTyped = (() => {
      * level in the skip list. It is used to determine the height of each node in the skip list.
      */
     constructor(maxLevel = 16, probability = 0.5) {
+      __publicField(this, "_head");
+      __publicField(this, "_level");
+      __publicField(this, "_maxLevel");
+      __publicField(this, "_probability");
       this._head = new SkipListNode(null, null, maxLevel);
       this._level = 0;
       this._maxLevel = maxLevel;
       this._probability = probability;
     }
-    _head;
     get head() {
       return this._head;
     }
-    _level;
     get level() {
       return this._level;
     }
-    _maxLevel;
     get maxLevel() {
       return this._maxLevel;
     }
-    _probability;
     get probability() {
       return this._probability;
     }
@@ -2284,9 +2354,9 @@ var dataStructureTyped = (() => {
      * is provided and is an array, it is assigned to the `_elements
      */
     constructor(elements) {
+      __publicField(this, "_elements");
       this._elements = Array.isArray(elements) ? elements : [];
     }
-    _elements;
     get elements() {
       return this._elements;
     }
@@ -2426,7 +2496,8 @@ var dataStructureTyped = (() => {
      * @returns The `getFirst()` method is returning the value of the `head` node if it exists, otherwise it returns `undefined`.
      */
     getFirst() {
-      return this.head?.value;
+      var _a;
+      return (_a = this.head) == null ? void 0 : _a.value;
     }
     /**
      * The `peek` function returns the value of the head node in a linked list, or `undefined` if the list is empty.
@@ -2444,14 +2515,14 @@ var dataStructureTyped = (() => {
      * initialized as an empty array.
      */
     constructor(elements) {
+      __publicField(this, "_nodes");
+      __publicField(this, "_offset");
       this._nodes = elements || [];
       this._offset = 0;
     }
-    _nodes;
     get nodes() {
       return this._nodes;
     }
-    _offset;
     get offset() {
       return this._offset;
     }
@@ -2674,26 +2745,26 @@ var dataStructureTyped = (() => {
   };
   var ObjectDeque = class {
     constructor(capacity) {
+      __publicField(this, "_nodes", {});
+      __publicField(this, "_capacity", Number.MAX_SAFE_INTEGER);
+      __publicField(this, "_first", -1);
+      __publicField(this, "_last", -1);
+      __publicField(this, "_size", 0);
       if (capacity !== void 0)
         this._capacity = capacity;
     }
-    _nodes = {};
     get nodes() {
       return this._nodes;
     }
-    _capacity = Number.MAX_SAFE_INTEGER;
     get capacity() {
       return this._capacity;
     }
-    _first = -1;
     get first() {
       return this._first;
     }
-    _last = -1;
     get last() {
       return this._last;
     }
-    _size = 0;
     get size() {
       return this._size;
     }
@@ -2838,7 +2909,9 @@ var dataStructureTyped = (() => {
     }
   };
   var ArrayDeque = class {
-    _nodes = [];
+    constructor() {
+      __publicField(this, "_nodes", []);
+    }
     get nodes() {
       return this._nodes;
     }
@@ -2872,7 +2945,8 @@ var dataStructureTyped = (() => {
      * @returns The method `popLast()` returns the last element of the `_nodes` array, or `null` if the array is empty.
      */
     popLast() {
-      return this.nodes.pop() ?? null;
+      var _a;
+      return (_a = this.nodes.pop()) != null ? _a : null;
     }
     /**
      * Time Complexity: O(n)
@@ -2887,7 +2961,8 @@ var dataStructureTyped = (() => {
      * empty.
      */
     popFirst() {
-      return this.nodes.shift() ?? null;
+      var _a;
+      return (_a = this.nodes.shift()) != null ? _a : null;
     }
     /**
      * Time Complexity: O(n)
@@ -2918,7 +2993,8 @@ var dataStructureTyped = (() => {
      * empty, it will return `null`.
      */
     getFirst() {
-      return this.nodes[0] ?? null;
+      var _a;
+      return (_a = this.nodes[0]) != null ? _a : null;
     }
     /**
      * Time Complexity: O(1)
@@ -2932,7 +3008,8 @@ var dataStructureTyped = (() => {
      * @returns The method `getLast()` returns the last element of the `_nodes` array, or `null` if the array is empty.
      */
     getLast() {
-      return this.nodes[this.nodes.length - 1] ?? null;
+      var _a;
+      return (_a = this.nodes[this.nodes.length - 1]) != null ? _a : null;
     }
     /**
      * Time Complexity: O(1)
@@ -2949,7 +3026,8 @@ var dataStructureTyped = (() => {
      * will be returned. If the element does not exist (i.e., the index is out of bounds), `null` will be returned.
      */
     get(index) {
-      return this.nodes[index] ?? null;
+      var _a;
+      return (_a = this.nodes[index]) != null ? _a : null;
     }
     /**
      * Time Complexity: O(1)
@@ -3060,13 +3138,13 @@ var dataStructureTyped = (() => {
   var trampolineAsync = (fn) => {
     const cont = (...args) => toThunk(() => fn(...args));
     return Object.assign(
-      async (...args) => {
-        let result = await fn(...args);
+      (...args) => __async(void 0, null, function* () {
+        let result = yield fn(...args);
         while (isThunk(result) && typeof result === "function") {
-          result = await result();
+          result = yield result();
         }
         return result;
-      },
+      }),
       { cont }
     );
   };
@@ -3080,17 +3158,17 @@ var dataStructureTyped = (() => {
   // src/data-structures/heap/heap.ts
   var Heap = class _Heap {
     constructor(options) {
+      __publicField(this, "_nodes", []);
+      __publicField(this, "_comparator");
       this._comparator = options.comparator;
       if (options.nodes && options.nodes.length > 0) {
         this._nodes = options.nodes;
         this.fix();
       }
     }
-    _nodes = [];
     get nodes() {
       return this._nodes;
     }
-    _comparator;
     get comparator() {
       return this._comparator;
     }
@@ -3105,7 +3183,8 @@ var dataStructureTyped = (() => {
      * @returns The last element or undefined if the heap is empty.
      */
     get leaf() {
-      return this.nodes[this.size - 1] ?? void 0;
+      var _a;
+      return (_a = this.nodes[this.size - 1]) != null ? _a : void 0;
     }
     /**
      * Static method that creates a binary heap from an array of nodes and a comparison function.
@@ -3397,14 +3476,14 @@ var dataStructureTyped = (() => {
     }
   };
   var FibonacciHeapNode = class {
-    element;
-    degree;
-    left;
-    right;
-    child;
-    parent;
-    marked;
     constructor(element, degree = 0) {
+      __publicField(this, "element");
+      __publicField(this, "degree");
+      __publicField(this, "left");
+      __publicField(this, "right");
+      __publicField(this, "child");
+      __publicField(this, "parent");
+      __publicField(this, "marked");
       this.element = element;
       this.degree = degree;
       this.marked = false;
@@ -3412,25 +3491,25 @@ var dataStructureTyped = (() => {
   };
   var FibonacciHeap = class {
     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 constructor: given comparator should be a function.");
       }
     }
-    _root;
     get root() {
       return this._root;
     }
-    _size = 0;
     get size() {
       return this._size;
     }
-    _min;
     get min() {
       return this._min;
     }
-    _comparator;
     get comparator() {
       return this._comparator;
     }
@@ -3813,8 +3892,6 @@ var dataStructureTyped = (() => {
 
   // src/data-structures/graph/abstract-graph.ts
   var AbstractVertex = class {
-    key;
-    value;
     /**
      * The function is a protected constructor that takes an key and an optional value as parameters.
      * @param {VertexKey} key - The `key` parameter is of type `VertexKey` and represents the identifier of the vertex. It is
@@ -3823,13 +3900,13 @@ var dataStructureTyped = (() => {
      * vertex. If no value is provided, it will be set to undefined.
      */
     constructor(key, value) {
+      __publicField(this, "key");
+      __publicField(this, "value");
       this.key = key;
       this.value = value;
     }
   };
   var AbstractEdge = class {
-    value;
-    weight;
     /**
      * The above function is a protected constructor that initializes the weight, value, and hash code properties of an
      * object.
@@ -3840,11 +3917,13 @@ var dataStructureTyped = (() => {
      * meaning it can be omitted when creating an instance of the class.
      */
     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;
     }
@@ -3854,7 +3933,9 @@ var dataStructureTyped = (() => {
      */
   };
   var AbstractGraph = class {
-    _vertices = /* @__PURE__ */ new Map();
+    constructor() {
+      __publicField(this, "_vertices", /* @__PURE__ */ new Map());
+    }
     get vertices() {
       return this._vertices;
     }
@@ -4063,9 +4144,10 @@ var dataStructureTyped = (() => {
      * @returns The function `getPathSumWeight` returns the sum of the weights of the edges in the given path.
      */
     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;
     }
@@ -4155,6 +4237,7 @@ var dataStructureTyped = (() => {
      * two vertices (`v1` and `v2`). If there is no path between the vertices, it returns `null`.
      */
     getMinPathBetween(v1, v2, isWeight, isDFS = false) {
+      var _a, _b;
       if (isWeight === void 0)
         isWeight = false;
       if (isWeight) {
@@ -4173,7 +4256,7 @@ var dataStructureTyped = (() => {
           }
           return allPaths[minIndex] || null;
         } 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 = [];
@@ -4362,6 +4445,7 @@ var dataStructureTyped = (() => {
      * @returns The function `dijkstra` returns an object of type `DijkstraResult<VO>`.
      */
     dijkstra(src, dest, getMinDist, genPaths) {
+      var _a;
       if (getMinDist === void 0)
         getMinDist = false;
       if (genPaths === void 0)
@@ -4408,8 +4492,8 @@ var dataStructureTyped = (() => {
       };
       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);
@@ -4425,7 +4509,7 @@ var dataStructureTyped = (() => {
             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) {
@@ -4602,6 +4686,7 @@ var dataStructureTyped = (() => {
        * path between vertices in the
        */
     floydWarshall() {
+      var _a;
       const idAndVertices = [...this._vertices];
       const n = idAndVertices.length;
       const costs = [];
@@ -4615,7 +4700,7 @@ var dataStructureTyped = (() => {
       }
       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 || Infinity;
+          costs[i][j] = ((_a = this.getEdge(idAndVertices[i][1], idAndVertices[j][1])) == null ? void 0 : _a.weight) || Infinity;
         }
       }
       for (let k = 0; k < n; k++) {
@@ -4726,10 +4811,11 @@ var dataStructureTyped = (() => {
       const getSCCs = () => {
         const SCCs2 = /* @__PURE__ */ new Map();
         lowMap.forEach((low, vertex) => {
+          var _a;
           if (!SCCs2.has(low)) {
             SCCs2.set(low, [vertex]);
           } else {
-            SCCs2.get(low)?.push(vertex);
+            (_a = SCCs2.get(low)) == null ? void 0 : _a.push(vertex);
           }
         });
         return SCCs2;
@@ -4834,8 +4920,6 @@ var dataStructureTyped = (() => {
     }
   };
   var DirectedEdge = class extends AbstractEdge {
-    src;
-    dest;
     /**
      * The constructor function initializes the source and destination vertices of an edge, along with an optional weight
      * and value.
@@ -4849,6 +4933,8 @@ var dataStructureTyped = (() => {
      */
     constructor(src, dest, weight, value) {
       super(weight, value);
+      __publicField(this, "src");
+      __publicField(this, "dest");
       this.src = src;
       this.dest = dest;
     }
@@ -4859,12 +4945,12 @@ var dataStructureTyped = (() => {
      */
     constructor() {
       super();
+      __publicField(this, "_outEdgeMap", /* @__PURE__ */ new Map());
+      __publicField(this, "_inEdgeMap", /* @__PURE__ */ new Map());
     }
-    _outEdgeMap = /* @__PURE__ */ new Map();
     get outEdgeMap() {
       return this._outEdgeMap;
     }
-    _inEdgeMap = /* @__PURE__ */ new Map();
     get inEdgeMap() {
       return this._inEdgeMap;
     }
@@ -4882,7 +4968,7 @@ var dataStructureTyped = (() => {
      * @returns a new instance of a DirectedVertex object, casted as type VO.
      */
     createVertex(key, value) {
-      return new DirectedVertex(key, value ?? key);
+      return new DirectedVertex(key, value != null ? value : key);
     }
     /**
      * In TypeScript, a subclass inherits the interface implementation of its parent class, without needing to implement the same interface again in the subclass. This behavior differs from Java's approach. In Java, if a parent class implements an interface, the subclass needs to explicitly implement the same interface, even if the parent class has already implemented it.
@@ -4899,7 +4985,7 @@ var dataStructureTyped = (() => {
      * @returns a new instance of a DirectedEdge object, casted as type EO.
      */
     createEdge(src, dest, weight, value) {
-      return new DirectedEdge(src, dest, weight ?? 1, value);
+      return new DirectedEdge(src, dest, weight != null ? weight : 1, value);
     }
     /**
      * Time Complexity: O(|V|) where |V| is the number of vertices
@@ -5187,7 +5273,7 @@ var dataStructureTyped = (() => {
      * @returns an array of vertices or vertex IDs in topological order. If there is a cycle in the graph, it returns null.
      */
     topologicalSort(propertyName) {
-      propertyName = propertyName ?? "key";
+      propertyName = propertyName != null ? propertyName : "key";
       const statusMap = /* @__PURE__ */ new Map();
       for (const entry of this.vertices) {
         statusMap.set(entry[1], 0);
@@ -5344,7 +5430,6 @@ var dataStructureTyped = (() => {
     }
   };
   var UndirectedEdge = class extends AbstractEdge {
-    vertices;
     /**
      * The constructor function creates an instance of a class with two vertex IDs, an optional weight, and an optional
      * value.
@@ -5357,6 +5442,7 @@ var dataStructureTyped = (() => {
      */
     constructor(v1, v2, weight, value) {
       super(weight, value);
+      __publicField(this, "vertices");
       this.vertices = [v1, v2];
     }
   };
@@ -5366,9 +5452,9 @@ var dataStructureTyped = (() => {
      */
     constructor() {
       super();
+      __publicField(this, "_edges");
       this._edges = /* @__PURE__ */ new Map();
     }
-    _edges;
     get edges() {
       return this._edges;
     }
@@ -5382,7 +5468,7 @@ var dataStructureTyped = (() => {
      * @returns The method is returning a new instance of the `UndirectedVertex` class, casted as type `VO`.
      */
     createVertex(key, value) {
-      return new UndirectedVertex(key, value ?? key);
+      return new UndirectedVertex(key, value != null ? value : key);
     }
     /**
      * The function creates an undirected edge between two vertices with an optional weight and value.
@@ -5395,7 +5481,7 @@ var dataStructureTyped = (() => {
      * @returns a new instance of the `UndirectedEdge` class, which is casted as type `EO`.
      */
     createEdge(v1, v2, weight, value) {
-      return new UndirectedEdge(v1, v2, weight ?? 1, value);
+      return new UndirectedEdge(v1, v2, weight != null ? weight : 1, value);
     }
     /**
      * Time Complexity: O(|E|), where |E| is the number of edges incident to the given vertex.
@@ -5413,12 +5499,13 @@ var dataStructureTyped = (() => {
      * @returns an edge (EO) or null.
      */
     getEdge(v1, v2) {
+      var _a;
       let edges = [];
       if (v1 !== null && v2 !== null) {
         const vertex1 = this._getVertex(v1);
         const vertex2 = this._getVertex(v2);
         if (vertex1 && vertex2) {
-          edges = this._edges.get(vertex1)?.filter((e) => e.vertices.includes(vertex2.key));
+          edges = (_a = this._edges.get(vertex1)) == null ? void 0 : _a.filter((e) => e.vertices.includes(vertex2.key));
         }
       }
       return edges ? edges[0] || null : null;
@@ -5484,9 +5571,10 @@ var dataStructureTyped = (() => {
      * edges connected to that vertex.
      */
     degreeOf(vertexOrKey) {
+      var _a;
       const vertex = this._getVertex(vertexOrKey);
       if (vertex) {
-        return this._edges.get(vertex)?.length || 0;
+        return ((_a = this._edges.get(vertex)) == null ? void 0 : _a.length) || 0;
       } else {
         return 0;
       }
@@ -5617,8 +5705,6 @@ var dataStructureTyped = (() => {
 
   // src/data-structures/graph/map-graph.ts
   var MapVertex = class extends DirectedVertex {
-    lat;
-    long;
     /**
      * The constructor function initializes an object with an key, latitude, longitude, and an optional value.
      * @param {VertexKey} key - The `key` parameter is of type `VertexKey` and represents the identifier of the vertex.
@@ -5633,6 +5719,8 @@ var dataStructureTyped = (() => {
      */
     constructor(key, value, lat, long) {
       super(key, value);
+      __publicField(this, "lat");
+      __publicField(this, "long");
       this.lat = lat;
       this.long = long;
     }
@@ -5664,14 +5752,14 @@ var dataStructureTyped = (() => {
      */
     constructor(origin, bottomRight) {
       super();
+      __publicField(this, "_origin", [0, 0]);
+      __publicField(this, "_bottomRight");
       this._origin = origin;
       this._bottomRight = bottomRight;
     }
-    _origin = [0, 0];
     get origin() {
       return this._origin;
     }
-    _bottomRight;
     get bottomRight() {
       return this._bottomRight;
     }
@@ -5748,28 +5836,29 @@ var dataStructureTyped = (() => {
 
   // src/data-structures/binary-tree/binary-tree.ts
   var BinaryTreeNode = class {
-    /**
-     * The key associated with the node.
-     */
-    key;
-    /**
-     * The value stored in the node.
-     */
-    value;
-    /**
-     * The parent node of the current node.
-     */
-    parent;
     /**
      * Creates a new instance of BinaryTreeNode.
      * @param {BTNKey} key - The key associated with the node.
      * @param {V} value - The value stored in the node.
      */
     constructor(key, value) {
+      /**
+       * The key associated with the node.
+       */
+      __publicField(this, "key");
+      /**
+       * The value stored in the node.
+       */
+      __publicField(this, "value");
+      /**
+       * The parent node of the current node.
+       */
+      __publicField(this, "parent");
+      __publicField(this, "_left");
+      __publicField(this, "_right");
       this.key = key;
       this.value = value;
     }
-    _left;
     /**
      * Get the left child node.
      */
@@ -5786,7 +5875,6 @@ var dataStructureTyped = (() => {
       }
       this._left = v;
     }
-    _right;
     /**
      * Get the right child node.
      */
@@ -5821,26 +5909,27 @@ var dataStructureTyped = (() => {
     }
   };
   var BinaryTree = class {
-    iterationType = "ITERATIVE" /* ITERATIVE */;
     /**
      * Creates a new instance of BinaryTree.
      * @param {BinaryTreeOptions} [options] - The options for the binary tree.
      */
     constructor(options) {
+      __publicField(this, "iterationType", "ITERATIVE" /* ITERATIVE */);
+      __publicField(this, "_root");
+      __publicField(this, "_size");
+      __publicField(this, "_defaultOneParamCallback", (node) => node.key);
       if (options) {
         const { iterationType = "ITERATIVE" /* ITERATIVE */ } = options;
         this.iterationType = iterationType;
       }
       this._size = 0;
     }
-    _root;
     /**
      * Get the root node of the binary tree.
      */
     get root() {
       return this._root;
     }
-    _size;
     /**
      * Get the number of nodes in the binary tree.
      */
@@ -5941,7 +6030,7 @@ var dataStructureTyped = (() => {
         if (keyOrNode === null) {
           return this.add(null);
         }
-        const value = values?.[i];
+        const value = values == null ? void 0 : values[i];
         return this.add(keyOrNode, value);
       });
     }
@@ -5993,7 +6082,7 @@ var dataStructureTyped = (() => {
       const curr = this.getNode(identifier, callback);
       if (!curr)
         return deletedResult;
-      const parent = curr?.parent ? curr.parent : null;
+      const parent = (curr == null ? void 0 : curr.parent) ? curr.parent : null;
       let needBalanced = void 0;
       let orgCurrent = curr;
       if (!curr.left) {
@@ -6049,7 +6138,7 @@ var dataStructureTyped = (() => {
       distNode = this.ensureNotKey(distNode);
       beginRoot = this.ensureNotKey(beginRoot);
       let depth = 0;
-      while (distNode?.parent) {
+      while (distNode == null ? void 0 : distNode.parent) {
         if (distNode === beginRoot) {
           return depth;
         }
@@ -6123,6 +6212,7 @@ var dataStructureTyped = (() => {
      * @returns The function `getMinHeight` returns the minimum height of a binary tree.
      */
     getMinHeight(beginRoot = this.root, iterationType = this.iterationType) {
+      var _a, _b, _c;
       beginRoot = this.ensureNotKey(beginRoot);
       if (!beginRoot)
         return -1;
@@ -6150,8 +6240,8 @@ var dataStructureTyped = (() => {
             if (!node.right || last === node.right) {
               node = stack.pop();
               if (node) {
-                const leftMinHeight = node.left ? depths.get(node.left) ?? -1 : -1;
-                const rightMinHeight = node.right ? depths.get(node.right) ?? -1 : -1;
+                const leftMinHeight = node.left ? (_a = depths.get(node.left)) != null ? _a : -1 : -1;
+                const rightMinHeight = node.right ? (_b = depths.get(node.right)) != null ? _b : -1 : -1;
                 depths.set(node, 1 + Math.min(leftMinHeight, rightMinHeight));
                 last = node;
                 node = null;
@@ -6160,7 +6250,7 @@ var dataStructureTyped = (() => {
               node = node.right;
           }
         }
-        return depths.get(beginRoot) ?? -1;
+        return (_c = depths.get(beginRoot)) != null ? _c : -1;
       }
     }
     /**
@@ -6302,9 +6392,10 @@ var dataStructureTyped = (() => {
      * @returns a value of type `N | null | undefined`.
      */
     getNode(identifier, callback = this._defaultOneParamCallback, beginRoot = this.root, iterationType = this.iterationType) {
+      var _a;
       if ((!callback || callback === this._defaultOneParamCallback) && identifier instanceof BinaryTreeNode)
         callback = (node) => node;
-      return this.getNodes(identifier, callback, true, beginRoot, iterationType)[0] ?? null;
+      return (_a = this.getNodes(identifier, callback, true, beginRoot, iterationType)[0]) != null ? _a : null;
     }
     /**
      * Time Complexity: O(n)
@@ -6393,9 +6484,10 @@ var dataStructureTyped = (() => {
      * found, `undefined` is returned.
      */
     get(identifier, callback = this._defaultOneParamCallback, beginRoot = this.root, iterationType = this.iterationType) {
+      var _a, _b;
       if ((!callback || callback === this._defaultOneParamCallback) && identifier instanceof BinaryTreeNode)
         callback = (node) => node;
-      return this.getNode(identifier, callback, beginRoot, iterationType)?.value ?? void 0;
+      return (_b = (_a = this.getNode(identifier, callback, beginRoot, iterationType)) == null ? void 0 : _a.value) != null ? _b : void 0;
     }
     /**
      * Clear the binary tree, removing all nodes.
@@ -7126,11 +7218,11 @@ var dataStructureTyped = (() => {
         }
       } else {
         if (node.left) {
-          yield* this[Symbol.iterator](node.left);
+          yield* __yieldStar(this[Symbol.iterator](node.left));
         }
         yield node.key;
         if (node.right) {
-          yield* this[Symbol.iterator](node.right);
+          yield* __yieldStar(this[Symbol.iterator](node.right));
         }
       }
     }
@@ -7195,7 +7287,6 @@ var dataStructureTyped = (() => {
       };
       display(beginRoot);
     }
-    _defaultOneParamCallback = (node) => node.key;
     /**
      * Swap the data of two nodes in the binary tree.
      * @param {N} srcNode - The source node to swap.
@@ -7268,14 +7359,15 @@ var dataStructureTyped = (() => {
 
   // src/data-structures/binary-tree/bst.ts
   var BSTNode = class extends BinaryTreeNode {
-    parent;
     constructor(key, value) {
       super(key, value);
+      __publicField(this, "parent");
+      __publicField(this, "_left");
+      __publicField(this, "_right");
       this.parent = void 0;
       this._left = void 0;
       this._right = void 0;
     }
-    _left;
     /**
      * Get the left child node.
      */
@@ -7292,7 +7384,6 @@ var dataStructureTyped = (() => {
       }
       this._left = v;
     }
-    _right;
     /**
      * Get the right child node.
      */
@@ -7318,6 +7409,8 @@ var dataStructureTyped = (() => {
      */
     constructor(options) {
       super(options);
+      __publicField(this, "_root");
+      __publicField(this, "_comparator", (a, b) => a - b);
       this._root = void 0;
       if (options !== void 0) {
         const { comparator } = options;
@@ -7326,7 +7419,6 @@ var dataStructureTyped = (() => {
         }
       }
     }
-    _root;
     /**
      * Get the root node of the binary tree.
      */
@@ -7450,10 +7542,10 @@ var dataStructureTyped = (() => {
         return arr.indexOf(void 0) === -1;
       }
       if (!isBalanceAdd || !hasNoUndefined(keysOrNodes)) {
-        return super.addMany(keysOrNodes, data).map((n) => n ?? void 0);
+        return super.addMany(keysOrNodes, data).map((n) => n != null ? n : void 0);
       }
       const inserted = [];
-      const combinedArr = keysOrNodes.map((value, index) => [value, data?.[index]]);
+      const combinedArr = keysOrNodes.map((value, index) => [value, data == null ? void 0 : data[index]]);
       let sorted = [];
       function _isNodeOrUndefinedTuple(arr) {
         for (const [keyOrNode] of arr)
@@ -7481,10 +7573,10 @@ var dataStructureTyped = (() => {
         if (arr.length === 0)
           return;
         const mid = Math.floor((arr.length - 1) / 2);
-        const newNode = this.add(arr[mid], data2?.[mid]);
+        const newNode = this.add(arr[mid], data2 == null ? void 0 : data2[mid]);
         inserted.push(newNode);
-        _dfs(arr.slice(0, mid), data2?.slice(0, mid));
-        _dfs(arr.slice(mid + 1), data2?.slice(mid + 1));
+        _dfs(arr.slice(0, mid), data2 == null ? void 0 : data2.slice(0, mid));
+        _dfs(arr.slice(mid + 1), data2 == null ? void 0 : data2.slice(mid + 1));
       };
       const _iterate = () => {
         const n = sorted.length;
@@ -7495,7 +7587,7 @@ var dataStructureTyped = (() => {
             const [l, r] = popped;
             if (l <= r) {
               const m = l + Math.floor((r - l) / 2);
-              const newNode = this.add(sortedKeysOrNodes[m], sortedData?.[m]);
+              const newNode = this.add(sortedKeysOrNodes[m], sortedData == null ? void 0 : sortedData[m]);
               inserted.push(newNode);
               stack.push([m + 1, r]);
               stack.push([l, m - 1]);
@@ -7530,12 +7622,13 @@ var dataStructureTyped = (() => {
      * rightmost node otherwise. If no node is found, it returns 0.
      */
     lastKey(beginRoot = this.root, iterationType = this.iterationType) {
+      var _a, _b, _c, _d, _e, _f;
       if (this._compare(0, 1) === "lt" /* lt */)
-        return this.getRightMost(beginRoot, iterationType)?.key ?? 0;
+        return (_b = (_a = this.getRightMost(beginRoot, iterationType)) == null ? void 0 : _a.key) != null ? _b : 0;
       else if (this._compare(0, 1) === "gt" /* gt */)
-        return this.getLeftMost(beginRoot, iterationType)?.key ?? 0;
+        return (_d = (_c = this.getLeftMost(beginRoot, iterationType)) == null ? void 0 : _c.key) != null ? _d : 0;
       else
-        return this.getRightMost(beginRoot, iterationType)?.key ?? 0;
+        return (_f = (_e = this.getRightMost(beginRoot, iterationType)) == null ? void 0 : _e.key) != null ? _f : 0;
     }
     /**
      * Time Complexity: O(log n) - Average case for a balanced tree.
@@ -7813,6 +7906,7 @@ var dataStructureTyped = (() => {
      * @returns a boolean value.
      */
     isAVLBalanced(iterationType = this.iterationType) {
+      var _a, _b;
       if (!this.root)
         return true;
       let balanced = true;
@@ -7839,8 +7933,8 @@ var dataStructureTyped = (() => {
             if (!node.right || last === node.right) {
               node = stack.pop();
               if (node) {
-                const left = node.left ? depths.get(node.left) ?? -1 : -1;
-                const right = node.right ? depths.get(node.right) ?? -1 : -1;
+                const left = node.left ? (_a = depths.get(node.left)) != null ? _a : -1 : -1;
+                const right = node.right ? (_b = depths.get(node.right)) != null ? _b : -1 : -1;
                 if (Math.abs(left - right) > 1)
                   return false;
                 depths.set(node, 1 + Math.max(left, right));
@@ -7854,7 +7948,6 @@ var dataStructureTyped = (() => {
       }
       return balanced;
     }
-    _comparator = (a, b) => a - b;
     _setRoot(v) {
       if (v) {
         v.parent = void 0;
@@ -7882,8 +7975,6 @@ var dataStructureTyped = (() => {
 
   // src/data-structures/binary-tree/binary-indexed-tree.ts
   var BinaryIndexedTree = class {
-    _freq;
-    _max;
     /**
      * The constructor initializes the properties of an object, including default frequency, maximum
      * value, a freqMap data structure, the most significant bit, and the count of negative frequencies.
@@ -7891,21 +7982,23 @@ var dataStructureTyped = (() => {
      * 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;
     get freqMap() {
       return this._freqMap;
     }
-    _msb;
     get msb() {
       return this._msb;
     }
-    _negativeCount;
     get negativeCount() {
       return this._negativeCount;
     }
@@ -8144,13 +8237,13 @@ var dataStructureTyped = (() => {
 
   // src/data-structures/binary-tree/segment-tree.ts
   var SegmentTreeNode = class {
-    start = 0;
-    end = 0;
-    value = null;
-    sum = 0;
-    left = null;
-    right = null;
     constructor(start, end, sum, value) {
+      __publicField(this, "start", 0);
+      __publicField(this, "end", 0);
+      __publicField(this, "value", null);
+      __publicField(this, "sum", 0);
+      __publicField(this, "left", null);
+      __publicField(this, "right", null);
       this.start = start;
       this.end = end;
       this.sum = sum;
@@ -8168,6 +8261,10 @@ var dataStructureTyped = (() => {
      * 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;
@@ -8180,19 +8277,15 @@ var dataStructureTyped = (() => {
         this._values = [];
       }
     }
-    _values = [];
     get values() {
       return this._values;
     }
-    _start = 0;
     get start() {
       return this._start;
     }
-    _end;
     get end() {
       return this._end;
     }
-    _root;
     get root() {
       return this._root;
     }
@@ -8308,9 +8401,9 @@ var dataStructureTyped = (() => {
 
   // src/data-structures/binary-tree/avl-tree.ts
   var AVLTreeNode = class extends BSTNode {
-    height;
     constructor(key, value) {
       super(key, value);
+      __publicField(this, "height");
       this.height = 0;
     }
   };
@@ -8526,7 +8619,7 @@ var dataStructureTyped = (() => {
         if (B)
           this._setRoot(B);
       } else {
-        if (parentOfA?.left === A) {
+        if ((parentOfA == null ? void 0 : parentOfA.left) === A) {
           parentOfA.left = B;
         } else {
           if (parentOfA)
@@ -8693,14 +8786,13 @@ var dataStructureTyped = (() => {
 
   // src/data-structures/binary-tree/rb-tree.ts
   var RedBlackTreeNode = class extends BSTNode {
-    color;
     constructor(key, value, color = 0 /* BLACK */) {
       super(key, value);
+      __publicField(this, "color");
       this.color = color;
     }
   };
   var RedBlackTree = class extends BST {
-    NIL = new RedBlackTreeNode(NaN);
     /**
      * The constructor function initializes a Red-Black Tree with an optional set of options.
      * @param {RBTreeOptions} [options] - The `options` parameter is an optional object that can be
@@ -8708,13 +8800,14 @@ var dataStructureTyped = (() => {
      */
     constructor(options) {
       super(options);
+      __publicField(this, "NIL", new RedBlackTreeNode(NaN));
+      __publicField(this, "_root");
+      __publicField(this, "_size", 0);
       this._root = this.NIL;
     }
-    _root;
     get root() {
       return this._root;
     }
-    _size = 0;
     get size() {
       return this._size;
     }
@@ -8755,7 +8848,7 @@ var dataStructureTyped = (() => {
         if (x && node.key < x.key) {
           x = x.left;
         } else {
-          x = x?.right;
+          x = x == null ? void 0 : x.right;
         }
       }
       node.parent = y;
@@ -8814,7 +8907,7 @@ var dataStructureTyped = (() => {
           if (node && identifier && callback(node) <= identifier) {
             node = node.right;
           } else {
-            node = node?.left;
+            node = node == null ? void 0 : node.left;
           }
         }
         if (z === this.NIL) {
@@ -8882,10 +8975,11 @@ var dataStructureTyped = (() => {
      * @returns a value of type `N`, `null`, or `undefined`.
      */
     getNode(identifier, callback = this._defaultOneParamCallback, beginRoot = this.root, iterationType = this.iterationType) {
+      var _a;
       if (identifier instanceof BinaryTreeNode)
         callback = (node) => node;
       beginRoot = this.ensureNotKey(beginRoot);
-      return this.getNodes(identifier, callback, true, beginRoot, iterationType)[0] ?? void 0;
+      return (_a = this.getNodes(identifier, callback, true, beginRoot, iterationType)[0]) != null ? _a : void 0;
     }
     /**
      * Time Complexity: O(log n) on average (where n is the number of nodes in the tree)
@@ -8900,8 +8994,9 @@ var dataStructureTyped = (() => {
      * @returns the successor of the given RedBlackTreeNode.
      */
     getSuccessor(x) {
+      var _a;
       if (x.right !== this.NIL) {
-        return this.getLeftMost(x.right) ?? void 0;
+        return (_a = this.getLeftMost(x.right)) != null ? _a : void 0;
       }
       let y = x.parent;
       while (y !== this.NIL && y !== void 0 && x === y.right) {
@@ -9159,7 +9254,6 @@ var dataStructureTyped = (() => {
 
   // src/data-structures/binary-tree/tree-multimap.ts
   var TreeMultimapNode = class extends AVLTreeNode {
-    count;
     /**
      * The constructor function initializes a BinaryTreeNode object with a key, value, and count.
      * @param {BTNKey} key - The `key` parameter is of type `BTNKey` and represents the unique identifier
@@ -9172,6 +9266,7 @@ var dataStructureTyped = (() => {
      */
     constructor(key, value, count = 1) {
       super(key, value);
+      __publicField(this, "count");
       this.count = count;
     }
   };
@@ -9184,8 +9279,8 @@ var dataStructureTyped = (() => {
      */
     constructor(options) {
       super(options);
+      __publicField(this, "_count", 0);
     }
-    _count = 0;
     get count() {
       return this._count;
     }
@@ -9311,7 +9406,7 @@ var dataStructureTyped = (() => {
           inserted.push(this.add(NaN, void 0, 0));
           continue;
         }
-        inserted.push(this.add(keyOrNode, data?.[i], 1));
+        inserted.push(this.add(keyOrNode, data == null ? void 0 : data[i], 1));
       }
       return inserted;
     }
@@ -9389,13 +9484,14 @@ var dataStructureTyped = (() => {
      * @returns an array of `BiTreeDeleteResult<N>`.
      */
     delete(identifier, callback = this._defaultOneParamCallback, ignoreCount = false) {
+      var _a;
       const deletedResult = [];
       if (!this.root)
         return deletedResult;
-      const curr = this.getNode(identifier, callback) ?? void 0;
+      const curr = (_a = this.getNode(identifier, callback)) != 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--;
@@ -9523,10 +9619,10 @@ var dataStructureTyped = (() => {
 
   // src/data-structures/tree/tree.ts
   var TreeNode = class _TreeNode {
-    key;
-    value;
-    children;
     constructor(key, value, children) {
+      __publicField(this, "key");
+      __publicField(this, "value");
+      __publicField(this, "children");
       this.key = key;
       this.value = value || void 0;
       this.children = children || [];
@@ -9563,13 +9659,13 @@ var dataStructureTyped = (() => {
 
   // src/data-structures/matrix/matrix.ts
   var MatrixNTI2D = class {
-    _matrix;
     /**
      * The constructor creates a matrix with the specified number of rows and columns, and initializes all elements to a
      * given initial value or 0 if not provided.
      * @param options - An object containing the following properties:
      */
     constructor(options) {
+      __publicField(this, "_matrix");
       const { row, col, initialVal } = options;
       this._matrix = new Array(row).fill(void 0).map(() => new Array(col).fill(initialVal || 0));
     }
@@ -9861,7 +9957,6 @@ var dataStructureTyped = (() => {
 
   // src/data-structures/matrix/matrix2d.ts
   var Matrix2D = class _Matrix2D {
-    _matrix;
     /**
      * The constructor function initializes a Matrix2D object with either a default identity matrix, or a provided matrix
      * or Vector2D object.
@@ -9869,6 +9964,7 @@ var dataStructureTyped = (() => {
      * an instance of the `Vector2D` class.
      */
     constructor(value) {
+      __publicField(this, "_matrix");
       if (typeof value === "undefined") {
         this._matrix = _Matrix2D.identity;
       } else if (value instanceof Vector2D) {
@@ -10049,8 +10145,6 @@ var dataStructureTyped = (() => {
 
   // src/data-structures/matrix/navigator.ts
   var Character = class _Character {
-    direction;
-    turn;
     /**
      * The constructor function takes in a direction and turning object and sets the direction and turn properties of the
      * Character class.
@@ -10060,22 +10154,24 @@ var dataStructureTyped = (() => {
      * 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 {
-    onMove;
-    _matrix;
-    _cur;
-    _character;
-    _VISITED;
     /**
      * The constructor initializes the Navigator object with the given parameters and sets the current position as visited
      * in the matrix.
      * @param  - - `matrix`: a 2D array representing the grid or map
      */
     constructor({ matrix, turning, onMove, init: { cur, charDir, VISITED } }) {
+      __publicField(this, "onMove");
+      __publicField(this, "_matrix");
+      __publicField(this, "_cur");
+      __publicField(this, "_character");
+      __publicField(this, "_VISITED");
       this._matrix = matrix;
       this._cur = cur;
       this._character = new Character(charDir, turning);
@@ -10158,10 +10254,10 @@ var dataStructureTyped = (() => {
 
   // src/data-structures/trie/trie.ts
   var TrieNode = class {
-    key;
-    children;
-    isEnd;
     constructor(key) {
+      __publicField(this, "key");
+      __publicField(this, "children");
+      __publicField(this, "isEnd");
       this.key = key;
       this.isEnd = false;
       this.children = /* @__PURE__ */ new Map();
@@ -10169,6 +10265,8 @@ var dataStructureTyped = (() => {
   };
   var Trie = class {
     constructor(words, caseSensitive = true) {
+      __publicField(this, "_caseSensitive");
+      __publicField(this, "_root");
       this._root = new TrieNode("");
       this._caseSensitive = caseSensitive;
       if (words) {
@@ -10177,11 +10275,9 @@ var dataStructureTyped = (() => {
         }
       }
     }
-    _caseSensitive;
     get caseSensitive() {
       return this._caseSensitive;
     }
-    _root;
     get root() {
       return this._root;
     }