data-structure-typed 1.38.1 → 1.38.2

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

@@ -1,3 +1,6 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.UndirectedGraph = exports.UndirectedEdge = exports.UndirectedVertex = void 0;
 /**
  * data-structure-typed
  *
@@ -5,9 +8,9 @@
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-import { arrayRemove } from '../../utils';
-import { AbstractEdge, AbstractGraph, AbstractVertex } from './abstract-graph';
-export class UndirectedVertex extends AbstractVertex {
+const utils_1 = require("../../utils");
+const abstract_graph_1 = require("./abstract-graph");
+class UndirectedVertex extends abstract_graph_1.AbstractVertex {
     /**
      * The constructor function initializes a vertex with an optional value.
      * @param {VertexKey} key - The `key` parameter is of type `VertexKey` and represents the identifier of the vertex. It is
@@ -19,7 +22,8 @@ export class UndirectedVertex extends AbstractVertex {
         super(key, val);
     }
 }
-export class UndirectedEdge extends AbstractEdge {
+exports.UndirectedVertex = UndirectedVertex;
+class UndirectedEdge extends abstract_graph_1.AbstractEdge {
     /**
      * The constructor function creates an instance of a class with two vertex IDs, an optional weight, and an optional
      * value.
@@ -34,6 +38,7 @@ export class UndirectedEdge extends AbstractEdge {
         super(weight, val);
         this._vertices = [v1, v2];
     }
+    _vertices;
     get vertices() {
         return this._vertices;
     }
@@ -41,7 +46,8 @@ export class UndirectedEdge extends AbstractEdge {
         this._vertices = v;
     }
 }
-export class UndirectedGraph extends AbstractGraph {
+exports.UndirectedEdge = UndirectedEdge;
+class UndirectedGraph extends abstract_graph_1.AbstractGraph {
     /**
      * The constructor initializes a new Map object to store edges.
      */
@@ -49,6 +55,7 @@ export class UndirectedGraph extends AbstractGraph {
         super();
         this._edges = new Map();
     }
+    _edges;
     get edges() {
         return this._edges;
     }
