-- Hoogle documentation, generated by Haddock
-- See Hoogle, http://www.haskell.org/hoogle/


-- | Efficient, purely functional generation of prime numbers
--   
--   This Haskell library provides an efficient lazy wheel sieve for prime
--   generation ispired by <a>Lazy wheel sieves and spirals of primes</a>
--   by Colin Runciman and <a>The Genuine Sieve of Eratosthenes</a> by
--   Melissa O'Neil.
@package primes
@version 0.1


-- | This Haskell library provides an efficient lazy wheel sieve for prime
--   generation ispired by <a>Lazy wheel sieves and spirals of primes</a>
--   [1] by Colin Runciman and <a>The Genuine Sieve of Eratosthenes</a> [2]
--   by Melissa O'Neil.
--   
--   <ul>
--   <li><i>1</i> :
--   <a>http://www.cs.york.ac.uk/ftpdir/pub/colin/jfp97lw.ps.gz</a></li>
--   <li><i>2</i> :
--   <a>http://www.cs.hmc.edu/~oneill/papers/Sieve-JFP.pdf</a></li>
--   </ul>
module Data.Numbers.Primes

-- | 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 <tt>wheelSieve</tt>
--   directly.
primes :: [Integer]

-- | This function returns an infinite list of prime numbers by sieving
--   with a wheel that cancels the multiples of the first <tt>n</tt> primes
--   where <tt>n</tt> is the argument given to <tt>wheelSieve</tt>. Don't
--   use too large wheels because computing them is more expensive than
--   sieving. The number <tt>6</tt> is a good value to pass to this
--   function.
wheelSieve :: Int -> [Integer]