undirected-graph-typed 1.52.3 → 1.52.5

package/dist/data-structures/base/iterable-element-base.d.ts

@@ -16,10 +16,6 @@ export declare abstract class IterableElementBase<E, R, C> {
      * `_toElementFn`.
      */
     get toElementFn(): ((rawElement: R) => E) | undefined;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -30,10 +26,6 @@ export declare abstract class IterableElementBase<E, R, C> {
      * parameter is used to pass any number of arguments to the `_getIterator` method.
      */
     [Symbol.iterator](...args: any[]): IterableIterator<E>;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -41,10 +33,6 @@ export declare abstract class IterableElementBase<E, R, C> {
      * The function returns an iterator that yields all the values in the object.
      */
     values(): IterableIterator<E>;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -60,14 +48,6 @@ export declare abstract class IterableElementBase<E, R, C> {
      * the array satisfies the provided predicate function, and `false` otherwise.
      */
     every(predicate: ElementCallback<E, R, boolean, C>, thisArg?: any): boolean;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -83,10 +63,6 @@ export declare abstract class IterableElementBase<E, R, C> {
      * in the collection, and false otherwise.
      */
     some(predicate: ElementCallback<E, R, boolean, C>, thisArg?: any): boolean;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -101,10 +77,6 @@ export declare abstract class IterableElementBase<E, R, C> {
      * be passed as the `this` value to the `callbackfn` function. If `thisArg
      */
     forEach(callbackfn: ElementCallback<E, R, void, C>, thisArg?: any): void;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -133,10 +105,6 @@ export declare abstract class IterableElementBase<E, R, C> {
      * otherwise.
      */
     has(element: E): boolean;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -151,17 +119,13 @@ export declare abstract class IterableElementBase<E, R, C> {
      * all the elements in the array and applying the callback function to each element.
      */
     reduce<U>(callbackfn: ReduceElementCallback<E, R, U, C>, initialValue: U): U;
-    /**
-     * 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;
+    print(): E[];
     abstract isEmpty(): boolean;
     abstract clear(): void;
     abstract clone(): C;

package/dist/data-structures/base/iterable-element-base.js

@@ -26,10 +26,6 @@ class IterableElementBase {
     get toElementFn() {
         return this._toElementFn;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -42,10 +38,6 @@ class IterableElementBase {
     *[Symbol.iterator](...args) {
         yield* this._getIterator(...args);
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -57,10 +49,6 @@ class IterableElementBase {
             yield item;
         }
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -84,14 +72,6 @@ class IterableElementBase {
         }
         return true;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -115,10 +95,6 @@ class IterableElementBase {
         }
         return false;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -138,10 +114,6 @@ class IterableElementBase {
             callbackfn.call(thisArg, item, index++, this);
         }
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -183,10 +155,6 @@ class IterableElementBase {
         }
         return false;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -208,10 +176,6 @@ class IterableElementBase {
         }
         return accumulator;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -219,7 +183,7 @@ class IterableElementBase {
      * The print function logs the elements of an array to the console.
      */
     print() {
-        console.log([...this]);
+        return [...this];
     }
 }
 exports.IterableElementBase = IterableElementBase;

package/dist/data-structures/base/iterable-entry-base.d.ts

@@ -1,9 +1,5 @@
 import { EntryCallback, ReduceEntryCallback } from '../../types';
 export declare abstract class IterableEntryBase<K = any, V = any> {
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     abstract get size(): number;
     /**
      * Time Complexity: O(n)
@@ -15,10 +11,6 @@ export declare abstract class IterableEntryBase<K = any, V = any> {
      * parameter is used to pass any additional arguments to the `_getIterator` method.
      */
     [Symbol.iterator](...args: any[]): IterableIterator<[K, V]>;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -27,10 +19,6 @@ export declare abstract class IterableEntryBase<K = any, V = any> {
      * be undefined.
      */
     entries(): IterableIterator<[K, V | undefined]>;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -38,10 +26,6 @@ export declare abstract class IterableEntryBase<K = any, V = any> {
      * The function returns an iterator that yields the keys of a data structure.
      */
     keys(): IterableIterator<K>;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -49,10 +33,6 @@ export declare abstract class IterableEntryBase<K = any, V = any> {
      * The function returns an iterator that yields the values of a collection.
      */
     values(): IterableIterator<V>;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -68,10 +48,6 @@ export declare abstract class IterableEntryBase<K = any, V = any> {
      * the collection satisfies the provided predicate function, and `false` otherwise.
      */
     every(predicate: EntryCallback<K, V, boolean>, thisArg?: any): boolean;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -88,14 +64,6 @@ export declare abstract class IterableEntryBase<K = any, V = any> {
      * the collection, and false otherwise.
      */
     some(predicate: EntryCallback<K, V, boolean>, thisArg?: any): boolean;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -110,10 +78,6 @@ export declare abstract class IterableEntryBase<K = any, V = any> {
      * used as the `this` value when calling the callback function. If `thisArg` is not provided, `
      */
     forEach(callbackfn: EntryCallback<K, V, void>, thisArg?: any): void;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -131,11 +95,7 @@ export declare 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;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
+    find(callbackfn: EntryCallback<K, V, boolean>, thisArg?: any): [K, V] | undefined;
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -147,10 +107,6 @@ export declare abstract class IterableEntryBase<K = any, V = any> {
      * otherwise.
      */
     has(key: K): boolean;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -161,10 +117,6 @@ export declare abstract class IterableEntryBase<K = any, V = any> {
      * @returns a boolean value, either true or false.
      */
     hasValue(value: V): boolean;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -193,17 +145,13 @@ export declare abstract class IterableEntryBase<K = any, V = any> {
      * all the elements in the collection.
      */
     reduce<U>(callbackfn: ReduceEntryCallback<K, V, U>, initialValue: U): U;
-    /**
-     * 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;
+    print(): [K, V][] | string;
     abstract isEmpty(): boolean;
     abstract clear(): void;
     abstract clone(): any;

package/dist/data-structures/base/iterable-entry-base.js

@@ -23,10 +23,6 @@ class IterableEntryBase {
     *[Symbol.iterator](...args) {
         yield* this._getIterator(...args);
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -39,10 +35,6 @@ class IterableEntryBase {
             yield item;
         }
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -54,10 +46,6 @@ class IterableEntryBase {
             yield item[0];
         }
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -69,10 +57,6 @@ class IterableEntryBase {
             yield item[1];
         }
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -96,10 +80,6 @@ class IterableEntryBase {
         }
         return true;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -124,14 +104,6 @@ class IterableEntryBase {
         }
         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)
@@ -152,10 +124,6 @@ class IterableEntryBase {
             callbackfn.call(thisArg, value, key, index++, this);
         }
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -182,10 +150,6 @@ class IterableEntryBase {
         }
         return;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -204,10 +168,6 @@ class IterableEntryBase {
         }
         return false;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -224,10 +184,6 @@ class IterableEntryBase {
         }
         return false;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -271,10 +227,6 @@ class IterableEntryBase {
         }
         return accumulator;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -282,7 +234,7 @@ class IterableEntryBase {
      * The print function logs the elements of an array to the console.
      */
     print() {
-        console.log([...this]);
+        return [...this];
     }
 }
 exports.IterableEntryBase = IterableEntryBase;

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

@@ -54,10 +54,6 @@ export declare class AVLTreeMultiMap<K = any, V = any, R = BTNEntry<K, V>, NODE
      * @returns the sum of the count property of all nodes in the tree.
      */
     get count(): number;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -108,10 +104,6 @@ export declare class AVLTreeMultiMap<K = any, V = any, R = BTNEntry<K, V>, NODE
      * @returns either a NODE object or undefined.
      */
     keyValueOrEntryOrRawElementToNode(keyOrNodeOrEntryOrRawElement: R | BTNKeyOrNodeOrEntry<K, V, NODE>, value?: V, count?: number): NODE | undefined;
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -130,10 +122,6 @@ export declare class AVLTreeMultiMap<K = any, V = any, R = BTNEntry<K, V>, NODE
      * @returns a boolean value.
      */
     add(keyOrNodeOrEntryOrRawElement: R | BTNKeyOrNodeOrEntry<K, V, NODE>, value?: V, count?: number): boolean;
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -154,10 +142,6 @@ export declare class AVLTreeMultiMap<K = any, V = any, R = BTNEntry<K, V>, NODE
      * @returns an array of `BinaryTreeDeleteResult<NODE>`.
      */
     delete<C extends BTNCallback<NODE>>(identifier: ReturnType<C>, callback?: C, ignoreCount?: boolean): BinaryTreeDeleteResult<NODE>[];
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -166,10 +150,6 @@ export declare class AVLTreeMultiMap<K = any, V = any, R = BTNEntry<K, V>, NODE
      * zero.
      */
     clear(): void;
-    /**
-     * Time Complexity: O(n log n)
-     * Space Complexity: O(log n)
-     */
     /**
      * Time Complexity: O(n log n)
      * Space Complexity: O(log n)
@@ -183,10 +163,6 @@ export declare class AVLTreeMultiMap<K = any, V = any, R = BTNEntry<K, V>, NODE
      * balancing operation is successful, and `false` if there are no nodes to balance.
      */
     perfectlyBalance(iterationType?: IterationType): boolean;
-    /**
-     * Time complexity: O(n)
-     * Space complexity: O(n)
-     */
     /**
      * Time complexity: O(n)
      * Space complexity: O(n)
@@ -195,10 +171,6 @@ export declare class AVLTreeMultiMap<K = any, V = any, R = BTNEntry<K, V>, NODE
      * @returns The `clone()` method is returning a cloned instance of the `TREE` object.
      */
     clone(): TREE;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -213,10 +185,6 @@ export declare class AVLTreeMultiMap<K = any, V = any, R = BTNEntry<K, V>, NODE
      * If either `srcNode` or `destNode` is undefined, it returns `undefined`.
      */
     protected _swapProperties(srcNode: R | BSTNKeyOrNode<K, NODE>, destNode: R | BSTNKeyOrNode<K, NODE>): NODE | undefined;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)

package/dist/data-structures/binary-tree/avl-tree-multi-map.js

@@ -61,10 +61,6 @@ class AVLTreeMultiMap extends avl_tree_1.AVLTree {
     get count() {
         return this._count;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -129,26 +125,22 @@ class AVLTreeMultiMap extends avl_tree_1.AVLTree {
             return;
         if (this.isNode(keyOrNodeOrEntryOrRawElement))
             return keyOrNodeOrEntryOrRawElement;
-        if (this.toEntryFn) {
-            const [key, entryValue] = this.toEntryFn(keyOrNodeOrEntryOrRawElement);
-            if (key)
-                return this.createNode(key, entryValue !== null && entryValue !== void 0 ? 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 !== null && value !== void 0 ? value : entryValue, count);
+        }
+        if (this.toEntryFn) {
+            const [key, entryValue] = this.toEntryFn(keyOrNodeOrEntryOrRawElement);
+            if (this.isKey(key))
+                return this.createNode(key, value !== null && value !== void 0 ? value : entryValue, count);
         }
         if (this.isKey(keyOrNodeOrEntryOrRawElement))
             return this.createNode(keyOrNodeOrEntryOrRawElement, value, count);
         return;
     }
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -177,10 +169,6 @@ class AVLTreeMultiMap extends avl_tree_1.AVLTree {
         }
         return true;
     }
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -233,7 +221,7 @@ class AVLTreeMultiMap extends avl_tree_1.AVLTree {
                 }
             }
             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);
@@ -259,10 +247,6 @@ class AVLTreeMultiMap extends avl_tree_1.AVLTree {
         }
         return deletedResult;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -274,10 +258,6 @@ class AVLTreeMultiMap extends avl_tree_1.AVLTree {
         super.clear();
         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)
@@ -326,10 +306,6 @@ class AVLTreeMultiMap extends avl_tree_1.AVLTree {
             return true;
         }
     }
-    /**
-     * Time complexity: O(n)
-     * Space complexity: O(n)
-     */
     /**
      * Time complexity: O(n)
      * Space complexity: O(n)
@@ -342,10 +318,6 @@ class AVLTreeMultiMap extends avl_tree_1.AVLTree {
         this.bfs(node => cloned.add(node.key, node.value, node.count));
         return cloned;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -380,10 +352,6 @@ class AVLTreeMultiMap extends avl_tree_1.AVLTree {
         }
         return undefined;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)