RE: [boost] Re: Re: Compile time prime numbers, powers and roots

From: Ehsan Akhgari (ehsan_at_[hidden])
Date: 2003-09-20 09:41:59

> > or less with MSVC 6.0.  I can increase this to 29 bits, but
> granted,
> > I'm still a few bits off.  This may be an issue for some people,
> > especially those who need very large prime numbers for
> random number
> > seed values. However it should suffice for people requiring prime
> > numbers for hash table sizes.  It is quite likely that better
> > compilers will be able to handle larger numbers, but I have not
> > tried.  If anyone has MSVC 7.0, or another C++ compiler and wishes
> > to see how high they can go I'd be interested to know.
>
> I will try it with VC++ 7.1 and will report the results.  I can test
> with Intel C++ 7.1 as well, but I doubt it can outperform VC++ 7.1 on
> compiler limits.

Do you have any test program which I can compile against Prime.hpp to
report the results?  If so, please send me a copy of the source code for
the program.

Thanks.
-------------
Ehsan Akhgari

List Owner: MSVC_at_[hidden]

[ Email: ehsan_at_[hidden] ]
[ WWW: http://www.beginthread.com/Ehsan ]