use lib_algorithms::big;
use lib_algorithms::primes::*;

#[test]
fn test_is_prime() {
    assert!(!is_prime(&big(0)));
    assert!(!is_prime(&big(1)));
    assert!(is_prime(&big(2)));
    assert!(is_prime(&big(27961)));
    assert!(!is_prime(&big(9091 * 9091)));
    assert!(!is_prime(&big(11 * 41 * 101 * 271 * 3541)));
}

#[test]
fn test_factors() {
    assert_eq!(factors(big(0)), []);
    assert_eq!(factors(big(1)), []);
    assert_eq!(factors(big(2)), [big(2)]);
    assert_eq!(factors(big(3)), [big(3)]);
    assert_eq!(factors(big(9091)), [big(9091)]);
    assert_eq!(
        factors(big(2 * 2 * 3 * 5 * 5 * 5 * 13)),
        [big(2), big(2), big(3), big(5), big(5), big(5), big(13)]
    );
    assert_eq!(
        factors(big(11 * 41 * 101 * 271 * 271)),
        [big(11), big(41), big(101), big(271), big(271)]
    );
}

#[test]
fn test_list() {
    assert_eq!(list(0), []);
    assert_eq!(list(1), []);
    assert_eq!(list(2), [2]);
    assert_eq!(list(3), [2, 3]);
    assert_eq!(list(4), [2, 3]);
    assert_eq!(
        list(100),
        [
            2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83,
            89, 97
        ]
    )
}