| error: called `.iter().count()` on a `slice` |
| --> tests/ui/iter_count.rs:47:6 |
| | |
| LL | &vec[..].iter().count(); |
| | ^^^^^^^^^^^^^^^^^^^^^^ help: try: `vec[..].len()` |
| | |
| = note: `-D clippy::iter-count` implied by `-D warnings` |
| = help: to override `-D warnings` add `#[allow(clippy::iter_count)]` |
| |
| error: called `.iter().count()` on a `Vec` |
| --> tests/ui/iter_count.rs:49:5 |
| | |
| LL | vec.iter().count(); |
| | ^^^^^^^^^^^^^^^^^^ help: try: `vec.len()` |
| |
| error: called `.iter().count()` on a `slice` |
| --> tests/ui/iter_count.rs:51:5 |
| | |
| LL | boxed_slice.iter().count(); |
| | ^^^^^^^^^^^^^^^^^^^^^^^^^^ help: try: `boxed_slice.len()` |
| |
| error: called `.iter().count()` on a `VecDeque` |
| --> tests/ui/iter_count.rs:53:5 |
| | |
| LL | vec_deque.iter().count(); |
| | ^^^^^^^^^^^^^^^^^^^^^^^^ help: try: `vec_deque.len()` |
| |
| error: called `.iter().count()` on a `HashSet` |
| --> tests/ui/iter_count.rs:55:5 |
| | |
| LL | hash_set.iter().count(); |
| | ^^^^^^^^^^^^^^^^^^^^^^^ help: try: `hash_set.len()` |
| |
| error: called `.iter().count()` on a `HashMap` |
| --> tests/ui/iter_count.rs:57:5 |
| | |
| LL | hash_map.iter().count(); |
| | ^^^^^^^^^^^^^^^^^^^^^^^ help: try: `hash_map.len()` |
| |
| error: called `.iter().count()` on a `BTreeMap` |
| --> tests/ui/iter_count.rs:59:5 |
| | |
| LL | b_tree_map.iter().count(); |
| | ^^^^^^^^^^^^^^^^^^^^^^^^^ help: try: `b_tree_map.len()` |
| |
| error: called `.iter().count()` on a `BTreeSet` |
| --> tests/ui/iter_count.rs:61:5 |
| | |
| LL | b_tree_set.iter().count(); |
| | ^^^^^^^^^^^^^^^^^^^^^^^^^ help: try: `b_tree_set.len()` |
| |
| error: called `.iter().count()` on a `LinkedList` |
| --> tests/ui/iter_count.rs:63:5 |
| | |
| LL | linked_list.iter().count(); |
| | ^^^^^^^^^^^^^^^^^^^^^^^^^^ help: try: `linked_list.len()` |
| |
| error: called `.iter().count()` on a `BinaryHeap` |
| --> tests/ui/iter_count.rs:65:5 |
| | |
| LL | binary_heap.iter().count(); |
| | ^^^^^^^^^^^^^^^^^^^^^^^^^^ help: try: `binary_heap.len()` |
| |
| error: called `.iter_mut().count()` on a `Vec` |
| --> tests/ui/iter_count.rs:68:5 |
| | |
| LL | vec.iter_mut().count(); |
| | ^^^^^^^^^^^^^^^^^^^^^^ help: try: `vec.len()` |
| |
| error: called `.iter_mut().count()` on a `slice` |
| --> tests/ui/iter_count.rs:70:6 |
| | |
| LL | &vec[..].iter_mut().count(); |
| | ^^^^^^^^^^^^^^^^^^^^^^^^^^ help: try: `vec[..].len()` |
| |
| error: called `.iter_mut().count()` on a `VecDeque` |
| --> tests/ui/iter_count.rs:72:5 |
| | |
| LL | vec_deque.iter_mut().count(); |
| | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ help: try: `vec_deque.len()` |
| |
| error: called `.iter_mut().count()` on a `HashMap` |
| --> tests/ui/iter_count.rs:74:5 |
| | |
| LL | hash_map.iter_mut().count(); |
| | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ help: try: `hash_map.len()` |
| |
| error: called `.iter_mut().count()` on a `BTreeMap` |
| --> tests/ui/iter_count.rs:76:5 |
| | |
| LL | b_tree_map.iter_mut().count(); |
| | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ help: try: `b_tree_map.len()` |
| |
| error: called `.iter_mut().count()` on a `LinkedList` |
| --> tests/ui/iter_count.rs:78:5 |
| | |
| LL | linked_list.iter_mut().count(); |
| | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ help: try: `linked_list.len()` |
| |
| error: called `.into_iter().count()` on a `slice` |
| --> tests/ui/iter_count.rs:81:6 |
| | |
| LL | &vec[..].into_iter().count(); |
| | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ help: try: `vec[..].len()` |
| |
| error: called `.into_iter().count()` on a `Vec` |
| --> tests/ui/iter_count.rs:83:5 |
| | |
| LL | vec.into_iter().count(); |
| | ^^^^^^^^^^^^^^^^^^^^^^^ help: try: `vec.len()` |
| |
| error: called `.into_iter().count()` on a `VecDeque` |
| --> tests/ui/iter_count.rs:85:5 |
| | |
| LL | vec_deque.into_iter().count(); |
| | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ help: try: `vec_deque.len()` |
| |
| error: called `.into_iter().count()` on a `HashSet` |
| --> tests/ui/iter_count.rs:87:5 |
| | |
| LL | hash_set.into_iter().count(); |
| | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ help: try: `hash_set.len()` |
| |
| error: called `.into_iter().count()` on a `HashMap` |
| --> tests/ui/iter_count.rs:89:5 |
| | |
| LL | hash_map.into_iter().count(); |
| | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ help: try: `hash_map.len()` |
| |
| error: called `.into_iter().count()` on a `BTreeMap` |
| --> tests/ui/iter_count.rs:91:5 |
| | |
| LL | b_tree_map.into_iter().count(); |
| | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ help: try: `b_tree_map.len()` |
| |
| error: called `.into_iter().count()` on a `BTreeSet` |
| --> tests/ui/iter_count.rs:93:5 |
| | |
| LL | b_tree_set.into_iter().count(); |
| | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ help: try: `b_tree_set.len()` |
| |
| error: called `.into_iter().count()` on a `LinkedList` |
| --> tests/ui/iter_count.rs:95:5 |
| | |
| LL | linked_list.into_iter().count(); |
| | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ help: try: `linked_list.len()` |
| |
| error: called `.into_iter().count()` on a `BinaryHeap` |
| --> tests/ui/iter_count.rs:97:5 |
| | |
| LL | binary_heap.into_iter().count(); |
| | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ help: try: `binary_heap.len()` |
| |
| error: aborting due to 25 previous errors |
| |