computation-types 0.0.0

Types for abstract mathematical computation
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
157
158
159
160
161
162
163
164
165
166
167
168

mod into_vec;
mod matrix;
mod run_core;

use crate::{Computation, NamedArgs};

pub use self::{collect::*, into_vec::*, matrix::*, run_core::*};

/// A computation that can be run
/// without additional compilation.
///
/// This trait is automatically implemented
/// for types implementing [`RunCore`].
pub trait Run {
    type Output;

    fn run(self) -> Self::Output;
}

impl<T, Collected> Run for T
where
    T: Computation + RunCore,
    T::Output: Collect<T::Dim, Collected = Collected>,
{
    type Output = Collected;

    fn run(self) -> Self::Output {
        self.run_core().collect()
    }
}

mod function {
    use crate::{function::Function, ComputationFn};

    use super::{NamedArgs, Run, RunCore};

    impl<ArgNames, Body> Function<ArgNames, Body> {
        pub fn call<Args>(self, args: Args) -> <Body::Filled as Run>::Output
        where
            (ArgNames, Args): Into<NamedArgs>,
            Body: ComputationFn,
            Body::Filled: Run,
        {
            self.fill(args).run()
        }

        pub fn call_core<Args>(self, args: Args) -> <Body::Filled as RunCore>::Output
        where
            (ArgNames, Args): Into<NamedArgs>,
            Body: ComputationFn,
            Body::Filled: RunCore,
        {
            self.fill(args).run_core()
        }
    }
}

mod collect {
    use paste::paste;

    use crate::peano::{One, Two, Zero};

    use super::{IntoVec, Matrix};

    pub trait Collect<OutDims> {
        type Collected;

        fn collect(self) -> Self::Collected;
    }

    impl<T> Collect<Zero> for T {
        type Collected = T;

        fn collect(self) -> Self::Collected {
            self
        }
    }

    impl<T> Collect<One> for T
    where
        T: IntoVec,
    {
        type Collected = Vec<T::Item>;

        fn collect(self) -> Self::Collected {
            self.into_vec()
        }
    }

    impl<V> Collect<Two> for Matrix<V>
    where
        V: IntoVec,
    {
        type Collected = Matrix<Vec<V::Item>>;

        fn collect(self) -> Self::Collected {
            // Neither shape nor the length of `inner` will change,
            // so they should still be fine.
            unsafe { Matrix::new_unchecked(self.shape(), self.into_inner().into_vec()) }
        }
    }

    macro_rules! impl_collect_for_n_tuple {
        ( $n:expr, $( $i:expr ),* ) => {
            paste! {
                impl< $( [<T $i>] ),* , $( [<DimT $i>] ),* > Collect<( $( [<DimT $i>] ),* )> for ( $( [<T $i>] ),* )
                where
                    $( [<T $i>]: Collect< [<DimT $i>] > ),*
                {
                    type Collected = ( $( [<T $i>]::Collected ),* );

                    fn collect(self) -> Self::Collected {
                        ( $( self.$i.collect() ),* )
                    }
                }
            }
        };
    }

    impl_collect_for_n_tuple!(2, 0, 1);
    impl_collect_for_n_tuple!(3, 0, 1, 2);
    impl_collect_for_n_tuple!(4, 0, 1, 2, 3);
    impl_collect_for_n_tuple!(5, 0, 1, 2, 3, 4);
    impl_collect_for_n_tuple!(6, 0, 1, 2, 3, 4, 5);
    impl_collect_for_n_tuple!(7, 0, 1, 2, 3, 4, 5, 6);
    impl_collect_for_n_tuple!(8, 0, 1, 2, 3, 4, 5, 6, 7);
    impl_collect_for_n_tuple!(9, 0, 1, 2, 3, 4, 5, 6, 7, 8);
    impl_collect_for_n_tuple!(10, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9);
    impl_collect_for_n_tuple!(11, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10);
    impl_collect_for_n_tuple!(12, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11);
    impl_collect_for_n_tuple!(13, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12);
    impl_collect_for_n_tuple!(14, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13);
    impl_collect_for_n_tuple!(15, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14);
    impl_collect_for_n_tuple!(16, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15);
}

#[cfg(test)]
mod tests {
    use proptest::prelude::*;
    use test_strategy::proptest;

    use crate::{val, val1};

    use super::*;

    #[proptest]
    fn operations_should_combine(
        #[strategy(-1000..1000)] x: i32,
        #[strategy(-1000..1000)] y: i32,
        #[strategy(-1000..1000)] z: i32,
    ) {
        prop_assume!((y - z) != 0);
        prop_assume!(z != 0);
        prop_assert_eq!(
            (val!(x) / (val!(y) - val!(z)) + -(val!(z) * val!(y))).run(),
            x / (y - z) + -(z * y)
        );
        prop_assert_eq!(
            (-(((val!(x) + val!(y) - val!(z)) / val!(z)) * val!(y))).run(),
            -(((x + y - z) / z) * y)
        );
        prop_assert_eq!(-(-val!(x)).run(), -(-x));
        prop_assert_eq!(
            (val1!([x, y]) / (val!(y) - val!(z)) + -(val!(z) * val!(y))).run(),
            [x / (y - z) + -(z * y), y / (y - z) + -(z * y)]
        );
    }
}