Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I am looking for an implementation of the Rabin Hash Function in Java, Can anyone recommend a fast library?
Update:
I’ve just tested the library here.
It takes ~2200ms to hash 1mm random urls on my 2GHz processor.
This is certainly good enough for my needs, however I will test another library when I get a monent and post the results here.
Here’s my Java implementation.
http://code.google.com/p/rabinfingerprint/
It also includes arbitrarily large irreducible polynomials (using BigIntegers).