Method toArray

data_structures/deque.ts:603–614

* Return a shallow copy of the deque's contents as an array, in * front-to-back order. * * @example Converting to an array * ```ts * import { Deque } from "@std/data-structures/deque"; * import { assertEquals } from "@std/assert"; * * const deque = new Deque([1, 2, 3]); *

()

   * @returns An array containing the deque's elements in order.
   */
  toArray(): T[] {
    const buf = this.#buffer;
    const head = this.#head;
    const len = this.#length;
    const cap = this.#mask + 1;
    const result = new Array<T>(len);
    const firstLen = Math.min(len, cap - head);
    for (let i = 0; i < firstLen; i++) result[i] = buf[head + i] as T;
    const rem = len - firstLen;
    for (let i = 0; i < rem; i++) result[firstLen + i] = buf[i] as T;
    return result;
  }

  /**
   * Create a new deque from an array-like, iterable, or existing deque.