aegir 2.0.0

Strongly-typed, reverse-mode autodiff library 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
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
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156

use super::{Buffer, Coalesce, Hadamard, IncompatibleBuffers, Scalar, Shape};

impl<F, S> Buffer for ndarray::ArrayBase<S, Ix1>
where
    F: Scalar,
    S: ndarray::Data<Elem = F>,
{
    type Field = F;
    type Owned = ndarray::Array1<F>;
    type Shape = Shape<1>;

    fn shape(&self) -> Self::Shape { Shape([self.len()]) }

    fn map<Func: Fn(F) -> F>(self, f: Func) -> ndarray::Array1<F> { self.mapv(f) }

    fn map_ref<Func: Fn(F) -> F>(&self, f: Func) -> ndarray::Array1<F> { todo!() }

    fn fold<Func: Fn(F, &F) -> F>(&self, init: F, f: Func) -> F { self.fold(init, f) }

    fn to_owned(&self) -> ndarray::Array1<F> { self.to_owned() }

    fn into_owned(self) -> ndarray::Array1<F> { self.into_owned() }
}

impl<F, S1, S2> Coalesce<ndarray::ArrayBase<S2, Ix1>> for ndarray::ArrayBase<S1, Ix1>
where
    F: Scalar + 'static,
    S1: ndarray::Data<Elem = F>,
    S2: ndarray::Data<Elem = F>,
{
    fn coalesce(
        &self,
        rhs: &ndarray::ArrayBase<S2, Ix1>,
        mut init: F,
        f: impl Fn(F, (F, F)) -> F,
    ) -> Result<F, IncompatibleBuffers<Shape<1>>> {
        match (self.len(), rhs.len()) {
            (nx, ny) if nx == ny => {
                for i in 0..nx {
                    init = f(init, (self[i], rhs[i]));
                }

                Ok(init)
            },
            (nx, ny) => {
                let dx = Shape([nx]);
                let dy = Shape([ny]);

                Err(IncompatibleBuffers(dx, dy))
            },
        }
    }
}

impl<F, S1, S2> Hadamard<ndarray::ArrayBase<S2, Ix1>> for ndarray::ArrayBase<S1, Ix1>
where
    F: Scalar + 'static,
    S1: ndarray::Data<Elem = F>,
    S2: ndarray::Data<Elem = F>,
{
    type Output = ndarray::Array1<F>;

    fn hadamard(
        &self,
        rhs: &ndarray::ArrayBase<S2, Ix1>,
        f: impl Fn(F, F) -> F,
    ) -> Result<Self::Output, IncompatibleBuffers<Shape<1>>> {
        match (self.len(), rhs.len()) {
            (nx, ny) if nx == ny => Ok(ndarray::Array1::from_shape_fn(nx, |i| f(self[i], rhs[i]))),
            (nx, ny) => {
                let dx = Shape([nx]);
                let dy = Shape([ny]);

                Err(IncompatibleBuffers(dx, dy))
            },
        }
    }
}

impl<F, S> Buffer for &ndarray::ArrayBase<S, Ix1>
where
    F: Scalar,
    S: ndarray::Data<Elem = F>,
{
    type Field = F;
    type Owned = ndarray::Array1<F>;
    type Shape = Shape<1>;

    fn shape(&self) -> Self::Shape { Shape([self.len()]) }

    fn map<Func: Fn(F) -> F>(self, f: Func) -> ndarray::Array1<F> { self.into_owned().mapv(f) }

    fn map_ref<Func: Fn(F) -> F>(&self, f: Func) -> ndarray::Array1<F> { todo!() }

    fn fold<Func: Fn(F, &F) -> F>(&self, init: F, f: Func) -> F {
        ndarray::ArrayBase::fold(self, init, f)
    }

    fn to_owned(&self) -> ndarray::Array1<F> { (*self).to_owned() }

    fn into_owned(self) -> ndarray::Array1<F> { ndarray::ArrayBase::to_owned(self) }
}

impl<F, S> Buffer for ndarray::ArrayBase<S, ndarray::Ix2>
where
    F: Scalar,
    S: ndarray::Data<Elem = F> + ndarray::RawDataClone,
{
    type Field = F;
    type Owned = ndarray::Array2<F>;
    type Shape = Shape<2>;

    fn shape(&self) -> Self::Shape {
        let (d1, d2) = self.dim();

        Shape([d1, d2])
    }

    fn map<Func: Fn(F) -> F>(self, f: Func) -> ndarray::Array2<F> { self.into_owned().mapv(f) }

    fn map_ref<Func: Fn(F) -> F>(&self, f: Func) -> ndarray::Array2<F> { todo!() }

    fn fold<Func: Fn(F, &F) -> F>(&self, init: F, f: Func) -> F { self.fold(init, f) }

    fn to_owned(&self) -> ndarray::Array2<F> { self.to_owned() }

    fn into_owned(self) -> ndarray::Array2<F> { self.into_owned() }
}

impl<F, S> Buffer for &ndarray::ArrayBase<S, ndarray::Ix2>
where
    F: Scalar,
    S: ndarray::Data<Elem = F> + ndarray::RawDataClone,
{
    type Field = F;
    type Owned = ndarray::Array2<F>;
    type Shape = Shape<2>;

    fn shape(&self) -> Self::Shape {
        let (d1, d2) = self.dim();

        Shape([d1, d2])
    }

    fn map<Func: Fn(F) -> F>(self, f: Func) -> ndarray::Array2<F> { self.into_owned().mapv(f) }

    fn map_ref<Func: Fn(F) -> F>(&self, f: Func) -> ndarray::Array2<F> { todo!() }

    fn fold<Func: Fn(F, &F) -> F>(&self, init: F, f: Func) -> F {
        ndarray::ArrayBase::fold(self, init, f)
    }

    fn to_owned(&self) -> ndarray::Array2<F> { (*self).to_owned() }

    fn into_owned(self) -> ndarray::Array2<F> { ndarray::ArrayBase::into_owned(self.clone()) }
}