tags:

views:

575

answers:

2

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.

+1  A: 

I've not used it myself, but you can try the Rabin Hash Function project on Source Forge.

Bill the Lizard
What do you know, the same project I recommended in my answer, which got deleted.
Jonathan Feinberg
A LMGTFY link isn't a project recommendation. It isn't an answer either, and it will always get deleted.
Bill the Lizard
It's an excellent answer. It's certainly better than this one.
Jonathan Feinberg
The majority of the SO community seems to disagree. http://meta.stackoverflow.com/questions/15650/ban-lmgtfy-let-me-google-that-for-you-links
Bill the Lizard
I don't see a lot of agreement with your position at the link you provide.
Jonathan Feinberg
@JF - the original question was a request for a "recommendation" for a "fast" library.
Joel
+1  A: 

Here's my Java implementation.

http://code.google.com/p/rabinfingerprint/

It also includes arbitrarily large irreducible polynomials (using BigIntegers).

Bill Dwyer