primal 0.3.3

`primal` puts raw power into prime numbers. This crates includes: optimised prime sieves, checking for primality, enumerating primes, factorising numbers, and state-of-the-art estimation of upper and lower bounds for π(n) (the number of primes below n) and p_k (the k-th prime).
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36

#[macro_use]
extern crate criterion;
use criterion::Criterion;

const N: usize = 1_000_000;
const STEP: usize = 101;

fn is_prime(c: &mut Criterion) {
    let mut group = c.benchmark_group("is_prime");

    group.bench_function("is_prime", |b| {
        b.iter(|| {
            (1..N)
                .step_by(STEP)
                .filter(|&n| primal::is_prime(n as u64))
                .count()
        })
    });

    group.bench_function("Sieve::is_prime", |b| {
        let sieve = primal::Sieve::new(N);
        b.iter(|| (1..N).step_by(STEP).filter(|&n| sieve.is_prime(n)).count())
    });

    group.bench_function("Sieve::is_prime with init", |b| {
        b.iter(|| {
            let sieve = primal::Sieve::new(N);
            (1..N).step_by(STEP).filter(|&n| sieve.is_prime(n)).count()
        })
    });

    group.finish();
}

criterion_group!(benches, is_prime);
criterion_main!(benches);