import * as utils from '../../utils';
declare class Deque<T> implements Iterable<T> {
    private list;
    constructor(equalsFunction?: utils.EqualsFunction<T>);
    /*****************************************************************************
                                    INSPECTION
    *****************************************************************************/
    /**
     * Returns size of queue - O(1)
     */
    size(): number;
    /**
     * Returns true if queue is empty, false otherwise - O(1)
     */
    isEmpty(): boolean;
    /**
     * Deletes all elements in queue - O(1)
     */
    clear(): void;
    /*****************************************************************************
                                    INSERTION/DELETION
    *****************************************************************************/
    /**
     * Pushes element into front of queue - O(1)
     * @param {T} element - element to be enqueued
     */
    pushFront(element: T): void;
    /**
     * Pushes element from back of queue - O(1)
     * @param {T} element - element to be enqueued
     */
    pushBack(element: T): void;
    /**
     * Pops element from back queue - O(1)
     * @returns {T | null}
     */
    popFront(): T | null;
    /**
     * Pops element from back queue - O(1)
     * @returns {T | null}
     */
    popBack(): T | null;
    /*****************************************************************************
                                    ACCESSING
    *****************************************************************************/
    /**
     * Peeks at the element at the front of the queue - O(1)
     * @returns {T} - Frontmost element
     */
    peekFront(): T | null;
    /**
     * Peeks at the element at the back of the queue - O(1)
     * @returns {T} - Backmost element
     */
    peekBack(): T | null;
    /*****************************************************************************
                                    SEARCHING
    *****************************************************************************/
    /**
     * Checks if value is in queue - O(n)
     * @param {T} element  - element to search for
     * @returns {boolean}
     */
    contains(element: T): boolean;
    /*****************************************************************************
                                    HELPERS
    *****************************************************************************/
    [Symbol.iterator](): Iterator<T>;
}
export default Deque;
//# sourceMappingURL=deque.d.ts.map