/** * @nahisaho/yata-scale - B+Tree Index * * B+Tree implementation for efficient range queries */ import type { BPlusTreeConfig, RangeOptions, IndexStats } from '../types.js'; /** * B+Tree index for efficient key-value storage with range queries */ export declare class BPlusTreeIndex { private root; private readonly order; private entryCount; private readonly compare; constructor(config?: Partial); /** * Create a new leaf node */ private createLeafNode; /** * Create a new internal node */ private createInternalNode; /** * Insert a key-value pair */ insert(key: K, value: V): void; /** * Insert into a node, return split result if node was split */ private insertInNode; /** * Insert into a leaf node */ private insertInLeaf; /** * Insert into an internal node */ private insertInInternal; /** * Split a leaf node */ private splitLeaf; /** * Split an internal node */ private splitInternal; /** * Find child index for a key */ private findChildIndex; /** * Get a value by key */ get(key: K): V | undefined; /** * Delete a key */ delete(key: K): boolean; /** * Find the leaf node for a key */ private findLeaf; /** * Range query */ range(start: K, end: K, options?: RangeOptions): Generator<[K, V]>; /** * Forward range iteration */ private rangeForward; /** * Get all entries */ entries(): Generator<[K, V]>; /** * Clear all entries */ clear(): void; /** * Get entry count */ get size(): number; /** * Check if empty */ get isEmpty(): boolean; /** * Get index statistics */ getStats(): IndexStats; /** * Estimate memory size */ private estimateSize; /** * Get tree depth */ private getDepth; } //# sourceMappingURL=BPlusTreeIndex.d.ts.map