Crates.io | primes |
lib.rs | primes |
version | 0.4.0 |
source | src |
created_at | 2014-11-20 21:38:42.996951 |
updated_at | 2024-06-07 13:23:18.82309 |
description | A package for calculating primes using the Sieve of Eratosthenes, and using that to check if a number is prime and calculating factors. Includes an iterator over all primes. |
homepage | https://github.com/wackywendell/primes/tree/master |
repository | https://github.com/wackywendell/primes/tree/master |
max_upload_size | |
id | 161 |
size | 22,639 |
A prime generator for Rust.
This package is available on crates.io as primes
.
This package provides an iterator over all
primes, generating them lazily as it goes.
The simplest usage is simply to create an Iterator
:
use primes::PrimeSet;
let mut pset = PrimeSet::new();
for (ix, n) in pset.iter().enumerate().take(10) {
println!("Prime {}: {}", ix, n);
}
For more examples, see the full documentation!