data-structure-typed 1.43.3 → 1.44.1

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

@@ -1,6 +1,3 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.DirectedGraph = exports.DirectedEdge = exports.DirectedVertex = void 0;
 /**
  * data-structure-typed
  *
@@ -8,9 +5,9 @@ exports.DirectedGraph = exports.DirectedEdge = exports.DirectedVertex = void 0;
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-const utils_1 = require("../../utils");
-const abstract_graph_1 = require("./abstract-graph");
-class DirectedVertex extends abstract_graph_1.AbstractVertex {
+import { arrayRemove } from '../../utils';
+import { AbstractEdge, AbstractGraph, AbstractVertex } from './abstract-graph';
+export class DirectedVertex extends 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
@@ -22,8 +19,7 @@ class DirectedVertex extends abstract_graph_1.AbstractVertex {
         super(key, value);
     }
 }
-exports.DirectedVertex = DirectedVertex;
-class DirectedEdge extends abstract_graph_1.AbstractEdge {
+export class DirectedEdge extends AbstractEdge {
     src;
     dest;
     /**
@@ -43,8 +39,7 @@ class DirectedEdge extends abstract_graph_1.AbstractEdge {
         this.dest = dest;
     }
 }
-exports.DirectedEdge = DirectedEdge;
-class DirectedGraph extends abstract_graph_1.AbstractGraph {
+export class DirectedGraph extends AbstractGraph {
     /**
      * The constructor function initializes an instance of a class.
      */
@@ -143,11 +138,11 @@ class DirectedGraph extends abstract_graph_1.AbstractGraph {
         }
         const srcOutEdges = this._outEdgeMap.get(src);
         if (srcOutEdges) {
-            (0, utils_1.arrayRemove)(srcOutEdges, (edge) => edge.dest === dest.key);
+            arrayRemove(srcOutEdges, (edge) => edge.dest === dest.key);
         }
         const destInEdges = this._inEdgeMap.get(dest);
         if (destInEdges) {
-            removed = (0, utils_1.arrayRemove)(destInEdges, (edge) => edge.src === src.key)[0] || null;
+            removed = arrayRemove(destInEdges, (edge) => edge.src === src.key)[0] || null;
         }
         return removed;
     }
@@ -171,11 +166,11 @@ class DirectedGraph extends abstract_graph_1.AbstractGraph {
         if (src && dest) {
             const srcOutEdges = this._outEdgeMap.get(src);
             if (srcOutEdges && srcOutEdges.length > 0) {
-                (0, utils_1.arrayRemove)(srcOutEdges, (edge) => edge.src === src.key);
+                arrayRemove(srcOutEdges, (edge) => edge.src === src.key);
             }
             const destInEdges = this._inEdgeMap.get(dest);
             if (destInEdges && destInEdges.length > 0) {
-                removed = (0, utils_1.arrayRemove)(destInEdges, (edge) => edge.dest === dest.key)[0];
+                removed = arrayRemove(destInEdges, (edge) => edge.dest === dest.key)[0];
             }
         }
         return removed;
@@ -529,4 +524,3 @@ class DirectedGraph extends abstract_graph_1.AbstractGraph {
         }
     }
 }
-exports.DirectedGraph = DirectedGraph;

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

@@ -0,0 +1,4 @@
+export * from './abstract-graph';
+export * from './directed-graph';
+export * from './undirected-graph';
+export * from './map-graph';

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

