style: Remove unnecessary comments.

zrwusa · Oct 21, 2024 · 18fe006 · 18fe006
1 parent 5a492c1
commit 18fe006
Show file tree

Hide file tree

Showing 20 changed files with 10 additions and 1,505 deletions.
diff --git a/src/data-structures/base/iterable-element-base.ts b/src/data-structures/base/iterable-element-base.ts
@@ -29,10 +29,6 @@ export abstract class IterableElementBase<E, R, C> {
     return this._toElementFn;
   }
 
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(1)
-   */
   /**
    * Time Complexity: O(n)
    * Space Complexity: O(1)
@@ -46,10 +42,6 @@ export abstract class IterableElementBase<E, R, C> {
     yield* this._getIterator(...args);
   }
 
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(n)
-   */
   /**
    * Time Complexity: O(n)
    * Space Complexity: O(n)
@@ -62,10 +54,6 @@ export abstract class IterableElementBase<E, R, C> {
     }
   }
 
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(1)
-   */
   /**
    * Time Complexity: O(n)
    * Space Complexity: O(1)
@@ -90,15 +78,6 @@ export abstract class IterableElementBase<E, R, C> {
     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)
@@ -123,11 +102,6 @@ export abstract class IterableElementBase<E, R, C> {
     return false;
   }
 
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(n)
    * Space Complexity: O(1)
@@ -148,11 +122,6 @@ export abstract class IterableElementBase<E, R, C> {
     }
   }
 
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(n)
    * Space Complexity: O(1)
@@ -195,10 +164,6 @@ export abstract class IterableElementBase<E, R, C> {
     return false;
   }
 
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(1)
-   */
   /**
    * Time Complexity: O(n)
    * Space Complexity: O(1)
@@ -221,11 +186,6 @@ export abstract class IterableElementBase<E, R, C> {
     return accumulator;
   }
 
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(n)
-   */
-
   /**
    * Time Complexity: O(n)
    * Space Complexity: O(n)

diff --git a/src/data-structures/base/iterable-entry-base.ts b/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)
@@ -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,11 +245,6 @@ 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)

diff --git a/src/data-structures/binary-tree/avl-tree-multi-map.ts b/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)
@@ -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)
@@ -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)