use rsperftools;

#[inline(never)]
fn is_prime_number(v: usize, prime_numbers: &[usize]) -> bool {
    if v < 10000 {
        let r = prime_numbers.binary_search(&v);
        return r.is_ok();
    }

    for n in prime_numbers {
        if v % n == 0 {
            return false;
        }
    }

    true
}

#[inline(never)]
fn prepare_prime_numbers() -> Vec<usize> {
    // bootstrap: Generate a prime table of 0..10000
    let mut prime_number_table: [bool; 10000] = [true; 10000];
    prime_number_table[0] = false;
    prime_number_table[1] = false;
    for i in 2..10000 {
        if prime_number_table[i] {
            let mut v = i * 2;
            while v < 10000 {
                prime_number_table[v] = false;
                v += i;
            }
        }
    }
    let mut prime_numbers = vec![];
    for i in 2..10000 {
        if prime_number_table[i] {
            prime_numbers.push(i);
        }
    }
    prime_numbers
}

fn main() {
    let prime_numbers = prepare_prime_numbers();

    //    println!("{}", std::mem::size_of::<Collector<UnresolvedFrames>>());
    let guard = rsperftools::ProfilerGuard::new(100).unwrap();

    loop {
        let mut v = 0;

        for i in 2..50000 {
            if is_prime_number(i, &prime_numbers) {
                v += 1;
            }
        }

        println!("Prime numbers: {}", v);

        match guard.report().build() {
            Ok(report) => {
                println!("{}", report);
            }
            Err(_) => {}
        };
    }

    //    rsperftools::PROFILER.lock().unwrap().stop();
}