data-structure-typed 1.38.0 → 1.38.2

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

@@ -1,3 +1,6 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.SinglyLinkedList = exports.SinglyLinkedListNode = void 0;
 /**
  * data-structure-typed
  *
@@ -5,7 +8,7 @@
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-export class SinglyLinkedListNode {
+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
@@ -15,12 +18,14 @@ export class SinglyLinkedListNode {
         this._val = val;
         this._next = null;
     }
+    _val;
     get val() {
         return this._val;
     }
     set val(value) {
         this._val = value;
     }
+    _next;
     get next() {
         return this._next;
     }
@@ -28,7 +33,8 @@ export class SinglyLinkedListNode {
         this._next = value;
     }
 }
-export class SinglyLinkedList {
+exports.SinglyLinkedListNode = SinglyLinkedListNode;
+class SinglyLinkedList {
     /**
      * The constructor initializes the linked list with an empty head, tail, and length.
      */
@@ -37,18 +43,21 @@ export class SinglyLinkedList {
         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;
     }
@@ -441,3 +450,4 @@ export class SinglyLinkedList {
         }
     }
 }
+exports.SinglyLinkedList = SinglyLinkedList;

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

@@ -1,3 +1,4 @@
+"use strict";
 /**
  * data-structure-typed
  *
@@ -5,38 +6,20 @@
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-export class SkipListNode {
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.SkipList = exports.SkipListNode = void 0;
+class SkipListNode {
+    key;
+    value;
+    forward;
     constructor(key, value, level) {
         this.key = key;
         this.value = value;
         this.forward = new Array(level);
     }
 }
-export class SkipList {
-    get probability() {
-        return this._probability;
-    }
-    set probability(value) {
-        this._probability = value;
-    }
-    get maxLevel() {
-        return this._maxLevel;
-    }
-    set maxLevel(value) {
-        this._maxLevel = value;
-    }
-    get level() {
-        return this._level;
-    }
-    set level(value) {
-        this._level = value;
-    }
-    get head() {
-        return this._head;
-    }
-    set head(value) {
-        this._head = value;
-    }
+exports.SkipListNode = SkipListNode;
+class SkipList {
     /**
      * The constructor initializes a SkipList with a specified maximum level and probability.
      * @param [maxLevel=16] - The `maxLevel` parameter represents the maximum level that a skip list can have. It determines
@@ -50,16 +33,33 @@ export class SkipList {
         this._maxLevel = maxLevel;
         this._probability = probability;
     }
-    /**
-     * The function "randomLevel" generates a random level based on a given probability and maximum level.
-     * @returns the level, which is a number.
-     */
-    randomLevel() {
-        let level = 1;
-        while (Math.random() < this.probability && level < this.maxLevel) {
-            level++;
-        }
-        return level;
+    _head;
+    get head() {
+        return this._head;
+    }
+    set head(value) {
+        this._head = value;
+    }
+    _level;
+    get level() {
+        return this._level;
+    }
+    set level(value) {
+        this._level = value;
+    }
+    _maxLevel;
+    get maxLevel() {
+        return this._maxLevel;
+    }
+    set maxLevel(value) {
+        this._maxLevel = value;
+    }
+    _probability;
+    get probability() {
+        return this._probability;
+    }
+    set probability(value) {
+        this._probability = value;
     }
     /**
      * The add function adds a new node with a given key and value to a Skip List data structure.
@@ -134,4 +134,16 @@ export class SkipList {
         }
         return false;
     }
+    /**
+     * The function "randomLevel" generates a random level based on a given probability and maximum level.
+     * @returns the level, which is a number.
+     */
+    randomLevel() {
+        let level = 1;
+        while (Math.random() < this.probability && level < this.maxLevel) {
+            level++;
+        }
+        return level;
+    }
 }
+exports.SkipList = SkipList;

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

@@ -0,0 +1,20 @@
+"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("./matrix"), exports);
+__exportStar(require("./vector2d"), exports);
+__exportStar(require("./matrix2d"), exports);
+__exportStar(require("./navigator"), exports);

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

@@ -1,3 +1,6 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.MatrixNTI2D = void 0;
 /**
  * data-structure-typed
  *
@@ -6,7 +9,8 @@
  * @license MIT License
  */
 // todo need to be improved
