data-structure-typed 0.9.16 → 1.3.1

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

@@ -1,227 +1,252 @@
 "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;
-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));
+/**
+ * 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);
+    }
+}
 exports.UndirectedVertex = UndirectedVertex;
-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;
-    }
-    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));
+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;
+    }
+}
 exports.UndirectedEdge = UndirectedEdge;
-var UndirectedGraph = /** @class */ (function (_super) {
-    __extends(UndirectedGraph, _super);
-    function UndirectedGraph() {
-        var _this = _super.call(this) || this;
-        _this._edges = new Map();
-        return _this;
-    }
-    UndirectedGraph.prototype.getEdge = function (v1, v2) {
+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) {
+        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) {
+        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) {
         var _a;
-        var edges = [];
+        let edges = [];
         if (v1 !== null && v2 !== null) {
-            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); });
+            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));
             }
         }
         return edges ? edges[0] || null : null;
-    };
-    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;
-    };
-    UndirectedGraph.prototype.removeEdgeBetween = function (v1, v2) {
-        var vertex1 = this.getVertex(v1);
-        var vertex2 = this.getVertex(v2);
+    }
+    /**
+     * 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);
         if (!vertex1 || !vertex2) {
             return null;
         }
-        var v1Edges = this._edges.get(vertex1);
-        var removed = null;
+        const v1Edges = this._edges.get(vertex1);
+        let removed = null;
         if (v1Edges) {
-            removed = (0, utils_1.arrayRemove)(v1Edges, function (e) { return e.vertices.includes(vertex2.id); })[0] || null;
+            removed = (0, utils_1.arrayRemove)(v1Edges, (e) => e.vertices.includes(vertex2.id))[0] || null;
         }
-        var v2Edges = this._edges.get(vertex2);
+        const v2Edges = this._edges.get(vertex2);
         if (v2Edges) {
-            (0, utils_1.arrayRemove)(v2Edges, function (e) { return e.vertices.includes(vertex1.id); });
+            (0, utils_1.arrayRemove)(v2Edges, (e) => e.vertices.includes(vertex1.id));
         }
         return removed;
-    };
-    UndirectedGraph.prototype.removeEdge = function (edge) {
+    }
+    /**
+     * 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) {
         return this.removeEdgeBetween(edge.vertices[0], edge.vertices[1]);
-    };
-    UndirectedGraph.prototype.degreeOf = function (vertexOrId) {
+    }
+    /**
+     * 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) {
         var _a;
-        var vertex = this.getVertex(vertexOrId);
+        const vertex = this._getVertex(vertexOrId);
         if (vertex) {
             return ((_a = this._edges.get(vertex)) === null || _a === void 0 ? void 0 : _a.length) || 0;
         }
         else {
             return 0;
         }
-    };
-    UndirectedGraph.prototype.edgesOf = function (vertexOrId) {
-        var vertex = this.getVertex(vertexOrId);
+    }
+    /**
+     * 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);
         if (vertex) {
             return this._edges.get(vertex) || [];
         }
         else {
             return [];
         }
-    };
-    UndirectedGraph.prototype.edgeSet = function () {
-        var edgeSet = new Set();
-        this._edges.forEach(function (edges) {
-            edges.forEach(function (edge) {
+    }
+    /**
+     * 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 => {
                 edgeSet.add(edge);
             });
         });
-        return __spreadArray([], __read(edgeSet), false);
-    };
-    UndirectedGraph.prototype.getEdgesOf = function (vertexOrId) {
-        var vertex = this.getVertex(vertexOrId);
-        if (!vertex) {
-            return [];
-        }
-        return this._edges.get(vertex) || [];
-    };
-    UndirectedGraph.prototype.getNeighbors = function (vertexOrId) {
-        var e_2, _a;
-        var neighbors = [];
-        var vertex = this.getVertex(vertexOrId);
+        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);
         if (vertex) {
-            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);
+            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);
                 }
-                finally { if (e_2) throw e_2.error; }
             }
         }
         return neighbors;
-    };
-    UndirectedGraph.prototype.getEndsOfEdge = function (edge) {
-        if (!this.containsEdge(edge.vertices[0], edge.vertices[1])) {
+    }
+    /**
+     * 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) {
+        if (!this.hasEdge(edge.vertices[0], edge.vertices[1])) {
             return null;
         }
-        var v1 = this.getVertex(edge.vertices[0]);
-        var v2 = this.getVertex(edge.vertices[1]);
+        const v1 = this._getVertex(edge.vertices[0]);
+        const v2 = this._getVertex(edge.vertices[1]);
         if (v1 && v2) {
             return [v1, v2];
         }
         else {
             return null;
         }
-    };
-    return UndirectedGraph;
-}(abstract_graph_1.AbstractGraph));
+    }
+    /**
+     * 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]);
+                }
+            }
+        }
+        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) {
+        this._edges = v;
+    }
+}
 exports.UndirectedGraph = UndirectedGraph;

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

@@ -1,8 +1,45 @@
+/**
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
+ */
 export declare class CoordinateMap<V> extends Map<any, V> {
-    private readonly _joint;
     constructor(joint?: string);
+    protected _joint: string;
+    get joint(): string;
+    /**
+     * 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: number[]): boolean;
+    /**
+     * 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: number[], value: V): this;
+    /**
+     * 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: number[]): V | undefined;
+    /**
+     * 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: number[]): boolean;
+    protected _setJoint(v: string): void;
 }

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

@@ -1,42 +1,65 @@
 "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;
-var CoordinateMap = /** @class */ (function (_super) {
-    __extends(CoordinateMap, _super);
-    function CoordinateMap(joint) {
-        var _this = _super.call(this) || this;
-        _this._joint = '_';
+/**
+ * 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 = '_';
         if (joint !== undefined)
-            _this._joint = joint;
-        return _this;
+            this._joint = joint;
     }
-    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));
+    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) {
+        this._joint = v;
+    }
+}
 exports.CoordinateMap = CoordinateMap;

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

@@ -1,7 +1,37 @@
-export declare class CoordinateSet extends Set {
-    private readonly _joint;
+/**
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
+ */
+export declare class CoordinateSet extends Set<any> {
     constructor(joint?: string);
+    protected _joint: string;
+    get joint(): string;
+    /**
+     * 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: number[]): boolean;
+    /**
+     * 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: number[]): this;
+    /**
+     * 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: number[]): boolean;
+    protected _setJoint(v: string): void;
 }