/**
 * A fixed-size collection that maintains the top N highest-value entries.
 * Uses a min-heap internally for O(log n) insertion when at capacity.
 */
export declare class CandidateSet {
    readonly size: number;
    private readonly heap;
    constructor(size?: number);
    add(key: string, value: number): void;
    count(): number;
    getEntries(): CandidateSetEntry[];
    getKeys(): string[];
    /**
     * Bubble up element at index to maintain min-heap property
     */
    private bubbleUp;
    /**
     * Bubble down element at index to maintain min-heap property
     */
    private bubbleDown;
    private swap;
}
declare class CandidateSetEntry {
    readonly key: string;
    readonly value: number;
    constructor(key: string, value: number);
}
export {};
//# sourceMappingURL=candidate-set.d.ts.map