data-structure-typed 1.21.4 → 1.32.0

package/dist/data-structures/hash/coordinate-set.js

@@ -1,55 +1,50 @@
 "use strict";
+var __extends = (this && this.__extends) || (function () {
+    var extendStatics = function (d, b) {
+        extendStatics = Object.setPrototypeOf ||
+            ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
+            function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };
+        return extendStatics(d, b);
+    };
+    return function (d, b) {
+        if (typeof b !== "function" && b !== null)
+            throw new TypeError("Class extends value " + String(b) + " is not a constructor or null");
+        extendStatics(d, b);
+        function __() { this.constructor = d; }
+        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
+    };
+})();
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.CoordinateSet = void 0;
-/**
- * data-structure-typed
- *
- * @author Tyler Zeng
- * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT License
- */
-class CoordinateSet extends Set {
-    constructor(joint) {
-        super();
-        this._joint = '_';
+var CoordinateSet = (function (_super) {
+    __extends(CoordinateSet, _super);
+    function CoordinateSet(joint) {
+        var _this = _super.call(this) || this;
+        _this._joint = '_';
         if (joint !== undefined)
-            this._joint = joint;
+            _this._joint = joint;
+        return _this;
     }
-    get joint() {
-        return this._joint;
-    }
-    /**
-     * The "has" function overrides the "has" method of the superclass and checks if a value exists in an array after
-     * joining its elements with a specified separator.
-     * @param {number[]} value - The parameter "value" is an array of numbers.
-     * @returns The overridden `has` method is returning the result of calling the `has` method of the superclass, passing
-     * in the joined value as an argument.
-     */
-    has(value) {
-        return super.has(value.join(this._joint));
-    }
-    /**
-     * The "add" function overrides the parent class's "add" function by joining the elements of the input array with a
-     * specified delimiter before calling the parent class's "add" function.
-     * @param {number[]} value - An array of numbers
-     * @returns The overridden `add` method is returning the result of calling the `add` method of the superclass
-     * (`super.add`) with the joined string representation of the `value` array (`value.join(this._joint)`).
-     */
-    add(value) {
-        return super.add(value.join(this._joint));
-    }
-    /**
-     * The function overrides the delete method and deletes an element from a Set by joining the elements of the input
-     * array with a specified joint and then calling the delete method of the parent class.
-     * @param {number[]} value - An array of numbers
-     * @returns The `delete` method is returning the result of calling the `delete` method of the superclass, with the
-     * `value` array joined together using the `_joint` property.
-     */
-    delete(value) {
-        return super.delete(value.join(this._joint));
-    }
-    _setJoint(v) {
+    Object.defineProperty(CoordinateSet.prototype, "joint", {
+        get: function () {
+            return this._joint;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    CoordinateSet.prototype.has = function (value) {
+        return _super.prototype.has.call(this, value.join(this._joint));
+    };
+    CoordinateSet.prototype.add = function (value) {
+        return _super.prototype.add.call(this, value.join(this._joint));
+    };
+    CoordinateSet.prototype.delete = function (value) {
+        return _super.prototype.delete.call(this, value.join(this._joint));
+    };
+    CoordinateSet.prototype._setJoint = function (v) {
         this._joint = v;
-    }
-}
+    };
+    return CoordinateSet;
+}(Set));
 exports.CoordinateSet = CoordinateSet;
+//# sourceMappingURL=coordinate-set.js.map

package/dist/data-structures/hash/coordinate-set.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"coordinate-set.js","sourceRoot":"","sources":["../../../src/data-structures/hash/coordinate-set.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;AAOA;IAAmC,iCAAQ;IACzC,uBAAY,KAAc;QAA1B,YACE,iBAAO,SAER;QAES,YAAM,GAAG,GAAG,CAAC;QAHrB,IAAI,KAAK,KAAK,SAAS;YAAE,KAAI,CAAC,MAAM,GAAG,KAAK,CAAC;;IAC/C,CAAC;IAID,sBAAI,gCAAK;aAAT;YACE,OAAO,IAAI,CAAC,MAAM,CAAC;QACrB,CAAC;;;OAAA;IASQ,2BAAG,GAAZ,UAAa,KAAe;QAC1B,OAAO,iBAAM,GAAG,YAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAC5C,CAAC;IASQ,2BAAG,GAAZ,UAAa,KAAe;QAC1B,OAAO,iBAAM,GAAG,YAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAC5C,CAAC;IASQ,8BAAM,GAAf,UAAgB,KAAe;QAC7B,OAAO,iBAAM,MAAM,YAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAC/C,CAAC;IAES,iCAAS,GAAnB,UAAoB,CAAS;QAC3B,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IAClB,CAAC;IACH,oBAAC;AAAD,CAAC,AAhDD,CAAmC,GAAG,GAgDrC;AAhDY,sCAAa"}

package/dist/data-structures/hash/hash-table.js

@@ -1,6 +1,10 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.HashTable = void 0;
-class HashTable {
-}
+var HashTable = (function () {
+    function HashTable() {
+    }
+    return HashTable;
+}());
 exports.HashTable = HashTable;
+//# sourceMappingURL=hash-table.js.map

package/dist/data-structures/hash/hash-table.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"hash-table.js","sourceRoot":"","sources":["../../../src/data-structures/hash/hash-table.ts"],"names":[],"mappings":";;;AAAA;IAAA;IAAwB,CAAC;IAAD,gBAAC;AAAD,CAAC,AAAzB,IAAyB;AAAZ,8BAAS"}

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

@@ -20,3 +20,4 @@ __exportStar(require("./coordinate-set"), exports);
 __exportStar(require("./pair"), exports);
 __exportStar(require("./tree-map"), exports);
 __exportStar(require("./tree-set"), exports);
+//# sourceMappingURL=index.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/data-structures/hash/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;AAAA,+CAA6B;AAC7B,mDAAiC;AACjC,mDAAiC;AACjC,yCAAuB;AACvB,6CAA2B;AAC3B,6CAA2B"}

package/dist/data-structures/hash/pair.js

@@ -1,6 +1,10 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.Pair = void 0;
-class Pair {
-}
+var Pair = (function () {
+    function Pair() {
+    }
+    return Pair;
+}());
 exports.Pair = Pair;
+//# sourceMappingURL=pair.js.map

package/dist/data-structures/hash/pair.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"pair.js","sourceRoot":"","sources":["../../../src/data-structures/hash/pair.ts"],"names":[],"mappings":";;;AAAA;IAAA;IAAmB,CAAC;IAAD,WAAC;AAAD,CAAC,AAApB,IAAoB;AAAP,oBAAI"}

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

@@ -1,6 +1,10 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.TreeMap = void 0;
-class TreeMap {
-}
+var TreeMap = (function () {
+    function TreeMap() {
+    }
+    return TreeMap;
+}());
 exports.TreeMap = TreeMap;
+//# sourceMappingURL=tree-map.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"tree-map.js","sourceRoot":"","sources":["../../../src/data-structures/hash/tree-map.ts"],"names":[],"mappings":";;;AAAA;IAAA;IAAsB,CAAC;IAAD,cAAC;AAAD,CAAC,AAAvB,IAAuB;AAAV,0BAAO"}

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

@@ -1,6 +1,10 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.TreeSet = void 0;
-class TreeSet {
-}
+var TreeSet = (function () {
+    function TreeSet() {
+    }
+    return TreeSet;
+}());
 exports.TreeSet = TreeSet;
+//# sourceMappingURL=tree-set.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"tree-set.js","sourceRoot":"","sources":["../../../src/data-structures/hash/tree-set.ts"],"names":[],"mappings":";;;AAAA;IAAA;IAAsB,CAAC;IAAD,cAAC;AAAD,CAAC,AAAvB,IAAuB;AAAV,0BAAO"}

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

@@ -1,157 +1,120 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.Heap = exports.HeapItem = void 0;
-class HeapItem {
-    /**
-     * The constructor function initializes an instance of a class with a priority and a value.
-     * @param {number} priority - The `priority` parameter is a number that represents the priority of the value. It is
-     * optional and has a default value of `NaN`.
-     * @param {T | null} [val=null] - The `val` parameter is of type `T | null`, which means it can accept a value of type
-     * `T` or `null`.
-     */
-    constructor(priority = Number.MAX_SAFE_INTEGER, val = null) {
+var HeapItem = (function () {
+    function HeapItem(priority, val) {
+        if (priority === void 0) { priority = Number.MAX_SAFE_INTEGER; }
+        if (val === void 0) { val = null; }
         this._val = val;
         this._priority = priority;
     }
-    get priority() {
-        return this._priority;
-    }
-    set priority(value) {
-        this._priority = value;
-    }
-    get val() {
-        return this._val;
-    }
-    set val(value) {
-        this._val = value;
-    }
-}
+    Object.defineProperty(HeapItem.prototype, "priority", {
+        get: function () {
+            return this._priority;
+        },
+        set: function (value) {
+            this._priority = value;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(HeapItem.prototype, "val", {
+        get: function () {
+            return this._val;
+        },
+        set: function (value) {
+            this._val = value;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    return HeapItem;
+}());
 exports.HeapItem = HeapItem;
-class Heap {
-    /**
-     * The function is a constructor for a class that initializes a priority callback function based on the
-     * options provided.
-     * @param [options] - An optional object that contains configuration options for the Heap.
-     */
-    constructor(options) {
+var Heap = (function () {
+    function Heap(options) {
         if (options) {
-            const { priorityExtractor } = options;
+            var priorityExtractor = options.priorityExtractor;
             if (priorityExtractor !== undefined && typeof priorityExtractor !== 'function') {
                 throw new Error('.constructor expects a valid priority function');
             }
-            this._priorityExtractor = priorityExtractor || ((el) => +el);
+            this._priorityExtractor = priorityExtractor || (function (el) { return +el; });
         }
         else {
-            this._priorityExtractor = (el) => +el;
+            this._priorityExtractor = function (el) { return +el; };
         }
     }
-    get pq() {
-        return this._pq;
-    }
-    get priorityExtractor() {
-        return this._priorityExtractor;
-    }
-    /**
-     * The function returns the size of a priority queue.
-     * @returns The size of the priority queue.
-     */
-    get size() {
-        return this._pq.size;
-    }
-    /**
-     * The function checks if a priority queue is empty.
-     * @returns {boolean} A boolean value indicating whether the size of the priority queue is less than 1.
-     */
-    isEmpty() {
+    Object.defineProperty(Heap.prototype, "pq", {
+        get: function () {
+            return this._pq;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(Heap.prototype, "priorityExtractor", {
+        get: function () {
+            return this._priorityExtractor;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(Heap.prototype, "size", {
+        get: function () {
+            return this._pq.size;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Heap.prototype.isEmpty = function () {
         return this._pq.size < 1;
-    }
-    /**
-     * The `peek` function returns the top item in the priority queue without removing it.
-     * @returns The `peek()` method is returning either a `HeapItem<T>` object or `null`.Returns an val with the highest priority in the queue
-     */
-    peek(isItem) {
+    };
+    Heap.prototype.peek = function (isItem) {
         isItem = isItem !== null && isItem !== void 0 ? isItem : false;
-        const peeked = this._pq.peek();
+        var peeked = this._pq.peek();
         return isItem ? peeked : peeked === null || peeked === void 0 ? void 0 : peeked.val;
-    }
-    /**
-     * The `peekLast` function returns the last item in the heap.
-     * @returns The method `peekLast()` returns either a `HeapItem<T>` object or `null`.Returns an val with the lowest priority in the queue
-     */
-    peekLast(isItem) {
+    };
+    Heap.prototype.peekLast = function (isItem) {
         isItem = isItem !== null && isItem !== void 0 ? isItem : false;
-        const leafItem = this._pq.leaf();
+        var leafItem = this._pq.leaf();
         return isItem ? leafItem : leafItem === null || leafItem === void 0 ? void 0 : leafItem.val;
-    }
-    /**
-     * The `add` function adds an val to a priority queue with an optional priority value.
-     * @param {T} val - The `val` parameter represents the value that you want to add to the heap. It can be of any
-     * type.
-     * @param {number} [priority] - The `priority` parameter is an optional number that represents the priority of the
-     * val being added to the heap. If the `val` parameter is a number, then the `priority` parameter is set to
-     * the value of `val`. If the `val` parameter is not a number, then the
-     * @returns The `add` method returns the instance of the `Heap` class.
-     * @throws {Error} if priority is not a valid number
-     */
-    add(priority, val) {
-        val = (val === undefined) ? priority : val;
+    };
+    Heap.prototype.add = function (priority, val) {
+        val = val === undefined ? priority : val;
         this._pq.add(new HeapItem(priority, val));
         return this;
-    }
-    /**
-     * The `poll` function returns the top item from a priority queue or null if the queue is empty.Removes and returns an val with the highest priority in the queue
-     * @returns either a HeapItem<T> object or null.
-     */
-    poll(isItem) {
+    };
+    Heap.prototype.poll = function (isItem) {
         isItem = isItem !== null && isItem !== void 0 ? isItem : false;
-        const top = this._pq.poll();
+        var top = this._pq.poll();
         if (!top) {
             return null;
         }
         return isItem ? top : top.val;
-    }
-    /**
-     * The function checks if a given node or value exists in the priority queue.
-     * @param {T | HeapItem<T>} node - The parameter `node` can be of type `T` or `HeapItem<T>`.
-     * @returns a boolean value.
-     */
-    has(node) {
+    };
+    Heap.prototype.has = function (node) {
         if (node instanceof HeapItem) {
             return this.pq.getNodes().includes(node);
         }
         else {
-            return this.pq.getNodes().findIndex(item => {
+            return (this.pq.getNodes().findIndex(function (item) {
                 return item.val === node;
-            }) !== -1;
+            }) !== -1);
         }
-    }
-    /**
-     * The `toArray` function returns an array of `HeapItem<T>` objects.
-     * @returns An array of HeapItem<T> objects.Returns a sorted list of vals
-     */
-    toArray(isItem) {
+    };
+    Heap.prototype.toArray = function (isItem) {
         isItem = isItem !== null && isItem !== void 0 ? isItem : false;
-        const itemArray = this._pq.toArray();
-        return isItem ? itemArray : itemArray.map(item => item.val);
-    }
-    /**
-     * The function sorts the elements in the priority queue and returns either the sorted items or their values depending
-     * on the value of the isItem parameter.
-     * @param {boolean} [isItem] - The `isItem` parameter is a boolean flag that indicates whether the sorted result should
-     * be an array of `HeapItem<T>` objects or an array of the values (`T`) of those objects. If `isItem` is `true`, the
-     * sorted result will be an array of `HeapItem
-     * @returns an array of either `HeapItem<T>`, `null`, `T`, or `undefined` values.
-     */
-    sort(isItem) {
+        var itemArray = this._pq.toArray();
+        return isItem ? itemArray : itemArray.map(function (item) { return item.val; });
+    };
+    Heap.prototype.sort = function (isItem) {
         isItem = isItem !== null && isItem !== void 0 ? isItem : false;
-        const sorted = this._pq.sort();
-        return isItem ? sorted : sorted.map(item => item.val);
-    }
-    /**
-     * The clear function clears the priority queue.
-     */
-    clear() {
+        var sorted = this._pq.sort();
+        return isItem ? sorted : sorted.map(function (item) { return item.val; });
+    };
+    Heap.prototype.clear = function () {
         this._pq.clear();
-    }
-}
+    };
+    return Heap;
+}());
 exports.Heap = Heap;
+//# sourceMappingURL=heap.js.map

package/dist/data-structures/heap/heap.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"heap.js","sourceRoot":"","sources":["../../../src/data-structures/heap/heap.ts"],"names":[],"mappings":";;;AAUA;IAQE,kBAAY,QAA0C,EAAE,GAAoB;QAAhE,yBAAA,EAAA,WAAmB,MAAM,CAAC,gBAAgB;QAAE,oBAAA,EAAA,UAAoB;QAC1E,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC;QAChB,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC;IAC5B,CAAC;IAID,sBAAI,8BAAQ;aAAZ;YACE,OAAO,IAAI,CAAC,SAAS,CAAC;QACxB,CAAC;aAED,UAAa,KAAa;YACxB,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC;QACzB,CAAC;;;OAJA;IAQD,sBAAI,yBAAG;aAAP;YACE,OAAO,IAAI,CAAC,IAAI,CAAC;QACnB,CAAC;aAED,UAAQ,KAAe;YACrB,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC;QACpB,CAAC;;;OAJA;IAKH,eAAC;AAAD,CAAC,AAhCD,IAgCC;AAhCY,4BAAQ;AAkCrB;IAME,cAAsB,OAAwB;QAC5C,IAAI,OAAO,EAAE;YACH,IAAA,iBAAiB,GAAK,OAAO,kBAAZ,CAAa;YACtC,IAAI,iBAAiB,KAAK,SAAS,IAAI,OAAO,iBAAiB,KAAK,UAAU,EAAE;gBAC9E,MAAM,IAAI,KAAK,CAAC,gDAAgD,CAAC,CAAC;aACnE;YACD,IAAI,CAAC,kBAAkB,GAAG,iBAAiB,IAAI,CAAC,UAAA,EAAE,IAAI,OAAA,CAAC,EAAE,EAAH,CAAG,CAAC,CAAC;SAC5D;aAAM;YACL,IAAI,CAAC,kBAAkB,GAAG,UAAA,EAAE,IAAI,OAAA,CAAC,EAAE,EAAH,CAAG,CAAC;SACrC;IACH,CAAC;IAID,sBAAI,oBAAE;aAAN;YACE,OAAO,IAAI,CAAC,GAAG,CAAC;QAClB,CAAC;;;OAAA;IAGD,sBAAI,mCAAiB;aAArB;YACE,OAAO,IAAI,CAAC,kBAAkB,CAAC;QACjC,CAAC;;;OAAA;IAMD,sBAAI,sBAAI;aAAR;YACE,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC;QACvB,CAAC;;;OAAA;IAMD,sBAAO,GAAP;QACE,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC;IAC3B,CAAC;IAUD,mBAAI,GAAJ,UAAK,MAAgB;QACnB,MAAM,GAAG,MAAM,aAAN,MAAM,cAAN,MAAM,GAAI,KAAK,CAAC;QACzB,IAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;QAE/B,OAAO,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,aAAN,MAAM,uBAAN,MAAM,CAAE,GAAG,CAAC;IACvC,CAAC;IAUD,uBAAQ,GAAR,UAAS,MAAgB;QACvB,MAAM,GAAG,MAAM,aAAN,MAAM,cAAN,MAAM,GAAI,KAAK,CAAC;QACzB,IAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;QAEjC,OAAO,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,aAAR,QAAQ,uBAAR,QAAQ,CAAE,GAAG,CAAC;IAC3C,CAAC;IAYD,kBAAG,GAAH,UAAI,QAAgB,EAAE,GAAO;QAC3B,GAAG,GAAG,GAAG,KAAK,SAAS,CAAC,CAAC,CAAE,QAAyB,CAAC,CAAC,CAAC,GAAG,CAAC;QAC3D,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,QAAQ,CAAI,QAAQ,EAAE,GAAG,CAAC,CAAC,CAAC;QAE7C,OAAO,IAAI,CAAC;IACd,CAAC;IAUD,mBAAI,GAAJ,UAAK,MAAgB;QACnB,MAAM,GAAG,MAAM,aAAN,MAAM,cAAN,MAAM,GAAI,KAAK,CAAC;QACzB,IAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;QAC5B,IAAI,CAAC,GAAG,EAAE;YACR,OAAO,IAAI,CAAC;SACb;QAED,OAAO,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC;IAChC,CAAC;IAOD,kBAAG,GAAH,UAAI,IAAqB;QACvB,IAAI,IAAI,YAAY,QAAQ,EAAE;YAC5B,OAAO,IAAI,CAAC,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;SAC1C;aAAM;YACL,OAAO,CACL,IAAI,CAAC,EAAE,CAAC,QAAQ,EAAE,CAAC,SAAS,CAAC,UAAA,IAAI;gBAC/B,OAAO,IAAI,CAAC,GAAG,KAAK,IAAI,CAAC;YAC3B,CAAC,CAAC,KAAK,CAAC,CAAC,CACV,CAAC;SACH;IACH,CAAC;IAUD,sBAAO,GAAP,UAAQ,MAAgB;QACtB,MAAM,GAAG,MAAM,aAAN,MAAM,cAAN,MAAM,GAAI,KAAK,CAAC;QACzB,IAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC;QAErC,OAAO,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,UAAA,IAAI,IAAI,OAAA,IAAI,CAAC,GAAG,EAAR,CAAQ,CAAC,CAAC;IAC9D,CAAC;IAcD,mBAAI,GAAJ,UAAK,MAAgB;QACnB,MAAM,GAAG,MAAM,aAAN,MAAM,cAAN,MAAM,GAAI,KAAK,CAAC;QACzB,IAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;QAE/B,OAAO,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,UAAA,IAAI,IAAI,OAAA,IAAI,CAAC,GAAG,EAAR,CAAQ,CAAC,CAAC;IACxD,CAAC;IAKD,oBAAK,GAAL;QACE,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC;IACnB,CAAC;IACH,WAAC;AAAD,CAAC,AAvKD,IAuKC;AAvKqB,oBAAI"}

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

@@ -17,3 +17,4 @@ Object.defineProperty(exports, "__esModule", { value: true });
 __exportStar(require("./max-heap"), exports);
 __exportStar(require("./min-heap"), exports);
 __exportStar(require("./heap"), exports);
+//# sourceMappingURL=index.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/data-structures/heap/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;AAAA,6CAA2B;AAC3B,6CAA2B;AAC3B,yCAAuB"}

package/dist/data-structures/heap/max-heap.js

@@ -1,30 +1,33 @@
 "use strict";
-/**
- * data-structure-typed
- *
- * @author Tyler Zeng
- * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT License
- */
+var __extends = (this && this.__extends) || (function () {
+    var extendStatics = function (d, b) {
+        extendStatics = Object.setPrototypeOf ||
+            ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
+            function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };
+        return extendStatics(d, b);
+    };
+    return function (d, b) {
+        if (typeof b !== "function" && b !== null)
+            throw new TypeError("Class extends value " + String(b) + " is not a constructor or null");
+        extendStatics(d, b);
+        function __() { this.constructor = d; }
+        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
+    };
+})();
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.MaxHeap = void 0;
-const heap_1 = require("./heap");
-const priority_queue_1 = require("../priority-queue");
-/**
- * @class MaxHeap
- * @extends Heap
- */
-class MaxHeap extends heap_1.Heap {
-    /**
-     * The constructor initializes a PriorityQueue with a custom comparator function.
-     * @param [options] - The `options` parameter is an optional object that can be passed to the constructor. It is of
-     * type `HeapOptions<T>`, which is a generic type that represents the options for the heap.
-     */
-    constructor(options) {
-        super(options);
-        this._pq = new priority_queue_1.PriorityQueue({
-            comparator: (a, b) => b.priority - a.priority
+var heap_1 = require("./heap");
+var priority_queue_1 = require("../priority-queue");
+var MaxHeap = (function (_super) {
+    __extends(MaxHeap, _super);
+    function MaxHeap(options) {
+        var _this = _super.call(this, options) || this;
+        _this._pq = new priority_queue_1.PriorityQueue({
+            comparator: function (a, b) { return b.priority - a.priority; }
         });
+        return _this;
     }
-}
+    return MaxHeap;
+}(heap_1.Heap));
 exports.MaxHeap = MaxHeap;
+//# sourceMappingURL=max-heap.js.map

package/dist/data-structures/heap/max-heap.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"max-heap.js","sourceRoot":"","sources":["../../../src/data-structures/heap/max-heap.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;AAQA,+BAAwC;AACxC,oDAAkD;AAOlD;IAAyC,2BAAO;IAQ9C,iBAAY,OAAwB;QAApC,YACE,kBAAM,OAAO,CAAC,SAIf;QAHC,KAAI,CAAC,GAAG,GAAG,IAAI,8BAAa,CAAc;YACxC,UAAU,EAAE,UAAC,CAAC,EAAE,CAAC,IAAK,OAAA,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,EAAvB,CAAuB;SAC9C,CAAC,CAAC;;IACL,CAAC;IACH,cAAC;AAAD,CAAC,AAdD,CAAyC,WAAI,GAc5C;AAdY,0BAAO"}

package/dist/data-structures/heap/min-heap.js

@@ -1,31 +1,33 @@
 "use strict";
-/**
- * data-structure-typed
- *
- * @author Tyler Zeng
- * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT License
- */
+var __extends = (this && this.__extends) || (function () {
+    var extendStatics = function (d, b) {
+        extendStatics = Object.setPrototypeOf ||
+            ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
+            function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };
+        return extendStatics(d, b);
+    };
+    return function (d, b) {
+        if (typeof b !== "function" && b !== null)
+            throw new TypeError("Class extends value " + String(b) + " is not a constructor or null");
+        extendStatics(d, b);
+        function __() { this.constructor = d; }
+        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
+    };
+})();
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.MinHeap = void 0;
-const heap_1 = require("./heap");
-const priority_queue_1 = require("../priority-queue");
-/**
- * @class MinHeap
- * @extends Heap
- */
-class MinHeap extends heap_1.Heap {
-    /**
-     * The constructor initializes a PriorityQueue with a comparator function that compares the priority of two HeapItem
-     * objects.
-     * @param [options] - The `options` parameter is an optional object that can be passed to the constructor. It is of
-     * type `HeapOptions<T>`, which is a generic type that represents the options for the heap.
-     */
-    constructor(options) {
-        super(options);
-        this._pq = new priority_queue_1.PriorityQueue({
-            comparator: (a, b) => a.priority - b.priority
+var heap_1 = require("./heap");
+var priority_queue_1 = require("../priority-queue");
+var MinHeap = (function (_super) {
+    __extends(MinHeap, _super);
+    function MinHeap(options) {
+        var _this = _super.call(this, options) || this;
+        _this._pq = new priority_queue_1.PriorityQueue({
+            comparator: function (a, b) { return a.priority - b.priority; }
         });
+        return _this;
     }
-}
+    return MinHeap;
+}(heap_1.Heap));
 exports.MinHeap = MinHeap;
+//# sourceMappingURL=min-heap.js.map

package/dist/data-structures/heap/min-heap.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"min-heap.js","sourceRoot":"","sources":["../../../src/data-structures/heap/min-heap.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;AAQA,+BAAwC;AACxC,oDAAkD;AAOlD;IAAyC,2BAAO;IAS9C,iBAAY,OAAwB;QAApC,YACE,kBAAM,OAAO,CAAC,SAIf;QAHC,KAAI,CAAC,GAAG,GAAG,IAAI,8BAAa,CAAc;YACxC,UAAU,EAAE,UAAC,CAAC,EAAE,CAAC,IAAK,OAAA,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,EAAvB,CAAuB;SAC9C,CAAC,CAAC;;IACL,CAAC;IACH,cAAC;AAAD,CAAC,AAfD,CAAyC,WAAI,GAe5C;AAfY,0BAAO"}

package/dist/data-structures/index.js

@@ -25,3 +25,4 @@ __exportStar(require("./heap"), exports);
 __exportStar(require("./priority-queue"), exports);
 __exportStar(require("./matrix"), exports);
 __exportStar(require("./trie"), exports);
+//# sourceMappingURL=index.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/data-structures/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;AAAA,yCAAuB;AACvB,gDAA8B;AAC9B,0CAAwB;AACxB,0CAAwB;AACxB,0CAAwB;AACxB,gDAA8B;AAC9B,yCAAuB;AACvB,yCAAuB;AACvB,mDAAiC;AACjC,2CAAyB;AACzB,yCAAuB"}