-export class MatrixNTI2D {
+class MatrixNTI2D {
+    _matrix;
     /**
      * 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.
@@ -22,3 +26,4 @@ export class MatrixNTI2D {
         return this._matrix;
     }
 }
+exports.MatrixNTI2D = MatrixNTI2D;

package/dist/{data-structures → mjs/data-structures}/matrix/matrix2d.js

@@ -1,4 +1,7 @@
 "use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.Matrix2D = void 0;
 /**
@@ -8,8 +11,9 @@ exports.Matrix2D = void 0;
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-const vector2d_1 = require("./vector2d");
+const vector2d_1 = __importDefault(require("./vector2d"));
 class Matrix2D {
+    _matrix;
     /**
      * The constructor function initializes a Matrix2D object with either a default identity matrix, or a provided matrix
      * or Vector2D object.
@@ -56,15 +60,6 @@ class Matrix2D {
     get m() {
         return this._matrix;
     }
-    /**
-     * The function "toVector" returns a new Vector2D object with the values from the first and second elements of the
-     * _matrix array.
-     * @returns A new instance of the Vector2D class is being returned. The values of the returned vector are taken from
-     * the first column of the matrix.
-     */
-    toVector() {
-        return new vector2d_1.default(this._matrix[0][0], this._matrix[1][0]);
-    }
     /**
      * The function takes two 2D matrices as input and returns their sum as a new 2D matrix.
      * @param {Matrix2D} matrix1 - Matrix2D - The first matrix to be added.
@@ -195,7 +190,15 @@ class Matrix2D {
             [0, 0, vector.w]
         ]);
     }
+    /**
+     * The function "toVector" returns a new Vector2D object with the values from the first and second elements of the
+     * _matrix array.
+     * @returns A new instance of the Vector2D class is being returned. The values of the returned vector are taken from
+     * the first column of the matrix.
+     */
+    toVector() {
+        return new vector2d_1.default(this._matrix[0][0], this._matrix[1][0]);
+    }
 }
 exports.Matrix2D = Matrix2D;
 exports.default = Matrix2D;
-//# sourceMappingURL=matrix2d.js.map

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

@@ -1,4 +1,9 @@
-export class Character {
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.Navigator = exports.Character = void 0;
+class Character {
+    direction;
+    turn;
     /**
      * The constructor function takes in a direction and turning object and sets the direction and turn properties of the
      * Character class.
@@ -12,7 +17,13 @@ export class Character {
         this.turn = () => new Character(turning[direction], turning);
     }
 }
-export class Navigator {
+exports.Character = Character;
+class Navigator {
+    onMove;
+    _matrix;
+    _cur;
+    _character;
+    _VISITED;
     /**
      * The constructor initializes the Navigator object with the given parameters and sets the current position as visited
      * in the matrix.
@@ -99,3 +110,4 @@ export class Navigator {
         this.onMove && this.onMove(this._cur);
     }
 }
+exports.Navigator = Navigator;

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

@@ -1,3 +1,6 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.Vector2D = void 0;
 /**
  * data-structure-typed
  *
@@ -5,7 +8,10 @@
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-export class Vector2D {
+class Vector2D {
+    x;
+    y;
+    w;
     constructor(x = 0, y = 0, w = 1 // needed for matrix multiplication
     ) {
         this.x = x;
@@ -284,4 +290,5 @@ export class Vector2D {
         this.y = 0;
     }
 }
-export default Vector2D;
+exports.Vector2D = Vector2D;
+exports.default = Vector2D;

package/dist/mjs/data-structures/priority-queue/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("./priority-queue"), exports);
+__exportStar(require("./min-priority-queue"), exports);
+__exportStar(require("./max-priority-queue"), exports);

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

@@ -1,3 +1,6 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.MaxPriorityQueue = void 0;
 /**
  * data-structure-typed
  *
@@ -5,8 +8,8 @@
  * @copyright Copyright (c) 2022 Kirk Qi <qilinaus@gmail.com>
  * @license MIT License
  */
-import { PriorityQueue } from './priority-queue';
-export class MaxPriorityQueue extends PriorityQueue {
+const priority_queue_1 = require("./priority-queue");
+class MaxPriorityQueue extends priority_queue_1.PriorityQueue {
     constructor(compare = (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 MaxPriorityQueue extends PriorityQueue {
         super(compare);
     }
 }
+exports.MaxPriorityQueue = MaxPriorityQueue;

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

@@ -1,3 +1,6 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.MinPriorityQueue = void 0;
 /**
  * data-structure-typed
  *
@@ -5,8 +8,8 @@
  * @copyright Copyright (c) 2022 Kirk Qi <qilinaus@gmail.com>
  * @license MIT License
  */
-import { PriorityQueue } from './priority-queue';
-export class MinPriorityQueue extends PriorityQueue {
+const priority_queue_1 = require("./priority-queue");
+class MinPriorityQueue extends priority_queue_1.PriorityQueue {
     constructor(compare = (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 MinPriorityQueue extends PriorityQueue {
         super(compare);
     }
 }
+exports.MinPriorityQueue = MinPriorityQueue;

package/dist/mjs/data-structures/priority-queue/priority-queue.js

@@ -0,0 +1,17 @@
+"use strict";
+/**
+ * data-structure-typed
+ *
+ * @author Kirk Qi
+ * @copyright Copyright (c) 2022 Kirk Qi <qilinaus@gmail.com>
+ * @license MIT License
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.PriorityQueue = void 0;
+const heap_1 = require("../heap");
+class PriorityQueue extends heap_1.Heap {
+    constructor(comparator) {
+        super(comparator);
+    }
+}
+exports.PriorityQueue = PriorityQueue;

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

@@ -1,3 +1,6 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.ArrayDeque = exports.ObjectDeque = exports.Deque = void 0;
 /**
  * data-structure-typed
  *
@@ -5,45 +8,46 @@
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-import { DoublyLinkedList } from '../linked-list';
+const linked_list_1 = require("../linked-list");
 // O(n) time complexity of obtaining the value
 // O(1) time complexity of adding at the beginning and the end
-export class Deque extends DoublyLinkedList {
+class Deque extends linked_list_1.DoublyLinkedList {
 }
+exports.Deque = Deque;
 // O(1) time complexity of obtaining the value
 // O(n) time complexity of adding at the beginning and the end
 // todo tested slowest one
-export class ObjectDeque {
+class ObjectDeque {
     constructor(capacity) {
-        this._nodes = {};
-        this._capacity = Number.MAX_SAFE_INTEGER;
-        this._first = -1;
-        this._last = -1;
-        this._size = 0;
         if (capacity !== undefined)
             this._capacity = capacity;
     }
+    _nodes = {};
     get nodes() {
         return this._nodes;
     }
+    _capacity = Number.MAX_SAFE_INTEGER;
     get capacity() {
         return this._capacity;
     }
     set capacity(value) {
         this._capacity = value;
     }
+    _first = -1;
     get first() {
         return this._first;
     }
     set first(value) {
         this._first = value;
     }
+    _last = -1;
     get last() {
         return this._last;
     }
     set last(value) {
         this._last = value;
     }
+    _size = 0;
     get size() {
         return this._size;
     }
@@ -146,12 +150,11 @@ export class ObjectDeque {
         this._size = value;
     }
 }
+exports.ObjectDeque = ObjectDeque;
 // O(1) time complexity of obtaining the value
 // O(n) time complexity of adding at the beginning and the end
-export class ArrayDeque {
-    constructor() {
-        this._nodes = [];
-    }
+class ArrayDeque {
+    _nodes = [];
     get size() {
         return this._nodes.length;
     }
@@ -171,8 +174,7 @@ export class ArrayDeque {
      * @returns The method `pollLast()` returns the last element of the `_nodes` array, or `null` if the array is empty.
      */
     pollLast() {
-        var _a;
-        return (_a = this._nodes.pop()) !== null && _a !== void 0 ? _a : null;
+        return this._nodes.pop() ?? null;
     }
     /**
      * The `pollFirst` function removes and returns the first element from an array, or returns null if the array is empty.
@@ -180,8 +182,7 @@ export class ArrayDeque {
      * empty.
      */
     pollFirst() {
-        var _a;
-        return (_a = this._nodes.shift()) !== null && _a !== void 0 ? _a : null;
+        return this._nodes.shift() ?? null;
     }
     /**
      * O(n) time complexity of adding at the beginning and the end
@@ -201,16 +202,14 @@ export class ArrayDeque {
      * empty, it will return `null`.
      */
     peekFirst() {
-        var _a;
-        return (_a = this._nodes[0]) !== null && _a !== void 0 ? _a : null;
+        return this._nodes[0] ?? null;
     }
     /**
      * The `peekLast` function returns the last element of an array or null if the array is empty.
      * @returns The method `peekLast()` returns the last element of the `_nodes` array, or `null` if the array is empty.
      */
     peekLast() {
-        var _a;
-        return (_a = this._nodes[this._nodes.length - 1]) !== null && _a !== void 0 ? _a : null;
+        return this._nodes[this._nodes.length - 1] ?? null;
     }
     /**
      * O(1) time complexity of obtaining the value
@@ -223,8 +222,7 @@ export class ArrayDeque {
      * will be returned. If the element does not exist (i.e., the index is out of bounds), `null` will be returned.
      */
     get(index) {
-        var _a;
-        return (_a = this._nodes[index]) !== null && _a !== void 0 ? _a : null;
+        return this._nodes[index] ?? null;
     }
     /**
      * The set function assigns a value to a specific index in an array.
@@ -268,3 +266,4 @@ export class ArrayDeque {
         return this._nodes.length === 0;
     }
 }
+exports.ArrayDeque = ArrayDeque;

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

@@ -0,0 +1,18 @@
+"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("./queue"), exports);
+__exportStar(require("./deque"), exports);

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

@@ -1,10 +1,13 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.Queue = exports.LinkedListQueue = void 0;
 /**
  * @license MIT
  * @copyright Tyler Zeng <zrwusa@gmail.com>
  * @class
  */
-import { SinglyLinkedList } from '../linked-list';
-export class LinkedListQueue extends SinglyLinkedList {
+const linked_list_1 = require("../linked-list");
+class LinkedListQueue extends linked_list_1.SinglyLinkedList {
     /**
      * The enqueue function adds a value to the end of an array.
      * @param {E} value - The value parameter represents the value that you want to add to the queue.
@@ -24,11 +27,11 @@ export class LinkedListQueue extends SinglyLinkedList {
      * @returns The `peek()` method is returning the value of the `head` node if it exists, otherwise it returns `undefined`.
      */
     peek() {
-        var _a;
-        return (_a = this.head) === null || _a === void 0 ? void 0 : _a.val;
+        return this.head?.val;
     }
 }
-export class Queue {
+exports.LinkedListQueue = LinkedListQueue;
+class Queue {
     /**
      * The constructor initializes an instance of a class with an optional array of elements and sets the offset to 0.
      * @param {E[]} [elements] - The `elements` parameter is an optional array of elements of type `E`. If provided, it
@@ -39,12 +42,14 @@ export class Queue {
         this._nodes = elements || [];
         this._offset = 0;
     }
+    _nodes;
     get nodes() {
         return this._nodes;
     }
     set nodes(value) {
         this._nodes = value;
     }
+    _offset;
     get offset() {
         return this._offset;
     }
@@ -163,3 +168,4 @@ export class Queue {
         }
     }
 }
+exports.Queue = Queue;

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

@@ -0,0 +1,17 @@
+"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("./stack"), exports);

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

@@ -1,9 +1,13 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.Stack = void 0;
 /**
  * @license MIT
  * @copyright Tyler Zeng <zrwusa@gmail.com>
  * @class
  */
-export class Stack {
+class Stack {
+    _elements;
     /**
      * The constructor initializes an array of elements, which can be provided as an optional parameter.
      * @param {E[]} [elements] - The `elements` parameter is an optional parameter of type `E[]`, which represents an array
@@ -85,3 +89,4 @@ export class Stack {
         return new Stack(this._elements.slice());
     }
 }
+exports.Stack = Stack;

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

@@ -0,0 +1,17 @@
+"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("./tree"), exports);