/**
 * A First-In-First-Out (FIFO) queue data structure.
 * @typeparam T - The type of elements stored in the queue
 */
export declare class Queue<T> {
    private back;
    private front;
    /**
     * Adds an element to the back of the queue.
     * @param val - The value to add
     */
    enqueue(val: T): void;
    /**
     * Removes and returns the element from the front of the queue.
     * @throws Error if the queue is empty
     */
    dequeue(): void;
    /**
     * Returns the element at the front of the queue without removing it.
     * @returns The element at the front of the queue
     * @throws Error if the queue is empty
     */
    peek(): T;
    /**
     * Returns the number of elements in the queue.
     * @returns The size of the queue
     */
    size(): number;
    /**
     * Checks if the queue is empty.
     * @returns True if the queue contains no elements, false otherwise
     */
    isEmpty(): boolean;
}
//# sourceMappingURL=queue.d.ts.map