#![deny(clippy::useless_conversion)] #![allow(clippy::needless_if, clippy::unnecessary_wraps)] fn test_generic(val: T) -> T { let _ = val; val } fn test_generic2 + Into, U: From>(val: T) { // ok let _: i32 = val.into(); let _: U = val.into(); let _ = U::from(val); } fn test_questionmark() -> Result<(), ()> { { let _: i32 = 0i32; Ok(Ok(())) }??; Ok(()) } fn test_issue_3913() -> Result<(), std::io::Error> { use std::fs; use std::path::Path; let path = Path::new("."); for _ in fs::read_dir(path)? {} Ok(()) } fn dont_lint_on_type_alias() { type A = i32; _ = A::from(0i32); } fn dont_lint_into_iter_on_immutable_local_implementing_iterator_in_expr() { let text = "foo\r\nbar\n\nbaz\n"; let lines = text.lines(); if Some("ok") == lines.into_iter().next() {} } fn lint_into_iter_on_mutable_local_implementing_iterator_in_expr() { let text = "foo\r\nbar\n\nbaz\n"; let mut lines = text.lines(); if Some("ok") == lines.next() {} } fn lint_into_iter_on_expr_implementing_iterator() { let text = "foo\r\nbar\n\nbaz\n"; let mut lines = text.lines(); if Some("ok") == lines.next() {} } fn lint_into_iter_on_expr_implementing_iterator_2() { let text = "foo\r\nbar\n\nbaz\n"; if Some("ok") == text.lines().next() {} } #[allow(const_item_mutation)] fn lint_into_iter_on_const_implementing_iterator() { const NUMBERS: std::ops::Range = 0..10; let _ = NUMBERS.next(); } fn lint_into_iter_on_const_implementing_iterator_2() { const NUMBERS: std::ops::Range = 0..10; let mut n = NUMBERS; n.next(); } #[derive(Clone, Copy)] struct CopiableCounter { counter: u32, } impl Iterator for CopiableCounter { type Item = u32; fn next(&mut self) -> Option { self.counter = self.counter.wrapping_add(1); Some(self.counter) } } fn dont_lint_into_iter_on_copy_iter() { let mut c = CopiableCounter { counter: 0 }; assert_eq!(c.into_iter().next(), Some(1)); assert_eq!(c.into_iter().next(), Some(1)); assert_eq!(c.next(), Some(1)); assert_eq!(c.next(), Some(2)); } fn dont_lint_into_iter_on_static_copy_iter() { static mut C: CopiableCounter = CopiableCounter { counter: 0 }; unsafe { assert_eq!(C.into_iter().next(), Some(1)); assert_eq!(C.into_iter().next(), Some(1)); assert_eq!(C.next(), Some(1)); assert_eq!(C.next(), Some(2)); } } fn main() { test_generic(10i32); test_generic2::(10i32); test_questionmark().unwrap(); test_issue_3913().unwrap(); dont_lint_on_type_alias(); dont_lint_into_iter_on_immutable_local_implementing_iterator_in_expr(); lint_into_iter_on_mutable_local_implementing_iterator_in_expr(); lint_into_iter_on_expr_implementing_iterator(); lint_into_iter_on_expr_implementing_iterator_2(); lint_into_iter_on_const_implementing_iterator(); lint_into_iter_on_const_implementing_iterator_2(); dont_lint_into_iter_on_copy_iter(); dont_lint_into_iter_on_static_copy_iter(); let _: String = "foo".into(); let _: String = From::from("foo"); let _ = String::from("foo"); #[allow(clippy::useless_conversion)] { let _: String = "foo".into(); let _ = String::from("foo"); let _ = "".lines().into_iter(); } let _: String = "foo".to_string(); let _: String = "foo".to_string(); let _ = "foo".to_string(); let _ = format!("A: {:04}", 123); let _ = "".lines(); let _ = vec![1, 2, 3].into_iter(); let _: String = format!("Hello {}", "world"); // keep parentheses around `a + b` for suggestion (see #4750) let a: i32 = 1; let b: i32 = 1; let _ = (a + b) * 3; // see #7205 let s: Foo<'a'> = Foo; let _: Foo<'b'> = s.into(); let s2: Foo<'a'> = Foo; let _: Foo<'a'> = s2; let s3: Foo<'a'> = Foo; let _ = s3; let s4: Foo<'a'> = Foo; let _ = vec![s4, s4, s4].into_iter(); issue11300::bar(); } #[allow(dead_code)] fn issue11065_fp() { use std::option::IntoIter; fn takes_into_iter(_: impl IntoIterator) {} macro_rules! x { ($e:expr) => { takes_into_iter($e); let _: IntoIter = $e; // removing `.into_iter()` leads to a type error here }; } x!(Some(5).into_iter()); } #[allow(dead_code)] fn explicit_into_iter_fn_arg() { fn a(_: T) {} fn b>(_: T) {} fn c(_: impl IntoIterator) {} fn d(_: T) where T: IntoIterator, { } fn f(_: std::vec::IntoIter) {} a(vec![1, 2].into_iter()); b(vec![1, 2]); c(vec![1, 2]); d(vec![1, 2]); b([&1, &2, &3].into_iter().cloned()); b(vec![1, 2]); b(vec![1, 2]); macro_rules! macro_generated { () => { vec![1, 2].into_iter() }; } b(macro_generated!()); } mod issue11300 { pub fn foo(i: I) where I: IntoIterator + ExactSizeIterator, { assert_eq!(i.len(), 3); } trait Helper {} impl Helper for [i32; 3] {} impl Helper for std::array::IntoIter {} impl Helper<()> for std::array::IntoIter {} fn foo2(_: I) where I: IntoIterator + Helper, { } trait Helper2 {} impl Helper2> for i32 {} impl Helper2<[i32; 3]> for i32 {} fn foo3(_: I) where I: IntoIterator, i32: Helper2, { } pub fn bar() { // This should not trigger the lint: // `[i32, 3]` does not satisfy the `ExactSizeIterator` bound, so the into_iter call cannot be // removed and is not useless. foo([1, 2, 3].into_iter()); // This should trigger the lint, receiver type [i32; 3] also implements `Helper` foo2::([1, 2, 3]); // This again should *not* lint, since X = () and I = std::array::IntoIter, // and `[i32; 3]: Helper<()>` is not true (only `std::array::IntoIter: Helper<()>` is). foo2::<(), _>([1, 2, 3].into_iter()); // This should lint. Removing the `.into_iter()` means that `I` gets substituted with `[i32; 3]`, // and `i32: Helper2<[i32, 3]>` is true, so this call is indeed unnecessary. foo3([1, 2, 3]); } fn ice() { struct S1; impl S1 { pub fn foo(&self, _: I) {} } S1.foo([1, 2]); // ICE that occurred in itertools trait Itertools { fn interleave_shortest(self, other: J) where J: IntoIterator, Self: Sized; } impl Itertools for I { fn interleave_shortest(self, other: J) where J: IntoIterator, Self: Sized, { } } let v0: Vec = vec![0, 2, 4]; let v1: Vec = vec![1, 3, 5, 7]; v0.into_iter().interleave_shortest(v1); trait TraitWithLifetime<'a> {} impl<'a> TraitWithLifetime<'a> for std::array::IntoIter<&'a i32, 2> {} struct Helper; impl<'a> Helper { fn with_lt(&self, _: I) where I: IntoIterator + TraitWithLifetime<'a>, { } } Helper.with_lt([&1, &2].into_iter()); } } #[derive(Copy, Clone)] struct Foo; impl From> for Foo<'b'> { fn from(_s: Foo<'a'>) -> Self { Foo } }