Author: Tony Werten
Date: 04:40:45 11/08/02
Go up one level in this thread
On November 08, 2002 at 04:14:34, Daniel Clausen wrote: >On November 07, 2002 at 18:03:52, Ron Murawski wrote: > >>On November 07, 2002 at 16:57:04, Martin Bauer wrote: >> >>>On November 07, 2002 at 16:08:49, Tony Werten wrote: >>> >>>>Somewhere from 8Mb you will get a 99,9% hitrate after a few seconds. >>> >>>Memory usage depends on waht I am storing, can you tell me a number of Hashtable >>>entries? >>> >> >>One less than a power of two (aka Mesenne number) entries is best, a prime >>number of entries is supposed to be acceptable. > >Shouldn't it be the opposite? "prime number is best but 2^n-1 is acceptable"? Don't think so. With a big table, collisions are not probable so no real difference there. But: 2^n-1 can be calculated with a cheap AND and prime most be done with an expensive mod. BTW the AND number is 2^n-1 so the number of entries is 2^n Tony > >Sargon
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.