directed-graph-typed 1.39.5 → 1.40.0

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

@@ -6,31 +6,25 @@
  * @license MIT License
  */
 export declare class SinglyLinkedListNode<E = any> {
+    value: E;
+    next: SinglyLinkedListNode<E> | null;
     /**
      * 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);
-    private _next;
-    get next(): SinglyLinkedListNode<E> | null;
-    set next(value: SinglyLinkedListNode<E> | null);
+    constructor(value: E);
 }
 export declare class SinglyLinkedList<E = any> {
     /**
      * The constructor initializes the linked list with an empty head, tail, and length.
      */
     constructor();
-    private _head;
+    protected _head: SinglyLinkedListNode<E> | null;
     get head(): SinglyLinkedListNode<E> | null;
-    set head(value: SinglyLinkedListNode<E> | null);
-    private _tail;
+    protected _tail: SinglyLinkedListNode<E> | null;
     get tail(): SinglyLinkedListNode<E> | null;
-    set tail(value: SinglyLinkedListNode<E> | null);
-    private _length;
+    protected _length: number;
     get length(): number;
     /**
      * The `fromArray` function creates a new SinglyLinkedList instance and populates it with the elements from the given
@@ -40,17 +34,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 +71,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 +117,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 +150,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 +192,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 +205,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 +213,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/data-structures/linked-list/singly-linked-list.js

@@ -11,24 +11,12 @@ 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;
-        this._next = null;
-    }
-    get val() {
-        return this._val;
-    }
-    set val(value) {
-        this._val = value;
-    }
-    get next() {
-        return this._next;
-    }
-    set next(value) {
-        this._next = value;
+    constructor(value) {
+        this.value = value;
+        this.next = null;
     }
 }
 exports.SinglyLinkedListNode = SinglyLinkedListNode;
@@ -44,15 +32,9 @@ class SinglyLinkedList {
     get head() {
         return this._head;
     }
-    set head(value) {
-        this._head = value;
-    }
     get tail() {
         return this._tail;
     }
-    set tail(value) {
-        this._tail = value;
-    }
     get length() {
         return this._length;
     }
@@ -70,29 +52,29 @@ 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;
+            this._head = newNode;
+            this._tail = newNode;
         }
         else {
             this.tail.next = newNode;
-            this.tail = newNode;
+            this._tail = newNode;
         }
         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
@@ -104,21 +86,21 @@ class SinglyLinkedList {
         if (!this.head)
             return undefined;
         if (this.head === this.tail) {
-            const val = this.head.val;
-            this.head = null;
-            this.tail = null;
+            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._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
@@ -137,9 +119,9 @@ class SinglyLinkedList {
         if (!this.head)
             return undefined;
         const removedNode = this.head;
-        this.head = this.head.next;
+        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.
@@ -150,28 +132,28 @@ 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;
+            this._head = newNode;
+            this._tail = newNode;
         }
         else {
             newNode.next = this.head;
-            this.head = newNode;
+            this._head = newNode;
         }
         this._length++;
     }
     /**
      * 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.
@@ -187,7 +169,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.
@@ -221,7 +203,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.
@@ -235,24 +217,24 @@ 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;
+                    this._head = current.next;
                     if (current === this.tail) {
-                        this.tail = null;
+                        this._tail = null;
                     }
                 }
                 else {
                     prev.next = current.next;
                     if (current === this.tail) {
-                        this.tail = prev;
+                        this._tail = prev;
                     }
                 }
                 this._length--;
@@ -267,23 +249,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;
@@ -314,7 +296,7 @@ class SinglyLinkedList {
         const array = [];
         let current = this.head;
         while (current) {
-            array.push(current.val);
+            array.push(current.value);
             current = current.next;
         }
         return array;
@@ -335,7 +317,7 @@ class SinglyLinkedList {
             prev = current;
             current = next;
         }
-        [this.head, this.tail] = [this.tail, this.head];
+        [this._head, this._tail] = [this.tail, this.head];
     }
     /**
      * The `find` function iterates through a linked list and returns the first element that satisfies a given condition.
@@ -347,8 +329,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;
         }
@@ -364,7 +346,7 @@ class SinglyLinkedList {
         let index = 0;
         let current = this.head;
         while (current) {
-            if (current.val === value) {
+            if (current.value === value) {
                 return index;
             }
             index++;
@@ -382,7 +364,7 @@ class SinglyLinkedList {
     getNode(value) {
         let current = this.head;
         while (current) {
-            if (current.val === value) {
+            if (current.value === value) {
                 return current;
             }
             current = current.next;
@@ -402,18 +384,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;
@@ -445,7 +427,7 @@ class SinglyLinkedList {
             newNode.next = existingNode.next;
             existingNode.next = newNode;
             if (existingNode === this.tail) {
-                this.tail = newNode;
+                this._tail = newNode;
             }
             this._length++;
             return true;
@@ -461,7 +443,7 @@ class SinglyLinkedList {
         let count = 0;
         let current = this.head;
         while (current) {
-            if (current.val === value) {
+            if (current.value === value) {
                 count++;
             }
             current = current.next;
@@ -470,7 +452,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.
      */
@@ -478,7 +460,7 @@ class SinglyLinkedList {
         let current = this.head;
         let index = 0;
         while (current) {
-            callback(current.val, index);
+            callback(current.value, index);
             current = current.next;
             index++;
         }
@@ -495,7 +477,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;
@@ -511,8 +493,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;
         }
@@ -521,7 +503,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.
@@ -532,7 +514,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;
@@ -543,7 +525,7 @@ class SinglyLinkedList {
     *[Symbol.iterator]() {
         let current = this.head;
         while (current) {
-            yield current.val;
+            yield current.value;
             current = current.next;
         }
     }

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

@@ -20,18 +20,14 @@ export declare class SkipList<K, V> {
      * level in the skip list. It is used to determine the height of each node in the skip list.
      */
     constructor(maxLevel?: number, probability?: number);
-    private _head;
+    protected _head: SkipListNode<K, V>;
     get head(): SkipListNode<K, V>;
-    set head(value: SkipListNode<K, V>);
-    private _level;
+    protected _level: number;
     get level(): number;
-    set level(value: number);
-    private _maxLevel;
+    protected _maxLevel: number;
     get maxLevel(): number;
-    set maxLevel(value: number);
-    private _probability;
+    protected _probability: number;
     get probability(): number;
-    set probability(value: number);
     /**
      * The add function adds a new node with a given key and value to a Skip List data structure.
      * @param {K} key - The key parameter represents the key of the node that needs to be added to the skip list.
@@ -46,6 +42,7 @@ export declare class SkipList<K, V> {
      * otherwise it returns `undefined`.
      */
     get(key: K): V | undefined;
+    has(key: K): boolean;
     /**
      * The `delete` function removes a node with a specific key from a Skip List data structure.
      * @param {K} key - The key parameter represents the key of the node that needs to be removed from the skip list.
@@ -54,8 +51,30 @@ export declare class SkipList<K, V> {
      */
     delete(key: K): boolean;
     /**
-     * The function "randomLevel" generates a random level based on a given probability and maximum level.
+     * Get the value of the first element (the smallest element) in the Skip List.
+     * @returns The value of the first element, or undefined if the Skip List is empty.
+     */
+    getFirst(): V | undefined;
+    /**
+     * Get the value of the last element (the largest element) in the Skip List.
+     * @returns The value of the last element, or undefined if the Skip List is empty.
+     */
+    getLast(): V | undefined;
+    /**
+     * Get the value of the first element in the Skip List that is greater than the given key.
+     * @param key - the given key.
+     * @returns The value of the first element greater than the given key, or undefined if there is no such element.
+     */
+    higher(key: K): V | undefined;
+    /**
+     * Get the value of the last element in the Skip List that is less than the given key.
+     * @param key - the given key.
+     * @returns The value of the last element less than the given key, or undefined if there is no such element.
+     */
+    lower(key: K): V | undefined;
+    /**
+     * The function "_randomLevel" generates a random level based on a given probability and maximum level.
      * @returns the level, which is a number.
      */
-    private randomLevel;
+    protected _randomLevel(): number;
 }