kago 0.3.0

A crate for custom-width signed and unsigned integers.
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
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129

use crate::*;
use num_traits::*;
use pretty_assertions::assert_eq;
use rstest::*;

#[fixture]
fn u10_vec() -> Vec<u16> {
    (0..(1u16 << 10)).collect::<Vec<u16>>()
}

#[rstest]
fn test_u10_add(u10_vec: Vec<u16>) {
    for i in u10_vec.iter() {
        for j in u10_vec.iter() {
            let i = *i;
            let j = *j;
            let x = U10::new(i);
            let y = U10::new(j);
            if i + j < 1024 {
                let expected = U10::new(i + j);
                assert_eq!(x + y, expected);
                assert_eq!(x.checked_add(&y), Some(expected));
            } else {
                assert_eq!(x.checked_add(&y), None);
            }

            // wrapping版のテスト
            let expected = i.wrapping_add(j);
            let expected = if expected >= 1024 {
                // wrapping_addは1024以上の値を返す
                expected & 1023
            } else {
                expected
            };
            let expected = U10::new(expected);
            assert_eq!(x.wrapping_add(&y), expected);
        }
    }
}

#[rstest]
fn test_u10_sub(u10_vec: Vec<u16>) {
    for i in u10_vec.iter() {
        for j in u10_vec.iter() {
            let i = *i;
            let j = *j;
            let x = U10::new(i);
            let y = U10::new(j);
            if i >= j {
                let expected = U10::new(i - j);
                assert_eq!(x - y, expected);
                assert_eq!(x.checked_sub(&y), Some(expected));
            } else {
                assert_eq!(x.checked_sub(&y), None);
            }

            // wrapping版のテスト
            let expected = i.wrapping_sub(j);
            let expected = if expected >= 1024 {
                // wrapping_subは1024以上の値を返す
                expected & 1023
            } else {
                expected
            };
            let expected = U10::new(expected);
            assert_eq!(x.wrapping_sub(&y), expected);
        }
    }
}

#[rstest]
fn test_u10_mul(u10_vec: Vec<u16>) {
    for i in u10_vec.iter() {
        for j in u10_vec.iter() {
            let i = *i;
            let j = *j;
            let x = U10::new(i);
            let y = U10::new(j);
            if i == 0 || j == 0 {
                assert_eq!(x * y, U10::new(0));
                assert_eq!(x.checked_mul(&y), Some(U10::new(0)));
            } else if 1024 / i >= j && i * j < 1024 {
                let expected = U10::new(i * j);
                assert_eq!(x * y, expected);
                assert_eq!(x.checked_mul(&y), Some(expected));
            } else {
                assert_eq!(x.checked_mul(&y), None);
            }
        }
    }
}

#[rstest]
fn test_u10_div(u10_vec: Vec<u16>) {
    for i in u10_vec.iter() {
        for j in u10_vec.iter() {
            let i = *i;
            let j = *j;
            let x = U10::new(i);
            let y = U10::new(j);
            if j != 0 {
                let expected = U10::new(i / j);
                assert_eq!(x / y, expected);
                assert_eq!(x.checked_div(&y), Some(expected));
            } else {
                assert_eq!(x.checked_div(&y), None);
            }
        }
    }
}

#[rstest]
fn test_u10_rem(u10_vec: Vec<u16>) {
    for i in u10_vec.iter() {
        for j in u10_vec.iter() {
            let i = *i;
            let j = *j;
            let x = U10::new(i);
            let y = U10::new(j);
            if j != 0 {
                let expected = U10::new(i % j);
                assert_eq!(x % y, expected);
                assert_eq!(x.checked_rem(&y), Some(expected));
            } else {
                assert_eq!(x.checked_rem(&y), None);
            }
        }
    }
}