mpz_prevprime
Marco Bodrato
bodrato at mail.dm.unipi.it
Mon Mar 23 21:41:38 UTC 2020
Il 2020-03-23 22:38 Marco Bodrato ha scritto:
> Using unsigned long to compute the modulus is obviously faster than
> many calls to mpz_cdiv_ui. I tried a patch that surely is not as fast
> as yours, but should speed-up all numbers that fits in a single
> unsigned long. The speed-up seems small, I'm not sure it's worth.
... it is not very interesting, but I attach the patch I wrote.
Ĝis,
m
-------------- next part --------------
A non-text attachment was scrubbed...
Name: nextprime_ulong.diff
Type: text/x-diff
Size: 835 bytes
Desc: not available
URL: <https://gmplib.org/list-archives/gmp-devel/attachments/20200323/697214a1/attachment.bin>
More information about the gmp-devel
mailing list