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
use crate::Matrix;
use crate::Scalar;
use staticvec::StaticVec;
impl<const M: usize, const N: usize> std::ops::Mul<Scalar> for &Matrix<M, N> {
type Output = Matrix<M, N>;
fn mul(self, rhs: Scalar) -> Self::Output {
let mut out = self.clone();
for m in 0..M {
for n in 0..N {
out[m][n] = self[m][n] * rhs;
}
}
out
}
}
impl<const M: usize, const N: usize> std::ops::Sub<&Matrix<M, N>> for &Matrix<M, N> {
type Output = Matrix<M, N>;
fn sub(self, rhs: &Matrix<M, N>) -> Self::Output {
let mut out = Matrix::<M, N>::default();
for (m, m_data) in out.data.iter_mut().enumerate() {
for n in 0..N {
m_data.insert(n, self[m][n] - rhs[m][n]);
}
}
out
}
}
impl<const M: usize, const N: usize> std::ops::Add<&Matrix<M, N>> for &Matrix<M, N> {
type Output = Matrix<M, N>;
fn add(self, rhs: &Matrix<M, N>) -> Self::Output {
let mut out = Matrix::<M, N>::default();
for (m, m_data) in out.data.iter_mut().enumerate() {
for n in 0..N {
m_data.insert(n, self[m][n] + rhs[m][n]);
}
}
out
}
}
impl<const M: usize, const N: usize, const P: usize> std::ops::Mul<&Matrix<N, P>>
for &Matrix<M, N>
{
type Output = Matrix<M, P>;
fn mul(self, rhs: &Matrix<N, P>) -> Self::Output {
let mut out = Matrix::<M, P>::default();
for (m, m_data) in out.data.iter_mut().enumerate() {
for p in 0..P {
let mut f = 0.0;
for k in 0..M {
f += self[m][k] * rhs[k][p];
}
m_data.insert(p, f);
}
}
out
}
}
impl<const M: usize, const N: usize> std::ops::Index<usize> for Matrix<M, N> {
type Output = StaticVec<Scalar, N>;
fn index(&self, index: usize) -> &Self::Output {
&self.data[index]
}
}
impl<const M: usize, const N: usize> std::ops::IndexMut<usize> for Matrix<M, N> {
fn index_mut(&mut self, index: usize) -> &mut Self::Output {
&mut self.data[index]
}
}