conspire 0.7.7

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
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

use super::Quantity;
use crate::math::{
    Jacobian, Solution, Tensor, TensorRank0, Vector, assert::FiniteDifference,
    tensor::vec::TensorVector,
};
use crate::units::{Dimensionless, UnitDiv};
use std::ops::{Div, Sub};

use super::sparse_vec_2d::QuantitySparseVec2D;

/// A vector of quantities.
pub type QuantityVector<U = Dimensionless> = TensorVector<Quantity<U>>;

impl<U> QuantityVector<U> {
    pub fn zero(len: usize) -> Self {
        (0..len).map(|_| Quantity::new(0.0)).collect()
    }
}

impl<U> From<Vector> for QuantityVector<U> {
    fn from(vector: Vector) -> Self {
        vector.iter().map(|&entry| Quantity::new(entry)).collect()
    }
}

impl<U> Jacobian for QuantityVector<U> {
    fn fill_into(&self, vector: &mut Vector) {
        self.iter()
            .zip(vector.iter_mut())
            .for_each(|(self_a, vector_a)| *vector_a = self_a.value())
    }
    fn fill_into_chained(self, other: Vector, vector: &mut Vector) {
        self.into_iter()
            .map(|entry| entry.value())
            .chain(other)
            .zip(vector.iter_mut())
            .for_each(|(self_a, vector_a)| *vector_a = self_a)
    }
    fn retain_from(self, retained: &[bool]) -> Vector {
        self.into_iter()
            .zip(retained.iter())
            .filter(|(_, retained)| **retained)
            .map(|(entry, _)| entry.value())
            .collect()
    }
    fn zero_out(&mut self, indices: &[usize]) {
        indices
            .iter()
            .for_each(|&index| self[index] = Quantity::new(0.0))
    }
}

impl<U> Solution for QuantityVector<U> {
    fn decrement_from(&mut self, other: &Vector) {
        self.iter_mut()
            .zip(other.iter())
            .for_each(|(self_a, vector_a)| *self_a -= Quantity::new(*vector_a))
    }
    fn decrement_from_chained(&mut self, other: &mut Vector, vector: &Vector) {
        self.iter_mut()
            .zip(vector.iter())
            .for_each(|(self_a, vector_a)| *self_a -= Quantity::new(*vector_a));
        other
            .iter_mut()
            .zip(vector.iter().skip(self.len()))
            .for_each(|(other_a, vector_a)| *other_a -= vector_a)
    }
    fn decrement_from_retained(&mut self, retained: &[bool], other: &Vector) {
        self.iter_mut()
            .zip(retained.iter())
            .filter(|(_, retained_a)| **retained_a)
            .zip(other.iter())
            .for_each(|((self_a, _), vector_a)| *self_a -= Quantity::new(*vector_a))
    }
}

impl<U> Sub<Vector> for QuantityVector<U> {
    type Output = Self;
    fn sub(mut self, vector: Vector) -> Self::Output {
        self.iter_mut()
            .zip(vector.iter())
            .for_each(|(self_a, vector_a)| *self_a -= Quantity::new(*vector_a));
        self
    }
}

impl<U> Sub<&Vector> for QuantityVector<U> {
    type Output = Self;
    fn sub(mut self, vector: &Vector) -> Self::Output {
        self.iter_mut()
            .zip(vector.iter())
            .for_each(|(self_a, vector_a)| *self_a -= Quantity::new(*vector_a));
        self
    }
}

impl<U, V> Div<QuantitySparseVec2D<V>> for &QuantityVector<U>
where
    U: UnitDiv<V>,
{
    type Output = QuantityVector<<U as UnitDiv<V>>::Output>;
    fn div(self, _quantity_sparse_vec_2d: QuantitySparseVec2D<V>) -> Self::Output {
        unimplemented!(
            "A mesh-scale step wants the sparse solver the caller supplies, which a division has nowhere to hold."
        )
    }
}

impl<U> FiniteDifference for QuantityVector<U> {
    fn error_fd(&self, comparator: &Self, epsilon: TensorRank0) -> Option<(bool, usize)> {
        let error_count = self
            .iter()
            .zip(comparator.iter())
            .filter(|(entry, comparator_entry)| entry.differs(**comparator_entry, epsilon))
            .count();
        if error_count > 0 {
            let auxiliary = self
                .iter()
                .zip(comparator.iter())
                .filter(|(entry, comparator_entry)| {
                    entry.differs_severely(**comparator_entry, epsilon)
                })
                .count()
                > 0;
            Some((auxiliary, error_count))
        } else {
            None
        }
    }
}