data-structure-typed 1.49.2 → 1.49.3

package/dist/umd/data-structure-typed.js

@@ -2150,6 +2150,36 @@ var dataStructureTyped = (() => {
      * Time Complexity: O(n), where n is the size of the input array.
      * Space Complexity: O(n)
      */
+    /**
+     * Time Complexity: O(n), where n is the number of elements in the linked list.
+     * Space Complexity: O(1)
+     *
+     * The `get first` function returns the first node in a doubly linked list, or undefined if the list is empty.
+     * @returns The method `get first()` returns the first node of the doubly linked list, or `undefined` if the list is empty.
+     */
+    get first() {
+      var _a;
+      return (_a = this.head) == null ? void 0 : _a.value;
+    }
+    /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     */
+    /**
+     * Time Complexity: O(n), where n is the number of elements in the linked list.
+     * Space Complexity: O(1)
+     *
+     * The `get last` function returns the last node in a doubly linked list, or undefined if the list is empty.
+     * @returns The method `get last()` returns the last node of the doubly linked list, or `undefined` if the list is empty.
+     */
+    get last() {
+      var _a;
+      return (_a = this.tail) == null ? void 0 : _a.value;
+    }
+    /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     */
     /**
      * Time Complexity: O(n), where n is the size of the input array.
      * Space Complexity: O(n)
@@ -2217,7 +2247,7 @@ var dataStructureTyped = (() => {
       return removedNode.value;
     }
     /**
-     * Time Complexity: O(1)
+     * Time Complexity: O(n), where n is the number of elements in the linked list.
      * Space Complexity: O(1)
      */
     /**
@@ -2243,7 +2273,7 @@ var dataStructureTyped = (() => {
       return removedNode.value;
     }
     /**
-     * Time Complexity: O(1)
+     * Time Complexity: O(n), where n is the number of elements in the linked list.
      * Space Complexity: O(1)
      */
     /**
@@ -2454,10 +2484,6 @@ var dataStructureTyped = (() => {
       }
       return false;
     }
-    /**
-     * Time Complexity: O(n), where n is the number of elements in the linked list.
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n), where n is the number of elements in the linked list.
      * Space Complexity: O(1)
@@ -2487,10 +2513,6 @@ var dataStructureTyped = (() => {
       this._size--;
       return true;
     }
-    /**
-     * Time Complexity: O(n), where n is the number of elements in the linked list.
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n), where n is the number of elements in the linked list.
      * Space Complexity: O(1)
@@ -2524,6 +2546,10 @@ var dataStructureTyped = (() => {
       }
       return false;
     }
+    /**
+     * Time Complexity: O(n), where n is the number of elements in the linked list.
+     * Space Complexity: O(1)
+     */
     /**
      * The function checks if a variable has a size greater than zero and returns a boolean value.
      * @returns A boolean value is being returned.
@@ -2531,6 +2557,10 @@ var dataStructureTyped = (() => {
     isEmpty() {
       return this.size === 0;
     }
+    /**
+     * Time Complexity: O(n), where n is the number of elements in the linked list.
+     * Space Complexity: O(1)
+     */
     /**
      * The `clear` function resets the linked list by setting the head, tail, and size to undefined and 0 respectively.
      */
@@ -2591,7 +2621,7 @@ var dataStructureTyped = (() => {
     }
     /**
      * Time Complexity: O(n), where n is the number of elements in the linked list.
-     * Space Complexity: O(1)
+     * Space Complexity: O(n)
      */
     /**
      * Time Complexity: O(n), where n is the number of elements in the linked list.
@@ -2616,7 +2646,7 @@ var dataStructureTyped = (() => {
     }
     /**
      * Time Complexity: O(n), where n is the number of elements in the linked list.
-     * Space Complexity: O(1)
+     * Space Complexity: O(n)
      */
     /**
      * Time Complexity: O(n), where n is the number of elements in the linked list.
@@ -2635,7 +2665,7 @@ var dataStructureTyped = (() => {
       return this;
     }
     /**
-     * Time Complexity: O(n), where n is the number of elements in the linked list.
+     * Time Complexity: O(n)
      * Space Complexity: O(n)
      */
     /**
@@ -2675,8 +2705,8 @@ var dataStructureTyped = (() => {
       return array;
     }
     /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
      */
     /**
      * Time Complexity: O(n)
@@ -2707,8 +2737,8 @@ var dataStructureTyped = (() => {
       return filteredList;
     }
     /**
-     * Time Complexity: O(n), where n is the number of elements in the linked list.
-     * Space Complexity: O(n)
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
      */
     /**
      * Time Complexity: O(n)
@@ -2766,7 +2796,7 @@ var dataStructureTyped = (() => {
       return this.pop();
     }
     /**
-     * Time Complexity: O(1)
+     * Time Complexity: O(n), where n is the number of elements in the linked list.
      * Space Complexity: O(1)
      */
     /**
@@ -2781,7 +2811,7 @@ var dataStructureTyped = (() => {
       return this.shift();
     }
     /**
-     * Time Complexity: O(1)
+     * Time Complexity: O(n), where n is the number of elements in the linked list.
      * Space Complexity: O(1)
      */
     /**
@@ -2795,36 +2825,6 @@ var dataStructureTyped = (() => {
     addFirst(value) {
       this.unshift(value);
     }
-    /**
-     * Time Complexity: O(n), where n is the number of elements in the linked list.
-     * Space Complexity: O(1)
-     */
-    /**
-     * Time Complexity: O(n), where n is the number of elements in the linked list.
-     * Space Complexity: O(1)
-     *
-     * The `get first` function returns the first node in a doubly linked list, or undefined if the list is empty.
-     * @returns The method `get first()` returns the first node of the doubly linked list, or `undefined` if the list is empty.
-     */
-    get first() {
-      var _a;
-      return (_a = this.head) == null ? void 0 : _a.value;
-    }
-    /**
-     * Time Complexity: O(n), where n is the number of elements in the linked list.
-     * Space Complexity: O(1)
-     */
-    /**
-     * Time Complexity: O(n), where n is the number of elements in the linked list.
-     * Space Complexity: O(1)
-     *
-     * The `get last` function returns the last node in a doubly linked list, or undefined if the list is empty.
-     * @returns The method `get last()` returns the last node of the doubly linked list, or `undefined` if the list is empty.
-     */
-    get last() {
-      var _a;
-      return (_a = this.tail) == null ? void 0 : _a.value;
-    }
     /**
      * The function returns an iterator that iterates over the values of a linked list.
      */
@@ -2878,6 +2878,41 @@ var dataStructureTyped = (() => {
     get probability() {
       return this._probability;
     }
+    /**
+     * Time Complexity: O(log n) - where n is the number of elements in the SkipList, as it traverses the levels of the SkipList.
+     * Space Complexity: O(1) - constant space, as it uses a fixed amount of space regardless of the size of the SkipList.
+     */
+    /**
+     * Time Complexity: O(1) - where n is the number of elements in the SkipList, as it traverses the levels of the SkipList.
+     * Space Complexity: O(1) - constant space, as it uses a fixed amount of space regardless of the size of the SkipList.
+     *
+     * Get the value of the first element (the smallest element) in the Skip List.
+     * @returns The value of the first element, or undefined if the Skip List is empty.
+     */
+    get first() {
+      const firstNode = this.head.forward[0];
+      return firstNode ? firstNode.value : void 0;
+    }
+    /**
+     * Time Complexity: O(log n) - where n is the number of elements in the SkipList, as it traverses the levels of the SkipList.
+     * Space Complexity: O(1) - constant space, as it uses a fixed amount of space regardless of the size of the SkipList.
+     */
+    /**
+     * Time Complexity: O(log n) - where n is the number of elements in the SkipList, as it traverses the levels of the SkipList.
+     * Space Complexity: O(1) - constant space, as it uses a fixed amount of space regardless of the size of the SkipList.
+     *
+     * Get the value of the last element (the largest element) in the Skip List.
+     * @returns The value of the last element, or undefined if the Skip List is empty.
+     */
+    get last() {
+      let current = this.head;
+      for (let i = this.level - 1; i >= 0; i--) {
+        while (current.forward[i]) {
+          current = current.forward[i];
+        }
+      }
+      return current.value;
+    }
     /**
      * Time Complexity: O(log n) - where n is the number of elements in the SkipList, as it traverses the levels of the SkipList.
      * Space Complexity: O(1) - constant space, as it uses a fixed amount of space regardless of the size of the SkipList.
@@ -2936,7 +2971,7 @@ var dataStructureTyped = (() => {
       return void 0;
     }
     /**
-     * Time Complexity: O(log n) - where n is the number of elements in the SkipList, as it traverses the levels of the SkipList.
+     * Time Complexity: O(1) - where n is the number of elements in the SkipList, as it traverses the levels of the SkipList.
      * Space Complexity: O(1) - constant space, as it uses a fixed amount of space regardless of the size of the SkipList.
      */
     /**
@@ -2983,41 +3018,6 @@ var dataStructureTyped = (() => {
       }
       return false;
     }
-    /**
-     * Time Complexity: O(1) - where n is the number of elements in the SkipList, as it traverses the levels of the SkipList.
-     * Space Complexity: O(1) - constant space, as it uses a fixed amount of space regardless of the size of the SkipList.
-     */
-    /**
-     * Time Complexity: O(1) - where n is the number of elements in the SkipList, as it traverses the levels of the SkipList.
-     * Space Complexity: O(1) - constant space, as it uses a fixed amount of space regardless of the size of the SkipList.
-     *
-     * Get the value of the first element (the smallest element) in the Skip List.
-     * @returns The value of the first element, or undefined if the Skip List is empty.
-     */
-    get first() {
-      const firstNode = this.head.forward[0];
-      return firstNode ? firstNode.value : void 0;
-    }
-    /**
-     * Time Complexity: O(log n) - where n is the number of elements in the SkipList, as it traverses the levels of the SkipList.
-     * Space Complexity: O(1) - constant space, as it uses a fixed amount of space regardless of the size of the SkipList.
-     */
-    /**
-     * Time Complexity: O(log n) - where n is the number of elements in the SkipList, as it traverses the levels of the SkipList.
-     * Space Complexity: O(1) - constant space, as it uses a fixed amount of space regardless of the size of the SkipList.
-     *
-     * Get the value of the last element (the largest element) in the Skip List.
-     * @returns The value of the last element, or undefined if the Skip List is empty.
-     */
-    get last() {
-      let current = this.head;
-      for (let i = this.level - 1; i >= 0; i--) {
-        while (current.forward[i]) {
-          current = current.forward[i];
-        }
-      }
-      return current.value;
-    }
     /**
      * Time Complexity: O(log n) - where n is the number of elements in the SkipList, as it traverses the levels of the SkipList.
      * Space Complexity: O(1) - constant space, as it uses a fixed amount of space regardless of the size of the SkipList.
@@ -3315,6 +3315,36 @@ var dataStructureTyped = (() => {
     get size() {
       return this.nodes.length - this.offset;
     }
+    /**
+     * Time Complexity: O(1) - constant time as it retrieves the value at the current offset.
+     * Space Complexity: O(1) - no additional space is used.
+     *
+     * The `first` function returns the first element of the array `_nodes` if it exists, otherwise it returns `undefined`.
+     * @returns The `get first()` method returns the first element of the data structure, represented by the `_nodes` array at
+     * the `_offset` index. If the data structure is empty (size is 0), it returns `undefined`.
+     */
+    get first() {
+      return this.size > 0 ? this.nodes[this.offset] : void 0;
+    }
+    /**
+     * Time Complexity: O(1) - constant time as it adds an element to the end of the array.
+     * Space Complexity: O(1) - no additional space is used.
+     */
+    /**
+     * Time Complexity: O(1) - constant time as it retrieves the value at the current offset.
+     * Space Complexity: O(1) - no additional space is used.
+     *
+     * The `last` function returns the last element in an array-like data structure, or undefined if the structure is empty.
+     * @returns The method `get last()` returns the last element of the `_nodes` array if the array is not empty. If the
+     * array is empty, it returns `undefined`.
+     */
+    get last() {
+      return this.size > 0 ? this.nodes[this.nodes.length - 1] : void 0;
+    }
+    /**
+     * Time Complexity: O(n) - where n is the number of elements in the queue. In the worst case, it may need to shift all elements to update the offset.
+     * Space Complexity: O(1) - no additional space is used.
+     */
     /**
      * The function "fromArray" creates a new Queue object from an array of elements.Creates a queue from an existing array.
      * @public
@@ -3327,7 +3357,7 @@ var dataStructureTyped = (() => {
       return new _Queue(elements);
     }
     /**
-     * Time Complexity: O(1) - constant time as it adds an element to the end of the array.
+     * Time Complexity: O(1) - constant time as it retrieves the value at the current offset.
      * Space Complexity: O(1) - no additional space is used.
      */
     /**
@@ -3343,7 +3373,7 @@ var dataStructureTyped = (() => {
       return true;
     }
     /**
-     * Time Complexity: O(n) - where n is the number of elements in the queue. In the worst case, it may need to shift all elements to update the offset.
+     * Time Complexity: O(1) - constant time as it retrieves the value at the current offset.
      * Space Complexity: O(1) - no additional space is used.
      */
     /**
@@ -3365,21 +3395,6 @@ var dataStructureTyped = (() => {
       this._offset = 0;
       return first;
     }
-    /**
-     * Time Complexity: O(1) - constant time as it retrieves the value at the current offset.
-     * Space Complexity: O(1) - no additional space is used.
-     */
-    /**
-     * Time Complexity: O(1) - constant time as it retrieves the value at the current offset.
-     * Space Complexity: O(1) - no additional space is used.
-     *
-     * The `first` function returns the first element of the array `_nodes` if it exists, otherwise it returns `undefined`.
-     * @returns The `get first()` method returns the first element of the data structure, represented by the `_nodes` array at
-     * the `_offset` index. If the data structure is empty (size is 0), it returns `undefined`.
-     */
-    get first() {
-      return this.size > 0 ? this.nodes[this.offset] : void 0;
-    }
     /**
      * Time Complexity: O(1) - constant time as it retrieves the value at the current offset.
      * Space Complexity: O(1) - no additional space is used.
@@ -3395,21 +3410,6 @@ var dataStructureTyped = (() => {
     peek() {
       return this.first;
     }
-    /**
-     * Time Complexity: O(1) - constant time as it retrieves the value at the current offset.
-     * Space Complexity: O(1) - no additional space is used.
-     */
-    /**
-     * Time Complexity: O(1) - constant time as it retrieves the value at the current offset.
-     * Space Complexity: O(1) - no additional space is used.
-     *
-     * The `last` function returns the last element in an array-like data structure, or undefined if the structure is empty.
-     * @returns The method `get last()` returns the last element of the `_nodes` array if the array is not empty. If the
-     * array is empty, it returns `undefined`.
-     */
-    get last() {
-      return this.size > 0 ? this.nodes[this.nodes.length - 1] : void 0;
-    }
     /**
      * Time Complexity: O(1) - constant time as it retrieves the value at the current offset.
      * Space Complexity: O(1) - no additional space is used.
@@ -3584,6 +3584,14 @@ var dataStructureTyped = (() => {
     }
   };
   var LinkedListQueue = class extends SinglyLinkedList {
+    /**
+     * The `get first` function returns the value of the head node in a linked list, or `undefined` if the list is empty.
+     * @returns The `get first()` method is returning the value of the `head` node if it exists, otherwise it returns `undefined`.
+     */
+    get first() {
+      var _a;
+      return (_a = this.head) == null ? void 0 : _a.value;
+    }
     /**
      * The enqueue function adds a value to the end of an array.
      * @param {E} value - The value parameter represents the value that you want to add to the queue.
@@ -3598,14 +3606,6 @@ var dataStructureTyped = (() => {
     dequeue() {
       return this.shift();
     }
-    /**
-     * The `get first` function returns the value of the head node in a linked list, or `undefined` if the list is empty.
-     * @returns The `get first()` method is returning the value of the `head` node if it exists, otherwise it returns `undefined`.
-     */
-    get first() {
-      var _a;
-      return (_a = this.head) == null ? void 0 : _a.value;
-    }
     /**
      * The `peek` function returns the value of the head node in a linked list, or `undefined` if the list is empty.
      * @returns The `peek()` method is returning the value of the `head` node if it exists, otherwise it returns `undefined`.
@@ -5242,10 +5242,10 @@ var dataStructureTyped = (() => {
      */
     addVertex(keyOrVertex, value) {
       if (keyOrVertex instanceof AbstractVertex) {
-        return this._addVertexOnly(keyOrVertex);
+        return this._addVertex(keyOrVertex);
       } else {
         const newVertex = this.createVertex(keyOrVertex, value);
-        return this._addVertexOnly(newVertex);
+        return this._addVertex(newVertex);
       }
     }
     isVertexKey(potentialKey) {
@@ -5315,7 +5315,7 @@ var dataStructureTyped = (() => {
      */
     addEdge(srcOrEdge, dest, weight, value) {
       if (srcOrEdge instanceof AbstractEdge) {
-        return this._addEdgeOnly(srcOrEdge);
+        return this._addEdge(srcOrEdge);
       } else {
         if (dest instanceof AbstractVertex || typeof dest === "string" || typeof dest === "number") {
           if (!(this.hasVertex(srcOrEdge) && this.hasVertex(dest)))
@@ -5325,7 +5325,7 @@ var dataStructureTyped = (() => {
           if (dest instanceof AbstractVertex)
             dest = dest.key;
           const newEdge = this.createEdge(srcOrEdge, dest, weight, value);
-          return this._addEdgeOnly(newEdge);
+          return this._addEdge(newEdge);
         } else {
           throw new Error("dest must be a Vertex or vertex key while srcOrEdge is an Edge");
         }
@@ -6131,13 +6131,6 @@ var dataStructureTyped = (() => {
     getLowMap() {
       return this.tarjan(false, false, false, false).lowMap;
     }
-    /**
-     * The function `getCycles` returns a map of cycles found using the Tarjan algorithm.
-     * @returns The function `getCycles()` is returning a `Map<number, VO[]>`.
-     */
-    getCycles() {
-      return this.tarjan(false, false, false, true).cycles;
-    }
     /**
      * The function "getCutVertexes" returns an array of cut vertexes using the Tarjan algorithm.
      * @returns an array of VO objects, specifically the cut vertexes.
@@ -6160,6 +6153,44 @@ var dataStructureTyped = (() => {
     getBridges() {
       return this.tarjan(false, true, false, false).bridges;
     }
+    /**
+     * O(V+E+C)
+     * O(V+C)
+     */
+    getCycles(isInclude2Cycle = false) {
+      const cycles = [];
+      const visited = /* @__PURE__ */ new Set();
+      const dfs = (vertex, currentPath, visited2) => {
+        if (visited2.has(vertex)) {
+          if ((!isInclude2Cycle && currentPath.length > 2 || isInclude2Cycle && currentPath.length >= 2) && currentPath[0] === vertex.key) {
+            cycles.push([...currentPath]);
+          }
+          return;
+        }
+        visited2.add(vertex);
+        currentPath.push(vertex.key);
+        for (const neighbor of this.getNeighbors(vertex)) {
+          neighbor && dfs(neighbor, currentPath, visited2);
+        }
+        visited2.delete(vertex);
+        currentPath.pop();
+      };
+      for (const vertex of this.vertexMap.values()) {
+        dfs(vertex, [], visited);
+      }
+      const uniqueCycles = /* @__PURE__ */ new Map();
+      for (const cycle of cycles) {
+        const sorted = [...cycle].sort().toString();
+        if (uniqueCycles.has(sorted))
+          continue;
+        else {
+          uniqueCycles.set(sorted, cycle);
+        }
+      }
+      return [...uniqueCycles].map(
+        (cycleString) => cycleString[1]
+      );
+    }
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -6222,7 +6253,7 @@ var dataStructureTyped = (() => {
         yield [vertex.key, vertex.value];
       }
     }
-    _addVertexOnly(newVertex) {
+    _addVertex(newVertex) {
       if (this.hasVertex(newVertex)) {
         return false;
       }
@@ -6759,13 +6790,13 @@ var dataStructureTyped = (() => {
      * Time Complexity: O(1)
      * Space Complexity: O(1)
      *
-     * The function `_addEdgeOnly` adds an edge to a graph if the source and destination vertexMap exist.
+     * The function `_addEdge` adds an edge to a graph if the source and destination vertexMap exist.
      * @param {EO} edge - The parameter `edge` is of type `EO`, which represents an edge in a graph. It is the edge that
      * needs to be added to the graph.
      * @returns a boolean value. It returns true if the edge was successfully added to the graph, and false if either the
      * source or destination vertex does not exist in the graph.
      */
-    _addEdgeOnly(edge) {
+    _addEdge(edge) {
       if (!(this.hasVertex(edge.src) && this.hasVertex(edge.dest))) {
         return false;
       }
@@ -7119,7 +7150,7 @@ var dataStructureTyped = (() => {
      * @param {EO} edge - The parameter "edge" is of type EO, which represents an edge in a graph.
      * @returns a boolean value.
      */
-    _addEdgeOnly(edge) {
+    _addEdge(edge) {
       for (const end of edge.vertexMap) {
         const endVertex = this._getVertex(end);
         if (endVertex === void 0)