Trait core::cmp::PartialEq

#[lang = "eq"]
pub trait PartialEq<Rhs: ?Sized = Self> {
#[must_use]
    fn eq(&self, other: &Rhs) -> bool;

#[must_use]
    fn ne(&self, other: &Rhs) -> bool { ... }
}

Trait for equality comparisons which are partial equivalence relations.

This trait allows for partial equality, for types that do not have a full equivalence relation. For example, in floating point numbers NaN != NaN, so floating point types implement PartialEq but not Eq.

Formally, the equality must be (for all a, b and c):

• symmetric: a == b implies b == a; and
• transitive: a == b and b == c implies a == c.

Note that these requirements mean that the trait itself must be implemented symmetrically and transitively: if T: PartialEq<U> and U: PartialEq<V> then U: PartialEq<T> and T: PartialEq<V>.

Derivable

This trait can be used with #[derive]. When derived on structs, two instances are equal if all fields are equal, and not equal if any fields are not equal. When derived on enums, each variant is equal to itself and not equal to the other variants.

How can I implement PartialEq?

PartialEq only requires the eq method to be implemented; ne is defined in terms of it by default. Any manual implementation of ne must respect the rule that eq is a strict inverse of ne; that is, !(a == b) if and only if a != b.

Implementations of PartialEq, PartialOrd, and Ord must agree with each other. It's easy to accidentally make them disagree by deriving some of the traits and manually implementing others.

An example implementation for a domain in which two books are considered the same book if their ISBN matches, even if the formats differ:

enum BookFormat {
    Paperback,
    Hardback,
    Ebook,
}

struct Book {
    isbn: i32,
    format: BookFormat,
}

impl PartialEq for Book {
    fn eq(&self, other: &Self) -> bool {
        self.isbn == other.isbn
    }
}

let b1 = Book { isbn: 3, format: BookFormat::Paperback };
let b2 = Book { isbn: 3, format: BookFormat::Ebook };
let b3 = Book { isbn: 10, format: BookFormat::Paperback };

assert!(b1 == b2);
assert!(b1 != b3);

How can I compare two different types?

The type you can compare with is controlled by PartialEq's type parameter. For example, let's tweak our previous code a bit:

// The derive implements <BookFormat> == <BookFormat> comparisons
#[derive(PartialEq)]
enum BookFormat {
    Paperback,
    Hardback,
    Ebook,
}

struct Book {
    isbn: i32,
    format: BookFormat,
}

// Implement <Book> == <BookFormat> comparisons
impl PartialEq<BookFormat> for Book {
    fn eq(&self, other: &BookFormat) -> bool {
        self.format == *other
    }
}

// Implement <BookFormat> == <Book> comparisons
impl PartialEq<Book> for BookFormat {
    fn eq(&self, other: &Book) -> bool {
        *self == other.format
    }
}

let b1 = Book { isbn: 3, format: BookFormat::Paperback };

assert!(b1 == BookFormat::Paperback);
assert!(BookFormat::Ebook != b1);

By changing impl PartialEq for Book to impl PartialEq<BookFormat> for Book, we allow BookFormats to be compared with Books.

You can also combine these implementations to let the == operator work with two different types:

#[derive(PartialEq)]
enum BookFormat {
    Paperback,
    Hardback,
    Ebook,
}

struct Book {
    isbn: i32,
    format: BookFormat,
}

impl PartialEq<BookFormat> for Book {
    fn eq(&self, other: &BookFormat) -> bool {
        self.format == *other
    }
}

impl PartialEq<Book> for BookFormat {
    fn eq(&self, other: &Book) -> bool {
        *self == other.format
    }
}

impl PartialEq for Book {
    fn eq(&self, other: &Book) -> bool {
        self.isbn == other.isbn
    }
}

let b1 = Book { isbn: 3, format: BookFormat::Paperback };
let b2 = Book { isbn: 3, format: BookFormat::Ebook };

assert!(b1 == BookFormat::Paperback);
assert!(BookFormat::Ebook != b1);
assert!(b1 == b2);

Examples

let x: u32 = 0;
let y: u32 = 1;

assert_eq!(x == y, false);
assert_eq!(x.eq(&y), false);

Required methods

#[must_use] fn eq(&self, other: &Rhs) -> bool

This method tests for self and other values to be equal, and is used by ==.

Loading content...

Provided methods

#[must_use] fn ne(&self, other: &Rhs) -> bool

This method tests for !=.

Loading content...

Implementors

impl PartialEq<!> for !

fn eq(&self, _: &!) -> bool

impl PartialEq<()> for ()

fn eq(&self, _other: &()) -> bool

fn ne(&self, _other: &()) -> bool

impl PartialEq<Ordering> for core::cmp::Ordering

fn eq(&self, other: &Ordering) -> bool

impl PartialEq<Infallible> for Infallible

fn eq(&self, _: &Infallible) -> bool

impl PartialEq<FpCategory> for FpCategory

fn eq(&self, other: &FpCategory) -> bool

impl PartialEq<IntErrorKind> for IntErrorKind

fn eq(&self, other: &IntErrorKind) -> bool

impl PartialEq<SearchStep> for SearchStep

fn eq(&self, other: &SearchStep) -> bool

fn ne(&self, other: &SearchStep) -> bool

impl PartialEq<Ordering> for core::sync::atomic::Ordering

fn eq(&self, other: &Ordering) -> bool

impl PartialEq<AllocErr> for AllocErr

fn eq(&self, other: &AllocErr) -> bool

impl PartialEq<CannotReallocInPlace> for CannotReallocInPlace

fn eq(&self, other: &CannotReallocInPlace) -> bool

impl PartialEq<Layout> for Layout

fn eq(&self, other: &Layout) -> bool

fn ne(&self, other: &Layout) -> bool

impl PartialEq<LayoutErr> for LayoutErr

fn eq(&self, other: &LayoutErr) -> bool

fn ne(&self, other: &LayoutErr) -> bool

impl PartialEq<TypeId> for TypeId

fn eq(&self, other: &TypeId) -> bool

fn ne(&self, other: &TypeId) -> bool

impl PartialEq<CpuidResult> for CpuidResult

fn eq(&self, other: &CpuidResult) -> bool

fn ne(&self, other: &CpuidResult) -> bool

impl PartialEq<CharTryFromError> for CharTryFromError

fn eq(&self, other: &CharTryFromError) -> bool

fn ne(&self, other: &CharTryFromError) -> bool

impl PartialEq<DecodeUtf16Error> for DecodeUtf16Error

fn eq(&self, other: &DecodeUtf16Error) -> bool

fn ne(&self, other: &DecodeUtf16Error) -> bool

impl PartialEq<ParseCharError> for ParseCharError

fn eq(&self, other: &ParseCharError) -> bool

fn ne(&self, other: &ParseCharError) -> bool

impl PartialEq<UnicodeVersion> for UnicodeVersion

fn eq(&self, other: &UnicodeVersion) -> bool

fn ne(&self, other: &UnicodeVersion) -> bool

impl PartialEq<Error> for Error

fn eq(&self, other: &Error) -> bool

impl PartialEq<PhantomPinned> for PhantomPinned

fn eq(&self, other: &PhantomPinned) -> bool

impl PartialEq<NonZeroI128> for NonZeroI128

fn eq(&self, other: &NonZeroI128) -> bool

fn ne(&self, other: &NonZeroI128) -> bool

impl PartialEq<NonZeroI16> for NonZeroI16

fn eq(&self, other: &NonZeroI16) -> bool

fn ne(&self, other: &NonZeroI16) -> bool

impl PartialEq<NonZeroI32> for NonZeroI32

fn eq(&self, other: &NonZeroI32) -> bool

fn ne(&self, other: &NonZeroI32) -> bool

