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
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
use std::ops::{Index, IndexMut};
pub type Pos = (usize, usize);
#[derive(Debug, Clone, PartialEq, Eq, Hash)]
pub struct Vec2d<T: Clone> {
tiles: Vec<T>,
height: usize,
width: usize
}
impl<T: Clone> Index<Pos> for Vec2d<T> {
type Output = T;
fn index(&self, (x, y): Pos) -> &Self::Output {
if x >= self.width { panic!("Tried to index with x: {}, with width: {}", x, self.width) }
&self.tiles[y * self.width + x]
}
}
impl<T: Clone> IndexMut<Pos> for Vec2d<T> {
fn index_mut(&mut self, (x, y): Pos) -> &mut Self::Output {
if x >= self.width { panic!("Tried to index with x: {}, with width: {}", x, self.width) }
&mut self.tiles[y * self.width + x]
}
}
impl<T: Clone> Vec2d<T> {
pub fn new(default: &T, width: usize, height: usize) -> Vec2d<T> {
let no_tiles = width * height;
let mut tiles = Vec::with_capacity(no_tiles);
for _ in 0..no_tiles {
tiles.push(default.clone());
}
Vec2d { tiles, height, width }
}
pub fn for_each_tile<F: FnMut(&mut T)>(&mut self, fun: F) {
self.tiles.iter_mut().for_each(fun);
}
pub fn tiles(&self) -> &Vec<T> {
&self.tiles
}
pub fn height(&self) -> usize {
self.height
}
pub fn width(&self) -> usize {
self.width
}
pub fn get(&self, x: usize, y: usize) -> Option<&T> {
if x >= self.width { return None }
self.tiles.get(y * self.width + x)
}
pub fn get_mut(&mut self, x: usize, y: usize) -> Option<&mut T> {
if x >= self.width { return None }
self.tiles.get_mut(y * self.width + x)
}
pub fn iter_xy(&self) -> impl Iterator<Item = (usize, impl Iterator<Item = usize>)>{
let width = self.width;
let height = self.height;
(0..width).map(move |i|(i, 0..height))
}
pub fn iter_with_pos<'a>(&'a self) -> impl Iterator<Item = (Pos, &T)> {
let width = self.width;
self.tiles.iter().enumerate().map(move |(nr, tile)| {
let x = nr % width;
let y = nr / width;
((x, y), tile)
})
}
pub fn iter_with_pos_mut<'a>(&'a mut self) -> impl Iterator<Item = (Pos, &'a mut T)> {
let width = self.width;
self.tiles.iter_mut().enumerate().map(move |(nr, tile)| {
let x = nr % width;
let y = nr / width;
((x, y), tile)
})
}
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn test_new() {
let board = Vec2d::new(&'a', 2, 2);
assert_eq!(board,
Vec2d{
tiles: vec!['a', 'a', 'a', 'a'],
height: 2,
width: 2
}
);
let board = Vec2d::new(&'a', 0, 2);
assert_eq!(board,
Vec2d{
tiles: vec![],
height: 2,
width: 0
}
)
}
#[test]
fn test_get() {
let board = Vec2d::new(&'a', 2, 3);
assert_eq!(board.get(1, 1), Some(&'a'));
assert_eq!(board.get(0, 0), Some(&'a'));
assert_eq!(board.get(1, 2), Some(&'a'));
assert_eq!(board.get(2, 2), None);
assert_eq!(board.get(1, 3), None);
}
#[test]
fn test_get_mut() {
let mut board = Vec2d::new(&'a', 2, 3);
assert_eq!(board.get_mut(1, 1), Some(&mut 'a'));
assert_eq!(board.get_mut(0, 0), Some(&mut 'a'));
assert_eq!(board.get_mut(1, 2), Some(&mut 'a'));
assert_eq!(board.get_mut(2, 2), None);
assert_eq!(board.get_mut(1, 3), None);
}
}