sequential-integration 1.0.2

Lightweight library for sequential integration
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

use fehler::throws;

use super::{simpson_range::SimpsonRangeGenerator, utils as simpson_utils};
use crate::{
    engine::{
        helper_equation_traits::EquationOfThreeVariable,
        quadrature::{
            FinalizeCalculation, GetQuadratureRange, GetStepSizeTripleIntegral,
            QuadratureTripleIntegral,
        },
        range_generator::RangeGenerator,
        Bounds, CalculationResult, CalculationStep,
    },
    errors::Error,
};

pub struct SimpsonQuadratureTripleIntegral<E: Fn(f64, f64, f64) -> f64> {
    equation: E,
    h: f64,
    k: f64,
    l: f64,
}

impl<E: Fn(f64, f64, f64) -> f64> SimpsonQuadratureTripleIntegral<E> {
    #[throws]
    pub fn new(equation: E, h: f64, k: f64, l: f64) -> Self {
        Self { equation, h, k, l }
    }

    #[throws]
    fn calculate_simpson(&self, x_values: [f64; 3], y_values: [f64; 3], z_values: [f64; 3]) -> f64 {
        let mut f = vec![];

        for x in x_values.iter() {
            let mut f_y = vec![];
            for y in y_values.iter() {
                let mut f_z = vec![];
                for z in z_values.iter() {
                    f_z.push((self.equation)(*x, *y, *z));
                }
                f_y.push(f_z);
            }
            f.push(f_y);
        }

        let result = f[0][0][0]
            + 4. * f[1][0][0]
            + f[2][0][0]
            + 4. * (f[0][1][0] + 4. * f[1][1][0] + f[2][1][0])
            + f[0][2][0]
            + 4. * f[1][2][0]
            + f[2][2][0]
            + 4. * (f[0][0][1]
                + 4. * f[1][0][1]
                + f[2][0][1]
                + 4. * (f[0][1][1] + 4. * f[1][1][1] + f[2][1][1])
                + f[0][2][1]
                + 4. * f[1][2][1]
                + f[2][2][1])
            + f[0][0][2]
            + 4. * f[1][0][2]
            + f[2][0][2]
            + 4. * (f[0][1][2] + 4. * f[1][1][2] + f[2][1][2])
            + f[0][2][2]
            + 4. * f[1][2][2]
            + f[2][2][2];
        result
    }

    fn multiple_with_simpson_constant(value: f64, h: f64, k: f64, l: f64) -> f64 {
        h * k * l * value / 27.
    }
}

impl<E: Fn(f64, f64, f64) -> f64> EquationOfThreeVariable for SimpsonQuadratureTripleIntegral<E> {
    #[throws]
    fn calculate(
        &self,
        x: CalculationStep,
        bounds_x: Bounds,
        y: CalculationStep,
        bounds_y: Bounds,
        z: CalculationStep,
        bounds_z: Bounds,
    ) -> CalculationResult {
        let mut is_last_step = false;

        let x = simpson_utils::SimpsonPoints::generate(x, bounds_x, self.h, &mut is_last_step);
        let y = simpson_utils::SimpsonPoints::generate(y, bounds_y, self.k, &mut is_last_step);
        let z = simpson_utils::SimpsonPoints::generate(z, bounds_z, self.l, &mut is_last_step);

        let x_values = [x.v0, x.v1, x.v2];
        let y_values = [y.v0, y.v1, y.v2];
        let z_values = [z.v0, z.v1, z.v2];

        let mut result = CalculationResult::new();
        if is_last_step {
            result.add_last(Self::multiple_with_simpson_constant(
                self.calculate_simpson(x_values, y_values, z_values)?,
                x.h,
                y.h,
                z.h,
            ));
        } else {
            result.add_common(self.calculate_simpson(x_values, y_values, z_values)?);
        }

        result
    }
}

impl<E: Fn(f64, f64, f64) -> f64> FinalizeCalculation for SimpsonQuadratureTripleIntegral<E> {
    #[throws]
    fn finalize(&self, result: CalculationResult) -> f64 {
        Self::multiple_with_simpson_constant(result.common, self.h, self.k, self.l) + result.last
    }
}

impl<E: Fn(f64, f64, f64) -> f64> GetStepSizeTripleIntegral for SimpsonQuadratureTripleIntegral<E> {
    fn get_step_size(&self) -> (f64, f64, f64) {
        (self.h, self.k, self.l)
    }
}

impl<E: Fn(f64, f64, f64) -> f64> GetQuadratureRange for SimpsonQuadratureTripleIntegral<E> {
    #[throws]
    fn get_range_generator(bounds: Bounds, h: f64) -> Option<Box<dyn RangeGenerator>> {
        if let Some(range_generator) = SimpsonRangeGenerator::new(bounds, h)? {
            Some(Box::new(range_generator) as Box<dyn RangeGenerator>)
        } else {
            None
        }
    }
}

impl<E: Fn(f64, f64, f64) -> f64> QuadratureTripleIntegral for SimpsonQuadratureTripleIntegral<E> {}