mirror of
https://github.com/rust-lang/rust-clippy
synced 2024-12-18 00:53:31 +00:00
Fix formatting and dogfood fallout
This commit is contained in:
parent
c86f4109fd
commit
a849483294
4 changed files with 41 additions and 26 deletions
|
@ -2359,7 +2359,10 @@ impl<'a, 'tcx> Visitor<'tcx> for VarCollectorVisitor<'a, 'tcx> {
|
||||||
const NEEDLESS_COLLECT_MSG: &str = "avoid using `collect()` when not needed";
|
const NEEDLESS_COLLECT_MSG: &str = "avoid using `collect()` when not needed";
|
||||||
|
|
||||||
fn check_needless_collect<'tcx>(expr: &'tcx Expr<'_>, cx: &LateContext<'tcx>) {
|
fn check_needless_collect<'tcx>(expr: &'tcx Expr<'_>, cx: &LateContext<'tcx>) {
|
||||||
// Check for direct, immediate usage
|
check_needless_collect_direct_usage(expr, cx);
|
||||||
|
check_needless_collect_indirect_usage(expr, cx);
|
||||||
|
}
|
||||||
|
fn check_needless_collect_direct_usage<'tcx>(expr: &'tcx Expr<'_>, cx: &LateContext<'tcx>) {
|
||||||
if_chain! {
|
if_chain! {
|
||||||
if let ExprKind::MethodCall(ref method, _, ref args, _) = expr.kind;
|
if let ExprKind::MethodCall(ref method, _, ref args, _) = expr.kind;
|
||||||
if let ExprKind::MethodCall(ref chain_method, _, _, _) = args[0].kind;
|
if let ExprKind::MethodCall(ref chain_method, _, _, _) = args[0].kind;
|
||||||
|
@ -2425,7 +2428,9 @@ fn check_needless_collect<'tcx>(expr: &'tcx Expr<'_>, cx: &LateContext<'tcx>) {
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
// Check for collecting it and then turning it back into an iterator later
|
}
|
||||||
|
|
||||||
|
fn check_needless_collect_indirect_usage<'tcx>(expr: &'tcx Expr<'_>, cx: &LateContext<'tcx>) {
|
||||||
if let ExprKind::Block(ref block, _) = expr.kind {
|
if let ExprKind::Block(ref block, _) = expr.kind {
|
||||||
for ref stmt in block.stmts {
|
for ref stmt in block.stmts {
|
||||||
if_chain! {
|
if_chain! {
|
||||||
|
@ -2484,10 +2489,18 @@ impl IterFunction {
|
||||||
}
|
}
|
||||||
fn get_suggestion_text(&self) -> &'static str {
|
fn get_suggestion_text(&self) -> &'static str {
|
||||||
match &self.func {
|
match &self.func {
|
||||||
IterFunctionKind::IntoIter => "Use the original Iterator instead of collecting it and then producing a new one",
|
IterFunctionKind::IntoIter => {
|
||||||
IterFunctionKind::Len => "Take the original Iterator's count instead of collecting it and finding the length",
|
"Use the original Iterator instead of collecting it and then producing a new one"
|
||||||
IterFunctionKind::IsEmpty => "Check if the original Iterator has anything instead of collecting it and seeing if it's empty",
|
},
|
||||||
IterFunctionKind::Contains(_) => "Check if the original Iterator contains an element instead of collecting then checking",
|
IterFunctionKind::Len => {
|
||||||
|
"Take the original Iterator's count instead of collecting it and finding the length"
|
||||||
|
},
|
||||||
|
IterFunctionKind::IsEmpty => {
|
||||||
|
"Check if the original Iterator has anything instead of collecting it and seeing if it's empty"
|
||||||
|
},
|
||||||
|
IterFunctionKind::Contains(_) => {
|
||||||
|
"Check if the original Iterator contains an element instead of collecting then checking"
|
||||||
|
},
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
@ -2505,6 +2518,8 @@ struct IterFunctionVisitor {
|
||||||
}
|
}
|
||||||
impl<'tcx> Visitor<'tcx> for IterFunctionVisitor {
|
impl<'tcx> Visitor<'tcx> for IterFunctionVisitor {
|
||||||
fn visit_expr(&mut self, expr: &'tcx Expr<'tcx>) {
|
fn visit_expr(&mut self, expr: &'tcx Expr<'tcx>) {
|
||||||
|
// TODO Check if the target identifier is being used in something other
|
||||||
|
// than a function call
|
||||||
if_chain! {
|
if_chain! {
|
||||||
if let ExprKind::MethodCall(method_name, _, ref args, _) = &expr.kind;
|
if let ExprKind::MethodCall(method_name, _, ref args, _) = &expr.kind;
|
||||||
if let Some(Expr { kind: ExprKind::Path(QPath::Resolved(_, ref path)), .. }) = args.get(0);
|
if let Some(Expr { kind: ExprKind::Path(QPath::Resolved(_, ref path)), .. }) = args.get(0);
|
||||||
|
@ -2515,10 +2530,18 @@ impl<'tcx> Visitor<'tcx> for IterFunctionVisitor {
|
||||||
let is_empty = sym!(is_empty);
|
let is_empty = sym!(is_empty);
|
||||||
let contains = sym!(contains);
|
let contains = sym!(contains);
|
||||||
match method_name.ident.name {
|
match method_name.ident.name {
|
||||||
name if name == into_iter => self.uses.push(IterFunction { func: IterFunctionKind::IntoIter, span: expr.span }),
|
name if name == into_iter => self.uses.push(
|
||||||
name if name == len => self.uses.push(IterFunction { func: IterFunctionKind::Len, span: expr.span }),
|
IterFunction { func: IterFunctionKind::IntoIter, span: expr.span }
|
||||||
name if name == is_empty => self.uses.push(IterFunction { func: IterFunctionKind::IsEmpty, span: expr.span }),
|
),
|
||||||
name if name == contains => self.uses.push(IterFunction { func: IterFunctionKind::Contains(args[1].span), span: expr.span }),
|
name if name == len => self.uses.push(
|
||||||
|
IterFunction { func: IterFunctionKind::Len, span: expr.span }
|
||||||
|
),
|
||||||
|
name if name == is_empty => self.uses.push(
|
||||||
|
IterFunction { func: IterFunctionKind::IsEmpty, span: expr.span }
|
||||||
|
),
|
||||||
|
name if name == contains => self.uses.push(
|
||||||
|
IterFunction { func: IterFunctionKind::Contains(args[1].span), span: expr.span }
|
||||||
|
),
|
||||||
_ => self.seen_other = true,
|
_ => self.seen_other = true,
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
|
@ -1,16 +1,12 @@
|
||||||
// run-rustfix
|
// run-rustfix
|
||||||
|
|
||||||
#[allow(unused)]
|
#[allow(unused)]
|
||||||
|
|
||||||
use std::collections::{HashMap, VecDeque};
|
use std::collections::{HashMap, VecDeque};
|
||||||
|
|
||||||
fn main() {
|
fn main() {
|
||||||
let sample = [1; 5];
|
let sample = [1; 5];
|
||||||
let indirect_iter = sample.iter().collect::<Vec<_>>();
|
let indirect_iter = sample.iter().collect::<Vec<_>>();
|
||||||
indirect_iter
|
indirect_iter.into_iter().map(|x| (x, x + 1)).collect::<HashMap<_, _>>();
|
||||||
.into_iter()
|
|
||||||
.map(|x| (x, x + 1))
|
|
||||||
.collect::<HashMap<_, _>>();
|
|
||||||
let indirect_len = sample.iter().collect::<VecDeque<_>>();
|
let indirect_len = sample.iter().collect::<VecDeque<_>>();
|
||||||
indirect_len.len();
|
indirect_len.len();
|
||||||
let indirect_empty = sample.iter().collect::<VecDeque<_>>();
|
let indirect_empty = sample.iter().collect::<VecDeque<_>>();
|
||||||
|
|
|
@ -1,16 +1,12 @@
|
||||||
// run-rustfix
|
// run-rustfix
|
||||||
|
|
||||||
#[allow(unused)]
|
#[allow(unused)]
|
||||||
|
|
||||||
use std::collections::{HashMap, VecDeque};
|
use std::collections::{HashMap, VecDeque};
|
||||||
|
|
||||||
fn main() {
|
fn main() {
|
||||||
let sample = [1; 5];
|
let sample = [1; 5];
|
||||||
let indirect_iter = sample.iter().collect::<Vec<_>>();
|
let indirect_iter = sample.iter().collect::<Vec<_>>();
|
||||||
indirect_iter
|
indirect_iter.into_iter().map(|x| (x, x + 1)).collect::<HashMap<_, _>>();
|
||||||
.into_iter()
|
|
||||||
.map(|x| (x, x + 1))
|
|
||||||
.collect::<HashMap<_, _>>();
|
|
||||||
let indirect_len = sample.iter().collect::<VecDeque<_>>();
|
let indirect_len = sample.iter().collect::<VecDeque<_>>();
|
||||||
indirect_len.len();
|
indirect_len.len();
|
||||||
let indirect_empty = sample.iter().collect::<VecDeque<_>>();
|
let indirect_empty = sample.iter().collect::<VecDeque<_>>();
|
||||||
|
|
|
@ -1,19 +1,19 @@
|
||||||
error: avoid using `collect()` when not needed
|
error: avoid using `collect()` when not needed
|
||||||
--> $DIR/needless_collect_indirect.rs:9:5
|
--> $DIR/needless_collect_indirect.rs:8:5
|
||||||
|
|
|
|
||||||
LL | / let indirect_iter = sample.iter().collect::<Vec<_>>();
|
LL | / let indirect_iter = sample.iter().collect::<Vec<_>>();
|
||||||
LL | | indirect_iter
|
LL | | indirect_iter.into_iter().map(|x| (x, x + 1)).collect::<HashMap<_, _>>();
|
||||||
| |____^
|
| |____^
|
||||||
|
|
|
|
||||||
= note: `-D clippy::needless-collect` implied by `-D warnings`
|
= note: `-D clippy::needless-collect` implied by `-D warnings`
|
||||||
help: Use the original Iterator instead of collecting it and then producing a new one
|
help: Use the original Iterator instead of collecting it and then producing a new one
|
||||||
|
|
|
|
||||||
LL |
|
LL |
|
||||||
LL | sample.iter()
|
LL | sample.iter().map(|x| (x, x + 1)).collect::<HashMap<_, _>>();
|
||||||
|
|
|
|
||||||
|
|
||||||
error: avoid using `collect()` when not needed
|
error: avoid using `collect()` when not needed
|
||||||
--> $DIR/needless_collect_indirect.rs:14:5
|
--> $DIR/needless_collect_indirect.rs:10:5
|
||||||
|
|
|
|
||||||
LL | / let indirect_len = sample.iter().collect::<VecDeque<_>>();
|
LL | / let indirect_len = sample.iter().collect::<VecDeque<_>>();
|
||||||
LL | | indirect_len.len();
|
LL | | indirect_len.len();
|
||||||
|
@ -26,7 +26,7 @@ LL | sample.iter().count();
|
||||||
|
|
|
|
||||||
|
|
||||||
error: avoid using `collect()` when not needed
|
error: avoid using `collect()` when not needed
|
||||||
--> $DIR/needless_collect_indirect.rs:16:5
|
--> $DIR/needless_collect_indirect.rs:12:5
|
||||||
|
|
|
|
||||||
LL | / let indirect_empty = sample.iter().collect::<VecDeque<_>>();
|
LL | / let indirect_empty = sample.iter().collect::<VecDeque<_>>();
|
||||||
LL | | indirect_empty.is_empty();
|
LL | | indirect_empty.is_empty();
|
||||||
|
@ -39,7 +39,7 @@ LL | sample.iter().next().is_none();
|
||||||
|
|
|
|
||||||
|
|
||||||
error: avoid using `collect()` when not needed
|
error: avoid using `collect()` when not needed
|
||||||
--> $DIR/needless_collect_indirect.rs:18:5
|
--> $DIR/needless_collect_indirect.rs:14:5
|
||||||
|
|
|
|
||||||
LL | / let indirect_contains = sample.iter().collect::<VecDeque<_>>();
|
LL | / let indirect_contains = sample.iter().collect::<VecDeque<_>>();
|
||||||
LL | | indirect_contains.contains(&&5);
|
LL | | indirect_contains.contains(&&5);
|
||||||
|
|
Loading…
Reference in a new issue