@@ -1,8 +1,5 @@
-"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 {
+import { DirectedEdge, DirectedGraph, DirectedVertex } from './directed-graph';
+export class MapVertex extends DirectedVertex {
     lat;
     long;
     /**
@@ -23,8 +20,7 @@ class MapVertex extends directed_graph_1.DirectedVertex {
         this.long = long;
     }
 }
-exports.MapVertex = MapVertex;
-class MapEdge extends directed_graph_1.DirectedEdge {
+export class MapEdge extends DirectedEdge {
     /**
      * The constructor function initializes a new instance of a class with the given source, destination, weight, and
      * value.
@@ -39,8 +35,7 @@ class MapEdge extends directed_graph_1.DirectedEdge {
         super(src, dest, weight, value);
     }
 }
-exports.MapEdge = MapEdge;
-class MapGraph extends directed_graph_1.DirectedGraph {
+export class MapGraph extends 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
@@ -93,4 +88,3 @@ class MapGraph extends directed_graph_1.DirectedGraph {
         return new MapEdge(src, dest, weight, value);
     }
 }
-exports.MapGraph = MapGraph;

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

@@ -1,6 +1,3 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.UndirectedGraph = exports.UndirectedEdge = exports.UndirectedVertex = void 0;
 /**
  * data-structure-typed
  *
@@ -8,9 +5,9 @@ exports.UndirectedGraph = exports.UndirectedEdge = exports.UndirectedVertex = vo
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-const utils_1 = require("../../utils");
-const abstract_graph_1 = require("./abstract-graph");
-class UndirectedVertex extends abstract_graph_1.AbstractVertex {
+import { arrayRemove } from '../../utils';
+import { AbstractEdge, AbstractGraph, AbstractVertex } from './abstract-graph';
+export class UndirectedVertex extends 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
@@ -22,8 +19,7 @@ class UndirectedVertex extends abstract_graph_1.AbstractVertex {
         super(key, value);
     }
 }
-exports.UndirectedVertex = UndirectedVertex;
-class UndirectedEdge extends abstract_graph_1.AbstractEdge {
+export class UndirectedEdge extends AbstractEdge {
     vertices;
     /**
      * The constructor function creates an instance of a class with two vertex IDs, an optional weight, and an optional
@@ -40,8 +36,7 @@ class UndirectedEdge extends abstract_graph_1.AbstractEdge {
         this.vertices = [v1, v2];
     }
 }
-exports.UndirectedEdge = UndirectedEdge;
-class UndirectedGraph extends abstract_graph_1.AbstractGraph {
+export class UndirectedGraph extends AbstractGraph {
     /**
      * The constructor initializes a new Map object to store edges.
      */
@@ -127,11 +122,11 @@ class UndirectedGraph extends abstract_graph_1.AbstractGraph {
         const v1Edges = this._edges.get(vertex1);
         let removed = null;
         if (v1Edges) {
-            removed = (0, utils_1.arrayRemove)(v1Edges, (e) => e.vertices.includes(vertex2.key))[0] || null;
+            removed = arrayRemove(v1Edges, (e) => e.vertices.includes(vertex2.key))[0] || null;
         }
         const v2Edges = this._edges.get(vertex2);
         if (v2Edges) {
-            (0, utils_1.arrayRemove)(v2Edges, (e) => e.vertices.includes(vertex1.key));
+            arrayRemove(v2Edges, (e) => e.vertices.includes(vertex1.key));
         }
         return removed;
     }
@@ -299,4 +294,3 @@ class UndirectedGraph extends abstract_graph_1.AbstractGraph {
         return true;
     }
 }
-exports.UndirectedGraph = UndirectedGraph;

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

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

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

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

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