impl PartialEq<NonZeroI64> for NonZeroI64

fn eq(&self, other: &NonZeroI64) -> bool

fn ne(&self, other: &NonZeroI64) -> bool

impl PartialEq<NonZeroI8> for NonZeroI8

fn eq(&self, other: &NonZeroI8) -> bool

fn ne(&self, other: &NonZeroI8) -> bool

impl PartialEq<NonZeroIsize> for NonZeroIsize

fn eq(&self, other: &NonZeroIsize) -> bool

fn ne(&self, other: &NonZeroIsize) -> bool

impl PartialEq<NonZeroU128> for NonZeroU128

fn eq(&self, other: &NonZeroU128) -> bool

fn ne(&self, other: &NonZeroU128) -> bool

impl PartialEq<NonZeroU16> for NonZeroU16

fn eq(&self, other: &NonZeroU16) -> bool

fn ne(&self, other: &NonZeroU16) -> bool

impl PartialEq<NonZeroU32> for NonZeroU32

fn eq(&self, other: &NonZeroU32) -> bool

fn ne(&self, other: &NonZeroU32) -> bool

impl PartialEq<NonZeroU64> for NonZeroU64

fn eq(&self, other: &NonZeroU64) -> bool

fn ne(&self, other: &NonZeroU64) -> bool

impl PartialEq<NonZeroU8> for NonZeroU8

fn eq(&self, other: &NonZeroU8) -> bool

fn ne(&self, other: &NonZeroU8) -> bool

impl PartialEq<NonZeroUsize> for NonZeroUsize

fn eq(&self, other: &NonZeroUsize) -> bool

fn ne(&self, other: &NonZeroUsize) -> bool

impl PartialEq<ParseFloatError> for ParseFloatError

fn eq(&self, other: &ParseFloatError) -> bool

fn ne(&self, other: &ParseFloatError) -> bool

impl PartialEq<ParseIntError> for ParseIntError

fn eq(&self, other: &ParseIntError) -> bool

fn ne(&self, other: &ParseIntError) -> bool

impl PartialEq<TryFromIntError> for TryFromIntError

fn eq(&self, other: &TryFromIntError) -> bool

fn ne(&self, other: &TryFromIntError) -> bool

impl PartialEq<RangeFull> for RangeFull

fn eq(&self, other: &RangeFull) -> bool

impl PartialEq<NoneError> for NoneError

fn eq(&self, other: &NoneError) -> bool

impl PartialEq<ParseBoolError> for ParseBoolError

fn eq(&self, other: &ParseBoolError) -> bool

fn ne(&self, other: &ParseBoolError) -> bool

impl PartialEq<Utf8Error> for Utf8Error

fn eq(&self, other: &Utf8Error) -> bool

fn ne(&self, other: &Utf8Error) -> bool

impl PartialEq<RawWaker> for RawWaker

fn eq(&self, other: &RawWaker) -> bool

fn ne(&self, other: &RawWaker) -> bool

impl PartialEq<RawWakerVTable> for RawWakerVTable

fn eq(&self, other: &RawWakerVTable) -> bool

fn ne(&self, other: &RawWakerVTable) -> bool

impl PartialEq<Duration> for Duration

fn eq(&self, other: &Duration) -> bool

fn ne(&self, other: &Duration) -> bool

impl PartialEq<bool> for bool

fn eq(&self, other: &bool) -> bool

fn ne(&self, other: &bool) -> bool

impl PartialEq<char> for char

fn eq(&self, other: &char) -> bool

fn ne(&self, other: &char) -> bool

impl PartialEq<f32> for f32

fn eq(&self, other: &f32) -> bool

fn ne(&self, other: &f32) -> bool

impl PartialEq<f64> for f64

fn eq(&self, other: &f64) -> bool

fn ne(&self, other: &f64) -> bool

impl PartialEq<i128> for i128

fn eq(&self, other: &i128) -> bool

fn ne(&self, other: &i128) -> bool

impl PartialEq<i16> for i16

fn eq(&self, other: &i16) -> bool

fn ne(&self, other: &i16) -> bool

impl PartialEq<i32> for i32

fn eq(&self, other: &i32) -> bool

fn ne(&self, other: &i32) -> bool

impl PartialEq<i64> for i64

fn eq(&self, other: &i64) -> bool

fn ne(&self, other: &i64) -> bool

impl PartialEq<i8> for i8

fn eq(&self, other: &i8) -> bool

fn ne(&self, other: &i8) -> bool

impl PartialEq<isize> for isize

fn eq(&self, other: &isize) -> bool

fn ne(&self, other: &isize) -> bool

impl PartialEq<str> for str

fn eq(&self, other: &str) -> bool

fn ne(&self, other: &str) -> bool

impl PartialEq<u128> for u128

fn eq(&self, other: &u128) -> bool

fn ne(&self, other: &u128) -> bool

impl PartialEq<u16> for u16

fn eq(&self, other: &u16) -> bool

fn ne(&self, other: &u16) -> bool

impl PartialEq<u32> for u32

fn eq(&self, other: &u32) -> bool

fn ne(&self, other: &u32) -> bool

impl PartialEq<u64> for u64

fn eq(&self, other: &u64) -> bool

fn ne(&self, other: &u64) -> bool

impl PartialEq<u8> for u8

fn eq(&self, other: &u8) -> bool

fn ne(&self, other: &u8) -> bool

impl PartialEq<usize> for usize

fn eq(&self, other: &usize) -> bool

fn ne(&self, other: &usize) -> bool

impl<'_, '_, A: ?Sized, B: ?Sized> PartialEq<&'_ B> for &'_ A where
    A: PartialEq<B>, 

fn eq(&self, other: &&B) -> bool

fn ne(&self, other: &&B) -> bool

impl<'_, '_, A: ?Sized, B: ?Sized> PartialEq<&'_ B> for &'_ mut A where
    A: PartialEq<B>, 

fn eq(&self, other: &&B) -> bool

fn ne(&self, other: &&B) -> bool

impl<'_, '_, A: ?Sized, B: ?Sized> PartialEq<&'_ mut B> for &'_ A where
    A: PartialEq<B>, 

fn eq(&self, other: &&mut B) -> bool

fn ne(&self, other: &&mut B) -> bool

impl<'_, '_, A: ?Sized, B: ?Sized> PartialEq<&'_ mut B> for &'_ mut A where
    A: PartialEq<B>, 

fn eq(&self, other: &&mut B) -> bool

fn ne(&self, other: &&mut B) -> bool

impl<'a> PartialEq<Utf8LossyChunk<'a>> for Utf8LossyChunk<'a>

