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

Use functional programming.

Browse Source
This commit is contained in:
Nicolás A. Ortega Froysa 2022-03-03 16:30:40 +01:00
parent c9db711008
commit d2f59a6b21
1 changed files with 17 additions and 12 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

29
src/test.rs
View File

@ -23,6 +23,11 @@ pub fn is_prime_f(n:u64, b:u64) -> bool
assert_ne!(b, 0); assert_ne!(b, 0);
assert_ne!(b, 1); assert_ne!(b, 1);
if n == 1
{
return false;
}
let mut start = b; let mut start = b;
if start == 2 if start == 2
{ {
@ -42,14 +47,14 @@ 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;
for i in (start..limit).step_by(2) let mut res = true;
(start..limit).step_by(2).for_each(|x| {
if n % x == 0
{ {
if n % i == 0 res = false;
{
return false;
} }
} });
return true; return res;
} }
pub fn is_prime(n:u64) -> bool pub fn is_prime(n:u64) -> bool
@ -60,12 +65,12 @@ 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;
for i in primes.iter().take_while(|x| **x <= limit) let mut res = true;
primes.iter().take_while(|x| **x <= limit).for_each(|x| {
if n % *x == 0
{ {
if n % *i == 0 res = false;
{
return false;
} }
} });
return true; return res;
} }