use std::collections::LinkedList;
use prelude::*;
impl<T> IsViewBuildable for LinkedList<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 = LinkedList::new();
for (i, p) in self.iter().enumerate() {
if indices.contains(&i) {
new_data.push_back(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 LinkedList<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 LinkedList<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);
}
}
}