fn eq(&self, other: &Utf8LossyChunk<'a>) -> bool

fn ne(&self, other: &Utf8LossyChunk<'a>) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b [B]> for [A; 0] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b [B]) -> bool

fn ne(&self, other: &&'b [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b [B]> for [A; 1] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b [B]) -> bool

fn ne(&self, other: &&'b [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b [B]> for [A; 2] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b [B]) -> bool

fn ne(&self, other: &&'b [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b [B]> for [A; 3] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b [B]) -> bool

fn ne(&self, other: &&'b [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b [B]> for [A; 4] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b [B]) -> bool

fn ne(&self, other: &&'b [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b [B]> for [A; 5] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b [B]) -> bool

fn ne(&self, other: &&'b [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b [B]> for [A; 6] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b [B]) -> bool

fn ne(&self, other: &&'b [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b [B]> for [A; 7] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b [B]) -> bool

fn ne(&self, other: &&'b [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b [B]> for [A; 8] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b [B]) -> bool

fn ne(&self, other: &&'b [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b [B]> for [A; 9] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b [B]) -> bool

fn ne(&self, other: &&'b [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b [B]> for [A; 10] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b [B]) -> bool

fn ne(&self, other: &&'b [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b [B]> for [A; 11] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b [B]) -> bool

fn ne(&self, other: &&'b [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b [B]> for [A; 12] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b [B]) -> bool

fn ne(&self, other: &&'b [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b [B]> for [A; 13] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b [B]) -> bool

fn ne(&self, other: &&'b [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b [B]> for [A; 14] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b [B]) -> bool

fn ne(&self, other: &&'b [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b [B]> for [A; 15] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b [B]) -> bool

fn ne(&self, other: &&'b [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b [B]> for [A; 16] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b [B]) -> bool

fn ne(&self, other: &&'b [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b [B]> for [A; 17] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b [B]) -> bool

fn ne(&self, other: &&'b [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b [B]> for [A; 18] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b [B]) -> bool

fn ne(&self, other: &&'b [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b [B]> for [A; 19] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b [B]) -> bool

fn ne(&self, other: &&'b [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b [B]> for [A; 20] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b [B]) -> bool

fn ne(&self, other: &&'b [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b [B]> for [A; 21] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b [B]) -> bool

fn ne(&self, other: &&'b [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b [B]> for [A; 22] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b [B]) -> bool

fn ne(&self, other: &&'b [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b [B]> for [A; 23] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b [B]) -> bool

fn ne(&self, other: &&'b [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b [B]> for [A; 24] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b [B]) -> bool

fn ne(&self, other: &&'b [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b [B]> for [A; 25] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b [B]) -> bool

fn ne(&self, other: &&'b [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b [B]> for [A; 26] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b [B]) -> bool

fn ne(&self, other: &&'b [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b [B]> for [A; 27] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b [B]) -> bool

fn ne(&self, other: &&'b [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b [B]> for [A; 28] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b [B]) -> bool

fn ne(&self, other: &&'b [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b [B]> for [A; 29] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b [B]) -> bool

fn ne(&self, other: &&'b [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b [B]> for [A; 30] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b [B]) -> bool

fn ne(&self, other: &&'b [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b [B]> for [A; 31] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b [B]) -> bool

fn ne(&self, other: &&'b [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b [B]> for [A; 32] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b [B]) -> bool

fn ne(&self, other: &&'b [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b mut [B]> for [A; 0] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b mut [B]) -> bool

fn ne(&self, other: &&'b mut [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b mut [B]> for [A; 1] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b mut [B]) -> bool

fn ne(&self, other: &&'b mut [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b mut [B]> for [A; 2] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b mut [B]) -> bool

fn ne(&self, other: &&'b mut [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b mut [B]> for [A; 3] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b mut [B]) -> bool

fn ne(&self, other: &&'b mut [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b mut [B]> for [A; 4] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b mut [B]) -> bool

fn ne(&self, other: &&'b mut [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b mut [B]> for [A; 5] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b mut [B]) -> bool

fn ne(&self, other: &&'b mut [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b mut [B]> for [A; 6] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b mut [B]) -> bool

fn ne(&self, other: &&'b mut [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b mut [B]> for [A; 7] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b mut [B]) -> bool

fn ne(&self, other: &&'b mut [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b mut [B]> for [A; 8] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b mut [B]) -> bool

fn ne(&self, other: &&'b mut [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b mut [B]> for [A; 9] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b mut [B]) -> bool

fn ne(&self, other: &&'b mut [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b mut [B]> for [A; 10] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b mut [B]) -> bool

fn ne(&self, other: &&'b mut [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b mut [B]> for [A; 11] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b mut [B]) -> bool

fn ne(&self, other: &&'b mut [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b mut [B]> for [A; 12] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b mut [B]) -> bool

fn ne(&self, other: &&'b mut [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b mut [B]> for [A; 13] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b mut [B]) -> bool

fn ne(&self, other: &&'b mut [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b mut [B]> for [A; 14] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b mut [B]) -> bool

fn ne(&self, other: &&'b mut [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b mut [B]> for [A; 15] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b mut [B]) -> bool

fn ne(&self, other: &&'b mut [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b mut [B]> for [A; 16] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b mut [B]) -> bool

fn ne(&self, other: &&'b mut [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b mut [B]> for [A; 17] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b mut [B]) -> bool

fn ne(&self, other: &&'b mut [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b mut [B]> for [A; 18] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b mut [B]) -> bool

fn ne(&self, other: &&'b mut [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b mut [B]> for [A; 19] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b mut [B]) -> bool

fn ne(&self, other: &&'b mut [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b mut [B]> for [A; 20] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b mut [B]) -> bool

fn ne(&self, other: &&'b mut [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b mut [B]> for [A; 21] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b mut [B]) -> bool

fn ne(&self, other: &&'b mut [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b mut [B]> for [A; 22] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b mut [B]) -> bool

fn ne(&self, other: &&'b mut [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b mut [B]> for [A; 23] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b mut [B]) -> bool

fn ne(&self, other: &&'b mut [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b mut [B]> for [A; 24] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b mut [B]) -> bool

fn ne(&self, other: &&'b mut [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b mut [B]> for [A; 25] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b mut [B]) -> bool

fn ne(&self, other: &&'b mut [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b mut [B]> for [A; 26] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b mut [B]) -> bool

fn ne(&self, other: &&'b mut [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b mut [B]> for [A; 27] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b mut [B]) -> bool

fn ne(&self, other: &&'b mut [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b mut [B]> for [A; 28] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b mut [B]) -> bool

fn ne(&self, other: &&'b mut [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b mut [B]> for [A; 29] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b mut [B]) -> bool

fn ne(&self, other: &&'b mut [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b mut [B]> for [A; 30] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b mut [B]) -> bool

fn ne(&self, other: &&'b mut [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b mut [B]> for [A; 31] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b mut [B]) -> bool

fn ne(&self, other: &&'b mut [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<&'b mut [B]> for [A; 32] where
    A: PartialEq<B>, 

fn eq(&self, other: &&'b mut [B]) -> bool

fn ne(&self, other: &&'b mut [B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 0]> for [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 0]) -> bool

fn ne(&self, other: &[A; 0]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 0]> for &'b [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 0]) -> bool

fn ne(&self, other: &[A; 0]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 0]> for &'b mut [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 0]) -> bool

fn ne(&self, other: &[A; 0]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 1]> for [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 1]) -> bool

fn ne(&self, other: &[A; 1]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 1]> for &'b [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 1]) -> bool

fn ne(&self, other: &[A; 1]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 1]> for &'b mut [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 1]) -> bool

fn ne(&self, other: &[A; 1]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 2]> for [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 2]) -> bool

fn ne(&self, other: &[A; 2]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 2]> for &'b [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 2]) -> bool

fn ne(&self, other: &[A; 2]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 2]> for &'b mut [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 2]) -> bool

fn ne(&self, other: &[A; 2]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 3]> for [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 3]) -> bool

fn ne(&self, other: &[A; 3]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 3]> for &'b [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 3]) -> bool

fn ne(&self, other: &[A; 3]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 3]> for &'b mut [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 3]) -> bool

fn ne(&self, other: &[A; 3]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 4]> for [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 4]) -> bool

fn ne(&self, other: &[A; 4]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 4]> for &'b [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 4]) -> bool

fn ne(&self, other: &[A; 4]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 4]> for &'b mut [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 4]) -> bool

fn ne(&self, other: &[A; 4]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 5]> for [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 5]) -> bool

fn ne(&self, other: &[A; 5]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 5]> for &'b [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 5]) -> bool

fn ne(&self, other: &[A; 5]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 5]> for &'b mut [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 5]) -> bool

fn ne(&self, other: &[A; 5]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 6]> for [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 6]) -> bool

fn ne(&self, other: &[A; 6]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 6]> for &'b [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 6]) -> bool

fn ne(&self, other: &[A; 6]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 6]> for &'b mut [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 6]) -> bool

fn ne(&self, other: &[A; 6]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 7]> for [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 7]) -> bool

fn ne(&self, other: &[A; 7]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 7]> for &'b [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 7]) -> bool

fn ne(&self, other: &[A; 7]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 7]> for &'b mut [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 7]) -> bool

fn ne(&self, other: &[A; 7]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 8]> for [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 8]) -> bool

fn ne(&self, other: &[A; 8]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 8]> for &'b [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 8]) -> bool

fn ne(&self, other: &[A; 8]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 8]> for &'b mut [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 8]) -> bool

fn ne(&self, other: &[A; 8]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 9]> for [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 9]) -> bool

fn ne(&self, other: &[A; 9]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 9]> for &'b [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 9]) -> bool

fn ne(&self, other: &[A; 9]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 9]> for &'b mut [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 9]) -> bool

fn ne(&self, other: &[A; 9]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 10]> for [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 10]) -> bool

fn ne(&self, other: &[A; 10]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 10]> for &'b [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 10]) -> bool

fn ne(&self, other: &[A; 10]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 10]> for &'b mut [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 10]) -> bool

fn ne(&self, other: &[A; 10]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 11]> for [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 11]) -> bool

fn ne(&self, other: &[A; 11]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 11]> for &'b [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 11]) -> bool

fn ne(&self, other: &[A; 11]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 11]> for &'b mut [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 11]) -> bool

fn ne(&self, other: &[A; 11]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 12]> for [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 12]) -> bool

fn ne(&self, other: &[A; 12]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 12]> for &'b [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 12]) -> bool

fn ne(&self, other: &[A; 12]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 12]> for &'b mut [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 12]) -> bool

fn ne(&self, other: &[A; 12]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 13]> for [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 13]) -> bool

fn ne(&self, other: &[A; 13]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 13]> for &'b [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 13]) -> bool

fn ne(&self, other: &[A; 13]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 13]> for &'b mut [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 13]) -> bool

fn ne(&self, other: &[A; 13]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 14]> for [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 14]) -> bool

fn ne(&self, other: &[A; 14]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 14]> for &'b [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 14]) -> bool

fn ne(&self, other: &[A; 14]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 14]> for &'b mut [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 14]) -> bool

fn ne(&self, other: &[A; 14]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 15]> for [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 15]) -> bool

fn ne(&self, other: &[A; 15]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 15]> for &'b [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 15]) -> bool

fn ne(&self, other: &[A; 15]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 15]> for &'b mut [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 15]) -> bool

fn ne(&self, other: &[A; 15]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 16]> for [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 16]) -> bool

fn ne(&self, other: &[A; 16]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 16]> for &'b [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 16]) -> bool

fn ne(&self, other: &[A; 16]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 16]> for &'b mut [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 16]) -> bool

fn ne(&self, other: &[A; 16]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 17]> for [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 17]) -> bool

fn ne(&self, other: &[A; 17]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 17]> for &'b [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 17]) -> bool

fn ne(&self, other: &[A; 17]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 17]> for &'b mut [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 17]) -> bool

fn ne(&self, other: &[A; 17]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 18]> for [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 18]) -> bool

fn ne(&self, other: &[A; 18]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 18]> for &'b [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 18]) -> bool

fn ne(&self, other: &[A; 18]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 18]> for &'b mut [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 18]) -> bool

fn ne(&self, other: &[A; 18]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 19]> for [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 19]) -> bool

fn ne(&self, other: &[A; 19]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 19]> for &'b [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 19]) -> bool

fn ne(&self, other: &[A; 19]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 19]> for &'b mut [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 19]) -> bool

fn ne(&self, other: &[A; 19]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 20]> for [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 20]) -> bool

fn ne(&self, other: &[A; 20]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 20]> for &'b [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 20]) -> bool

fn ne(&self, other: &[A; 20]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 20]> for &'b mut [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 20]) -> bool

fn ne(&self, other: &[A; 20]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 21]> for [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 21]) -> bool

fn ne(&self, other: &[A; 21]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 21]> for &'b [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 21]) -> bool

fn ne(&self, other: &[A; 21]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 21]> for &'b mut [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 21]) -> bool

fn ne(&self, other: &[A; 21]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 22]> for [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 22]) -> bool

fn ne(&self, other: &[A; 22]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 22]> for &'b [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 22]) -> bool

fn ne(&self, other: &[A; 22]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 22]> for &'b mut [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 22]) -> bool

fn ne(&self, other: &[A; 22]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 23]> for [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 23]) -> bool

fn ne(&self, other: &[A; 23]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 23]> for &'b [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 23]) -> bool

fn ne(&self, other: &[A; 23]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 23]> for &'b mut [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 23]) -> bool

fn ne(&self, other: &[A; 23]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 24]> for [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 24]) -> bool

fn ne(&self, other: &[A; 24]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 24]> for &'b [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 24]) -> bool

fn ne(&self, other: &[A; 24]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 24]> for &'b mut [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 24]) -> bool

fn ne(&self, other: &[A; 24]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 25]> for [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 25]) -> bool

fn ne(&self, other: &[A; 25]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 25]> for &'b [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 25]) -> bool

fn ne(&self, other: &[A; 25]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 25]> for &'b mut [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 25]) -> bool

fn ne(&self, other: &[A; 25]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 26]> for [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 26]) -> bool

fn ne(&self, other: &[A; 26]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 26]> for &'b [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 26]) -> bool

fn ne(&self, other: &[A; 26]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 26]> for &'b mut [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 26]) -> bool

fn ne(&self, other: &[A; 26]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 27]> for [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 27]) -> bool

fn ne(&self, other: &[A; 27]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 27]> for &'b [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 27]) -> bool

fn ne(&self, other: &[A; 27]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 27]> for &'b mut [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 27]) -> bool

fn ne(&self, other: &[A; 27]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 28]> for [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 28]) -> bool

fn ne(&self, other: &[A; 28]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 28]> for &'b [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 28]) -> bool

fn ne(&self, other: &[A; 28]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 28]> for &'b mut [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 28]) -> bool

fn ne(&self, other: &[A; 28]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 29]> for [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 29]) -> bool

fn ne(&self, other: &[A; 29]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 29]> for &'b [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 29]) -> bool

fn ne(&self, other: &[A; 29]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 29]> for &'b mut [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 29]) -> bool

fn ne(&self, other: &[A; 29]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 30]> for [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 30]) -> bool

fn ne(&self, other: &[A; 30]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 30]> for &'b [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 30]) -> bool

fn ne(&self, other: &[A; 30]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 30]> for &'b mut [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 30]) -> bool

fn ne(&self, other: &[A; 30]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 31]> for [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 31]) -> bool

fn ne(&self, other: &[A; 31]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 31]> for &'b [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 31]) -> bool

fn ne(&self, other: &[A; 31]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 31]> for &'b mut [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 31]) -> bool

fn ne(&self, other: &[A; 31]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 32]> for [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 32]) -> bool

fn ne(&self, other: &[A; 32]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 32]> for &'b [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 32]) -> bool

fn ne(&self, other: &[A; 32]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[A; 32]> for &'b mut [B] where
    B: PartialEq<A>, 

fn eq(&self, other: &[A; 32]) -> bool

fn ne(&self, other: &[A; 32]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B; 0]> for [A; 0] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B; 0]) -> bool

fn ne(&self, other: &[B; 0]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B; 10]> for [A; 10] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B; 10]) -> bool

fn ne(&self, other: &[B; 10]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B; 11]> for [A; 11] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B; 11]) -> bool

fn ne(&self, other: &[B; 11]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B; 12]> for [A; 12] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B; 12]) -> bool

fn ne(&self, other: &[B; 12]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B; 13]> for [A; 13] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B; 13]) -> bool

fn ne(&self, other: &[B; 13]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B; 14]> for [A; 14] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B; 14]) -> bool

fn ne(&self, other: &[B; 14]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B; 15]> for [A; 15] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B; 15]) -> bool

fn ne(&self, other: &[B; 15]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B; 16]> for [A; 16] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B; 16]) -> bool

fn ne(&self, other: &[B; 16]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B; 17]> for [A; 17] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B; 17]) -> bool

fn ne(&self, other: &[B; 17]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B; 18]> for [A; 18] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B; 18]) -> bool

fn ne(&self, other: &[B; 18]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B; 19]> for [A; 19] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B; 19]) -> bool

fn ne(&self, other: &[B; 19]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B; 1]> for [A; 1] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B; 1]) -> bool

fn ne(&self, other: &[B; 1]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B; 20]> for [A; 20] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B; 20]) -> bool

fn ne(&self, other: &[B; 20]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B; 21]> for [A; 21] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B; 21]) -> bool

fn ne(&self, other: &[B; 21]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B; 22]> for [A; 22] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B; 22]) -> bool

fn ne(&self, other: &[B; 22]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B; 23]> for [A; 23] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B; 23]) -> bool

fn ne(&self, other: &[B; 23]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B; 24]> for [A; 24] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B; 24]) -> bool

fn ne(&self, other: &[B; 24]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B; 25]> for [A; 25] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B; 25]) -> bool

fn ne(&self, other: &[B; 25]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B; 26]> for [A; 26] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B; 26]) -> bool

