#![feature(plugin)]
#![plugin(clippy)]
use std::collections::*;
struct Unrelated(Vec<u8>);
impl Unrelated {
fn next(&self) -> std::slice::Iter<u8> {
self.0.iter()
}
fn iter(&self) -> std::slice::Iter<u8> {
self.0.iter()
}
}
#[deny(needless_range_loop, explicit_iter_loop, iter_next_loop)]
#[deny(unused_collect)]
#[allow(linkedlist)]
fn main() {
let mut vec = vec![1, 2, 3, 4];
let vec2 = vec![1, 2, 3, 4];
for i in 0..vec.len() { println!("{}", vec[i]);
}
for i in 0..vec.len() { println!("{} {}", vec[i], i);
}
for i in 0..vec.len() { println!("{} {}", vec[i], vec2[i]);
}
for i in 5..vec.len() { println!("{}", vec[i]);
}
for _v in vec.iter() { } for _v in vec.iter_mut() { }
for _v in &vec { } for _v in &mut vec { }
for _v in [1, 2, 3].iter() { } for _v in (&mut [1, 2, 3]).iter() { } let ll: LinkedList<()> = LinkedList::new();
for _v in ll.iter() { } let vd: VecDeque<()> = VecDeque::new();
for _v in vd.iter() { } let bh: BinaryHeap<()> = BinaryHeap::new();
for _v in bh.iter() { } let hm: HashMap<(), ()> = HashMap::new();
for _v in hm.iter() { } let bt: BTreeMap<(), ()> = BTreeMap::new();
for _v in bt.iter() { } let hs: HashSet<()> = HashSet::new();
for _v in hs.iter() { } let bs: BTreeSet<()> = BTreeSet::new();
for _v in bs.iter() { }
for _v in vec.iter().next() { }
let u = Unrelated(vec![]);
for _v in u.next() { } for _v in u.iter() { }
let mut out = vec![];
vec.iter().map(|x| out.push(x)).collect::<Vec<_>>(); let _y = vec.iter().map(|x| out.push(x)).collect::<Vec<_>>(); }