/**
 * A simple fixed-capacity queue implementation.
 *
 * Unlike a naive queue implemented by `array.push()` and `array.shift()`, this avoids moving array elements around
 * and is `O(1)` for {@link addLast} and {@link removeFirst}.
 */
export declare class Queue<T> {
    private table;
    private head;
    private _length;
    constructor(initialItems: Iterable<T>);
    get isEmpty(): boolean;
    get length(): number;
    removeFirst(): T;
    addLast(element: T): void;
}