queue-typed 1.47.6 → 1.47.8

package/dist/data-structures/linked-list/singly-linked-list.js

@@ -10,13 +10,13 @@ exports.SinglyLinkedList = exports.SinglyLinkedListNode = void 0;
  */
 class SinglyLinkedListNode {
     /**
-     * The constructor function initializes an instance of a class with a given value and sets the next property to null.
+     * The constructor function initializes an instance of a class with a given value and sets the next property to undefined.
      * @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) {
         this.value = value;
-        this.next = null;
+        this.next = undefined;
     }
 }
 exports.SinglyLinkedListNode = SinglyLinkedListNode;
@@ -25,8 +25,8 @@ class SinglyLinkedList {
      * The constructor initializes the linked list with an empty head, tail, and length.
      */
     constructor(elements) {
-        this._head = null;
-        this._tail = null;
+        this._head = undefined;
+        this._tail = undefined;
         this._length = 0;
         if (elements) {
             for (const el of elements)
@@ -112,15 +112,15 @@ class SinglyLinkedList {
      * The `pop()` function removes and returns the value of the last element in a linked list, updating the head and tail
      * pointers accordingly.
      * @returns The method `pop()` returns the value of the node that is being removed from the end of the linked list. If
-     * the linked list is empty, it returns `null`.
+     * the linked list is empty, it returns `undefined`.
      */
     pop() {
         if (!this.head)
             return undefined;
         if (this.head === this.tail) {
             const value = this.head.value;
-            this._head = null;
-            this._tail = null;
+            this._head = undefined;
+            this._tail = undefined;
             this._length--;
             return value;
         }
@@ -129,7 +129,7 @@ class SinglyLinkedList {
             current = current.next;
         }
         const value = this.tail.value;
-        current.next = null;
+        current.next = undefined;
         this._tail = current;
         this._length--;
         return value;
@@ -145,7 +145,7 @@ class SinglyLinkedList {
      * The `popLast()` function removes and returns the value of the last element in a linked list, updating the head and tail
      * pointers accordingly.
      * @returns The method `pop()` returns the value of the node that is being removed from the end of the linked list. If
-     * the linked list is empty, it returns `null`.
+     * the linked list is empty, it returns `undefined`.
      */
     popLast() {
         return this.pop();
@@ -230,11 +230,11 @@ class SinglyLinkedList {
      * Time Complexity: O(n) - Linear time, where n is the index, as it may need to traverse the list to find the desired node.
      * Space Complexity: O(1) - Constant space.
      *
-     * The function `getAt` returns the value at a specified index in a linked list, or null if the index is out of range.
+     * The function `getAt` returns the value at a specified index in a linked list, or undefined if the index is out of range.
      * @param {number} index - The index parameter is a number that represents the position of the element we want to
      * retrieve from the list.
-     * @returns The method `getAt(index: number): E | null` returns the value at the specified index in the linked list, or
-     * `null` if the index is out of bounds.
+     * @returns The method `getAt(index: number): E | undefined` returns the value at the specified index in the linked list, or
+     * `undefined` if the index is out of bounds.
      */
     getAt(index) {
         if (index < 0 || index >= this.length)
@@ -257,7 +257,7 @@ class SinglyLinkedList {
      * @param {number} index - The `index` parameter is a number that represents the position of the node we want to
      * retrieve from the linked list. It indicates the zero-based index of the node we want to access.
      * @returns The method `getNodeAt(index: number)` returns a `SinglyLinkedListNode<E>` object if the node at the
-     * specified index exists, or `null` if the index is out of bounds.
+     * specified index exists, or `undefined` if the index is out of bounds.
      */
     getNodeAt(index) {
         let current = this.head;
@@ -277,7 +277,7 @@ class SinglyLinkedList {
      * The `deleteAt` function removes an element at a specified index from a linked list and returns the removed element.
      * @param {number} index - The index parameter represents the position of the element that needs to be deleted in the
      * data structure. It is of type number.
-     * @returns The method `deleteAt` returns the value of the node that was deleted, or `null` if the index is out of
+     * @returns The method `deleteAt` returns the value of the node that was deleted, or `undefined` if the index is out of
      * bounds.
      */
     deleteAt(index) {
@@ -317,13 +317,13 @@ class SinglyLinkedList {
         else {
             value = valueOrNode;
         }
-        let current = this.head, prev = null;
+        let current = this.head, prev = undefined;
         while (current) {
             if (current.value === value) {
-                if (prev === null) {
+                if (prev === undefined) {
                     this._head = current.next;
                     if (current === this.tail) {
-                        this._tail = null;
+                        this._tail = undefined;
                     }
                 }
                 else {
@@ -383,11 +383,11 @@ class SinglyLinkedList {
         return this.length === 0;
     }
     /**
-     * The `clear` function resets the linked list by setting the head, tail, and length to null and 0 respectively.
+     * The `clear` function resets the linked list by setting the head, tail, and length to undefined and 0 respectively.
      */
     clear() {
-        this._head = null;
-        this._tail = null;
+        this._head = undefined;
+        this._tail = undefined;
         this._length = 0;
     }
     /**
@@ -424,9 +424,9 @@ class SinglyLinkedList {
     reverse() {
         if (!this.head || this.head === this.tail)
             return;
-        let prev = null;
+        let prev = undefined;
         let current = this.head;
-        let next = null;
+        let next = undefined;
         while (current) {
             next = current.next;
             current.next = prev;
@@ -447,7 +447,7 @@ class SinglyLinkedList {
      * @param callback - A function that takes a value of type E as its parameter and returns a boolean value. This
      * function is used to determine whether a particular value in the linked list satisfies a certain condition.
      * @returns The method `find` returns the first element in the linked list that satisfies the condition specified by
-     * the callback function. If no element satisfies the condition, it returns `null`.
+     * the callback function. If no element satisfies the condition, it returns `undefined`.
      */
     find(callback) {
         let current = this.head;
@@ -457,7 +457,7 @@ class SinglyLinkedList {
             }
             current = current.next;
         }
-        return null;
+        return undefined;
     }
     /**
      * Time Complexity: O(n) - Linear time, where n is the length of the list, as it needs to reverse the pointers of each node.
@@ -493,10 +493,10 @@ class SinglyLinkedList {
      * Space Complexity: O(1) - Constant space.
      *
      * The function finds a node in a singly linked list by its value and returns the node if found, otherwise returns
-     * null.
+     * undefined.
      * @param {E} value - The value parameter is the value that we want to search for in the linked list.
      * @returns a `SinglyLinkedListNode<E>` if a node with the specified value is found in the linked list. If no node with
-     * the specified value is found, the function returns `null`.
+     * the specified value is found, the function returns `undefined`.
      */
     getNode(value) {
         let current = this.head;
@@ -506,7 +506,7 @@ class SinglyLinkedList {
             }
             current = current.next;
         }
-        return null;
+        return undefined;
     }
     /**
      * Time Complexity: O(n) - Linear time, where n is the length of the list, as it needs to reverse the pointers of each node.

package/dist/data-structures/linked-list/skip-linked-list.js

@@ -25,7 +25,7 @@ class SkipList {
      * 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) {
-        this._head = new SkipListNode(null, null, maxLevel);
+        this._head = new SkipListNode(undefined, undefined, maxLevel);
         this._level = 0;
         this._maxLevel = maxLevel;
         this._probability = probability;
@@ -69,7 +69,7 @@ class SkipList {
             newNode.forward[i] = update[i].forward[i];
             update[i].forward[i] = newNode;
         }
-        if (newNode.forward[0] !== null) {
+        if (!newNode.forward[0]) {
             this._level = Math.max(this.level, newNode.forward.length);
         }
     }
@@ -140,7 +140,7 @@ class SkipList {
                 }
                 update[i].forward[i] = current.forward[i];
             }
-            while (this.level > 0 && this.head.forward[this.level - 1] === null) {
+            while (this.level > 0 && !this.head.forward[this.level - 1]) {
                 this._level--;
             }
             return true;
@@ -218,7 +218,7 @@ class SkipList {
      */
     lower(key) {
         let current = this.head;
-        let lastLess = null;
+        let lastLess = undefined;
         for (let i = this.level - 1; i >= 0; i--) {
             while (current.forward[i] && current.forward[i].key < key) {
                 current = current.forward[i];

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

@@ -11,8 +11,8 @@ export declare class LinkedListQueue<E = any> extends SinglyLinkedList<E> {
      */
     enqueue(value: E): void;
     /**
-     * The `dequeue` function removes and returns the first element from a queue, or returns null if the queue is empty.
-     * @returns The method is returning the element at the front of the queue, or null if the queue is empty.
+     * The `dequeue` function removes and returns the first element from a queue, or returns undefined if the queue is empty.
+     * @returns The method is returning the element at the front of the queue, or undefined if the queue is empty.
      */
     dequeue(): E | undefined;
     /**
@@ -75,7 +75,7 @@ export declare class Queue<E = any> {
      *
      * The `shift` function removes and returns the first element in the queue, and adjusts the internal data structure if
      * necessary to optimize performance.
-     * @returns The function `shift()` returns either the first element in the queue or `null` if the queue is empty.
+     * @returns The function `shift()` returns either the first element in the queue or `undefined` if the queue is empty.
      */
     shift(): E | undefined;
     /**
@@ -86,9 +86,9 @@ export declare class Queue<E = any> {
      * Time Complexity: O(1) - constant time as it retrieves the value at the current offset.
      * Space Complexity: O(1) - no additional space is used.
      *
-     * The `getFirst` function returns the first element of the array `_nodes` if it exists, otherwise it returns `null`.
+     * The `getFirst` function returns the first element of the array `_nodes` if it exists, otherwise it returns `undefined`.
      * @returns The `getFirst()` method returns the first element of the data structure, represented by the `_nodes` array at
-     * the `_offset` index. If the data structure is empty (size is 0), it returns `null`.
+     * the `_offset` index. If the data structure is empty (size is 0), it returns `undefined`.
      */
     getFirst(): E | undefined;
     /**
@@ -99,9 +99,9 @@ export declare class Queue<E = any> {
      * Time Complexity: O(1) - constant time as it retrieves the value at the current offset.
      * Space Complexity: O(1) - no additional space is used.
      *
-     * The `peek` function returns the first element of the array `_nodes` if it exists, otherwise it returns `null`.
+     * The `peek` function returns the first element of the array `_nodes` if it exists, otherwise it returns `undefined`.
      * @returns The `peek()` method returns the first element of the data structure, represented by the `_nodes` array at
-     * the `_offset` index. If the data structure is empty (size is 0), it returns `null`.
+     * the `_offset` index. If the data structure is empty (size is 0), it returns `undefined`.
      */
     peek(): E | undefined;
     /**
@@ -112,9 +112,9 @@ export declare class Queue<E = any> {
      * Time Complexity: O(1) - constant time as it retrieves the value at the current offset.
      * Space Complexity: O(1) - no additional space is used.
      *
-     * The `getLast` function returns the last element in an array-like data structure, or null if the structure is empty.
+     * The `getLast` function returns the last element in an array-like data structure, or undefined if the structure is empty.
      * @returns The method `getLast()` returns the last element of the `_nodes` array if the array is not empty. If the
-     * array is empty, it returns `null`.
+     * array is empty, it returns `undefined`.
      */
     getLast(): E | undefined;
     /**
@@ -125,9 +125,9 @@ export declare class Queue<E = any> {
      * Time Complexity: O(1) - constant time as it retrieves the value at the current offset.
      * Space Complexity: O(1) - no additional space is used.
      *
-     * The `peekLast` function returns the last element in an array-like data structure, or null if the structure is empty.
+     * The `peekLast` function returns the last element in an array-like data structure, or undefined if the structure is empty.
      * @returns The method `peekLast()` returns the last element of the `_nodes` array if the array is not empty. If the
-     * array is empty, it returns `null`.
+     * array is empty, it returns `undefined`.
      */
     peekLast(): E | undefined;
     /**
@@ -150,8 +150,8 @@ export declare class Queue<E = any> {
      * Time Complexity: O(n) - same as shift().
      * Space Complexity: O(1) - same as shift().
      *
-     * The `dequeue` function removes and returns the first element from a queue, or returns null if the queue is empty.
-     * @returns The method is returning a value of type E or null.
+     * The `dequeue` function removes and returns the first element from a queue, or returns undefined if the queue is empty.
+     * @returns The method is returning a value of type E or undefined.
      */
     dequeue(): E | undefined;
     /**

package/dist/data-structures/queue/queue.js

@@ -16,8 +16,8 @@ class LinkedListQueue extends linked_list_1.SinglyLinkedList {
         this.push(value);
     }
     /**
-     * The `dequeue` function removes and returns the first element from a queue, or returns null if the queue is empty.
-     * @returns The method is returning the element at the front of the queue, or null if the queue is empty.
+     * The `dequeue` function removes and returns the first element from a queue, or returns undefined if the queue is empty.
+     * @returns The method is returning the element at the front of the queue, or undefined if the queue is empty.
      */
     dequeue() {
         return this.shift();
@@ -100,7 +100,7 @@ class Queue {
      *
      * The `shift` function removes and returns the first element in the queue, and adjusts the internal data structure if
      * necessary to optimize performance.
-     * @returns The function `shift()` returns either the first element in the queue or `null` if the queue is empty.
+     * @returns The function `shift()` returns either the first element in the queue or `undefined` if the queue is empty.
      */
     shift() {
         if (this.size === 0)
@@ -123,9 +123,9 @@ class Queue {
      * Time Complexity: O(1) - constant time as it retrieves the value at the current offset.
      * Space Complexity: O(1) - no additional space is used.
      *
-     * The `getFirst` function returns the first element of the array `_nodes` if it exists, otherwise it returns `null`.
+     * The `getFirst` function returns the first element of the array `_nodes` if it exists, otherwise it returns `undefined`.
      * @returns The `getFirst()` method returns the first element of the data structure, represented by the `_nodes` array at
-     * the `_offset` index. If the data structure is empty (size is 0), it returns `null`.
+     * the `_offset` index. If the data structure is empty (size is 0), it returns `undefined`.
      */
     getFirst() {
         return this.size > 0 ? this.nodes[this.offset] : undefined;
@@ -138,9 +138,9 @@ class Queue {
      * Time Complexity: O(1) - constant time as it retrieves the value at the current offset.
      * Space Complexity: O(1) - no additional space is used.
      *
-     * The `peek` function returns the first element of the array `_nodes` if it exists, otherwise it returns `null`.
+     * The `peek` function returns the first element of the array `_nodes` if it exists, otherwise it returns `undefined`.
      * @returns The `peek()` method returns the first element of the data structure, represented by the `_nodes` array at
-     * the `_offset` index. If the data structure is empty (size is 0), it returns `null`.
+     * the `_offset` index. If the data structure is empty (size is 0), it returns `undefined`.
      */
     peek() {
         return this.getFirst();
@@ -153,9 +153,9 @@ class Queue {
      * Time Complexity: O(1) - constant time as it retrieves the value at the current offset.
      * Space Complexity: O(1) - no additional space is used.
      *
-     * The `getLast` function returns the last element in an array-like data structure, or null if the structure is empty.
+     * The `getLast` function returns the last element in an array-like data structure, or undefined if the structure is empty.
      * @returns The method `getLast()` returns the last element of the `_nodes` array if the array is not empty. If the
-     * array is empty, it returns `null`.
+     * array is empty, it returns `undefined`.
      */
     getLast() {
         return this.size > 0 ? this.nodes[this.nodes.length - 1] : undefined;
@@ -168,9 +168,9 @@ class Queue {
      * Time Complexity: O(1) - constant time as it retrieves the value at the current offset.
      * Space Complexity: O(1) - no additional space is used.
      *
-     * The `peekLast` function returns the last element in an array-like data structure, or null if the structure is empty.
+     * The `peekLast` function returns the last element in an array-like data structure, or undefined if the structure is empty.
      * @returns The method `peekLast()` returns the last element of the `_nodes` array if the array is not empty. If the
-     * array is empty, it returns `null`.
+     * array is empty, it returns `undefined`.
      */
     peekLast() {
         return this.getLast();
@@ -197,8 +197,8 @@ class Queue {
      * Time Complexity: O(n) - same as shift().
      * Space Complexity: O(1) - same as shift().
      *
-     * The `dequeue` function removes and returns the first element from a queue, or returns null if the queue is empty.
-     * @returns The method is returning a value of type E or null.
+     * The `dequeue` function removes and returns the first element from a queue, or returns undefined if the queue is empty.
+     * @returns The method is returning a value of type E or undefined.
      */
     dequeue() {
         return this.shift();

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

@@ -45,10 +45,10 @@ export declare class Stack<E = any> {
      * Time Complexity: O(1), as it only involves accessing the last element of the array.
      * Space Complexity: O(1), as it does not use any additional space.
      *
-     * The `peek` function returns the last element of an array, or null if the array is empty.
-     * @returns The `peek()` function returns the last element of the `_elements` array, or `null` if the array is empty.
+     * The `peek` function returns the last element of an array, or undefined if the array is empty.
+     * @returns The `peek()` function returns the last element of the `_elements` array, or `undefined` if the array is empty.
      */
-    peek(): E | null;
+    peek(): E | undefined;
     /**
      * Time Complexity: O(1), as it only involves accessing the last element of the array.
      * Space Complexity: O(1), as it does not use any additional space.
@@ -70,11 +70,11 @@ export declare class Stack<E = any> {
      * Time Complexity: O(1), as it only involves accessing the last element of the array.
      * Space Complexity: O(1), as it does not use any additional space.
      *
-     * The `pop` function removes and returns the last element from an array, or returns null if the array is empty.
+     * The `pop` function removes and returns the last element from an array, or returns undefined if the array is empty.
      * @returns The `pop()` method is returning the last element of the array `_elements` if the array is not empty. If the
-     * array is empty, it returns `null`.
+     * array is empty, it returns `undefined`.
      */
-    pop(): E | null;
+    pop(): E | undefined;
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)

package/dist/data-structures/stack/stack.js

@@ -62,12 +62,12 @@ class Stack {
      * Time Complexity: O(1), as it only involves accessing the last element of the array.
      * Space Complexity: O(1), as it does not use any additional space.
      *
-     * The `peek` function returns the last element of an array, or null if the array is empty.
-     * @returns The `peek()` function returns the last element of the `_elements` array, or `null` if the array is empty.
+     * The `peek` function returns the last element of an array, or undefined if the array is empty.
+     * @returns The `peek()` function returns the last element of the `_elements` array, or `undefined` if the array is empty.
      */
     peek() {
         if (this.isEmpty())
-            return null;
+            return undefined;
         return this.elements[this.elements.length - 1];
     }
     /**
@@ -94,14 +94,14 @@ class Stack {
      * Time Complexity: O(1), as it only involves accessing the last element of the array.
      * Space Complexity: O(1), as it does not use any additional space.
      *
-     * The `pop` function removes and returns the last element from an array, or returns null if the array is empty.
+     * The `pop` function removes and returns the last element from an array, or returns undefined if the array is empty.
      * @returns The `pop()` method is returning the last element of the array `_elements` if the array is not empty. If the
-     * array is empty, it returns `null`.
+     * array is empty, it returns `undefined`.
      */
     pop() {
         if (this.isEmpty())
-            return null;
-        return this.elements.pop() || null;
+            return undefined;
+        return this.elements.pop() || undefined;
     }
     /**
      * Time Complexity: O(n)

package/dist/data-structures/trie/trie.d.ts

@@ -20,6 +20,8 @@ export declare class TrieNode {
  */
 export declare class Trie {
     constructor(words?: string[], caseSensitive?: boolean);
+    protected _size: number;
+    get size(): number;
     protected _caseSensitive: boolean;
     get caseSensitive(): boolean;
     protected _root: TrieNode;
@@ -145,6 +147,7 @@ export declare class Trie {
     filter(predicate: (word: string, index: number, trie: this) => boolean): string[];
     map(callback: (word: string, index: number, trie: this) => string): Trie;
     reduce<T>(callback: (accumulator: T, word: string, index: number, trie: this) => T, initialValue: T): T;
+    print(): void;
     /**
      * Time Complexity: O(M), where M is the length of the input string.
      * Space Complexity: O(1) - Constant space.

package/dist/data-structures/trie/trie.js

@@ -27,12 +27,16 @@ class Trie {
     constructor(words, caseSensitive = true) {
         this._root = new TrieNode('');
         this._caseSensitive = caseSensitive;
+        this._size = 0;
         if (words) {
-            for (const i of words) {
-                this.add(i);
+            for (const word of words) {
+                this.add(word);
             }
         }
     }
+    get size() {
+        return this._size;
+    }
     get caseSensitive() {
         return this._caseSensitive;
     }
@@ -54,6 +58,7 @@ class Trie {
     add(word) {
         word = this._caseProcess(word);
         let cur = this.root;
+        let isNewWord = false;
         for (const c of word) {
             let nodeC = cur.children.get(c);
             if (!nodeC) {
@@ -62,8 +67,12 @@ class Trie {
             }
             cur = nodeC;
         }
-        cur.isEnd = true;
-        return true;
+        if (!cur.isEnd) {
+            isNewWord = true;
+            cur.isEnd = true;
+            this._size++;
+        }
+        return isNewWord;
     }
     /**
      * Time Complexity: O(M), where M is the length of the input word.
@@ -130,6 +139,9 @@ class Trie {
             return false;
         };
         dfs(this.root, 0);
+        if (isDeleted) {
+            this._size--;
+        }
         return isDeleted;
     }
     /**
@@ -352,6 +364,9 @@ class Trie {
         }
         return accumulator;
     }
+    print() {
+        console.log([...this]);
+    }
     /**
      * Time Complexity: O(M), where M is the length of the input string.
      * Space Complexity: O(1) - Constant space.

package/dist/interfaces/binary-tree.d.ts

@@ -1,9 +1,9 @@
 import { BinaryTree, BinaryTreeNode } from '../data-structures';
-import { BinaryTreeNested, BinaryTreeNodeNested, BinaryTreeOptions, BiTreeDeleteResult, BTNCallback, BTNKey, IterableEntriesOrKeys } from '../types';
+import { BinaryTreeNested, BinaryTreeNodeNested, BinaryTreeOptions, BiTreeDeleteResult, BTNCallback, BTNKey, BTNodeExemplar } from '../types';
 export interface IBinaryTree<V = any, N extends BinaryTreeNode<V, N> = BinaryTreeNodeNested<V>, TREE extends BinaryTree<V, N, TREE> = BinaryTreeNested<V, N>> {
     createNode(key: BTNKey, value?: N['value']): N;
     createTree(options?: Partial<BinaryTreeOptions>): TREE;
-    init(elements: IterableEntriesOrKeys<V>): void;
-    add(keyOrNode: BTNKey | N | null, value?: N['value']): N | null | undefined;
+    add(keyOrNodeOrEntry: BTNodeExemplar<V, N>, count?: number): N | null | undefined;
+    addMany(nodes: Iterable<BTNodeExemplar<V, N>>): (N | null | undefined)[];
     delete<C extends BTNCallback<N>>(identifier: ReturnType<C> | null, callback: C): BiTreeDeleteResult<N>[];
 }

package/dist/types/common.d.ts

@@ -19,4 +19,9 @@ export type BinaryTreePrintOptions = {
     isShowNull?: boolean;
     isShowRedBlackNIL?: boolean;
 };
-export type IterableEntriesOrKeys<T> = Iterable<[BTNKey, T | undefined] | BTNKey>;
+export type BTNodeEntry<T> = [BTNKey | null | undefined, T | undefined];
+export type BTNodeKeyOrNode<N> = BTNKey | null | undefined | N;
+export type BTNodeExemplar<T, N> = BTNodeEntry<T> | BTNodeKeyOrNode<N>;
+export type BTNodePureExemplar<T, N> = [BTNKey, T | undefined] | BTNodePureKeyOrNode<N>;
+export type BTNodePureKeyOrNode<N> = BTNKey | N;
+export type BSTNodeKeyOrNode<N> = BTNKey | undefined | N;

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

@@ -2,9 +2,9 @@ export type VertexKey = string | number;
 export type DijkstraResult<V> = {
     distMap: Map<V, number>;
     distPaths?: Map<V, V[]>;
-    preMap: Map<V, V | null>;
+    preMap: Map<V, V | undefined>;
     seen: Set<V>;
     paths: V[][];
     minDist: number;
     minPath: V[];
-} | null;
+} | undefined;

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

@@ -4,8 +4,7 @@ export type HashMapLinkedNode<K, V> = {
     next: HashMapLinkedNode<K, V>;
     prev: HashMapLinkedNode<K, V>;
 };
-export type HashMapOptions<K, V> = {
-    elements: Iterable<[K, V]>;
+export type HashMapOptions<K> = {
     hashFn: (key: K) => string;
     objHashFn: (key: K) => object;
 };

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "queue-typed",
-  "version": "1.47.6",
+  "version": "1.47.8",
   "description": "Queue, ArrayQueue. Javascript & Typescript Data Structure.",
   "main": "dist/index.js",
   "scripts": {
@@ -115,6 +115,6 @@
     "typescript": "^4.9.5"
   },
   "dependencies": {
-    "data-structure-typed": "^1.47.6"
+    "data-structure-typed": "^1.47.8"
   }
 }