data-structure-typed 1.19.3 → 1.19.4

package/dist/data-structures/linked-list/singly-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.SinglyLinkedList = exports.SinglyLinkedListNode = void 0;
 /**
@@ -35,109 +8,77 @@ exports.SinglyLinkedList = exports.SinglyLinkedListNode = void 0;
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-var SinglyLinkedListNode = /** @class */ (function () {
+class SinglyLinkedListNode {
     /**
      * The constructor function initializes an instance of a class with a given value and sets the next property to null.
      * @param {T} val - The "val" parameter is of type T, which means it can be any data type. It represents the value that
      * will be stored in the node of a linked list.
      */
-    function SinglyLinkedListNode(val) {
+    constructor(val) {
         this._val = val;
         this._next = null;
     }
-    Object.defineProperty(SinglyLinkedListNode.prototype, "val", {
-        get: function () {
-            return this._val;
-        },
-        set: function (value) {
-            this._val = value;
-        },
-        enumerable: false,
-        configurable: true
-    });
-    Object.defineProperty(SinglyLinkedListNode.prototype, "next", {
-        get: function () {
-            return this._next;
-        },
-        set: function (value) {
-            this._next = value;
-        },
-        enumerable: false,
-        configurable: true
-    });
-    return SinglyLinkedListNode;
-}());
+    get val() {
+        return this._val;
+    }
+    set val(value) {
+        this._val = value;
+    }
+    get next() {
+        return this._next;
+    }
+    set next(value) {
+        this._next = value;
+    }
+}
 exports.SinglyLinkedListNode = SinglyLinkedListNode;
-var SinglyLinkedList = /** @class */ (function () {
+class SinglyLinkedList {
     /**
      * The constructor initializes the linked list with an empty head, tail, and length.
      */
-    function SinglyLinkedList() {
+    constructor() {
         this._head = null;
         this._tail = null;
         this._length = 0;
     }
-    Object.defineProperty(SinglyLinkedList.prototype, "head", {
-        get: function () {
-            return this._head;
-        },
-        set: function (value) {
-            this._head = value;
-        },
-        enumerable: false,
-        configurable: true
-    });
-    Object.defineProperty(SinglyLinkedList.prototype, "tail", {
-        get: function () {
-            return this._tail;
-        },
-        set: function (value) {
-            this._tail = value;
-        },
-        enumerable: false,
-        configurable: true
-    });
-    Object.defineProperty(SinglyLinkedList.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 SinglyLinkedList instance 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 `SinglyLinkedList` object.
      */
-    SinglyLinkedList.fromArray = function (data) {
-        var e_1, _a;
-        var singlyLinkedList = new SinglyLinkedList();
-        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;
-                singlyLinkedList.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 singlyLinkedList = new SinglyLinkedList();
+        for (const item of data) {
+            singlyLinkedList.push(item);
         }
         return singlyLinkedList;
-    };
-    SinglyLinkedList.prototype.getLength = function () {
+    }
+    getLength() {
         return this._length;
-    };
+    }
     /**
      * The `push` function adds a new node with the given data to the end of a singly linked list.
      * @param {T} data - The "data" parameter represents the value that you want to add to the linked list. It can be of
      * any type (T) as specified in the generic type declaration of the class or function.
      */
-    SinglyLinkedList.prototype.push = function (data) {
-        var newNode = new SinglyLinkedListNode(data);
+    push(data) {
+        const newNode = new SinglyLinkedListNode(data);
         if (!this.head) {
             this.head = newNode;
             this.tail = newNode;
@@ -147,52 +88,52 @@ var SinglyLinkedList = /** @class */ (function () {
             this.tail = newNode;
         }
         this._length++;
-    };
+    }
     /**
      * The `pop()` function removes and returns the value of the last element in a linked list, updating the head and tail
      * pointers accordingly.
      * @returns The method `pop()` returns the value of the node that is being removed from the end of the linked list. If
      * the linked list is empty, it returns `null`.
      */
-    SinglyLinkedList.prototype.pop = function () {
+    pop() {
         if (!this.head)
             return null;
         if (this.head === this.tail) {
-            var val_1 = this.head.val;
+            const val = this.head.val;
             this.head = null;
             this.tail = null;
             this._length--;
-            return val_1;
+            return val;
         }
-        var current = this.head;
+        let current = this.head;
         while (current.next !== this.tail) {
             current = current.next;
         }
-        var val = this.tail.val;
+        const val = this.tail.val;
         current.next = null;
         this.tail = current;
         this._length--;
         return val;
-    };
+    }
     /**
      * The `shift()` function removes and returns the value of the first node in a linked list.
      * @returns The value of the node that is being removed from the beginning of the linked list.
      */
-    SinglyLinkedList.prototype.shift = function () {
+    shift() {
         if (!this.head)
             return null;
-        var removedNode = this.head;
+        const removedNode = this.head;
         this.head = this.head.next;
         this._length--;
         return removedNode.val;
-    };
+    }
     /**
      * The unshift function adds a new node with the given value to the beginning of a singly linked list.
      * @param {T} val - The parameter "val" represents the value of the new node that will be added to the beginning of the
      * linked list.
      */
-    SinglyLinkedList.prototype.unshift = function (val) {
-        var newNode = new SinglyLinkedListNode(val);
+    unshift(val) {
+        const newNode = new SinglyLinkedListNode(val);
         if (!this.head) {
             this.head = newNode;
             this.tail = newNode;
@@ -202,7 +143,7 @@ var SinglyLinkedList = /** @class */ (function () {
             this.head = newNode;
         }
         this._length++;
-    };
+    }
     /**
      * 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
@@ -210,15 +151,15 @@ var SinglyLinkedList = /** @class */ (function () {
      * @returns The method `getAt(index: number): T | null` returns the value at the specified index in the linked list, or
      * `null` if the index is out of bounds.
      */
-    SinglyLinkedList.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 singly linked list.
      * @param {number} index - The `index` parameter is a number that represents the position of the node we want to
@@ -226,13 +167,13 @@ var SinglyLinkedList = /** @class */ (function () {
      * @returns The method `getNodeAt(index: number)` returns a `SinglyLinkedListNode<T>` object if the node at the
      * specified index exists, or `null` if the index is out of bounds.
      */
-    SinglyLinkedList.prototype.getNodeAt = function (index) {
-        var current = this.head;
-        for (var i = 0; i < index; i++) {
+    getNodeAt(index) {
+        let current = this.head;
+        for (let i = 0; i < index; i++) {
             current = current.next;
         }
         return current;
-    };
+    }
     /**
      * 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
@@ -240,19 +181,19 @@ var SinglyLinkedList = /** @class */ (function () {
      * @returns The method `deleteAt` returns the value of the node that was deleted, or `null` if the index is out of
      * bounds.
      */
-    SinglyLinkedList.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 prevNode = this.getNodeAt(index - 1);
-        var removedNode = prevNode.next;
+        const prevNode = this.getNodeAt(index - 1);
+        const removedNode = prevNode.next;
         prevNode.next = removedNode.next;
         this._length--;
         return removedNode.val;
-    };
+    }
     /**
      * The delete function removes a node with a specific value from a singly linked list.
      * @param {T | SinglyLinkedListNode<T>} valueOrNode - The `valueOrNode` parameter can accept either a value of type `T`
@@ -260,15 +201,15 @@ var SinglyLinkedList = /** @class */ (function () {
      * @returns The `delete` method returns a boolean value. It returns `true` if the value or node is found and
      * successfully deleted from the linked list, and `false` if the value or node is not found in the linked list.
      */
-    SinglyLinkedList.prototype.delete = function (valueOrNode) {
-        var value;
+    delete(valueOrNode) {
+        let value;
         if (valueOrNode instanceof SinglyLinkedListNode) {
             value = valueOrNode.val;
         }
         else {
             value = valueOrNode;
         }
-        var current = this.head, prev = null;
+        let current = this.head, prev = null;
         while (current) {
             if (current.val === value) {
                 if (prev === null) {
@@ -290,7 +231,7 @@ var SinglyLinkedList = /** @class */ (function () {
             current = current.next;
         }
         return false;
-    };
+    }
     /**
      * 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
@@ -300,7 +241,7 @@ var SinglyLinkedList = /** @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.
      */
-    SinglyLinkedList.prototype.insertAt = function (index, val) {
+    insertAt(index, val) {
         if (index < 0 || index > this.length)
             return false;
         if (index === 0) {
@@ -311,61 +252,60 @@ var SinglyLinkedList = /** @class */ (function () {
             this.push(val);
             return true;
         }
-        var newNode = new SinglyLinkedListNode(val);
-        var prevNode = this.getNodeAt(index - 1);
+        const newNode = new SinglyLinkedListNode(val);
+        const prevNode = this.getNodeAt(index - 1);
         newNode.next = prevNode.next;
         prevNode.next = newNode;
         this._length++;
         return true;
-    };
+    }
     /**
      * 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.
      * @returns A boolean value indicating whether the length of the object is equal to 0.
      */
-    SinglyLinkedList.prototype.isEmpty = function () {
+    isEmpty() {
         return this.length === 0;
-    };
+    }
     /**
      * The `clear` function resets the linked list by setting the head, tail, and length to null and 0 respectively.
      */
-    SinglyLinkedList.prototype.clear = function () {
+    clear() {
         this._head = null;
         this._tail = null;
         this._length = 0;
-    };
+    }
     /**
      * The `toArray` function converts a linked list into an array.
      * @returns The `toArray()` method is returning an array of type `T[]`.
      */
-    SinglyLinkedList.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 `reverse` function reverses the order of the nodes in a singly linked list.
      * @returns The reverse() method does not return anything. It has a return type of void.
      */
-    SinglyLinkedList.prototype.reverse = function () {
-        var _a;
+    reverse() {
         if (!this.head || this.head === this.tail)
             return;
-        var prev = null;
-        var current = this.head;
-        var next = null;
+        let prev = null;
+        let current = this.head;
+        let next = null;
         while (current) {
             next = current.next;
             current.next = prev;
             prev = current;
             current = next;
         }
-        _a = __read([this.tail, this.head], 2), this.head = _a[0], this.tail = _a[1];
-    };
+        [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.
      * @param callback - A function that takes a value of type T as its parameter and returns a boolean value. This
@@ -373,8 +313,8 @@ var SinglyLinkedList = /** @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`.
      */
-    SinglyLinkedList.prototype.find = function (callback) {
-        var current = this.head;
+    find(callback) {
+        let current = this.head;
         while (current) {
             if (callback(current.val)) {
                 return current.val;
@@ -382,16 +322,16 @@ var SinglyLinkedList = /** @class */ (function () {
             current = current.next;
         }
         return null;
-    };
+    }
     /**
      * The `indexOf` function returns the index of the first occurrence of a given value in a linked list.
      * @param {T} value - The value parameter is the value that you want to find the index of in the linked list.
      * @returns The method is returning the index of the first occurrence of the specified value in the linked list. If the
      * value is not found, it returns -1.
      */
-    SinglyLinkedList.prototype.indexOf = function (value) {
-        var index = 0;
-        var current = this.head;
+    indexOf(value) {
+        let index = 0;
+        let current = this.head;
         while (current) {
             if (current.val === value) {
                 return index;
@@ -400,7 +340,7 @@ var SinglyLinkedList = /** @class */ (function () {
             current = current.next;
         }
         return -1;
-    };
+    }
     /**
      * The function finds a node in a singly linked list by its value and returns the node if found, otherwise returns
      * null.
@@ -408,8 +348,8 @@ var SinglyLinkedList = /** @class */ (function () {
      * @returns a `SinglyLinkedListNode<T>` if a node with the specified value is found in the linked list. If no node with
      * the specified value is found, the function returns `null`.
      */
-    SinglyLinkedList.prototype.findNode = function (value) {
-        var current = this.head;
+    findNode(value) {
+        let current = this.head;
         while (current) {
             if (current.val === value) {
                 return current;
@@ -417,7 +357,7 @@ var SinglyLinkedList = /** @class */ (function () {
             current = current.next;
         }
         return null;
-    };
+    }
     /**
      * The `insertBefore` function inserts a new value before an existing value in a singly linked list.
      * @param {T | SinglyLinkedListNode<T>} existingValueOrNode - The existing value or node that you want to insert the
@@ -426,10 +366,10 @@ var SinglyLinkedList = /** @class */ (function () {
      * @returns The method `insertBefore` returns a boolean value. It returns `true` if the new value was successfully
      * inserted before the existing value, and `false` otherwise.
      */
-    SinglyLinkedList.prototype.insertBefore = function (existingValueOrNode, newValue) {
+    insertBefore(existingValueOrNode, newValue) {
         if (!this.head)
             return false;
-        var existingValue;
+        let existingValue;
         if (existingValueOrNode instanceof SinglyLinkedListNode) {
             existingValue = existingValueOrNode.val;
         }
@@ -440,10 +380,10 @@ var SinglyLinkedList = /** @class */ (function () {
             this.unshift(newValue);
             return true;
         }
-        var current = this.head;
+        let current = this.head;
         while (current.next) {
             if (current.next.val === existingValue) {
-                var newNode = new SinglyLinkedListNode(newValue);
+                const newNode = new SinglyLinkedListNode(newValue);
                 newNode.next = current.next;
                 current.next = newNode;
                 this._length++;
@@ -452,7 +392,7 @@ var SinglyLinkedList = /** @class */ (function () {
             current = current.next;
         }
         return false;
-    };
+    }
     /**
      * The `insertAfter` function inserts a new node with a given value after an existing node in a singly linked list.
      * @param {T | SinglyLinkedListNode<T>} existingValueOrNode - The existing value or node in the linked list after which
@@ -461,8 +401,8 @@ var SinglyLinkedList = /** @class */ (function () {
      * @returns The method returns a boolean value. It returns true if the new value was successfully inserted after the
      * existing value or node, and false if the existing value or node was not found in the linked list.
      */
-    SinglyLinkedList.prototype.insertAfter = function (existingValueOrNode, newValue) {
-        var existingNode;
+    insertAfter(existingValueOrNode, newValue) {
+        let existingNode;
         if (existingValueOrNode instanceof SinglyLinkedListNode) {
             existingNode = existingValueOrNode;
         }
@@ -470,7 +410,7 @@ var SinglyLinkedList = /** @class */ (function () {
             existingNode = this.findNode(existingValueOrNode);
         }
         if (existingNode) {
-            var newNode = new SinglyLinkedListNode(newValue);
+            const newNode = new SinglyLinkedListNode(newValue);
             newNode.next = existingNode.next;
             existingNode.next = newNode;
             if (existingNode === this.tail) {
@@ -480,15 +420,15 @@ var SinglyLinkedList = /** @class */ (function () {
             return true;
         }
         return false;
-    };
+    }
     /**
      * The function counts the number of occurrences of a given value in a linked list.
      * @param {T} value - The value parameter is the value that you want to count the occurrences of in the linked list.
      * @returns The count of occurrences of the given value in the linked list.
      */
-    SinglyLinkedList.prototype.countOccurrences = function (value) {
-        var count = 0;
-        var current = this.head;
+    countOccurrences(value) {
+        let count = 0;
+        let current = this.head;
         while (current) {
             if (current.val === value) {
                 count++;
@@ -496,7 +436,6 @@ var SinglyLinkedList = /** @class */ (function () {
             current = current.next;
         }
         return count;
-    };
-    return SinglyLinkedList;
-}());
+    }
+}
 exports.SinglyLinkedList = SinglyLinkedList;

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

@@ -1,9 +1,6 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.SkipLinkedList = void 0;
-var SkipLinkedList = /** @class */ (function () {
-    function SkipLinkedList() {
-    }
-    return SkipLinkedList;
-}());
+class SkipLinkedList {
+}
 exports.SkipLinkedList = SkipLinkedList;

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

@@ -9,21 +9,20 @@ exports.MatrixNTI2D = void 0;
  * @license MIT License
  */
 // todo need to be improved
-var MatrixNTI2D = /** @class */ (function () {
+class MatrixNTI2D {
     /**
      * The constructor creates a matrix with the specified number of rows and columns, and initializes all elements to a
      * given initial value or 0 if not provided.
      * @param options - An object containing the following properties:
      */
-    function MatrixNTI2D(options) {
-        var row = options.row, col = options.col, initialVal = options.initialVal;
-        this._matrix = new Array(row).fill(undefined).map(function () { return new Array(col).fill(initialVal || 0); });
+    constructor(options) {
+        const { row, col, initialVal } = options;
+        this._matrix = new Array(row).fill(undefined).map(() => new Array(col).fill(initialVal || 0));
     }
     /* The `toArray` method returns the matrix as a two-dimensional array. It converts the internal representation of the
     matrix, which is an array of arrays, into a format that is more commonly used in JavaScript. */
-    MatrixNTI2D.prototype.toArray = function () {
+    toArray() {
         return this._matrix;
-    };
-    return MatrixNTI2D;
-}());
+    }
+}
 exports.MatrixNTI2D = MatrixNTI2D;