mathru 0.16.2

Fundamental algorithms for scientific computing in Rust
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

use crate::algebra::linear::matrix::General;
use std::ops::{Index, IndexMut};

impl<T> Index<[usize; 2]> for General<T> {
    type Output = T;

    fn index(&self, index: [usize; 2]) -> &Self::Output {
        debug_assert!(
            index[0] < self.m,
            "index out of bounds: is a {}x{} matrix but the index is {}x{}",
            self.nrows(),
            self.ncols(),
            index[0],
            index[1]
        );
        debug_assert!(
            index[1] < self.n,
            "index out of bounds: is a {}x{} matrix but the index is {}x{}",
            self.nrows(),
            self.ncols(),
            index[0],
            index[1]
        );
        unsafe { self.data.get_unchecked(index[1] * self.m + index[0]) }
    }
}

impl<T> IndexMut<[usize; 2]> for General<T> {
    fn index_mut(&mut self, index: [usize; 2]) -> &mut Self::Output {
        debug_assert!(
            index[0] < self.m,
            "index out of bounds: is a {}x{} matrix but the index is {}x{}",
            self.m,
            self.n,
            index[0],
            index[1]
        );
        debug_assert!(
            index[1] < self.n,
            "index out of bounds: is a {}x{} matrix but the index is {}x{}",
            self.m,
            self.n,
            index[0],
            index[1]
        );
        unsafe { self.data.get_unchecked_mut(index[1] * self.m + index[0]) }
    }
}