data-structure-typed 1.21.4 → 1.31.0

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

@@ -1,252 +1,237 @@
 "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 __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));
+};
+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.");
+};
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.UndirectedGraph = exports.UndirectedEdge = exports.UndirectedVertex = void 0;
-/**
- * data-structure-typed
- *
- * @author Tyler Zeng
- * @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 {
-    /**
-     * The constructor function initializes a vertex with an optional value.
-     * @param {VertexId} id - The `id` parameter is of type `VertexId` and represents the identifier of the vertex. It is
-     * used to uniquely identify the vertex within a graph or network.
-     * @param {T} [val] - The "val" parameter is an optional parameter of type T. It is used to initialize the value of the
-     * vertex. If no value is provided, the vertex will be initialized with a default value.
-     */
-    constructor(id, val) {
-        super(id, val);
-    }
-}
+var utils_1 = require("../../utils");
+var abstract_graph_1 = require("./abstract-graph");
+var UndirectedVertex = (function (_super) {
+    __extends(UndirectedVertex, _super);
+    function UndirectedVertex(id, val) {
+        return _super.call(this, id, val) || this;
+    }
+    return UndirectedVertex;
+}(abstract_graph_1.AbstractVertex));
 exports.UndirectedVertex = UndirectedVertex;
-class UndirectedEdge extends abstract_graph_1.AbstractEdge {
-    /**
-     * The constructor function creates an instance of a class with two vertex IDs, an optional weight, and an optional
-     * value.
-     * @param {VertexId} v1 - The first vertex ID of the edge.
-     * @param {VertexId} v2 - The parameter `v2` is a `VertexId`, which represents the identifier of the second vertex in a
-     * graph edge.
-     * @param {number} [weight] - The weight parameter is an optional number that represents the weight of the edge.
-     * @param {T} [val] - The "val" parameter is an optional parameter of type T. It is used to store a value associated
-     * with the edge.
-     */
-    constructor(v1, v2, weight, val) {
-        super(weight, val);
-        this._vertices = [v1, v2];
-    }
-    get vertices() {
-        return this._vertices;
-    }
-    set vertices(v) {
-        this._vertices = v;
-    }
-}
+var UndirectedEdge = (function (_super) {
+    __extends(UndirectedEdge, _super);
+    function UndirectedEdge(v1, v2, weight, val) {
+        var _this = _super.call(this, weight, val) || this;
+        _this._vertices = [v1, v2];
+        return _this;
+    }
+    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 {
-    /**
-     * The constructor initializes a new Map object to store edges.
-     */
-    constructor() {
-        super();
-        this._edges = new Map();
-    }
-    get edges() {
-        return this._edges;
-    }
-    /**
-     * The function creates a new vertex with an optional value and returns it.
-     * @param {VertexId} id - The `id` parameter is the unique identifier for the vertex. It is used to distinguish one
-     * vertex from another in the graph.
-     * @param [val] - The `val` parameter is an optional value that can be assigned to the vertex. If a value is provided,
-     * it will be used as the value of the vertex. If no value is provided, the `id` parameter will be used as the value of
-     * the vertex.
-     * @returns The method is returning a new instance of the `UndirectedVertex` class, casted as type `V`.
-     */
-    createVertex(id, val) {
+var UndirectedGraph = (function (_super) {
+    __extends(UndirectedGraph, _super);
+    function UndirectedGraph() {
+        var _this = _super.call(this) || this;
+        _this._edges = new Map();
+        return _this;
+    }
+    Object.defineProperty(UndirectedGraph.prototype, "edges", {
+        get: function () {
+            return this._edges;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    UndirectedGraph.prototype.createVertex = function (id, val) {
         return new UndirectedVertex(id, val !== null && val !== void 0 ? val : id);
-    }
-    /**
-     * The function creates an undirected edge between two vertices with an optional weight and value.
-     * @param {VertexId} v1 - The parameter `v1` represents the first vertex of the edge.
-     * @param {VertexId} v2 - The parameter `v2` represents the second vertex of the edge.
-     * @param {number} [weight] - The `weight` parameter is an optional number that represents the weight of the edge. If
-     * no weight is provided, it defaults to 1.
-     * @param [val] - The `val` parameter is an optional value that can be assigned to the edge. It can be of any type and
-     * is used to store additional information or data associated with the edge.
-     * @returns a new instance of the `UndirectedEdge` class, which is casted as type `E`.
-     */
-    createEdge(v1, v2, weight, val) {
+    };
+    UndirectedGraph.prototype.createEdge = function (v1, v2, weight, val) {
         return new UndirectedEdge(v1, v2, weight !== null && weight !== void 0 ? weight : 1, val);
-    }
-    /**
-     * The function `getEdge` returns the first edge that connects two vertices, or null if no such edge exists.
-     * @param {V | null | VertexId} v1 - The parameter `v1` represents a vertex or vertex ID. It can be of type `V` (vertex
-     * object), `null`, or `VertexId` (a string or number representing the ID of a vertex).
-     * @param {V | null | VertexId} v2 - The parameter `v2` represents a vertex or vertex ID. It can be of type `V` (vertex
-     * object), `null`, or `VertexId` (vertex ID).
-     * @returns an edge (E) or null.
-     */
-    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;
-    }
-    /**
-     * The function removes an edge between two vertices in a graph and returns the removed edge.
-     * @param {V | VertexId} v1 - The parameter `v1` represents either a vertex object (`V`) or a vertex ID (`VertexId`).
-     * @param {V | VertexId} v2 - V | VertexId - This parameter can be either a vertex object (V) or a vertex ID
-     * (VertexId). It represents the second vertex of the edge that needs to be removed.
-     * @returns the removed edge (E) if it exists, or null if either of the vertices (V) does not exist.
-     */
-    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;
-    }
-    /**
-     * The removeEdge function removes an edge between two vertices in a graph.
-     * @param {E} edge - The parameter "edge" is of type E, which represents an edge in a graph.
-     * @returns The method is returning either the removed edge (of type E) or null if the edge was not found.
-     */
-    removeEdge(edge) {
+    };
+    UndirectedGraph.prototype.removeEdge = function (edge) {
         return this.removeEdgeBetween(edge.vertices[0], edge.vertices[1]);
-    }
-    /**
-     * The function `degreeOf` returns the degree of a vertex in a graph, which is the number of edges connected to that
-     * vertex.
-     * @param {VertexId | V} vertexOrId - The parameter `vertexOrId` can be either a `VertexId` or a `V`.
-     * @returns The function `degreeOf` returns the degree of a vertex in a graph. The degree of a vertex is the number of
-     * edges connected to that vertex.
-     */
-    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;
         }
-    }
-    /**
-     * The function returns the edges of a given vertex or vertex ID.
-     * @param {VertexId | V} vertexOrId - The parameter `vertexOrId` can be either a `VertexId` or a `V`. A `VertexId` is a
-     * unique identifier for a vertex in a graph, while `V` represents the type of the vertex.
-     * @returns an array of edges.
-     */
-    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 [];
         }
-    }
-    /**
-     * The function "edgeSet" returns an array of unique edges from a set of edges.
-     * @returns The method `edgeSet()` returns an array of type `E[]`.
-     */
-    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];
-    }
-    /**
-     * The function "getNeighbors" returns an array of neighboring vertices for a given vertex or vertex ID.
-     * @param {V | VertexId} vertexOrId - The parameter `vertexOrId` can be either a vertex object (`V`) or a vertex ID
-     * (`VertexId`).
-     * @returns an array of vertices (V[]).
-     */
-    getNeighbors(vertexOrId) {
-        const neighbors = [];
-        const vertex = this._getVertex(vertexOrId);
+        return __spreadArray([], __read(edgeSet), false);
+    };
+    UndirectedGraph.prototype.getNeighbors = function (vertexOrId) {
+        var e_1, _a;
+        var neighbors = [];
+        var vertex = this._getVertex(vertexOrId);
         if (vertex) {
-            const neighborEdges = this.edgesOf(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.edgesOf(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_1_1) { e_1 = { error: e_1_1 }; }
+            finally {
+                try {
+                    if (neighborEdges_1_1 && !neighborEdges_1_1.done && (_a = neighborEdges_1.return)) _a.call(neighborEdges_1);
+                }
+                finally { if (e_1) throw e_1.error; }
+            }
         }
         return neighbors;
-    }
-    /**
-     * The function "getEndsOfEdge" returns the vertices at the ends of an edge if the edge exists in the graph, otherwise
-     * it returns null.
-     * @param {E} edge - The parameter "edge" is of type E, which represents an edge in a graph.
-     * @returns The function `getEndsOfEdge` returns an array containing two vertices `[V, V]` if the edge exists in the
-     * graph. If the edge does not exist, it returns `null`.
-     */
-    getEndsOfEdge(edge) {
+    };
+    UndirectedGraph.prototype.getEndsOfEdge = function (edge) {
         if (!this.hasEdge(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;
         }
-    }
-    /**
-     * The function adds an edge to the graph by updating the adjacency list with the vertices of the edge.
-     * @param {E} edge - The parameter "edge" is of type E, which represents an edge in a graph.
-     * @returns a boolean value.
-     */
-    _addEdgeOnly(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._addEdgeOnly = function (edge) {
+        var e_2, _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_2_1) { e_2 = { error: e_2_1 }; }
+        finally {
+            try {
+                if (_c && !_c.done && (_a = _b.return)) _a.call(_b);
+            }
+            finally { if (e_2) throw e_2.error; }
+        }
         return true;
-    }
-    /**
-     * The function sets the edges of a graph.
-     * @param v - A map where the keys are of type V and the values are arrays of type E.
-     */
-    _setEdges(v) {
+    };
+    UndirectedGraph.prototype._setEdges = function (v) {
         this._edges = v;
-    }
-}
+    };
+    return UndirectedGraph;
+}(abstract_graph_1.AbstractGraph));
 exports.UndirectedGraph = UndirectedGraph;
