Function find_primes

tests/binary/primes/src/main.rs:22–35

(start: u32, count: usize, buffer: &mut [u32])

}

fn find_primes(start: u32, count: usize, buffer: &mut [u32]) -> usize {
    let mut found = 0;
    let mut candidate = if start % 2 == 0 { start + 1 } else { start };

    while found < count && found < buffer.len() {
        if is_prime(candidate) {
            buffer[found] = candidate;
            found += 1;
        }
        candidate += 2;
    }

    found
}

fn main() {
    let mut primes = [0u32; 10];