[Haskell-cafe] Re: Looking for the fastest Haskell primes algorithm
waldmann at imn.htwk-leipzig.de
Wed Apr 15 06:25:49 EDT 2009
for the API design, always check others before rolling your own.
E.g. the (three) functions with "Prime" in their name from
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).
-------------- next part --------------
A non-text attachment was scrubbed...
Size: 257 bytes
Desc: OpenPGP digital signature
Url : http://www.haskell.org/pipermail/haskell-cafe/attachments/20090415/48306b3a/signature.bin
More information about the Haskell-Cafe