+//# sourceMappingURL=undirected-graph.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"undirected-graph.js","sourceRoot":"","sources":["../../../src/data-structures/graph/undirected-graph.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAOA,qCAA0C;AAC1C,mDAA+E;AAI/E;IAAkD,oCAAiB;IAQjE,0BAAY,EAAY,EAAE,GAAO;eAC/B,kBAAM,EAAE,EAAE,GAAG,CAAC;IAChB,CAAC;IACH,uBAAC;AAAD,CAAC,AAXD,CAAkD,+BAAc,GAW/D;AAXY,4CAAgB;AAa7B;IAAgD,kCAAe;IAW7D,wBAAY,EAAY,EAAE,EAAY,EAAE,MAAe,EAAE,GAAO;QAAhE,YACE,kBAAM,MAAM,EAAE,GAAG,CAAC,SAEnB;QADC,KAAI,CAAC,SAAS,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;;IAC5B,CAAC;IAID,sBAAI,oCAAQ;aAAZ;YACE,OAAO,IAAI,CAAC,SAAS,CAAC;QACxB,CAAC;aAED,UAAa,CAAuB;YAClC,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;QACrB,CAAC;;;OAJA;IAKH,qBAAC;AAAD,CAAC,AAzBD,CAAgD,6BAAY,GAyB3D;AAzBY,wCAAc;AA2B3B;IAIU,mCAAmB;IAM3B;QAAA,YACE,iBAAO,SAER;QADC,KAAI,CAAC,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;;IAClC,CAAC;IAID,sBAAI,kCAAK;aAAT;YACE,OAAO,IAAI,CAAC,MAAM,CAAC;QACrB,CAAC;;;OAAA;IAWQ,sCAAY,GAArB,UAAsB,EAAY,EAAE,GAAc;QAChD,OAAO,IAAI,gBAAgB,CAAC,EAAE,EAAE,GAAG,aAAH,GAAG,cAAH,GAAG,GAAI,EAAE,CAAM,CAAC;IAClD,CAAC;IAYQ,oCAAU,GAAnB,UAAoB,EAAY,EAAE,EAAY,EAAE,MAAe,EAAE,GAAc;QAC7E,OAAO,IAAI,cAAc,CAAC,EAAE,EAAE,EAAE,EAAE,MAAM,aAAN,MAAM,cAAN,MAAM,GAAI,CAAC,EAAE,GAAG,CAAM,CAAC;IAC3D,CAAC;IAUD,iCAAO,GAAP,UAAQ,EAAuB,EAAE,EAAuB;;QACtD,IAAI,KAAK,GAAoB,EAAE,CAAC;QAEhC,IAAI,EAAE,KAAK,IAAI,IAAI,EAAE,KAAK,IAAI,EAAE;YAC9B,IAAM,OAAO,GAAa,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;YAC9C,IAAM,SAAO,GAAa,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;YAE9C,IAAI,OAAO,IAAI,SAAO,EAAE;gBACtB,KAAK,GAAG,MAAA,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,0CAAE,MAAM,CAAC,UAAA,CAAC,IAAI,OAAA,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,SAAO,CAAC,EAAE,CAAC,EAA/B,CAA+B,CAAC,CAAC;aAChF;SACF;QAED,OAAO,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;IACzC,CAAC;IASD,2CAAiB,GAAjB,UAAkB,EAAgB,EAAE,EAAgB;QAClD,IAAM,OAAO,GAAa,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;QAC9C,IAAM,OAAO,GAAa,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;QAE9C,IAAI,CAAC,OAAO,IAAI,CAAC,OAAO,EAAE;YACxB,OAAO,IAAI,CAAC;SACb;QAED,IAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACzC,IAAI,OAAO,GAAa,IAAI,CAAC;QAC7B,IAAI,OAAO,EAAE;YACX,OAAO,GAAG,IAAA,mBAAW,EAAI,OAAO,EAAE,UAAC,CAAI,IAAK,OAAA,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC,EAA/B,CAA+B,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;SACzF;QACD,IAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACzC,IAAI,OAAO,EAAE;YACX,IAAA,mBAAW,EAAI,OAAO,EAAE,UAAC,CAAI,IAAK,OAAA,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC,EAA/B,CAA+B,CAAC,CAAC;SACpE;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAOD,oCAAU,GAAV,UAAW,IAAO;QAChB,OAAO,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IACpE,CAAC;IASD,kCAAQ,GAAR,UAAS,UAAwB;;QAC/B,IAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;QAC3C,IAAI,MAAM,EAAE;YACV,OAAO,CAAA,MAAA,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,0CAAE,MAAM,KAAI,CAAC,CAAC;SAC7C;aAAM;YACL,OAAO,CAAC,CAAC;SACV;IACH,CAAC;IAQD,iCAAO,GAAP,UAAQ,UAAwB;QAC9B,IAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;QAC3C,IAAI,MAAM,EAAE;YACV,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;SACtC;aAAM;YACL,OAAO,EAAE,CAAC;SACX;IACH,CAAC;IAMD,iCAAO,GAAP;QACE,IAAM,OAAO,GAAW,IAAI,GAAG,EAAE,CAAC;QAClC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,UAAA,KAAK;YACvB,KAAK,CAAC,OAAO,CAAC,UAAA,IAAI;gBAChB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACpB,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QACH,gCAAW,OAAO,UAAE;IACtB,CAAC;IAQD,sCAAY,GAAZ,UAAa,UAAwB;;QACnC,IAAM,SAAS,GAAQ,EAAE,CAAC;QAC1B,IAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;QAC3C,IAAI,MAAM,EAAE;YACV,IAAM,aAAa,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;;gBAC3C,KAAmB,IAAA,kBAAA,SAAA,aAAa,CAAA,4CAAA,uEAAE;oBAA7B,IAAM,IAAI,0BAAA;oBACb,IAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,UAAA,CAAC,IAAI,OAAA,CAAC,KAAK,MAAM,CAAC,EAAE,EAAf,CAAe,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;oBAChF,IAAI,QAAQ,EAAE;wBACZ,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;qBAC1B;iBACF;;;;;;;;;SACF;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IASD,uCAAa,GAAb,UAAc,IAAO;QACnB,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE;YACrD,OAAO,IAAI,CAAC;SACb;QACD,IAAM,EAAE,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7C,IAAM,EAAE,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7C,IAAI,EAAE,IAAI,EAAE,EAAE;YACZ,OAAO,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;SACjB;aAAM;YACL,OAAO,IAAI,CAAC;SACb;IACH,CAAC;IAOS,sCAAY,GAAtB,UAAuB,IAAO;;;YAC5B,KAAkB,IAAA,KAAA,SAAA,IAAI,CAAC,QAAQ,CAAA,gBAAA,4BAAE;gBAA5B,IAAM,GAAG,WAAA;gBACZ,IAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;gBACvC,IAAI,SAAS,KAAK,IAAI;oBAAE,OAAO,KAAK,CAAC;gBACrC,IAAI,SAAS,EAAE;oBACb,IAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;oBACzC,IAAI,KAAK,EAAE;wBACT,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;qBAClB;yBAAM;wBACL,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;qBACpC;iBACF;aACF;;;;;;;;;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAMS,mCAAS,GAAnB,UAAoB,CAAc;QAChC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IAClB,CAAC;IACH,sBAAC;AAAD,CAAC,AA7ND,CAIU,8BAAa,GAyNtB;AA7NY,0CAAe"}

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

