primes: Efficient, purely functional generation of prime numbers
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]
Versions [faq] | 0.1, 0.1.1, 0.1.1.1, 0.2.0.0, 0.2.1.0 |
---|---|
Dependencies | base (==4.*) [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 Fri Apr 29 09:38:55 UTC 2011 |
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 |
Downloads | 10137 total (109 in the last 30 days) |
Rating | (no votes yet) [estimated by rule of succession] |
Your Rating | |
Status | Docs uploaded by user Build status unknown [no reports yet] |
Downloads
- primes-0.2.1.0.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)