data-structure-typed 2.6.0 → 2.6.2

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

@@ -267,172 +267,12 @@ export declare class AVLTree<K = any, V = any, R = any> extends BST<K, V, R> imp
      * @param keyNodeOrEntry - The key, node, or entry to set.
      * @param [value] - The value, if providing just a key.
      * @returns True if the addition was successful, false otherwise.
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-      * @example
-   * // Set a key-value pair
-   *  const avl = new AVLTree<number, string>();
-   *     avl.set(1, 'one');
-   *     avl.set(2, 'two');
-   *     console.log(avl.get(1)); // 'one';
+     * @example
+     * // Set a key-value pair
+     *  const avl = new AVLTree<number, string>();
+     *     avl.set(1, 'one');
+     *     avl.set(2, 'two');
+     *     console.log(avl.get(1)); // 'one';
      */
     set(keyNodeOrEntry: K | AVLTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined, value?: V): boolean;
     /**
@@ -441,138 +281,12 @@ export declare class AVLTree<K = any, V = any, R = any> extends BST<K, V, R> imp
      *
      * @param keyNodeOrEntry - The node to delete.
      * @returns An array containing deletion results.
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-      * @example
-   * // Remove nodes and verify structure
-   *  const avl = new AVLTree<number>([5, 3, 7, 1, 4, 6, 8]);
-   *     avl.delete(3);
-   *     console.log(avl.has(3)); // false;
-   *     console.log(avl.size); // 6;
+     * @example
+     * // Remove nodes and verify structure
+     *  const avl = new AVLTree<number>([5, 3, 7, 1, 4, 6, 8]);
+     *     avl.delete(3);
+     *     console.log(avl.has(3)); // false;
+     *     console.log(avl.size); // 6;
      */
     delete(keyNodeOrEntry: K | AVLTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined): boolean;
     /**
@@ -582,88 +296,14 @@ export declare class AVLTree<K = any, V = any, R = any> extends BST<K, V, R> imp
      *
      * @param [iterationType=this.iterationType] - The traversal method for the initial node export.
      * @returns True if successful, false if the tree was empty.
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-      * @example
-   * // Rebalance the tree
-   *  const avl = new AVLTree<number>();
-   *     // Insert in sorted order (worst case for BST)
-   *     for (let i = 1; i <= 7; i++) avl.add(i);
-   *     console.log(avl.isAVLBalanced()); // false;
-   *     avl.perfectlyBalance();
-   *     console.log(avl.isAVLBalanced()); // true;
+     * @example
+     * // Rebalance the tree
+     *  const avl = new AVLTree<number>();
+     *     // Insert in sorted order (worst case for BST)
+     *     for (let i = 1; i <= 7; i++) avl.add(i);
+     *     console.log(avl.isAVLBalanced()); // false;
+     *     avl.perfectlyBalance();
+     *     console.log(avl.isAVLBalanced()); // true;
      */
     perfectlyBalance(iterationType?: IterationType): boolean;
     /**
@@ -677,126 +317,15 @@ export declare class AVLTree<K = any, V = any, R = any> extends BST<K, V, R> imp
      * @param [options] - Options for the new AVLTree.
      * @param [thisArg] - `this` context for the callback.
      * @returns A new, mapped AVLTree.
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-     
-      * @example
-   * // Transform to new tree
-   *  const avl = new AVLTree<number, number>([[1, 10], [2, 20], [3, 30]]);
-   *     const doubled = avl.map((value, key) => [key, (value ?? 0) * 2] as [number, number]);
-   *     console.log([...doubled.values()]); // [20, 40, 60];
+     * @example
+     * // Transform to new tree
+     *  const avl = new AVLTree<number, number>([
+     *       [1, 10],
+     *       [2, 20],
+     *       [3, 30]
+     *     ]);
+     *     const doubled = avl.map((value, key) => [key, (value ?? 0) * 2] as [number, number]);
+     *     console.log([...doubled.values()]); // [20, 40, 60];
      */
     map<MK = K, MV = V, MR = any>(callback: EntryCallback<K, V | undefined, [MK, MV]>, options?: Partial<BinaryTreeOptions<MK, MV, MR>>, thisArg?: unknown): AVLTree<MK, MV, MR>;
     /**