/**
 * Priority Queue implementation for event queue management
 * Uses a binary heap with custom comparison function
 */
export declare class PriorityQueue<T> {
    private items;
    private compareFn;
    constructor(compareFn: (a: T, b: T) => boolean);
    push(item: T): void;
    pop(): T | undefined;
    size(): number;
    isEmpty(): boolean;
    private bubbleUp;
    private bubbleDown;
    private swap;
}
//# sourceMappingURL=PriorityQueue.d.ts.map