The primes package

[Tags:bsd3, library]

This Haskell library provides an efficient lazy wheel sieve for prime generation inspired by Lazy wheel sieves and spirals of primes by Colin Runciman and The Genuine Sieve of Eratosthenes by Melissa O'Neil.

[Skip to Readme]

Properties

Versions	0.1, 0.1.1, 0.1.1.1, 0.2.0.0, 0.2.1.0
Dependencies	base (==4.*) [details]
License	BSD3
Author	Sebastian Fischer
Maintainer	Sebastian Fischer
Category	Algorithms, Numerical
Home page	http://github.com/sebfisch/primes
Bug tracker	http://github.com/sebfisch/primes/issues
Source repository	head: git clone git://github.com/sebfisch/primes.git
Uploaded	Fri Apr 29 09:38:55 UTC 2011 by SebastianFischer
Distributions	Arch:0.2.1.0, Debian:0.2.1.0, LTSHaskell:0.2.1.0, NixOS:0.2.1.0, Stackage:0.2.1.0, Tumbleweed:0.2.1.0
Downloads	7286 total (144 in the last 30 days)
Votes	0 []
Status	Docs uploaded by user Build status unknown [no reports yet] Hackage Matrix CI

Modules

Data
- Numbers
  - Data.Numbers.Primes

[Index]

Downloads

primes-0.2.1.0.tar.gz [browse] (Cabal source package)
Package description (included in the package)

Maintainer's Corner

For package maintainers and hackage trustees

edit package information

Readme for primes

Readme for primes-0.2.1.0

This Haskell library provides an efficient lazy wheel sieve for prime
generation inspired by "Lazy wheel sieves and spirals of primes" [1]
by Colin Runciman and "The Genuine Sieve of Eratosthenes" [2] by
Melissa O'Neil.

[1]: <http://www.cs.york.ac.uk/ftpdir/pub/colin/jfp97lw.ps.gz>
[2]: <http://www.cs.hmc.edu/~oneill/papers/Sieve-JFP.pdf>