Fast hash function with unique hashes
I'm writing a disk cache where filenames are the keys. The keys can be
longer than the max filename length, so they need to be hashed. What are
some fast hash functions with extremely low probability of collisions (so
that I can ignore it)?
Basically, I'm looking for a faster alternative to MD5 with no security
requirenments.
(Platform = Android, language = Java.)
No comments:
Post a Comment