data-structure-typed 1.19.3 → 1.19.5

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

@@ -1,31 +1,4 @@
 "use strict";
-var __values = (this && this.__values) || function(o) {
-    var s = typeof Symbol === "function" && Symbol.iterator, m = s && o[s], i = 0;
-    if (m) return m.call(o);
-    if (o && typeof o.length === "number") return {
-        next: function () {
-            if (o && i >= o.length) o = void 0;
-            return { value: o && o[i++], done: !o };
-        }
-    };
-    throw new TypeError(s ? "Object is not iterable." : "Symbol.iterator is not defined.");
-};
-var __read = (this && this.__read) || function (o, n) {
-    var m = typeof Symbol === "function" && o[Symbol.iterator];
-    if (!m) return o;
-    var i = m.call(o), r, ar = [], e;
-    try {
-        while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);
-    }
-    catch (error) { e = { error: error }; }
-    finally {
-        try {
-            if (r && !r.done && (m = i["return"])) m.call(i);
-        }
-        finally { if (e) throw e.error; }
-    }
-    return ar;
-};
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.DoublyLinkedList = exports.DoublyLinkedListNode = void 0;
 /**
@@ -35,116 +8,80 @@ exports.DoublyLinkedList = exports.DoublyLinkedListNode = void 0;
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-var DoublyLinkedListNode = /** @class */ (function () {
+class DoublyLinkedListNode {
     /**
      * The constructor function initializes the value, next, and previous properties of an object.
      * @param {T} val - The "val" 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 "T".
      */
-    function DoublyLinkedListNode(val) {
+    constructor(val) {
         this._val = val;
         this._next = null;
         this._prev = null;
     }
-    Object.defineProperty(DoublyLinkedListNode.prototype, "val", {
-        get: function () {
-            return this._val;
-        },
-        set: function (value) {
-            this._val = value;
-        },
-        enumerable: false,
-        configurable: true
-    });
-    Object.defineProperty(DoublyLinkedListNode.prototype, "next", {
-        get: function () {
-            return this._next;
-        },
-        set: function (value) {
-            this._next = value;
-        },
-        enumerable: false,
-        configurable: true
-    });
-    Object.defineProperty(DoublyLinkedListNode.prototype, "prev", {
-        get: function () {
-            return this._prev;
-        },
-        set: function (value) {
-            this._prev = value;
-        },
-        enumerable: false,
-        configurable: true
-    });
-    return DoublyLinkedListNode;
-}());
+    get val() {
+        return this._val;
+    }
+    set val(value) {
+        this._val = value;
+    }
+    get next() {
+        return this._next;
+    }
+    set next(value) {
+        this._next = value;
+    }
+    get prev() {
+        return this._prev;
+    }
+    set prev(value) {
+        this._prev = value;
+    }
+}
 exports.DoublyLinkedListNode = DoublyLinkedListNode;
-var DoublyLinkedList = /** @class */ (function () {
+class DoublyLinkedList {
     /**
      * The constructor initializes the linked list with an empty head, tail, and length.
      */
-    function DoublyLinkedList() {
+    constructor() {
         this._head = null;
         this._tail = null;
         this._length = 0;
     }
-    Object.defineProperty(DoublyLinkedList.prototype, "head", {
-        get: function () {
-            return this._head;
-        },
-        set: function (value) {
-            this._head = value;
-        },
-        enumerable: false,
-        configurable: true
-    });
-    Object.defineProperty(DoublyLinkedList.prototype, "tail", {
-        get: function () {
-            return this._tail;
-        },
-        set: function (value) {
-            this._tail = value;
-        },
-        enumerable: false,
-        configurable: true
-    });
-    Object.defineProperty(DoublyLinkedList.prototype, "length", {
-        get: function () {
-            return this._length;
-        },
-        enumerable: false,
-        configurable: true
-    });
+    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;
+    }
     /**
      * The `fromArray` function creates a new instance of a DoublyLinkedList and populates it with the elements from the
      * given array.
      * @param {T[]} data - The `data` parameter is an array of elements of type `T`.
      * @returns The `fromArray` function returns a DoublyLinkedList object.
      */
-    DoublyLinkedList.fromArray = function (data) {
-        var e_1, _a;
-        var doublyLinkedList = new DoublyLinkedList();
-        try {
-            for (var data_1 = __values(data), data_1_1 = data_1.next(); !data_1_1.done; data_1_1 = data_1.next()) {
-                var item = data_1_1.value;
-                doublyLinkedList.push(item);
-            }
-        }
-        catch (e_1_1) { e_1 = { error: e_1_1 }; }
-        finally {
-            try {
-                if (data_1_1 && !data_1_1.done && (_a = data_1.return)) _a.call(data_1);
-            }
-            finally { if (e_1) throw e_1.error; }
+    static fromArray(data) {
+        const doublyLinkedList = new DoublyLinkedList();
+        for (const item of data) {
+            doublyLinkedList.push(item);
         }
         return doublyLinkedList;
-    };
+    }
     /**
      * The push function adds a new node with the given value to the end of the doubly linked list.
      * @param {T} val - The value to be added to the linked list.
      */
-    DoublyLinkedList.prototype.push = function (val) {
-        var newNode = new DoublyLinkedListNode(val);
+    push(val) {
+        const newNode = new DoublyLinkedListNode(val);
         if (!this.head) {
             this.head = newNode;
             this.tail = newNode;
@@ -155,16 +92,16 @@ var DoublyLinkedList = /** @class */ (function () {
             this.tail = newNode;
         }
         this._length++;
-    };
+    }
     /**
      * 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
      * list is empty, it returns null.
      */
-    DoublyLinkedList.prototype.pop = function () {
+    pop() {
         if (!this.tail)
             return null;
-        var removedNode = this.tail;
+        const removedNode = this.tail;
         if (this.head === this.tail) {
             this.head = null;
             this.tail = null;
@@ -175,16 +112,16 @@ var DoublyLinkedList = /** @class */ (function () {
         }
         this._length--;
         return removedNode.val;
-    };
+    }
     /**
      * The `shift()` function removes and returns the value of the first node in a doubly linked list.
      * @returns The method `shift()` returns the value of the node that is removed from the beginning of the doubly linked
      * list.
      */
-    DoublyLinkedList.prototype.shift = function () {
+    shift() {
         if (!this.head)
             return null;
-        var removedNode = this.head;
+        const removedNode = this.head;
         if (this.head === this.tail) {
             this.head = null;
             this.tail = null;
@@ -195,14 +132,14 @@ var DoublyLinkedList = /** @class */ (function () {
         }
         this._length--;
         return removedNode.val;
-    };
+    }
     /**
      * The unshift function adds a new node with the given value to the beginning of a doubly linked list.
      * @param {T} val - The `val` parameter represents the value of the new node that will be added to the beginning of the
      * doubly linked list.
      */
-    DoublyLinkedList.prototype.unshift = function (val) {
-        var newNode = new DoublyLinkedListNode(val);
+    unshift(val) {
+        const newNode = new DoublyLinkedListNode(val);
         if (!this.head) {
             this.head = newNode;
             this.tail = newNode;
@@ -213,7 +150,7 @@ var DoublyLinkedList = /** @class */ (function () {
             this.head = newNode;
         }
         this._length++;
-    };
+    }
     /**
      * The `getAt` function returns the value at a specified index in a linked list, or null if the index is out of bounds.
      * @param {number} index - The index parameter is a number that represents the position of the element we want to
@@ -221,15 +158,15 @@ var DoublyLinkedList = /** @class */ (function () {
      * @returns The method is returning the value at the specified index in the linked list. If the index is out of bounds
      * or the linked list is empty, it will return null.
      */
-    DoublyLinkedList.prototype.getAt = function (index) {
+    getAt(index) {
         if (index < 0 || index >= this.length)
             return null;
-        var current = this.head;
-        for (var i = 0; i < index; i++) {
+        let current = this.head;
+        for (let i = 0; i < index; i++) {
             current = current.next;
         }
         return current.val;
-    };
+    }
     /**
      * The function `getNodeAt` returns the node at a given index in a doubly linked list, or null if the index is out of
      * range.
@@ -238,15 +175,15 @@ var DoublyLinkedList = /** @class */ (function () {
      * @returns The method `getNodeAt(index: number)` returns a `DoublyLinkedListNode<T>` object if the index is within the
      * valid range of the linked list, otherwise it returns `null`.
      */
-    DoublyLinkedList.prototype.getNodeAt = function (index) {
+    getNodeAt(index) {
         if (index < 0 || index >= this.length)
             return null;
-        var current = this.head;
-        for (var i = 0; i < index; i++) {
+        let current = this.head;
+        for (let i = 0; i < index; i++) {
             current = current.next;
         }
         return current;
-    };
+    }
     /**
      * 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.
@@ -254,8 +191,8 @@ var DoublyLinkedList = /** @class */ (function () {
      * @returns The function `findNodeByValue` returns a `DoublyLinkedListNode<T>` if a node with the specified value `val`
      * is found in the linked list. If no such node is found, it returns `null`.
      */
-    DoublyLinkedList.prototype.findNode = function (val) {
-        var current = this.head;
+    findNode(val) {
+        let current = this.head;
         while (current) {
             if (current.val === val) {
                 return current;
@@ -263,7 +200,7 @@ var DoublyLinkedList = /** @class */ (function () {
             current = current.next;
         }
         return null;
-    };
+    }
     /**
      * 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
@@ -273,7 +210,7 @@ var DoublyLinkedList = /** @class */ (function () {
      * @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.
      */
-    DoublyLinkedList.prototype.insertAt = function (index, val) {
+    insertAt(index, val) {
         if (index < 0 || index > this.length)
             return false;
         if (index === 0) {
@@ -284,16 +221,16 @@ var DoublyLinkedList = /** @class */ (function () {
             this.push(val);
             return true;
         }
-        var newNode = new DoublyLinkedListNode(val);
-        var prevNode = this.getNodeAt(index - 1);
-        var nextNode = prevNode.next;
+        const newNode = new DoublyLinkedListNode(val);
+        const prevNode = this.getNodeAt(index - 1);
+        const nextNode = prevNode.next;
         newNode.prev = prevNode;
         newNode.next = nextNode;
         prevNode.next = newNode;
         nextNode.prev = newNode;
         this._length++;
         return true;
-    };
+    }
     /**
      * 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
@@ -301,21 +238,21 @@ var DoublyLinkedList = /** @class */ (function () {
      * @returns The method `deleteAt` returns the value of the node that was deleted, or `null` if the index is out of
      * bounds.
      */
-    DoublyLinkedList.prototype.deleteAt = function (index) {
+    deleteAt(index) {
         if (index < 0 || index >= this.length)
             return null;
         if (index === 0)
             return this.shift();
         if (index === this.length - 1)
             return this.pop();
-        var removedNode = this.getNodeAt(index);
-        var prevNode = removedNode.prev;
-        var nextNode = removedNode.next;
+        const removedNode = this.getNodeAt(index);
+        const prevNode = removedNode.prev;
+        const nextNode = removedNode.next;
         prevNode.next = nextNode;
         nextNode.prev = prevNode;
         this._length--;
         return removedNode.val;
-    };
+    }
     /**
      * The `delete` function removes a node from a doubly linked list based on either the node itself or its value.
      * @param {T | DoublyLinkedListNode<T>} valOrNode - The `valOrNode` parameter can accept either a value of type `T` or
@@ -323,8 +260,8 @@ var DoublyLinkedList = /** @class */ (function () {
      * @returns The `delete` method returns a boolean value. It returns `true` if the value or node was successfully
      * deleted from the doubly linked list, and `false` if the value or node was not found in the list.
      */
-    DoublyLinkedList.prototype.delete = function (valOrNode) {
-        var node;
+    delete(valOrNode) {
+        let node;
         if (valOrNode instanceof DoublyLinkedListNode) {
             node = valOrNode;
         }
@@ -339,8 +276,8 @@ var DoublyLinkedList = /** @class */ (function () {
                 this.pop();
             }
             else {
-                var prevNode = node.prev;
-                var nextNode = node.next;
+                const prevNode = node.prev;
+                const nextNode = node.next;
                 prevNode.next = nextNode;
                 nextNode.prev = prevNode;
                 this._length--;
@@ -348,28 +285,28 @@ var DoublyLinkedList = /** @class */ (function () {
             return true;
         }
         return false;
-    };
+    }
     /**
      * The `toArray` function converts a linked list into an array.
      * @returns The `toArray()` method is returning an array of type `T[]`.
      */
-    DoublyLinkedList.prototype.toArray = function () {
-        var array = [];
-        var current = this.head;
+    toArray() {
+        const array = [];
+        let current = this.head;
         while (current) {
             array.push(current.val);
             current = current.next;
         }
         return array;
-    };
+    }
     /**
      * The `clear` function resets the linked list by setting the head, tail, and length to null and 0 respectively.
      */
-    DoublyLinkedList.prototype.clear = function () {
+    clear() {
         this._head = null;
         this._tail = null;
         this._length = 0;
-    };
+    }
     /**
      * The `find` function iterates through a linked list and returns the first element that satisfies a given condition.
      * @param callback - A function that takes a value of type T as its parameter and returns a boolean value. This
@@ -377,8 +314,8 @@ var DoublyLinkedList = /** @class */ (function () {
      * @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`.
      */
-    DoublyLinkedList.prototype.find = function (callback) {
-        var current = this.head;
+    find(callback) {
+        let current = this.head;
         while (current) {
             if (callback(current.val)) {
                 return current.val;
@@ -386,7 +323,7 @@ var DoublyLinkedList = /** @class */ (function () {
             current = current.next;
         }
         return null;
-    };
+    }
     /**
      * The function returns the index of the first occurrence of a given value in a linked list.
      * @param {T} val - The parameter `val` is of type `T`, which means it can be any data type. It represents the value
@@ -394,9 +331,9 @@ var DoublyLinkedList = /** @class */ (function () {
      * @returns The method `indexOf` returns the index of the first occurrence of the specified value `val` in the linked
      * list. If the value is not found, it returns -1.
      */
-    DoublyLinkedList.prototype.indexOf = function (val) {
-        var index = 0;
-        var current = this.head;
+    indexOf(val) {
+        let index = 0;
+        let current = this.head;
         while (current) {
             if (current.val === val) {
                 return index;
@@ -405,7 +342,7 @@ var DoublyLinkedList = /** @class */ (function () {
             current = current.next;
         }
         return -1;
-    };
+    }
     /**
      * The `findLast` function iterates through a linked list from the last node to the first node and returns the last
      * value that satisfies the given callback function, or null if no value satisfies the callback.
@@ -414,8 +351,8 @@ var DoublyLinkedList = /** @class */ (function () {
      * @returns The method `findLast` returns the last value in the linked list that satisfies the condition specified by
      * the callback function. If no value satisfies the condition, it returns `null`.
      */
-    DoublyLinkedList.prototype.findLast = function (callback) {
-        var current = this.tail;
+    findLast(callback) {
+        let current = this.tail;
         while (current) {
             if (callback(current.val)) {
                 return current.val;
@@ -423,48 +360,47 @@ var DoublyLinkedList = /** @class */ (function () {
             current = current.prev;
         }
         return null;
-    };
+    }
     /**
      * The `toArrayReverse` function converts a doubly linked list into an array in reverse order.
      * @returns The `toArrayReverse()` function returns an array of type `T[]`.
      */
-    DoublyLinkedList.prototype.toArrayReverse = function () {
-        var array = [];
-        var current = this.tail;
+    toArrayReverse() {
+        const array = [];
+        let current = this.tail;
         while (current) {
             array.push(current.val);
             current = current.prev;
         }
         return array;
-    };
+    }
     /**
      * The `reverse` function reverses the order of the elements in a doubly linked list.
      */
-    DoublyLinkedList.prototype.reverse = function () {
-        var _a, _b;
-        var current = this.head;
-        _a = __read([this.tail, this.head], 2), this.head = _a[0], this.tail = _a[1];
+    reverse() {
+        let current = this.head;
+        [this.head, this.tail] = [this.tail, this.head];
         while (current) {
-            var next = current.next;
-            _b = __read([current.next, current.prev], 2), current.prev = _b[0], current.next = _b[1];
+            const next = current.next;
+            [current.prev, current.next] = [current.next, current.prev];
             current = next;
         }
-    };
+    }
     /**
      * 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
      * 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.
      */
-    DoublyLinkedList.prototype.forEach = function (callback) {
-        var current = this.head;
-        var index = 0;
+    forEach(callback) {
+        let current = this.head;
+        let index = 0;
         while (current) {
             callback(current.val, index);
             current = current.next;
             index++;
         }
-    };
+    }
     /**
      * The `map` function takes a callback function and applies it to each element in the DoublyLinkedList, returning a new
      * DoublyLinkedList with the transformed values.
@@ -473,15 +409,15 @@ var DoublyLinkedList = /** @class */ (function () {
      * DoublyLinkedList).
      * @returns The `map` function is returning a new instance of `DoublyLinkedList<U>` that contains the mapped values.
      */
-    DoublyLinkedList.prototype.map = function (callback) {
-        var mappedList = new DoublyLinkedList();
-        var current = this.head;
+    map(callback) {
+        const mappedList = new DoublyLinkedList();
+        let current = this.head;
         while (current) {
             mappedList.push(callback(current.val));
             current = current.next;
         }
         return mappedList;
-    };
+    }
     /**
      * The `filter` function iterates through a DoublyLinkedList and returns a new DoublyLinkedList containing only the
      * elements that satisfy the given callback function.
@@ -489,9 +425,9 @@ var DoublyLinkedList = /** @class */ (function () {
      * 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 DoublyLinkedList class.
      */
-    DoublyLinkedList.prototype.filter = function (callback) {
-        var filteredList = new DoublyLinkedList();
-        var current = this.head;
+    filter(callback) {
+        const filteredList = new DoublyLinkedList();
+        let current = this.head;
         while (current) {
             if (callback(current.val)) {
                 filteredList.push(current.val);
@@ -499,7 +435,7 @@ var DoublyLinkedList = /** @class */ (function () {
             current = current.next;
         }
         return filteredList;
-    };
+    }
     /**
      * The `reduce` function iterates over a linked list and applies a callback function to each element, accumulating a
      * single value.
@@ -510,15 +446,15 @@ var DoublyLinkedList = /** @class */ (function () {
      * @returns The `reduce` method is returning the final value of the accumulator after iterating through all the
      * elements in the linked list.
      */
-    DoublyLinkedList.prototype.reduce = function (callback, initialValue) {
-        var accumulator = initialValue;
-        var current = this.head;
+    reduce(callback, initialValue) {
+        let accumulator = initialValue;
+        let current = this.head;
         while (current) {
             accumulator = callback(accumulator, current.val);
             current = current.next;
         }
         return accumulator;
-    };
+    }
     /**
      * The `insertAfter` function inserts a new node with a given value after an existing node in a doubly linked list.
      * @param {T | DoublyLinkedListNode<T>} existingValueOrNode - The existing value or node in the doubly linked list
@@ -528,8 +464,8 @@ var DoublyLinkedList = /** @class */ (function () {
      * @returns The method returns a boolean value. It returns true if the insertion is successful, and false if the
      * existing value or node is not found in the doubly linked list.
      */
-    DoublyLinkedList.prototype.insertAfter = function (existingValueOrNode, newValue) {
-        var existingNode;
+    insertAfter(existingValueOrNode, newValue) {
+        let existingNode;
         if (existingValueOrNode instanceof DoublyLinkedListNode) {
             existingNode = existingValueOrNode;
         }
@@ -537,7 +473,7 @@ var DoublyLinkedList = /** @class */ (function () {
             existingNode = this.findNode(existingValueOrNode);
         }
         if (existingNode) {
-            var newNode = new DoublyLinkedListNode(newValue);
+            const newNode = new DoublyLinkedListNode(newValue);
             newNode.next = existingNode.next;
             if (existingNode.next) {
                 existingNode.next.prev = newNode;
@@ -551,7 +487,7 @@ var DoublyLinkedList = /** @class */ (function () {
             return true;
         }
         return false;
-    };
+    }
     /**
      * The `insertBefore` function inserts a new value before an existing value or node in a doubly linked list.
      * @param {T | DoublyLinkedListNode<T>} existingValueOrNode - The existing value or node in the doubly linked list
@@ -562,8 +498,8 @@ var DoublyLinkedList = /** @class */ (function () {
      * @returns The method returns a boolean value. It returns `true` if the insertion is successful, and `false` if the
      * insertion fails.
      */
-    DoublyLinkedList.prototype.insertBefore = function (existingValueOrNode, newValue) {
-        var existingNode;
+    insertBefore(existingValueOrNode, newValue) {
+        let existingNode;
         if (existingValueOrNode instanceof DoublyLinkedListNode) {
             existingNode = existingValueOrNode;
         }
@@ -571,7 +507,7 @@ var DoublyLinkedList = /** @class */ (function () {
             existingNode = this.findNode(existingValueOrNode);
         }
         if (existingNode) {
-            var newNode = new DoublyLinkedListNode(newValue);
+            const newNode = new DoublyLinkedListNode(newValue);
             newNode.prev = existingNode.prev;
             if (existingNode.prev) {
                 existingNode.prev.next = newNode;
@@ -585,7 +521,6 @@ var DoublyLinkedList = /** @class */ (function () {
             return true;
         }
         return false;
-    };
-    return DoublyLinkedList;
-}());
+    }
+}
 exports.DoublyLinkedList = DoublyLinkedList;