nortega/indivisible-rs
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Parallelize prime testing.

Browse Source
This commit is contained in:
Nicolás A. Ortega Froysa 2022-03-04 15:48:00 +01:00
parent b682ad9e9b
commit 5c8c7baa75
1 changed files with 8 additions and 16 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

24
src/test.rs
View File

@ -17,6 +17,7 @@
*/ */
use std::collections::VecDeque; use std::collections::VecDeque;
use rayon::prelude::*;
pub fn is_prime_f(n:u64, b:u64) -> bool pub fn is_prime_f(n:u64, b:u64) -> bool
{ {
@ -47,14 +48,9 @@ pub fn is_prime_f(n:u64, b:u64) -> bool
} }
let limit = (n as f64).sqrt() as u64 + 1; let limit = (n as f64).sqrt() as u64 + 1;
let mut res = true; let compound = (start..limit).step_by(2).collect::<Vec<u64>>()
(start..limit).step_by(2).for_each(|x| { .par_iter().any(|x| n % x == 0);
if n % x == 0 return !compound;
{
res = false;
}
});
return res;
} }
pub fn is_prime(n:u64) -> bool pub fn is_prime(n:u64) -> bool
@ -65,12 +61,8 @@ pub fn is_prime(n:u64) -> bool
pub fn is_prime_mem(n:u64, primes:&VecDeque<u64>) -> bool pub fn is_prime_mem(n:u64, primes:&VecDeque<u64>) -> bool
{ {
let limit = (n as f64).sqrt() as u64; let limit = (n as f64).sqrt() as u64;
let mut res = true; let pp = primes.partition_point(|x| *x < limit);
primes.iter().take_while(|x| **x <= limit).for_each(|x| { //let compound = primes.par_iter().take(pp).any(|x| n % x == 0);
if n % *x == 0 let compound = primes.iter().take(pp).any(|x| n % x == 0);
{ return !compound;
res = false;
}
});
return res;
} }