data-structure-typed 1.39.5 → 1.39.6

package/dist/mjs/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.
      */

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

@@ -11,19 +11,19 @@ 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.
-     * @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) {
-        this._val = val;
+    constructor(value) {
+        this._value = value;
         this._next = null;
     }
-    _val;
-    get val() {
-        return this._val;
+    _value;
+    get value() {
+        return this._value;
     }
-    set val(value) {
-        this._val = value;
+    set value(value) {
+        this._value = value;
     }
     _next;
     get next() {
@@ -75,12 +75,12 @@ class SinglyLinkedList {
         return singlyLinkedList;
     }
     /**
-     * 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) {
-        const newNode = new SinglyLinkedListNode(val);
+    push(value) {
+        const newNode = new SinglyLinkedListNode(value);
         if (!this.head) {
             this.head = newNode;
             this.tail = newNode;
@@ -92,12 +92,12 @@ class SinglyLinkedList {
         this._length++;
     }
     /**
-     * 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) {
-        this.push(val);
+    addLast(value) {
+        this.push(value);
     }
     /**
      * The `pop()` function removes and returns the value of the last element in a linked list, updating the head and tail
@@ -109,21 +109,21 @@ class SinglyLinkedList {
         if (!this.head)
             return undefined;
         if (this.head === this.tail) {
-            const val = this.head.val;
+            const value = this.head.value;
             this.head = null;
             this.tail = null;
             this._length--;
-            return val;
+            return value;
         }
         let current = this.head;
         while (current.next !== this.tail) {
             current = current.next;
         }
-        const val = this.tail.val;
+        const value = this.tail.value;
         current.next = null;
         this.tail = current;
         this._length--;
-        return val;
+        return value;
     }
     /**
      * The `popLast()` function removes and returns the value of the last element in a linked list, updating the head and tail
@@ -144,7 +144,7 @@ class SinglyLinkedList {
         const removedNode = this.head;
         this.head = this.head.next;
         this._length--;
-        return removedNode.val;
+        return removedNode.value;
     }
     /**
      * The `popFirst()` function removes and returns the value of the first node in a linked list.
@@ -155,11 +155,11 @@ class SinglyLinkedList {
     }
     /**
      * 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) {
-        const newNode = new SinglyLinkedListNode(val);
+    unshift(value) {
+        const newNode = new SinglyLinkedListNode(value);
         if (!this.head) {
             this.head = newNode;
             this.tail = newNode;
@@ -172,11 +172,11 @@ class SinglyLinkedList {
     }
     /**
      * 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) {
-        this.unshift(val);
+    addFirst(value) {
+        this.unshift(value);
     }
     /**
      * The function `getAt` returns the value at a specified index in a linked list, or null if the index is out of range.
@@ -192,7 +192,7 @@ class SinglyLinkedList {
         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 singly linked list.
@@ -226,7 +226,7 @@ class SinglyLinkedList {
         const removedNode = prevNode.next;
         prevNode.next = removedNode.next;
         this._length--;
-        return removedNode.val;
+        return removedNode.value;
     }
     /**
      * The delete function removes a node with a specific value from a singly linked list.
@@ -240,14 +240,14 @@ class SinglyLinkedList {
             return false;
         let value;
         if (valueOrNode instanceof SinglyLinkedListNode) {
-            value = valueOrNode.val;
+            value = valueOrNode.value;
         }
         else {
             value = valueOrNode;
         }
         let current = this.head, prev = null;
         while (current) {
-            if (current.val === value) {
+            if (current.value === value) {
                 if (prev === null) {
                     this.head = current.next;
                     if (current === this.tail) {
@@ -272,23 +272,23 @@ class SinglyLinkedList {
      * 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, 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 SinglyLinkedListNode(val);
+        const newNode = new SinglyLinkedListNode(value);
         const prevNode = this.getNodeAt(index - 1);
         newNode.next = prevNode.next;
         prevNode.next = newNode;
@@ -319,7 +319,7 @@ class SinglyLinkedList {
         const array = [];
         let current = this.head;
         while (current) {
-            array.push(current.val);
+            array.push(current.value);
             current = current.next;
         }
         return array;
@@ -352,8 +352,8 @@ class SinglyLinkedList {
     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;
         }
@@ -369,7 +369,7 @@ class SinglyLinkedList {
         let index = 0;
         let current = this.head;
         while (current) {
-            if (current.val === value) {
+            if (current.value === value) {
                 return index;
             }
             index++;
@@ -387,7 +387,7 @@ class SinglyLinkedList {
     getNode(value) {
         let current = this.head;
         while (current) {
-            if (current.val === value) {
+            if (current.value === value) {
                 return current;
             }
             current = current.next;
@@ -407,18 +407,18 @@ class SinglyLinkedList {
             return false;
         let existingValue;
         if (existingValueOrNode instanceof SinglyLinkedListNode) {
-            existingValue = existingValueOrNode.val;
+            existingValue = existingValueOrNode.value;
         }
         else {
             existingValue = existingValueOrNode;
         }
-        if (this.head.val === existingValue) {
+        if (this.head.value === existingValue) {
             this.unshift(newValue);
             return true;
         }
         let current = this.head;
         while (current.next) {
-            if (current.next.val === existingValue) {
+            if (current.next.value === existingValue) {
                 const newNode = new SinglyLinkedListNode(newValue);
                 newNode.next = current.next;
                 current.next = newNode;
@@ -466,7 +466,7 @@ class SinglyLinkedList {
         let count = 0;
         let current = this.head;
         while (current) {
-            if (current.val === value) {
+            if (current.value === value) {
                 count++;
             }
             current = current.next;
@@ -475,7 +475,7 @@ class SinglyLinkedList {
     }
     /**
      * 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.
      */
@@ -483,7 +483,7 @@ class SinglyLinkedList {
         let current = this.head;
         let index = 0;
         while (current) {
-            callback(current.val, index);
+            callback(current.value, index);
             current = current.next;
             index++;
         }
@@ -500,7 +500,7 @@ class SinglyLinkedList {
         const mappedList = new SinglyLinkedList();
         let current = this.head;
         while (current) {
-            mappedList.push(callback(current.val));
+            mappedList.push(callback(current.value));
             current = current.next;
         }
         return mappedList;
@@ -516,8 +516,8 @@ class SinglyLinkedList {
         const filteredList = new SinglyLinkedList();
         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;
         }
@@ -526,7 +526,7 @@ class SinglyLinkedList {
     /**
      * 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.
@@ -537,7 +537,7 @@ class SinglyLinkedList {
         let accumulator = initialValue;
         let current = this.head;
         while (current) {
-            accumulator = callback(accumulator, current.val);
+            accumulator = callback(accumulator, current.value);
             current = current.next;
         }
         return accumulator;
@@ -548,7 +548,7 @@ class SinglyLinkedList {
     *[Symbol.iterator]() {
         let current = this.head;
         while (current) {
-            yield current.val;
+            yield current.value;
             current = current.next;
         }
     }

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

@@ -27,7 +27,7 @@ class SkipQueue extends linked_list_1.SinglyLinkedList {
      * @returns The `peek()` method is returning the value of the `head` node if it exists, otherwise it returns `undefined`.
      */
     peek() {
-        return this.head?.val;
+        return this.head?.value;
     }
 }
 exports.SkipQueue = SkipQueue;

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

@@ -1,7 +1,7 @@
 import { BinaryTreeNode } from '../data-structures';
 import { BinaryTreeDeletedResult, BTNKey, BinaryTreeNodeNested, BTNCallback } from '../types';
 export interface IBinaryTree<V = any, N extends BinaryTreeNode<V, N> = BinaryTreeNodeNested<V>> {
-    createNode(key: BTNKey, val?: N['val']): N;
-    add(keyOrNode: BTNKey | N | null, val?: N['val']): N | null | undefined;
+    createNode(key: BTNKey, value?: N['value']): N;
+    add(keyOrNode: BTNKey | N | null, value?: N['value']): N | null | undefined;
     delete<C extends BTNCallback<N>>(identifier: ReturnType<C> | null, callback: C): BinaryTreeDeletedResult<N>[];
 }

package/dist/mjs/interfaces/graph.d.ts

@@ -1,5 +1,5 @@
 import { VertexKey } from '../types';
 export interface IGraph<V, E, VO, EO> {
-    createVertex(key: VertexKey, val?: V): VO;
-    createEdge(srcOrV1: VertexKey | string, destOrV2: VertexKey | string, weight?: number, val?: E): EO;
+    createVertex(key: VertexKey, value?: V): VO;
+    createEdge(srcOrV1: VertexKey, destOrV2: VertexKey, weight?: number, value?: E): EO;
 }