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
37
38

[[bench]]
harness = false
name = "bench"
[dependencies.primal-check]
version = "0.3"

[dependencies.primal-estimate]
version = "0.3"

[dependencies.primal-sieve]
version = "0.3"
[dev-dependencies.criterion]
features = ["html_reports"]
version = "0.3.4"

[dev-dependencies.primal-slowsieve]
version = "0.3"

[features]
unstable = ["primal-sieve/unstable"]

[package]
authors = ["Huon Wilson <dbau.pp@gmail.com>"]
description = "`primal` puts raw power into prime numbers. This crates includes:\noptimised prime sieves, checking for primality, enumerating primes,\nfactorising numbers, and state-of-the-art estimation of upper and\nlower bounds for π(n) (the number of primes below n) and p_k (the k-th\nprime).\n"
documentation = "https://docs.rs/primal/"
edition = "2018"
homepage = "https://github.com/huonw/primal"
keywords = ["math", "mathematics", "primes", "number-theory"]
license = "MIT OR Apache-2.0"
name = "primal"
readme = "README.md"
repository = "https://github.com/huonw/primal"
version = "0.3.3"
[package.metadata.release]
sign-tag = true
tag-name = "{{crate_name}}-{{version}}"
[profile.release]
overflow-checks = true