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

use crate::algebra::{
    abstr::{Field, Scalar},
    linear::{
        matrix::{
            Diagonal, LowerTriangular, UnitLowerTriangular, UnitUpperTriangular, UpperHessenberg,
            UpperTriangular,
        },
        vector::Vector,
    },
};

use super::General;

impl<T> From<Vector<T>> for General<T>
where
    T: Field + Scalar,
{
    fn from(v: Vector<T>) -> Self {
        let (v_m, v_n): (usize, usize) = v.dim();

        General::new(v_m, v_n, v.convert_to_vec())
    }
}

impl<T> From<LowerTriangular<T>> for General<T> {
    fn from(ut: LowerTriangular<T>) -> Self {
        ut.matrix
    }
}

impl<T> From<UnitLowerTriangular<T>> for General<T> {
    fn from(ut: UnitLowerTriangular<T>) -> Self {
        ut.matrix
    }
}

impl<T> From<UpperTriangular<T>> for General<T> {
    fn from(ut: UpperTriangular<T>) -> Self {
        ut.matrix
    }
}

impl<T> From<UnitUpperTriangular<T>> for General<T> {
    fn from(ut: UnitUpperTriangular<T>) -> Self {
        ut.matrix
    }
}

impl<T> From<UpperHessenberg<T>> for General<T> {
    fn from(ut: UpperHessenberg<T>) -> Self {
        ut.matrix
    }
}

impl<T> From<Diagonal<T>> for General<T> {
    fn from(ut: Diagonal<T>) -> Self {
        ut.matrix
    }
}