var searchIndex = {};
searchIndex["bloomfilter"] = {"doc":"Bloom filter for Rust","items":[[3,"Bloom","bloomfilter","Bloom filter structure",null,null],[11,"new","","Create a new bloom filter structure.\nbitmap_size is the size in bytes (not bits) that will be allocated in memory\nitems_count is an estimation of the maximum number of items to store.",0,{"inputs":[{"name":"usize"},{"name":"usize"}],"output":{"name":"bloom"}}],[11,"new_for_fp_rate","","Create a new bloom filter structure.\nitems_count is an estimation of the maximum number of items to store.\nfp_p is the wanted rate of false positives, in ]0.0, 1.0[",0,{"inputs":[{"name":"usize"},{"name":"f64"}],"output":{"name":"bloom"}}],[11,"compute_bitmap_size","","Compute a recommended bitmap size for items_count items\nand a fp_p rate of false positives.\nfp_p obviously has to be within the ]0.0, 1.0[ range.",0,{"inputs":[{"name":"usize"},{"name":"f64"}],"output":{"name":"usize"}}],[11,"set","","Record the presence of an item.",0,null],[11,"check","","Check if an item is present in the set.\nThere can be false positives, but no false negatives.",0,null],[11,"check_and_set","","Record the presence of an item in the set,\nand return the previous state of this item.",0,null],[11,"number_of_bits","","Return the number of bits in the filter",0,null],[11,"number_of_hash_functions","","Return the number of hash functions used for `check` and `set`",0,null]],"paths":[[3,"Bloom"]]};
initSearch(searchIndex);