3 ms·
If your keyword list is small, you can just tweak a Pearson hash function (i.e. random permutation) until you get the desired result: http://burtleburtle.net/bo
by senderista 8y ago
If your keyword list is small, you can just tweak a Pearson hash function (i.e. random permutation) until you get the desired result: http://burtleburtle.net/bob/hash/perfect.html http://burtleburtle.net/bob/hash/perfect.html
- rurban 8y agoYes, you can, but this approach is better. Pearson would beat CHM on very small CPU's (8-16bit) and it is not guaranteed to find a good permutation. With CHM it's much easier. Most important thing is to store the keywords for the false positive verification in an continuous const char const* array.