rust_linear_algebra/matrix/
rank.rs

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
use super::Matrix;
use crate::num::MinusOne;
use crate::num::One;
use std::fmt::Debug;
use std::ops::{Add, Div, Mul, Sub, SubAssign};

impl<K> Matrix<K>
where
    K: Debug
        + Copy
        + One
        + MinusOne
        + Default
        + PartialEq
        + Add<Output = K>
        + Sub<Output = K>
        + SubAssign<K>
        + Mul<Output = K>
        + Div<Output = K>,
{
    pub fn rank(&self) -> usize {
        let result = self.row_echelon();
        let mut rank = 0;

        for row in 0..result.rows() {
            if result.elements[row].iter().any(|&x| x != K::default()) {
                rank += 1;
            }
        }

        rank
    }
}