@@ -1,65 +1,53 @@
 "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.CoordinateMap = void 0;
-/**
- * data-structure-typed
- *
- * @author Tyler Zeng
- * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT License
- */
-class CoordinateMap extends Map {
-    constructor(joint) {
-        super();
-        this._joint = '_';
+var CoordinateMap = (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;
     }
-    get joint() {
-        return this._joint;
-    }
-    /**
-     * The "has" function overrides the base class's "has" function and checks if a key exists in the map by joining the
-     * key array with a specified delimiter.
-     * @param {number[]} key - The parameter "key" is an array of numbers.
-     * @returns The `has` method is being overridden to return the result of calling the `has` method of the superclass
-     * (`super.has`) with the `key` array joined together using the `_joint` property.
-     */
-    has(key) {
-        return super.has(key.join(this._joint));
-    }
-    /**
-     * The function overrides the set method of a Map object to convert the key from an array to a string using a specified
-     * delimiter before calling the original set method.
-     * @param {number[]} key - The key parameter is an array of numbers.
-     * @param {V} value - The value parameter is the value that you want to associate with the specified key.
-     * @returns The `set` method is returning the result of calling the `set` method of the superclass
-     * (`super.set(key.join(this._joint), value)`).
-     */
-    set(key, value) {
-        return super.set(key.join(this._joint), value);
-    }
-    /**
-     * The function overrides the get method to join the key array with a specified joint and then calls the super get
-     * method.
-     * @param {number[]} key - An array of numbers
-     * @returns The code is returning the value associated with the specified key in the map.
-     */
-    get(key) {
-        return super.get(key.join(this._joint));
-    }
-    /**
-     * The function overrides the delete method and joins the key array using a specified joint character before calling
-     * the super delete method.
-     * @param {number[]} key - An array of numbers that represents the key to be deleted.
-     * @returns The `delete` method is returning the result of calling the `delete` method on the superclass, with the
-     * `key` array joined together using the `_joint` property.
-     */
-    delete(key) {
-        return super.delete(key.join(this._joint));
-    }
-    _setJoint(v) {
+    Object.defineProperty(CoordinateMap.prototype, "joint", {
+        get: function () {
+            return this._joint;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    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));
+    };
+    CoordinateMap.prototype._setJoint = function (v) {
         this._joint = v;
-    }
-}
+    };
+    return CoordinateMap;
+}(Map));
 exports.CoordinateMap = CoordinateMap;
+//# sourceMappingURL=coordinate-map.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"coordinate-map.js","sourceRoot":"","sources":["../../../src/data-structures/hash/coordinate-map.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;AAOA;IAAsC,iCAAW;IAC/C,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,GAAa;QACxB,OAAO,iBAAM,GAAG,YAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAC1C,CAAC;IAUQ,2BAAG,GAAZ,UAAa,GAAa,EAAE,KAAQ;QAClC,OAAO,iBAAM,GAAG,YAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,KAAK,CAAC,CAAC;IACjD,CAAC;IAQQ,2BAAG,GAAZ,UAAa,GAAa;QACxB,OAAO,iBAAM,GAAG,YAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAC1C,CAAC;IASQ,8BAAM,GAAf,UAAgB,GAAa;QAC3B,OAAO,iBAAM,MAAM,YAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAC7C,CAAC;IAES,iCAAS,GAAnB,UAAoB,CAAS;QAC3B,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IAClB,CAAC;IACH,oBAAC;AAAD,CAAC,AA3DD,CAAsC,GAAG,GA2DxC;AA3DY,sCAAa"}