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
use prelude::*;
impl<T> IsRandomAccessible<T> for Vec<T> {
fn len(&self) -> usize {
self.len()
}
}
impl<T> IsRandomInsertible<T> for Vec<T> {
fn push(&mut self, x: T) {
self.push(x)
}
fn insert(&mut self, index: usize, x: T) -> Result<()> {
if index >= self.len() {
return Err(ErrorKind::IndexOutOfBounds);
}
self.insert(index, x);
Ok(())
}
}
impl<T> IsViewBuildable for Vec<T> where
T: Clone {
fn apply_view(&mut self, view: &View) -> Result<()> {
match view {
View::Full => { Ok(()) }
View::Restricted(indices) => {
let n = self.len();
if indices.iter().any(|x| x >= &n) {
return Err(ErrorKind::IndexOutOfBounds);
}
let mut new_data = Vec::new();
for (i, p) in self.iter().enumerate() {
if indices.contains(&i) {
new_data.push(p.clone());
}
}
*self = new_data;
Ok(())
}
}
}
fn from_view(&self, view: &View) -> Result<Self> {
let mut cloned = self.clone();
cloned.apply_view(view)?;
Ok(cloned)
}
}
impl<T> IsMovable2D for Vec<T> where
T: IsMovable2D {
fn move_by(&mut self, x: f64, y: f64) {
for ref mut p in self.iter_mut() {
p.move_by(x, y);
}
}
}
impl<T> IsMovable3D for Vec<T> where
T: IsMovable3D {
fn move_by(&mut self, x: f64, y: f64, z: f64) {
for ref mut p in self.iter_mut() {
p.move_by(x, y, z);
}
}
}