peroxide 0.33.3

Rust comprehensive scientific computation library contains linear algebra, numerical analysis, statistics and machine learning tools with farmiliar syntax
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
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132

use num_complex::Complex;
use crate::traits::fp::FPVector;
use crate::traits::math::{Vector, Normed, Norm, InnerProduct};
use crate::traits::sugar::VecOps;

pub type C64 = Complex<f64>;

impl Vector for Complex<f64> {
    type Scalar = Self;

    fn add_vec<'a, 'b>(&'a self, rhs: &'b Self) -> Self {
        self + rhs
    }

    fn sub_vec<'a, 'b>(&'a self, rhs: &'b Self) -> Self {
        self - rhs
    }

    fn mul_scalar(&self, rhs: Self::Scalar) -> Self {
        self * rhs
    }
}

impl Normed for Complex<f64> {
    type UnsignedScalar = f64;
    fn norm(&self, kind: Norm) -> Self::UnsignedScalar {
        match kind {
            Norm::L1 => self.l1_norm(),
            Norm::L2 => Complex::<f64>::norm(*self),
            _ => unimplemented!(),
        }
    }

    fn normalize(&self, kind: Norm) -> Self
    where
            Self: Sized {
        let n = self.norm(kind);
        self / n
    }
}

impl InnerProduct for Complex<f64> {
    fn dot(&self, rhs: &Self) -> Self::Scalar {
        self.conj() * rhs
    }
}

impl FPVector for Vec<Complex<f64>> {
    type Scalar = Complex<f64>;

    fn fmap<F>(&self, f: F) -> Self
    where
            F: Fn(Self::Scalar) -> Self::Scalar {
        self.iter().map(|&x| f(x)).collect()
    }

    fn zip_with<F>(&self, f: F, other: &Self) -> Self
    where
            F: Fn(Self::Scalar, Self::Scalar) -> Self::Scalar {
        self.iter().zip(other.iter()).map(|(&x, &y)| f(x,y)).collect()
    }

    fn reduce<F, T>(&self, init: T, f: F) -> Self::Scalar
    where
            F: Fn(Self::Scalar, Self::Scalar) -> Self::Scalar,
            T: Into<Self::Scalar> {
        self.iter().fold(init.into(), |x, &y| f(x,y))
    }

    fn filter<F>(&self, f: F) -> Self
    where
            F: Fn(Self::Scalar) -> bool {
        self.into_iter().filter(|&x| f(*x)).map(|&t| t).collect()
    }

    fn take(&self, n: usize) -> Self {
        self.iter().take(n).map(|&x| x).collect()
    }

    fn skip(&self, n: usize) -> Self {
        self.iter().skip(n).map(|&x| x).collect()
    }

    fn sum(&self) -> Self::Scalar {
        self.iter().sum()
    }

    fn prod(&self) -> Self::Scalar {
        self.iter().product()
    }
}

impl Vector for Vec<Complex<f64>> {
    type Scalar = Complex<f64>;

    fn add_vec<'a, 'b>(&'a self, rhs: &'b Self) -> Self {
        self.zip_with(|x, y| x + y, rhs)
    }

    fn sub_vec<'a, 'b>(&'a self, rhs: &'b Self) -> Self {
        self.zip_with(|x, y| x - y, rhs)
    }

    fn mul_scalar(&self, rhs: Self::Scalar) -> Self {
        self.fmap(|x| x * rhs)
    }
}

impl Normed for Vec<Complex<f64>> {
    type UnsignedScalar = f64;

    fn norm(&self, kind: Norm) -> Self::UnsignedScalar {
        match kind {
            Norm::L1 => self.iter().map(|x| Complex::<f64>::norm(*x).abs()).sum(),
            _ => unimplemented!()
        }
    }

    fn normalize(&self, kind: Norm) -> Self
    where
            Self: Sized {
        unimplemented!()
    }
}

impl InnerProduct for Vec<Complex<f64>> {
    fn dot(&self, rhs: &Self) -> Self::Scalar {
        self.zip_with(|x, y| x.conj() * y, rhs).sum()
    }
}

impl VecOps for Vec<Complex<f64>> {}