| //@aux-build:option_helpers.rs |
| |
| #![warn(clippy::iter_count)] |
| #![allow( |
| unused_variables, |
| array_into_iter, |
| unused_mut, |
| clippy::into_iter_on_ref, |
| clippy::unnecessary_operation, |
| clippy::useless_vec |
| )] |
| |
| extern crate option_helpers; |
| |
| use option_helpers::IteratorFalsePositives; |
| use std::collections::{BTreeMap, BTreeSet, BinaryHeap, HashMap, HashSet, LinkedList, VecDeque}; |
| |
| /// Struct to generate false positives for things with `.iter()`. |
| #[derive(Copy, Clone)] |
| struct HasIter; |
| |
| impl HasIter { |
| fn iter(self) -> IteratorFalsePositives { |
| IteratorFalsePositives { foo: 0 } |
| } |
| |
| fn iter_mut(self) -> IteratorFalsePositives { |
| IteratorFalsePositives { foo: 0 } |
| } |
| |
| fn into_iter(self) -> IteratorFalsePositives { |
| IteratorFalsePositives { foo: 0 } |
| } |
| } |
| |
| #[allow(unused_must_use)] |
| fn main() { |
| let mut vec = vec![0, 1, 2, 3]; |
| let mut boxed_slice: Box<[u8]> = Box::new([0, 1, 2, 3]); |
| let mut vec_deque: VecDeque<_> = vec.iter().cloned().collect(); |
| let mut hash_set = HashSet::new(); |
| let mut hash_map = HashMap::new(); |
| let mut b_tree_map = BTreeMap::new(); |
| let mut b_tree_set = BTreeSet::new(); |
| let mut linked_list = LinkedList::new(); |
| let mut binary_heap = BinaryHeap::new(); |
| hash_set.insert(1); |
| hash_map.insert(1, 2); |
| b_tree_map.insert(1, 2); |
| b_tree_set.insert(1); |
| linked_list.push_back(1); |
| binary_heap.push(1); |
| |
| &vec[..].len(); |
| vec.len(); |
| boxed_slice.len(); |
| vec_deque.len(); |
| hash_set.len(); |
| hash_map.len(); |
| b_tree_map.len(); |
| b_tree_set.len(); |
| linked_list.len(); |
| binary_heap.len(); |
| |
| vec.len(); |
| &vec[..].len(); |
| vec_deque.len(); |
| hash_map.len(); |
| b_tree_map.len(); |
| linked_list.len(); |
| |
| &vec[..].len(); |
| vec.len(); |
| vec_deque.len(); |
| hash_set.len(); |
| hash_map.len(); |
| b_tree_map.len(); |
| b_tree_set.len(); |
| linked_list.len(); |
| binary_heap.len(); |
| |
| // Make sure we don't lint for non-relevant types. |
| let false_positive = HasIter; |
| false_positive.iter().count(); |
| false_positive.iter_mut().count(); |
| false_positive.into_iter().count(); |
| } |