Method removeAt

data_structures/deque.ts:366–370

* Remove and return the element at the given index (0-based from front). * Negative indices count from the back (`-1` is the last element). Returns * `undefined` for out-of-range indices. The gap is closed by shifting * whichever side (front or back) has fewer elements to move. * * @e

(index: number)

   * @returns The removed element, or `undefined` if the index is out of range.
   */
  removeAt(index: number): T | undefined {
    if (index < 0) index += this.#length;
    if (index < 0 || index >= this.#length) return undefined;
    return this.#removeAtUnchecked(index);
  }

  /**
   * Return the first element matching the predicate, scanning from front to