Computer Chess Club Archives

Search

Messages

Subject: Re: hash table size - is a power of 2 still an advantage these days?

Author: Johan de Koning

Date: 18:03:47 09/26/03

Go up one level in this thread

On September 24, 2003 at 18:14:46, Dieter Buerssner wrote:

>On September 24, 2003 at 17:32:16, Dieter Buerssner wrote:
>
>>  struct hash_entry *p = (struct hash_entry *)((unsigned char *)(base_adress +
>>(size_t)((UINT64)tableSize_times_48 * (hashKey64 & 0xffffffff))));
>
>Sorry, parentheses are wrong. base_adress must be casted to some char *, not the
>result of adding base_adress to some term. I typed it just in. After reading it,
>it was obvious. I hope, the idea is still clear.

It's clear, but you seem to have lost the >>32.
I was wondering when you posted it last month (with the >>32 in it IIRC):
wouldn't the 48-fold then be gone?

... Johan

• Re: hash table size - is a power of 2 still an advantage these days? Dieter Buerssner 13:40:43 09/27/03
  • Re: hash table size - is a power of 2 still an advantage these days? Johan de Koning 17:22:21 09/27/03
    • Re: hash table size - is a power of 2 still an advantage these days? Dieter Buerssner 13:39:58 09/28/03

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.