fn ne(&self, other: &[B; 26]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B; 27]> for [A; 27] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B; 27]) -> bool

fn ne(&self, other: &[B; 27]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B; 28]> for [A; 28] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B; 28]) -> bool

fn ne(&self, other: &[B; 28]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B; 29]> for [A; 29] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B; 29]) -> bool

fn ne(&self, other: &[B; 29]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B; 2]> for [A; 2] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B; 2]) -> bool

fn ne(&self, other: &[B; 2]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B; 30]> for [A; 30] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B; 30]) -> bool

fn ne(&self, other: &[B; 30]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B; 31]> for [A; 31] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B; 31]) -> bool

fn ne(&self, other: &[B; 31]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B; 32]> for [A; 32] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B; 32]) -> bool

fn ne(&self, other: &[B; 32]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B; 3]> for [A; 3] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B; 3]) -> bool

fn ne(&self, other: &[B; 3]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B; 4]> for [A; 4] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B; 4]) -> bool

fn ne(&self, other: &[B; 4]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B; 5]> for [A; 5] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B; 5]) -> bool

fn ne(&self, other: &[B; 5]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B; 6]> for [A; 6] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B; 6]) -> bool

fn ne(&self, other: &[B; 6]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B; 7]> for [A; 7] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B; 7]) -> bool

