(n: u32)
| 1 | fn is_prime(n: u32) -> bool { |
| 2 | if n < 2 { |
| 3 | return false; |
| 4 | } |
| 5 | if n == 2 || n == 3 { |
| 6 | return true; |
| 7 | } |
| 8 | if n % 2 == 0 { |
| 9 | return false; |
| 10 | } |
| 11 | |
| 12 | let mut i = 3; |
| 13 | while i * i <= n { |
| 14 | if n % i == 0 { |
| 15 | return false; |
| 16 | } |
| 17 | i += 2; |
| 18 | } |
| 19 | true |
| 20 | } |
| 21 | |
| 22 | fn find_primes(start: u32, count: usize, buffer: &mut [u32]) -> usize { |
| 23 | let mut found = 0; |