@@ -1,6 +1,3 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.HashMap = void 0;
 /**
  * data-structure-typed
  *
@@ -8,7 +5,7 @@ exports.HashMap = void 0;
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-class HashMap {
+export 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.
@@ -156,4 +153,3 @@ class HashMap {
         this._table = newTable; // Again, here is this._table
     }
 }
-exports.HashMap = HashMap;

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

@@ -1,4 +1,3 @@
-"use strict";
 /**
  * data-structure-typed
  *
@@ -6,9 +5,7 @@
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.HashTable = exports.HashTableNode = void 0;
-class HashTableNode {
+export class HashTableNode {
     key;
     value;
     next;
@@ -18,8 +15,7 @@ class HashTableNode {
         this.next = null;
     }
 }
-exports.HashTableNode = HashTableNode;
-class HashTable {
+export class HashTable {
     static DEFAULT_CAPACITY = 16;
     static LOAD_FACTOR = 0.75;
     constructor(capacity = HashTable.DEFAULT_CAPACITY, hashFn) {
@@ -240,4 +236,3 @@ class HashTable {
         this._capacity = newCapacity;
     }
 }
-exports.HashTable = HashTable;

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

@@ -0,0 +1,6 @@
+export * from './hash-table';
+export * from './coordinate-map';
+export * from './coordinate-set';
+export * from './tree-map';
+export * from './tree-set';
+export * from './hash-map';

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

@@ -0,0 +1,2 @@
+export class TreeMap {
+}

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

@@ -0,0 +1,2 @@
+export class TreeSet {
+}

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

@@ -1,13 +1,10 @@
-"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.FibonacciHeap = exports.FibonacciHeapNode = exports.Heap = void 0;
-class Heap {
+export class Heap {
     constructor(options) {
         this._comparator = options.comparator;
         if (options.nodes && options.nodes.length > 0) {
@@ -329,8 +326,7 @@ class Heap {
             this.sinkDown(i);
     }
 }
-exports.Heap = Heap;
-class FibonacciHeapNode {
+export class FibonacciHeapNode {
     element;
     degree;
     left;
@@ -344,8 +340,7 @@ class FibonacciHeapNode {
         this.marked = false;
     }
 }
-exports.FibonacciHeapNode = FibonacciHeapNode;
-class FibonacciHeap {
+export class FibonacciHeap {
     constructor(comparator) {
         this.clear();
         this._comparator = comparator || this.defaultComparator;
@@ -685,4 +680,3 @@ class FibonacciHeap {
         }
     }
 }
-exports.FibonacciHeap = FibonacciHeap;

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

@@ -0,0 +1,3 @@
+export * from './max-heap';
+export * from './min-heap';
+export * from './heap';

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

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

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

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

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

@@ -0,0 +1,11 @@
+export * from './hash';
+export * from './linked-list';
+export * from './stack';
+export * from './queue';
+export * from './graph';
+export * from './binary-tree';
+export * from './tree';
+export * from './heap';
+export * from './priority-queue';
+export * from './matrix';
+export * from './trie';

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

@@ -1,6 +1,3 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.DoublyLinkedList = exports.DoublyLinkedListNode = void 0;
 /**
  * data-structure-typed
  *
@@ -8,7 +5,7 @@ exports.DoublyLinkedList = exports.DoublyLinkedListNode = void 0;
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-class DoublyLinkedListNode {
+export class DoublyLinkedListNode {
     value;
     next;
     prev;
@@ -23,8 +20,7 @@ class DoublyLinkedListNode {
         this.prev = null;
     }
 }
-exports.DoublyLinkedListNode = DoublyLinkedListNode;
-class DoublyLinkedList {
+export class DoublyLinkedList {
     /**
      * The constructor initializes the linked list with an empty head, tail, and length.
      */
@@ -773,4 +769,3 @@ class DoublyLinkedList {
         }
     }
 }
-exports.DoublyLinkedList = DoublyLinkedList;

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

@@ -0,0 +1,3 @@
+export * from './singly-linked-list';
+export * from './doubly-linked-list';
+export * from './skip-linked-list';

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

@@ -1,6 +1,3 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.SinglyLinkedList = exports.SinglyLinkedListNode = void 0;
 /**
  * data-structure-typed
  *
@@ -8,7 +5,7 @@ exports.SinglyLinkedList = exports.SinglyLinkedListNode = void 0;
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-class SinglyLinkedListNode {
+export class SinglyLinkedListNode {
     value;
     next;
     /**
@@ -21,8 +18,7 @@ class SinglyLinkedListNode {
         this.next = null;
     }
 }
-exports.SinglyLinkedListNode = SinglyLinkedListNode;
-class SinglyLinkedList {
+export class SinglyLinkedList {
     /**
      * The constructor initializes the linked list with an empty head, tail, and length.
      */
@@ -717,4 +713,3 @@ class SinglyLinkedList {
         }
     }
 }
-exports.SinglyLinkedList = SinglyLinkedList;

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

@@ -1,4 +1,3 @@
-"use strict";
 /**
  * data-structure-typed
  *
@@ -6,9 +5,7 @@
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.SkipList = exports.SkipListNode = void 0;
-class SkipListNode {
+export class SkipListNode {
     key;
     value;
     forward;
@@ -18,8 +15,7 @@ class SkipListNode {
         this.forward = new Array(level);
     }
 }
-exports.SkipListNode = SkipListNode;
-class SkipList {
+export 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
@@ -255,4 +251,3 @@ class SkipList {
         return level;
     }
 }
-exports.SkipList = SkipList;

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

@@ -0,0 +1,4 @@
+export * from './matrix';
+export * from './vector2d';
+export * from './matrix2d';
+export * from './navigator';

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

@@ -1,6 +1,3 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.MatrixNTI2D = void 0;
 /**
  * data-structure-typed
  *
@@ -9,7 +6,7 @@ exports.MatrixNTI2D = void 0;
  * @license MIT License
  */
 // todo need to be improved
