data-structure-typed 0.9.16 → 1.3.0

package/dist/data-structures/heap/min-heap.js

@@ -1,40 +1,31 @@
 "use strict";
 /**
- * @copyright 2020 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
  */
-var __extends = (this && this.__extends) || (function () {
-    var extendStatics = function (d, b) {
-        extendStatics = Object.setPrototypeOf ||
-            ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
-            function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };
-        return extendStatics(d, b);
-    };
-    return function (d, b) {
-        if (typeof b !== "function" && b !== null)
-            throw new TypeError("Class extends value " + String(b) + " is not a constructor or null");
-        extendStatics(d, b);
-        function __() { this.constructor = d; }
-        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
-    };
-})();
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.MinHeap = void 0;
-var heap_1 = require("./heap");
-var priority_queue_1 = require("../priority-queue");
+const heap_1 = require("./heap");
+const priority_queue_1 = require("../priority-queue");
 /**
  * @class MinHeap
  * @extends Heap
  */
-var MinHeap = /** @class */ (function (_super) {
-    __extends(MinHeap, _super);
-    function MinHeap(options) {
-        var _this = _super.call(this, options) || this;
-        _this._pq = new priority_queue_1.PriorityQueue({
-            comparator: function (a, b) { return a.priority - b.priority; }
+class MinHeap extends heap_1.Heap {
+    /**
+     * The constructor initializes a PriorityQueue with a comparator function that compares the priority of two HeapItem
+     * objects.
+     * @param [options] - The `options` parameter is an optional object that can be passed to the constructor. It is of
+     * type `HeapOptions<T>`, which is a generic type that represents the options for the heap.
+     */
+    constructor(options) {
+        super(options);
+        this._pq = new priority_queue_1.PriorityQueue({
+            comparator: (a, b) => a.priority - b.priority
         });
-        return _this;
     }
-    return MinHeap;
-}(heap_1.Heap));
+}
 exports.MinHeap = MinHeap;

package/dist/data-structures/index.d.ts

@@ -4,8 +4,8 @@ export * from './stack';
 export * from './queue';
 export * from './graph';
 export * from './binary-tree';
+export * from './tree';
 export * from './heap';
 export * from './priority-queue';
 export * from './matrix';
 export * from './trie';
-export * from './types';

package/dist/data-structures/index.js

@@ -20,8 +20,8 @@ __exportStar(require("./stack"), exports);
 __exportStar(require("./queue"), exports);
 __exportStar(require("./graph"), exports);
 __exportStar(require("./binary-tree"), exports);
+__exportStar(require("./tree"), exports);
 __exportStar(require("./heap"), exports);
 __exportStar(require("./priority-queue"), exports);
 __exportStar(require("./matrix"), exports);
 __exportStar(require("./trie"), exports);
-__exportStar(require("./types"), exports);

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

@@ -1,58 +1,195 @@
-export declare class DoublyLinkedListNode<T> {
-    val: T;
-    next: DoublyLinkedListNode<T> | null;
-    prev: DoublyLinkedListNode<T> | null;
-    constructor(nodeValue: T);
+/**
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
+ */
+export declare class DoublyLinkedListNode<T = number> {
+    /**
+     * 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".
+     */
+    constructor(val: T);
+    private _val;
+    get val(): T;
+    set val(value: T);
+    private _next;
+    get next(): DoublyLinkedListNode<T> | null;
+    set next(value: DoublyLinkedListNode<T> | null);
+    private _prev;
+    get prev(): DoublyLinkedListNode<T> | null;
+    set prev(value: DoublyLinkedListNode<T> | null);
 }
-export declare class DoublyLinkedList<T> {
-    private _first;
-    private _last;
-    private _size;
-    get size(): number;
-    set size(v: number);
-    /**
-     * Adds a node at the beginning of the linked list
-     * @param val Value to be stored at the beginning of the linked list
-     */
-    offerFirst(val: T): boolean;
-    /**
-     * Adds a node to the end of the linked list
-     * @param val Value to be stored in the Doubly linked list node
-     */
-    offerLast(val: T): boolean;
-    peekFirst(): T | null;
-    peekFirst(by: 'val'): T | null;
-    peekFirst(by: 'node'): DoublyLinkedListNode<T> | null;
-    peekLast(): T | null;
-    peekLast(by: 'val'): T | null;
-    peekLast(by: 'node'): DoublyLinkedListNode<T> | null;
-    pollFirst(): T | null;
-    pollFirst(by: 'val'): T | null;
-    pollFirst(by: 'node'): DoublyLinkedListNode<T> | null;
-    pollLast(): T | null;
-    pollLast(by: 'val'): T | null;
-    pollLast(by: 'node'): DoublyLinkedListNode<T> | null;
-    get(index: number): T | null;
-    get(index: number, by: 'node'): DoublyLinkedListNode<T> | null;
-    get(index: number, by: 'val'): T | null;
-    /**
-     * Updates the value of the node at the specified index.
-     * If index = 0; Value of the first element in the list is updated.
-     * If index = 3; Value of the fourth element in the list is updated.
-     * @param index Index of the node to be updated
-     * @param val New value of the node
-     */
-    set(index: number, val: T): boolean;
-    isEmpty(): boolean;
-    /**
-     * Inserts a new node at the specified index.
-     * @param index Index at which the new node has to be inserted
-     * @param val Value of the new node to be inserted
-     */
-    insert(index: number, val: T): boolean;
-    /**
-     * Removes a node at the specified index and returns its value.
-     * @param index Index at which the node has to be removed.
-     */
-    remove(index: number): T | null;
+export declare class DoublyLinkedList<T = number> {
+    /**
+     * The constructor initializes the linked list with an empty head, tail, and length.
+     */
+    constructor();
+    private _head;
+    get head(): DoublyLinkedListNode<T> | null;
+    set head(value: DoublyLinkedListNode<T> | null);
+    private _tail;
+    get tail(): DoublyLinkedListNode<T> | null;
+    set tail(value: DoublyLinkedListNode<T> | null);
+    private _length;
+    get length(): number;
+    /**
+     * 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.
+     */
+    static fromArray<T>(data: T[]): DoublyLinkedList<T>;
+    /**
+     * 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.
+     */
+    push(val: T): void;
+    /**
+     * 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.
+     */
+    pop(): T | null;
+    /**
+     * 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.
+     */
+    shift(): T | null;
+    /**
+     * 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.
+     */
+    unshift(val: T): void;
+    /**
+     * 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
+     * retrieve from the list.
+     * @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.
+     */
+    getAt(index: number): T | null;
+    /**
+     * The function `getNodeAt` returns the node at a given index in a doubly 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 node we want to
+     * retrieve from the doubly linked list. It indicates the zero-based index of the node we want to access.
+     * @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`.
+     */
+    getNodeAt(index: number): DoublyLinkedListNode<T> | null;
+    /**
+     * The function `findNodeByValue` searches for a node with a specific value in a doubly linked list and returns the
+     * node if found, otherwise it returns null.
+     * @param {T} val - The `val` parameter is the value that we want to search for in the doubly linked list.
+     * @returns The function `findNodeByValue` returns a `DoublyLinkedListNode<T>` if a node with the specified value `val`
+     * is found in the linked list. If no such node is found, it returns `null`.
+     */
+    findNode(val: T): DoublyLinkedListNode<T> | 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
+     * DoublyLinkedList. It is of type number.
+     * @param {T} val - The `val` parameter represents the value that you want to insert into the Doubly Linked List at the
+     * specified index.
+     * @returns The `insert` method returns a boolean value. It returns `true` if the insertion is successful, and `false`
+     * if the index is out of bounds.
+     */
+    insertAt(index: number, val: T): boolean;
+    /**
+     * 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
+     * data structure. It is of type number.
+     * @returns The method `deleteAt` returns the value of the node that was deleted, or `null` if the index is out of
+     * bounds.
+     */
+    deleteAt(index: number): T | null;
+    delete(valOrNode: T): boolean;
+    delete(valOrNode: DoublyLinkedListNode<T>): boolean;
+    /**
+     * The `toArray` function converts a linked list into an array.
+     * @returns The `toArray()` method is returning an array of type `T[]`.
+     */
+    toArray(): T[];
+    /**
+     * The `clear` function resets the linked list by setting the head, tail, and length to null and 0 respectively.
+     */
+    clear(): void;
+    /**
+     * 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
+     * function is used to determine whether a particular value in the linked list satisfies a certain condition.
+     * @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: T) => boolean): T | 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
+     * that we are searching for in the linked list.
+     * @returns The method `indexOf` returns the index of the first occurrence of the specified value `val` in the linked
+     * list. If the value is not found, it returns -1.
+     */
+    indexOf(val: T): number;
+    /**
+     * 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.
+     * @param callback - A function that takes a value of type T as its parameter and returns a boolean value. This
+     * function is used to determine whether a given value satisfies a certain condition.
+     * @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`.
+     */
+    findLast(callback: (val: T) => boolean): T | 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[]`.
+     */
+    toArrayReverse(): T[];
+    /**
+     * The `reverse` function reverses the order of the elements in a doubly linked list.
+     */
+    reverse(): void;
+    /**
+     * 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.
+     */
+    forEach(callback: (val: T, index: number) => void): void;
+    /**
+     * The `map` function takes a callback function and applies it to each element in the DoublyLinkedList, returning a new
+     * DoublyLinkedList with the transformed values.
+     * @param callback - The callback parameter is a function that takes a value of type T (the type of values stored in
+     * the original DoublyLinkedList) and returns a value of type U (the type of values that will be stored in the mapped
+     * DoublyLinkedList).
+     * @returns The `map` function is returning a new instance of `DoublyLinkedList<U>` that contains the mapped values.
+     */
+    map<U>(callback: (val: T) => U): DoublyLinkedList<U>;
+    /**
+     * The `filter` function iterates through a DoublyLinkedList and returns a new DoublyLinkedList containing only the
+     * elements that satisfy the given callback function.
+     * @param callback - The `callback` parameter is a function that takes a value of type `T` and returns a boolean value.
+     * 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.
+     */
+    filter(callback: (val: T) => boolean): DoublyLinkedList<T>;
+    /**
+     * 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
+     * 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: T) => U, initialValue: U): U;
+    insertAfter(existingValueOrNode: T, newValue: T): boolean;
+    insertAfter(existingValueOrNode: DoublyLinkedListNode<T>, newValue: T): boolean;
+    insertBefore(existingValueOrNode: T, newValue: T): boolean;
+    insertBefore(existingValueOrNode: DoublyLinkedListNode<T>, newValue: T): boolean;
 }