fn ne(&self, other: &[B; 7]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B; 8]> for [A; 8] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B; 8]) -> bool

fn ne(&self, other: &[B; 8]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B; 9]> for [A; 9] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B; 9]) -> bool

fn ne(&self, other: &[B; 9]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B]> for [A; 0] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B]) -> bool

fn ne(&self, other: &[B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B]> for [A; 1] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B]) -> bool

fn ne(&self, other: &[B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B]> for [A; 2] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B]) -> bool

fn ne(&self, other: &[B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B]> for [A; 3] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B]) -> bool

fn ne(&self, other: &[B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B]> for [A; 4] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B]) -> bool

fn ne(&self, other: &[B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B]> for [A; 5] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B]) -> bool

fn ne(&self, other: &[B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B]> for [A; 6] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B]) -> bool

fn ne(&self, other: &[B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B]> for [A; 7] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B]) -> bool

fn ne(&self, other: &[B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B]> for [A; 8] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B]) -> bool

fn ne(&self, other: &[B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B]> for [A; 9] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B]) -> bool

fn ne(&self, other: &[B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B]> for [A; 10] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B]) -> bool

fn ne(&self, other: &[B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B]> for [A; 11] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B]) -> bool

fn ne(&self, other: &[B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B]> for [A; 12] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B]) -> bool

fn ne(&self, other: &[B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B]> for [A; 13] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B]) -> bool

fn ne(&self, other: &[B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B]> for [A; 14] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B]) -> bool

fn ne(&self, other: &[B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B]> for [A; 15] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B]) -> bool

fn ne(&self, other: &[B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B]> for [A; 16] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B]) -> bool

fn ne(&self, other: &[B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B]> for [A; 17] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B]) -> bool

fn ne(&self, other: &[B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B]> for [A; 18] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B]) -> bool

fn ne(&self, other: &[B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B]> for [A; 19] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B]) -> bool

fn ne(&self, other: &[B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B]> for [A; 20] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B]) -> bool

fn ne(&self, other: &[B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B]> for [A; 21] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B]) -> bool

fn ne(&self, other: &[B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B]> for [A; 22] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B]) -> bool

fn ne(&self, other: &[B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B]> for [A; 23] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B]) -> bool

fn ne(&self, other: &[B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B]> for [A; 24] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B]) -> bool

fn ne(&self, other: &[B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B]> for [A; 25] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B]) -> bool

fn ne(&self, other: &[B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B]> for [A; 26] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B]) -> bool

fn ne(&self, other: &[B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B]> for [A; 27] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B]) -> bool

fn ne(&self, other: &[B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B]> for [A; 28] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B]) -> bool

fn ne(&self, other: &[B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B]> for [A; 29] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B]) -> bool

fn ne(&self, other: &[B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B]> for [A; 30] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B]) -> bool

fn ne(&self, other: &[B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B]> for [A; 31] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B]) -> bool

fn ne(&self, other: &[B]) -> bool

impl<'a, 'b, A: Sized, B> PartialEq<[B]> for [A; 32] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B]) -> bool

fn ne(&self, other: &[B]) -> bool

impl<A> PartialEq<(A,)> for (A,) where
    A: PartialEq + ?Sized, 

fn eq(&self, other: &(A,)) -> bool

fn ne(&self, other: &(A,)) -> bool

impl<A, B> PartialEq<[B]> for [A] where
    A: PartialEq<B>, 

fn eq(&self, other: &[B]) -> bool

fn ne(&self, other: &[B]) -> bool

impl<A: PartialEq, B> PartialEq<(A, B)> for (A, B) where
    B: PartialEq + ?Sized, 

fn eq(&self, other: &(A, B)) -> bool

fn ne(&self, other: &(A, B)) -> bool

impl<A: PartialEq, B: PartialEq, C> PartialEq<(A, B, C)> for (A, B, C) where
    C: PartialEq + ?Sized, 

fn eq(&self, other: &(A, B, C)) -> bool

fn ne(&self, other: &(A, B, C)) -> bool

impl<A: PartialEq, B: PartialEq, C: PartialEq, D> PartialEq<(A, B, C, D)> for (A, B, C, D) where
    D: PartialEq + ?Sized, 

fn eq(&self, other: &(A, B, C, D)) -> bool

fn ne(&self, other: &(A, B, C, D)) -> bool

impl<A: PartialEq, B: PartialEq, C: PartialEq, D: PartialEq, E> PartialEq<(A, B, C, D, E)> for (A, B, C, D, E) where
    E: PartialEq + ?Sized, 

fn eq(&self, other: &(A, B, C, D, E)) -> bool

fn ne(&self, other: &(A, B, C, D, E)) -> bool

impl<A: PartialEq, B: PartialEq, C: PartialEq, D: PartialEq, E: PartialEq, F> PartialEq<(A, B, C, D, E, F)> for (A, B, C, D, E, F) where
    F: PartialEq + ?Sized, 

