simple-matrix 0.1.2

A simple generic matrix library
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
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163

use quickcheck::{quickcheck, Arbitrary, Gen};
use simple_matrix::Matrix;

const RANGE: i32 = 100000; // No over/under-flow checking for now

#[derive(Debug, Clone)]
struct AMatrix<T>(Matrix<T>);

#[derive(Debug, Clone)]
struct A2Matrix<T>(Matrix<T>, Matrix<T>);

#[derive(Debug, Clone)]
struct A3Matrix<T>(Matrix<T>, Matrix<T>, Matrix<T>);

impl Arbitrary for AMatrix<i32> {
    fn arbitrary<G: Gen>(g: &mut G) -> Self {
        let s = std::cmp::max(1, g.size()); // rows & cols != 0

        let cols = g.gen_range(1, s);
        let rows = g.gen_range(1, s);

        AMatrix(Matrix::from_iter(
            rows,
            cols,
            (0..).map(|_| g.gen_range(-RANGE, RANGE)),
        ))
    }
}

impl Arbitrary for A2Matrix<i32> {
    fn arbitrary<G: Gen>(g: &mut G) -> Self {
        let s = std::cmp::max(1, g.size()); // rows & cols != 0

        let cols = g.gen_range(1, s);
        let rows = g.gen_range(1, s);

        A2Matrix(
            Matrix::from_iter(rows, cols, (0..).map(|_| g.gen_range(-RANGE, RANGE))),
            Matrix::from_iter(rows, cols, (0..).map(|_| g.gen_range(-RANGE, RANGE))),
        )
    }
}

impl Arbitrary for A3Matrix<i32> {
    fn arbitrary<G: Gen>(g: &mut G) -> Self {
        let s = std::cmp::max(1, g.size()); // rows & cols != 0

        let cols = g.gen_range(1, s);
        let rows = g.gen_range(1, s);

        A3Matrix(
            Matrix::from_iter(rows, cols, (0..).map(|_| g.gen_range(-RANGE, RANGE))),
            Matrix::from_iter(rows, cols, (0..).map(|_| g.gen_range(-RANGE, RANGE))),
            Matrix::from_iter(rows, cols, (0..).map(|_| g.gen_range(-RANGE, RANGE))),
        )
    }
}

fn neg(m: Matrix<i32>) -> Matrix<i32> {
    let zero = Matrix::new(m.rows(), m.cols());
    zero - m
}

fn identity(length: usize) -> Matrix<i32> {
    let mut m = Matrix::new(length, length);
    for i in 0..length {
        m.set(i, i, 1);
    }
    m
}

quickcheck! {
    fn qcheck_get(t: AMatrix<i32>) -> bool {
        let a = t.0;

        // In-bounds
        for r in 0..a.rows() {
            for c in 0..a.cols() {
                if a.get(r, c).is_none() {
                    return false;
                }
            }
        }

        // Out-of-bounds (column)
        for r in 0..a.rows() {
            if a.get(r, a.cols()).is_some() {
                return false;
            }
        }

        // Out-of-bounds (row)
        for c in 0..a.cols() {
            if a.get(a.rows(), c).is_some() {
                return false;
            }
        }

        true
    }

    fn qcheck_set(t: AMatrix<i32>, v: i32) -> bool {
        let mut a = t.0;

        // In-bounds
        for r in 0..a.rows() {
            for c in 0..a.cols() {
                if !a.set(r, c, v) || a.get(r, c) != Some(&v) {
                    return false;
                }
            }
        }

        // Out-of-bounds (column)
        for r in 0..a.rows() {
            if a.set(r, a.cols(), 0) {
                return false;
            }
        }

        // Out-of-bounds (row)
        for c in 0..a.cols() {
            if a.set(a.rows(), c, 0) {
                return false;
            }
        }

        true
    }

    fn qcheck_add(t: A3Matrix<i32>) -> bool {
        let a = &t.0;
        let b = &t.1;
        let c = &t.2;
        let zero = &Matrix::new(a.rows(), a.cols());

        (a + b == b + a)
        && (a + &(b + c) == &(a + b) + c)
        && (&(a + zero) == a)
    }

    fn qcheck_sub(t: A2Matrix<i32>) -> bool {
        let a = &t.0;
        let b = &t.1;
        let zero = &Matrix::new(a.rows(), a.cols());

        (a - b == neg(b - a))
        && (&(a - a) == zero)
        && (&(a - zero) == a)
    }

    fn qcheck_mul(t: AMatrix<i32>) -> bool {
        let zero = |r,c| Matrix::new(r, c);

        let a = &t.0;
        let ident1 = &identity(a.cols());
        let ident2 = &identity(a.rows());

        (a * &zero(a.cols(), 2) == zero(a.rows(), 2))
        && (&(a * ident1) == a)
        && (&(ident2 * a) == a)
    }
}