/**
 * Min-heap priority queue with deterministic tie-breaking.
 *
 * Items are ordered by (priority, insertionOrder) so that equal-priority
 * items are extracted in FIFO order.  This guarantees deterministic
 * event ordering in the simulation engine.
 *
 * Validates: Requirements 1.1, 1.2
 */
export declare class PriorityQueue<T> {
    private heap;
    private counter;
    get size(): number;
    /** Insert an item with the given priority (lower = higher urgency). */
    insert(item: T, priority: number): void;
    /** Remove and return the minimum-priority item, or undefined if empty. */
    extractMin(): T | undefined;
    /** Return the minimum-priority item without removing it, or undefined if empty. */
    peek(): T | undefined;
    /** Remove all items and reset the insertion counter. */
    clear(): void;
    private less;
    private swap;
    private bubbleUp;
    private sinkDown;
}
//# sourceMappingURL=priority-queue.d.ts.map