Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Questions about hash table implementation?

Author: Gian-Carlo Pascutto

Date: 11:18:28 05/22/01

Go up one level in this thread


On May 22, 2001 at 10:14:59, Miguel A. Ballicora wrote:

>As long as you use a C compiler, you can use unsigned ints and there should be
>no problem.

I think the Borland compiler allows range checking during debugging.
If you try to use it and hash like described, you will get bogus
runtime errors.

Aditionally, XOR'ing will remove flag dependencies, so I see
no reason to prefer XOR over ADD.

--
GCP



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.