Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Non power of two hash table sizes

Author: Robert Hyatt

Date: 19:52:35 02/18/02

Go up one level in this thread


On February 18, 2002 at 15:43:09, Alvaro Jose Povoa Cardoso wrote:

>My program uses hash tables witch are a power of two.
>In order to compute the index to an hash table of this kind I simply do:
>  hashindex=(hashkey & hashsize)
>in witch hashsize is a mask with for example the first 12 bits set for a size of
>4096 entries.
>I would like to know how to compute the index to a hash table that can have
>sizes like 1MB, 7MB, 45MB, 49MB, 50MB, ..etc
>Could someone please explain how to do this?
>
>Thank you,
>Alvaro Cardoso


index = signature % hash_size




This page took 0 seconds to execute

Last modified: Thu, 15 Apr 21 08:11:13 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.