import { Basic, Options } from './types';
import { CloneCallback, DeleteCallback, ReturnValue, ReturnValueRaw } from "../types";
/**
 * A queue implemented using fixed-length arrays
 * @sealed
 */
export declare class Queue<T> extends Basic<T> {
    /**
     * offset of array
     */
    private offset_;
    /**
     * queue size
     */
    private size_;
    private a_;
    /**
     *
     * @param capacity if < 1 use default 10
     * @param opts
     */
    constructor(capacity?: number, opts?: Options<T>);
    /**
     * returns the length of the queue
     * @override
     */
    get length(): number;
    /**
     * returns the capacity of the queue
     * @override
     */
    get capacity(): number;
    /**
     * get queue element
     * @throws TypeError
     * @throws RangeError
     */
    get(i: number): T;
    /**
     * set queue element
     * @throws TypeError
     * @throws RangeError
     */
    set(i: number, val: T): void;
    /**
     * inserts val at the back of queue
     * @returns Returns true if successful, if queue is full do nothing and return false
     */
    pushBack(val: T): boolean;
    /**
     * inserts val at the front of queue
     * @returns Returns true if successful, if queue is full do nothing and return false
     */
    pushFront(val: T): boolean;
    /**
     * If the queue is not empty delete the element at the front
     * @param callback call the callback on the removed element
     * @returns deleted data
     */
    popFront(callback?: DeleteCallback<T>): ReturnValue<T>;
    /**
     * If the queue is not empty delete the element at the front
     * @param callback call the callback on the removed element
     * @returns deleted data
     */
    popFrontRaw(callback?: DeleteCallback<T>): ReturnValueRaw<T>;
    /**
     * If the queue is not empty delete the element at the back
     * @param callback call the callback on the removed element
     * @returns deleted data
     */
    popBack(callback?: DeleteCallback<T>): ReturnValue<T>;
    /**
     * If the queue is not empty delete the element at the back
     * @param callback call the callback on the removed element
     * @returns deleted data
     */
    popBackRaw(callback?: DeleteCallback<T>): ReturnValueRaw<T>;
    /**
     * clear the queue
     * @param callback call the callback on the removed element
     */
    clear(callback?: DeleteCallback<T>): void;
    /**
     * return js iterator
     * @param reverse If true, returns an iterator to traverse in reverse
     * @override
     */
    iterator(reverse?: boolean): Iterator<T>;
    /**
     * Create a full copy of the container
     * @param callback How to create a duplicate copy of an element
     */
    clone(callback?: CloneCallback<T>): Queue<T>;
    /**
     * push a copy of another container of queue.
     */
    pushList(vals: Iterable<T>, callback?: CloneCallback<T>): void;
}