heap-typed 1.52.3 → 1.52.5

package/dist/data-structures/graph/undirected-graph.js

@@ -72,10 +72,6 @@ class UndirectedGraph extends abstract_graph_1.AbstractGraph {
     createEdge(v1, v2, weight, value) {
         return new UndirectedEdge(v1, v2, weight !== null && weight !== void 0 ? weight : 1, value);
     }
-    /**
-     * Time Complexity: O(|E|), where |E| is the number of edgeMap incident to the given vertex.
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(|E|), where |E| is the number of edgeMap incident to the given vertex.
      * Space Complexity: O(1)
@@ -99,10 +95,6 @@ class UndirectedGraph extends abstract_graph_1.AbstractGraph {
         }
         return edgeMap ? edgeMap[0] || undefined : undefined;
     }
-    /**
-     * Time Complexity: O(|E|), where |E| is the number of edgeMap incident to the given vertex.
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(|E|), where |E| is the number of edgeMap incident to the given vertex.
      * Space Complexity: O(1)
@@ -130,10 +122,6 @@ class UndirectedGraph extends abstract_graph_1.AbstractGraph {
         }
         return removed;
     }
-    /**
-     * Time Complexity: O(E), where E is the number of edgeMap incident to the given vertex.
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(E), where E is the number of edgeMap incident to the given vertex.
      * Space Complexity: O(1)
@@ -169,10 +157,6 @@ class UndirectedGraph extends abstract_graph_1.AbstractGraph {
             return;
         }
     }
-    /**
-     * Time Complexity: O(1) - Constant time for Map operations.
-     * Space Complexity: O(1) - Constant space, as it creates only a few variables.
-     */
     /**
      * Time Complexity: O(1) - Constant time for Map operations.
      * Space Complexity: O(1) - Constant space, as it creates only a few variables.
@@ -208,10 +192,6 @@ class UndirectedGraph extends abstract_graph_1.AbstractGraph {
         }
         return this._vertexMap.delete(vertexKey);
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -232,10 +212,6 @@ class UndirectedGraph extends abstract_graph_1.AbstractGraph {
             return 0;
         }
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -254,10 +230,6 @@ class UndirectedGraph extends abstract_graph_1.AbstractGraph {
             return [];
         }
     }
-    /**
-     * Time Complexity: O(|V| + |E|), where |V| is the number of vertexMap and |E| is the number of edgeMap.
-     * Space Complexity: O(|E|)
-     */
     /**
      * Time Complexity: O(|V| + |E|), where |V| is the number of vertexMap and |E| is the number of edgeMap.
      * Space Complexity: O(|E|)
@@ -274,10 +246,6 @@ class UndirectedGraph extends abstract_graph_1.AbstractGraph {
         });
         return [...edgeSet];
     }
-    /**
-     * Time Complexity: O(|V| + |E|), where |V| is the number of vertexMap and |E| is the number of edgeMap.
-     * Space Complexity: O(|E|)
-     */
     /**
      * Time Complexity: O(|V| + |E|), where |V| is the number of vertexMap and |E| is the number of edgeMap.
      * Space Complexity: O(|E|)
@@ -301,10 +269,6 @@ class UndirectedGraph extends abstract_graph_1.AbstractGraph {
         }
         return neighbors;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -335,10 +299,6 @@ class UndirectedGraph extends abstract_graph_1.AbstractGraph {
     isEmpty() {
         return this.vertexMap.size === 0 && this.edgeMap.size === 0;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -364,10 +324,6 @@ class UndirectedGraph extends abstract_graph_1.AbstractGraph {
         cloned.edgeMap = new Map(this.edgeMap);
         return cloned;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      *  Time Complexity: O(V + E)
      *  Space Complexity: O(V)
@@ -428,12 +384,6 @@ class UndirectedGraph extends abstract_graph_1.AbstractGraph {
             cutVertices
         };
     }
-    /**
-     *  Time Complexity: O(V + E)
-     *  Space Complexity: O(V)
-     *  Tarjan is an algorithm based on dfs,which is used to solve the connectivity problem of graphs.
-     *  1. Tarjan can find the articulation points and bridges(critical edgeMap) of undirected graphs in linear time
-     */
     /**
      * The function "getBridges" returns an array of bridges in a graph using the Tarjan's algorithm.
      * @returns The function `getBridges()` is returning the bridges found using the Tarjan's algorithm.

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

@@ -123,8 +123,7 @@ export declare class HashMap<K = any, V = any, R = [K, V]> extends IterableEntry
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
-     */
-    /**
+     *
      * The clone function creates a new HashMap with the same key-value pairs as
      * this one. The clone function is useful for creating a copy of an existing
      * HashMap, and then modifying that copy without affecting the original.
@@ -132,10 +131,6 @@ export declare class HashMap<K = any, V = any, R = [K, V]> extends IterableEntry
      * @return A new hashmap with the same values as this one
      */
     clone(): HashMap<K, V, R>;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -168,15 +163,6 @@ export declare class HashMap<K = any, V = any, R = [K, V]> extends IterableEntry
      * from the original `HashMap` that pass the provided `predicate` function.
      */
     filter(predicate: EntryCallback<K, V, boolean>, thisArg?: any): HashMap<K, V>;
-    /**
-     * The put function sets a value in a data structure using a specified key.
-     * @param {K} key - The key parameter is of type K, which represents the type of the key being passed
-     * to the function.
-     * @param {V} value - The value parameter represents the value that you want to associate with the
-     * specified key in the data structure.
-     * @returns The method is returning a boolean value.
-     */
-    put(key: K, value: V): boolean;
     /**
      * The function returns an iterator that yields key-value pairs from both an object store and an
      * object map.
@@ -213,7 +199,7 @@ export declare class LinkedHashMap<K = any, V = any, R = [K, V]> extends Iterabl
      * @param [options] - The `options` parameter is an optional object that can contain the following
      * properties:
      */
-    constructor(entryOrRawElements?: Iterable<R>, options?: LinkedHashMapOptions<K, V, R>);
+    constructor(entryOrRawElements?: Iterable<R | [K, V]>, options?: LinkedHashMapOptions<K, V, R>);
     protected _hashFn: (key: K) => string;
     /**
      * The function returns the hash function used for generating a hash value for a given key.
@@ -253,22 +239,18 @@ export declare class LinkedHashMap<K = any, V = any, R = [K, V]> extends Iterabl
      * @returns The `_tail` property of type `HashMapLinkedNode<K, V | undefined>` is being returned.
      */
     get tail(): HashMapLinkedNode<K, V | undefined>;
-    protected _toEntryFn: (rawElement: R) => [K, V];
+    protected _toEntryFn?: (rawElement: R) => [K, V];
     /**
      * The function returns the value of the _toEntryFn property.
      * @returns The function being returned is `this._toEntryFn`.
      */
-    get toEntryFn(): (rawElement: R) => [K, V];
+    get toEntryFn(): ((rawElement: R) => [K, V]) | undefined;
     protected _size: number;
     /**
      * The function returns the size of an object.
      * @returns The size of the object.
      */
     get size(): number;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -278,10 +260,6 @@ export declare class LinkedHashMap<K = any, V = any, R = [K, V]> extends Iterabl
      * value (V).
      */
     get first(): [K, V] | undefined;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -300,10 +278,6 @@ export declare class LinkedHashMap<K = any, V = any, R = [K, V]> extends Iterabl
      * key and value.
      */
     reverseBegin(): Generator<(K | V | undefined)[], void, unknown>;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -325,7 +299,7 @@ export declare class LinkedHashMap<K = any, V = any, R = [K, V]> extends Iterabl
      * R.
      * @returns The `setMany` function returns an array of booleans.
      */
-    setMany(entryOrRawElements: Iterable<R>): boolean[];
+    setMany(entryOrRawElements: Iterable<R | [K, V]>): boolean[];
     /**
      * The function checks if a given key exists in a map, using different logic depending on whether the
      * key is a weak key or not.
@@ -333,10 +307,6 @@ export declare class LinkedHashMap<K = any, V = any, R = [K, V]> extends Iterabl
      * @returns The method `has` is returning a boolean value.
      */
     has(key: K): boolean;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -351,10 +321,6 @@ export declare class LinkedHashMap<K = any, V = any, R = [K, V]> extends Iterabl
      * using the key itself. If the key is not found, `undefined` is
      */
     get(key: K): V | undefined;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -367,10 +333,6 @@ export declare class LinkedHashMap<K = any, V = any, R = [K, V]> extends Iterabl
      * where `K` is the key and `V` is the value.
      */
     at(index: number): V | undefined;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -382,10 +344,6 @@ export declare class LinkedHashMap<K = any, V = any, R = [K, V]> extends Iterabl
      * was not found.
      */
     delete(key: K): boolean;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -396,10 +354,6 @@ export declare class LinkedHashMap<K = any, V = any, R = [K, V]> extends Iterabl
      * @returns The size of the list after deleting the element at the specified index.
      */
     deleteAt(index: number): boolean;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -416,10 +370,6 @@ export declare class LinkedHashMap<K = any, V = any, R = [K, V]> extends Iterabl
      * @returns a boolean value.
      */
     isEntry(rawElement: any): rawElement is [K, V];
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -427,10 +377,6 @@ export declare class LinkedHashMap<K = any, V = any, R = [K, V]> extends Iterabl
      * The `clear` function clears all the entries in a data structure and resets its properties.
      */
     clear(): void;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -441,10 +387,6 @@ export declare class LinkedHashMap<K = any, V = any, R = [K, V]> extends Iterabl
      * of the original `LinkedHashMap` object.
      */
     clone(): LinkedHashMap<K, V>;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -461,10 +403,6 @@ export declare class LinkedHashMap<K = any, V = any, R = [K, V]> extends Iterabl
      * `LinkedHashMap` object that satisfy the given predicate function.
      */
     filter(predicate: EntryCallback<K, V, boolean>, thisArg?: any): LinkedHashMap<K, V>;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -483,27 +421,6 @@ export declare class LinkedHashMap<K = any, V = any, R = [K, V]> extends Iterabl
      * function.
      */
     map<VM>(callback: EntryCallback<K, V, VM>, thisArg?: any): LinkedHashMap<K, VM>;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The put function sets a value in a data structure using a specified key.
-     * @param {K} key - The key parameter is of type K, which represents the type of the key being passed
-     * to the function.
-     * @param {V} value - The value parameter represents the value that you want to associate with the
-     * specified key in the data structure.
-     * @returns The method is returning a boolean value.
-     */
-    put(key: K, value: V): boolean;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     * where n is the number of entries in the LinkedHashMap.
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -512,10 +429,6 @@ export declare class LinkedHashMap<K = any, V = any, R = [K, V]> extends Iterabl
      * The above function is an iterator that yields key-value pairs from a linked list.
      */
     protected _getIterator(): Generator<[K, V], void, unknown>;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)

