data-structure-typed 0.8.18 → 0.9.16

package/dist/data-structures/graph/undirected-graph.js

@@ -1,142 +1,227 @@
 "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 __());
+    };
+})();
+var __values = (this && this.__values) || function(o) {
+    var s = typeof Symbol === "function" && Symbol.iterator, m = s && o[s], i = 0;
+    if (m) return m.call(o);
+    if (o && typeof o.length === "number") return {
+        next: function () {
+            if (o && i >= o.length) o = void 0;
+            return { value: o && o[i++], done: !o };
+        }
+    };
+    throw new TypeError(s ? "Object is not iterable." : "Symbol.iterator is not defined.");
+};
+var __read = (this && this.__read) || function (o, n) {
+    var m = typeof Symbol === "function" && o[Symbol.iterator];
+    if (!m) return o;
+    var i = m.call(o), r, ar = [], e;
+    try {
+        while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);
+    }
+    catch (error) { e = { error: error }; }
+    finally {
+        try {
+            if (r && !r.done && (m = i["return"])) m.call(i);
+        }
+        finally { if (e) throw e.error; }
+    }
+    return ar;
+};
+var __spreadArray = (this && this.__spreadArray) || function (to, from, pack) {
+    if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {
+        if (ar || !(i in from)) {
+            if (!ar) ar = Array.prototype.slice.call(from, 0, i);
+            ar[i] = from[i];
+        }
+    }
+    return to.concat(ar || Array.prototype.slice.call(from));
+};
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.UndirectedGraph = exports.UndirectedEdge = exports.UndirectedVertex = void 0;
-const utils_1 = require("../../utils");
-const abstract_graph_1 = require("./abstract-graph");
-class UndirectedVertex extends abstract_graph_1.AbstractVertex {
-    constructor(id) {
-        super(id);
+var utils_1 = require("../../utils");
+var abstract_graph_1 = require("./abstract-graph");
+var UndirectedVertex = /** @class */ (function (_super) {
+    __extends(UndirectedVertex, _super);
+    function UndirectedVertex(id) {
+        return _super.call(this, id) || this;
     }
-}
+    return UndirectedVertex;
+}(abstract_graph_1.AbstractVertex));
 exports.UndirectedVertex = UndirectedVertex;
-class UndirectedEdge extends abstract_graph_1.AbstractEdge {
-    get vertices() {
-        return this._vertices;
+var UndirectedEdge = /** @class */ (function (_super) {
+    __extends(UndirectedEdge, _super);
+    function UndirectedEdge(v1, v2, weight) {
+        var _this = _super.call(this, weight) || this;
+        _this._vertices = [v1, v2];
+        return _this;
     }
-    set vertices(v) {
-        this._vertices = v;
-    }
-    constructor(v1, v2, weight) {
-        super(weight);
-        this._vertices = [v1, v2];
-    }
-}
+    Object.defineProperty(UndirectedEdge.prototype, "vertices", {
+        get: function () {
+            return this._vertices;
+        },
+        set: function (v) {
+            this._vertices = v;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    return UndirectedEdge;
+}(abstract_graph_1.AbstractEdge));
 exports.UndirectedEdge = UndirectedEdge;
-class UndirectedGraph extends abstract_graph_1.AbstractGraph {
-    constructor() {
-        super();
-        this._edges = new Map();
+var UndirectedGraph = /** @class */ (function (_super) {
+    __extends(UndirectedGraph, _super);
+    function UndirectedGraph() {
+        var _this = _super.call(this) || this;
+        _this._edges = new Map();
+        return _this;
     }
-    getEdge(v1, v2) {
+    UndirectedGraph.prototype.getEdge = function (v1, v2) {
         var _a;
-        let edges = [];
+        var 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.id));
+            var vertex1 = this.getVertex(v1);
+            var vertex2_1 = this.getVertex(v2);
+            if (vertex1 && vertex2_1) {
+                edges = (_a = this._edges.get(vertex1)) === null || _a === void 0 ? void 0 : _a.filter(function (e) { return e.vertices.includes(vertex2_1.id); });
             }
         }
         return edges ? edges[0] || null : null;
-    }
-    addEdge(edge) {
-        for (const end of edge.vertices) {
-            const endVertex = this.getVertex(end);
-            if (endVertex === null)
-                return false;
-            if (endVertex) {
-                const edges = this._edges.get(endVertex);
-                if (edges) {
-                    edges.push(edge);
-                }
-                else {
-                    this._edges.set(endVertex, [edge]);
+    };
+    UndirectedGraph.prototype.addEdge = function (edge) {
+        var e_1, _a;
+        try {
+            for (var _b = __values(edge.vertices), _c = _b.next(); !_c.done; _c = _b.next()) {
+                var end = _c.value;
+                var endVertex = this.getVertex(end);
+                if (endVertex === null)
+                    return false;
+                if (endVertex) {
+                    var edges = this._edges.get(endVertex);
+                    if (edges) {
+                        edges.push(edge);
+                    }
+                    else {
+                        this._edges.set(endVertex, [edge]);
+                    }
                 }
             }
         }
+        catch (e_1_1) { e_1 = { error: e_1_1 }; }
+        finally {
+            try {
+                if (_c && !_c.done && (_a = _b.return)) _a.call(_b);
+            }
+            finally { if (e_1) throw e_1.error; }
+        }
         return true;
-    }
-    removeEdgeBetween(v1, v2) {
-        const vertex1 = this.getVertex(v1);
-        const vertex2 = this.getVertex(v2);
+    };
+    UndirectedGraph.prototype.removeEdgeBetween = function (v1, v2) {
+        var vertex1 = this.getVertex(v1);
+        var vertex2 = this.getVertex(v2);
         if (!vertex1 || !vertex2) {
             return null;
         }
-        const v1Edges = this._edges.get(vertex1);
-        let removed = null;
+        var v1Edges = this._edges.get(vertex1);
+        var removed = null;
         if (v1Edges) {
-            removed = (0, utils_1.arrayRemove)(v1Edges, e => e.vertices.includes(vertex2.id))[0] || null;
+            removed = (0, utils_1.arrayRemove)(v1Edges, function (e) { return e.vertices.includes(vertex2.id); })[0] || null;
         }
-        const v2Edges = this._edges.get(vertex2);
+        var v2Edges = this._edges.get(vertex2);
         if (v2Edges) {
-            (0, utils_1.arrayRemove)(v2Edges, e => e.vertices.includes(vertex1.id));
+            (0, utils_1.arrayRemove)(v2Edges, function (e) { return e.vertices.includes(vertex1.id); });
         }
         return removed;
-    }
-    removeEdge(edge) {
+    };
+    UndirectedGraph.prototype.removeEdge = function (edge) {
         return this.removeEdgeBetween(edge.vertices[0], edge.vertices[1]);
-    }
-    degreeOf(vertexOrId) {
+    };
+    UndirectedGraph.prototype.degreeOf = function (vertexOrId) {
         var _a;
-        const vertex = this.getVertex(vertexOrId);
+        var vertex = this.getVertex(vertexOrId);
         if (vertex) {
             return ((_a = this._edges.get(vertex)) === null || _a === void 0 ? void 0 : _a.length) || 0;
         }
         else {
             return 0;
         }
-    }
-    edgesOf(vertexOrId) {
-        const vertex = this.getVertex(vertexOrId);
+    };
+    UndirectedGraph.prototype.edgesOf = function (vertexOrId) {
+        var vertex = this.getVertex(vertexOrId);
         if (vertex) {
             return this._edges.get(vertex) || [];
         }
         else {
             return [];
         }
-    }
-    edgeSet() {
-        const edgeSet = new Set();
-        this._edges.forEach(edges => {
-            edges.forEach(edge => {
+    };
+    UndirectedGraph.prototype.edgeSet = function () {
+        var edgeSet = new Set();
+        this._edges.forEach(function (edges) {
+            edges.forEach(function (edge) {
                 edgeSet.add(edge);
             });
         });
-        return [...edgeSet];
-    }
-    getEdgesOf(vertexOrId) {
-        const vertex = this.getVertex(vertexOrId);
+        return __spreadArray([], __read(edgeSet), false);
+    };
+    UndirectedGraph.prototype.getEdgesOf = function (vertexOrId) {
+        var vertex = this.getVertex(vertexOrId);
         if (!vertex) {
             return [];
         }
         return this._edges.get(vertex) || [];
-    }
-    getNeighbors(vertexOrId) {
-        const neighbors = [];
-        const vertex = this.getVertex(vertexOrId);
+    };
+    UndirectedGraph.prototype.getNeighbors = function (vertexOrId) {
+        var e_2, _a;
+        var neighbors = [];
+        var vertex = this.getVertex(vertexOrId);
         if (vertex) {
-            const neighborEdges = this.getEdgesOf(vertex);
-            for (const edge of neighborEdges) {
-                const neighbor = this.getVertex(edge.vertices.filter(e => e !== vertex.id)[0]);
-                if (neighbor) {
-                    neighbors.push(neighbor);
+            var neighborEdges = this.getEdgesOf(vertex);
+            try {
+                for (var neighborEdges_1 = __values(neighborEdges), neighborEdges_1_1 = neighborEdges_1.next(); !neighborEdges_1_1.done; neighborEdges_1_1 = neighborEdges_1.next()) {
+                    var edge = neighborEdges_1_1.value;
+                    var neighbor = this.getVertex(edge.vertices.filter(function (e) { return e !== vertex.id; })[0]);
+                    if (neighbor) {
+                        neighbors.push(neighbor);
+                    }
+                }
+            }
+            catch (e_2_1) { e_2 = { error: e_2_1 }; }
+            finally {
+                try {
+                    if (neighborEdges_1_1 && !neighborEdges_1_1.done && (_a = neighborEdges_1.return)) _a.call(neighborEdges_1);
                 }
+                finally { if (e_2) throw e_2.error; }
             }
         }
         return neighbors;
-    }
-    getEndsOfEdge(edge) {
+    };
+    UndirectedGraph.prototype.getEndsOfEdge = function (edge) {
         if (!this.containsEdge(edge.vertices[0], edge.vertices[1])) {
             return null;
         }
-        const v1 = this.getVertex(edge.vertices[0]);
-        const v2 = this.getVertex(edge.vertices[1]);
+        var v1 = this.getVertex(edge.vertices[0]);
+        var v2 = this.getVertex(edge.vertices[1]);
         if (v1 && v2) {
             return [v1, v2];
         }
         else {
             return null;
         }
-    }
-}
+    };
+    return UndirectedGraph;
+}(abstract_graph_1.AbstractGraph));
 exports.UndirectedGraph = UndirectedGraph;

package/dist/data-structures/hash/coordinate-map.d.ts

@@ -1,4 +1,4 @@
-export declare class CoordinateSet<V> extends Map<any, V> {
+export declare class CoordinateMap<V> extends Map<any, V> {
     private readonly _joint;
     constructor(joint?: string);
     has(key: number[]): boolean;

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

@@ -1,24 +1,42 @@
 "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;
-class CoordinateSet extends Map {
-    constructor(joint) {
-        super();
-        this._joint = '_';
+exports.CoordinateMap = void 0;
+var CoordinateMap = /** @class */ (function (_super) {
+    __extends(CoordinateMap, _super);
+    function CoordinateMap(joint) {
+        var _this = _super.call(this) || this;
+        _this._joint = '_';
         if (joint !== undefined)
-            this._joint = joint;
+            _this._joint = joint;
+        return _this;
     }
-    has(key) {
-        return super.has(key.join(this._joint));
-    }
-    set(key, value) {
-        return super.set(key.join(this._joint), value);
-    }
-    get(key) {
-        return super.get(key.join(this._joint));
-    }
-    delete(key) {
-        return super.delete(key.join(this._joint));
-    }
-}
-exports.CoordinateSet = CoordinateSet;
+    CoordinateMap.prototype.has = function (key) {
+        return _super.prototype.has.call(this, key.join(this._joint));
+    };
+    CoordinateMap.prototype.set = function (key, value) {
+        return _super.prototype.set.call(this, key.join(this._joint), value);
+    };
+    CoordinateMap.prototype.get = function (key) {
+        return _super.prototype.get.call(this, key.join(this._joint));
+    };
+    CoordinateMap.prototype.delete = function (key) {
+        return _super.prototype.delete.call(this, key.join(this._joint));
+    };
+    return CoordinateMap;
+}(Map));
+exports.CoordinateMap = CoordinateMap;

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

@@ -1,21 +1,39 @@
 "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;
-class CoordinateSet extends Set {
-    constructor(joint) {
-        super();
-        this._joint = '_';
+var CoordinateSet = /** @class */ (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;
     }
-    has(value) {
-        return super.has(value.join(this._joint));
-    }
-    add(value) {
-        return super.add(value.join(this._joint));
-    }
-    delete(value) {
-        return super.delete(value.join(this._joint));
-    }
-}
+    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));
+    };
+    return CoordinateSet;
+}(Set));
 exports.CoordinateSet = CoordinateSet;

package/dist/data-structures/hash/index.d.ts

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

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

@@ -15,3 +15,8 @@ var __exportStar = (this && this.__exportStar) || function(m, exports) {
 };
 Object.defineProperty(exports, "__esModule", { value: true });
 __exportStar(require("./hash-table"), exports);
+__exportStar(require("./coordinate-map"), exports);
+__exportStar(require("./coordinate-set"), exports);
+__exportStar(require("./pair"), exports);
+__exportStar(require("./tree-map"), exports);
+__exportStar(require("./tree-set"), exports);

package/dist/data-structures/heap/heap.d.ts

@@ -1,13 +1,7 @@
 import { PriorityQueue } from '../priority-queue';
-export interface HeapOptions<T> {
-    priority?: (element: T) => number;
-}
-export interface HeapItem<T> {
-    priority: number;
-    element: T | null;
-}
+import type { HeapItem, HeapOptions } from '../types';
 /**
- * @copyright 2021 Pablo Rios <zrwusa@gmail.com>
+ * @copyright 2021 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT
  *
  * @abstract

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

@@ -2,60 +2,64 @@
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.Heap = void 0;
 /**
- * @copyright 2021 Pablo Rios <zrwusa@gmail.com>
+ * @copyright 2021 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT
  *
  * @abstract
  * @class Heap
  */
-class Heap {
+var Heap = /** @class */ (function () {
     /**
      * Creates a priority queue
      * @public
      * @params {object} [options]
      */
-    constructor(options) {
+    function Heap(options) {
         if (options) {
-            const { priority } = options;
+            var priority = options.priority;
             if (priority !== undefined && typeof priority !== 'function') {
                 throw new Error('.constructor expects a valid priority function');
             }
-            this._priorityCb = priority || ((el) => +el);
+            this._priorityCb = priority || (function (el) { return +el; });
         }
         else {
-            this._priorityCb = (el) => +el;
+            this._priorityCb = function (el) { return +el; };
         }
     }
-    /**
-     * @public
-     * @returns {number}
-     */
-    get size() {
-        return this._pq.size;
-    }
+    Object.defineProperty(Heap.prototype, "size", {
+        /**
+         * @public
+         * @returns {number}
+         */
+        get: function () {
+            return this._pq.size;
+        },
+        enumerable: false,
+        configurable: true
+    });
     /**
      * @public
      * @returns {boolean}
      */
-    isEmpty() {
+    Heap.prototype.isEmpty = function () {
         return this._pq.size < 1;
-    }
+    };
     /**
      * Returns an element with highest priority in the queue
      * @public
      * @returns {object}
      */
-    peek() {
+    Heap.prototype.peek = function () {
         return this._pq.peek();
-    }
+    };
     /**
      * Returns an element with lowest priority in the queue
      * @public
      * @returns {object}
      */
-    peekLast() {
+    Heap.prototype.peekLast = function () {
         return this._pq.leaf();
-    }
+    };
     /**
      * Adds an element to the queue
      * @public
@@ -63,7 +67,7 @@ class Heap {
      * @param priority
      * @throws {Error} if priority is not a valid number
      */
-    offer(element, priority) {
+    Heap.prototype.offer = function (element, priority) {
         if (typeof element === 'number') {
             priority = element;
         }
@@ -79,36 +83,37 @@ class Heap {
             throw new Error('.offer expects a numeric priority '
                 + 'or a constructor callback that returns a number');
         }
-        const _priority = !Number.isNaN(+priority) ? priority : this._priorityCb(element);
-        this._pq.offer({ priority: _priority, element });
+        var _priority = !Number.isNaN(+priority) ? priority : this._priorityCb(element);
+        this._pq.offer({ priority: _priority, element: element });
         return this;
-    }
+    };
     /**
      * Removes and returns an element with highest priority in the queue
      * @public
      * @returns {object}
      */
-    poll() {
-        const top = this._pq.poll();
+    Heap.prototype.poll = function () {
+        var top = this._pq.poll();
         if (!top) {
             return null;
         }
         return top;
-    }
+    };
     /**
      * Returns a sorted list of elements
      * @public
      * @returns {array}
      */
-    toArray() {
+    Heap.prototype.toArray = function () {
         return this._pq.toArray();
-    }
+    };
     /**
      * Clears the queue
      * @public
      */
-    clear() {
+    Heap.prototype.clear = function () {
         this._pq.clear();
-    }
-}
+    };
+    return Heap;
+}());
 exports.Heap = Heap;

package/dist/data-structures/heap/max-heap.d.ts

@@ -1,9 +1,10 @@
 /**
- * @copyright 2020 Pablo Rios <zrwusa@gmail.com>
+ * @copyright 2020 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT
  */
-import { Heap, HeapItem, HeapOptions } from './heap';
+import { Heap } from './heap';
 import { PriorityQueue } from '../priority-queue';
+import type { HeapItem, HeapOptions } from '../types';
 /**
  * @class MaxHeap
  * @extends Heap