min-heap-typed 1.50.2 → 1.50.4

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

@@ -14,10 +14,6 @@ import { IterableEntryBase } from '../base';
  * 4. Unordered Collection: HashMap does not guarantee the order of entries, and the order may change over time.
  */
 export declare class HashMap<K = any, V = any, R = [K, V]> extends IterableEntryBase<K, V> {
-    protected _store: {
-        [key: string]: HashMapStoreItem<K, V>;
-    };
-    protected _objMap: Map<object, V>;
     /**
      * The constructor function initializes a HashMap object with an optional initial collection and
      * options.
@@ -26,25 +22,44 @@ export declare class HashMap<K = any, V = any, R = [K, V]> extends IterableEntry
      * @param [options] - The `options` parameter is an optional object that can contain two properties:
      */
     constructor(rawCollection?: Iterable<R | [K, V]>, options?: HashMapOptions<K, V, R>);
+    protected _store: {
+        [key: string]: HashMapStoreItem<K, V>;
+    };
+    /**
+     * The function returns the store object, which is a dictionary of HashMapStoreItem objects.
+     * @returns The store property is being returned. It is a dictionary-like object with string keys and
+     * values of type HashMapStoreItem<K, V>.
+     */
+    get store(): {
+        [p: string]: HashMapStoreItem<K, V>;
+    };
+    protected _objMap: Map<object, V>;
+    /**
+     * The function returns the object map.
+     * @returns The `objMap` property is being returned, which is a `Map` object with keys of type
+     * `object` and values of type `V`.
+     */
+    get objMap(): Map<object, 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];
-    /**
-     * The hasFn function is a function that takes in an item and returns a boolean
-     * indicating whether the item is contained within the hash table.
-     *
-     * @return The hash function
-     */
-    get hasFn(): (key: K) => string;
     protected _size: number;
     /**
      * The function returns the size of an object.
      * @returns The size of the object, which is a number.
      */
     get size(): number;
+    protected _hashFn: (key: K) => string;
+    /**
+     * The hasFn function is a function that takes in an item and returns a boolean
+     * indicating whether the item is contained within the hash table.
+     *
+     * @return The hash function
+     */
+    get hashFn(): (key: K) => string;
     /**
      * The function checks if a given element is an array with exactly two elements.
      * @param {any} rawElement - The `rawElement` parameter is of type `any`, which means it can be any
@@ -104,6 +119,10 @@ export declare class HashMap<K = any, V = any, R = [K, V]> extends IterableEntry
      * successfully deleted from the map, and `false` if the key was not found in the map.
      */
     delete(key: K): boolean;
+    /**
+     * 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
@@ -131,10 +150,6 @@ export declare class HashMap<K = any, V = any, R = [K, V]> extends IterableEntry
      * the provided callback function.
      */
     map<U>(callbackfn: EntryCallback<K, V, U>, thisArg?: any): HashMap<K, U>;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -166,8 +181,19 @@ export declare class HashMap<K = any, V = any, R = [K, V]> extends IterableEntry
      * object map.
      */
     protected _getIterator(): IterableIterator<[K, V]>;
-    protected _hashFn: (key: K) => string;
+    /**
+     * The function checks if a given key is an object or a function.
+     * @param {any} key - The parameter "key" can be of any type.
+     * @returns a boolean value.
+     */
     protected _isObjKey(key: any): key is object | ((...args: any[]) => any);
