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
use math::{ Matrix2d, Scalar };
use { DrawState, Graphics, Line };
#[derive(Copy, Clone)]
pub struct Grid {
pub cols: u32,
pub rows: u32,
pub units: Scalar,
}
#[derive(Copy, Clone)]
pub struct GridCells {
cols: u32,
rows: u32,
state: u64,
}
impl Grid {
pub fn draw<G>(
&self,
line: &Line,
draw_state: &DrawState,
transform: Matrix2d,
g: &mut G
)
where G: Graphics
{
let &Grid {
cols, rows, units
} = self;
for x in 0..cols + 1 {
let x1 = x as Scalar * units;
let y1 = 0.0;
let x2 = x1;
let y2 = rows as Scalar * units;
line.draw([x1, y1, x2, y2], draw_state, transform, g);
}
for y in 0..rows + 1 {
let x1 = 0.0;
let y1 = y as Scalar * units;
let x2 = cols as Scalar * units;
let y2 = y1;
line.draw([x1, y1, x2, y2], draw_state, transform, g);
}
}
pub fn cells(&self) -> GridCells {
GridCells {
cols: self.cols,
rows: self.rows,
state: 0,
}
}
}
impl Iterator for GridCells {
type Item = (u32, u32);
fn next(&mut self) -> Option<(u32, u32)> {
let cols = self.cols as u64;
let rows = self.rows as u64;
if self.state == cols * rows {
return None
}
let ret = (
(self.state % cols) as u32,
(self.state / rows) as u32,
);
self.state += 1;
return Some(ret);
}
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn test_grid_iterator() {
let g: Grid = Grid {cols: 2, rows: 2, units: 2.0};
let expected: Vec<(u32, u32)> = vec![(0, 0), (1, 0), (0, 1), (1, 1)];
let cells: Vec<(u32, u32)> = g.cells().collect();
assert_eq!(expected, cells);
}
}