rulinalg 0.4.2

A linear algebra library.
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
130
131
132
133
134
135
136
137
138
139

use matrix::BaseMatrix;

use libnum::Zero;

use std::iter::Iterator;

/// Returns true if the matrix is lower triangular, otherwise false.
/// This generalizes to rectangular matrices, in which case
/// it returns true if the matrix is lower trapezoidal.
pub fn is_lower_triangular<T, M>(m: &M) -> bool
    where T: Zero + PartialEq<T>, M: BaseMatrix<T> {

    m.row_iter()
     .enumerate()
     .all(|(i, row)| row.iter()
                        .skip(i + 1)
                        .all(|x| x == &T::zero()))
}

/// Returns true if the matrix is upper triangular, otherwise false.
/// This generalizes to rectangular matrices, in which case
/// it returns true if the matrix is upper trapezoidal.
pub fn is_upper_triangular<T, M>(m: &M) -> bool
    where T: Zero + PartialEq<T>, M: BaseMatrix<T> {

    m.row_iter()
     .enumerate()
     .all(|(i, row)| row.iter()
                        .take(i)
                        .all(|x| x == &T::zero()))
}

#[cfg(test)]
mod tests {
    use super::is_lower_triangular;
    use super::is_upper_triangular;
    use matrix::Matrix;

    #[test]
    fn is_lower_triangular_empty_matrix() {
        let x: Matrix<u32> = matrix![];
        assert!(is_lower_triangular(&x));
    }

    #[test]
    fn is_lower_triangular_1x1() {
        let x = matrix![1];
        assert!(is_lower_triangular(&x));
    }

    #[test]
    fn is_lower_triangular_square() {
        {
            let x = matrix![3, 0;
                            4, 5];
            assert!(is_lower_triangular(&x));
        }

        {
            let x = matrix![1, 0, 0;
                            3, 3, 0;
                            0, 4, 6];
            assert!(is_lower_triangular(&x));
        }

        {
            // Diagonal is an important special case
            let x = matrix![1, 0;
                            0, 2];
            assert!(is_lower_triangular(&x));
        }
    }

    #[test]
    fn is_upper_triangular_empty_matrix() {
        let x: Matrix<u32> = matrix![];
        assert!(is_upper_triangular(&x));
    }

    #[test]
    fn is_upper_triangular_1x1() {
        let x = matrix![1];
        assert!(is_upper_triangular(&x));
    }

    #[test]
    fn is_upper_triangular_square() {
        {
            let x = matrix![3, 4;
                            0, 5];
            assert!(is_upper_triangular(&x));
        }

        {
            let x = matrix![1, 3, 0;
                            0, 3, 4;
                            0, 0, 6];
            assert!(is_upper_triangular(&x));
        }

        {
            // Diagonal is an important special case
            let x = matrix![1, 0;
                            0, 2];
            assert!(is_upper_triangular(&x));
        }
    }

    #[test]
    fn is_upper_triangular_rectangular() {
        {
            let x = matrix![1, 2;
                            0, 3;
                            0, 0];
            assert!(is_upper_triangular(&x));
        }

        {
            let x = matrix![1, 2, 3;
                            0, 4, 5];
            assert!(is_upper_triangular(&x));
        }
    }

    quickcheck! {
        fn property_zero_is_lower_triangular(m: usize, n: usize) -> bool {
            let x = Matrix::<u32>::zeros(m, n);
            is_lower_triangular(&x)
        }
    }

    quickcheck! {
        fn property_zero_is_upper_triangular(m: usize, n: usize) -> bool {
            let x = Matrix::<u32>::zeros(m, n);
            is_upper_triangular(&x)
        }
    }
}