/**
 * Ordered Set implementation for maintaining sweep line status
 * Uses binary search for insertion and maintains sorted order
 */
export declare class OrderedSet<T> {
    private items;
    private compareFn;
    constructor(compareFn: (a: T, b: T) => boolean);
    insert(item: T): number;
    delete(item: T): boolean;
    indexOf(item: T): number;
    at(index: number): T | undefined;
    size(): number;
    isEmpty(): boolean;
    clear(): void;
}
//# sourceMappingURL=OrderedSet.d.ts.map