package/dist/data-structures/hash/hash-map.js

@@ -26,12 +26,10 @@ class HashMap extends base_1.IterableEntryBase {
         this._hashFn = (key) => String(key);
         if (options) {
             const { hashFn, toEntryFn } = options;
-            if (hashFn) {
+            if (hashFn)
                 this._hashFn = hashFn;
-            }
-            if (toEntryFn) {
+            if (toEntryFn)
                 this._toEntryFn = toEntryFn;
-            }
         }
         if (entryOrRawElements) {
             this.setMany(entryOrRawElements);
@@ -141,8 +139,8 @@ class HashMap extends base_1.IterableEntryBase {
                 key = rawEle[0];
                 value = rawEle[1];
             }
-            else if (this.toEntryFn) {
-                const item = this.toEntryFn(rawEle);
+            else if (this._toEntryFn) {
+                const item = this._toEntryFn(rawEle);
                 key = item[0];
                 value = item[1];
             }
@@ -211,8 +209,7 @@ class HashMap extends base_1.IterableEntryBase {
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
-     */
-    /**
+     *
      * The clone function creates a new HashMap with the same key-value pairs as
      * this one. The clone function is useful for creating a copy of an existing
      * HashMap, and then modifying that copy without affecting the original.
@@ -220,12 +217,8 @@ class HashMap extends base_1.IterableEntryBase {
      * @return A new hashmap with the same values as this one
      */
     clone() {
-        return new HashMap(this, { hashFn: this.hashFn, toEntryFn: this.toEntryFn });
+        return new HashMap(this, { hashFn: this._hashFn, toEntryFn: this._toEntryFn });
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -274,17 +267,6 @@ class HashMap extends base_1.IterableEntryBase {
         }
         return filteredMap;
     }
-    /**
-     * The put function sets a value in a data structure using a specified key.
-     * @param {K} key - The key parameter is of type K, which represents the type of the key being passed
-     * to the function.
-     * @param {V} value - The value parameter represents the value that you want to associate with the
-     * specified key in the data structure.
-     * @returns The method is returning a boolean value.
-     */
-    put(key, value) {
-        return this.set(key, value);
-    }
     /**
      * The function returns an iterator that yields key-value pairs from both an object store and an
      * object map.
@@ -317,7 +299,7 @@ class HashMap extends base_1.IterableEntryBase {
         const keyType = typeof key;
         let strKey;
         if (keyType !== 'string' && keyType !== 'number' && keyType !== 'symbol') {
-            strKey = this.hashFn(key);
+            strKey = this._hashFn(key);
         }
         else {
             if (keyType === 'number') {
@@ -376,10 +358,7 @@ class LinkedHashMap extends base_1.IterableEntryBase {
             }
         }
         if (entryOrRawElements) {
-            for (const el of entryOrRawElements) {
-                const [key, value] = this.toEntryFn(el);
-                this.set(key, value);
-            }
+            this.setMany(entryOrRawElements);
         }
     }
     /**
@@ -441,10 +420,6 @@ class LinkedHashMap extends base_1.IterableEntryBase {
     get size() {
         return this._size;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -458,10 +433,6 @@ class LinkedHashMap extends base_1.IterableEntryBase {
             return;
         return [this.head.key, this.head.value];
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -496,10 +467,6 @@ class LinkedHashMap extends base_1.IterableEntryBase {
             node = node.prev;
         }
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -516,7 +483,7 @@ class LinkedHashMap extends base_1.IterableEntryBase {
         let node;
         const isNewKey = !this.has(key); // Check if the key is new
         if ((0, utils_1.isWeakKey)(key)) {
-            const hash = this.objHashFn(key);
+            const hash = this._objHashFn(key);
             node = this.objMap.get(hash);
             if (!node && isNewKey) {
                 // Create a new node
@@ -529,7 +496,7 @@ class LinkedHashMap extends base_1.IterableEntryBase {
             }
         }
         else {
-            const hash = this.hashFn(key);
+            const hash = this._hashFn(key);
             node = this.noObjMap[hash];
             if (!node && isNewKey) {
                 this.noObjMap[hash] = node = { key, value, prev: this.tail, next: this._sentinel };
@@ -566,8 +533,18 @@ class LinkedHashMap extends base_1.IterableEntryBase {
     setMany(entryOrRawElements) {
         const results = [];
         for (const rawEle of entryOrRawElements) {
-            const [key, value] = this.toEntryFn(rawEle);
-            results.push(this.set(key, value));
+            let key, value;
+            if (this.isEntry(rawEle)) {
+                key = rawEle[0];
+                value = rawEle[1];
+            }
+            else if (this._toEntryFn) {
+                const item = this._toEntryFn(rawEle);
+                key = item[0];
+                value = item[1];
+            }
+            if (key !== undefined && value !== undefined)
+                results.push(this.set(key, value));
         }
         return results;
     }
@@ -579,18 +556,14 @@ class LinkedHashMap extends base_1.IterableEntryBase {
      */
     has(key) {
         if ((0, utils_1.isWeakKey)(key)) {
-            const hash = this.objHashFn(key);
+            const hash = this._objHashFn(key);
             return this.objMap.has(hash);
         }
         else {
-            const hash = this.hashFn(key);
+            const hash = this._hashFn(key);
             return hash in this.noObjMap;
         }
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -606,20 +579,16 @@ class LinkedHashMap extends base_1.IterableEntryBase {
      */
     get(key) {
         if ((0, utils_1.isWeakKey)(key)) {
-            const hash = this.objHashFn(key);
+            const hash = this._objHashFn(key);
             const node = this.objMap.get(hash);
             return node ? node.value : undefined;
         }
         else {
-            const hash = this.hashFn(key);
+            const hash = this._hashFn(key);
             const node = this.noObjMap[hash];
             return node ? node.value : undefined;
         }
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -639,10 +608,6 @@ class LinkedHashMap extends base_1.IterableEntryBase {
         }
         return node.value;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -656,7 +621,7 @@ class LinkedHashMap extends base_1.IterableEntryBase {
     delete(key) {
         let node;
         if ((0, utils_1.isWeakKey)(key)) {
-            const hash = this.objHashFn(key);
+            const hash = this._objHashFn(key);
             // Get nodes from WeakMap
             node = this.objMap.get(hash);
             if (!node) {
@@ -666,7 +631,7 @@ class LinkedHashMap extends base_1.IterableEntryBase {
             this.objMap.delete(hash);
         }
         else {
-            const hash = this.hashFn(key);
+            const hash = this._hashFn(key);
             // Get nodes from noObjMap
             node = this.noObjMap[hash];
             if (!node) {
@@ -679,10 +644,6 @@ class LinkedHashMap extends base_1.IterableEntryBase {
         this._deleteNode(node);
         return true;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -700,10 +661,6 @@ class LinkedHashMap extends base_1.IterableEntryBase {
         }
         return this._deleteNode(node);
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -724,10 +681,6 @@ class LinkedHashMap extends base_1.IterableEntryBase {
     isEntry(rawElement) {
         return Array.isArray(rawElement) && rawElement.length === 2;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -739,10 +692,6 @@ class LinkedHashMap extends base_1.IterableEntryBase {
         this._size = 0;
         this._head = this._tail = this._sentinel.prev = this._sentinel.next = this._sentinel;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -753,17 +702,13 @@ class LinkedHashMap extends base_1.IterableEntryBase {
      * of the original `LinkedHashMap` object.
      */
     clone() {
-        const cloned = new LinkedHashMap([], { hashFn: this.hashFn, objHashFn: this.objHashFn });
+        const cloned = new LinkedHashMap([], { hashFn: this._hashFn, objHashFn: this._objHashFn });
         for (const entry of this) {
             const [key, value] = entry;
             cloned.set(key, value);
         }
         return cloned;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -790,10 +735,6 @@ class LinkedHashMap extends base_1.IterableEntryBase {
         }
         return filteredMap;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -821,29 +762,6 @@ class LinkedHashMap extends base_1.IterableEntryBase {
         }
         return mappedMap;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The put function sets a value in a data structure using a specified key.
-     * @param {K} key - The key parameter is of type K, which represents the type of the key being passed
-     * to the function.
-     * @param {V} value - The value parameter represents the value that you want to associate with the
-     * specified key in the data structure.
-     * @returns The method is returning a boolean value.
-     */
-    put(key, value) {
-        return this.set(key, value);
-    }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     * where n is the number of entries in the LinkedHashMap.
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -858,10 +776,6 @@ class LinkedHashMap extends base_1.IterableEntryBase {
             node = node.next;
         }
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)