6 thoughts on “Stand alone Java implementations of Cuckoo Hashing and Bloom Filters

  1. Anonymous

    I’m curious about your pseudo-random hash function:
    Random r = new Random( objectToHash.hashCode());
    int result = r.nextInt(maxBits);
    int round = 1;
    while( round

    Reply
  2. Anonymous

    Looks like wordpress ate my comment. I’ll try again.

    The added rounds don’t seem to do much to mix the hash value, they just replace the result with the next call to nextInt(). Did you intent this, or should it looks something like:

    result ^= r.nextInt(maxBits);

    Reply
  3. Anonymous

    actually, that whole hash function looks off. i suspect it was intended to do something more like
    result ^= r.nextInt(1

    Reply

Leave a Reply

Your email address will not be published. Required fields are marked *

You may use these HTML tags and attributes: <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <strike> <strong>