undirected-graph-typed 1.52.2 → 1.52.4

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

@@ -26,12 +26,10 @@ class HashMap extends base_1.IterableEntryBase {
         this._hashFn = (key) => String(key);
         if (options) {
             const { hashFn, toEntryFn } = options;
-            if (hashFn) {
+            if (hashFn)
                 this._hashFn = hashFn;
-            }
-            if (toEntryFn) {
+            if (toEntryFn)
                 this._toEntryFn = toEntryFn;
-            }
         }
         if (entryOrRawElements) {
             this.setMany(entryOrRawElements);

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

@@ -95,9 +95,9 @@ export declare class Queue<E = any, R = any> extends IterableElementBase<E, R, Q
      * Time Complexity: O(1)
      * Space Complexity: O(1)
      *
-     * The push function adds an element to the end of the queue and returns the updated queue.Adds an element at the back of the queue.
+     * The push function adds an element to the end of the queue and returns true. Adds an element at the back of the queue.
      * @param {E} element - The `element` parameter represents the element that you want to add to the queue.
-     * @returns The `add` method is returning a `Queue<E>` object.
+     * @returns Always returns true, indicating the element was successfully added.
      */
     push(element: E): boolean;
     /**
@@ -115,13 +115,13 @@ export declare class Queue<E = any, R = any> extends IterableElementBase<E, R, Q
     shift(): E | undefined;
     /**
      * The delete function removes an element from the list.
-     * @param element: E Specify the element to be deleted
+     * @param {E} element - Specify the element to be deleted
      * @return A boolean value indicating whether the element was successfully deleted or not
      */
     delete(element: E): boolean;
     /**
      * The deleteAt function deletes the element at a given index.
-     * @param index: number Determine the index of the element to be deleted
+     * @param {number} index - Determine the index of the element to be deleted
      * @return A boolean value
      */
     deleteAt(index: number): boolean;

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

@@ -122,9 +122,9 @@ class Queue extends base_1.IterableElementBase {
      * Time Complexity: O(1)
      * Space Complexity: O(1)
      *
-     * The push function adds an element to the end of the queue and returns the updated queue.Adds an element at the back of the queue.
+     * The push function adds an element to the end of the queue and returns true. Adds an element at the back of the queue.
      * @param {E} element - The `element` parameter represents the element that you want to add to the queue.
-     * @returns The `add` method is returning a `Queue<E>` object.
+     * @returns Always returns true, indicating the element was successfully added.
      */
     push(element) {
         this.elements.push(element);
@@ -153,7 +153,7 @@ class Queue extends base_1.IterableElementBase {
     }
     /**
      * The delete function removes an element from the list.
-     * @param element: E Specify the element to be deleted
+     * @param {E} element - Specify the element to be deleted
      * @return A boolean value indicating whether the element was successfully deleted or not
      */
     delete(element) {
@@ -162,7 +162,7 @@ class Queue extends base_1.IterableElementBase {
     }
     /**
      * The deleteAt function deletes the element at a given index.
-     * @param index: number Determine the index of the element to be deleted
+     * @param {number} index - Determine the index of the element to be deleted
      * @return A boolean value
      */
     deleteAt(index) {

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

@@ -418,8 +418,13 @@ class Trie extends base_1.IterableElementBase {
         if (prefix) {
             for (const c of prefix) {
                 const nodeC = startNode.children.get(c);
-                if (nodeC)
+                if (nodeC) {
                     startNode = nodeC;
+                }
+                else {
+                    // Early return if the whole prefix is not found
+                    return [];
+                }
             }
         }
         if (isAllWhenEmptyPrefix || startNode !== this.root)

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "undirected-graph-typed",
-  "version": "1.52.2",
+  "version": "1.52.4",
   "description": "Undirected Graph. Javascript & Typescript Data Structure.",
   "main": "dist/index.js",
   "scripts": {
@@ -145,6 +145,6 @@
     "typescript": "^4.9.5"
   },
   "dependencies": {
-    "data-structure-typed": "^1.52.2"
+    "data-structure-typed": "^1.52.4"
   }
 }

package/src/data-structures/hash/hash-map.ts

@@ -34,12 +34,8 @@ export class HashMap<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
     super();
     if (options) {
       const { hashFn, toEntryFn } = options;
-      if (hashFn) {
-        this._hashFn = hashFn;
-      }
-      if (toEntryFn) {
-        this._toEntryFn = toEntryFn;
-      }
+      if (hashFn) this._hashFn = hashFn;
+      if (toEntryFn) this._toEntryFn = toEntryFn;
     }
     if (entryOrRawElements) {
       this.setMany(entryOrRawElements);

package/src/data-structures/queue/queue.ts

@@ -142,9 +142,9 @@ export class Queue<E = any, R = any> extends IterableElementBase<E, R, Queue<E,
    * Time Complexity: O(1)
    * Space Complexity: O(1)
    *
-   * The push function adds an element to the end of the queue and returns the updated queue.Adds an element at the back of the queue.
+   * The push function adds an element to the end of the queue and returns true. Adds an element at the back of the queue.
    * @param {E} element - The `element` parameter represents the element that you want to add to the queue.
-   * @returns The `add` method is returning a `Queue<E>` object.
+   * @returns Always returns true, indicating the element was successfully added.
    */
   push(element: E): boolean {
     this.elements.push(element);
@@ -176,7 +176,7 @@ export class Queue<E = any, R = any> extends IterableElementBase<E, R, Queue<E,
 
   /**
    * The delete function removes an element from the list.
-   * @param element: E Specify the element to be deleted
+   * @param {E} element - Specify the element to be deleted
    * @return A boolean value indicating whether the element was successfully deleted or not
    */
   delete(element: E): boolean {
@@ -186,7 +186,7 @@ export class Queue<E = any, R = any> extends IterableElementBase<E, R, Queue<E,
 
   /**
    * The deleteAt function deletes the element at a given index.
-   * @param index: number Determine the index of the element to be deleted
+   * @param {number} index - Determine the index of the element to be deleted
    * @return A boolean value
    */
   deleteAt(index: number): boolean {

package/src/data-structures/trie/trie.ts

@@ -454,7 +454,12 @@ export class Trie<R = any> extends IterableElementBase<string, R, Trie<R>> {
     if (prefix) {
       for (const c of prefix) {
         const nodeC = startNode.children.get(c);
-        if (nodeC) startNode = nodeC;
+        if (nodeC) {
+          startNode = nodeC;
+        } else {
+          // Early return if the whole prefix is not found
+          return [];
+        }
       }
     }