John R Pierce wrote:
There's another trick to this, primarily useful in assembler not C
programming...
You can do it in C also. Its called Duff's Device. Its ugly but legal
C code.
Here a URL with info on it:
http://bs.cs.tu-berlin.de/~jutta/c/duffs-device.html
Regards,
Herb
Philippe Trottier wrote:
I don't know how the software of primenet work but When I wanted a really
fast execution I was doing like so (The last time I coded it was in 1991)
*snap*
Sounds like loop unrolling is what you're talking about. Most modern compilers (try
to) do this already
Sounds like loop unrolling is what you're talking about. Most modern
compilers (try
to) do this already automatically. However, I've experimented on different
variations
of this with the Linux source to, I think, v16 or so, where it seemed
possible to
attain small benefits from various
HI!
Anyone tought of send ing these P and Q once a month to the server.. in the
case where someone would abandon a quest, it could be continued by someone
else ...
Notice that in v19 if you set it to get 10 Million range numbers you get a
warning
about it taking a year on a 500 Mhz P-2, and
On 20 Sep 99, at 1:06, Rick Pali wrote:
The only question that comes to mind is if you had to plough through
factoring before you got to the LL test...but then I realise that you still
wouldn't be done if that were true.
You don't have to pre-factor, if you choose "Test" or "Time" from the
"Brian J. Beesley" wrote:
On 20 Sep 99, at 1:06, Rick Pali wrote:
The only question that comes to mind is if you had to plough through
factoring before you got to the LL test...but then I realise that you still
wouldn't be done if that were true.
You don't have to pre-factor, if you