data-structure-typed 1.38.1 → 1.38.2

package/{lib → dist/mjs}/data-structures/binary-tree/segment-tree.js

@@ -1,3 +1,4 @@
+"use strict";
 /**
  * data-structure-typed
  *
@@ -5,49 +6,51 @@
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-export class SegmentTreeNode {
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.SegmentTree = exports.SegmentTreeNode = void 0;
+class SegmentTreeNode {
     constructor(start, end, sum, val) {
-        this._start = 0;
-        this._end = 0;
-        this._val = null;
-        this._sum = 0;
-        this._left = null;
-        this._right = null;
         this._start = start;
         this._end = end;
         this._sum = sum;
         this._val = val || null;
     }
+    _start = 0;
     get start() {
         return this._start;
     }
     set start(v) {
         this._start = v;
     }
+    _end = 0;
     get end() {
         return this._end;
     }
     set end(v) {
         this._end = v;
     }
+    _val = null;
     get val() {
         return this._val;
     }
     set val(v) {
         this._val = v;
     }
+    _sum = 0;
     get sum() {
         return this._sum;
     }
     set sum(v) {
         this._sum = v;
     }
+    _left = null;
     get left() {
         return this._left;
     }
     set left(v) {
         this._left = v;
     }
+    _right = null;
     get right() {
         return this._right;
     }
@@ -55,7 +58,8 @@ export class SegmentTreeNode {
         this._right = v;
     }
 }
-export class SegmentTree {
+exports.SegmentTreeNode = SegmentTreeNode;
+class SegmentTree {
     /**
      * The constructor initializes the values, start, end, and root properties of an object.
      * @param {number[]} values - An array of numbers that will be used to build a binary search tree.
@@ -66,8 +70,6 @@ export class SegmentTree {
      * included in the range. If not provided, it defaults to the index of the last element in the "values" array.
      */
     constructor(values, start, end) {
-        this._values = [];
-        this._start = 0;
         start = start || 0;
         end = end || values.length - 1;
         this._values = values;
@@ -81,15 +83,19 @@ export class SegmentTree {
             this._values = [];
         }
     }
+    _values = [];
     get values() {
         return this._values;
     }
+    _start = 0;
     get start() {
         return this._start;
     }
+    _end;
     get end() {
         return this._end;
     }
+    _root;
     get root() {
         return this._root;
     }
@@ -221,3 +227,4 @@ export class SegmentTree {
         this._root = v;
     }
 }
+exports.SegmentTree = SegmentTree;

package/{lib → dist/mjs}/data-structures/binary-tree/tree-multiset.js

