import { BackwardMatch } from './match';
export declare const BUCKET_BITS = 17;
export declare const MAX_TREE_COMP_LENGTH = 128;
export declare const MAX_TREE_SEARCH_DEPTH = 64;
export declare const WINDOW_GAP = 16;
export declare class BinaryTreeHasher {
    private buckets;
    private forest;
    private windowMask;
    private invalidPos;
    private bucketSize;
    constructor(lgwin: number, inputSize?: number);
    reset(): void;
    private leftChildIndex;
    private rightChildIndex;
    storeAndFindMatches(data: Uint8Array, curIx: number, ringBufferMask: number, maxLength: number, maxBackward: number, matches: BackwardMatch[] | null): BackwardMatch[];
    findAllMatches(data: Uint8Array, ringBufferMask: number, curIx: number, maxLength: number, maxBackward: number): BackwardMatch[];
    store(data: Uint8Array, mask: number, ix: number): void;
    storeRange(data: Uint8Array, mask: number, ixStart: number, ixEnd: number): void;
    stitchToPreviousBlock(numBytes: number, position: number, ringBuffer: Uint8Array, ringBufferMask: number): void;
}
export declare function createBinaryTreeHasher(lgwin: number, inputSize?: number): BinaryTreeHasher;
//# sourceMappingURL=hash-binary-tree.d.ts.map