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
49
50
51
52
53
54
55
56
57
58
59
60
61

use std::ops::Mul;

use crate::algebra::{
    abstr::{Field, Scalar},
    linear::{matrix::LowerTriangular, vector::Vector},
};

impl<'a, T> Mul<&'a LowerTriangular<T>> for &LowerTriangular<T>
where
    T: Field + Scalar,
{
    type Output = LowerTriangular<T>;

    fn mul(self, rhs: &'a LowerTriangular<T>) -> Self::Output {
        // Implement optimized version
        LowerTriangular {
            matrix: (&self.matrix).mul(&rhs.matrix),
        }
    }
}

impl<'a, 'b, T> Mul<&'b LowerTriangular<T>> for &'a mut LowerTriangular<T>
where
    T: Field + Scalar,
{
    type Output = &'a mut LowerTriangular<T>;

    fn mul(self, rhs: &'b LowerTriangular<T>) -> Self::Output {
        // Implement optimized version

        let _ = (&mut self.matrix).mul(&rhs.matrix);
        self
    }
}

impl<T> Mul<LowerTriangular<T>> for LowerTriangular<T>
where
    T: Field + Scalar,
{
    type Output = LowerTriangular<T>;

    fn mul(self, rhs: LowerTriangular<T>) -> Self::Output {
        // Implement optimized version
        LowerTriangular {
            matrix: self.matrix.mul(rhs.matrix),
        }
    }
}

/// Multiplies matrix by vector.
impl<'a, T> Mul<&'a Vector<T>> for &LowerTriangular<T>
where
    T: Field + Scalar,
{
    type Output = Vector<T>;

    fn mul(self, v: &'a Vector<T>) -> Vector<T> {
        // Implement optimized version
        (&self.matrix).mul(v)
    }
}