+    /**
+     * The function `_getNoObjKey` takes a key and returns a string representation of the key, handling
+     * different types of keys.
+     * @param {K} key - The `key` parameter is of type `K`, which represents the type of the key being
+     * passed to the `_getNoObjKey` function.
+     * @returns a string value.
+     */
     protected _getNoObjKey(key: K): string;
 }
 /**
@@ -176,10 +202,6 @@ export declare class HashMap<K = any, V = any, R = [K, V]> extends IterableEntry
  * 3. Time Complexity: Similar to HashMap, LinkedHashMap offers constant-time performance for get and put operations in most cases.
  */
 export declare class LinkedHashMap<K = any, V = any, R = [K, V]> extends IterableEntryBase<K, V> {
-    protected _noObjMap: Record<string, HashMapLinkedNode<K, V | undefined>>;
-    protected _objMap: WeakMap<object, HashMapLinkedNode<K, V | undefined>>;
-    protected _head: HashMapLinkedNode<K, V | undefined>;
-    protected _tail: HashMapLinkedNode<K, V | undefined>;
     protected readonly _sentinel: HashMapLinkedNode<K, V | undefined>;
     /**
      * The constructor initializes a LinkedHashMap object with an optional raw collection and options.
@@ -191,6 +213,45 @@ export declare class LinkedHashMap<K = any, V = any, R = [K, V]> extends Iterabl
      * properties:
      */
     constructor(rawCollection?: Iterable<R>, 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.
+     * @returns The hash function that takes a key of type K and returns a string.
+     */
+    get hashFn(): (key: K) => string;
+    protected _objHashFn: (key: K) => object;
+    /**
+     * The function returns the object hash function.
+     * @returns The function `objHashFn` is being returned.
+     */
+    get objHashFn(): (key: K) => object;
+    protected _noObjMap: Record<string, HashMapLinkedNode<K, V | undefined>>;
+    /**
+     * The function returns a record of HashMapLinkedNode objects with string keys.
+     * @returns The method is returning a Record object, which is a TypeScript type that represents an
+     * object with string keys and values that are HashMapLinkedNode objects with keys of type K and
+     * values of type V or undefined.
+     */
+    get noObjMap(): Record<string, HashMapLinkedNode<K, V | undefined>>;
+    protected _objMap: WeakMap<object, HashMapLinkedNode<K, V | undefined>>;
+    /**
+     * The function returns the WeakMap object used to map objects to HashMapLinkedNode instances.
+     * @returns The `objMap` property is being returned.
+     */
+    get objMap(): WeakMap<object, HashMapLinkedNode<K, V | undefined>>;
+    protected _head: HashMapLinkedNode<K, V | undefined>;
+    /**
+     * The function returns the head node of a HashMapLinkedNode.
+     * @returns The method `getHead()` is returning a `HashMapLinkedNode` object with key type `K` and
+     * value type `V | undefined`.
+     */
+    get head(): HashMapLinkedNode<K, V | undefined>;
+    protected _tail: HashMapLinkedNode<K, V | undefined>;
+    /**
+     * The function returns the tail node of a HashMapLinkedNode.
+     * @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];
     /**
      * The function returns the value of the _toEntryFn property.
@@ -203,6 +264,10 @@ export declare class LinkedHashMap<K = any, V = any, R = [K, V]> extends Iterabl
      * @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)
@@ -212,6 +277,10 @@ 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)
@@ -230,6 +299,10 @@ 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)
@@ -259,6 +332,10 @@ 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)
@@ -274,7 +351,12 @@ export declare class LinkedHashMap<K = any, V = any, R = [K, V]> extends Iterabl
      */
     get(key: K): V | undefined;
     /**
-     * Time Complexity: O(n), where n is the index.
+     * Time Complexity: O(n)
+     * Space Complexity: O(1)
+     * /
+  
+     /**
+     * Time Complexity: O(n)
      * Space Complexity: O(1)
      *
      * The function `at` retrieves the key-value pair at a specified index in a linked list.
@@ -286,6 +368,11 @@ export declare class LinkedHashMap<K = any, V = any, R = [K, V]> extends Iterabl
      */
     at(index: number): V | undefined;
     /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     * /
+  
+     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
      *
@@ -297,6 +384,11 @@ export declare class LinkedHashMap<K = any, V = any, R = [K, V]> extends Iterabl
      */
     delete(key: K): boolean;
     /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(1)
+     * /
+  
+     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
      *
@@ -307,6 +399,11 @@ export declare class LinkedHashMap<K = any, V = any, R = [K, V]> extends Iterabl
      */
     deleteAt(index: number): boolean;
     /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     * /
+  
+     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
      *
@@ -323,6 +420,11 @@ export declare class LinkedHashMap<K = any, V = any, R = [K, V]> extends Iterabl
      */
     isEntry(rawElement: any): rawElement is [K, V];
     /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     * /
+  
+     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
      *
@@ -344,6 +446,11 @@ export declare class LinkedHashMap<K = any, V = any, R = [K, V]> extends Iterabl
      */
     clone(): LinkedHashMap<K, V>;
     /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(n)
+     * /
+  
+     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
      *
@@ -360,6 +467,11 @@ export declare class LinkedHashMap<K = any, V = any, R = [K, V]> extends Iterabl
      */
     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)
      *
@@ -393,9 +505,13 @@ export declare class LinkedHashMap<K = any, V = any, R = [K, V]> extends Iterabl
      * @returns The method is returning a boolean value.
      */
     put(key: K, value: V): boolean;
-    protected _hashFn: (key: K) => string;
-    protected _objHashFn: (key: K) => object;
     /**
+     * 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)
      * where n is the number of entries in the LinkedHashMap.
@@ -403,6 +519,10 @@ 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)