[Haskell-cafe] Re: Looking for the fastest Haskell primes algorithm

[Johannes Waldmann]

for the API design, always check others before rolling your own.

E.g. the (three) functions with "Prime" in their name from
http://java.sun.com/javase/6/docs/api/java/math/BigInteger.html
I hope they are there for a reason.

While we're at it - do we have modPow? modInverse?

And of course check their implementation as well
(should be straightforward, but you never know).

J.W.

-------------- next part --------------
A non-text attachment was scrubbed...
Name: signature.asc
Type: application/pgp-signature
Size: 257 bytes
Desc: OpenPGP digital signature
Url : http://www.haskell.org/pipermail/haskell-cafe/attachments/20090415/48306b3a/signature.bin