fn eq(&self, other: &(A, B, C, D, E, F)) -> bool

fn ne(&self, other: &(A, B, C, D, E, F)) -> bool

impl<A: PartialEq, B: PartialEq, C: PartialEq, D: PartialEq, E: PartialEq, F: PartialEq, G> PartialEq<(A, B, C, D, E, F, G)> for (A, B, C, D, E, F, G) where
    G: PartialEq + ?Sized, 

fn eq(&self, other: &(A, B, C, D, E, F, G)) -> bool

fn ne(&self, other: &(A, B, C, D, E, F, G)) -> bool

impl<A: PartialEq, B: PartialEq, C: PartialEq, D: PartialEq, E: PartialEq, F: PartialEq, G: PartialEq, H> PartialEq<(A, B, C, D, E, F, G, H)> for (A, B, C, D, E, F, G, H) where
    H: PartialEq + ?Sized, 

fn eq(&self, other: &(A, B, C, D, E, F, G, H)) -> bool

fn ne(&self, other: &(A, B, C, D, E, F, G, H)) -> bool

impl<A: PartialEq, B: PartialEq, C: PartialEq, D: PartialEq, E: PartialEq, F: PartialEq, G: PartialEq, H: PartialEq, I> PartialEq<(A, B, C, D, E, F, G, H, I)> for (A, B, C, D, E, F, G, H, I) where
    I: PartialEq + ?Sized, 

fn eq(&self, other: &(A, B, C, D, E, F, G, H, I)) -> bool

fn ne(&self, other: &(A, B, C, D, E, F, G, H, I)) -> bool

impl<A: PartialEq, B: PartialEq, C: PartialEq, D: PartialEq, E: PartialEq, F: PartialEq, G: PartialEq, H: PartialEq, I: PartialEq, J> PartialEq<(A, B, C, D, E, F, G, H, I, J)> for (A, B, C, D, E, F, G, H, I, J) where
    J: PartialEq + ?Sized, 

fn eq(&self, other: &(A, B, C, D, E, F, G, H, I, J)) -> bool

fn ne(&self, other: &(A, B, C, D, E, F, G, H, I, J)) -> bool

impl<A: PartialEq, B: PartialEq, C: PartialEq, D: PartialEq, E: PartialEq, F: PartialEq, G: PartialEq, H: PartialEq, I: PartialEq, J: PartialEq, K> PartialEq<(A, B, C, D, E, F, G, H, I, J, K)> for (A, B, C, D, E, F, G, H, I, J, K) where
    K: PartialEq + ?Sized, 

fn eq(&self, other: &(A, B, C, D, E, F, G, H, I, J, K)) -> bool

fn ne(&self, other: &(A, B, C, D, E, F, G, H, I, J, K)) -> bool

impl<A: PartialEq, B: PartialEq, C: PartialEq, D: PartialEq, E: PartialEq, F: PartialEq, G: PartialEq, H: PartialEq, I: PartialEq, J: PartialEq, K: PartialEq, L> PartialEq<(A, B, C, D, E, F, G, H, I, J, K, L)> for (A, B, C, D, E, F, G, H, I, J, K, L) where
    L: PartialEq + ?Sized, 

fn eq(&self, other: &(A, B, C, D, E, F, G, H, I, J, K, L)) -> bool

fn ne(&self, other: &(A, B, C, D, E, F, G, H, I, J, K, L)) -> bool

impl<H> PartialEq<BuildHasherDefault<H>> for BuildHasherDefault<H>

fn eq(&self, _other: &BuildHasherDefault<H>) -> bool

impl<Idx: PartialEq> PartialEq<Range<Idx>> for Range<Idx>

fn eq(&self, other: &Range<Idx>) -> bool

fn ne(&self, other: &Range<Idx>) -> bool

impl<Idx: PartialEq> PartialEq<RangeFrom<Idx>> for RangeFrom<Idx>

fn eq(&self, other: &RangeFrom<Idx>) -> bool

fn ne(&self, other: &RangeFrom<Idx>) -> bool

impl<Idx: PartialEq> PartialEq<RangeInclusive<Idx>> for RangeInclusive<Idx>

fn eq(&self, other: &Self) -> bool

impl<Idx: PartialEq> PartialEq<RangeTo<Idx>> for RangeTo<Idx>

fn eq(&self, other: &RangeTo<Idx>) -> bool

fn ne(&self, other: &RangeTo<Idx>) -> bool

impl<Idx: PartialEq> PartialEq<RangeToInclusive<Idx>> for RangeToInclusive<Idx>

fn eq(&self, other: &RangeToInclusive<Idx>) -> bool

fn ne(&self, other: &RangeToInclusive<Idx>) -> bool

impl<P, Q> PartialEq<Pin<Q>> for Pin<P> where
    P: PartialEq<Q>, 

fn eq(&self, other: &Pin<Q>) -> bool

fn ne(&self, other: &Pin<Q>) -> bool

