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
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
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156

use std::ops::{Add, AddAssign, Deref, DerefMut, Range, Sub, SubAssign};

use crate::{One, Padding, RectExt, Vec2, Vec2RangeIter, Vec4, Zero};

/// Rectangle.
#[derive(Debug, Copy, Clone, Default, PartialEq, Eq)]
pub struct Rect<T = usize>(pub Vec4<T>);

impl<T> Rect<T> {
    /// Create new rectangle from position and size.
    pub fn new(x: T, y: T, width: T, height: T) -> Self {
        Self(Vec4::new(x, y, width, height))
    }
}

impl<T> RectExt for Rect<T>
where
    T: Copy + Add<Output = T> + Sub<Output = T> + PartialOrd,
{
    type Val = T;

    fn from_pos_size(
        pos: impl Into<Vec2<Self::Val>>,
        size: impl Into<Vec2<Self::Val>>,
    ) -> Self {
        Self(Vec4::from_pos_size(pos, size))
    }

    fn width(&self) -> Self::Val {
        self.0.width()
    }

    fn height(&self) -> Self::Val {
        self.0.height()
    }

    fn x(&self) -> Self::Val {
        self.0.x()
    }

    fn y(&self) -> Self::Val {
        self.0.y()
    }

    fn set_width(&mut self, w: Self::Val) {
        self.0.set_width(w);
    }

    fn set_height(&mut self, h: Self::Val) {
        self.0.set_height(h);
    }

    fn set_x(&mut self, x: Self::Val) {
        self.0.set_x(x);
    }

    fn set_y(&mut self, y: Self::Val) {
        self.0.set_y(y);
    }
}

impl<T> Deref for Rect<T> {
    type Target = Vec4<T>;

    fn deref(&self) -> &Self::Target {
        &self.0
    }
}

impl<T> DerefMut for Rect<T> {
    fn deref_mut(&mut self) -> &mut Self::Target {
        &mut self.0
    }
}

impl<T> From<Range<Vec2<T>>> for Rect<T>
where
    T: Copy + Add<Output = T> + Sub<Output = T> + PartialOrd,
{
    fn from(value: Range<Vec2<T>>) -> Self {
        Self::from_points(value.start, value.end)
    }
}

impl<T, V> From<V> for Rect<T>
where
    Vec4<T>: From<V>,
{
    fn from(value: V) -> Self {
        Self(value.into())
    }
}

impl<T> From<(Range<T>, Range<T>)> for Rect<T>
where
    T: Copy + Add<Output = T> + Sub<Output = T> + PartialOrd,
{
    fn from((lr, tb): (Range<T>, Range<T>)) -> Self {
        Self::from_ranges(lr, tb)
    }
}

impl<T> IntoIterator for Rect<T>
where
    T: Copy + AddAssign + PartialOrd + One,
{
    type Item = Vec2<T>;

    type IntoIter = Vec2RangeIter<T>;

    fn into_iter(self) -> Self::IntoIter {
        let mut bl = self.xy();
        bl += self.zw();
        self.xy().to(bl)
    }
}

impl<T> Add<Padding<T>> for Rect<T>
where
    T: Add<Output = T> + PartialOrd + Zero + Sub<Output = T> + Copy,
{
    type Output = Rect<T>;

    fn add(self, rhs: Padding<T>) -> Self::Output {
        self.pad_rect(rhs)
    }
}

impl<T> AddAssign<Padding<T>> for Rect<T>
where
    T: Add<Output = T> + PartialOrd + Zero + Sub<Output = T> + Copy,
{
    fn add_assign(&mut self, rhs: Padding<T>) {
        *self = *self + rhs;
    }
}

impl<T> Sub<Padding<T>> for Rect<T>
where
    T: Add<Output = T> + PartialOrd + Sub<Output = T> + Copy,
{
    type Output = Rect<T>;

    fn sub(self, rhs: Padding<T>) -> Self::Output {
        self.extend_rect(rhs)
    }
}

impl<T> SubAssign<Padding<T>> for Rect<T>
where
    T: Add<Output = T> + PartialOrd + Sub<Output = T> + Copy,
{
    fn sub_assign(&mut self, rhs: Padding<T>) {
        *self = *self - rhs;
    }
}