numberlab 0.1.9

A collection of numerical algorithms
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66

use numberlab::algorithm::factorize::{
    factor_pairs, factors, prime_factors, prime_factors_exponent,
};
use std::collections::BTreeMap;

#[test]
fn should_generate_factor_pairs() {
    assert_eq!(factor_pairs(0), vec![]);
    assert_eq!(factor_pairs(1), vec![(1, 1)]);
    assert_eq!(factor_pairs(25), vec![(1, 25), (5, 5)]);
    assert_eq!(factor_pairs(28), vec![(1, 28), (2, 14), (4, 7)]);
    assert_eq!(
        factor_pairs(100),
        vec![(1, 100), (2, 50), (4, 25), (5, 20), (10, 10)]
    );
    assert_eq!(factor_pairs(101), vec![(1, 101)]);
    assert_eq!(factor_pairs(102), vec![(1, 102), (2, 51), (3, 34), (6, 17)]);
}

#[test]
fn should_generate_factors() {
    assert_eq!(factors(0), vec![]);
    assert_eq!(factors(1), vec![1]);
    assert_eq!(factors(25), vec![1, 5, 25]);
    assert_eq!(factors(28), vec![1, 2, 4, 7, 14, 28]);
    assert_eq!(factors(100), vec![1, 2, 4, 5, 10, 20, 25, 50, 100]);
    assert_eq!(factors(101), vec![1, 101]);
    assert_eq!(factors(102), vec![1, 2, 3, 6, 17, 34, 51, 102]);
}

#[test]
fn should_generate_prime_factors() {
    assert_eq!(prime_factors(0), vec![]);
    assert_eq!(prime_factors(1), vec![]);
    assert_eq!(prime_factors(25), vec![5, 5]);
    assert_eq!(prime_factors(28), vec![2, 2, 7]);
    assert_eq!(prime_factors(100), vec![2, 2, 5, 5]);
    assert_eq!(prime_factors(101), vec![101]);
    assert_eq!(prime_factors(102), vec![2, 3, 17]);
}

#[test]
fn should_generate_prime_factors_exponent() {
    assert_eq!(prime_factors_exponent(0), BTreeMap::new());
    assert_eq!(prime_factors_exponent(1), BTreeMap::new());
    assert_eq!(
        prime_factors_exponent(25),
        [(5, 2)].iter().cloned().collect()
    );
    assert_eq!(
        prime_factors_exponent(28),
        [(2, 2), (7, 1)].iter().cloned().collect()
    );
    assert_eq!(
        prime_factors_exponent(100),
        [(2, 2), (5, 2)].iter().cloned().collect()
    );
    assert_eq!(
        prime_factors_exponent(101),
        [(101, 1)].iter().cloned().collect()
    );
    assert_eq!(
        prime_factors_exponent(102),
        [(2, 1), (3, 1), (17, 1)].iter().cloned().collect()
    );
}