linked-list-typed 1.52.3 → 1.52.5

package/src/data-structures/linked-list/doubly-linked-list.ts

@@ -133,12 +133,6 @@ export class DoublyLinkedList<E = any, R = any> extends IterableElementBase<E, R
     return this._size;
   }
 
-  /**
-   * Time Complexity: O(1)
-   * Space Complexity: O(1)
-   * where n is the number of elements in the linked list.
-   */
-
   /**
    * Time Complexity: O(1)
    * Space Complexity: O(1)
@@ -150,11 +144,6 @@ export class DoublyLinkedList<E = any, R = any> extends IterableElementBase<E, R
     return this.head?.value;
   }
 
-  /**
-   * Time Complexity: O(1)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(1)
    * Space Complexity: O(1)
@@ -166,11 +155,6 @@ export class DoublyLinkedList<E = any, R = any> extends IterableElementBase<E, R
     return this.tail?.value;
   }
 
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(n)
-   */
-
   /**
    * Time Complexity: O(n)
    * Space Complexity: O(n)
@@ -187,9 +171,7 @@ export class DoublyLinkedList<E = any, R = any> extends IterableElementBase<E, R
   /**
    * Time Complexity: O(1)
    * Space Complexity: O(1)
-   */
-
-  /**
+   *
    * The push function adds a new element to the end of a doubly linked list.
    * @param {E} element - The "element" parameter represents the value that you want to add to the
    * doubly linked list.
@@ -212,9 +194,7 @@ export class DoublyLinkedList<E = any, R = any> extends IterableElementBase<E, R
   /**
    * Time Complexity: O(1)
    * Space Complexity: O(1)
-   */
-
-  /**
+   *
    * The `pop()` function removes and returns the value of the last element in a linked list.
    * @returns The method is returning the value of the removed node.
    */
@@ -235,9 +215,7 @@ export class DoublyLinkedList<E = any, R = any> extends IterableElementBase<E, R
   /**
    * Time Complexity: O(1)
    * Space Complexity: O(1)
-   */
-
-  /**
+   *
    * The `shift()` function removes and returns the value of the first element in a doubly linked list.
    * @returns The value of the removed node.
    */
