data-structure-typed 1.38.0 → 1.38.2

package/{lib → dist/mjs}/data-structures/heap/heap.js

@@ -1,14 +1,43 @@
+"use strict";
 /**
  * data-structure-typed
  * @author Kirk Qi
  * @copyright Copyright (c) 2022 Kirk Qi <qilinaus@gmail.com>
  * @license MIT License
  */
-export class Heap {
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.FibonacciHeap = exports.FibonacciHeapNode = exports.Heap = void 0;
+class Heap {
+    nodes = [];
+    comparator;
     constructor(comparator) {
-        this.nodes = [];
         this.comparator = comparator;
     }
+    /**
+     * Get the size (number of elements) of the heap.
+     */
+    get size() {
+        return this.nodes.length;
+    }
+    /**
+     * Get the last element in the heap, which is not necessarily a leaf node.
+     * @returns The last element or undefined if the heap is empty.
+     */
+    get leaf() {
+        return this.nodes[this.size - 1] ?? undefined;
+    }
+    /**
+     * Static method that creates a binary heap from an array of nodes and a comparison function.
+     * @param nodes
+     * @param comparator - Comparison function.
+     * @returns A new Heap instance.
+     */
+    static heapify(nodes, comparator) {
+        const binaryHeap = new Heap(comparator);
+        binaryHeap.nodes = [...nodes];
+        binaryHeap.fix(); // Fix heap properties
+        return binaryHeap;
+    }
     /**
      * Insert an element into the heap and maintain the heap properties.
      * @param element - The element to be inserted.
@@ -48,54 +77,6 @@ export class Heap {
     pop() {
         return this.poll();
     }
-    /**
-     * Float operation to maintain heap properties after adding an element.
-     * @param index - The index of the newly added element.
-     */
-    bubbleUp(index) {
-        const element = this.nodes[index];
-        while (index > 0) {
-            const parentIndex = Math.floor((index - 1) / 2);
-            const parent = this.nodes[parentIndex];
-            if (this.comparator(element, parent) < 0) {
-                this.nodes[index] = parent;
-                this.nodes[parentIndex] = element;
-                index = parentIndex;
-            }
-            else {
-                break;
-            }
-        }
-    }
-    /**
-     * Sinking operation to maintain heap properties after removing the top element.
-     * @param index - The index from which to start sinking.
-     */
-    sinkDown(index) {
-        const leftChildIndex = 2 * index + 1;
-        const rightChildIndex = 2 * index + 2;
-        const length = this.nodes.length;
-        let targetIndex = index;
-        if (leftChildIndex < length && this.comparator(this.nodes[leftChildIndex], this.nodes[targetIndex]) < 0) {
-            targetIndex = leftChildIndex;
-        }
-        if (rightChildIndex < length && this.comparator(this.nodes[rightChildIndex], this.nodes[targetIndex]) < 0) {
-            targetIndex = rightChildIndex;
-        }
-        if (targetIndex !== index) {
-            const temp = this.nodes[index];
-            this.nodes[index] = this.nodes[targetIndex];
-            this.nodes[targetIndex] = temp;
-            this.sinkDown(targetIndex);
-        }
-    }
-    /**
-     * Fix the entire heap to maintain heap properties.
-     */
-    fix() {
-        for (let i = Math.floor(this.size / 2); i >= 0; i--)
-            this.sinkDown(i);
-    }
     /**
      * Peek at the top element of the heap without removing it.
      * @returns The top element or undefined if the heap is empty.
@@ -106,20 +87,6 @@ export class Heap {
         }
         return this.nodes[0];
     }
-    /**
-     * Get the size (number of elements) of the heap.
-     */
-    get size() {
-        return this.nodes.length;
-    }
-    /**
-     * Get the last element in the heap, which is not necessarily a leaf node.
-     * @returns The last element or undefined if the heap is empty.
-     */
-    get leaf() {
-        var _a;
-        return (_a = this.nodes[this.size - 1]) !== null && _a !== void 0 ? _a : undefined;
-    }
     /**
      * Check if the heap is empty.
      * @returns True if the heap is empty, otherwise false.
@@ -213,47 +180,82 @@ export class Heap {
         return visitedNode;
     }
     /**
-     * Static method that creates a binary heap from an array of nodes and a comparison function.
-     * @param nodes
-     * @param comparator - Comparison function.
-     * @returns A new Heap instance.
+     * Float operation to maintain heap properties after adding an element.
+     * @param index - The index of the newly added element.
      */
-    static heapify(nodes, comparator) {
-        const binaryHeap = new Heap(comparator);
-        binaryHeap.nodes = [...nodes];
-        binaryHeap.fix(); // Fix heap properties
-        return binaryHeap;
+    bubbleUp(index) {
+        const element = this.nodes[index];
+        while (index > 0) {
+            const parentIndex = Math.floor((index - 1) / 2);
+            const parent = this.nodes[parentIndex];
+            if (this.comparator(element, parent) < 0) {
+                this.nodes[index] = parent;
+                this.nodes[parentIndex] = element;
+                index = parentIndex;
+            }
+            else {
+                break;
+            }
+        }
+    }
+    /**
+     * Sinking operation to maintain heap properties after removing the top element.
+     * @param index - The index from which to start sinking.
+     */
+    sinkDown(index) {
+        const leftChildIndex = 2 * index + 1;
+        const rightChildIndex = 2 * index + 2;
+        const length = this.nodes.length;
+        let targetIndex = index;
+        if (leftChildIndex < length && this.comparator(this.nodes[leftChildIndex], this.nodes[targetIndex]) < 0) {
+            targetIndex = leftChildIndex;
+        }
+        if (rightChildIndex < length && this.comparator(this.nodes[rightChildIndex], this.nodes[targetIndex]) < 0) {
+            targetIndex = rightChildIndex;
+        }
+        if (targetIndex !== index) {
+            const temp = this.nodes[index];
+            this.nodes[index] = this.nodes[targetIndex];
+            this.nodes[targetIndex] = temp;
+            this.sinkDown(targetIndex);
+        }
+    }
+    /**
+     * Fix the entire heap to maintain heap properties.
+     */
+    fix() {
+        for (let i = Math.floor(this.size / 2); i >= 0; i--)
+            this.sinkDown(i);
     }
 }
-export class FibonacciHeapNode {
+exports.Heap = Heap;
+class FibonacciHeapNode {
+    element;
+    degree;
+    left;
+    right;
+    child;
+    parent;
+    marked;
     constructor(element, degree = 0) {
         this.element = element;
         this.degree = degree;
         this.marked = false;
     }
 }
-export class FibonacciHeap {
+exports.FibonacciHeapNode = FibonacciHeapNode;
+class FibonacciHeap {
+    root;
+    size = 0;
+    min;
+    comparator;
     constructor(comparator) {
-        this.size = 0;
         this.clear();
         this.comparator = comparator || this.defaultComparator;
         if (typeof this.comparator !== 'function') {
             throw new Error('FibonacciHeap constructor: given comparator should be a function.');
         }
     }
-    /**
-     * Default comparator function used by the heap.
-     * @param {E} a
-     * @param {E} b
-     * @protected
-     */
-    defaultComparator(a, b) {
-        if (a < b)
-            return -1;
-        if (a > b)
-            return 1;
-        return 0;
-    }
     /**
      * Get the size (number of elements) of the heap.
      * @returns {number} The size of the heap.  Returns 0 if the heap is empty. Returns -1 if the heap is invalid.
@@ -263,29 +265,6 @@ export class FibonacciHeap {
         this.min = undefined;
         this.size = 0;
     }
-    /**
-     * Create a new node.
-     * @param element
-     * @protected
-     */
-    createNode(element) {
-        return new FibonacciHeapNode(element);
-    }
-    /**
-     * Merge the given node with the root list.
-     * @param node - The node to be merged.
-     */
-    mergeWithRoot(node) {
-        if (!this.root) {
-            this.root = node;
-        }
-        else {
-            node.right = this.root.right;
-            node.left = this.root;
-            this.root.right.left = node;
-            this.root.right = node;
-        }
-    }
     /**
      * O(1) time operation.
      * Insert an element into the heap and maintain the heap properties.
@@ -346,20 +325,6 @@ export class FibonacciHeap {
         }
         return nodes;
     }
-    /**
-     * O(log n) time operation.
-     * Remove and return the top element (smallest or largest element) from the heap.
-     * @param node - The node to be removed.
-     * @protected
-     */
-    removeFromRoot(node) {
-        if (this.root === node)
-            this.root = node.right;
-        if (node.left)
-            node.left.right = node.right;
-        if (node.right)
-            node.right.left = node.left;
-    }
     /**
      * O(log n) time operation.
      * Remove and return the top element (smallest or largest element) from the heap.
@@ -377,52 +342,6 @@ export class FibonacciHeap {
             parent.child.right = node;
         }
     }
-    /**
-     * O(log n) time operation.
-     * Remove and return the top element (smallest or largest element) from the heap.
-     * @param y
-     * @param x
-     * @protected
-     */
-    link(y, x) {
-        this.removeFromRoot(y);
-        y.left = y;
-        y.right = y;
-        this.mergeWithChild(x, y);
-        x.degree++;
-        y.parent = x;
-    }
-    /**
-     * O(log n) time operation.
-     * Remove and return the top element (smallest or largest element) from the heap.
-     * @protected
-     */
-    consolidate() {
-        const A = new Array(this.size);
-        const nodes = this.consumeLinkedList(this.root);
-        let x, y, d, t;
-        for (const node of nodes) {
-            x = node;
-            d = x.degree;
-            while (A[d]) {
-                y = A[d];
-                if (this.comparator(x.element, y.element) > 0) {
-                    t = x;
-                    x = y;
-                    y = t;
-                }
-                this.link(y, x);
-                A[d] = undefined;
-                d++;
-            }
-            A[d] = x;
-        }
-        for (let i = 0; i < this.size; i++) {
-            if (A[i] && this.comparator(A[i].element, this.min.element) <= 0) {
-                this.min = A[i];
-            }
-        }
-    }
     /**
      * O(log n) time operation.
      * Remove and return the top element (smallest or largest element) from the heap.
@@ -488,4 +407,101 @@ export class FibonacciHeap {
         // Clear the heap that was merged
         heapToMerge.clear();
     }
+    /**
+     * Default comparator function used by the heap.
+     * @param {E} a
+     * @param {E} b
+     * @protected
+     */
+    defaultComparator(a, b) {
+        if (a < b)
+            return -1;
+        if (a > b)
+            return 1;
+        return 0;
+    }
+    /**
+     * Create a new node.
+     * @param element
+     * @protected
+     */
+    createNode(element) {
+        return new FibonacciHeapNode(element);
+    }
+    /**
+     * Merge the given node with the root list.
+     * @param node - The node to be merged.
+     */
+    mergeWithRoot(node) {
+        if (!this.root) {
+            this.root = node;
+        }
+        else {
+            node.right = this.root.right;
+            node.left = this.root;
+            this.root.right.left = node;
+            this.root.right = node;
+        }
+    }
+    /**
+     * O(log n) time operation.
+     * Remove and return the top element (smallest or largest element) from the heap.
+     * @param node - The node to be removed.
+     * @protected
+     */
+    removeFromRoot(node) {
+        if (this.root === node)
+            this.root = node.right;
+        if (node.left)
+            node.left.right = node.right;
+        if (node.right)
+            node.right.left = node.left;
+    }
+    /**
+     * O(log n) time operation.
+     * Remove and return the top element (smallest or largest element) from the heap.
+     * @param y
+     * @param x
+     * @protected
+     */
+    link(y, x) {
+        this.removeFromRoot(y);
+        y.left = y;
+        y.right = y;
+        this.mergeWithChild(x, y);
+        x.degree++;
+        y.parent = x;
+    }
+    /**
+     * O(log n) time operation.
+     * Remove and return the top element (smallest or largest element) from the heap.
+     * @protected
+     */
+    consolidate() {
+        const A = new Array(this.size);
+        const nodes = this.consumeLinkedList(this.root);
+        let x, y, d, t;
+        for (const node of nodes) {
+            x = node;
+            d = x.degree;
+            while (A[d]) {
+                y = A[d];
+                if (this.comparator(x.element, y.element) > 0) {
+                    t = x;
+                    x = y;
+                    y = t;
+                }
+                this.link(y, x);
+                A[d] = undefined;
+                d++;
+            }
+            A[d] = x;
+        }
+        for (let i = 0; i < this.size; i++) {
+            if (A[i] && this.comparator(A[i].element, this.min.element) <= 0) {
+                this.min = A[i];
+            }
+        }
+    }
 }
+exports.FibonacciHeap = FibonacciHeap;

package/dist/mjs/data-structures/heap/index.js

@@ -0,0 +1,19 @@
+"use strict";
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __exportStar = (this && this.__exportStar) || function(m, exports) {
+    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+__exportStar(require("./max-heap"), exports);
+__exportStar(require("./min-heap"), exports);
+__exportStar(require("./heap"), exports);

package/{lib → dist/mjs}/data-structures/heap/max-heap.js

@@ -1,3 +1,4 @@
+"use strict";
 /**
  * data-structure-typed
  *
@@ -5,8 +6,10 @@
  * @copyright Copyright (c) 2022 Kirk Qi <qilinaus@gmail.com>
  * @license MIT License
  */
-import { Heap } from './heap';
-export class MaxHeap extends Heap {
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.MaxHeap = void 0;
+const heap_1 = require("./heap");
+class MaxHeap extends heap_1.Heap {
     constructor(comparator = (a, b) => {
         if (!(typeof a === 'number' && typeof b === 'number')) {
             throw new Error('The a, b params of compare function must be number');
@@ -18,3 +21,4 @@ export class MaxHeap extends Heap {
         super(comparator);
     }
 }
+exports.MaxHeap = MaxHeap;

package/{lib → dist/mjs}/data-structures/heap/min-heap.js

@@ -1,3 +1,4 @@
+"use strict";
 /**
  * data-structure-typed
  *
@@ -5,8 +6,10 @@
  * @copyright Copyright (c) 2022 Kirk Qi <qilinaus@gmail.com>
  * @license MIT License
  */
-import { Heap } from './heap';
-export class MinHeap extends Heap {
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.MinHeap = void 0;
+const heap_1 = require("./heap");
+class MinHeap extends heap_1.Heap {
     constructor(comparator = (a, b) => {
         if (!(typeof a === 'number' && typeof b === 'number')) {
             throw new Error('The a, b params of compare function must be number');
@@ -18,3 +21,4 @@ export class MinHeap extends Heap {
         super(comparator);
     }
 }
+exports.MinHeap = MinHeap;

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

@@ -0,0 +1,27 @@
+"use strict";
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __exportStar = (this && this.__exportStar) || function(m, exports) {
+    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+__exportStar(require("./hash"), exports);
+__exportStar(require("./linked-list"), exports);
+__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);

package/{lib → dist/mjs}/data-structures/linked-list/doubly-linked-list.js

@@ -1,3 +1,6 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.DoublyLinkedList = exports.DoublyLinkedListNode = void 0;
 /**
  * data-structure-typed
  *
@@ -5,7 +8,7 @@
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-export class DoublyLinkedListNode {
+class DoublyLinkedListNode {
     /**
      * The constructor function initializes the value, next, and previous properties of an object.
      * @param {E} val - The "val" parameter is the value that will be stored in the node. It can be of any data type, as it
@@ -16,18 +19,21 @@ export class DoublyLinkedListNode {
         this._next = null;
         this._prev = null;
     }
+    _val;
     get val() {
         return this._val;
     }
     set val(value) {
         this._val = value;
     }
+    _next;
     get next() {
         return this._next;
     }
     set next(value) {
         this._next = value;
     }
+    _prev;
     get prev() {
         return this._prev;
     }
@@ -35,7 +41,8 @@ export class DoublyLinkedListNode {
         this._prev = value;
     }
 }
-export class DoublyLinkedList {
+exports.DoublyLinkedListNode = DoublyLinkedListNode;
+class DoublyLinkedList {
     /**
      * The constructor initializes the linked list with an empty head, tail, and length.
      */
@@ -44,21 +51,27 @@ export class DoublyLinkedList {
         this._tail = null;
         this._length = 0;
     }
+    _head;
     get head() {
         return this._head;
     }
     set head(value) {
         this._head = value;
     }
+    _tail;
     get tail() {
         return this._tail;
     }
     set tail(value) {
         this._tail = value;
     }
+    _length;
     get length() {
         return this._length;
     }
+    get size() {
+        return this.length;
+    }
     /**
      * The `fromArray` function creates a new instance of a DoublyLinkedList and populates it with the elements from the
      * given array.
@@ -183,19 +196,14 @@ export class DoublyLinkedList {
      * @returns The method `peekFirst()` returns the first node of the doubly linked list, or `null` if the list is empty.
      */
     peekFirst() {
-        var _a;
-        return (_a = this.head) === null || _a === void 0 ? void 0 : _a.val;
+        return this.head?.val;
     }
     /**
      * The `peekLast` function returns the last node in a doubly linked list, or null if the list is empty.
      * @returns The method `peekLast()` returns the last node of the doubly linked list, or `null` if the list is empty.
      */
     peekLast() {
-        var _a;
-        return (_a = this.tail) === null || _a === void 0 ? void 0 : _a.val;
-    }
-    get size() {
-        return this.length;
+        return this.tail?.val;
     }
     /**
      * The `getAt` function returns the value at a specified index in a linked list, or null if the index is out of bounds.
@@ -576,3 +584,4 @@ export class DoublyLinkedList {
         return false;
     }
 }
+exports.DoublyLinkedList = DoublyLinkedList;

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

@@ -0,0 +1,19 @@
+"use strict";
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __exportStar = (this && this.__exportStar) || function(m, exports) {
+    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+__exportStar(require("./singly-linked-list"), exports);
+__exportStar(require("./doubly-linked-list"), exports);
+__exportStar(require("./skip-linked-list"), exports);