2023-04-23 11:03:09 +00:00
|
|
|
//@run-rustfix
|
2022-10-06 07:44:38 +00:00
|
|
|
#![warn(clippy::redundant_closure, clippy::redundant_closure_for_method_calls)]
|
|
|
|
#![allow(unused)]
|
2018-12-09 22:26:16 +00:00
|
|
|
#![allow(
|
2022-10-06 07:44:38 +00:00
|
|
|
clippy::needless_borrow,
|
2018-12-09 22:26:16 +00:00
|
|
|
clippy::needless_pass_by_value,
|
2022-10-06 07:44:38 +00:00
|
|
|
clippy::no_effect,
|
2022-01-27 14:12:45 +00:00
|
|
|
clippy::option_map_unit_fn,
|
2022-10-06 07:44:38 +00:00
|
|
|
clippy::redundant_closure_call,
|
2023-07-02 12:35:19 +00:00
|
|
|
clippy::uninlined_format_args,
|
|
|
|
clippy::useless_vec
|
2019-05-16 06:25:39 +00:00
|
|
|
)]
|
2015-05-10 05:09:04 +00:00
|
|
|
|
2021-09-28 17:03:12 +00:00
|
|
|
use std::path::{Path, PathBuf};
|
2019-02-10 11:58:51 +00:00
|
|
|
|
2021-03-12 14:30:50 +00:00
|
|
|
macro_rules! mac {
|
|
|
|
() => {
|
|
|
|
foobar()
|
|
|
|
};
|
|
|
|
}
|
|
|
|
|
|
|
|
macro_rules! closure_mac {
|
|
|
|
() => {
|
|
|
|
|n| foo(n)
|
|
|
|
};
|
|
|
|
}
|
|
|
|
|
2015-05-10 05:09:04 +00:00
|
|
|
fn main() {
|
2015-08-14 12:21:05 +00:00
|
|
|
let a = Some(1u8).map(|a| foo(a));
|
|
|
|
let c = Some(1u8).map(|a| {1+2; foo}(a));
|
2021-03-12 14:30:50 +00:00
|
|
|
true.then(|| mac!()); // don't lint function in macro expansion
|
|
|
|
Some(1).map(closure_mac!()); // don't lint closure in macro expansion
|
|
|
|
let _: Option<Vec<u8>> = true.then(|| vec![]); // special case vec!
|
2015-08-14 12:21:05 +00:00
|
|
|
let d = Some(1u8).map(|a| foo((|b| foo2(b))(a))); //is adjusted?
|
|
|
|
all(&[1, 2, 3], &&2, |x, y| below(x, y)); //is adjusted
|
2015-08-26 15:09:37 +00:00
|
|
|
unsafe {
|
|
|
|
Some(1u8).map(|a| unsafe_fn(a)); // unsafe fn
|
|
|
|
}
|
2016-01-18 18:28:06 +00:00
|
|
|
|
2016-03-30 21:07:21 +00:00
|
|
|
// See #815
|
|
|
|
let e = Some(1u8).map(|a| divergent(a));
|
|
|
|
let e = Some(1u8).map(|a| generic(a));
|
|
|
|
let e = Some(1u8).map(generic);
|
2016-01-18 18:28:06 +00:00
|
|
|
// See #515
|
2019-05-30 06:23:47 +00:00
|
|
|
let a: Option<Box<dyn (::std::ops::Deref<Target = [i32]>)>> =
|
|
|
|
Some(vec![1i32, 2]).map(|v| -> Box<dyn (::std::ops::Deref<Target = [i32]>)> { Box::new(v) });
|
2021-06-03 06:41:37 +00:00
|
|
|
|
|
|
|
// issue #7224
|
|
|
|
let _: Option<Vec<u32>> = Some(0).map(|_| vec![]);
|
2023-07-02 12:35:19 +00:00
|
|
|
|
|
|
|
// issue #10684
|
|
|
|
fn test<T>(x: impl Fn(usize, usize) -> T) -> T {
|
|
|
|
x(1, 2)
|
|
|
|
}
|
|
|
|
test(|start, end| start..=end);
|
2019-02-10 11:58:51 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
trait TestTrait {
|
|
|
|
fn trait_foo(self) -> bool;
|
|
|
|
fn trait_foo_ref(&self) -> bool;
|
|
|
|
}
|
|
|
|
|
|
|
|
struct TestStruct<'a> {
|
2019-02-10 20:23:04 +00:00
|
|
|
some_ref: &'a i32,
|
2019-02-10 11:58:51 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
impl<'a> TestStruct<'a> {
|
2019-02-10 20:23:04 +00:00
|
|
|
fn foo(self) -> bool {
|
|
|
|
false
|
|
|
|
}
|
|
|
|
unsafe fn foo_unsafe(self) -> bool {
|
|
|
|
true
|
|
|
|
}
|
2019-02-10 11:58:51 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
impl<'a> TestTrait for TestStruct<'a> {
|
2019-02-10 20:23:04 +00:00
|
|
|
fn trait_foo(self) -> bool {
|
|
|
|
false
|
|
|
|
}
|
|
|
|
fn trait_foo_ref(&self) -> bool {
|
|
|
|
false
|
|
|
|
}
|
2019-02-10 11:58:51 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
impl<'a> std::ops::Deref for TestStruct<'a> {
|
|
|
|
type Target = char;
|
2019-02-10 20:23:04 +00:00
|
|
|
fn deref(&self) -> &char {
|
|
|
|
&'a'
|
|
|
|
}
|
2019-02-10 11:58:51 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
fn test_redundant_closures_containing_method_calls() {
|
|
|
|
let i = 10;
|
2019-02-10 20:23:04 +00:00
|
|
|
let e = Some(TestStruct { some_ref: &i }).map(|a| a.foo());
|
|
|
|
let e = Some(TestStruct { some_ref: &i }).map(|a| a.trait_foo());
|
|
|
|
let e = Some(TestStruct { some_ref: &i }).map(|a| a.trait_foo_ref());
|
|
|
|
let e = Some(&mut vec![1, 2, 3]).map(|v| v.clear());
|
2019-02-10 11:58:51 +00:00
|
|
|
unsafe {
|
2019-02-10 20:23:04 +00:00
|
|
|
let e = Some(TestStruct { some_ref: &i }).map(|a| a.foo_unsafe());
|
2019-02-10 11:58:51 +00:00
|
|
|
}
|
|
|
|
let e = Some("str").map(|s| s.to_string());
|
|
|
|
let e = Some('a').map(|s| s.to_uppercase());
|
2019-02-10 20:23:04 +00:00
|
|
|
let e: std::vec::Vec<usize> = vec!['a', 'b', 'c'].iter().map(|c| c.len_utf8()).collect();
|
|
|
|
let e: std::vec::Vec<char> = vec!['a', 'b', 'c'].iter().map(|c| c.to_ascii_uppercase()).collect();
|
2021-09-28 17:03:12 +00:00
|
|
|
let e = Some(PathBuf::new()).as_ref().and_then(|s| s.to_str());
|
2019-02-10 20:23:04 +00:00
|
|
|
let c = Some(TestStruct { some_ref: &i })
|
|
|
|
.as_ref()
|
|
|
|
.map(|c| c.to_ascii_uppercase());
|
2019-02-26 11:12:27 +00:00
|
|
|
|
|
|
|
fn test_different_borrow_levels<T>(t: &[&T])
|
|
|
|
where
|
|
|
|
T: TestTrait,
|
|
|
|
{
|
|
|
|
t.iter().filter(|x| x.trait_foo_ref());
|
|
|
|
t.iter().map(|x| x.trait_foo_ref());
|
|
|
|
}
|
2019-04-25 19:46:34 +00:00
|
|
|
}
|
|
|
|
|
2019-05-30 06:23:47 +00:00
|
|
|
struct Thunk<T>(Box<dyn FnMut() -> T>);
|
2019-04-25 19:46:34 +00:00
|
|
|
|
|
|
|
impl<T> Thunk<T> {
|
|
|
|
fn new<F: 'static + FnOnce() -> T>(f: F) -> Thunk<T> {
|
|
|
|
let mut option = Some(f);
|
|
|
|
// This should not trigger redundant_closure (#1439)
|
|
|
|
Thunk(Box::new(move || option.take().unwrap()()))
|
|
|
|
}
|
|
|
|
|
|
|
|
fn unwrap(self) -> T {
|
|
|
|
let Thunk(mut f) = self;
|
|
|
|
f()
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
fn foobar() {
|
|
|
|
let thunk = Thunk::new(|| println!("Hello, world!"));
|
|
|
|
thunk.unwrap()
|
2015-08-14 12:21:05 +00:00
|
|
|
}
|
|
|
|
|
2018-12-09 22:26:16 +00:00
|
|
|
fn foo(_: u8) {}
|
2015-05-10 05:09:04 +00:00
|
|
|
|
2015-08-14 12:21:05 +00:00
|
|
|
fn foo2(_: u8) -> u8 {
|
2015-05-10 05:09:04 +00:00
|
|
|
1u8
|
2015-08-12 08:46:49 +00:00
|
|
|
}
|
2015-08-14 12:21:05 +00:00
|
|
|
|
|
|
|
fn all<X, F>(x: &[X], y: &X, f: F) -> bool
|
2018-12-09 22:26:16 +00:00
|
|
|
where
|
|
|
|
F: Fn(&X, &X) -> bool,
|
|
|
|
{
|
2015-08-14 12:21:05 +00:00
|
|
|
x.iter().all(|e| f(e, y))
|
|
|
|
}
|
|
|
|
|
2018-12-09 22:26:16 +00:00
|
|
|
fn below(x: &u8, y: &u8) -> bool {
|
|
|
|
x < y
|
|
|
|
}
|
2015-08-26 15:09:37 +00:00
|
|
|
|
2018-12-09 22:26:16 +00:00
|
|
|
unsafe fn unsafe_fn(_: u8) {}
|
2016-03-30 21:07:21 +00:00
|
|
|
|
|
|
|
fn divergent(_: u8) -> ! {
|
|
|
|
unimplemented!()
|
|
|
|
}
|
|
|
|
|
|
|
|
fn generic<T>(_: T) -> u8 {
|
|
|
|
0
|
|
|
|
}
|
2019-03-31 12:10:17 +00:00
|
|
|
|
|
|
|
fn passes_fn_mut(mut x: Box<dyn FnMut()>) {
|
|
|
|
requires_fn_once(|| x());
|
|
|
|
}
|
|
|
|
fn requires_fn_once<T: FnOnce()>(_: T) {}
|
2019-04-20 20:20:14 +00:00
|
|
|
|
|
|
|
fn test_redundant_closure_with_function_pointer() {
|
|
|
|
type FnPtrType = fn(u8);
|
|
|
|
let foo_ptr: FnPtrType = foo;
|
|
|
|
let a = Some(1u8).map(|a| foo_ptr(a));
|
|
|
|
}
|
|
|
|
|
|
|
|
fn test_redundant_closure_with_another_closure() {
|
|
|
|
let closure = |a| println!("{}", a);
|
|
|
|
let a = Some(1u8).map(|a| closure(a));
|
|
|
|
}
|
2019-06-10 09:22:33 +00:00
|
|
|
|
2019-06-10 17:19:29 +00:00
|
|
|
fn make_lazy(f: impl Fn() -> fn(u8) -> u8) -> impl Fn(u8) -> u8 {
|
2019-06-10 09:22:33 +00:00
|
|
|
// Currently f is called when result of make_lazy is called.
|
|
|
|
// If the closure is removed, f will be called when make_lazy itself is
|
|
|
|
// called. This changes semantics, so the closure must stay.
|
|
|
|
Box::new(move |x| f()(x))
|
|
|
|
}
|
2019-06-09 11:24:34 +00:00
|
|
|
|
|
|
|
fn call<F: FnOnce(&mut String) -> String>(f: F) -> String {
|
|
|
|
f(&mut "Hello".to_owned())
|
|
|
|
}
|
|
|
|
fn test_difference_in_mutability() {
|
|
|
|
call(|s| s.clone());
|
|
|
|
}
|
|
|
|
|
|
|
|
struct Bar;
|
|
|
|
impl std::ops::Deref for Bar {
|
|
|
|
type Target = str;
|
|
|
|
fn deref(&self) -> &str {
|
|
|
|
"hi"
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
fn test_deref_with_trait_method() {
|
|
|
|
let _ = [Bar].iter().map(|s| s.to_string()).collect::<Vec<_>>();
|
|
|
|
}
|
2021-07-15 08:44:10 +00:00
|
|
|
|
|
|
|
fn mutable_closure_used_again(x: Vec<i32>, y: Vec<i32>, z: Vec<i32>) {
|
|
|
|
let mut res = Vec::new();
|
|
|
|
let mut add_to_res = |n| res.push(n);
|
|
|
|
x.into_iter().for_each(|x| add_to_res(x));
|
|
|
|
y.into_iter().for_each(|x| add_to_res(x));
|
|
|
|
z.into_iter().for_each(|x| add_to_res(x));
|
|
|
|
}
|
|
|
|
|
|
|
|
fn mutable_closure_in_loop() {
|
|
|
|
let mut value = 0;
|
|
|
|
let mut closure = |n| value += n;
|
|
|
|
for _ in 0..5 {
|
|
|
|
Some(1).map(|n| closure(n));
|
2022-05-05 14:12:52 +00:00
|
|
|
|
|
|
|
let mut value = 0;
|
|
|
|
let mut in_loop = |n| value += n;
|
|
|
|
Some(1).map(|n| in_loop(n));
|
2021-07-15 08:44:10 +00:00
|
|
|
}
|
|
|
|
}
|
2021-09-28 17:03:12 +00:00
|
|
|
|
|
|
|
fn late_bound_lifetimes() {
|
|
|
|
fn take_asref_path<P: AsRef<Path>>(path: P) {}
|
|
|
|
|
|
|
|
fn map_str<F>(thunk: F)
|
|
|
|
where
|
|
|
|
F: FnOnce(&str),
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
fn map_str_to_path<F>(thunk: F)
|
|
|
|
where
|
|
|
|
F: FnOnce(&str) -> &Path,
|
|
|
|
{
|
|
|
|
}
|
|
|
|
map_str(|s| take_asref_path(s));
|
|
|
|
map_str_to_path(|s| s.as_ref());
|
|
|
|
}
|
|
|
|
|
|
|
|
mod type_param_bound {
|
|
|
|
trait Trait {
|
|
|
|
fn fun();
|
|
|
|
}
|
|
|
|
|
|
|
|
fn take<T: 'static>(_: T) {}
|
|
|
|
|
|
|
|
fn test<X: Trait>() {
|
|
|
|
// don't lint, but it's questionable that rust requires a cast
|
|
|
|
take(|| X::fun());
|
|
|
|
take(X::fun as fn());
|
|
|
|
}
|
|
|
|
}
|
2022-01-13 12:18:19 +00:00
|
|
|
|
|
|
|
// #8073 Don't replace closure with `Arc<F>` or `Rc<F>`
|
|
|
|
fn arc_fp() {
|
|
|
|
let rc = std::rc::Rc::new(|| 7);
|
|
|
|
let arc = std::sync::Arc::new(|n| n + 1);
|
|
|
|
let ref_arc = &std::sync::Arc::new(|_| 5);
|
|
|
|
|
|
|
|
true.then(|| rc());
|
|
|
|
(0..5).map(|n| arc(n));
|
|
|
|
Some(4).map(|n| ref_arc(n));
|
|
|
|
}
|
2022-02-26 13:26:21 +00:00
|
|
|
|
|
|
|
// #8460 Don't replace closures with params bounded as `ref`
|
|
|
|
mod bind_by_ref {
|
|
|
|
struct A;
|
|
|
|
struct B;
|
|
|
|
|
|
|
|
impl From<&A> for B {
|
|
|
|
fn from(A: &A) -> Self {
|
|
|
|
B
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
fn test() {
|
|
|
|
// should not lint
|
|
|
|
Some(A).map(|a| B::from(&a));
|
|
|
|
// should not lint
|
|
|
|
Some(A).map(|ref a| B::from(a));
|
|
|
|
}
|
|
|
|
}
|
2022-05-05 14:12:52 +00:00
|
|
|
|
|
|
|
// #7812 False positive on coerced closure
|
|
|
|
fn coerced_closure() {
|
|
|
|
fn function_returning_unit<F: FnMut(i32)>(f: F) {}
|
|
|
|
function_returning_unit(|x| std::process::exit(x));
|
|
|
|
|
|
|
|
fn arr() -> &'static [u8; 0] {
|
|
|
|
&[]
|
|
|
|
}
|
|
|
|
fn slice_fn(_: impl FnOnce() -> &'static [u8]) {}
|
|
|
|
slice_fn(|| arr());
|
|
|
|
}
|
2022-06-16 15:39:06 +00:00
|
|
|
|
|
|
|
// https://github.com/rust-lang/rust-clippy/issues/7861
|
|
|
|
fn box_dyn() {
|
|
|
|
fn f(_: impl Fn(usize) -> Box<dyn std::any::Any>) {}
|
|
|
|
f(|x| Box::new(x));
|
|
|
|
}
|
|
|
|
|
|
|
|
// https://github.com/rust-lang/rust-clippy/issues/5939
|
|
|
|
fn not_general_enough() {
|
|
|
|
fn f(_: impl FnMut(&Path) -> std::io::Result<()>) {}
|
|
|
|
f(|path| std::fs::remove_file(path));
|
|
|
|
}
|
2022-10-06 07:44:38 +00:00
|
|
|
|
|
|
|
// https://github.com/rust-lang/rust-clippy/issues/9369
|
|
|
|
pub fn mutable_impl_fn_mut(mut f: impl FnMut(), mut f_used_once: impl FnMut()) -> impl FnMut() {
|
|
|
|
fn takes_fn_mut(_: impl FnMut()) {}
|
|
|
|
takes_fn_mut(|| f());
|
|
|
|
|
|
|
|
fn takes_fn_once(_: impl FnOnce()) {}
|
|
|
|
takes_fn_once(|| f());
|
|
|
|
|
|
|
|
f();
|
|
|
|
|
|
|
|
move || takes_fn_mut(|| f_used_once())
|
|
|
|
}
|
2022-12-01 17:29:38 +00:00
|
|
|
|
|
|
|
impl dyn TestTrait + '_ {
|
|
|
|
fn method_on_dyn(&self) -> bool {
|
|
|
|
false
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// https://github.com/rust-lang/rust-clippy/issues/7746
|
2023-07-11 21:35:29 +00:00
|
|
|
fn angle_brackets_and_args() {
|
2022-12-01 17:29:38 +00:00
|
|
|
let array_opt: Option<&[u8; 3]> = Some(&[4, 8, 7]);
|
|
|
|
array_opt.map(|a| a.as_slice());
|
|
|
|
|
|
|
|
let slice_opt: Option<&[u8]> = Some(b"slice");
|
|
|
|
slice_opt.map(|s| s.len());
|
|
|
|
|
|
|
|
let ptr_opt: Option<*const usize> = Some(&487);
|
|
|
|
ptr_opt.map(|p| p.is_null());
|
|
|
|
|
|
|
|
let test_struct = TestStruct { some_ref: &487 };
|
|
|
|
let dyn_opt: Option<&dyn TestTrait> = Some(&test_struct);
|
|
|
|
dyn_opt.map(|d| d.method_on_dyn());
|
|
|
|
}
|
2023-07-30 05:11:08 +00:00
|
|
|
|
|
|
|
fn _late_bound_to_early_bound_regions() {
|
|
|
|
struct Foo<'a>(&'a u32);
|
|
|
|
impl<'a> Foo<'a> {
|
|
|
|
fn f(x: &'a u32) -> Self {
|
|
|
|
Foo(x)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
fn f(f: impl for<'a> Fn(&'a u32) -> Foo<'a>) -> Foo<'static> {
|
|
|
|
f(&0)
|
|
|
|
}
|
|
|
|
|
|
|
|
let _ = f(|x| Foo::f(x));
|
|
|
|
|
|
|
|
struct Bar;
|
|
|
|
impl<'a> From<&'a u32> for Bar {
|
|
|
|
fn from(x: &'a u32) -> Bar {
|
|
|
|
Bar
|
|
|
|
}
|
|
|
|
}
|
|
|
|
fn f2(f: impl for<'a> Fn(&'a u32) -> Bar) -> Bar {
|
|
|
|
f(&0)
|
|
|
|
}
|
|
|
|
|
|
|
|
let _ = f2(|x| <Bar>::from(x));
|
|
|
|
|
|
|
|
struct Baz<'a>(&'a u32);
|
|
|
|
fn f3(f: impl Fn(&u32) -> Baz<'_>) -> Baz<'static> {
|
|
|
|
f(&0)
|
|
|
|
}
|
|
|
|
|
|
|
|
let _ = f3(|x| Baz(x));
|
|
|
|
}
|
|
|
|
|
|
|
|
fn _mixed_late_bound_and_early_bound_regions() {
|
|
|
|
fn f<T>(t: T, f: impl Fn(T, &u32) -> u32) -> u32 {
|
|
|
|
f(t, &0)
|
|
|
|
}
|
|
|
|
fn f2<'a, T: 'a>(_: &'a T, y: &u32) -> u32 {
|
|
|
|
*y
|
|
|
|
}
|
|
|
|
let _ = f(&0, |x, y| f2(x, y));
|
|
|
|
}
|
|
|
|
|
|
|
|
fn _closure_with_types() {
|
|
|
|
fn f<T>(x: T) -> T {
|
|
|
|
x
|
|
|
|
}
|
|
|
|
fn f2<T: Default>(f: impl Fn(T) -> T) -> T {
|
|
|
|
f(T::default())
|
|
|
|
}
|
|
|
|
|
|
|
|
let _ = f2(|x: u32| f(x));
|
|
|
|
let _ = f2(|x| -> u32 { f(x) });
|
|
|
|
}
|