@@ -1,6 +1,10 @@
-import { CP, FamilyPosition, IterationType } from '../../types';
-import { AVLTree, AVLTreeNode } from './avl-tree';
-export class TreeMultisetNode extends AVLTreeNode {
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.TreeMultiset = exports.TreeMultisetNode = void 0;
+const types_1 = require("../../types");
+const avl_tree_1 = require("./avl-tree");
+class TreeMultisetNode extends avl_tree_1.AVLTreeNode {
+    count;
     /**
      * The constructor function initializes a BinaryTreeNode object with a key, value, and count.
      * @param {BinaryTreeNodeKey} key - The `key` parameter is of type `BinaryTreeNodeKey` and represents the unique identifier
@@ -16,10 +20,11 @@ export class TreeMultisetNode extends AVLTreeNode {
         this.count = count;
     }
 }
+exports.TreeMultisetNode = TreeMultisetNode;
 /**
  * The only distinction between a TreeMultiset and a AVLTree lies in the ability of the former to store duplicate nodes through the utilization of counters.
  */
-export class TreeMultiset extends AVLTree {
+class TreeMultiset extends avl_tree_1.AVLTree {
     /**
      * The constructor function for a TreeMultiset class in TypeScript, which extends another class and sets an option to
      * merge duplicated values.
@@ -28,8 +33,8 @@ export class TreeMultiset extends AVLTree {
      */
     constructor(options) {
         super(options);
-        this._count = 0;
     }
+    _count = 0;
     get count() {
         return this._count;
     }
@@ -81,14 +86,14 @@ export class TreeMultiset extends AVLTree {
             while (traversing) {
                 if (cur) {
                     if (newNode) {
-                        if (this._compare(cur.key, newNode.key) === CP.eq) {
+                        if (this._compare(cur.key, newNode.key) === types_1.CP.eq) {
                             cur.val = newNode.val;
                             cur.count += newNode.count;
                             this._setCount(this.count + newNode.count);
                             traversing = false;
                             inserted = cur;
                         }
-                        else if (this._compare(cur.key, newNode.key) === CP.gt) {
+                        else if (this._compare(cur.key, newNode.key) === types_1.CP.gt) {
                             // Traverse left of the node
                             if (cur.left === undefined) {
                                 //Add to the left of the current node
@@ -104,7 +109,7 @@ export class TreeMultiset extends AVLTree {
                                     cur = cur.left;
                             }
                         }
-                        else if (this._compare(cur.key, newNode.key) === CP.lt) {
+                        else if (this._compare(cur.key, newNode.key) === types_1.CP.lt) {
                             // Traverse right of the node
                             if (cur.right === undefined) {
                                 //Add to the right of the current node
@@ -190,7 +195,7 @@ export class TreeMultiset extends AVLTree {
                 inserted.push(this.add(NaN, null, 0));
                 continue;
             }
-            inserted.push(this.add(keyOrNode, data === null || data === void 0 ? void 0 : data[i], 1));
+            inserted.push(this.add(keyOrNode, data?.[i], 1));
         }
         return inserted;
     }
@@ -207,7 +212,7 @@ export class TreeMultiset extends AVLTree {
         if (sorted.length < 1)
             return false;
         this.clear();
-        if (iterationType === IterationType.RECURSIVE) {
+        if (iterationType === types_1.IterationType.RECURSIVE) {
             const buildBalanceBST = (l, r) => {
                 if (l > r)
                     return;
@@ -257,7 +262,7 @@ export class TreeMultiset extends AVLTree {
         const curr = this.get(nodeOrKey);
         if (!curr)
             return bstDeletedResult;
-        const parent = (curr === null || curr === void 0 ? void 0 : curr.parent) ? curr.parent : null;
+        const parent = curr?.parent ? curr.parent : null;
         let needBalanced = null, orgCurrent = curr;
         if (curr.count > 1 && !ignoreCount) {
             curr.count--;
@@ -271,10 +276,10 @@ export class TreeMultiset extends AVLTree {
                 }
                 else {
                     const { familyPosition: fp } = curr;
-                    if (fp === FamilyPosition.LEFT || fp === FamilyPosition.ROOT_LEFT) {
+                    if (fp === types_1.FamilyPosition.LEFT || fp === types_1.FamilyPosition.ROOT_LEFT) {
                         parent.left = curr.right;
                     }
-                    else if (fp === FamilyPosition.RIGHT || fp === FamilyPosition.ROOT_RIGHT) {
+                    else if (fp === types_1.FamilyPosition.RIGHT || fp === types_1.FamilyPosition.ROOT_RIGHT) {
                         parent.right = curr.right;
                     }
                     needBalanced = parent;
@@ -344,3 +349,4 @@ export class TreeMultiset extends AVLTree {
         this._count = v;
     }
 }
+exports.TreeMultiset = TreeMultiset;

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

@@ -1,3 +1,6 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.AbstractGraph = exports.AbstractEdge = exports.AbstractVertex = void 0;
 /**
  * data-structure-typed
  *
@@ -5,10 +8,10 @@
  * @copyright Copyright (c) 2022 Kirk Qi <qilinaus@gmail.com>
  * @license MIT License
  */
-import { arrayRemove, uuidV4 } from '../../utils';
-import { PriorityQueue } from '../priority-queue';
-import { Queue } from '../queue';
-export class AbstractVertex {
+const utils_1 = require("../../utils");
+const priority_queue_1 = require("../priority-queue");
+const queue_1 = require("../queue");
+class AbstractVertex {
     /**
      * The function is a protected constructor that takes an key and an optional value as parameters.
      * @param {VertexKey} key - The `key` parameter is of type `VertexKey` and represents the identifier of the vertex. It is
@@ -20,12 +23,14 @@ export class AbstractVertex {
         this._key = key;
         this._val = val;
     }
+    _key;
     get key() {
         return this._key;
     }
     set key(v) {
         this._key = v;
     }
+    _val;
     get val() {
         return this._val;
     }
@@ -33,7 +38,8 @@ export class AbstractVertex {
         this._val = value;
     }
 }
-export class AbstractEdge {
+exports.AbstractVertex = AbstractVertex;
+class AbstractEdge {
     /**
      * The above function is a protected constructor that initializes the weight, value, and hash code properties of an
      * object.
@@ -46,20 +52,23 @@ export class AbstractEdge {
     constructor(weight, val) {
         this._weight = weight !== undefined ? weight : 1;
         this._val = val;
-        this._hashCode = uuidV4();
+        this._hashCode = (0, utils_1.uuidV4)();
     }
+    _val;
     get val() {
         return this._val;
     }
     set val(value) {
         this._val = value;
     }
+    _weight;
     get weight() {
         return this._weight;
     }
     set weight(v) {
         this._weight = v;
     }
+    _hashCode;
     get hashCode() {
         return this._hashCode;
     }
@@ -76,10 +85,9 @@ export class AbstractEdge {
         this._hashCode = v;
     }
 }
-export class AbstractGraph {
-    constructor() {
-        this._vertices = new Map();
-    }
+exports.AbstractEdge = AbstractEdge;
+class AbstractGraph {
+    _vertices = new Map();
     get vertices() {
         return this._vertices;
     }
@@ -212,7 +220,7 @@ export class AbstractGraph {
                 if (!visiting.get(neighbor)) {
                     path.push(neighbor);
                     dfs(neighbor, dest, visiting, path);
-                    arrayRemove(path, (vertex) => vertex === neighbor);
+                    (0, utils_1.arrayRemove)(path, (vertex) => vertex === neighbor);
                 }
             }
             visiting.set(cur, false);
@@ -226,10 +234,9 @@ export class AbstractGraph {
      * @returns The function `getPathSumWeight` returns the sum of the weights of the edges in the given path.
      */
     getPathSumWeight(path) {
-        var _a;
         let sum = 0;
         for (let i = 0; i < path.length; i++) {
-            sum += ((_a = this.getEdge(path[i], path[i + 1])) === null || _a === void 0 ? void 0 : _a.weight) || 0;
+            sum += this.getEdge(path[i], path[i + 1])?.weight || 0;
         }
         return sum;
     }
@@ -266,7 +273,7 @@ export class AbstractGraph {
                 return null;
             }
             const visited = new Map();
-            const queue = new Queue([vertex1]);
+            const queue = new queue_1.Queue([vertex1]);
             visited.set(vertex1, true);
             let cost = 0;
             while (queue.size > 0) {
@@ -341,7 +348,7 @@ export class AbstractGraph {
                     if (!visiting.get(neighbor)) {
                         path.push(neighbor);
                         dfs(neighbor, dest, visiting, path);
-                        arrayRemove(path, (vertex) => vertex === neighbor);
+                        (0, utils_1.arrayRemove)(path, (vertex) => vertex === neighbor);
                     }
                 }
                 visiting.set(cur, false);
@@ -500,7 +507,6 @@ export class AbstractGraph {
      * @returns The function `dijkstra` returns an object of type `DijkstraResult<V>`.
      */
     dijkstra(src, dest, getMinDist, genPaths) {
-        var _a;
         if (getMinDist === undefined)
             getMinDist = false;
         if (genPaths === undefined)
@@ -524,7 +530,7 @@ export class AbstractGraph {
             if (vertexOrKey instanceof AbstractVertex)
                 distMap.set(vertexOrKey, Infinity);
         }
-        const heap = new PriorityQueue((a, b) => a.key - b.key);
+        const heap = new priority_queue_1.PriorityQueue((a, b) => a.key - b.key);
         heap.add({ key: 0, val: srcVertex });
         distMap.set(srcVertex, 0);
         preMap.set(srcVertex, null);
@@ -552,8 +558,8 @@ export class AbstractGraph {
         };
         while (heap.size > 0) {
             const curHeapNode = heap.poll();
-            const dist = curHeapNode === null || curHeapNode === void 0 ? void 0 : curHeapNode.key;
-            const cur = curHeapNode === null || curHeapNode === void 0 ? void 0 : curHeapNode.val;
+            const dist = curHeapNode?.key;
+            const cur = curHeapNode?.val;
             if (dist !== undefined) {
                 if (cur) {
                     seen.add(cur);
@@ -569,7 +575,7 @@ export class AbstractGraph {
                     const neighbors = this.getNeighbors(cur);
                     for (const neighbor of neighbors) {
                         if (!seen.has(neighbor)) {
-                            const weight = (_a = this.getEdge(cur, neighbor)) === null || _a === void 0 ? void 0 : _a.weight;
+                            const weight = this.getEdge(cur, neighbor)?.weight;
                             if (typeof weight === 'number') {
                                 const distSrcToNeighbor = distMap.get(neighbor);
                                 if (distSrcToNeighbor) {
@@ -743,7 +749,6 @@ export class AbstractGraph {
      * path between vertices in the
      */
     floyd() {
-        var _a;
         const idAndVertices = [...this._vertices];
         const n = idAndVertices.length;
         const costs = [];
@@ -758,7 +763,7 @@ export class AbstractGraph {
         }
         for (let i = 0; i < n; i++) {
             for (let j = 0; j < n; j++) {
-                costs[i][j] = ((_a = this.getEdge(idAndVertices[i][1], idAndVertices[j][1])) === null || _a === void 0 ? void 0 : _a.weight) || Infinity;
+                costs[i][j] = this.getEdge(idAndVertices[i][1], idAndVertices[j][1])?.weight || Infinity;
             }
         }
         for (let k = 0; k < n; k++) {
@@ -869,12 +874,11 @@ export class AbstractGraph {
         const getSCCs = () => {
             const SCCs = new Map();
             lowMap.forEach((low, vertex) => {
-                var _a;
                 if (!SCCs.has(low)) {
                     SCCs.set(low, [vertex]);
                 }
                 else {
-                    (_a = SCCs.get(low)) === null || _a === void 0 ? void 0 : _a.push(vertex);
+                    SCCs.get(low)?.push(vertex);
                 }
             });
             return SCCs;
@@ -915,3 +919,4 @@ export class AbstractGraph {
         this._vertices = value;
     }
 }
+exports.AbstractGraph = AbstractGraph;

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

@@ -1,3 +1,6 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.DirectedGraph = exports.DirectedEdge = exports.DirectedVertex = 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 DirectedVertex extends AbstractVertex {
+const utils_1 = require("../../utils");
+const abstract_graph_1 = require("./abstract-graph");
+class DirectedVertex 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 DirectedVertex extends AbstractVertex {
         super(key, val);
     }
 }
-export class DirectedEdge extends AbstractEdge {
+exports.DirectedVertex = DirectedVertex;
+class DirectedEdge extends abstract_graph_1.AbstractEdge {
     /**
      * The constructor function initializes the source and destination vertices of an edge, along with an optional weight
      * and value.
@@ -36,12 +40,14 @@ export class DirectedEdge extends AbstractEdge {
         this._src = src;
         this._dest = dest;
     }
+    _src;
     get src() {
         return this._src;
     }
     set src(v) {
         this._src = v;
     }
+    _dest;
     get dest() {
         return this._dest;
     }
@@ -49,18 +55,19 @@ export class DirectedEdge extends AbstractEdge {
         this._dest = v;
     }
 }
-export class DirectedGraph extends AbstractGraph {
+exports.DirectedEdge = DirectedEdge;
+class DirectedGraph extends abstract_graph_1.AbstractGraph {
     /**
      * The constructor function initializes an instance of a class.
      */
     constructor() {
         super();
-        this._outEdgeMap = new Map();
-        this._inEdgeMap = new Map();
     }
+    _outEdgeMap = new Map();
     get outEdgeMap() {
         return this._outEdgeMap;
     }
+    _inEdgeMap = new Map();
     get inEdgeMap() {
         return this._inEdgeMap;
     }
@@ -78,7 +85,7 @@ export class DirectedGraph extends AbstractGraph {
      * @returns a new instance of a DirectedVertex object, casted as type V.
      */
     createVertex(key, val) {
-        return new DirectedVertex(key, val !== null && val !== void 0 ? val : key);
+        return new DirectedVertex(key, val ?? key);
     }
     /**
      * In TypeScript, a subclass inherits the interface implementation of its parent class, without needing to implement the same interface again in the subclass. This behavior differs from Java's approach. In Java, if a parent class implements an interface, the subclass needs to explicitly implement the same interface, even if the parent class has already implemented it.
@@ -95,7 +102,7 @@ export class DirectedGraph extends AbstractGraph {
      * @returns a new instance of a DirectedEdge object, casted as type E.
      */
     createEdge(src, dest, weight, val) {
-        return new DirectedEdge(src, dest, weight !== null && weight !== void 0 ? weight : 1, val);
+        return new DirectedEdge(src, dest, weight ?? 1, val);
     }
     /**
      * The `getEdge` function retrieves an edge between two vertices based on their source and destination IDs.
@@ -134,11 +141,11 @@ export class DirectedGraph extends AbstractGraph {
         }
         const srcOutEdges = this._outEdgeMap.get(src);
         if (srcOutEdges) {
-            arrayRemove(srcOutEdges, (edge) => edge.dest === dest.key);
+            (0, utils_1.arrayRemove)(srcOutEdges, (edge) => edge.dest === dest.key);
         }
         const destInEdges = this._inEdgeMap.get(dest);
         if (destInEdges) {
-            removed = arrayRemove(destInEdges, (edge) => edge.src === src.key)[0] || null;
+            removed = (0, utils_1.arrayRemove)(destInEdges, (edge) => edge.src === src.key)[0] || null;
         }
         return removed;
     }
@@ -155,11 +162,11 @@ export class DirectedGraph extends AbstractGraph {
         if (src && dest) {
             const srcOutEdges = this._outEdgeMap.get(src);
             if (srcOutEdges && srcOutEdges.length > 0) {
-                arrayRemove(srcOutEdges, (edge) => edge.src === src.key);
+                (0, utils_1.arrayRemove)(srcOutEdges, (edge) => edge.src === src.key);
             }
             const destInEdges = this._inEdgeMap.get(dest);
             if (destInEdges && destInEdges.length > 0) {
-                removed = arrayRemove(destInEdges, (edge) => edge.dest === dest.key)[0];
+                removed = (0, utils_1.arrayRemove)(destInEdges, (edge) => edge.dest === dest.key)[0];
             }
         }
         return removed;
@@ -285,7 +292,7 @@ export class DirectedGraph extends AbstractGraph {
      * @returns an array of vertices or vertex IDs in topological order. If there is a cycle in the graph, it returns null.
      */
     topologicalSort(propertyName) {
-        propertyName = propertyName !== null && propertyName !== void 0 ? propertyName : 'key';
+        propertyName = propertyName ?? 'key';
         // When judging whether there is a cycle in the undirected graph, all nodes with degree of **<= 1** are enqueued
         // When judging whether there is a cycle in the directed graph, all nodes with **in degree = 0** are enqueued
         const statusMap = new Map();
@@ -414,3 +421,4 @@ export class DirectedGraph extends AbstractGraph {
         this._inEdgeMap = value;
     }
 }
+exports.DirectedGraph = DirectedGraph;

package/dist/mjs/data-structures/graph/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("./abstract-graph"), exports);
+__exportStar(require("./directed-graph"), exports);
+__exportStar(require("./undirected-graph"), exports);
+__exportStar(require("./map-graph"), exports);

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

@@ -1,5 +1,8 @@
-import { DirectedEdge, DirectedGraph, DirectedVertex } from './directed-graph';
-export class MapVertex extends DirectedVertex {
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.MapGraph = exports.MapEdge = exports.MapVertex = void 0;
+const directed_graph_1 = require("./directed-graph");
+class MapVertex extends directed_graph_1.DirectedVertex {
     /**
      * The constructor function initializes an object with an key, latitude, longitude, and an optional value.
      * @param {VertexKey} key - The `key` parameter is of type `VertexKey` and represents the identifier of the vertex.
@@ -17,12 +20,14 @@ export class MapVertex extends DirectedVertex {
         this._lat = lat;
         this._long = long;
     }
+    _lat;
     get lat() {
         return this._lat;
     }
     set lat(value) {
         this._lat = value;
     }
+    _long;
     get long() {
         return this._long;
     }
@@ -30,7 +35,8 @@ export class MapVertex extends DirectedVertex {
         this._long = value;
     }
 }
-export class MapEdge extends DirectedEdge {
+exports.MapVertex = MapVertex;
+class MapEdge extends directed_graph_1.DirectedEdge {
     /**
      * The constructor function initializes a new instance of a class with the given source, destination, weight, and
      * value.
@@ -45,7 +51,8 @@ export class MapEdge extends DirectedEdge {
         super(src, dest, weight, val);
     }
 }
-export class MapGraph extends DirectedGraph {
+exports.MapEdge = MapEdge;
+class MapGraph extends directed_graph_1.DirectedGraph {
     /**
      * The constructor function initializes the origin and bottomRight properties of a MapGraphCoordinate object.
      * @param {MapGraphCoordinate} origin - The `origin` parameter is a `MapGraphCoordinate` object that represents the
@@ -57,16 +64,17 @@ export class MapGraph extends DirectedGraph {
      */
     constructor(origin, bottomRight) {
         super();
-        this._origin = [0, 0];
         this._origin = origin;
         this._bottomRight = bottomRight;
     }
+    _origin = [0, 0];
     get origin() {
         return this._origin;
     }
     set origin(value) {
         this._origin = value;
     }
+    _bottomRight;
     get bottomRight() {
         return this._bottomRight;
     }
@@ -103,3 +111,4 @@ export class MapGraph extends DirectedGraph {
         return new MapEdge(src, dest, weight, val);
     }
 }
+exports.MapGraph = MapGraph;