concurrent_prime_sieve (v 0.2.3)
Tools for generating filters and collections with primes concurrently.
Rust implementation of the Sieve of Atkin.
This implementation runs in O(sqrt(max_num)) for finding fixed-sized sections of primes.
Therefore, this implementation will run faster than any implementation of the Sieve of Eratosthenes with the same number of cores as the number of cores increases, making it ideal for parallel processing or distributed computing tasks.
concurrent_prime_sieve::filter
Generates a vector of bools of size max_num, with
true
at each prime index, andfalse
otherwise.The number of threads is based on the number of virtual cores detected.
Similar to
fn prime_filter
, but allows for a custom number of threads.
Similar to
fn prime_filter
, but does not spawn any new threads. (Note: This function has not been optimized. May eventually borrow an outside resource.)
Similar to
fn prime_filter
, but just for numbers between min and max, returned in a vector of length max-min.
Similar to
fn prime_filter_section
, but allows for a custom number of threads.
Similar to
fn prime_filter_section
, but does not spawn any new threads.
concurrent_prime_sieve::collection
Generates a vector collection of primes strictly less than max_num.
The number of threads is based on the number of virtual cores detected.
Similar to
fn primes
, but allows for a custom number of threads.
Similar to
fn primes
, but does not spawn any new threads. (Note: This function has not been optimized. May eventually borrow an outside resource.)
Generates a vector collection of primes between min_num and max_num.
The number of threads is based on the number of virtual cores detected.
Similar to
fn primes_section
, but allows for a custom number of threads.
Similar to
fn primes_section
, but does not spawn any new threads.