conspire 0.6.0

The Rust interface to conspire.
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

pub mod vec;

#[cfg(test)]
mod test;

use crate::math::{Tensor, TensorRank0, tensor::list::TensorList};
use std::ops::Mul;

#[cfg(test)]
use crate::math::tensor::test::ErrorTensor;

pub type TensorRank0List<const N: usize> = TensorList<TensorRank0, N>;

impl<const N: usize> Mul for TensorRank0List<N> {
    type Output = TensorRank0;
    fn mul(self, tensor_rank_0_list: Self) -> Self::Output {
        self.iter()
            .zip(tensor_rank_0_list.iter())
            .map(|(self_entry, entry)| self_entry * entry)
            .sum()
    }
}

impl<const N: usize> Mul<&Self> for TensorRank0List<N> {
    type Output = TensorRank0;
    fn mul(self, tensor_rank_0_list: &Self) -> Self::Output {
        self.iter()
            .zip(tensor_rank_0_list.iter())
            .map(|(self_entry, entry)| self_entry * entry)
            .sum()
    }
}

impl<const N: usize> Mul<TensorRank0List<N>> for &TensorRank0List<N> {
    type Output = TensorRank0;
    fn mul(self, tensor_rank_0_list: TensorRank0List<N>) -> Self::Output {
        self.iter()
            .zip(tensor_rank_0_list.iter())
            .map(|(self_entry, entry)| self_entry * entry)
            .sum()
    }
}

impl<const N: usize> Mul for &TensorRank0List<N> {
    type Output = TensorRank0;
    fn mul(self, tensor_rank_0_list: Self) -> Self::Output {
        self.iter()
            .zip(tensor_rank_0_list.iter())
            .map(|(self_entry, entry)| self_entry * entry)
            .sum()
    }
}

#[cfg(test)]
impl<const N: usize> ErrorTensor for TensorRank0List<N> {
    fn error_fd(&self, comparator: &Self, epsilon: TensorRank0) -> Option<(bool, usize)> {
        let error_count = self
            .iter()
            .zip(comparator.iter())
            .filter(|&(&self_i, &comparator_i)| {
                (self_i / comparator_i - 1.0).abs() >= epsilon
                    && (self_i.abs() >= epsilon || comparator_i.abs() >= epsilon)
            })
            .count();
        if error_count > 0 {
            Some((true, error_count))
        } else {
            None
        }
    }
}