queue-typed 1.48.8 → 1.49.0

package/src/data-structures/queue/deque.ts

@@ -849,194 +849,4 @@ export class Deque<E> extends IterableElementBase<E> {
 
     return { bucketIndex, indexInBucket };
   }
-}
-
-// O(1) time complexity of obtaining the element
-// O(n) time complexity of adding at the beginning and the end
-// todo tested slowest one
-export class ObjectDeque<E = number> {
-  constructor(capacity?: number) {
-    if (capacity !== undefined) this._capacity = capacity;
-  }
-
-  protected _nodes: { [key: number]: E } = {};
-
-  get nodes(): { [p: number]: E } {
-    return this._nodes;
-  }
-
-  protected _capacity = Number.MAX_SAFE_INTEGER;
-
-  get capacity(): number {
-    return this._capacity;
-  }
-
-  protected _first = -1;
-
-  get first(): number {
-    return this._first;
-  }
-
-  protected _last = -1;
-
-  get last(): number {
-    return this._last;
-  }
-
-  protected _size = 0;
-
-  get size(): number {
-    return this._size;
-  }
-
-  /**
-   * Time Complexity: O(1)
-   * Space Complexity: O(1)
-   */
-
-  /**
-   * Time Complexity: O(1)
-   * Space Complexity: O(1)
-   *
-   * The "addFirst" function adds an element to the beginning of an array-like data structure.
-   * @param {E} element - The `element` parameter represents the element that you want to add to the beginning of the data
-   * structure.
-   */
-  addFirst(element: E) {
-    if (this.size === 0) {
-      const mid = Math.floor(this.capacity / 2);
-      this._first = mid;
-      this._last = mid;
-    } else {
-      this._first--;
-    }
-    this.nodes[this.first] = element;
-    this._size++;
-  }
-
-  /**
-   * Time Complexity: O(1)
-   * Space Complexity: O(1)
-   */
-
-  /**
-   * Time Complexity: O(1)
-   * Space Complexity: O(1)
-   *
-   * The addLast function adds an element to the end of an array-like data structure.
-   * @param {E} element - The `element` parameter represents the element that you want to add to the end of the data structure.
-   */
-  addLast(element: E) {
-    if (this.size === 0) {
-      const mid = Math.floor(this.capacity / 2);
-      this._first = mid;
-      this._last = mid;
-    } else {
-      this._last++;
-    }
-    this.nodes[this.last] = element;
-    this._size++;
-  }
-
-  /**
-   * Time Complexity: O(1)
-   * Space Complexity: O(1)
-   */
-
-  /**
-   * Time Complexity: O(1)
-   * Space Complexity: O(1)
-   *
-   * The function `pollFirst()` removes and returns the first element in a data structure.
-   * @returns The element of the first element in the data structure.
-   */
-  pollFirst() {
-    if (!this.size) return;
-    const element = this.getFirst();
-    delete this.nodes[this.first];
-    this._first++;
-    this._size--;
-    return element;
-  }
-
-  /**
-   * Time Complexity: O(1)
-   * Space Complexity: O(1)
-   */
-
-  /**
-   * Time Complexity: O(1)
-   * Space Complexity: O(1)
-   *
-   * The `getFirst` function returns the first element in an array-like data structure if it exists.
-   * @returns The element at the first position of the `_nodes` array.
-   */
-  getFirst() {
-    if (this.size) return this.nodes[this.first];
-  }
-
-  /**
-   * Time Complexity: O(1)
-   * Space Complexity: O(1)
-   */
-
-  /**
-   * Time Complexity: O(1)
-   * Space Complexity: O(1)
-   *
-   * The `pollLast()` function removes and returns the last element in a data structure.
-   * @returns The element that was removed from the data structure.
-   */
-  pollLast() {
-    if (!this.size) return;
-    const element = this.getLast();
-    delete this.nodes[this.last];
-    this._last--;
-    this._size--;
-
-    return element;
-  }
-
-  /**
-   * Time Complexity: O(1)
-   * Space Complexity: O(1)
-   */
-
-  /**
-   * Time Complexity: O(1)
-   * Space Complexity: O(1)
-   *
-   * The `getLast()` function returns the last element in an array-like data structure.
-   * @returns The last element in the array "_nodes" is being returned.
-   */
-  getLast() {
-    if (this.size) return this.nodes[this.last];
-  }
-
-  /**
-   * Time Complexity: O(1)
-   * Space Complexity: O(1)
-   */
-
-  /**
-   * Time Complexity: O(1)
-   * Space Complexity: O(1)
-   *
-   * The get function returns the element at the specified index in an array-like data structure.
-   * @param {number} index - The index parameter is a number that represents the position of the element you want to
-   * retrieve from the array.
-   * @returns The element at the specified index in the `_nodes` array is being returned. If there is no element at that
-   * index, `undefined` is returned.
-   */
-  get(index: number) {
-    return this.nodes[this.first + index] || undefined;
-  }
-
-  /**
-   * The function checks if the size of a data structure is less than or equal to zero.
-   * @returns The method is returning a boolean element indicating whether the size of the object is less than or equal to 0.
-   */
-  isEmpty() {
-    return this.size <= 0;
-  }
-}
+}