tstruct/dist/Queue/PriorityQueue.d.ts

Data structures & basic algorithms library

export interface IPriorityQueue<T> {
    enqueue(item: T): void;
    dequeue(): T;
    peek(): T;
    toArray(): T[];
    rearrange(): void;
    readonly size: number;
    readonly isEmpty: boolean;
    [Symbol.iterator](): Iterator<T, any, undefined>;
}
export declare class PriorityQueue<T> implements IPriorityQueue<T> {
    private _heap;
    constructor(getPriority: (value: T) => any, compareFunction?: import("../CompareFunction").CompareFunctionType<any>);
    rearrange(): void;
    enqueue(item: T): void;
    dequeue(): T;
    peek(): T;
    toArray(): T[];
    get size(): number;
    get isEmpty(): boolean;
    [Symbol.iterator](): Iterator<T, any, undefined>;
}