minlin 0.4.0

Rust library with minimal linear algebra made to be as convinient as possible.
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

use std::ops::AddAssign;

use crate::{One, Vec2, Vec3};

/// Iterator over 3D volume.
pub struct Vec3RangeIter<T> {
    start: Vec3<T>,
    end: Vec3<T>,
    xy: Vec2<T>,
}

impl<T> Vec3RangeIter<T> {
    /// Create new iterator over 3D volume.
    pub fn new(start: Vec3<T>, end: Vec3<T>) -> Self
    where
        T: Copy,
    {
        Self {
            xy: start.xy(),
            start,
            end,
        }
    }

    /// Check whether the remaining volume contains the given position.
    pub fn contains(&self, other: impl Into<Vec3<T>>) -> bool
    where
        T: Ord,
    {
        let Vec3 { x, y, z } = other.into();
        x >= self.start.x
            && x < self.end.x
            && y >= self.start.y
            && y < self.end.y
            && z >= self.start.z
            && z < self.end.z
    }
}

impl<T> Iterator for Vec3RangeIter<T>
where
    T: Copy + AddAssign + PartialOrd + One,
{
    type Item = Vec3<T>;

    fn next(&mut self) -> Option<Self::Item> {
        if self.xy.x >= self.end.x {
            if self.xy.x == self.start.x {
                return None;
            }
            self.xy.x = self.start.x;
            self.xy.y += T::ONE;
        }

        if self.xy.y >= self.end.y {
            if self.xy.y == self.start.y {
                return None;
            }
            self.xy.y = self.start.y;
            self.start.z += T::ONE;
        }

        if self.start.z > self.end.z {
            return None;
        }

        let res = (self.xy, self.start.z);
        self.xy.x += T::ONE;
        Some(res.into())
    }
}