Tag Archives: binary search

Using a cmph as a Set

Given the extremely low overhead of the minimal perfect hashes generated by cmph (on the order of 1/2 a byte per key), I was fairly certain they would generate false positives. That is, if you searched for a key that … Continue reading

Posted in c programming | Tagged , , , , | Leave a comment