impl<Ret> PartialEq<extern "C" fn() -> Ret> for extern "C" fn() -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret> PartialEq<fn() -> Ret> for fn() -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret> PartialEq<unsafe extern "C" fn() -> Ret> for unsafe extern "C" fn() -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret> PartialEq<unsafe fn() -> Ret> for unsafe fn() -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A> PartialEq<extern "C" fn(A) -> Ret> for extern "C" fn(_: A) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A> PartialEq<extern "C" fn(A, VaList) -> Ret> for extern "C" fn(_: A, _: ...) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A> PartialEq<fn(A) -> Ret> for fn(_: A) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A> PartialEq<unsafe extern "C" fn(A) -> Ret> for unsafe extern "C" fn(_: A) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A> PartialEq<unsafe extern "C" fn(A, VaList) -> Ret> for unsafe extern "C" fn(_: A, _: ...) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A> PartialEq<unsafe fn(A) -> Ret> for unsafe fn(_: A) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B> PartialEq<extern "C" fn(A, B) -> Ret> for extern "C" fn(_: A, _: B) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B> PartialEq<extern "C" fn(A, B, VaList) -> Ret> for extern "C" fn(_: A, _: B, _: ...) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B> PartialEq<fn(A, B) -> Ret> for fn(_: A, _: B) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B> PartialEq<unsafe extern "C" fn(A, B) -> Ret> for unsafe extern "C" fn(_: A, _: B) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B> PartialEq<unsafe extern "C" fn(A, B, VaList) -> Ret> for unsafe extern "C" fn(_: A, _: B, _: ...) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B> PartialEq<unsafe fn(A, B) -> Ret> for unsafe fn(_: A, _: B) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B, C> PartialEq<extern "C" fn(A, B, C) -> Ret> for extern "C" fn(_: A, _: B, _: C) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B, C> PartialEq<extern "C" fn(A, B, C, VaList) -> Ret> for extern "C" fn(_: A, _: B, _: C, _: ...) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B, C> PartialEq<fn(A, B, C) -> Ret> for fn(_: A, _: B, _: C) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B, C> PartialEq<unsafe extern "C" fn(A, B, C) -> Ret> for unsafe extern "C" fn(_: A, _: B, _: C) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B, C> PartialEq<unsafe extern "C" fn(A, B, C, VaList) -> Ret> for unsafe extern "C" fn(_: A, _: B, _: C, _: ...) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B, C> PartialEq<unsafe fn(A, B, C) -> Ret> for unsafe fn(_: A, _: B, _: C) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B, C, D> PartialEq<extern "C" fn(A, B, C, D) -> Ret> for extern "C" fn(_: A, _: B, _: C, _: D) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B, C, D> PartialEq<extern "C" fn(A, B, C, D, VaList) -> Ret> for extern "C" fn(_: A, _: B, _: C, _: D, _: ...) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B, C, D> PartialEq<fn(A, B, C, D) -> Ret> for fn(_: A, _: B, _: C, _: D) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B, C, D> PartialEq<unsafe extern "C" fn(A, B, C, D) -> Ret> for unsafe extern "C" fn(_: A, _: B, _: C, _: D) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B, C, D> PartialEq<unsafe extern "C" fn(A, B, C, D, VaList) -> Ret> for unsafe extern "C" fn(_: A, _: B, _: C, _: D, _: ...) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B, C, D> PartialEq<unsafe fn(A, B, C, D) -> Ret> for unsafe fn(_: A, _: B, _: C, _: D) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B, C, D, E> PartialEq<extern "C" fn(A, B, C, D, E) -> Ret> for extern "C" fn(_: A, _: B, _: C, _: D, _: E) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B, C, D, E> PartialEq<extern "C" fn(A, B, C, D, E, VaList) -> Ret> for extern "C" fn(_: A, _: B, _: C, _: D, _: E, _: ...) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B, C, D, E> PartialEq<fn(A, B, C, D, E) -> Ret> for fn(_: A, _: B, _: C, _: D, _: E) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B, C, D, E> PartialEq<unsafe extern "C" fn(A, B, C, D, E) -> Ret> for unsafe extern "C" fn(_: A, _: B, _: C, _: D, _: E) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B, C, D, E> PartialEq<unsafe extern "C" fn(A, B, C, D, E, VaList) -> Ret> for unsafe extern "C" fn(_: A, _: B, _: C, _: D, _: E, _: ...) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B, C, D, E> PartialEq<unsafe fn(A, B, C, D, E) -> Ret> for unsafe fn(_: A, _: B, _: C, _: D, _: E) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B, C, D, E, F> PartialEq<extern "C" fn(A, B, C, D, E, F) -> Ret> for extern "C" fn(_: A, _: B, _: C, _: D, _: E, _: F) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B, C, D, E, F> PartialEq<extern "C" fn(A, B, C, D, E, F, VaList) -> Ret> for extern "C" fn(_: A, _: B, _: C, _: D, _: E, _: F, _: ...) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B, C, D, E, F> PartialEq<fn(A, B, C, D, E, F) -> Ret> for fn(_: A, _: B, _: C, _: D, _: E, _: F) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B, C, D, E, F> PartialEq<unsafe extern "C" fn(A, B, C, D, E, F) -> Ret> for unsafe extern "C" fn(_: A, _: B, _: C, _: D, _: E, _: F) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B, C, D, E, F> PartialEq<unsafe extern "C" fn(A, B, C, D, E, F, VaList) -> Ret> for unsafe extern "C" fn(_: A, _: B, _: C, _: D, _: E, _: F, _: ...) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B, C, D, E, F> PartialEq<unsafe fn(A, B, C, D, E, F) -> Ret> for unsafe fn(_: A, _: B, _: C, _: D, _: E, _: F) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B, C, D, E, F, G> PartialEq<extern "C" fn(A, B, C, D, E, F, G) -> Ret> for extern "C" fn(_: A, _: B, _: C, _: D, _: E, _: F, _: G) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B, C, D, E, F, G> PartialEq<extern "C" fn(A, B, C, D, E, F, G, VaList) -> Ret> for extern "C" fn(_: A, _: B, _: C, _: D, _: E, _: F, _: G, _: ...) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B, C, D, E, F, G> PartialEq<fn(A, B, C, D, E, F, G) -> Ret> for fn(_: A, _: B, _: C, _: D, _: E, _: F, _: G) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B, C, D, E, F, G> PartialEq<unsafe extern "C" fn(A, B, C, D, E, F, G) -> Ret> for unsafe extern "C" fn(_: A, _: B, _: C, _: D, _: E, _: F, _: G) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B, C, D, E, F, G> PartialEq<unsafe extern "C" fn(A, B, C, D, E, F, G, VaList) -> Ret> for unsafe extern "C" fn(_: A, _: B, _: C, _: D, _: E, _: F, _: G, _: ...) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B, C, D, E, F, G> PartialEq<unsafe fn(A, B, C, D, E, F, G) -> Ret> for unsafe fn(_: A, _: B, _: C, _: D, _: E, _: F, _: G) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B, C, D, E, F, G, H> PartialEq<extern "C" fn(A, B, C, D, E, F, G, H) -> Ret> for extern "C" fn(_: A, _: B, _: C, _: D, _: E, _: F, _: G, _: H) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B, C, D, E, F, G, H> PartialEq<extern "C" fn(A, B, C, D, E, F, G, H, VaList) -> Ret> for extern "C" fn(_: A, _: B, _: C, _: D, _: E, _: F, _: G, _: H, _: ...) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B, C, D, E, F, G, H> PartialEq<fn(A, B, C, D, E, F, G, H) -> Ret> for fn(_: A, _: B, _: C, _: D, _: E, _: F, _: G, _: H) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B, C, D, E, F, G, H> PartialEq<unsafe extern "C" fn(A, B, C, D, E, F, G, H) -> Ret> for unsafe extern "C" fn(_: A, _: B, _: C, _: D, _: E, _: F, _: G, _: H) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B, C, D, E, F, G, H> PartialEq<unsafe extern "C" fn(A, B, C, D, E, F, G, H, VaList) -> Ret> for unsafe extern "C" fn(_: A, _: B, _: C, _: D, _: E, _: F, _: G, _: H, _: ...) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B, C, D, E, F, G, H> PartialEq<unsafe fn(A, B, C, D, E, F, G, H) -> Ret> for unsafe fn(_: A, _: B, _: C, _: D, _: E, _: F, _: G, _: H) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B, C, D, E, F, G, H, I> PartialEq<extern "C" fn(A, B, C, D, E, F, G, H, I) -> Ret> for extern "C" fn(_: A, _: B, _: C, _: D, _: E, _: F, _: G, _: H, _: I) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B, C, D, E, F, G, H, I> PartialEq<extern "C" fn(A, B, C, D, E, F, G, H, I, VaList) -> Ret> for extern "C" fn(_: A, _: B, _: C, _: D, _: E, _: F, _: G, _: H, _: I, _: ...) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B, C, D, E, F, G, H, I> PartialEq<fn(A, B, C, D, E, F, G, H, I) -> Ret> for fn(_: A, _: B, _: C, _: D, _: E, _: F, _: G, _: H, _: I) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B, C, D, E, F, G, H, I> PartialEq<unsafe extern "C" fn(A, B, C, D, E, F, G, H, I) -> Ret> for unsafe extern "C" fn(_: A, _: B, _: C, _: D, _: E, _: F, _: G, _: H, _: I) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B, C, D, E, F, G, H, I> PartialEq<unsafe extern "C" fn(A, B, C, D, E, F, G, H, I, VaList) -> Ret> for unsafe extern "C" fn(_: A, _: B, _: C, _: D, _: E, _: F, _: G, _: H, _: I, _: ...) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B, C, D, E, F, G, H, I> PartialEq<unsafe fn(A, B, C, D, E, F, G, H, I) -> Ret> for unsafe fn(_: A, _: B, _: C, _: D, _: E, _: F, _: G, _: H, _: I) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B, C, D, E, F, G, H, I, J> PartialEq<extern "C" fn(A, B, C, D, E, F, G, H, I, J) -> Ret> for extern "C" fn(_: A, _: B, _: C, _: D, _: E, _: F, _: G, _: H, _: I, _: J) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B, C, D, E, F, G, H, I, J> PartialEq<extern "C" fn(A, B, C, D, E, F, G, H, I, J, VaList) -> Ret> for extern "C" fn(_: A, _: B, _: C, _: D, _: E, _: F, _: G, _: H, _: I, _: J, _: ...) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B, C, D, E, F, G, H, I, J> PartialEq<fn(A, B, C, D, E, F, G, H, I, J) -> Ret> for fn(_: A, _: B, _: C, _: D, _: E, _: F, _: G, _: H, _: I, _: J) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B, C, D, E, F, G, H, I, J> PartialEq<unsafe extern "C" fn(A, B, C, D, E, F, G, H, I, J) -> Ret> for unsafe extern "C" fn(_: A, _: B, _: C, _: D, _: E, _: F, _: G, _: H, _: I, _: J) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B, C, D, E, F, G, H, I, J> PartialEq<unsafe extern "C" fn(A, B, C, D, E, F, G, H, I, J, VaList) -> Ret> for unsafe extern "C" fn(_: A, _: B, _: C, _: D, _: E, _: F, _: G, _: H, _: I, _: J, _: ...) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B, C, D, E, F, G, H, I, J> PartialEq<unsafe fn(A, B, C, D, E, F, G, H, I, J) -> Ret> for unsafe fn(_: A, _: B, _: C, _: D, _: E, _: F, _: G, _: H, _: I, _: J) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B, C, D, E, F, G, H, I, J, K> PartialEq<extern "C" fn(A, B, C, D, E, F, G, H, I, J, K) -> Ret> for extern "C" fn(_: A, _: B, _: C, _: D, _: E, _: F, _: G, _: H, _: I, _: J, _: K) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B, C, D, E, F, G, H, I, J, K> PartialEq<extern "C" fn(A, B, C, D, E, F, G, H, I, J, K, VaList) -> Ret> for extern "C" fn(_: A, _: B, _: C, _: D, _: E, _: F, _: G, _: H, _: I, _: J, _: K, _: ...) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B, C, D, E, F, G, H, I, J, K> PartialEq<fn(A, B, C, D, E, F, G, H, I, J, K) -> Ret> for fn(_: A, _: B, _: C, _: D, _: E, _: F, _: G, _: H, _: I, _: J, _: K) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B, C, D, E, F, G, H, I, J, K> PartialEq<unsafe extern "C" fn(A, B, C, D, E, F, G, H, I, J, K) -> Ret> for unsafe extern "C" fn(_: A, _: B, _: C, _: D, _: E, _: F, _: G, _: H, _: I, _: J, _: K) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B, C, D, E, F, G, H, I, J, K> PartialEq<unsafe extern "C" fn(A, B, C, D, E, F, G, H, I, J, K, VaList) -> Ret> for unsafe extern "C" fn(_: A, _: B, _: C, _: D, _: E, _: F, _: G, _: H, _: I, _: J, _: K, _: ...) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B, C, D, E, F, G, H, I, J, K> PartialEq<unsafe fn(A, B, C, D, E, F, G, H, I, J, K) -> Ret> for unsafe fn(_: A, _: B, _: C, _: D, _: E, _: F, _: G, _: H, _: I, _: J, _: K) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B, C, D, E, F, G, H, I, J, K, L> PartialEq<extern "C" fn(A, B, C, D, E, F, G, H, I, J, K, L) -> Ret> for extern "C" fn(_: A, _: B, _: C, _: D, _: E, _: F, _: G, _: H, _: I, _: J, _: K, _: L) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B, C, D, E, F, G, H, I, J, K, L> PartialEq<extern "C" fn(A, B, C, D, E, F, G, H, I, J, K, L, VaList) -> Ret> for extern "C" fn(_: A, _: B, _: C, _: D, _: E, _: F, _: G, _: H, _: I, _: J, _: K, _: L, _: ...) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B, C, D, E, F, G, H, I, J, K, L> PartialEq<fn(A, B, C, D, E, F, G, H, I, J, K, L) -> Ret> for fn(_: A, _: B, _: C, _: D, _: E, _: F, _: G, _: H, _: I, _: J, _: K, _: L) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B, C, D, E, F, G, H, I, J, K, L> PartialEq<unsafe extern "C" fn(A, B, C, D, E, F, G, H, I, J, K, L) -> Ret> for unsafe extern "C" fn(_: A, _: B, _: C, _: D, _: E, _: F, _: G, _: H, _: I, _: J, _: K, _: L) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B, C, D, E, F, G, H, I, J, K, L> PartialEq<unsafe extern "C" fn(A, B, C, D, E, F, G, H, I, J, K, L, VaList) -> Ret> for unsafe extern "C" fn(_: A, _: B, _: C, _: D, _: E, _: F, _: G, _: H, _: I, _: J, _: K, _: L, _: ...) -> Ret

