undirected-graph-typed - npm Package Compare versions

Comparing version 1.52.3 to 1.52.4

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

@@ -29,8 +29,6 @@ "use strict";
             const { hashFn, toEntryFn } = options;
-            if (hashFn) {
+            if (hashFn)
                 this._hashFn = hashFn;
-            }
-            if (toEntryFn) {
+            if (toEntryFn)
                 this._toEntryFn = toEntryFn;
-            }
         }
@@ -37,0 +35,0 @@ if (entryOrRawElements) {

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

@@ -98,5 +98,5 @@ /**
      *
-     * 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.
      */
@@ -119,3 +119,3 @@ push(element: E): boolean;
      * 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
@@ -126,3 +126,3 @@ */
      * 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
@@ -129,0 +129,0 @@ */

dist/data-structures/queue/queue.js

@@ -125,5 +125,5 @@ "use strict";
      *
-     * 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.
      */
@@ -157,3 +157,3 @@ push(element) {
      * 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
@@ -167,3 +167,3 @@ */
      * 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
@@ -170,0 +170,0 @@ */

package.json

 {
   "name": "undirected-graph-typed",
-  "version": "1.52.3",
+  "version": "1.52.4",
   "description": "Undirected Graph. Javascript & Typescript Data Structure.",
@@ -148,4 +148,4 @@ "main": "dist/index.js",
   "dependencies": {
-    "data-structure-typed": "^1.52.3"
+    "data-structure-typed": "^1.52.4"
   }
 }

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

@@ -37,8 +37,4 @@ /**
       const { hashFn, toEntryFn } = options;
-      if (hashFn) {
-        this._hashFn = hashFn;
-      }
-      if (toEntryFn) {
-        this._toEntryFn = toEntryFn;
-      }
+      if (hashFn) this._hashFn = hashFn;
+      if (toEntryFn) this._toEntryFn = toEntryFn;
     }
@@ -45,0 +41,0 @@ if (entryOrRawElements) {

src/data-structures/queue/queue.ts

@@ -145,5 +145,5 @@ /**
    *
-   * 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.
    */
@@ -180,3 +180,3 @@ push(element: E): boolean {
    * 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
@@ -191,3 +191,3 @@ */
    * 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
@@ -194,0 +194,0 @@ */

New alerts

License Policy Violation

License

This package is not allowed per your license policy. Review the package's license to ensure compliance.

Found 1 instance in 1 package

Fixed alerts

License Policy Violation

License

This package is not allowed per your license policy. Review the package's license to ensure compliance.

Found 1 instance in 1 package

Worsened metrics

Total package byte prevSize

2098797

Lines of code

41487

decreased by-0.01%

Dependency changes

• Updateddata-structure-typed@^1.52.4