simple-vectors 0.5.0

Simple, dimension generic vector math
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

use crate::Vector;
use scalars::Zero;

use std::ops::{Add, AddAssign, Index, IndexMut, Sub, SubAssign};

/// A generic, fixed-size affine point with compile-time dimension checking.
#[derive(Copy, Clone, Debug, PartialEq, Eq, Hash)]
pub struct Point<T, const N: usize>(pub(crate) [T; N]);

impl<T, const N: usize> Point<T, N> {
    /// Creates a new point from the given array of elements.
    pub const fn new(elements: [T; N]) -> Self {
        Self(elements)
    }
}

impl<T: Zero + Copy, const N: usize> Default for Point<T, N> {
    fn default() -> Self {
        Self([T::zero(); N])
    }
}

impl<T, const N: usize> Sub<Self> for Point<T, N>
where
    T: Sub<Output = T> + Copy,
{
    type Output = Vector<T, N>;
    fn sub(self, other: Self) -> Vector<T, N> {
        let mut elements = self.0;
        for (element, &other_element) in elements.iter_mut().zip(other.0.iter()) {
            *element = *element - other_element;
        }
        Vector::new(elements)
    }
}

impl<T, const N: usize> Add<Vector<T, N>> for Point<T, N>
where
    T: Add<Output = T> + Copy,
{
    type Output = Self;
    fn add(mut self, vector: Vector<T, N>) -> Self {
        let vector_elements: [T; N] = vector.into();
        for (element, &vector_element) in self.0.iter_mut().zip(vector_elements.iter()) {
            *element = *element + vector_element;
        }
        self
    }
}

impl<T, const N: usize> Sub<Vector<T, N>> for Point<T, N>
where
    T: Sub<Output = T> + Copy,
{
    type Output = Self;
    fn sub(mut self, vector: Vector<T, N>) -> Self {
        let vector_elements: [T; N] = vector.into();
        for (element, &vector_element) in self.0.iter_mut().zip(vector_elements.iter()) {
            *element = *element - vector_element;
        }
        self
    }
}

impl<T, const N: usize> AddAssign<Vector<T, N>> for Point<T, N>
where
    T: AddAssign + Copy,
{
    fn add_assign(&mut self, vector: Vector<T, N>) {
        let vector_elements: [T; N] = vector.into();
        for (element, &vector_element) in self.0.iter_mut().zip(vector_elements.iter()) {
            *element += vector_element;
        }
    }
}

impl<T, const N: usize> SubAssign<Vector<T, N>> for Point<T, N>
where
    T: SubAssign + Copy,
{
    fn sub_assign(&mut self, vector: Vector<T, N>) {
        let vector_elements: [T; N] = vector.into();
        for (element, &vector_element) in self.0.iter_mut().zip(vector_elements.iter()) {
            *element -= vector_element;
        }
    }
}

impl<T, const N: usize> From<[T; N]> for Point<T, N> {
    fn from(elements: [T; N]) -> Self {
        Self::new(elements)
    }
}

impl<T, const N: usize> From<Point<T, N>> for [T; N] {
    fn from(point: Point<T, N>) -> Self {
        point.0
    }
}

impl<I, T, const N: usize> Index<I> for Point<T, N>
where
    [T; N]: Index<I>,
{
    type Output = <[T; N] as Index<I>>::Output;
    fn index(&self, index: I) -> &Self::Output {
        &self.0[index]
    }
}

impl<I, T, const N: usize> IndexMut<I> for Point<T, N>
where
    [T; N]: IndexMut<I>,
{
    fn index_mut(&mut self, index: I) -> &mut Self::Output {
        &mut self.0[index]
    }
}