min-heap-typed 1.39.4 → 1.39.6

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

@@ -11,19 +11,19 @@ exports.DoublyLinkedList = exports.DoublyLinkedListNode = void 0;
 class DoublyLinkedListNode {
     /**
      * The constructor function initializes the value, next, and previous properties of an object.
-     * @param {E} val - The "val" parameter is the value that will be stored in the node. It can be of any data type, as it
+     * @param {E} value - The "value" parameter is the value that will be stored in the node. It can be of any data type, as it
      * is defined as a generic type "E".
      */
-    constructor(val) {
-        this._val = val;
+    constructor(value) {
+        this._value = value;
         this._next = null;
         this._prev = null;
     }
-    get val() {
-        return this._val;
+    get value() {
+        return this._value;
     }
-    set val(value) {
-        this._val = value;
+    set value(value) {
+        this._value = value;
     }
     get next() {
         return this._next;
@@ -81,10 +81,10 @@ class DoublyLinkedList {
     }
     /**
      * The push function adds a new node with the given value to the end of the doubly linked list.
-     * @param {E} val - The value to be added to the linked list.
+     * @param {E} value - The value to be added to the linked list.
      */
-    push(val) {
-        const newNode = new DoublyLinkedListNode(val);
+    push(value) {
+        const newNode = new DoublyLinkedListNode(value);
         if (!this.head) {
             this.head = newNode;
             this.tail = newNode;
@@ -98,14 +98,14 @@ class DoublyLinkedList {
     }
     /**
      * The addLast function adds a new node with the given value to the end of the doubly linked list.
-     * @param {E} val - The value to be added to the linked list.
+     * @param {E} value - The value to be added to the linked list.
      */
-    addLast(val) {
-        this.push(val);
+    addLast(value) {
+        this.push(value);
     }
     /**
      * The `pop()` function removes and returns the value of the last node in a doubly linked list.
-     * @returns The method is returning the value of the removed node (removedNode.val) if the list is not empty. If the
+     * @returns The method is returning the value of the removed node (removedNode.value) if the list is not empty. If the
      * list is empty, it returns null.
      */
     pop() {
@@ -121,11 +121,11 @@ class DoublyLinkedList {
             this.tail.next = null;
         }
         this._length--;
-        return removedNode.val;
+        return removedNode.value;
     }
     /**
      * The `popLast()` function removes and returns the value of the last node in a doubly linked list.
-     * @returns The method is returning the value of the removed node (removedNode.val) if the list is not empty. If the
+     * @returns The method is returning the value of the removed node (removedNode.value) if the list is not empty. If the
      * list is empty, it returns null.
      */
     popLast() {
@@ -149,7 +149,7 @@ class DoublyLinkedList {
             this.head.prev = null;
         }
         this._length--;
-        return removedNode.val;
+        return removedNode.value;
     }
     /**
      * The `popFirst()` function removes and returns the value of the first node in a doubly linked list.
@@ -161,11 +161,11 @@ class DoublyLinkedList {
     }
     /**
      * The unshift function adds a new node with the given value to the beginning of a doubly linked list.
-     * @param {E} val - The `val` parameter represents the value of the new node that will be added to the beginning of the
+     * @param {E} value - The `value` parameter represents the value of the new node that will be added to the beginning of the
      * doubly linked list.
      */
-    unshift(val) {
-        const newNode = new DoublyLinkedListNode(val);
+    unshift(value) {
+        const newNode = new DoublyLinkedListNode(value);
         if (!this.head) {
             this.head = newNode;
             this.tail = newNode;
@@ -179,11 +179,11 @@ class DoublyLinkedList {
     }
     /**
      * The addFirst function adds a new node with the given value to the beginning of a doubly linked list.
-     * @param {E} val - The `val` parameter represents the value of the new node that will be added to the beginning of the
+     * @param {E} value - The `value` parameter represents the value of the new node that will be added to the beginning of the
      * doubly linked list.
      */
-    addFirst(val) {
-        this.unshift(val);
+    addFirst(value) {
+        this.unshift(value);
     }
     /**
      * The `getFirst` function returns the first node in a doubly linked list, or null if the list is empty.
@@ -191,7 +191,7 @@ class DoublyLinkedList {
      */
     getFirst() {
         var _a;
-        return (_a = this.head) === null || _a === void 0 ? void 0 : _a.val;
+        return (_a = this.head) === null || _a === void 0 ? void 0 : _a.value;
     }
     /**
      * The `getLast` function returns the last node in a doubly linked list, or null if the list is empty.
@@ -199,7 +199,7 @@ class DoublyLinkedList {
      */
     getLast() {
         var _a;
-        return (_a = this.tail) === null || _a === void 0 ? void 0 : _a.val;
+        return (_a = this.tail) === null || _a === void 0 ? void 0 : _a.value;
     }
     /**
      * The `getAt` function returns the value at a specified index in a linked list, or null if the index is out of bounds.
@@ -215,7 +215,7 @@ class DoublyLinkedList {
         for (let i = 0; i < index; i++) {
             current = current.next;
         }
-        return current.val;
+        return current.value;
     }
     /**
      * The function `getNodeAt` returns the node at a given index in a doubly linked list, or null if the index is out of
@@ -237,14 +237,14 @@ class DoublyLinkedList {
     /**
      * The function `findNodeByValue` searches for a node with a specific value in a doubly linked list and returns the
      * node if found, otherwise it returns null.
-     * @param {E} val - The `val` parameter is the value that we want to search for in the doubly linked list.
-     * @returns The function `findNodeByValue` returns a `DoublyLinkedListNode<E>` if a node with the specified value `val`
+     * @param {E} value - The `value` parameter is the value that we want to search for in the doubly linked list.
+     * @returns The function `findNodeByValue` returns a `DoublyLinkedListNode<E>` if a node with the specified value `value`
      * is found in the linked list. If no such node is found, it returns `null`.
      */
-    getNode(val) {
+    getNode(value) {
         let current = this.head;
         while (current) {
-            if (current.val === val) {
+            if (current.value === value) {
                 return current;
             }
             current = current.next;
@@ -255,23 +255,23 @@ class DoublyLinkedList {
      * The `insert` function inserts a value at a specified index in a doubly linked list.
      * @param {number} index - The index parameter represents the position at which the new value should be inserted in the
      * DoublyLinkedList. It is of type number.
-     * @param {E} val - The `val` parameter represents the value that you want to insert into the Doubly Linked List at the
+     * @param {E} value - The `value` parameter represents the value that you want to insert into the Doubly Linked List at the
      * specified index.
      * @returns The `insert` method returns a boolean value. It returns `true` if the insertion is successful, and `false`
      * if the index is out of bounds.
      */
-    insertAt(index, val) {
+    insertAt(index, value) {
         if (index < 0 || index > this.length)
             return false;
         if (index === 0) {
-            this.unshift(val);
+            this.unshift(value);
             return true;
         }
         if (index === this.length) {
-            this.push(val);
+            this.push(value);
             return true;
         }
-        const newNode = new DoublyLinkedListNode(val);
+        const newNode = new DoublyLinkedListNode(value);
         const prevNode = this.getNodeAt(index - 1);
         const nextNode = prevNode.next;
         newNode.prev = prevNode;
@@ -335,7 +335,7 @@ class DoublyLinkedList {
         prevNode.next = nextNode;
         nextNode.prev = prevNode;
         this._length--;
-        return removedNode.val;
+        return removedNode.value;
     }
     /**
      * The `delete` function removes a node from a doubly linked list based on either the node itself or its value.
@@ -378,7 +378,7 @@ class DoublyLinkedList {
         const array = [];
         let current = this.head;
         while (current) {
-            array.push(current.val);
+            array.push(current.value);
             current = current.next;
         }
         return array;
@@ -408,8 +408,8 @@ class DoublyLinkedList {
     find(callback) {
         let current = this.head;
         while (current) {
-            if (callback(current.val)) {
-                return current.val;
+            if (callback(current.value)) {
+                return current.value;
             }
             current = current.next;
         }
@@ -417,16 +417,16 @@ class DoublyLinkedList {
     }
     /**
      * The function returns the index of the first occurrence of a given value in a linked list.
-     * @param {E} val - The parameter `val` is of type `E`, which means it can be any data type. It represents the value
+     * @param {E} value - The parameter `value` is of type `E`, which means it can be any data type. It represents the value
      * that we are searching for in the linked list.
-     * @returns The method `indexOf` returns the index of the first occurrence of the specified value `val` in the linked
+     * @returns The method `indexOf` returns the index of the first occurrence of the specified value `value` in the linked
      * list. If the value is not found, it returns -1.
      */
-    indexOf(val) {
+    indexOf(value) {
         let index = 0;
         let current = this.head;
         while (current) {
-            if (current.val === val) {
+            if (current.value === value) {
                 return index;
             }
             index++;
@@ -445,8 +445,8 @@ class DoublyLinkedList {
     findBackward(callback) {
         let current = this.tail;
         while (current) {
-            if (callback(current.val)) {
-                return current.val;
+            if (callback(current.value)) {
+                return current.value;
             }
             current = current.prev;
         }
@@ -460,7 +460,7 @@ class DoublyLinkedList {
         const array = [];
         let current = this.tail;
         while (current) {
-            array.push(current.val);
+            array.push(current.value);
             current = current.prev;
         }
         return array;
@@ -479,7 +479,7 @@ class DoublyLinkedList {
     }
     /**
      * The `forEach` function iterates over each element in a linked list and applies a callback function to each element.
-     * @param callback - The callback parameter is a function that takes two arguments: val and index. The val argument
+     * @param callback - The callback parameter is a function that takes two arguments: value and index. The value argument
      * represents the value of the current node in the linked list, and the index argument represents the index of the
      * current node in the linked list.
      */
@@ -487,7 +487,7 @@ class DoublyLinkedList {
         let current = this.head;
         let index = 0;
         while (current) {
-            callback(current.val, index);
+            callback(current.value, index);
             current = current.next;
             index++;
         }
@@ -504,7 +504,7 @@ class DoublyLinkedList {
         const mappedList = new DoublyLinkedList();
         let current = this.head;
         while (current) {
-            mappedList.push(callback(current.val));
+            mappedList.push(callback(current.value));
             current = current.next;
         }
         return mappedList;
@@ -520,8 +520,8 @@ class DoublyLinkedList {
         const filteredList = new DoublyLinkedList();
         let current = this.head;
         while (current) {
-            if (callback(current.val)) {
-                filteredList.push(current.val);
+            if (callback(current.value)) {
+                filteredList.push(current.value);
             }
             current = current.next;
         }
@@ -530,7 +530,7 @@ class DoublyLinkedList {
     /**
      * The `reduce` function iterates over a linked list and applies a callback function to each element, accumulating a
      * single value.
-     * @param callback - The `callback` parameter is a function that takes two arguments: `accumulator` and `val`. It is
+     * @param callback - The `callback` parameter is a function that takes two arguments: `accumulator` and `value`. It is
      * used to perform a specific operation on each element of the linked list.
      * @param {U} initialValue - The `initialValue` parameter is the initial value of the accumulator. It is the starting
      * point for the reduction operation.
@@ -541,7 +541,7 @@ class DoublyLinkedList {
         let accumulator = initialValue;
         let current = this.head;
         while (current) {
-            accumulator = callback(accumulator, current.val);
+            accumulator = callback(accumulator, current.value);
             current = current.next;
         }
         return accumulator;
@@ -585,7 +585,7 @@ class DoublyLinkedList {
     *[Symbol.iterator]() {
         let current = this.head;
         while (current) {
-            yield current.val;
+            yield current.value;
             current = current.next;
         }
     }

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

@@ -8,13 +8,13 @@
 export declare class SinglyLinkedListNode<E = any> {
     /**
      * The constructor function initializes an instance of a class with a given value and sets the next property to null.
-     * @param {E} val - The "val" parameter is of type E, which means it can be any data type. It represents the value that
+     * @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(val: E);
-    private _val;
-    get val(): E;
-    set val(value: E);
+    constructor(value: E);
+    private _value;
+    get value(): E;
+    set value(value: E);
     private _next;
     get next(): SinglyLinkedListNode<E> | null;
     set next(value: SinglyLinkedListNode<E> | null);
@@ -40,17 +40,17 @@ export declare class SinglyLinkedList<E = any> {
      */
     static fromArray<E>(data: E[]): SinglyLinkedList<E>;
     /**
-     * The `push` function adds a new node with the given val to the end of a singly linked list.
-     * @param {E} val - The "val" parameter represents the value that you want to add to the linked list. It can be of
+     * The `push` function adds a new node with the given value to the end of a singly linked list.
+     * @param {E} value - The "value" parameter represents the value that you want to add to the linked list. It can be of
      * any type (E) as specified in the generic type declaration of the class or function.
      */
-    push(val: E): void;
+    push(value: E): void;
     /**
-     * The `push` function adds a new node with the given val to the end of a singly linked list.
-     * @param {E} val - The "val" parameter represents the value that you want to add to the linked list. It can be of
+     * The `push` function adds a new node with the given value to the end of a singly linked list.
+     * @param {E} value - The "value" parameter represents the value that you want to add to the linked list. It can be of
      * any type (E) as specified in the generic type declaration of the class or function.
      */
-    addLast(val: E): void;
+    addLast(value: E): void;
     /**
      * The `pop()` function removes and returns the value of the last element in a linked list, updating the head and tail
      * pointers accordingly.
@@ -77,16 +77,16 @@ export declare class SinglyLinkedList<E = any> {
     popFirst(): E | undefined;
     /**
      * The unshift function adds a new node with the given value to the beginning of a singly linked list.
-     * @param {E} val - The parameter "val" represents the value of the new node that will be added to the beginning of the
+     * @param {E} value - The parameter "value" represents the value of the new node that will be added to the beginning of the
      * linked list.
      */
-    unshift(val: E): void;
+    unshift(value: E): void;
     /**
      * The addFirst function adds a new node with the given value to the beginning of a singly linked list.
-     * @param {E} val - The parameter "val" represents the value of the new node that will be added to the beginning of the
+     * @param {E} value - The parameter "value" represents the value of the new node that will be added to the beginning of the
      * linked list.
      */
-    addFirst(val: E): void;
+    addFirst(value: E): void;
     /**
      * The function `getAt` returns the value at a specified index in a linked list, or null 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
@@ -123,12 +123,12 @@ export declare class SinglyLinkedList<E = any> {
      * The `insertAt` function inserts a value at a specified index in a singly linked list.
      * @param {number} index - The index parameter represents the position at which the new value should be inserted in the
      * linked list. It is of type number.
-     * @param {E} val - The `val` parameter represents the value that you want to insert into the linked list at the
+     * @param {E} value - The `value` parameter represents the value that you want to insert into the linked list at the
      * specified index.
      * @returns The `insert` method returns a boolean value. It returns `true` if the insertion is successful, and `false`
      * if the index is out of bounds.
      */
-    insertAt(index: number, val: E): boolean;
+    insertAt(index: number, value: E): boolean;
     /**
      * The function checks if the length of a data structure is equal to zero and returns a boolean value indicating
      * whether it is empty or not.
@@ -156,7 +156,7 @@ export declare class SinglyLinkedList<E = any> {
      * @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`.
      */
-    find(callback: (val: E) => boolean): E | null;
+    find(callback: (value: E) => boolean): E | null;
     /**
      * The `indexOf` function returns the index of the first occurrence of a given value in a linked list.
      * @param {E} value - The value parameter is the value that you want to find the index of in the linked list.
@@ -198,11 +198,11 @@ export declare class SinglyLinkedList<E = any> {
     countOccurrences(value: E): number;
     /**
      * The `forEach` function iterates over each element in a linked list and applies a callback function to each element.
-     * @param callback - The callback parameter is a function that takes two arguments: val and index. The val argument
+     * @param callback - The callback parameter is a function that takes two arguments: value and index. The value argument
      * represents the value of the current node in the linked list, and the index argument represents the index of the
      * current node in the linked list.
      */
-    forEach(callback: (val: E, index: number) => void): void;
+    forEach(callback: (value: E, index: number) => void): void;
     /**
      * The `map` function takes a callback function and applies it to each element in the SinglyLinkedList, returning a new
      * SinglyLinkedList with the transformed values.
@@ -211,7 +211,7 @@ export declare class SinglyLinkedList<E = any> {
      * SinglyLinkedList).
      * @returns The `map` function is returning a new instance of `SinglyLinkedList<U>` that contains the mapped values.
      */
-    map<U>(callback: (val: E) => U): SinglyLinkedList<U>;
+    map<U>(callback: (value: E) => U): SinglyLinkedList<U>;
     /**
      * The `filter` function iterates through a SinglyLinkedList and returns a new SinglyLinkedList containing only the
      * elements that satisfy the given callback function.
@@ -219,18 +219,18 @@ export declare class SinglyLinkedList<E = any> {
      * It is used to determine whether a value should be included in the filtered list or not.
      * @returns The filtered list, which is an instance of the SinglyLinkedList class.
      */
-    filter(callback: (val: E) => boolean): SinglyLinkedList<E>;
+    filter(callback: (value: E) => boolean): SinglyLinkedList<E>;
     /**
      * The `reduce` function iterates over a linked list and applies a callback function to each element, accumulating a
      * single value.
-     * @param callback - The `callback` parameter is a function that takes two arguments: `accumulator` and `val`. It is
+     * @param callback - The `callback` parameter is a function that takes two arguments: `accumulator` and `value`. It is
      * used to perform a specific operation on each element of the linked list.
      * @param {U} initialValue - The `initialValue` parameter is the initial value of the accumulator. It is the starting
      * point for the reduction operation.
      * @returns The `reduce` method is returning the final value of the accumulator after iterating through all the
      * elements in the linked list.
      */
-    reduce<U>(callback: (accumulator: U, val: E) => U, initialValue: U): U;
+    reduce<U>(callback: (accumulator: U, value: E) => U, initialValue: U): U;
     /**
      * The function returns an iterator that iterates over the values of a linked list.
      */