/**
 * B-Tree Index for Range Queries (T023 - Simplified)
 *
 * Provides ordered index with range query support.
 * Uses a sorted array structure for simplicity while maintaining O(log n) operations.
 */
import type { IIndex, IndexStats, IndexEntry } from './types.js';
export declare class BTreeIndex implements IIndex {
    readonly name: string;
    readonly type: 'btree';
    private items;
    private unique;
    private compareFn;
    constructor(name: string, options?: {
        unique?: boolean;
        compareFn?: (a: any, b: any) => number;
    });
    /**
     * Default comparison function
     */
    private defaultCompare;
    /**
     * Binary search to find insertion point or exact match
     */
    private binarySearch;
    /**
     * Insert entry into index
     */
    insert(key: any, path: string, value?: any): void;
    /**
     * Remove entry from index
     */
    remove(key: any, path?: string): boolean;
    /**
     * Find paths by key
     */
    find(key: any): string[];
    /**
     * Check if key exists
     */
    has(key: any): boolean;
    /**
     * Range query: find all entries between start and end (inclusive)
     */
    range(start: any, end: any): string[];
    /**
     * Find entries greater than key
     */
    greaterThan(key: any, inclusive?: boolean): string[];
    /**
     * Find entries less than key
     */
    lessThan(key: any, inclusive?: boolean): string[];
    /**
     * Clear all entries
     */
    clear(): void;
    /**
     * Get number of unique keys
     */
    size(): number;
    /**
     * Get index statistics
     */
    stats(): IndexStats;
    /**
     * Get all keys in sorted order
     */
    keys(): IterableIterator<any>;
    /**
     * Get all entries in sorted order
     */
    entries(): IterableIterator<IndexEntry>;
}
//# sourceMappingURL=btree-index.d.ts.map