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::{
geometry::Point,
primitives::{
common::Scanline,
rounded_rectangle::{RoundedRectangle, RoundedRectangleContains},
ContainsPoint,
},
};
#[derive(Clone, Eq, PartialEq, Hash, Debug)]
pub struct Points {
scanlines: Scanlines,
current_scanline: Scanline,
}
impl Points {
pub(in crate::primitives) fn new(rounded_rectangle: &RoundedRectangle) -> Self {
Self {
scanlines: Scanlines::new(rounded_rectangle),
current_scanline: Scanline::new_empty(0),
}
}
}
impl Iterator for Points {
type Item = Point;
fn next(&mut self) -> Option<Self::Item> {
self.current_scanline.next().or_else(|| {
self.current_scanline = self.scanlines.next()?;
self.current_scanline.next()
})
}
}
#[derive(Clone, Eq, PartialEq, Hash, Debug)]
pub struct Scanlines {
rounded_rectangle: RoundedRectangleContains,
}
impl Scanlines {
pub fn new(rounded_rectangle: &RoundedRectangle) -> Self {
Self {
rounded_rectangle: RoundedRectangleContains::new(rounded_rectangle),
}
}
}
impl Iterator for Scanlines {
type Item = Scanline;
fn next(&mut self) -> Option<Self::Item> {
let columns = self.rounded_rectangle.columns.clone();
let y = self.rounded_rectangle.rows.next()?;
let x_start = if y < self.rounded_rectangle.straight_rows_left.start {
columns
.clone()
.find(|x| self.rounded_rectangle.top_left.contains(Point::new(*x, y)))
} else if y >= self.rounded_rectangle.straight_rows_left.end {
columns.clone().find(|x| {
self.rounded_rectangle
.bottom_left
.contains(Point::new(*x, y))
})
} else {
None
}
.unwrap_or(columns.start);
let x_end = if y < self.rounded_rectangle.straight_rows_right.start {
columns
.clone()
.rfind(|x| self.rounded_rectangle.top_right.contains(Point::new(*x, y)))
} else if y >= self.rounded_rectangle.straight_rows_right.end {
columns.clone().rfind(|x| {
self.rounded_rectangle
.bottom_right
.contains(Point::new(*x, y))
})
} else {
None
}
.map(|x| x + 1)
.unwrap_or(columns.end);
Some(Scanline::new(y, x_start..x_end))
}
}
#[cfg(test)]
mod tests {
use super::*;
use crate::{
geometry::Size,
mock_display::MockDisplay,
pixelcolor::BinaryColor,
primitives::{PointsIter, Primitive, PrimitiveStyle, Rectangle},
Drawable,
};
#[test]
fn points_equals_filled() {
let rounded_rect = RoundedRectangle::with_equal_corners(
Rectangle::new(Point::zero(), Size::new(10, 20)),
Size::new(4, 8),
);
let mut expected = MockDisplay::new();
rounded_rect
.into_styled(PrimitiveStyle::with_fill(BinaryColor::On))
.draw(&mut expected)
.unwrap();
MockDisplay::from_points(rounded_rect.points(), BinaryColor::On).assert_eq(&expected);
}
}