4 ms·
Is there any way to quickly compute 32-bit hash code of the string using SIMD? If yes, then we get a very fast perfect hash map: https://github.com/tatumizer/pi
by resource0x 8y ago
Is there any way to quickly compute 32-bit hash code of the string using SIMD? If yes, then we get a very fast perfect hash map: https://github.com/tatumizer/pigeon_map https://github.com/tatumizer/pigeon_map. Hash code in question is not supposed to be of crypto quality, just "good enough" will be good enough :)
- trentnelson 8y agoWhere's all this newfound interest in hash maps coming from? Once you hash something, you lose the prefix information, making it kinda' useless for this activity. Unless you create a hash for every string length variation... but, that seems like a lot of overhead for very little gain. I also can't see how you'd get that negative match fast path performance if you were reliant on hashes. That owes its speed to the length and unique char filter working in concert.