Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Interesting numbers about hashing - 32 bits are clearly not enough

Author: Robert Hyatt

Date: 22:07:56 12/06/01

Go up one level in this thread


On December 07, 2001 at 00:22:19, Miguel A. Ballicora wrote:

>On December 07, 2001 at 00:20:18, Miguel A. Ballicora wrote:
>
>sorry, I pressed enter too early
>
>int64tostring (long long x, char *s)
>{ unsigned int a = x/1000000;
>  unsigned int b = x%1000000;
>  if (x>1000000)
>     sprintf(s,"%d%d",a,b);
>  else
>     sprintf(s,"%d",b);
>  return s;
>}
>
>then you use
>
>long long x;
>char buffer[64]
>printf("nodes: %s\n",int64tostring(x,buffer));
>
>Miguel


I did that some time back for some debugging stuff, so I guess I could use
that as a hack-around...




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.