user0/rust
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Merge commit '9f9a822509' into clippy-subtree-update

Browse source
This commit is contained in:
Philipp Krones 2025-02-28 23:20:48 +01:00
parent 222aaba5a1
commit fe01c44995
2648 changed files with 35461 additions and 16191 deletions
Download patch file Download diff file Expand all files Collapse all files

51
tests/ui/unconditional_recursion.rs
View file

@ -15,11 +15,13 @@ enum Foo {
impl PartialEq for Foo {
fn ne(&self, other: &Self) -> bool {
//~^ ERROR: function cannot return without recursing
//~^ unconditional_recursion
self != other
}
fn eq(&self, other: &Self) -> bool {
//~^ ERROR: function cannot return without recursing
//~^ unconditional_recursion
self == other
}
}
@ -31,9 +33,11 @@ enum Foo2 {
impl PartialEq for Foo2 {
fn ne(&self, other: &Self) -> bool {
//~^ unconditional_recursion
self != &Foo2::B // no error here
}
fn eq(&self, other: &Self) -> bool {
//~^ unconditional_recursion
self == &Foo2::B // no error here
}
}
@ -45,11 +49,14 @@ enum Foo3 {
impl PartialEq for Foo3 {
fn ne(&self, other: &Self) -> bool {
//~^ ERROR: function cannot return without recursing
//~^ unconditional_recursion
//~| ERROR: function cannot return without recursing
self.ne(other)
}
fn eq(&self, other: &Self) -> bool {
//~^ ERROR: function cannot return without recursing
//~^ unconditional_recursion
//~| ERROR: function cannot return without recursing
self.eq(other)
}
}
@ -93,11 +100,13 @@ struct S;
// Check the order doesn't matter.
impl PartialEq for S {
fn ne(&self, other: &Self) -> bool {
//~^ ERROR: function cannot return without recursing
//~^ unconditional_recursion
other != self
}
fn eq(&self, other: &Self) -> bool {
//~^ ERROR: function cannot return without recursing
//~^ unconditional_recursion
other == self
}
}
@ -107,12 +116,16 @@ struct S2;
// Check that if the same element is compared, it's also triggering the lint.
impl PartialEq for S2 {
fn ne(&self, other: &Self) -> bool {
//~^ ERROR: function cannot return without recursing
//~^ unconditional_recursion
other != other
//~^ eq_op
}
fn eq(&self, other: &Self) -> bool {
//~^ ERROR: function cannot return without recursing
//~^ unconditional_recursion
other == other
//~^ eq_op
}
}
@ -120,12 +133,16 @@ struct S3;
impl PartialEq for S3 {
fn ne(&self, _other: &Self) -> bool {
//~^ ERROR: function cannot return without recursing
//~^ unconditional_recursion
self != self
//~^ eq_op
}
fn eq(&self, _other: &Self) -> bool {
//~^ ERROR: function cannot return without recursing
//~^ unconditional_recursion
self == self
//~^ eq_op
}
}
@ -152,7 +169,8 @@ macro_rules! impl_partial_eq {
($ty:ident) => {
impl PartialEq for $ty {
fn eq(&self, other: &Self) -> bool {
//~^ ERROR: function cannot return without recursing
//~^ unconditional_recursion
self == other
}
}
@ -181,7 +199,8 @@ struct S7<'a> {
impl<'a> PartialEq for S7<'a> {
fn eq(&self, other: &Self) -> bool {
//~^ ERROR: function cannot return without recursing
//~^ unconditional_recursion
let mine = &self.field;
let theirs = &other.field;
mine == theirs
@ -250,7 +269,8 @@ impl std::default::Default for S12 {
impl S12 {
fn new() -> Self {
//~^ ERROR: function cannot return without recursing
//~^ unconditional_recursion
Self::default()
}
@ -289,7 +309,8 @@ struct S15<'a> {
impl PartialEq for S15<'_> {
fn eq(&self, other: &Self) -> bool {
//~^ ERROR: function cannot return without recursing
//~^ unconditional_recursion
let mine = &self.field;
let theirs = &other.field;
mine.eq(theirs)
@ -360,6 +381,7 @@ struct BadFromTy1<'a>(&'a ());
struct BadIntoTy1<'b>(&'b ());
impl<'a> From<BadFromTy1<'a>> for BadIntoTy1<'static> {
fn from(f: BadFromTy1<'a>) -> Self {
//~^ unconditional_recursion
f.into()
}
}
@ -369,6 +391,7 @@ struct BadFromTy2<'a>(&'a ());
struct BadIntoTy2<'b>(&'b ());
impl<'a> From<BadFromTy2<'a>> for BadIntoTy2<'static> {
fn from(f: BadFromTy2<'a>) -> Self {
//~^ unconditional_recursion
Into::into(f)
}
}