rinia 0.0.12

Stable numeric foundations for graphics, animation, and simulation.
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

use core::ops::{Add, Mul, Neg};

use crate::{
    algebra::{ApproxEqAbs, ApproxEqRel},
    tuple::Tuple,
};

impl<T, const N: usize> Tuple<T, N> {
    // Approx eq abs inherent
    pub(crate) fn approx_eq_abs_tol(self, rhs: Self, tolerance: T) -> bool
    where
        T: ApproxEqAbs<Tolerance = T> + Copy,
    {
        self.into_iter().zip(rhs).all(|(a, b)| a.approx_eq_abs_tol(b, tolerance))
    }

    // Approx eq rel inherent
    pub(crate) fn approx_eq_rel_tol(self, rhs: Self, tolerance: T) -> bool
    where
        T: ApproxEqRel<Tolerance = T> + Copy,
    {
        self.into_iter().zip(rhs).all(|(a, b)| a.approx_eq_rel_tol(b, tolerance))
    }

    // Length squared inherent
    pub(crate) fn length_squared(self) -> T
    where
        T: Copy + Mul<Output = T> + Add<Output = T>,
    {
        self.into_iter()
            .map(|x| x * x)
            .reduce(|a, b| a + b)
            .expect("length_squared requires non-empty tuple")
    }

    // Negate inherent
    pub(crate) fn negate(self) -> Self
    where
        T: Copy + Neg<Output = T>,
    {
        self.map(|x| -x)
    }

    // Dot inherent
    pub(crate) fn dot(self, rhs: Self) -> T
    where
        T: Copy + Mul<Output = T> + Add<Output = T>,
    {
        self.into_iter()
            .zip(rhs)
            .map(|(a, b)| a * b)
            .reduce(|a, b| a + b)
            .expect("dot product requires non-empty tuple")
    }
}