undirected-graph-typed 1.52.4 → 1.52.5

package/src/data-structures/base/iterable-entry-base.ts

@@ -9,11 +9,6 @@ export abstract class IterableEntryBase<K = any, V = any> {
   //   }
   // }
 
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(1)
-   */
-
   abstract get size(): number;
 
   // protected _toEntryFn?: (rawElement: R) => BTNEntry<K, V>;
@@ -39,10 +34,6 @@ export abstract class IterableEntryBase<K = any, V = any> {
     yield* this._getIterator(...args);
   }
 
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(n)
-   */
   /**
    * Time Complexity: O(n)
    * Space Complexity: O(n)
@@ -56,10 +47,6 @@ export abstract class IterableEntryBase<K = any, V = any> {
     }
   }
 
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(n)
-   */
   /**
    * Time Complexity: O(n)
    * Space Complexity: O(n)
@@ -72,10 +59,6 @@ export abstract class IterableEntryBase<K = any, V = any> {
     }
   }
 
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(n)
-   */
   /**
    * Time Complexity: O(n)
    * Space Complexity: O(n)
@@ -88,10 +71,6 @@ export abstract class IterableEntryBase<K = any, V = any> {
     }
   }
 
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(1)
-   */
   /**
    * Time Complexity: O(n)
    * Space Complexity: O(1)
@@ -116,10 +95,6 @@ export abstract class IterableEntryBase<K = any, V = any> {
     return true;
   }
 
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(1)
-   */
   /**
    * Time Complexity: O(n)
    * Space Complexity: O(1)
@@ -145,15 +120,6 @@ export abstract class IterableEntryBase<K = any, V = any> {
     return false;
   }
 
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(1)
-   */
-
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(1)
-   */
   /**
    * Time Complexity: O(n)
    * Space Complexity: O(1)
@@ -175,11 +141,6 @@ export abstract class IterableEntryBase<K = any, V = any> {
     }
   }
 
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(n)
    * Space Complexity: O(1)
@@ -197,7 +158,7 @@ export abstract class IterableEntryBase<K = any, V = any> {
    * the provided callback function. If no element satisfies the callback function, `undefined` is
    * returned.
    */
-  find(callbackfn: EntryCallback<K, V, [K, V]>, thisArg?: any): [K, V] | undefined {
+  find(callbackfn: EntryCallback<K, V, boolean>, thisArg?: any): [K, V] | undefined {
     let index = 0;
     for (const item of this) {
       const [key, value] = item;
@@ -206,11 +167,6 @@ export abstract class IterableEntryBase<K = any, V = any> {
     return;
   }
 
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(n)
    * Space Complexity: O(1)
@@ -229,11 +185,6 @@ export abstract class IterableEntryBase<K = any, V = any> {
     return false;
   }
 
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(n)
    * Space Complexity: O(1)
@@ -250,11 +201,6 @@ export abstract class IterableEntryBase<K = any, V = any> {
     return false;
   }
 
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(n)
    * Space Complexity: O(1)
@@ -299,19 +245,14 @@ export abstract class IterableEntryBase<K = any, V = any> {
     return accumulator;
   }
 
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(n)
-   */
-
   /**
    * Time Complexity: O(n)
    * Space Complexity: O(n)
    *
    * The print function logs the elements of an array to the console.
    */
-  print(): void {
-    console.log([...this]);
+  print(): [K, V][] | string {
+    return [...this];
   }
 
   abstract isEmpty(): boolean;

package/src/data-structures/binary-tree/avl-tree-multi-map.ts

@@ -105,11 +105,6 @@ export class AVLTreeMultiMap<
     return this._count;
   }
 
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(n)
    * Space Complexity: O(1)
@@ -187,15 +182,15 @@ export class AVLTreeMultiMap<
     if (keyOrNodeOrEntryOrRawElement === undefined || keyOrNodeOrEntryOrRawElement === null) return;
     if (this.isNode(keyOrNodeOrEntryOrRawElement)) return keyOrNodeOrEntryOrRawElement;
 
-    if (this.toEntryFn) {
-      const [key, entryValue] = this.toEntryFn(keyOrNodeOrEntryOrRawElement as R);
-      if (key) return this.createNode(key, entryValue ?? value, count);
-    }
-
     if (this.isEntry(keyOrNodeOrEntryOrRawElement)) {
-      const [key, value] = keyOrNodeOrEntryOrRawElement;
+      const [key, entryValue] = keyOrNodeOrEntryOrRawElement;
       if (key === undefined || key === null) return;
-      else return this.createNode(key, value, count);
+      if (this.isKey(key)) return this.createNode(key, value ?? entryValue, count);
+    }
+
+    if (this.toEntryFn) {
+      const [key, entryValue] = this.toEntryFn(keyOrNodeOrEntryOrRawElement as R);
+      if (this.isKey(key)) return this.createNode(key, value ?? entryValue, count);
     }
 
     if (this.isKey(keyOrNodeOrEntryOrRawElement)) return this.createNode(keyOrNodeOrEntryOrRawElement, value, count);
@@ -203,11 +198,6 @@ export class AVLTreeMultiMap<
     return;
   }
 
-  /**
-   * Time Complexity: O(log n)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(log n)
    * Space Complexity: O(1)
@@ -237,11 +227,6 @@ export class AVLTreeMultiMap<
     return true;
   }
 
-  /**
-   * Time Complexity: O(log n)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(log n)
    * Space Complexity: O(1)
@@ -294,7 +279,7 @@ export class AVLTreeMultiMap<
           needBalanced = parent;
         }
       } else {
-        const leftSubTreeRightMost = curr.left ? this.getRightMost(curr.left) : undefined;
+        const leftSubTreeRightMost = curr.left ? this.getRightMost(node => node, curr.left) : undefined;
         if (leftSubTreeRightMost) {
           const parentOfLeftSubTreeMax = leftSubTreeRightMost.parent;
           orgCurrent = this._swapProperties(curr, leftSubTreeRightMost);
@@ -322,11 +307,6 @@ export class AVLTreeMultiMap<
     return deletedResult;
   }
 
-  /**
-   * Time Complexity: O(1)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(1)
    * Space Complexity: O(1)
@@ -339,11 +319,6 @@ export class AVLTreeMultiMap<
     this._count = 0;
   }
 
-  /**
-   * Time Complexity: O(n log n)
-   * Space Complexity: O(log n)
-   */
-
   /**
    * Time Complexity: O(n log n)
    * Space Complexity: O(log n)
@@ -394,11 +369,6 @@ export class AVLTreeMultiMap<
     }
   }
 
-  /**
-   * Time complexity: O(n)
-   * Space complexity: O(n)
-   */
-
   /**
    * Time complexity: O(n)
    * Space complexity: O(n)
@@ -412,11 +382,6 @@ export class AVLTreeMultiMap<
     return cloned;
   }
 
-  /**
-   * Time Complexity: O(1)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(1)
    * Space Complexity: O(1)
@@ -458,11 +423,6 @@ export class AVLTreeMultiMap<
     return undefined;
   }
 
-  /**
-   * Time Complexity: O(1)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(1)
    * Space Complexity: O(1)

package/src/data-structures/binary-tree/avl-tree.ts

@@ -135,12 +135,6 @@ export class AVLTree<
     return keyOrNodeOrEntryOrRawElement instanceof AVLTreeNode;
   }
 
-  /**
-   * Time Complexity: O(log n)
-   * Space Complexity: O(1)
-   * logarithmic time, where "n" is the number of nodes in the tree. The add method of the superclass (BST) has logarithmic time complexity. constant space, as it doesn't use additional data structures that scale with input size.
-   */
-
   /**
    * Time Complexity: O(log n)
    * Space Complexity: O(1)
@@ -161,11 +155,6 @@ export class AVLTree<
     return inserted;
   }
 
-  /**
-   * Time Complexity: O(log n)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(log n)
    * Space Complexity: O(1)
@@ -192,11 +181,6 @@ export class AVLTree<
     return deletedResults;
   }
 
-  /**
-   * Time Complexity: O(1)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(1)
    * Space Complexity: O(1)
@@ -238,11 +222,6 @@ export class AVLTree<
     return undefined;
   }
 
-  /**
-   * Time Complexity: O(1)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(1)
    * Space Complexity: O(1)
@@ -263,11 +242,6 @@ export class AVLTree<
     else return node.right.height - node.left.height;
   }
 
-  /**
-   * Time Complexity: O(1)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(1)
    * Space Complexity: O(1)
@@ -285,11 +259,6 @@ export class AVLTree<
     else node.height = 1 + Math.max(node.right.height, node.left.height);
   }
 
-  /**
-   * Time Complexity: O(1)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(1)
    * Space Complexity: O(1)
@@ -323,11 +292,6 @@ export class AVLTree<
     if (B) this._updateHeight(B);
   }
 
-  /**
-   * Time Complexity: O(1)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(1)
    * Space Complexity: O(1)
@@ -379,11 +343,6 @@ export class AVLTree<
     C && this._updateHeight(C);
   }
 
-  /**
-   * Time Complexity: O(1)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(1)
    * Space Complexity: O(1)
@@ -422,11 +381,6 @@ export class AVLTree<
     B && this._updateHeight(B);
   }
 
-  /**
-   * Time Complexity: O(1)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(1)
    * Space Complexity: O(1)
@@ -477,12 +431,6 @@ export class AVLTree<
     C && this._updateHeight(C);
   }
 
-  /**
-   * Time Complexity: O(log n)
-   * Space Complexity: O(1)
-   * logarithmic time, where "n" is the number of nodes in the tree. The method traverses the path from the inserted node to the root. constant space, as it doesn't use additional data structures that scale with input size.
-   */
-
   /**
    * Time Complexity: O(log n)
    * Space Complexity: O(1)
@@ -532,11 +480,6 @@ export class AVLTree<
     }
   }
 
-  /**
-   * Time Complexity: O(1)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(1)
    * Space Complexity: O(1)