1 mod bind_instead_of_map
;
4 mod chars_cmp_with_unwrap
;
6 mod chars_last_cmp_with_unwrap
;
8 mod chars_next_cmp_with_unwrap
;
11 mod cloned_instead_of_copied
;
14 mod extend_with_drain
;
17 mod filter_map_identity
;
20 mod flat_map_identity
;
22 mod from_iter_instead_of_collect
;
25 mod inefficient_to_string
;
28 mod iter_cloned_collect
;
34 mod iterator_step_by_zero
;
35 mod manual_saturating_arithmetic
;
36 mod manual_str_repeat
;
37 mod map_collect_result_unit
;
42 mod option_as_ref_deref
;
43 mod option_map_or_none
;
44 mod option_map_unwrap_or
;
47 mod single_char_add_str
;
48 mod single_char_insert_string
;
49 mod single_char_pattern
;
50 mod single_char_push_string
;
52 mod string_extend_chars
;
54 mod suspicious_splitn
;
55 mod uninit_assumed_init
;
56 mod unnecessary_filter_map
;
58 mod unnecessary_lazy_eval
;
62 mod wrong_self_convention
;
65 use bind_instead_of_map
::BindInsteadOfMap
;
66 use clippy_utils
::diagnostics
::{span_lint, span_lint_and_help}
;
67 use clippy_utils
::ty
::{contains_adt_constructor, contains_ty, implements_trait, is_copy, is_type_diagnostic_item}
;
68 use clippy_utils
::{contains_return, get_trait_def_id, in_macro, iter_input_pats, meets_msrv, msrvs, paths, return_ty}
;
69 use if_chain
::if_chain
;
71 use rustc_hir
::def
::Res
;
72 use rustc_hir
::{Expr, ExprKind, PrimTy, QPath, TraitItem, TraitItemKind}
;
73 use rustc_lint
::{LateContext, LateLintPass, LintContext}
;
74 use rustc_middle
::lint
::in_external_macro
;
75 use rustc_middle
::ty
::{self, TraitRef, Ty, TyS}
;
76 use rustc_semver
::RustcVersion
;
77 use rustc_session
::{declare_tool_lint, impl_lint_pass}
;
78 use rustc_span
::symbol
::SymbolStr
;
79 use rustc_span
::{sym, Span}
;
80 use rustc_typeck
::hir_ty_to_ty
;
82 declare_clippy_lint
! {
83 /// **What it does:** Checks for usages of `cloned()` on an `Iterator` or `Option` where
84 /// `copied()` could be used instead.
86 /// **Why is this bad?** `copied()` is better because it guarantees that the type being cloned
87 /// implements `Copy`.
89 /// **Known problems:** None.
94 /// [1, 2, 3].iter().cloned();
98 /// [1, 2, 3].iter().copied();
100 pub CLONED_INSTEAD_OF_COPIED
,
102 "used `cloned` where `copied` could be used instead"
105 declare_clippy_lint
! {
106 /// **What it does:** Checks for usages of `Iterator::flat_map()` where `filter_map()` could be
109 /// **Why is this bad?** When applicable, `filter_map()` is more clear since it shows that
110 /// `Option` is used to produce 0 or 1 items.
112 /// **Known problems:** None.
117 /// let nums: Vec<i32> = ["1", "2", "whee!"].iter().flat_map(|x| x.parse().ok()).collect();
121 /// let nums: Vec<i32> = ["1", "2", "whee!"].iter().filter_map(|x| x.parse().ok()).collect();
125 "used `flat_map` where `filter_map` could be used instead"
128 declare_clippy_lint
! {
129 /// **What it does:** Checks for `.unwrap()` calls on `Option`s and on `Result`s.
131 /// **Why is this bad?** It is better to handle the `None` or `Err` case,
132 /// or at least call `.expect(_)` with a more helpful message. Still, for a lot of
133 /// quick-and-dirty code, `unwrap` is a good choice, which is why this lint is
134 /// `Allow` by default.
136 /// `result.unwrap()` will let the thread panic on `Err` values.
137 /// Normally, you want to implement more sophisticated error handling,
138 /// and propagate errors upwards with `?` operator.
140 /// Even if you want to panic on errors, not all `Error`s implement good
141 /// messages on display. Therefore, it may be beneficial to look at the places
142 /// where they may get displayed. Activate this lint to do just that.
144 /// **Known problems:** None.
148 /// # let opt = Some(1);
154 /// opt.expect("more helpful message");
160 /// # let res: Result<usize, ()> = Ok(1);
166 /// res.expect("more helpful message");
170 "using `.unwrap()` on `Result` or `Option`, which should at least get a better message using `expect()`"
173 declare_clippy_lint
! {
174 /// **What it does:** Checks for `.expect()` calls on `Option`s and `Result`s.
176 /// **Why is this bad?** Usually it is better to handle the `None` or `Err` case.
177 /// Still, for a lot of quick-and-dirty code, `expect` is a good choice, which is why
178 /// this lint is `Allow` by default.
180 /// `result.expect()` will let the thread panic on `Err`
181 /// values. Normally, you want to implement more sophisticated error handling,
182 /// and propagate errors upwards with `?` operator.
184 /// **Known problems:** None.
188 /// # let opt = Some(1);
191 /// opt.expect("one");
194 /// let opt = Some(1);
201 /// # let res: Result<usize, ()> = Ok(1);
204 /// res.expect("one");
208 /// # Ok::<(), ()>(())
212 "using `.expect()` on `Result` or `Option`, which might be better handled"
215 declare_clippy_lint
! {
216 /// **What it does:** Checks for methods that should live in a trait
217 /// implementation of a `std` trait (see [llogiq's blog
218 /// post](http://llogiq.github.io/2015/07/30/traits.html) for further
219 /// information) instead of an inherent implementation.
221 /// **Why is this bad?** Implementing the traits improve ergonomics for users of
222 /// the code, often with very little cost. Also people seeing a `mul(...)`
224 /// may expect `*` to work equally, so you should have good reason to disappoint
227 /// **Known problems:** None.
233 /// fn add(&self, other: &X) -> X {
239 pub SHOULD_IMPLEMENT_TRAIT
,
241 "defining a method that should be implementing a std trait"
244 declare_clippy_lint
! {
245 /// **What it does:** Checks for methods with certain name prefixes and which
246 /// doesn't match how self is taken. The actual rules are:
248 /// |Prefix |Postfix |`self` taken | `self` type |
249 /// |-------|------------|-----------------------|--------------|
250 /// |`as_` | none |`&self` or `&mut self` | any |
251 /// |`from_`| none | none | any |
252 /// |`into_`| none |`self` | any |
253 /// |`is_` | none |`&self` or none | any |
254 /// |`to_` | `_mut` |`&mut self` | any |
255 /// |`to_` | not `_mut` |`self` | `Copy` |
256 /// |`to_` | not `_mut` |`&self` | not `Copy` |
258 /// Note: Clippy doesn't trigger methods with `to_` prefix in:
259 /// - Traits definition.
260 /// Clippy can not tell if a type that implements a trait is `Copy` or not.
261 /// - Traits implementation, when `&self` is taken.
262 /// The method signature is controlled by the trait and often `&self` is required for all types that implement the trait
263 /// (see e.g. the `std::string::ToString` trait).
265 /// Please find more info here:
266 /// https://rust-lang.github.io/api-guidelines/naming.html#ad-hoc-conversions-follow-as_-to_-into_-conventions-c-conv
268 /// **Why is this bad?** Consistency breeds readability. If you follow the
269 /// conventions, your users won't be surprised that they, e.g., need to supply a
270 /// mutable reference to a `as_..` function.
272 /// **Known problems:** None.
278 /// fn as_str(self) -> &'static str {
284 pub WRONG_SELF_CONVENTION
,
286 "defining a method named with an established prefix (like \"into_\") that takes `self` with the wrong convention"
289 declare_clippy_lint
! {
290 /// **What it does:** Checks for usage of `ok().expect(..)`.
292 /// **Why is this bad?** Because you usually call `expect()` on the `Result`
293 /// directly to get a better error message.
295 /// **Known problems:** The error type needs to implement `Debug`
299 /// # let x = Ok::<_, ()>(());
302 /// x.ok().expect("why did I do this again?");
305 /// x.expect("why did I do this again?");
309 "using `ok().expect()`, which gives worse error messages than calling `expect` directly on the Result"
312 declare_clippy_lint
! {
313 /// **What it does:** Checks for usage of `option.map(_).unwrap_or(_)` or `option.map(_).unwrap_or_else(_)` or
314 /// `result.map(_).unwrap_or_else(_)`.
316 /// **Why is this bad?** Readability, these can be written more concisely (resp.) as
317 /// `option.map_or(_, _)`, `option.map_or_else(_, _)` and `result.map_or_else(_, _)`.
319 /// **Known problems:** The order of the arguments is not in execution order
323 /// # let x = Some(1);
326 /// x.map(|a| a + 1).unwrap_or(0);
329 /// x.map_or(0, |a| a + 1);
335 /// # let x: Result<usize, ()> = Ok(1);
336 /// # fn some_function(foo: ()) -> usize { 1 }
339 /// x.map(|a| a + 1).unwrap_or_else(some_function);
342 /// x.map_or_else(some_function, |a| a + 1);
346 "using `.map(f).unwrap_or(a)` or `.map(f).unwrap_or_else(func)`, which are more succinctly expressed as `map_or(a, f)` or `map_or_else(a, f)`"
349 declare_clippy_lint
! {
350 /// **What it does:** Checks for usage of `_.map_or(None, _)`.
352 /// **Why is this bad?** Readability, this can be written more concisely as
355 /// **Known problems:** The order of the arguments is not in execution order.
359 /// # let opt = Some(1);
362 /// opt.map_or(None, |a| Some(a + 1));
365 /// opt.and_then(|a| Some(a + 1));
367 pub OPTION_MAP_OR_NONE
,
369 "using `Option.map_or(None, f)`, which is more succinctly expressed as `and_then(f)`"
372 declare_clippy_lint
! {
373 /// **What it does:** Checks for usage of `_.map_or(None, Some)`.
375 /// **Why is this bad?** Readability, this can be written more concisely as
378 /// **Known problems:** None.
384 /// # let r: Result<u32, &str> = Ok(1);
385 /// assert_eq!(Some(1), r.map_or(None, Some));
390 /// # let r: Result<u32, &str> = Ok(1);
391 /// assert_eq!(Some(1), r.ok());
393 pub RESULT_MAP_OR_INTO_OPTION
,
395 "using `Result.map_or(None, Some)`, which is more succinctly expressed as `ok()`"
398 declare_clippy_lint
! {
399 /// **What it does:** Checks for usage of `_.and_then(|x| Some(y))`, `_.and_then(|x| Ok(y))` or
400 /// `_.or_else(|x| Err(y))`.
402 /// **Why is this bad?** Readability, this can be written more concisely as
403 /// `_.map(|x| y)` or `_.map_err(|x| y)`.
405 /// **Known problems:** None
410 /// # fn opt() -> Option<&'static str> { Some("42") }
411 /// # fn res() -> Result<&'static str, &'static str> { Ok("42") }
412 /// let _ = opt().and_then(|s| Some(s.len()));
413 /// let _ = res().and_then(|s| if s.len() == 42 { Ok(10) } else { Ok(20) });
414 /// let _ = res().or_else(|s| if s.len() == 42 { Err(10) } else { Err(20) });
417 /// The correct use would be:
420 /// # fn opt() -> Option<&'static str> { Some("42") }
421 /// # fn res() -> Result<&'static str, &'static str> { Ok("42") }
422 /// let _ = opt().map(|s| s.len());
423 /// let _ = res().map(|s| if s.len() == 42 { 10 } else { 20 });
424 /// let _ = res().map_err(|s| if s.len() == 42 { 10 } else { 20 });
426 pub BIND_INSTEAD_OF_MAP
,
428 "using `Option.and_then(|x| Some(y))`, which is more succinctly expressed as `map(|x| y)`"
431 declare_clippy_lint
! {
432 /// **What it does:** Checks for usage of `_.filter(_).next()`.
434 /// **Why is this bad?** Readability, this can be written more concisely as
437 /// **Known problems:** None.
441 /// # let vec = vec![1];
442 /// vec.iter().filter(|x| **x == 0).next();
444 /// Could be written as
446 /// # let vec = vec![1];
447 /// vec.iter().find(|x| **x == 0);
451 "using `filter(p).next()`, which is more succinctly expressed as `.find(p)`"
454 declare_clippy_lint
! {
455 /// **What it does:** Checks for usage of `_.skip_while(condition).next()`.
457 /// **Why is this bad?** Readability, this can be written more concisely as
458 /// `_.find(!condition)`.
460 /// **Known problems:** None.
464 /// # let vec = vec![1];
465 /// vec.iter().skip_while(|x| **x == 0).next();
467 /// Could be written as
469 /// # let vec = vec![1];
470 /// vec.iter().find(|x| **x != 0);
474 "using `skip_while(p).next()`, which is more succinctly expressed as `.find(!p)`"
477 declare_clippy_lint
! {
478 /// **What it does:** Checks for usage of `_.map(_).flatten(_)` on `Iterator` and `Option`
480 /// **Why is this bad?** Readability, this can be written more concisely as
483 /// **Known problems:**
487 /// let vec = vec![vec![1]];
490 /// vec.iter().map(|x| x.iter()).flatten();
493 /// vec.iter().flat_map(|x| x.iter());
497 "using combinations of `flatten` and `map` which can usually be written as a single method call"
500 declare_clippy_lint
! {
501 /// **What it does:** Checks for usage of `_.filter(_).map(_)` that can be written more simply
502 /// as `filter_map(_)`.
504 /// **Why is this bad?** Redundant code in the `filter` and `map` operations is poor style and
507 /// **Known problems:** None.
513 /// .filter(|n| n.checked_add(1).is_some())
514 /// .map(|n| n.checked_add(1).unwrap());
519 /// (0_i32..10).filter_map(|n| n.checked_add(1));
521 pub MANUAL_FILTER_MAP
,
523 "using `_.filter(_).map(_)` in a way that can be written more simply as `filter_map(_)`"
526 declare_clippy_lint
! {
527 /// **What it does:** Checks for usage of `_.find(_).map(_)` that can be written more simply
528 /// as `find_map(_)`.
530 /// **Why is this bad?** Redundant code in the `find` and `map` operations is poor style and
533 /// **Known problems:** None.
539 /// .find(|n| n.checked_add(1).is_some())
540 /// .map(|n| n.checked_add(1).unwrap());
545 /// (0_i32..10).find_map(|n| n.checked_add(1));
549 "using `_.find(_).map(_)` in a way that can be written more simply as `find_map(_)`"
552 declare_clippy_lint
! {
553 /// **What it does:** Checks for usage of `_.filter_map(_).next()`.
555 /// **Why is this bad?** Readability, this can be written more concisely as
558 /// **Known problems:** None
562 /// (0..3).filter_map(|x| if x == 2 { Some(x) } else { None }).next();
564 /// Can be written as
567 /// (0..3).find_map(|x| if x == 2 { Some(x) } else { None });
571 "using combination of `filter_map` and `next` which can usually be written as a single method call"
574 declare_clippy_lint
! {
575 /// **What it does:** Checks for usage of `flat_map(|x| x)`.
577 /// **Why is this bad?** Readability, this can be written more concisely by using `flatten`.
579 /// **Known problems:** None
583 /// # let iter = vec![vec![0]].into_iter();
584 /// iter.flat_map(|x| x);
586 /// Can be written as
588 /// # let iter = vec![vec![0]].into_iter();
591 pub FLAT_MAP_IDENTITY
,
593 "call to `flat_map` where `flatten` is sufficient"
596 declare_clippy_lint
! {
597 /// **What it does:** Checks for an iterator or string search (such as `find()`,
598 /// `position()`, or `rposition()`) followed by a call to `is_some()` or `is_none()`.
600 /// **Why is this bad?** Readability, this can be written more concisely as:
601 /// * `_.any(_)`, or `_.contains(_)` for `is_some()`,
602 /// * `!_.any(_)`, or `!_.contains(_)` for `is_none()`.
604 /// **Known problems:** None.
608 /// let vec = vec![1];
609 /// vec.iter().find(|x| **x == 0).is_some();
611 /// let _ = "hello world".find("world").is_none();
613 /// Could be written as
615 /// let vec = vec![1];
616 /// vec.iter().any(|x| *x == 0);
618 /// let _ = !"hello world".contains("world");
622 "using an iterator or string search followed by `is_some()` or `is_none()`, which is more succinctly expressed as a call to `any()` or `contains()` (with negation in case of `is_none()`)"
625 declare_clippy_lint
! {
626 /// **What it does:** Checks for usage of `.chars().next()` on a `str` to check
627 /// if it starts with a given char.
629 /// **Why is this bad?** Readability, this can be written more concisely as
630 /// `_.starts_with(_)`.
632 /// **Known problems:** None.
636 /// let name = "foo";
637 /// if name.chars().next() == Some('_') {};
639 /// Could be written as
641 /// let name = "foo";
642 /// if name.starts_with('_') {};
646 "using `.chars().next()` to check if a string starts with a char"
649 declare_clippy_lint
! {
650 /// **What it does:** Checks for calls to `.or(foo(..))`, `.unwrap_or(foo(..))`,
651 /// etc., and suggests to use `or_else`, `unwrap_or_else`, etc., or
652 /// `unwrap_or_default` instead.
654 /// **Why is this bad?** The function will always be called and potentially
655 /// allocate an object acting as the default.
657 /// **Known problems:** If the function has side-effects, not calling it will
658 /// change the semantic of the program, but you shouldn't rely on that anyway.
662 /// # let foo = Some(String::new());
663 /// foo.unwrap_or(String::new());
665 /// this can instead be written:
667 /// # let foo = Some(String::new());
668 /// foo.unwrap_or_else(String::new);
672 /// # let foo = Some(String::new());
673 /// foo.unwrap_or_default();
677 "using any `*or` method with a function call, which suggests `*or_else`"
680 declare_clippy_lint
! {
681 /// **What it does:** Checks for calls to `.expect(&format!(...))`, `.expect(foo(..))`,
682 /// etc., and suggests to use `unwrap_or_else` instead
684 /// **Why is this bad?** The function will always be called.
686 /// **Known problems:** If the function has side-effects, not calling it will
687 /// change the semantics of the program, but you shouldn't rely on that anyway.
691 /// # let foo = Some(String::new());
692 /// # let err_code = "418";
693 /// # let err_msg = "I'm a teapot";
694 /// foo.expect(&format!("Err {}: {}", err_code, err_msg));
698 /// # let foo = Some(String::new());
699 /// # let err_code = "418";
700 /// # let err_msg = "I'm a teapot";
701 /// foo.expect(format!("Err {}: {}", err_code, err_msg).as_str());
703 /// this can instead be written:
705 /// # let foo = Some(String::new());
706 /// # let err_code = "418";
707 /// # let err_msg = "I'm a teapot";
708 /// foo.unwrap_or_else(|| panic!("Err {}: {}", err_code, err_msg));
712 "using any `expect` method with a function call"
715 declare_clippy_lint
! {
716 /// **What it does:** Checks for usage of `.clone()` on a `Copy` type.
718 /// **Why is this bad?** The only reason `Copy` types implement `Clone` is for
719 /// generics, not for using the `clone` method on a concrete type.
721 /// **Known problems:** None.
729 "using `clone` on a `Copy` type"
732 declare_clippy_lint
! {
733 /// **What it does:** Checks for usage of `.clone()` on a ref-counted pointer,
734 /// (`Rc`, `Arc`, `rc::Weak`, or `sync::Weak`), and suggests calling Clone via unified
735 /// function syntax instead (e.g., `Rc::clone(foo)`).
737 /// **Why is this bad?** Calling '.clone()' on an Rc, Arc, or Weak
738 /// can obscure the fact that only the pointer is being cloned, not the underlying
743 /// # use std::rc::Rc;
744 /// let x = Rc::new(1);
752 pub CLONE_ON_REF_PTR
,
754 "using 'clone' on a ref-counted pointer"
757 declare_clippy_lint
! {
758 /// **What it does:** Checks for usage of `.clone()` on an `&&T`.
760 /// **Why is this bad?** Cloning an `&&T` copies the inner `&T`, instead of
761 /// cloning the underlying `T`.
763 /// **Known problems:** None.
770 /// let z = y.clone();
771 /// println!("{:p} {:p}", *y, z); // prints out the same pointer
774 pub CLONE_DOUBLE_REF
,
776 "using `clone` on `&&T`"
779 declare_clippy_lint
! {
780 /// **What it does:** Checks for usage of `.to_string()` on an `&&T` where
781 /// `T` implements `ToString` directly (like `&&str` or `&&String`).
783 /// **Why is this bad?** This bypasses the specialized implementation of
784 /// `ToString` and instead goes through the more expensive string formatting
787 /// **Known problems:** None.
791 /// // Generic implementation for `T: Display` is used (slow)
792 /// ["foo", "bar"].iter().map(|s| s.to_string());
794 /// // OK, the specialized impl is used
795 /// ["foo", "bar"].iter().map(|&s| s.to_string());
797 pub INEFFICIENT_TO_STRING
,
799 "using `to_string` on `&&T` where `T: ToString`"
802 declare_clippy_lint
! {
803 /// **What it does:** Checks for `new` not returning a type that contains `Self`.
805 /// **Why is this bad?** As a convention, `new` methods are used to make a new
806 /// instance of a type.
808 /// **Known problems:** None.
811 /// In an impl block:
814 /// # struct NotAFoo;
816 /// fn new() -> NotAFoo {
826 /// // Bad. The type name must contain `Self`
827 /// fn new() -> Bar {
835 /// # struct FooError;
837 /// // Good. Return type contains `Self`
838 /// fn new() -> Result<Foo, FooError> {
844 /// Or in a trait definition:
846 /// pub trait Trait {
847 /// // Bad. The type name must contain `Self`
853 /// pub trait Trait {
854 /// // Good. Return type contains `Self`
855 /// fn new() -> Self;
860 "not returning type containing `Self` in a `new` method"
863 declare_clippy_lint
! {
864 /// **What it does:** Checks for string methods that receive a single-character
865 /// `str` as an argument, e.g., `_.split("x")`.
867 /// **Why is this bad?** Performing these methods using a `char` is faster than
870 /// **Known problems:** Does not catch multi-byte unicode characters.
879 pub SINGLE_CHAR_PATTERN
,
881 "using a single-character str where a char could be used, e.g., `_.split(\"x\")`"
884 declare_clippy_lint
! {
885 /// **What it does:** Checks for calling `.step_by(0)` on iterators which panics.
887 /// **Why is this bad?** This very much looks like an oversight. Use `panic!()` instead if you
888 /// actually intend to panic.
890 /// **Known problems:** None.
893 /// ```rust,should_panic
894 /// for x in (0..100).step_by(0) {
898 pub ITERATOR_STEP_BY_ZERO
,
900 "using `Iterator::step_by(0)`, which will panic at runtime"
903 declare_clippy_lint
! {
904 /// **What it does:** Checks for indirect collection of populated `Option`
906 /// **Why is this bad?** `Option` is like a collection of 0-1 things, so `flatten`
907 /// automatically does this without suspicious-looking `unwrap` calls.
909 /// **Known problems:** None.
914 /// let _ = std::iter::empty::<Option<i32>>().filter(Option::is_some).map(Option::unwrap);
918 /// let _ = std::iter::empty::<Option<i32>>().flatten();
920 pub OPTION_FILTER_MAP
,
922 "filtering `Option` for `Some` then force-unwrapping, which can be one type-safe operation"
925 declare_clippy_lint
! {
926 /// **What it does:** Checks for the use of `iter.nth(0)`.
928 /// **Why is this bad?** `iter.next()` is equivalent to
929 /// `iter.nth(0)`, as they both consume the next element,
930 /// but is more readable.
932 /// **Known problems:** None.
937 /// # use std::collections::HashSet;
939 /// # let mut s = HashSet::new();
941 /// let x = s.iter().nth(0);
944 /// # let mut s = HashSet::new();
946 /// let x = s.iter().next();
950 "replace `iter.nth(0)` with `iter.next()`"
953 declare_clippy_lint
! {
954 /// **What it does:** Checks for use of `.iter().nth()` (and the related
955 /// `.iter_mut().nth()`) on standard library types with O(1) element access.
957 /// **Why is this bad?** `.get()` and `.get_mut()` are more efficient and more
960 /// **Known problems:** None.
964 /// let some_vec = vec![0, 1, 2, 3];
965 /// let bad_vec = some_vec.iter().nth(3);
966 /// let bad_slice = &some_vec[..].iter().nth(3);
968 /// The correct use would be:
970 /// let some_vec = vec![0, 1, 2, 3];
971 /// let bad_vec = some_vec.get(3);
972 /// let bad_slice = &some_vec[..].get(3);
976 "using `.iter().nth()` on a standard library type with O(1) element access"
979 declare_clippy_lint
! {
980 /// **What it does:** Checks for use of `.skip(x).next()` on iterators.
982 /// **Why is this bad?** `.nth(x)` is cleaner
984 /// **Known problems:** None.
988 /// let some_vec = vec![0, 1, 2, 3];
989 /// let bad_vec = some_vec.iter().skip(3).next();
990 /// let bad_slice = &some_vec[..].iter().skip(3).next();
992 /// The correct use would be:
994 /// let some_vec = vec![0, 1, 2, 3];
995 /// let bad_vec = some_vec.iter().nth(3);
996 /// let bad_slice = &some_vec[..].iter().nth(3);
1000 "using `.skip(x).next()` on an iterator"
1003 declare_clippy_lint
! {
1004 /// **What it does:** Checks for use of `.get().unwrap()` (or
1005 /// `.get_mut().unwrap`) on a standard library type which implements `Index`
1007 /// **Why is this bad?** Using the Index trait (`[]`) is more clear and more
1010 /// **Known problems:** Not a replacement for error handling: Using either
1011 /// `.unwrap()` or the Index trait (`[]`) carries the risk of causing a `panic`
1012 /// if the value being accessed is `None`. If the use of `.get().unwrap()` is a
1013 /// temporary placeholder for dealing with the `Option` type, then this does
1014 /// not mitigate the need for error handling. If there is a chance that `.get()`
1015 /// will be `None` in your program, then it is advisable that the `None` case
1016 /// is handled in a future refactor instead of using `.unwrap()` or the Index
1021 /// let mut some_vec = vec![0, 1, 2, 3];
1022 /// let last = some_vec.get(3).unwrap();
1023 /// *some_vec.get_mut(0).unwrap() = 1;
1025 /// The correct use would be:
1027 /// let mut some_vec = vec![0, 1, 2, 3];
1028 /// let last = some_vec[3];
1029 /// some_vec[0] = 1;
1033 "using `.get().unwrap()` or `.get_mut().unwrap()` when using `[]` would work instead"
1036 declare_clippy_lint
! {
1037 /// **What it does:** Checks for occurrences where one vector gets extended instead of append
1039 /// **Why is this bad?** Using `append` instead of `extend` is more concise and faster
1041 /// **Known problems:** None.
1046 /// let mut a = vec![1, 2, 3];
1047 /// let mut b = vec![4, 5, 6];
1050 /// a.extend(b.drain(..));
1053 /// a.append(&mut b);
1055 pub EXTEND_WITH_DRAIN
,
1057 "using vec.append(&mut vec) to move the full range of a vecor to another"
1060 declare_clippy_lint
! {
1061 /// **What it does:** Checks for the use of `.extend(s.chars())` where s is a
1062 /// `&str` or `String`.
1064 /// **Why is this bad?** `.push_str(s)` is clearer
1066 /// **Known problems:** None.
1070 /// let abc = "abc";
1071 /// let def = String::from("def");
1072 /// let mut s = String::new();
1073 /// s.extend(abc.chars());
1074 /// s.extend(def.chars());
1076 /// The correct use would be:
1078 /// let abc = "abc";
1079 /// let def = String::from("def");
1080 /// let mut s = String::new();
1081 /// s.push_str(abc);
1082 /// s.push_str(&def);
1084 pub STRING_EXTEND_CHARS
,
1086 "using `x.extend(s.chars())` where s is a `&str` or `String`"
1089 declare_clippy_lint
! {
1090 /// **What it does:** Checks for the use of `.cloned().collect()` on slice to
1093 /// **Why is this bad?** `.to_vec()` is clearer
1095 /// **Known problems:** None.
1099 /// let s = [1, 2, 3, 4, 5];
1100 /// let s2: Vec<isize> = s[..].iter().cloned().collect();
1102 /// The better use would be:
1104 /// let s = [1, 2, 3, 4, 5];
1105 /// let s2: Vec<isize> = s.to_vec();
1107 pub ITER_CLONED_COLLECT
,
1109 "using `.cloned().collect()` on slice to create a `Vec`"
1112 declare_clippy_lint
! {
1113 /// **What it does:** Checks for usage of `_.chars().last()` or
1114 /// `_.chars().next_back()` on a `str` to check if it ends with a given char.
1116 /// **Why is this bad?** Readability, this can be written more concisely as
1117 /// `_.ends_with(_)`.
1119 /// **Known problems:** None.
1123 /// # let name = "_";
1126 /// name.chars().last() == Some('_') || name.chars().next_back() == Some('-');
1129 /// name.ends_with('_') || name.ends_with('-');
1133 "using `.chars().last()` or `.chars().next_back()` to check if a string ends with a char"
1136 declare_clippy_lint
! {
1137 /// **What it does:** Checks for usage of `.as_ref()` or `.as_mut()` where the
1138 /// types before and after the call are the same.
1140 /// **Why is this bad?** The call is unnecessary.
1142 /// **Known problems:** None.
1146 /// # fn do_stuff(x: &[i32]) {}
1147 /// let x: &[i32] = &[1, 2, 3, 4, 5];
1148 /// do_stuff(x.as_ref());
1150 /// The correct use would be:
1152 /// # fn do_stuff(x: &[i32]) {}
1153 /// let x: &[i32] = &[1, 2, 3, 4, 5];
1158 "using `as_ref` where the types before and after the call are the same"
1161 declare_clippy_lint
! {
1162 /// **What it does:** Checks for using `fold` when a more succinct alternative exists.
1163 /// Specifically, this checks for `fold`s which could be replaced by `any`, `all`,
1164 /// `sum` or `product`.
1166 /// **Why is this bad?** Readability.
1168 /// **Known problems:** None.
1172 /// let _ = (0..3).fold(false, |acc, x| acc || x > 2);
1174 /// This could be written as:
1176 /// let _ = (0..3).any(|x| x > 2);
1178 pub UNNECESSARY_FOLD
,
1180 "using `fold` when a more succinct alternative exists"
1183 declare_clippy_lint
! {
1184 /// **What it does:** Checks for `filter_map` calls which could be replaced by `filter` or `map`.
1185 /// More specifically it checks if the closure provided is only performing one of the
1186 /// filter or map operations and suggests the appropriate option.
1188 /// **Why is this bad?** Complexity. The intent is also clearer if only a single
1189 /// operation is being performed.
1191 /// **Known problems:** None
1195 /// let _ = (0..3).filter_map(|x| if x > 2 { Some(x) } else { None });
1197 /// // As there is no transformation of the argument this could be written as:
1198 /// let _ = (0..3).filter(|&x| x > 2);
1202 /// let _ = (0..4).filter_map(|x| Some(x + 1));
1204 /// // As there is no conditional check on the argument this could be written as:
1205 /// let _ = (0..4).map(|x| x + 1);
1207 pub UNNECESSARY_FILTER_MAP
,
1209 "using `filter_map` when a more succinct alternative exists"
1212 declare_clippy_lint
! {
1213 /// **What it does:** Checks for `into_iter` calls on references which should be replaced by `iter`
1216 /// **Why is this bad?** Readability. Calling `into_iter` on a reference will not move out its
1217 /// content into the resulting iterator, which is confusing. It is better just call `iter` or
1218 /// `iter_mut` directly.
1220 /// **Known problems:** None
1226 /// let _ = (&vec![3, 4, 5]).into_iter();
1229 /// let _ = (&vec![3, 4, 5]).iter();
1231 pub INTO_ITER_ON_REF
,
1233 "using `.into_iter()` on a reference"
1236 declare_clippy_lint
! {
1237 /// **What it does:** Checks for calls to `map` followed by a `count`.
1239 /// **Why is this bad?** It looks suspicious. Maybe `map` was confused with `filter`.
1240 /// If the `map` call is intentional, this should be rewritten. Or, if you intend to
1241 /// drive the iterator to completion, you can just use `for_each` instead.
1243 /// **Known problems:** None
1248 /// let _ = (0..3).map(|x| x + 2).count();
1252 "suspicious usage of map"
1255 declare_clippy_lint
! {
1256 /// **What it does:** Checks for `MaybeUninit::uninit().assume_init()`.
1258 /// **Why is this bad?** For most types, this is undefined behavior.
1260 /// **Known problems:** For now, we accept empty tuples and tuples / arrays
1261 /// of `MaybeUninit`. There may be other types that allow uninitialized
1262 /// data, but those are not yet rigorously defined.
1267 /// // Beware the UB
1268 /// use std::mem::MaybeUninit;
1270 /// let _: usize = unsafe { MaybeUninit::uninit().assume_init() };
1273 /// Note that the following is OK:
1276 /// use std::mem::MaybeUninit;
1278 /// let _: [MaybeUninit<bool>; 5] = unsafe {
1279 /// MaybeUninit::uninit().assume_init()
1282 pub UNINIT_ASSUMED_INIT
,
1284 "`MaybeUninit::uninit().assume_init()`"
1287 declare_clippy_lint
! {
1288 /// **What it does:** Checks for `.checked_add/sub(x).unwrap_or(MAX/MIN)`.
1290 /// **Why is this bad?** These can be written simply with `saturating_add/sub` methods.
1295 /// # let y: u32 = 0;
1296 /// # let x: u32 = 100;
1297 /// let add = x.checked_add(y).unwrap_or(u32::MAX);
1298 /// let sub = x.checked_sub(y).unwrap_or(u32::MIN);
1301 /// can be written using dedicated methods for saturating addition/subtraction as:
1304 /// # let y: u32 = 0;
1305 /// # let x: u32 = 100;
1306 /// let add = x.saturating_add(y);
1307 /// let sub = x.saturating_sub(y);
1309 pub MANUAL_SATURATING_ARITHMETIC
,
1311 "`.chcked_add/sub(x).unwrap_or(MAX/MIN)`"
1314 declare_clippy_lint
! {
1315 /// **What it does:** Checks for `offset(_)`, `wrapping_`{`add`, `sub`}, etc. on raw pointers to
1316 /// zero-sized types
1318 /// **Why is this bad?** This is a no-op, and likely unintended
1320 /// **Known problems:** None
1324 /// unsafe { (&() as *const ()).offset(1) };
1328 "Check for offset calculations on raw pointers to zero-sized types"
1331 declare_clippy_lint
! {
1332 /// **What it does:** Checks for `FileType::is_file()`.
1334 /// **Why is this bad?** When people testing a file type with `FileType::is_file`
1335 /// they are testing whether a path is something they can get bytes from. But
1336 /// `is_file` doesn't cover special file types in unix-like systems, and doesn't cover
1337 /// symlink in windows. Using `!FileType::is_dir()` is a better way to that intention.
1343 /// let metadata = std::fs::metadata("foo.txt")?;
1344 /// let filetype = metadata.file_type();
1346 /// if filetype.is_file() {
1349 /// # Ok::<_, std::io::Error>(())
1353 /// should be written as:
1357 /// let metadata = std::fs::metadata("foo.txt")?;
1358 /// let filetype = metadata.file_type();
1360 /// if !filetype.is_dir() {
1363 /// # Ok::<_, std::io::Error>(())
1366 pub FILETYPE_IS_FILE
,
1368 "`FileType::is_file` is not recommended to test for readable file type"
1371 declare_clippy_lint
! {
1372 /// **What it does:** Checks for usage of `_.as_ref().map(Deref::deref)` or it's aliases (such as String::as_str).
1374 /// **Why is this bad?** Readability, this can be written more concisely as
1377 /// **Known problems:** None.
1381 /// # let opt = Some("".to_string());
1382 /// opt.as_ref().map(String::as_str)
1385 /// Can be written as
1387 /// # let opt = Some("".to_string());
1391 pub OPTION_AS_REF_DEREF
,
1393 "using `as_ref().map(Deref::deref)`, which is more succinctly expressed as `as_deref()`"
1396 declare_clippy_lint
! {
1397 /// **What it does:** Checks for usage of `iter().next()` on a Slice or an Array
1399 /// **Why is this bad?** These can be shortened into `.get()`
1401 /// **Known problems:** None.
1405 /// # let a = [1, 2, 3];
1406 /// # let b = vec![1, 2, 3];
1407 /// a[2..].iter().next();
1408 /// b.iter().next();
1410 /// should be written as:
1412 /// # let a = [1, 2, 3];
1413 /// # let b = vec![1, 2, 3];
1417 pub ITER_NEXT_SLICE
,
1419 "using `.iter().next()` on a sliced array, which can be shortened to just `.get()`"
1422 declare_clippy_lint
! {
1423 /// **What it does:** Warns when using `push_str`/`insert_str` with a single-character string literal
1424 /// where `push`/`insert` with a `char` would work fine.
1426 /// **Why is this bad?** It's less clear that we are pushing a single character.
1428 /// **Known problems:** None
1432 /// let mut string = String::new();
1433 /// string.insert_str(0, "R");
1434 /// string.push_str("R");
1436 /// Could be written as
1438 /// let mut string = String::new();
1439 /// string.insert(0, 'R');
1440 /// string.push('R');
1442 pub SINGLE_CHAR_ADD_STR
,
1444 "`push_str()` or `insert_str()` used with a single-character string literal as parameter"
1447 declare_clippy_lint
! {
1448 /// **What it does:** As the counterpart to `or_fun_call`, this lint looks for unnecessary
1449 /// lazily evaluated closures on `Option` and `Result`.
1451 /// This lint suggests changing the following functions, when eager evaluation results in
1453 /// - `unwrap_or_else` to `unwrap_or`
1454 /// - `and_then` to `and`
1455 /// - `or_else` to `or`
1456 /// - `get_or_insert_with` to `get_or_insert`
1457 /// - `ok_or_else` to `ok_or`
1459 /// **Why is this bad?** Using eager evaluation is shorter and simpler in some cases.
1461 /// **Known problems:** It is possible, but not recommended for `Deref` and `Index` to have
1462 /// side effects. Eagerly evaluating them can change the semantics of the program.
1467 /// // example code where clippy issues a warning
1468 /// let opt: Option<u32> = None;
1470 /// opt.unwrap_or_else(|| 42);
1474 /// let opt: Option<u32> = None;
1476 /// opt.unwrap_or(42);
1478 pub UNNECESSARY_LAZY_EVALUATIONS
,
1480 "using unnecessary lazy evaluation, which can be replaced with simpler eager evaluation"
1483 declare_clippy_lint
! {
1484 /// **What it does:** Checks for usage of `_.map(_).collect::<Result<(), _>()`.
1486 /// **Why is this bad?** Using `try_for_each` instead is more readable and idiomatic.
1488 /// **Known problems:** None
1493 /// (0..3).map(|t| Err(t)).collect::<Result<(), _>>();
1497 /// (0..3).try_for_each(|t| Err(t));
1499 pub MAP_COLLECT_RESULT_UNIT
,
1501 "using `.map(_).collect::<Result<(),_>()`, which can be replaced with `try_for_each`"
1504 declare_clippy_lint
! {
1505 /// **What it does:** Checks for `from_iter()` function calls on types that implement the `FromIterator`
1508 /// **Why is this bad?** It is recommended style to use collect. See
1509 /// [FromIterator documentation](https://doc.rust-lang.org/std/iter/trait.FromIterator.html)
1511 /// **Known problems:** None.
1516 /// use std::iter::FromIterator;
1518 /// let five_fives = std::iter::repeat(5).take(5);
1520 /// let v = Vec::from_iter(five_fives);
1522 /// assert_eq!(v, vec![5, 5, 5, 5, 5]);
1526 /// let five_fives = std::iter::repeat(5).take(5);
1528 /// let v: Vec<i32> = five_fives.collect();
1530 /// assert_eq!(v, vec![5, 5, 5, 5, 5]);
1532 pub FROM_ITER_INSTEAD_OF_COLLECT
,
1534 "use `.collect()` instead of `::from_iter()`"
1537 declare_clippy_lint
! {
1538 /// **What it does:** Checks for usage of `inspect().for_each()`.
1540 /// **Why is this bad?** It is the same as performing the computation
1541 /// inside `inspect` at the beginning of the closure in `for_each`.
1543 /// **Known problems:** None.
1548 /// [1,2,3,4,5].iter()
1549 /// .inspect(|&x| println!("inspect the number: {}", x))
1550 /// .for_each(|&x| {
1551 /// assert!(x >= 0);
1554 /// Can be written as
1556 /// [1,2,3,4,5].iter()
1557 /// .for_each(|&x| {
1558 /// println!("inspect the number: {}", x);
1559 /// assert!(x >= 0);
1562 pub INSPECT_FOR_EACH
,
1564 "using `.inspect().for_each()`, which can be replaced with `.for_each()`"
1567 declare_clippy_lint
! {
1568 /// **What it does:** Checks for usage of `filter_map(|x| x)`.
1570 /// **Why is this bad?** Readability, this can be written more concisely by using `flatten`.
1572 /// **Known problems:** None.
1577 /// # let iter = vec![Some(1)].into_iter();
1578 /// iter.filter_map(|x| x);
1582 /// # let iter = vec![Some(1)].into_iter();
1585 pub FILTER_MAP_IDENTITY
,
1587 "call to `filter_map` where `flatten` is sufficient"
1590 declare_clippy_lint
! {
1591 /// **What it does:** Checks for instances of `map(f)` where `f` is the identity function.
1593 /// **Why is this bad?** It can be written more concisely without the call to `map`.
1595 /// **Known problems:** None.
1600 /// let x = [1, 2, 3];
1601 /// let y: Vec<_> = x.iter().map(|x| x).map(|x| 2*x).collect();
1605 /// let x = [1, 2, 3];
1606 /// let y: Vec<_> = x.iter().map(|x| 2*x).collect();
1610 "using iterator.map(|x| x)"
1613 declare_clippy_lint
! {
1614 /// **What it does:** Checks for the use of `.bytes().nth()`.
1616 /// **Why is this bad?** `.as_bytes().get()` is more efficient and more
1619 /// **Known problems:** None.
1625 /// let _ = "Hello".bytes().nth(3);
1628 /// let _ = "Hello".as_bytes().get(3);
1632 "replace `.bytes().nth()` with `.as_bytes().get()`"
1635 declare_clippy_lint
! {
1636 /// **What it does:** Checks for the usage of `_.to_owned()`, `vec.to_vec()`, or similar when calling `_.clone()` would be clearer.
1638 /// **Why is this bad?** These methods do the same thing as `_.clone()` but may be confusing as
1639 /// to why we are calling `to_vec` on something that is already a `Vec` or calling `to_owned` on something that is already owned.
1641 /// **Known problems:** None.
1646 /// let a = vec![1, 2, 3];
1647 /// let b = a.to_vec();
1648 /// let c = a.to_owned();
1652 /// let a = vec![1, 2, 3];
1653 /// let b = a.clone();
1654 /// let c = a.clone();
1658 "implicitly cloning a value by invoking a function on its dereferenced type"
1661 declare_clippy_lint
! {
1662 /// **What it does:** Checks for the use of `.iter().count()`.
1664 /// **Why is this bad?** `.len()` is more efficient and more
1667 /// **Known problems:** None.
1673 /// let some_vec = vec![0, 1, 2, 3];
1674 /// let _ = some_vec.iter().count();
1675 /// let _ = &some_vec[..].iter().count();
1678 /// let some_vec = vec![0, 1, 2, 3];
1679 /// let _ = some_vec.len();
1680 /// let _ = &some_vec[..].len();
1684 "replace `.iter().count()` with `.len()`"
1687 declare_clippy_lint
! {
1688 /// **What it does:** Checks for calls to [`splitn`]
1689 /// (https://doc.rust-lang.org/std/primitive.str.html#method.splitn) and
1690 /// related functions with either zero or one splits.
1692 /// **Why is this bad?** These calls don't actually split the value and are
1693 /// likely to be intended as a different number.
1695 /// **Known problems:** None.
1702 /// for x in s.splitn(1, ":") {
1708 /// for x in s.splitn(2, ":") {
1712 pub SUSPICIOUS_SPLITN
,
1714 "checks for `.splitn(0, ..)` and `.splitn(1, ..)`"
1717 declare_clippy_lint
! {
1718 /// **What it does:** Checks for manual implementations of `str::repeat`
1720 /// **Why is this bad?** These are both harder to read, as well as less performant.
1722 /// **Known problems:** None.
1728 /// let x: String = std::iter::repeat('x').take(10).collect();
1731 /// let x: String = "x".repeat(10);
1733 pub MANUAL_STR_REPEAT
,
1735 "manual implementation of `str::repeat`"
1738 pub struct Methods
{
1739 avoid_breaking_exported_api
: bool
,
1740 msrv
: Option
<RustcVersion
>,
1745 pub fn new(avoid_breaking_exported_api
: bool
, msrv
: Option
<RustcVersion
>) -> Self {
1747 avoid_breaking_exported_api
,
1753 impl_lint_pass
!(Methods
=> [
1756 SHOULD_IMPLEMENT_TRAIT
,
1757 WRONG_SELF_CONVENTION
,
1760 RESULT_MAP_OR_INTO_OPTION
,
1762 BIND_INSTEAD_OF_MAP
,
1770 CLONED_INSTEAD_OF_COPIED
,
1772 INEFFICIENT_TO_STRING
,
1774 SINGLE_CHAR_PATTERN
,
1775 SINGLE_CHAR_ADD_STR
,
1779 FILTER_MAP_IDENTITY
,
1787 ITERATOR_STEP_BY_ZERO
,
1795 STRING_EXTEND_CHARS
,
1796 ITER_CLONED_COLLECT
,
1799 UNNECESSARY_FILTER_MAP
,
1802 UNINIT_ASSUMED_INIT
,
1803 MANUAL_SATURATING_ARITHMETIC
,
1806 OPTION_AS_REF_DEREF
,
1807 UNNECESSARY_LAZY_EVALUATIONS
,
1808 MAP_COLLECT_RESULT_UNIT
,
1809 FROM_ITER_INSTEAD_OF_COLLECT
,
1817 /// Extracts a method call name, args, and `Span` of the method name.
1818 fn method_call
<'tcx
>(recv
: &'tcx hir
::Expr
<'tcx
>) -> Option
<(SymbolStr
, &'tcx
[hir
::Expr
<'tcx
>], Span
)> {
1819 if let ExprKind
::MethodCall(path
, span
, args
, _
) = recv
.kind
{
1820 if !args
.iter().any(|e
| e
.span
.from_expansion()) {
1821 return Some((path
.ident
.name
.as_str(), args
, span
));
1827 /// Same as `method_call` but the `SymbolStr` is dereferenced into a temporary `&str`
1828 macro_rules
! method_call
{
1832 .map(|&(ref name
, args
, span
)| (&**name
, args
, span
))
1836 impl<'tcx
> LateLintPass
<'tcx
> for Methods
{
1837 fn check_expr(&mut self, cx
: &LateContext
<'tcx
>, expr
: &'tcx hir
::Expr
<'_
>) {
1838 if in_macro(expr
.span
) {
1842 check_methods(cx
, expr
, self.msrv
.as_ref());
1845 hir
::ExprKind
::Call(func
, args
) => {
1846 from_iter_instead_of_collect
::check(cx
, expr
, args
, func
);
1848 hir
::ExprKind
::MethodCall(method_call
, ref method_span
, args
, _
) => {
1849 or_fun_call
::check(cx
, expr
, *method_span
, &method_call
.ident
.as_str(), args
);
1850 expect_fun_call
::check(cx
, expr
, *method_span
, &method_call
.ident
.as_str(), args
);
1851 clone_on_copy
::check(cx
, expr
, method_call
.ident
.name
, args
);
1852 clone_on_ref_ptr
::check(cx
, expr
, method_call
.ident
.name
, args
);
1853 inefficient_to_string
::check(cx
, expr
, method_call
.ident
.name
, args
);
1854 single_char_add_str
::check(cx
, expr
, args
);
1855 into_iter_on_ref
::check(cx
, expr
, *method_span
, method_call
.ident
.name
, args
);
1856 single_char_pattern
::check(cx
, expr
, method_call
.ident
.name
, args
);
1858 hir
::ExprKind
::Binary(op
, lhs
, rhs
) if op
.node
== hir
::BinOpKind
::Eq
|| op
.node
== hir
::BinOpKind
::Ne
=> {
1859 let mut info
= BinaryExprInfo
{
1863 eq
: op
.node
== hir
::BinOpKind
::Eq
,
1865 lint_binary_expr_with_method_call(cx
, &mut info
);
1871 #[allow(clippy::too_many_lines)]
1872 fn check_impl_item(&mut self, cx
: &LateContext
<'tcx
>, impl_item
: &'tcx hir
::ImplItem
<'_
>) {
1873 if in_external_macro(cx
.sess(), impl_item
.span
) {
1876 let name
= impl_item
.ident
.name
.as_str();
1877 let parent
= cx
.tcx
.hir().get_parent_item(impl_item
.hir_id());
1878 let item
= cx
.tcx
.hir().expect_item(parent
);
1879 let self_ty
= cx
.tcx
.type_of(item
.def_id
);
1881 let implements_trait
= matches
!(item
.kind
, hir
::ItemKind
::Impl(hir
::Impl { of_trait: Some(_), .. }
));
1883 if let hir
::ImplItemKind
::Fn(ref sig
, id
) = impl_item
.kind
;
1884 if let Some(first_arg
) = iter_input_pats(sig
.decl
, cx
.tcx
.hir().body(id
)).next();
1886 let method_sig
= cx
.tcx
.fn_sig(impl_item
.def_id
);
1887 let method_sig
= cx
.tcx
.erase_late_bound_regions(method_sig
);
1889 let first_arg_ty
= &method_sig
.inputs().iter().next();
1891 // check conventions w.r.t. conversion method names and predicates
1892 if let Some(first_arg_ty
) = first_arg_ty
;
1895 // if this impl block implements a trait, lint in trait definition instead
1896 if !implements_trait
&& cx
.access_levels
.is_exported(impl_item
.hir_id()) {
1897 // check missing trait implementations
1898 for method_config
in &TRAIT_METHODS
{
1899 if name
== method_config
.method_name
&&
1900 sig
.decl
.inputs
.len() == method_config
.param_count
&&
1901 method_config
.output_type
.matches(&sig
.decl
.output
) &&
1902 method_config
.self_kind
.matches(cx
, self_ty
, first_arg_ty
) &&
1903 fn_header_equals(method_config
.fn_header
, sig
.header
) &&
1904 method_config
.lifetime_param_cond(impl_item
)
1908 SHOULD_IMPLEMENT_TRAIT
,
1911 "method `{}` can be confused for the standard trait method `{}::{}`",
1912 method_config
.method_name
,
1913 method_config
.trait_name
,
1914 method_config
.method_name
1918 "consider implementing the trait `{}` or choosing a less ambiguous method name",
1919 method_config
.trait_name
1926 if sig
.decl
.implicit_self
.has_implicit_self()
1927 && !(self.avoid_breaking_exported_api
1928 && cx
.access_levels
.is_exported(impl_item
.hir_id()))
1930 wrong_self_convention
::check(
1943 // if this impl block implements a trait, lint in trait definition instead
1944 if implements_trait
{
1948 if let hir
::ImplItemKind
::Fn(_
, _
) = impl_item
.kind
{
1949 let ret_ty
= return_ty(cx
, impl_item
.hir_id());
1951 // walk the return type and check for Self (this does not check associated types)
1952 if let Some(self_adt
) = self_ty
.ty_adt_def() {
1953 if contains_adt_constructor(ret_ty
, self_adt
) {
1956 } else if contains_ty(ret_ty
, self_ty
) {
1960 // if return type is impl trait, check the associated types
1961 if let ty
::Opaque(def_id
, _
) = *ret_ty
.kind() {
1962 // one of the associated types must be Self
1963 for &(predicate
, _span
) in cx
.tcx
.explicit_item_bounds(def_id
) {
1964 if let ty
::PredicateKind
::Projection(projection_predicate
) = predicate
.kind().skip_binder() {
1965 // walk the associated type and check for Self
1966 if let Some(self_adt
) = self_ty
.ty_adt_def() {
1967 if contains_adt_constructor(projection_predicate
.ty
, self_adt
) {
1970 } else if contains_ty(projection_predicate
.ty
, self_ty
) {
1977 if name
== "new" && !TyS
::same_type(ret_ty
, self_ty
) {
1982 "methods called `new` usually return `Self`",
1988 fn check_trait_item(&mut self, cx
: &LateContext
<'tcx
>, item
: &'tcx TraitItem
<'_
>) {
1989 if in_external_macro(cx
.tcx
.sess
, item
.span
) {
1994 if let TraitItemKind
::Fn(ref sig
, _
) = item
.kind
;
1995 if sig
.decl
.implicit_self
.has_implicit_self();
1996 if let Some(first_arg_ty
) = sig
.decl
.inputs
.iter().next();
1999 let first_arg_span
= first_arg_ty
.span
;
2000 let first_arg_ty
= hir_ty_to_ty(cx
.tcx
, first_arg_ty
);
2001 let self_ty
= TraitRef
::identity(cx
.tcx
, item
.def_id
.to_def_id()).self_ty();
2002 wrong_self_convention
::check(
2004 &item
.ident
.name
.as_str(),
2015 if item
.ident
.name
== sym
::new
;
2016 if let TraitItemKind
::Fn(_
, _
) = item
.kind
;
2017 let ret_ty
= return_ty(cx
, item
.hir_id());
2018 let self_ty
= TraitRef
::identity(cx
.tcx
, item
.def_id
.to_def_id()).self_ty();
2019 if !contains_ty(ret_ty
, self_ty
);
2026 "methods called `new` usually return `Self`",
2032 extract_msrv_attr
!(LateContext
);
2035 #[allow(clippy::too_many_lines)]
2036 fn check_methods
<'tcx
>(cx
: &LateContext
<'tcx
>, expr
: &'tcx Expr
<'_
>, msrv
: Option
<&RustcVersion
>) {
2037 if let Some((name
, [recv
, args @
..], span
)) = method_call
!(expr
) {
2038 match (name
, args
) {
2039 ("add" | "offset" | "sub" | "wrapping_offset" | "wrapping_add" | "wrapping_sub", [_arg
]) => {
2040 zst_offset
::check(cx
, expr
, recv
);
2042 ("and_then", [arg
]) => {
2043 let biom_option_linted
= bind_instead_of_map
::OptionAndThenSome
::check(cx
, expr
, recv
, arg
);
2044 let biom_result_linted
= bind_instead_of_map
::ResultAndThenOk
::check(cx
, expr
, recv
, arg
);
2045 if !biom_option_linted
&& !biom_result_linted
{
2046 unnecessary_lazy_eval
::check(cx
, expr
, recv
, arg
, "and");
2049 ("as_mut", []) => useless_asref
::check(cx
, expr
, "as_mut", recv
),
2050 ("as_ref", []) => useless_asref
::check(cx
, expr
, "as_ref", recv
),
2051 ("assume_init", []) => uninit_assumed_init
::check(cx
, expr
, recv
),
2052 ("cloned", []) => cloned_instead_of_copied
::check(cx
, expr
, recv
, span
, msrv
),
2053 ("collect", []) => match method_call
!(recv
) {
2054 Some(("cloned", [recv2
], _
)) => iter_cloned_collect
::check(cx
, expr
, recv2
),
2055 Some(("map", [m_recv
, m_arg
], _
)) => {
2056 map_collect_result_unit
::check(cx
, expr
, m_recv
, m_arg
, recv
);
2058 Some(("take", [take_self_arg
, take_arg
], _
)) => {
2059 if meets_msrv(msrv
, &msrvs
::STR_REPEAT
) {
2060 manual_str_repeat
::check(cx
, expr
, recv
, take_self_arg
, take_arg
);
2065 ("count", []) => match method_call
!(recv
) {
2066 Some((name @
("into_iter" | "iter" | "iter_mut"), [recv2
], _
)) => {
2067 iter_count
::check(cx
, expr
, recv2
, name
);
2069 Some(("map", [_
, arg
], _
)) => suspicious_map
::check(cx
, expr
, recv
, arg
),
2072 ("expect", [_
]) => match method_call
!(recv
) {
2073 Some(("ok", [recv
], _
)) => ok_expect
::check(cx
, expr
, recv
),
2074 _
=> expect_used
::check(cx
, expr
, recv
),
2076 ("extend", [arg
]) => {
2077 string_extend_chars
::check(cx
, expr
, recv
, arg
);
2078 extend_with_drain
::check(cx
, expr
, recv
, arg
);
2080 ("filter_map", [arg
]) => {
2081 unnecessary_filter_map
::check(cx
, expr
, arg
);
2082 filter_map_identity
::check(cx
, expr
, arg
, span
);
2084 ("flat_map", [arg
]) => {
2085 flat_map_identity
::check(cx
, expr
, arg
, span
);
2086 flat_map_option
::check(cx
, expr
, arg
, span
);
2088 ("flatten", []) => {
2089 if let Some(("map", [recv
, map_arg
], _
)) = method_call
!(recv
) {
2090 map_flatten
::check(cx
, expr
, recv
, map_arg
);
2093 ("fold", [init
, acc
]) => unnecessary_fold
::check(cx
, expr
, init
, acc
, span
),
2094 ("for_each", [_
]) => {
2095 if let Some(("inspect", [_
, _
], span2
)) = method_call
!(recv
) {
2096 inspect_for_each
::check(cx
, expr
, span2
);
2099 ("get_or_insert_with", [arg
]) => unnecessary_lazy_eval
::check(cx
, expr
, recv
, arg
, "get_or_insert"),
2100 ("is_file", []) => filetype_is_file
::check(cx
, expr
, recv
),
2101 ("is_none", []) => check_is_some_is_none(cx
, expr
, recv
, false),
2102 ("is_some", []) => check_is_some_is_none(cx
, expr
, recv
, true),
2103 ("map", [m_arg
]) => {
2104 if let Some((name
, [recv2
, args @
..], span2
)) = method_call
!(recv
) {
2105 match (name
, args
) {
2106 ("as_mut", []) => option_as_ref_deref
::check(cx
, expr
, recv2
, m_arg
, true, msrv
),
2107 ("as_ref", []) => option_as_ref_deref
::check(cx
, expr
, recv2
, m_arg
, false, msrv
),
2108 ("filter", [f_arg
]) => {
2109 filter_map
::check(cx
, expr
, recv2
, f_arg
, span2
, recv
, m_arg
, span
, false);
2111 ("find", [f_arg
]) => filter_map
::check(cx
, expr
, recv2
, f_arg
, span2
, recv
, m_arg
, span
, true),
2115 map_identity
::check(cx
, expr
, recv
, m_arg
, span
);
2117 ("map_or", [def
, map
]) => option_map_or_none
::check(cx
, expr
, recv
, def
, map
),
2119 if let Some((name
, [recv
, args @
..], _
)) = method_call
!(recv
) {
2120 match (name
, args
) {
2121 ("filter", [arg
]) => filter_next
::check(cx
, expr
, recv
, arg
),
2122 ("filter_map", [arg
]) => filter_map_next
::check(cx
, expr
, recv
, arg
, msrv
),
2123 ("iter", []) => iter_next_slice
::check(cx
, expr
, recv
),
2124 ("skip", [arg
]) => iter_skip_next
::check(cx
, expr
, recv
, arg
),
2125 ("skip_while", [_
]) => skip_while_next
::check(cx
, expr
),
2130 ("nth", [n_arg
]) => match method_call
!(recv
) {
2131 Some(("bytes", [recv2
], _
)) => bytes_nth
::check(cx
, expr
, recv2
, n_arg
),
2132 Some(("iter", [recv2
], _
)) => iter_nth
::check(cx
, expr
, recv2
, recv
, n_arg
, false),
2133 Some(("iter_mut", [recv2
], _
)) => iter_nth
::check(cx
, expr
, recv2
, recv
, n_arg
, true),
2134 _
=> iter_nth_zero
::check(cx
, expr
, recv
, n_arg
),
2136 ("ok_or_else", [arg
]) => unnecessary_lazy_eval
::check(cx
, expr
, recv
, arg
, "ok_or"),
2137 ("or_else", [arg
]) => {
2138 if !bind_instead_of_map
::ResultOrElseErrInfo
::check(cx
, expr
, recv
, arg
) {
2139 unnecessary_lazy_eval
::check(cx
, expr
, recv
, arg
, "or");
2142 ("splitn" | "splitn_mut" | "rsplitn" | "rsplitn_mut", [count_arg
, _
]) => {
2143 suspicious_splitn
::check(cx
, name
, expr
, recv
, count_arg
);
2145 ("step_by", [arg
]) => iterator_step_by_zero
::check(cx
, expr
, arg
),
2146 ("to_os_string" | "to_owned" | "to_path_buf" | "to_vec", []) => {
2147 implicit_clone
::check(cx
, name
, expr
, recv
, span
);
2149 ("unwrap", []) => match method_call
!(recv
) {
2150 Some(("get", [recv
, get_arg
], _
)) => get_unwrap
::check(cx
, expr
, recv
, get_arg
, false),
2151 Some(("get_mut", [recv
, get_arg
], _
)) => get_unwrap
::check(cx
, expr
, recv
, get_arg
, true),
2152 _
=> unwrap_used
::check(cx
, expr
, recv
),
2154 ("unwrap_or", [u_arg
]) => match method_call
!(recv
) {
2155 Some((arith @
("checked_add" | "checked_sub" | "checked_mul"), [lhs
, rhs
], _
)) => {
2156 manual_saturating_arithmetic
::check(cx
, expr
, lhs
, rhs
, u_arg
, &arith
["checked_".len()..]);
2158 Some(("map", [m_recv
, m_arg
], span
)) => {
2159 option_map_unwrap_or
::check(cx
, expr
, m_recv
, m_arg
, recv
, u_arg
, span
);
2163 ("unwrap_or_else", [u_arg
]) => match method_call
!(recv
) {
2164 Some(("map", [recv
, map_arg
], _
)) if map_unwrap_or
::check(cx
, expr
, recv
, map_arg
, u_arg
, msrv
) => {}
,
2165 _
=> unnecessary_lazy_eval
::check(cx
, expr
, recv
, u_arg
, "unwrap_or"),
2172 fn check_is_some_is_none(cx
: &LateContext
<'_
>, expr
: &Expr
<'_
>, recv
: &Expr
<'_
>, is_some
: bool
) {
2173 if let Some((name @
("find" | "position" | "rposition"), [f_recv
, arg
], span
)) = method_call
!(recv
) {
2174 search_is_some
::check(cx
, expr
, name
, is_some
, f_recv
, arg
, recv
, span
);
2178 /// Used for `lint_binary_expr_with_method_call`.
2179 #[derive(Copy, Clone)]
2180 struct BinaryExprInfo
<'a
> {
2181 expr
: &'a hir
::Expr
<'a
>,
2182 chain
: &'a hir
::Expr
<'a
>,
2183 other
: &'a hir
::Expr
<'a
>,
2187 /// Checks for the `CHARS_NEXT_CMP` and `CHARS_LAST_CMP` lints.
2188 fn lint_binary_expr_with_method_call(cx
: &LateContext
<'_
>, info
: &mut BinaryExprInfo
<'_
>) {
2189 macro_rules
! lint_with_both_lhs_and_rhs
{
2190 ($func
:expr
, $cx
:expr
, $info
:ident
) => {
2191 if !$
func($cx
, $info
) {
2192 ::std
::mem
::swap(&mut $info
.chain
, &mut $info
.other
);
2193 if $
func($cx
, $info
) {
2200 lint_with_both_lhs_and_rhs
!(chars_next_cmp
::check
, cx
, info
);
2201 lint_with_both_lhs_and_rhs
!(chars_last_cmp
::check
, cx
, info
);
2202 lint_with_both_lhs_and_rhs
!(chars_next_cmp_with_unwrap
::check
, cx
, info
);
2203 lint_with_both_lhs_and_rhs
!(chars_last_cmp_with_unwrap
::check
, cx
, info
);
2206 const FN_HEADER
: hir
::FnHeader
= hir
::FnHeader
{
2207 unsafety
: hir
::Unsafety
::Normal
,
2208 constness
: hir
::Constness
::NotConst
,
2209 asyncness
: hir
::IsAsync
::NotAsync
,
2210 abi
: rustc_target
::spec
::abi
::Abi
::Rust
,
2213 struct ShouldImplTraitCase
{
2214 trait_name
: &'
static str,
2215 method_name
: &'
static str,
2217 fn_header
: hir
::FnHeader
,
2218 // implicit self kind expected (none, self, &self, ...)
2219 self_kind
: SelfKind
,
2220 // checks against the output type
2221 output_type
: OutType
,
2222 // certain methods with explicit lifetimes can't implement the equivalent trait method
2223 lint_explicit_lifetime
: bool
,
2225 impl ShouldImplTraitCase
{
2227 trait_name
: &'
static str,
2228 method_name
: &'
static str,
2230 fn_header
: hir
::FnHeader
,
2231 self_kind
: SelfKind
,
2232 output_type
: OutType
,
2233 lint_explicit_lifetime
: bool
,
2234 ) -> ShouldImplTraitCase
{
2235 ShouldImplTraitCase
{
2242 lint_explicit_lifetime
,
2246 fn lifetime_param_cond(&self, impl_item
: &hir
::ImplItem
<'_
>) -> bool
{
2247 self.lint_explicit_lifetime
2248 || !impl_item
.generics
.params
.iter().any(|p
| {
2251 hir
::GenericParamKind
::Lifetime
{
2252 kind
: hir
::LifetimeParamKind
::Explicit
2260 const TRAIT_METHODS
: [ShouldImplTraitCase
; 30] = [
2261 ShouldImplTraitCase
::new("std::ops::Add", "add", 2, FN_HEADER
, SelfKind
::Value
, OutType
::Any
, true),
2262 ShouldImplTraitCase
::new("std::convert::AsMut", "as_mut", 1, FN_HEADER
, SelfKind
::RefMut
, OutType
::Ref
, true),
2263 ShouldImplTraitCase
::new("std::convert::AsRef", "as_ref", 1, FN_HEADER
, SelfKind
::Ref
, OutType
::Ref
, true),
2264 ShouldImplTraitCase
::new("std::ops::BitAnd", "bitand", 2, FN_HEADER
, SelfKind
::Value
, OutType
::Any
, true),
2265 ShouldImplTraitCase
::new("std::ops::BitOr", "bitor", 2, FN_HEADER
, SelfKind
::Value
, OutType
::Any
, true),
2266 ShouldImplTraitCase
::new("std::ops::BitXor", "bitxor", 2, FN_HEADER
, SelfKind
::Value
, OutType
::Any
, true),
2267 ShouldImplTraitCase
::new("std::borrow::Borrow", "borrow", 1, FN_HEADER
, SelfKind
::Ref
, OutType
::Ref
, true),
2268 ShouldImplTraitCase
::new("std::borrow::BorrowMut", "borrow_mut", 1, FN_HEADER
, SelfKind
::RefMut
, OutType
::Ref
, true),
2269 ShouldImplTraitCase
::new("std::clone::Clone", "clone", 1, FN_HEADER
, SelfKind
::Ref
, OutType
::Any
, true),
2270 ShouldImplTraitCase
::new("std::cmp::Ord", "cmp", 2, FN_HEADER
, SelfKind
::Ref
, OutType
::Any
, true),
2271 // FIXME: default doesn't work
2272 ShouldImplTraitCase
::new("std::default::Default", "default", 0, FN_HEADER
, SelfKind
::No
, OutType
::Any
, true),
2273 ShouldImplTraitCase
::new("std::ops::Deref", "deref", 1, FN_HEADER
, SelfKind
::Ref
, OutType
::Ref
, true),
2274 ShouldImplTraitCase
::new("std::ops::DerefMut", "deref_mut", 1, FN_HEADER
, SelfKind
::RefMut
, OutType
::Ref
, true),
2275 ShouldImplTraitCase
::new("std::ops::Div", "div", 2, FN_HEADER
, SelfKind
::Value
, OutType
::Any
, true),
2276 ShouldImplTraitCase
::new("std::ops::Drop", "drop", 1, FN_HEADER
, SelfKind
::RefMut
, OutType
::Unit
, true),
2277 ShouldImplTraitCase
::new("std::cmp::PartialEq", "eq", 2, FN_HEADER
, SelfKind
::Ref
, OutType
::Bool
, true),
2278 ShouldImplTraitCase
::new("std::iter::FromIterator", "from_iter", 1, FN_HEADER
, SelfKind
::No
, OutType
::Any
, true),
2279 ShouldImplTraitCase
::new("std::str::FromStr", "from_str", 1, FN_HEADER
, SelfKind
::No
, OutType
::Any
, true),
2280 ShouldImplTraitCase
::new("std::hash::Hash", "hash", 2, FN_HEADER
, SelfKind
::Ref
, OutType
::Unit
, true),
2281 ShouldImplTraitCase
::new("std::ops::Index", "index", 2, FN_HEADER
, SelfKind
::Ref
, OutType
::Ref
, true),
2282 ShouldImplTraitCase
::new("std::ops::IndexMut", "index_mut", 2, FN_HEADER
, SelfKind
::RefMut
, OutType
::Ref
, true),
2283 ShouldImplTraitCase
::new("std::iter::IntoIterator", "into_iter", 1, FN_HEADER
, SelfKind
::Value
, OutType
::Any
, true),
2284 ShouldImplTraitCase
::new("std::ops::Mul", "mul", 2, FN_HEADER
, SelfKind
::Value
, OutType
::Any
, true),
2285 ShouldImplTraitCase
::new("std::ops::Neg", "neg", 1, FN_HEADER
, SelfKind
::Value
, OutType
::Any
, true),
2286 ShouldImplTraitCase
::new("std::iter::Iterator", "next", 1, FN_HEADER
, SelfKind
::RefMut
, OutType
::Any
, false),
2287 ShouldImplTraitCase
::new("std::ops::Not", "not", 1, FN_HEADER
, SelfKind
::Value
, OutType
::Any
, true),
2288 ShouldImplTraitCase
::new("std::ops::Rem", "rem", 2, FN_HEADER
, SelfKind
::Value
, OutType
::Any
, true),
2289 ShouldImplTraitCase
::new("std::ops::Shl", "shl", 2, FN_HEADER
, SelfKind
::Value
, OutType
::Any
, true),
2290 ShouldImplTraitCase
::new("std::ops::Shr", "shr", 2, FN_HEADER
, SelfKind
::Value
, OutType
::Any
, true),
2291 ShouldImplTraitCase
::new("std::ops::Sub", "sub", 2, FN_HEADER
, SelfKind
::Value
, OutType
::Any
, true),
2294 #[derive(Clone, Copy, PartialEq, Debug)]
2303 fn matches
<'a
>(self, cx
: &LateContext
<'a
>, parent_ty
: Ty
<'a
>, ty
: Ty
<'a
>) -> bool
{
2304 fn matches_value
<'a
>(cx
: &LateContext
<'a
>, parent_ty
: Ty
<'_
>, ty
: Ty
<'_
>) -> bool
{
2305 if ty
== parent_ty
{
2307 } else if ty
.is_box() {
2308 ty
.boxed_ty() == parent_ty
2309 } else if is_type_diagnostic_item(cx
, ty
, sym
::Rc
) || is_type_diagnostic_item(cx
, ty
, sym
::Arc
) {
2310 if let ty
::Adt(_
, substs
) = ty
.kind() {
2311 substs
.types().next().map_or(false, |t
| t
== parent_ty
)
2320 fn matches_ref
<'a
>(cx
: &LateContext
<'a
>, mutability
: hir
::Mutability
, parent_ty
: Ty
<'a
>, ty
: Ty
<'a
>) -> bool
{
2321 if let ty
::Ref(_
, t
, m
) = *ty
.kind() {
2322 return m
== mutability
&& t
== parent_ty
;
2325 let trait_path
= match mutability
{
2326 hir
::Mutability
::Not
=> &paths
::ASREF_TRAIT
,
2327 hir
::Mutability
::Mut
=> &paths
::ASMUT_TRAIT
,
2330 let trait_def_id
= match get_trait_def_id(cx
, trait_path
) {
2332 None
=> return false,
2334 implements_trait(cx
, ty
, trait_def_id
, &[parent_ty
.into()])
2338 Self::Value
=> matches_value(cx
, parent_ty
, ty
),
2339 Self::Ref
=> matches_ref(cx
, hir
::Mutability
::Not
, parent_ty
, ty
) || ty
== parent_ty
&& is_copy(cx
, ty
),
2340 Self::RefMut
=> matches_ref(cx
, hir
::Mutability
::Mut
, parent_ty
, ty
),
2341 Self::No
=> ty
!= parent_ty
,
2346 fn description(self) -> &'
static str {
2348 Self::Value
=> "`self` by value",
2349 Self::Ref
=> "`self` by reference",
2350 Self::RefMut
=> "`self` by mutable reference",
2351 Self::No
=> "no `self`",
2356 #[derive(Clone, Copy)]
2365 fn matches(self, ty
: &hir
::FnRetTy
<'_
>) -> bool
{
2366 let is_unit
= |ty
: &hir
::Ty
<'_
>| matches
!(ty
.kind
, hir
::TyKind
::Tup(&[]));
2368 (Self::Unit
, &hir
::FnRetTy
::DefaultReturn(_
)) => true,
2369 (Self::Unit
, &hir
::FnRetTy
::Return(ty
)) if is_unit(ty
) => true,
2370 (Self::Bool
, &hir
::FnRetTy
::Return(ty
)) if is_bool(ty
) => true,
2371 (Self::Any
, &hir
::FnRetTy
::Return(ty
)) if !is_unit(ty
) => true,
2372 (Self::Ref
, &hir
::FnRetTy
::Return(ty
)) => matches
!(ty
.kind
, hir
::TyKind
::Rptr(_
, _
)),
2378 fn is_bool(ty
: &hir
::Ty
<'_
>) -> bool
{
2379 if let hir
::TyKind
::Path(QPath
::Resolved(_
, path
)) = ty
.kind
{
2380 matches
!(path
.res
, Res
::PrimTy(PrimTy
::Bool
))
2386 fn fn_header_equals(expected
: hir
::FnHeader
, actual
: hir
::FnHeader
) -> bool
{
2387 expected
.constness
== actual
.constness
2388 && expected
.unsafety
== actual
.unsafety
2389 && expected
.asyncness
== actual
.asyncness