@@ -258,9 +236,7 @@ export class DoublyLinkedList<E = any, R = any> extends IterableElementBase<E, R
   /**
    * Time Complexity: O(1)
    * Space Complexity: O(1)
-   */
-
-  /**
+   *
    * The unshift function adds a new element to the beginning of a doubly linked list.
    * @param {E} element - The "element" parameter represents the value of the element that you want to
    * add to the beginning of the doubly linked list.
@@ -280,11 +256,6 @@ export class DoublyLinkedList<E = any, R = any> extends IterableElementBase<E, R
     return true;
   }
 
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(n)
    * Space Complexity: O(1)
@@ -304,11 +275,6 @@ export class DoublyLinkedList<E = any, R = any> extends IterableElementBase<E, R
     return current!.value;
   }
 
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(n)
    * Space Complexity: O(1)
@@ -329,11 +295,6 @@ export class DoublyLinkedList<E = any, R = any> extends IterableElementBase<E, R
     return current;
   }
 
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(n)
    * Space Complexity: O(1)
@@ -357,11 +318,6 @@ export class DoublyLinkedList<E = any, R = any> extends IterableElementBase<E, R
     return undefined;
   }
 
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(n)
    * Space Complexity: O(1)
@@ -396,12 +352,6 @@ export class DoublyLinkedList<E = any, R = any> extends IterableElementBase<E, R
     return true;
   }
 
-  /**
-   * Time Complexity: O(1) or O(n)
-   * Space Complexity: O(1)
-   * where n is the number of elements in the linked list.
-   */
-
   /**
    * Time Complexity: O(1) or O(n)
    * Space Complexity: O(1)
@@ -442,11 +392,6 @@ export class DoublyLinkedList<E = any, R = any> extends IterableElementBase<E, R
     return false;
   }
 
-  /**
-   * Time Complexity: O(1) or O(n)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(1) or O(n)
    * Space Complexity: O(1)
@@ -516,11 +461,6 @@ export class DoublyLinkedList<E = any, R = any> extends IterableElementBase<E, R
     return true;
   }
 
-  /**
-   * Time Complexity: O(1) or O(n)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(1) or O(n)
    * Space Complexity: O(1)
@@ -557,11 +497,6 @@ export class DoublyLinkedList<E = any, R = any> extends IterableElementBase<E, R
     return false;
   }
 
-  /**
-   * Time Complexity: O(1)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(1)
    * Space Complexity: O(1)
@@ -573,11 +508,6 @@ export class DoublyLinkedList<E = any, R = any> extends IterableElementBase<E, R
     return this.size === 0;
   }
 
-  /**
-   * Time Complexity: O(1)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(1)
    * Space Complexity: O(1)
@@ -590,11 +520,6 @@ export class DoublyLinkedList<E = any, R = any> extends IterableElementBase<E, R
     this._size = 0;
   }
 
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(n)
    * Space Complexity: O(1)
@@ -618,11 +543,6 @@ export class DoublyLinkedList<E = any, R = any> extends IterableElementBase<E, R
     return -1;
   }
 
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(n)
    * Space Complexity: O(1)
@@ -645,11 +565,6 @@ export class DoublyLinkedList<E = any, R = any> extends IterableElementBase<E, R
     return undefined;
   }
 
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(n)
    * Space Complexity: O(1)
@@ -667,11 +582,6 @@ export class DoublyLinkedList<E = any, R = any> extends IterableElementBase<E, R
     return this;
   }
 
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(n)
-   */
-
   /**
    * Time Complexity: O(n)
    * Space Complexity: O(n)
@@ -689,11 +599,6 @@ export class DoublyLinkedList<E = any, R = any> extends IterableElementBase<E, R
     return array;
   }
 
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(n)
-   */
-
   /**
    * Time Complexity: O(n)
    * Space Complexity: O(n)
@@ -711,11 +616,6 @@ export class DoublyLinkedList<E = any, R = any> extends IterableElementBase<E, R
     return array;
   }
 
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(n)
-   */
-
   /**
    * Time Complexity: O(n)
    * Space Complexity: O(n)
@@ -729,11 +629,6 @@ export class DoublyLinkedList<E = any, R = any> extends IterableElementBase<E, R
     return new DoublyLinkedList<E, R>(this);
   }
 
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(n)
-   */
-
   /**
    * Time Complexity: O(n)
    * Space Complexity: O(n)
@@ -766,9 +661,7 @@ export class DoublyLinkedList<E = any, R = any> extends IterableElementBase<E, R
   /**
    * Time Complexity: O(n)
    * Space Complexity: O(n)
-   */
-
-  /**
+   *
    * The `map` function takes a callback function and returns a new DoublyLinkedList with the results
    * of applying the callback to each element in the original list.
    * @param callback - The callback parameter is a function that will be called for each element in the

package/src/data-structures/linked-list/singly-linked-list.ts

@@ -121,13 +121,6 @@ export class SinglyLinkedList<E = any, R = any> extends IterableElementBase<E, R
     return this._size;
   }
 
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(n)
-   * Linear time, where n is the length of the input array, as it performs a loop to push each element into the linked list.
-   * Linear space, as it creates a new node for each element in the array.
-   */
-
   /**
    * Time Complexity: O(n)
    * Space Complexity: O(n)
@@ -145,11 +138,6 @@ export class SinglyLinkedList<E = any, R = any> extends IterableElementBase<E, R
     return singlyLinkedList;
   }
 
-  /**
-   * Time Complexity: O(1)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(1)
    * Space Complexity: O(1)
@@ -172,12 +160,6 @@ export class SinglyLinkedList<E = any, R = any> extends IterableElementBase<E, R
     return true;
   }
 
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(1)
-   * Linear time in the worst case, as it may need to traverse the list to find the last element.
-   */
-
   /**
    * Time Complexity: O(n)
    * Space Complexity: O(1)
@@ -207,11 +189,6 @@ export class SinglyLinkedList<E = any, R = any> extends IterableElementBase<E, R
     return value;
   }
 
-  /**
-   * Time Complexity: O(1)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(1)
    * Space Complexity: O(1)
@@ -227,11 +204,6 @@ export class SinglyLinkedList<E = any, R = any> extends IterableElementBase<E, R
     return removedNode.value;
   }
 
-  /**
-   * Time Complexity: O(1)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(1)
    * Space Complexity: O(1)
@@ -254,11 +226,6 @@ export class SinglyLinkedList<E = any, R = any> extends IterableElementBase<E, R
     return true;
   }
 
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(n)
    * Space Complexity: O(1)
@@ -278,11 +245,6 @@ export class SinglyLinkedList<E = any, R = any> extends IterableElementBase<E, R
     return current!.value;
   }
 
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(n)
    * Space Complexity: O(1)
@@ -301,11 +263,6 @@ export class SinglyLinkedList<E = any, R = any> extends IterableElementBase<E, R
     return current;
   }
 
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(n)
    * Space Complexity: O(1)
@@ -334,11 +291,6 @@ export class SinglyLinkedList<E = any, R = any> extends IterableElementBase<E, R
     return true;
   }
 
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(n)
    * Space Complexity: O(1)
@@ -350,7 +302,7 @@ export class SinglyLinkedList<E = any, R = any> extends IterableElementBase<E, R
    * successfully deleted from the linked list, and `false` if the value or node is not found in the linked list.
    */
   delete(valueOrNode: E | SinglyLinkedListNode<E> | undefined): boolean {
-    if (!valueOrNode) return false;
+    if (valueOrNode === undefined) return false;
     let value: E;
     if (valueOrNode instanceof SinglyLinkedListNode) {
       value = valueOrNode.value;
@@ -383,11 +335,6 @@ export class SinglyLinkedList<E = any, R = any> extends IterableElementBase<E, R
     return false;
   }
 
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(n)
    * Space Complexity: O(1)
@@ -437,13 +384,6 @@ export class SinglyLinkedList<E = any, R = any> extends IterableElementBase<E, R
     this._size = 0;
   }
 
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(n)
-   * Linear time, where n is the length of the list, as it needs to traverse the entire list to convert it to an array.
-   * Linear space, as it creates an array with the same length as the list.
-   */
-
   /**
    * Time Complexity: O(n)
    * Space Complexity: O(n)
@@ -461,11 +401,6 @@ export class SinglyLinkedList<E = any, R = any> extends IterableElementBase<E, R
     return array;
   }
 
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(n)
    * Space Complexity: O(1)
@@ -491,11 +426,6 @@ export class SinglyLinkedList<E = any, R = any> extends IterableElementBase<E, R
     return this;
   }
 
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(n)
    * Space Complexity: O(1)
@@ -520,11 +450,6 @@ export class SinglyLinkedList<E = any, R = any> extends IterableElementBase<E, R
     return -1;
   }
 
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(n)
    * Space Complexity: O(1)
@@ -548,11 +473,6 @@ export class SinglyLinkedList<E = any, R = any> extends IterableElementBase<E, R
     return undefined;
   }
 
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(n)
    * Space Complexity: O(1)
@@ -593,11 +513,6 @@ export class SinglyLinkedList<E = any, R = any> extends IterableElementBase<E, R
     return false;
   }
 
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(n)
    * Space Complexity: O(1)
@@ -632,11 +547,6 @@ export class SinglyLinkedList<E = any, R = any> extends IterableElementBase<E, R
     return false;
   }
 
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(n)
    * Space Complexity: O(1)
@@ -659,11 +569,6 @@ export class SinglyLinkedList<E = any, R = any> extends IterableElementBase<E, R
     return count;
   }
 
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(n)
-   */
-
   /**
    * Time Complexity: O(n)
    * Space Complexity: O(n)
@@ -677,11 +582,6 @@ export class SinglyLinkedList<E = any, R = any> extends IterableElementBase<E, R
     return new SinglyLinkedList<E, R>(this, { toElementFn: this.toElementFn });
   }
 
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(n)
-   */
-
   /**
    * Time Complexity: O(n)
    * Space Complexity: O(n)
@@ -714,9 +614,7 @@ export class SinglyLinkedList<E = any, R = any> extends IterableElementBase<E, R
   /**
    * Time Complexity: O(n)
    * Space Complexity: O(n)
-   */
-
-  /**
+   *
    * The `map` function takes a callback function and returns a new SinglyLinkedList with the results
    * of applying the callback to each element in the original list.
    * @param callback - The `callback` parameter is a function that will be called for each element in

package/src/data-structures/linked-list/skip-linked-list.ts

@@ -80,11 +80,6 @@ export class SkipList<K, V> {
     return this._probability;
   }
 
-  /**
-   * Time Complexity: O(log n)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(1)
    * Space Complexity: O(1)
@@ -97,11 +92,6 @@ export class SkipList<K, V> {
     return firstNode ? firstNode.value : undefined;
   }
 
-  /**
-   * Time Complexity: O(log n)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(log n)
    * Space Complexity: O(1)
@@ -119,11 +109,6 @@ export class SkipList<K, V> {
     return current.value;
   }
 
-  /**
-   * Time Complexity: O(log n)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(log n)
    * Space Complexity: O(1)
@@ -155,11 +140,6 @@ export class SkipList<K, V> {
     }
   }
 
-  /**
-   * Time Complexity: O(log n)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(log n)
    * Space Complexity: O(1)
@@ -189,9 +169,7 @@ export class SkipList<K, V> {
   /**
    * Time Complexity: O(log n)
    * Space Complexity: O(1)
-   */
-
-  /**
+   *
    * The function checks if a key exists in a data structure.
    * @param {K} key - The parameter "key" is of type K, which represents the type of the key being
    * checked.
@@ -201,11 +179,6 @@ export class SkipList<K, V> {
     return this.get(key) !== undefined;
   }
 
-  /**
-   * Time Complexity: O(log n)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(log n)
    * Space Complexity: O(1)
@@ -244,11 +217,6 @@ export class SkipList<K, V> {
     return false;
   }
 
-  /**
-   * Time Complexity: O(log n)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(log n)
    * Space Complexity: O(1)
@@ -268,11 +236,6 @@ export class SkipList<K, V> {
     return nextNode ? nextNode.value : undefined;
   }
 
-  /**
-   * Time Complexity: O(log n)
-   * Space Complexity: O(1)
-   */
-
   /**
    * Time Complexity: O(log n)
    * Space Complexity: O(1)
@@ -297,12 +260,6 @@ export class SkipList<K, V> {
     return lastLess ? lastLess.value : undefined;
   }
 
-  /**
-   * Time Complexity: O(maxLevel)
-   * Space Complexity: O(1)
-   * where maxLevel is the maximum level of the SkipList, as it may iterate up to maxLevel times in the worst case.
-   */
-
   /**
    * Time Complexity: O(maxLevel)
    * Space Complexity: O(1)