Verify that the two strings are consistent

The bloon filter . Simplest ： One bit vector ,1 byte 8 position , It's also 8 Slots , wow ！ such as 3 Kind of hash Algorithm ,（ modulus ？） Three slots correspond to bit position . result ：add  after  isExist-> This value absolutely does not exist | This value may exist .

in addition , Since you use the bloom filter to speed up the search and determine whether it exists , Then a hash function with low performance is not a good choice , recommend MurmurHash、Fnv these .

application ：

It can be judged that it absolutely does not exist .

The existence can be judged based on the probability of a certain word order error .

md5 encryption

hash  + modulus ( Replace with displacement )    ？  （ such as HashMap principle ？）

CRC32+ modulus ( Replace with displacement )    ？