/// <reference types="node" />
/**
 * Simple implementation of a bloom filter. This is a set-like data structure
 * that can be used to check whether certain items may or may not be present in
 * the set. This is a probabilistic data structure that does not return false
 * negatives, but may return false positives.
 *
 * Usually, bloom filters work by computing the hash of each item added to the
 * set. This implementation differs in that it does not compute any hash for
 * efficiency, and instead assumes that each item contains random data. Items
 * that share the same prefix will result in collisions/false positives.
 */
export declare class BloomFilter {
    private readonly bitMask;
    private readonly bitArray;
    constructor(bits: number);
    private indexOf;
    /**
     * Adds the item to the set.
     */
    put(item: Buffer): void;
    /**
     * Returns true if the item *may* have been previously added by a call to
     * `put()`, false otherwise. This method may return false positives, but
     * never returns false negatives.
     */
    maybeHas(item: Buffer): boolean;
}
//# sourceMappingURL=bloomFilter.d.ts.map