data-structure-typed 2.4.3 → 2.4.4

package/dist/esm/index.mjs

@@ -1019,8 +1019,9 @@ var LinkedHashMap = class extends IterableEntryBase {
       const cur = node;
       node = node.next;
       if (predicate(cur.key, cur.value, i++, this)) {
-        if (isWeakKey(cur.key)) {
-          this._objMap.delete(cur.key);
+        const keyToCheck = cur.key;
+        if (isWeakKey(keyToCheck)) {
+          this._objMap.delete(keyToCheck);
         } else {
           const hash = this._hashFn(cur.key);
           delete this._noObjMap[hash];
@@ -1534,7 +1535,7 @@ var SinglyLinkedList = class extends LinearLinkedBase {
   static {
     __name(this, "SinglyLinkedList");
   }
-  _equals = Object.is;
+  _equals = /* @__PURE__ */ __name((a, b) => Object.is(a, b), "_equals");
   /**
    * Create a SinglyLinkedList and optionally bulk-insert elements.
    * @remarks Time O(N), Space O(N)
@@ -1638,8 +1639,8 @@ var SinglyLinkedList = class extends LinearLinkedBase {
       return value2;
     }
     let current = this.head;
-    while (current.next !== this.tail) current = current.next;
-    const value = this.tail.value;
+    while (current.next && current.next !== this.tail) current = current.next;
+    const value = this.tail?.value;
     current.next = void 0;
     this._tail = current;
     this._length--;
@@ -1727,8 +1728,8 @@ var SinglyLinkedList = class extends LinearLinkedBase {
   at(index) {
     if (index < 0 || index >= this._length) return void 0;
     let current = this.head;
-    for (let i = 0; i < index; i++) current = current.next;
-    return current.value;
+    for (let i = 0; i < index && current; i++) current = current.next;
+    return current?.value;
   }
   /**
    * Type guard: check whether the input is a SinglyLinkedListNode.
@@ -1748,7 +1749,7 @@ var SinglyLinkedList = class extends LinearLinkedBase {
   getNodeAt(index) {
     if (index < 0 || index >= this._length) return void 0;
     let current = this.head;
-    for (let i = 0; i < index; i++) current = current.next;
+    for (let i = 0; i < index && current; i++) current = current.next;
     return current;
   }
   /**
@@ -2257,7 +2258,7 @@ var DoublyLinkedList = class extends LinearLinkedBase {
   static {
     __name(this, "DoublyLinkedList");
   }
-  _equals = Object.is;
+  _equals = /* @__PURE__ */ __name((a, b) => Object.is(a, b), "_equals");
   /**
    * Create a DoublyLinkedList and optionally bulk-insert elements.
    * @remarks Time O(N), Space O(N)
@@ -2452,8 +2453,8 @@ var DoublyLinkedList = class extends LinearLinkedBase {
   at(index) {
     if (index < 0 || index >= this._length) return void 0;
     let current = this.head;
-    for (let i = 0; i < index; i++) current = current.next;
-    return current.value;
+    for (let i = 0; i < index && current; i++) current = current.next;
+    return current?.value;
   }
   /**
    * Get the node reference at a given index.
@@ -2464,7 +2465,7 @@ var DoublyLinkedList = class extends LinearLinkedBase {
   getNodeAt(index) {
     if (index < 0 || index >= this._length) return void 0;
     let current = this.head;
-    for (let i = 0; i < index; i++) current = current.next;
+    for (let i = 0; i < index && current; i++) current = current.next;
     return current;
   }
   /**
@@ -2970,7 +2971,7 @@ var Stack = class extends IterableElementBase {
   static {
     __name(this, "Stack");
   }
-  _equals = Object.is;
+  _equals = /* @__PURE__ */ __name((a, b) => Object.is(a, b), "_equals");
   /**
    * Create a Stack and optionally bulk-push elements.
    * @remarks Time O(N), Space O(N)
@@ -3606,7 +3607,7 @@ var Deque = class extends LinearBase {
   static {
     __name(this, "Deque");
   }
-  _equals = Object.is;
+  _equals = /* @__PURE__ */ __name((a, b) => Object.is(a, b), "_equals");
   /**
    * Create a Deque and optionally bulk-insert elements.
    * @remarks Time O(N), Space O(N)
@@ -4687,11 +4688,6 @@ var Heap = class _Heap extends IterableElementBase {
     return 0;
   }, "_DEFAULT_COMPARATOR");
   _comparator = this._DEFAULT_COMPARATOR;
-  /**
-  * Get the comparator used to order elements.
-  * @remarks Time O(1), Space O(1)
-  * @returns Comparator function.
-  */
   /**
    * Get the comparator used to order elements.
    * @remarks Time O(1), Space O(1)
@@ -4740,8 +4736,7 @@ var Heap = class _Heap extends IterableElementBase {
    */
   _createInstance(options) {
     const Ctor = this.constructor;
-    const next = new Ctor([], { comparator: this.comparator, toElementFn: this.toElementFn, ...options ?? {} });
-    return next;
+    return new Ctor([], { comparator: this.comparator, toElementFn: this.toElementFn, ...options ?? {} });
   }
   /**
    * (Protected) Create a like-kind instance seeded by elements.
@@ -5790,8 +5785,8 @@ var AbstractGraph = class extends IterableEntryBase {
     const Ctor = this.constructor;
     const instance = new Ctor();
     const graph = _options?.graph;
-    if (graph) instance._options = { ...instance._options, ...graph };
-    else instance._options = { ...instance._options, ...this._options };
+    if (graph) instance["_options"] = { ...instance["_options"], ...graph };
+    else instance["_options"] = { ...instance["_options"], ...this._options };
     return instance;
   }
   /**
@@ -5824,12 +5819,10 @@ var AbstractGraph = class extends IterableEntryBase {
       const [va, vb] = ends;
       const ka = va.key;
       const kb = vb.key;
-      const hasA = g.hasVertex ? g.hasVertex(ka) : false;
-      const hasB = g.hasVertex ? g.hasVertex(kb) : false;
+      const hasA = typeof g.hasVertex === "function" ? g.hasVertex(ka) : false;
+      const hasB = typeof g.hasVertex === "function" ? g.hasVertex(kb) : false;
       if (hasA && hasB) {
-        const w = e.weight;
-        const val = e.value;
-        const newEdge = g.createEdge(ka, kb, w, val);
+        const newEdge = g.createEdge(ka, kb, e.weight, e.value);
         g._addEdge(newEdge);
       }
     }
@@ -8256,7 +8249,7 @@ var BinaryTree = class extends IterableEntryBase {
    * @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");
+  _DEFAULT_NODE_CALLBACK = /* @__PURE__ */ __name((node) => node?.key, "_DEFAULT_NODE_CALLBACK");
   /**
    * (Protected) Snapshots the current tree's configuration options.
    * @remarks Time O(1)
@@ -13227,7 +13220,7 @@ var TreeMultiSet = class _TreeMultiSet {
    * @remarks Time O(1), Space O(1)
    */
   get comparator() {
-    return this.#core._comparator;
+    return this.#core.comparator;
   }
   // ━━━ clear ━━━
   /**
@@ -13364,7 +13357,7 @@ var TreeMultiSet = class _TreeMultiSet {
   filter(predicate) {
     const result = new _TreeMultiSet([], {
       comparator: this.#isDefaultComparator ? void 0 : this.comparator,
-      isMapMode: this.#core._isMapMode
+      isMapMode: this.#core.isMapMode
     });
     for (const [k, c] of this.entries()) {
       if (predicate(k, c)) {
@@ -13404,7 +13397,7 @@ var TreeMultiSet = class _TreeMultiSet {
   map(mapper, options) {
     const result = new _TreeMultiSet([], {
       comparator: options?.comparator,
-      isMapMode: this.#core._isMapMode
+      isMapMode: this.#core.isMapMode
     });
     for (const [k, c] of this.entries()) {
       const [newKey, newCount] = mapper(k, c);
@@ -13424,7 +13417,7 @@ var TreeMultiSet = class _TreeMultiSet {
   clone() {
     const result = new _TreeMultiSet([], {
       comparator: this.#isDefaultComparator ? void 0 : this.comparator,
-      isMapMode: this.#core._isMapMode
+      isMapMode: this.#core.isMapMode
     });
     for (const [k, c] of this.entries()) {
       result.add(k, c);
@@ -14476,12 +14469,11 @@ var Trie = class extends IterableElementBase {
    */
   _createInstance(options) {
     const Ctor = this.constructor;
-    const next = new Ctor([], {
+    return new Ctor([], {
       toElementFn: this.toElementFn,
       caseSensitive: this.caseSensitive,
       ...options ?? {}
     });
-    return next;
   }
   /**
    * (Protected) Create a like-kind trie and seed it from an iterable.

package/dist/esm-legacy/index.mjs

@@ -1023,8 +1023,9 @@ var _LinkedHashMap = class _LinkedHashMap extends IterableEntryBase {
       const cur = node;
       node = node.next;
       if (predicate(cur.key, cur.value, i++, this)) {
-        if (isWeakKey(cur.key)) {
-          this._objMap.delete(cur.key);
+        const keyToCheck = cur.key;
+        if (isWeakKey(keyToCheck)) {
+          this._objMap.delete(keyToCheck);
         } else {
           const hash = this._hashFn(cur.key);
           delete this._noObjMap[hash];
@@ -1542,7 +1543,7 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
    */
   constructor(elements = [], options) {
     super(options);
-    __publicField(this, "_equals", Object.is);
+    __publicField(this, "_equals", /* @__PURE__ */ __name((a, b) => Object.is(a, b), "_equals"));
     __publicField(this, "_head");
     __publicField(this, "_tail");
     __publicField(this, "_length", 0);
@@ -1630,6 +1631,7 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
    * @returns Removed element or undefined.
    */
   pop() {
+    var _a;
     if (!this.head) return void 0;
     if (this.head === this.tail) {
       const value2 = this.head.value;
@@ -1639,8 +1641,8 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
       return value2;
     }
     let current = this.head;
-    while (current.next !== this.tail) current = current.next;
-    const value = this.tail.value;
+    while (current.next && current.next !== this.tail) current = current.next;
+    const value = (_a = this.tail) == null ? void 0 : _a.value;
     current.next = void 0;
     this._tail = current;
     this._length--;
@@ -1728,8 +1730,8 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
   at(index) {
     if (index < 0 || index >= this._length) return void 0;
     let current = this.head;
-    for (let i = 0; i < index; i++) current = current.next;
-    return current.value;
+    for (let i = 0; i < index && current; i++) current = current.next;
+    return current == null ? void 0 : current.value;
   }
   /**
    * Type guard: check whether the input is a SinglyLinkedListNode.
@@ -1749,7 +1751,7 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
   getNodeAt(index) {
     if (index < 0 || index >= this._length) return void 0;
     let current = this.head;
-    for (let i = 0; i < index; i++) current = current.next;
+    for (let i = 0; i < index && current; i++) current = current.next;
     return current;
   }
   /**
@@ -2265,7 +2267,7 @@ var _DoublyLinkedList = class _DoublyLinkedList extends LinearLinkedBase {
    */
   constructor(elements = [], options) {
     super(options);
-    __publicField(this, "_equals", Object.is);
+    __publicField(this, "_equals", /* @__PURE__ */ __name((a, b) => Object.is(a, b), "_equals"));
     __publicField(this, "_head");
     __publicField(this, "_tail");
     __publicField(this, "_length", 0);
@@ -2453,8 +2455,8 @@ var _DoublyLinkedList = class _DoublyLinkedList extends LinearLinkedBase {
   at(index) {
     if (index < 0 || index >= this._length) return void 0;
     let current = this.head;
-    for (let i = 0; i < index; i++) current = current.next;
-    return current.value;
+    for (let i = 0; i < index && current; i++) current = current.next;
+    return current == null ? void 0 : current.value;
   }
   /**
    * Get the node reference at a given index.
@@ -2465,7 +2467,7 @@ var _DoublyLinkedList = class _DoublyLinkedList extends LinearLinkedBase {
   getNodeAt(index) {
     if (index < 0 || index >= this._length) return void 0;
     let current = this.head;
-    for (let i = 0; i < index; i++) current = current.next;
+    for (let i = 0; i < index && current; i++) current = current.next;
     return current;
   }
   /**
@@ -2977,7 +2979,7 @@ var _Stack = class _Stack extends IterableElementBase {
    */
   constructor(elements = [], options) {
     super(options);
-    __publicField(this, "_equals", Object.is);
+    __publicField(this, "_equals", /* @__PURE__ */ __name((a, b) => Object.is(a, b), "_equals"));
     __publicField(this, "_elements", []);
     this.pushMany(elements);
   }
@@ -3612,7 +3614,7 @@ var _Deque = class _Deque extends LinearBase {
    */
   constructor(elements = [], options) {
     super(options);
-    __publicField(this, "_equals", Object.is);
+    __publicField(this, "_equals", /* @__PURE__ */ __name((a, b) => Object.is(a, b), "_equals"));
     __publicField(this, "_bucketSize", 1 << 12);
     __publicField(this, "_bucketFirst", 0);
     __publicField(this, "_firstInBucket", 0);
@@ -4684,11 +4686,6 @@ var _Heap = class _Heap extends IterableElementBase {
     }
     return out;
   }
-  /**
-  * Get the comparator used to order elements.
-  * @remarks Time O(1), Space O(1)
-  * @returns Comparator function.
-  */
   /**
    * Get the comparator used to order elements.
    * @remarks Time O(1), Space O(1)
@@ -4737,8 +4734,7 @@ var _Heap = class _Heap extends IterableElementBase {
    */
   _createInstance(options) {
     const Ctor = this.constructor;
-    const next = new Ctor([], { comparator: this.comparator, toElementFn: this.toElementFn, ...options != null ? options : {} });
-    return next;
+    return new Ctor([], { comparator: this.comparator, toElementFn: this.toElementFn, ...options != null ? options : {} });
   }
   /**
    * (Protected) Create a like-kind instance seeded by elements.
@@ -5784,8 +5780,8 @@ var _AbstractGraph = class _AbstractGraph extends IterableEntryBase {
     const Ctor = this.constructor;
     const instance = new Ctor();
     const graph = _options == null ? void 0 : _options.graph;
-    if (graph) instance._options = { ...instance._options, ...graph };
-    else instance._options = { ...instance._options, ...this._options };
+    if (graph) instance["_options"] = { ...instance["_options"], ...graph };
+    else instance["_options"] = { ...instance["_options"], ...this._options };
     return instance;
   }
   /**
@@ -5818,12 +5814,10 @@ var _AbstractGraph = class _AbstractGraph extends IterableEntryBase {
       const [va, vb] = ends;
       const ka = va.key;
       const kb = vb.key;
-      const hasA = g.hasVertex ? g.hasVertex(ka) : false;
-      const hasB = g.hasVertex ? g.hasVertex(kb) : false;
+      const hasA = typeof g.hasVertex === "function" ? g.hasVertex(ka) : false;
+      const hasB = typeof g.hasVertex === "function" ? g.hasVertex(kb) : false;
       if (hasA && hasB) {
-        const w = e.weight;
-        const val = e.value;
-        const newEdge = g.createEdge(ka, kb, w, val);
+        const newEdge = g.createEdge(ka, kb, e.weight, e.value);
         g._addEdge(newEdge);
       }
     }
@@ -7015,7 +7009,7 @@ var _BinaryTree = class _BinaryTree extends IterableEntryBase {
      * @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"));
+    __publicField(this, "_DEFAULT_NODE_CALLBACK", /* @__PURE__ */ __name((node) => node == null ? void 0 : node.key, "_DEFAULT_NODE_CALLBACK"));
     if (options) {
       const { iterationType, toEntryFn, isMapMode, isDuplicate } = options;
       if (iterationType) this.iterationType = iterationType;
@@ -13235,7 +13229,7 @@ var _TreeMultiSet = class _TreeMultiSet {
    * @remarks Time O(1), Space O(1)
    */
   get comparator() {
-    return __privateGet(this, _core4)._comparator;
+    return __privateGet(this, _core4).comparator;
   }
   // ━━━ clear ━━━
   /**
@@ -13372,7 +13366,7 @@ var _TreeMultiSet = class _TreeMultiSet {
   filter(predicate) {
     const result = new _TreeMultiSet([], {
       comparator: __privateGet(this, _isDefaultComparator4) ? void 0 : this.comparator,
-      isMapMode: __privateGet(this, _core4)._isMapMode
+      isMapMode: __privateGet(this, _core4).isMapMode
     });
     for (const [k, c] of this.entries()) {
       if (predicate(k, c)) {
@@ -13412,7 +13406,7 @@ var _TreeMultiSet = class _TreeMultiSet {
   map(mapper, options) {
     const result = new _TreeMultiSet([], {
       comparator: options == null ? void 0 : options.comparator,
-      isMapMode: __privateGet(this, _core4)._isMapMode
+      isMapMode: __privateGet(this, _core4).isMapMode
     });
     for (const [k, c] of this.entries()) {
       const [newKey, newCount] = mapper(k, c);
@@ -13432,7 +13426,7 @@ var _TreeMultiSet = class _TreeMultiSet {
   clone() {
     const result = new _TreeMultiSet([], {
       comparator: __privateGet(this, _isDefaultComparator4) ? void 0 : this.comparator,
-      isMapMode: __privateGet(this, _core4)._isMapMode
+      isMapMode: __privateGet(this, _core4).isMapMode
     });
     for (const [k, c] of this.entries()) {
       result.add(k, c);
@@ -14480,12 +14474,11 @@ var _Trie = class _Trie extends IterableElementBase {
    */
   _createInstance(options) {
     const Ctor = this.constructor;
-    const next = new Ctor([], {
+    return new Ctor([], {
       toElementFn: this.toElementFn,
       caseSensitive: this.caseSensitive,
       ...options != null ? options : {}
     });
-    return next;
   }
   /**
    * (Protected) Create a like-kind trie and seed it from an iterable.

package/dist/types/data-structures/base/iterable-element-base.d.ts

@@ -27,7 +27,7 @@ export declare abstract class IterableElementBase<E, R> implements Iterable<E> {
      * @remarks
      * Time O(1), Space O(1).
      */
-    protected _toElementFn?: (rawElement: R) => E;
+    protected readonly _toElementFn?: (rawElement: R) => E;
     /**
      * Exposes the current `toElementFn`, if configured.
      *

package/dist/types/data-structures/binary-tree/binary-tree.d.ts

@@ -275,7 +275,7 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      * @param [options] - Configuration options for the tree.
      */
     constructor(keysNodesEntriesOrRaws?: Iterable<K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined | R>, options?: BinaryTreeOptions<K, V, R>);
-    protected _isMapMode: boolean;
+    protected readonly _isMapMode: boolean;
     /**
      * 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)
@@ -283,7 +283,7 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      * @returns True if in Map mode, false otherwise.
      */
     get isMapMode(): boolean;
-    protected _isDuplicate: boolean;
+    protected readonly _isDuplicate: boolean;
     /**
      * Gets whether the tree allows duplicate keys.
      * @remarks Time O(1)
@@ -315,7 +315,7 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      * @returns The size of the tree.
      */
     get size(): number;
-    protected _NIL: BinaryTreeNode<K, V>;
+    protected readonly _NIL: BinaryTreeNode<K, V>;
     /**
      * Gets the sentinel NIL node (used in self-balancing trees like Red-Black Tree).
      * @remarks Time O(1)
@@ -323,7 +323,7 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      * @returns The NIL node.
      */
     get NIL(): BinaryTreeNode<K, V>;
-    protected _toEntryFn?: ToEntryFn<K, V, R>;
+    protected readonly _toEntryFn?: ToEntryFn<K, V, R>;
     /**
      * Gets the function used to convert raw data objects (R) into [key, value] entries.
      * @remarks Time O(1)
@@ -682,7 +682,7 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      * @param node - The node.
      * @returns The node's key or undefined.
      */
-    protected _DEFAULT_NODE_CALLBACK: (node: BinaryTreeNode<K, V> | null | undefined) => K | undefined;
+    protected readonly _DEFAULT_NODE_CALLBACK: NodeCallback<BinaryTreeNode<K, V> | null | undefined, K | undefined>;
     /**
      * (Protected) Snapshots the current tree's configuration options.
      * @remarks Time O(1)

package/dist/types/data-structures/binary-tree/bst.d.ts

@@ -294,7 +294,7 @@ export declare class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R>
   
      * @remarks Time O(1) Space O(1)
      */
-    protected _comparator: Comparator<K>;
+    protected readonly _comparator: Comparator<K>;
     /**
      * Gets the comparator function used by the tree.
      * @remarks Time O(1)

package/dist/types/data-structures/graph/directed-graph.d.ts

@@ -170,7 +170,7 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      * @returns DirectedGraph with all keys added.
      * @remarks Time O(V), Space O(V)
      */
-    static fromKeys<K extends VertexKey>(keys: Iterable<K>): DirectedGraph<K, any, DirectedVertex<K>, DirectedEdge<any>>;
+    static fromKeys<K extends VertexKey>(keys: Iterable<K>): DirectedGraph<K, undefined, DirectedVertex<K>, DirectedEdge<undefined>>;
     /**
      * Construct a directed graph from `[key, value]` entries.
      * @template V - Vertex value type.
@@ -178,7 +178,7 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      * @returns DirectedGraph with all vertices added.
      * @remarks Time O(V), Space O(V)
      */
-    static fromEntries<V>(entries: Iterable<[VertexKey, V]>): DirectedGraph<V, any, DirectedVertex<V>, DirectedEdge<any>>;
+    static fromEntries<V>(entries: Iterable<[VertexKey, V]>): DirectedGraph<V, undefined, DirectedVertex<V>, DirectedEdge<undefined>>;
     /**
      * Create a directed vertex instance. Does not insert into the graph.
      * @param key - Vertex identifier.

package/dist/types/data-structures/graph/undirected-graph.d.ts

@@ -200,7 +200,7 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      * @returns UndirectedGraph with all keys added.
      * @remarks Time O(V), Space O(V)
      */
-    static fromKeys<K extends VertexKey>(keys: Iterable<K>): UndirectedGraph<K, any, UndirectedVertex<K>, UndirectedEdge<any>>;
+    static fromKeys<K extends VertexKey>(keys: Iterable<K>): UndirectedGraph<K, undefined, UndirectedVertex<K>, UndirectedEdge<undefined>>;
     /**
      * Construct an undirected graph from `[key, value]` entries.
      * @template V - Vertex value type.
@@ -208,7 +208,7 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      * @returns UndirectedGraph with all vertices added.
      * @remarks Time O(V), Space O(V)
      */
-    static fromEntries<V>(entries: Iterable<[VertexKey, V]>): UndirectedGraph<V, any, UndirectedVertex<V>, UndirectedEdge<any>>;
+    static fromEntries<V>(entries: Iterable<[VertexKey, V]>): UndirectedGraph<V, undefined, UndirectedVertex<V>, UndirectedEdge<undefined>>;
     /**
      * Create an undirected vertex instance. Does not insert into the graph.
      * @param key - Vertex identifier.

package/dist/types/data-structures/hash/hash-map.d.ts

@@ -175,7 +175,7 @@ export declare class HashMap<K = any, V = any, R = [K, V]> extends IterableEntry
      * @returns Map of object→value.
      */
     get objMap(): Map<object, V>;
-    protected _toEntryFn?: (rawElement: R) => [K, V];
+    protected readonly _toEntryFn?: (rawElement: R) => [K, V];
     /**
      * Get the raw→entry converter function if present.
      * @remarks Time O(1), Space O(1)
@@ -346,7 +346,7 @@ export declare class LinkedHashMap<K = any, V = any, R = [K, V]> extends Iterabl
      * @returns Tail node or sentinel.
      */
     get tail(): HashMapLinkedNode<K, V | undefined>;
-    protected _toEntryFn?: (rawElement: R) => [K, V];
+    protected readonly _toEntryFn?: (rawElement: R) => [K, V];
     get toEntryFn(): ((rawElement: R) => [K, V]) | undefined;
     protected _size: number;
     get size(): number;

package/dist/types/data-structures/heap/heap.d.ts

@@ -414,12 +414,8 @@ export declare class Heap<E = any, R = any> extends IterableElementBase<E, R> {
      * @returns A new heap with mapped elements.
      */
     mapSame(callback: ElementCallback<E, R, E>, thisArg?: unknown): this;
-    protected _DEFAULT_COMPARATOR: (a: E, b: E) => number;
-    protected _comparator: Comparator<E>; /**
-     * Get the comparator used to order elements.
-     * @remarks Time O(1), Space O(1)
-     * @returns Comparator function.
-     */
+    protected readonly _DEFAULT_COMPARATOR: Comparator<E>;
+    protected readonly _comparator: Comparator<E>;
     /**
      * Get the comparator used to order elements.
      * @remarks Time O(1), Space O(1)
@@ -501,7 +497,7 @@ export declare class FibonacciHeap<E> {
      * @returns Min node or undefined.
      */
     get min(): FibonacciHeapNode<E> | undefined;
-    protected _comparator: Comparator<E>;
+    protected readonly _comparator: Comparator<E>;
     get comparator(): Comparator<E>;
     clear(): void;
     add(element: E): boolean;

package/dist/types/types/data-structures/binary-tree/avl-tree.d.ts

@@ -1,2 +1,2 @@
 import { BSTOptions } from './bst';
-export type AVLTreeOptions<K, V, R> = BSTOptions<K, V, R> & {};
+export type AVLTreeOptions<K, V, R> = BSTOptions<K, V, R>;

package/dist/types/types/data-structures/binary-tree/red-black-tree.d.ts

@@ -1,3 +1,3 @@
 import type { BSTOptions } from './bst';
 export type RBTNColor = 'RED' | 'BLACK';
-export type RedBlackTreeOptions<K, V, R> = BSTOptions<K, V, R> & {};
+export type RedBlackTreeOptions<K, V, R> = BSTOptions<K, V, R>;

package/dist/types/types/data-structures/linked-list/doubly-linked-list.d.ts

@@ -1,2 +1,2 @@
 import { LinearBaseOptions } from '../base';
-export type DoublyLinkedListOptions<E, R> = LinearBaseOptions<E, R> & {};
+export type DoublyLinkedListOptions<E, R> = LinearBaseOptions<E, R>;

package/dist/types/types/data-structures/linked-list/singly-linked-list.d.ts

@@ -1,2 +1,2 @@
 import { LinearBaseOptions } from '../base';
-export type SinglyLinkedListOptions<E, R> = LinearBaseOptions<E, R> & {};
+export type SinglyLinkedListOptions<E, R> = LinearBaseOptions<E, R>;

package/dist/types/types/data-structures/priority-queue/priority-queue.d.ts

@@ -1,2 +1,2 @@
 import { HeapOptions } from '../heap';
-export type PriorityQueueOptions<E, R> = HeapOptions<E, R> & {};
+export type PriorityQueueOptions<E, R> = HeapOptions<E, R>;

package/dist/types/types/data-structures/stack/stack.d.ts

@@ -1,2 +1,2 @@
 import { IterableElementBaseOptions } from '../base';
-export type StackOptions<E, R> = IterableElementBaseOptions<E, R> & {};
+export type StackOptions<E, R> = IterableElementBaseOptions<E, R>;