-class MatrixNTI2D {
+export class MatrixNTI2D {
     _matrix;
     /**
      * The constructor creates a matrix with the specified number of rows and columns, and initializes all elements to a
@@ -26,4 +23,3 @@ class MatrixNTI2D {
         return this._matrix;
     }
 }
-exports.MatrixNTI2D = MatrixNTI2D;

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

@@ -1,6 +1,3 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.Matrix2D = void 0;
 /**
  * data-structure-typed
  *
@@ -8,8 +5,8 @@ exports.Matrix2D = void 0;
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-const vector2d_1 = require("./vector2d");
-class Matrix2D {
+import { Vector2D } from './vector2d';
+export class Matrix2D {
     _matrix;
     /**
      * The constructor function initializes a Matrix2D object with either a default identity matrix, or a provided matrix
@@ -21,7 +18,7 @@ class Matrix2D {
         if (typeof value === 'undefined') {
             this._matrix = Matrix2D.identity;
         }
-        else if (value instanceof vector2d_1.Vector2D) {
+        else if (value instanceof Vector2D) {
             this._matrix = Matrix2D.identity;
             this._matrix[0][0] = value.x;
             this._matrix[1][0] = value.y;
@@ -194,7 +191,6 @@ class Matrix2D {
      * the first column of the matrix.
      */
     toVector() {
-        return new vector2d_1.Vector2D(this._matrix[0][0], this._matrix[1][0]);
+        return new Vector2D(this._matrix[0][0], this._matrix[1][0]);
     }
 }
-exports.Matrix2D = Matrix2D;

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

@@ -1,7 +1,4 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.Navigator = exports.Character = void 0;
-class Character {
+export class Character {
     direction;
     turn;
     /**
@@ -17,8 +14,7 @@ class Character {
         this.turn = () => new Character(turning[direction], turning);
     }
 }
-exports.Character = Character;
-class Navigator {
+export class Navigator {
     onMove;
     _matrix;
     _cur;
@@ -110,4 +106,3 @@ class Navigator {
         this.onMove && this.onMove(this._cur);
     }
 }
-exports.Navigator = Navigator;

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

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

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

@@ -1,6 +1,3 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.MaxPriorityQueue = void 0;
 /**
  * data-structure-typed
  *
@@ -8,8 +5,8 @@ exports.MaxPriorityQueue = void 0;
  * @copyright Copyright (c) 2022 Kirk Qi <qilinaus@gmail.com>
  * @license MIT License
  */
-const priority_queue_1 = require("./priority-queue");
-class MaxPriorityQueue extends priority_queue_1.PriorityQueue {
+import { PriorityQueue } from './priority-queue';
+export class MaxPriorityQueue extends PriorityQueue {
     constructor(options = {
         comparator: (a, b) => {
             if (!(typeof a === 'number' && typeof b === 'number')) {
@@ -23,4 +20,3 @@ class MaxPriorityQueue extends priority_queue_1.PriorityQueue {
         super(options);
     }
 }
-exports.MaxPriorityQueue = MaxPriorityQueue;

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

@@ -1,6 +1,3 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.MinPriorityQueue = void 0;
 /**
  * data-structure-typed
  *
@@ -8,8 +5,8 @@ exports.MinPriorityQueue = void 0;
  * @copyright Copyright (c) 2022 Kirk Qi <qilinaus@gmail.com>
  * @license MIT License
  */
-const priority_queue_1 = require("./priority-queue");
-class MinPriorityQueue extends priority_queue_1.PriorityQueue {
+import { PriorityQueue } from './priority-queue';
+export class MinPriorityQueue extends PriorityQueue {
     constructor(options = {
         comparator: (a, b) => {
             if (!(typeof a === 'number' && typeof b === 'number')) {
@@ -23,4 +20,3 @@ class MinPriorityQueue extends priority_queue_1.PriorityQueue {
         super(options);
     }
 }
-exports.MinPriorityQueue = MinPriorityQueue;

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

@@ -0,0 +1,13 @@
+/**
+ * data-structure-typed
+ *
+ * @author Kirk Qi
+ * @copyright Copyright (c) 2022 Kirk Qi <qilinaus@gmail.com>
+ * @license MIT License
+ */
+import { Heap } from '../heap';
+export class PriorityQueue extends Heap {
+    constructor(options) {
+        super(options);
+    }
+}