primes: Efficient, purely functional generation of prime numbers

[ algorithms, bsd3, library, numerical ] [ Propose Tags ] [ Report a vulnerability ]

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]

Modules

[Index]

Data
- Numbers
  - Data.Numbers.Primes

Downloads

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

Maintainer's Corner

Package maintainers

SebastianFischer

For package maintainers and hackage trustees

edit package information

Candidates

No Candidates

Versions [RSS]	0.1, 0.1.1, 0.1.1.1, 0.2.0.0, 0.2.1.0
Dependencies	base (>=4 && <5) [details]
License	BSD-3-Clause
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 repo	head: git clone git://github.com/sebfisch/primes.git
Uploaded	by SebastianFischer at 2011-04-29T09:38:55Z
Distributions	Arch:0.2.1.0, Debian:0.2.1.0, Fedora:0.2.1.0, LTSHaskell:0.2.1.0, NixOS:0.2.1.0, Stackage:0.2.1.0, openSUSE:0.2.1.0
Reverse Dependencies	18 direct, 141 indirect [details]
Downloads	24449 total (116 in the last 30 days)
Rating	2.0 (votes: 1) [estimated by Bayesian average]
Your Rating	λ λ λ
Status	Docs uploaded by user Build status unknown [no reports yet]

Readme for primes-0.2.1.0

[back to package description]

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>