@@ -62,7 +69,7 @@ export class UndirectedGraph extends AbstractGraph {
      * @returns The method is returning a new instance of the `UndirectedVertex` class, casted as type `V`.
      */
     createVertex(key, val) {
-        return new UndirectedVertex(key, val !== null && val !== void 0 ? val : key);
+        return new UndirectedVertex(key, val ?? key);
     }
     /**
      * The function creates an undirected edge between two vertices with an optional weight and value.
@@ -75,7 +82,7 @@ export class UndirectedGraph extends AbstractGraph {
      * @returns a new instance of the `UndirectedEdge` class, which is casted as type `E`.
      */
     createEdge(v1, v2, weight, val) {
-        return new UndirectedEdge(v1, v2, weight !== null && weight !== void 0 ? weight : 1, val);
+        return new UndirectedEdge(v1, v2, weight ?? 1, val);
     }
     /**
      * The function `getEdge` returns the first edge that connects two vertices, or null if no such edge exists.
@@ -86,13 +93,12 @@ export class UndirectedGraph extends AbstractGraph {
      * @returns an edge (E) or null.
      */
     getEdge(v1, v2) {
-        var _a;
         let edges = [];
         if (v1 !== null && v2 !== null) {
             const vertex1 = this._getVertex(v1);
             const vertex2 = this._getVertex(v2);
             if (vertex1 && vertex2) {
-                edges = (_a = this._edges.get(vertex1)) === null || _a === void 0 ? void 0 : _a.filter(e => e.vertices.includes(vertex2.key));
+                edges = this._edges.get(vertex1)?.filter(e => e.vertices.includes(vertex2.key));
             }
         }
         return edges ? edges[0] || null : null;
@@ -113,11 +119,11 @@ export class UndirectedGraph extends AbstractGraph {
         const v1Edges = this._edges.get(vertex1);
         let removed = null;
         if (v1Edges) {
-            removed = arrayRemove(v1Edges, (e) => e.vertices.includes(vertex2.key))[0] || null;
+            removed = (0, utils_1.arrayRemove)(v1Edges, (e) => e.vertices.includes(vertex2.key))[0] || null;
         }
         const v2Edges = this._edges.get(vertex2);
         if (v2Edges) {
-            arrayRemove(v2Edges, (e) => e.vertices.includes(vertex1.key));
+            (0, utils_1.arrayRemove)(v2Edges, (e) => e.vertices.includes(vertex1.key));
         }
         return removed;
     }
@@ -137,10 +143,9 @@ export class UndirectedGraph extends AbstractGraph {
      * edges connected to that vertex.
      */
     degreeOf(vertexOrKey) {
-        var _a;
         const vertex = this._getVertex(vertexOrKey);
         if (vertex) {
-            return ((_a = this._edges.get(vertex)) === null || _a === void 0 ? void 0 : _a.length) || 0;
+            return this._edges.get(vertex)?.length || 0;
         }
         else {
             return 0;
@@ -244,3 +249,4 @@ export class UndirectedGraph extends AbstractGraph {
         this._edges = v;
     }
 }
+exports.UndirectedGraph = UndirectedGraph;

package/{lib → dist/mjs}/data-structures/hash/coordinate-map.js

@@ -1,3 +1,6 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.CoordinateMap = void 0;
 /**
  * data-structure-typed
  *
@@ -5,13 +8,13 @@
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-export class CoordinateMap extends Map {
+class CoordinateMap extends Map {
     constructor(joint) {
         super();
-        this._joint = '_';
         if (joint !== undefined)
             this._joint = joint;
     }
+    _joint = '_';
     get joint() {
         return this._joint;
     }
@@ -59,3 +62,4 @@ export class CoordinateMap extends Map {
         this._joint = v;
     }
 }
+exports.CoordinateMap = CoordinateMap;

package/{lib → dist/mjs}/data-structures/hash/coordinate-set.js

@@ -1,3 +1,6 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.CoordinateSet = void 0;
 /**
  * data-structure-typed
  *
@@ -5,13 +8,13 @@
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-export class CoordinateSet extends Set {
+class CoordinateSet extends Set {
     constructor(joint) {
         super();
-        this._joint = '_';
         if (joint !== undefined)
             this._joint = joint;
     }
+    _joint = '_';
     get joint() {
         return this._joint;
     }
@@ -49,3 +52,4 @@ export class CoordinateSet extends Set {
         this._joint = v;
     }
 }
+exports.CoordinateSet = CoordinateSet;

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

@@ -1,3 +1,6 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.HashMap = void 0;
 /**
  * data-structure-typed
  *
@@ -5,7 +8,7 @@
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-export class HashMap {
+class HashMap {
     /**
      * The constructor initializes the properties of a hash table, including the initial capacity, load factor, capacity
      * multiplier, size, table array, and hash function.
@@ -35,36 +38,42 @@ export class HashMap {
                     return hash % this.table.length;
                 });
     }
+    _initialCapacity;
     get initialCapacity() {
         return this._initialCapacity;
     }
     set initialCapacity(value) {
         this._initialCapacity = value;
     }
+    _loadFactor;
     get loadFactor() {
         return this._loadFactor;
     }
     set loadFactor(value) {
         this._loadFactor = value;
     }
+    _capacityMultiplier;
     get capacityMultiplier() {
         return this._capacityMultiplier;
     }
     set capacityMultiplier(value) {
         this._capacityMultiplier = value;
     }
+    _size;
     get size() {
         return this._size;
     }
     set size(value) {
         this._size = value;
     }
+    _table;
     get table() {
         return this._table;
     }
     set table(value) {
         this._table = value;
     }
+    _hashFn;
     get hashFn() {
         return this._hashFn;
     }
@@ -165,3 +174,4 @@ export class HashMap {
         this._table = newTable; // Again, here is this._table
     }
 }
+exports.HashMap = HashMap;

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

@@ -1,3 +1,4 @@
+"use strict";
 /**
  * data-structure-typed
  *
@@ -5,35 +6,47 @@
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-export class HashTableNode {
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.HashTable = exports.HashTableNode = void 0;
+class HashTableNode {
+    key;
+    val;
+    next;
     constructor(key, val) {
         this.key = key;
         this.val = val;
         this.next = null;
     }
 }
-export class HashTable {
+exports.HashTableNode = HashTableNode;
+class HashTable {
+    static DEFAULT_CAPACITY = 16;
+    static LOAD_FACTOR = 0.75;
     constructor(capacity = HashTable.DEFAULT_CAPACITY, hashFn) {
         this._hashFn = hashFn || this._defaultHashFn;
         this._capacity = Math.max(capacity, HashTable.DEFAULT_CAPACITY);
         this._size = 0;
         this._buckets = new Array(this._capacity).fill(null);
     }
+    _capacity;
     get capacity() {
         return this._capacity;
     }
     set capacity(value) {
         this._capacity = value;
     }
+    _size;
     get size() {
         return this._size;
     }
+    _buckets;
     get buckets() {
         return this._buckets;
     }
     set buckets(value) {
         this._buckets = value;
     }
+    _hashFn;
     get hashFn() {
         return this._hashFn;
     }
@@ -236,5 +249,4 @@ export class HashTable {
         this._capacity = newCapacity;
     }
 }
-HashTable.DEFAULT_CAPACITY = 16;
-HashTable.LOAD_FACTOR = 0.75;
+exports.HashTable = HashTable;

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

@@ -0,0 +1,22 @@
+"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-table"), exports);
+__exportStar(require("./coordinate-map"), exports);
+__exportStar(require("./coordinate-set"), exports);
+__exportStar(require("./tree-map"), exports);
+__exportStar(require("./tree-set"), exports);
+__exportStar(require("./hash-map"), exports);

package/dist/mjs/data-structures/hash/tree-map.js

@@ -0,0 +1,6 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.TreeMap = void 0;
+class TreeMap {
+}
+exports.TreeMap = TreeMap;

package/dist/mjs/data-structures/hash/tree-set.js

@@ -0,0 +1,6 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.TreeSet = void 0;
+class TreeSet {
+}
+exports.TreeSet = TreeSet;

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

@@ -1,12 +1,16 @@
+"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;
     }
     /**
@@ -20,8 +24,7 @@ export class Heap {
      * @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;
+        return this.nodes[this.size - 1] ?? undefined;
     }
     /**
      * Static method that creates a binary heap from an array of nodes and a comparison function.
@@ -225,16 +228,28 @@ export class Heap {
             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') {
@@ -489,3 +504,4 @@ export class FibonacciHeap {
         }
     }
 }
+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,18 +51,21 @@ 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;
     }
@@ -186,16 +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;
+        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);

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;