|Maintainer||Sebastian Fischer (email@example.com)|
This Haskell library provides an efficient lazy wheel sieve for prime generation inspired by Lazy wheel sieves and spirals of primes by Colin Runciman (http://www.cs.york.ac.uk/ftpdir/pub/colin/jfp97lw.ps.gz) and The Genuine Sieve of Eratosthenes by Melissa O'Neil (http://www.cs.hmc.edu/~oneill/papers/Sieve-JFP.pdf).
This global constant is an infinite list of prime numbers. It is
generated by a lazy wheel sieve and shared among different
applications. If you are concerned about the memory requirements of
sharing many primes you can call the function
This function returns an infinite list of prime numbers by sieving
with a wheel that cancels the multiples of the first
n is the argument given to
wheelSieve. Don't use too
large wheels because computing them is more expensive than
sieving. The number
6 is a good value to pass to this function.