fn eq(&self, other: &Self) -> bool

impl<Ret, A, B, C, D, E, F, G, H, I, J, K, L> PartialEq<unsafe fn(A, B, C, D, E, F, G, H, I, J, K, L) -> Ret> for unsafe fn(_: A, _: B, _: C, _: D, _: E, _: F, _: G, _: H, _: I, _: J, _: K, _: L) -> Ret

fn eq(&self, other: &Self) -> bool

impl<T> PartialEq<Discriminant<T>> for Discriminant<T>

fn eq(&self, rhs: &Self) -> bool

impl<T: PartialEq + Copy> PartialEq<Cell<T>> for Cell<T>

fn eq(&self, other: &Cell<T>) -> bool

impl<T: PartialEq + ?Sized> PartialEq<ManuallyDrop<T>> for ManuallyDrop<T>

fn eq(&self, other: &ManuallyDrop<T>) -> bool

fn ne(&self, other: &ManuallyDrop<T>) -> bool

impl<T: PartialEq> PartialEq<Bound<T>> for Bound<T>

fn eq(&self, other: &Bound<T>) -> bool

fn ne(&self, other: &Bound<T>) -> bool

impl<T: PartialEq> PartialEq<Option<T>> for Option<T>

fn eq(&self, other: &Option<T>) -> bool

fn ne(&self, other: &Option<T>) -> bool

impl<T: PartialEq> PartialEq<Poll<T>> for Poll<T>

fn eq(&self, other: &Poll<T>) -> bool

fn ne(&self, other: &Poll<T>) -> bool

impl<T: PartialEq> PartialEq<Reverse<T>> for Reverse<T>

fn eq(&self, other: &Reverse<T>) -> bool

fn ne(&self, other: &Reverse<T>) -> bool

impl<T: PartialEq> PartialEq<Wrapping<T>> for Wrapping<T>

fn eq(&self, other: &Wrapping<T>) -> bool

fn ne(&self, other: &Wrapping<T>) -> bool

impl<T: PartialEq, E: PartialEq> PartialEq<Result<T, E>> for Result<T, E>

fn eq(&self, other: &Result<T, E>) -> bool

fn ne(&self, other: &Result<T, E>) -> bool

impl<T: ?Sized + PartialEq> PartialEq<RefCell<T>> for RefCell<T>

fn eq(&self, other: &RefCell<T>) -> bool

Panics

Panics if the value in either RefCell is currently borrowed.

impl<T: ?Sized> PartialEq<*const T> for *const T

fn eq(&self, other: &*const T) -> bool

impl<T: ?Sized> PartialEq<*mut T> for *mut T

fn eq(&self, other: &*mut T) -> bool

impl<T: ?Sized> PartialEq<PhantomData<T>> for PhantomData<T>

fn eq(&self, _other: &PhantomData<T>) -> bool

impl<T: ?Sized> PartialEq<NonNull<T>> for NonNull<T>

fn eq(&self, other: &Self) -> bool

impl<Y: PartialEq, R: PartialEq> PartialEq<GeneratorState<Y, R>> for GeneratorState<Y, R>

fn eq(&self, other: &GeneratorState<Y, R>) -> bool

fn ne(&self, other: &GeneratorState<Y, R>) -> bool

Loading content...