Trait competitive_hpp::prelude::PartialEq

#[lang = "eq"]pub trait PartialEq<Rhs = Self> where
    Rhs: ?Sized, {
#[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.

A comparison like the one above, which ignores some fields of the struct, can be dangerous. It can easily lead to an unintended violation of the requirements for a partial equivalence relation. For example, if we kept the above implementation of PartialEq<Book> for BookFormat and added an implementation of PartialEq<Book> for Book (either via a #[derive] or via the manual implementation from the first example) then the result would violate transitivity:

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

#[derive(PartialEq)]
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
    }
}

fn main() {
    let b1 = Book { isbn: 1, format: BookFormat::Paperback };
    let b2 = Book { isbn: 2, format: BookFormat::Paperback };

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

    // The following should hold by transitivity but doesn't.
    assert!(b1 == b2); // <-- PANICS
}

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...

Implementations on Foreign Types

impl PartialEq<Ipv6Addr> for IpAddr

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

impl PartialEq<NulError> for NulError

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

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

impl PartialEq<AccessError> for AccessError

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

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

impl<'a, 'b> PartialEq<PathBuf> for &'a Path

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

impl<'a, 'b> PartialEq<OsStr> for Cow<'a, OsStr>

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

impl PartialEq<IpAddr> for Ipv4Addr

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

impl<'a, 'b> PartialEq<Path> for OsString

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

impl PartialEq<StripPrefixError> for StripPrefixError

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

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

impl PartialEq<Shutdown> for Shutdown

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

impl<T> PartialEq<SendError<T>> for SendError<T> where
    T: PartialEq<T>, 

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

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

impl<'a> PartialEq<Prefix<'a>> for Prefix<'a>

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

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

impl<'a, 'b> PartialEq<Cow<'a, OsStr>> for Path

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

impl PartialEq<WaitTimeoutResult> for WaitTimeoutResult

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

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

impl PartialEq<OsString> for str

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

impl PartialEq<Ipv6Addr> for Ipv6Addr

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

impl<'a, 'b> PartialEq<PathBuf> for Path

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

impl<'a, 'b> PartialEq<OsStr> for PathBuf

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

impl<'a, 'b> PartialEq<Path> for PathBuf

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

impl PartialEq<Ipv6MulticastScope> for Ipv6MulticastScope

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

impl<'a, 'b> PartialEq<Cow<'a, OsStr>> for &'b OsStr

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

impl PartialEq<PathBuf> for PathBuf

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

impl<'a, 'b> PartialEq<PathBuf> for &'a OsStr

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

impl<'a, 'b> PartialEq<Cow<'a, OsStr>> for OsString

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

impl PartialEq<IpAddr> for Ipv6Addr

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

impl<'a, 'b> PartialEq<Cow<'a, Path>> for OsStr

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

impl<'a, 'b> PartialEq<&'b OsStr> for Cow<'a, Path>

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

impl<'a> PartialEq<Component<'a>> for Component<'a>

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

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

impl<'a> PartialEq<PrefixComponent<'a>> for PrefixComponent<'a>

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

impl PartialEq<VarError> for VarError

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

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

impl PartialEq<Ipv4Addr> for IpAddr

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

impl<'a> PartialEq<Components<'a>> for Components<'a>

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

impl<'a, 'b> PartialEq<OsString> for PathBuf

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

impl<'a, 'b> PartialEq<Cow<'a, OsStr>> for OsStr

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

impl<'a, 'b> PartialEq<Cow<'a, Path>> for PathBuf

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

impl PartialEq<CStr> for CStr

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

impl<'a, 'b> PartialEq<OsString> for &'a OsStr

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

impl<'a, 'b> PartialEq<OsString> for OsStr

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

impl<'a, 'b> PartialEq<PathBuf> for Cow<'a, Path>

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

impl<'a, 'b> PartialEq<Cow<'b, OsStr>> for &'a Path

fn eq(&self, other: &Cow<'b, OsStr>) -> bool

impl<T> PartialEq<TrySendError<T>> for TrySendError<T> where
    T: PartialEq<T>, 

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

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

impl<'a, 'b> PartialEq<OsString> for &'a Path

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

impl<'a, 'b> PartialEq<&'a Path> for OsString

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

impl PartialEq<ThreadId> for ThreadId

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

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

impl PartialEq<OsStr> for OsStr

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

impl PartialEq<SystemTime> for SystemTime

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

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

impl PartialEq<OsString> for OsString

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

impl PartialEq<ErrorKind> for ErrorKind

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

impl<'a, 'b> PartialEq<OsStr> for Path

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

impl<'a, 'b> PartialEq<&'a OsStr> for PathBuf

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

impl PartialEq<Output> for Output

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

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

impl<'a, 'b> PartialEq<OsStr> for &'a Path

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

impl<'a, 'b> PartialEq<OsString> for Cow<'a, OsStr>

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

impl<'a, 'b> PartialEq<Path> for Cow<'a, OsStr>

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

impl<T> PartialEq<Cursor<T>> for Cursor<T> where
    T: PartialEq<T>, 

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

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

impl PartialEq<ExitStatus> for ExitStatus

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

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

impl PartialEq<str> for OsStr

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

impl<'a, 'b> PartialEq<Cow<'a, Path>> for &'b Path

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

impl PartialEq<SocketAddrV4> for SocketAddrV4

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

impl<'a, 'b> PartialEq<&'a Path> for Cow<'b, OsStr>

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

impl<'a, 'b> PartialEq<OsStr> for Cow<'a, Path>

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

impl PartialEq<IpAddr> for IpAddr

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

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

impl PartialEq<OsStr> for str

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

impl<'a, 'b> PartialEq<Cow<'a, Path>> for &'b OsStr

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

impl<'a, 'b> PartialEq<&'a Path> for OsStr

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

impl PartialEq<FromBytesWithNulError> for FromBytesWithNulError

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

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

impl PartialEq<Instant> for Instant

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

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

impl<'a, 'b> PartialEq<&'b OsStr> for Cow<'a, OsStr>

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

impl<'a, 'b> PartialEq<Path> for &'a OsStr

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

impl PartialEq<SocketAddrV6> for SocketAddrV6

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

impl<'a, 'b> PartialEq<&'a OsStr> for OsString

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

impl PartialEq<SeekFrom> for SeekFrom

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

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

impl<'a, 'b> PartialEq<PathBuf> for OsString

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

impl<'a, 'b> PartialEq<Path> for OsStr

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

impl PartialEq<FileType> for FileType

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

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

impl PartialEq<RecvTimeoutError> for RecvTimeoutError

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

impl PartialEq<AddrParseError> for AddrParseError

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

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

impl<'a, 'b> PartialEq<PathBuf> for Cow<'a, OsStr>

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

impl<'a> PartialEq<OsString> for &'a str

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

impl<'a, 'b> PartialEq<Cow<'a, Path>> for OsString

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

impl PartialEq<Path> for Path

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

impl PartialEq<TryRecvError> for TryRecvError

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

impl PartialEq<CString> for CString

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

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

impl PartialEq<IntoStringError> for IntoStringError

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

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

impl<'a, 'b> PartialEq<OsString> for Cow<'a, Path>

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

impl PartialEq<BacktraceStatus> for BacktraceStatus

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

impl<'_> PartialEq<&'_ str> for OsString

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

impl<'a, 'b> PartialEq<&'b Path> for Cow<'a, Path>

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

impl<'a, 'b> PartialEq<Cow<'a, OsStr>> for PathBuf

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

impl<'a, 'b> PartialEq<Cow<'a, Path>> for Path

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

impl PartialEq<str> for OsString

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

impl<'a, 'b> PartialEq<&'a Path> for PathBuf

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

impl PartialEq<RecvError> for RecvError

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

impl PartialEq<Permissions> for Permissions

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

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

impl<'a, 'b> PartialEq<OsString> for Path

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

impl<'a, 'b> PartialEq<PathBuf> for OsStr

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

impl<'a, 'b> PartialEq<Path> for Cow<'a, Path>

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

impl PartialEq<Ipv4Addr> for Ipv4Addr

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

impl<'a, 'b> PartialEq<&'a OsStr> for Path

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

impl<'a, 'b> PartialEq<OsStr> for OsString

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

impl PartialEq<SocketAddr> for SocketAddr

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

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

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

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

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

impl<T> PartialEq<PhantomData<T>> for PhantomData<T> where
    T: ?Sized, 

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

impl PartialEq<AllocInit> for AllocInit

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

impl<Ret> PartialEq<extern "C" fn() -> Ret> for extern "C" fn() -> Ret

fn eq(&self, other: &extern "C" fn() -> Ret) -> 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: &extern "C" fn(A, B, C, D, E, F, G, H, I, ...) -> Ret
) -> 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<T> PartialEq<RefCell<T>> for RefCell<T> where
    T: PartialEq<T> + ?Sized, 

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

Panics

Panics if the value in either RefCell is currently borrowed.

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

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

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

impl<Ret, A, B> PartialEq<unsafe fn(A, B) -> Ret> for unsafe fn(A, B) -> Ret

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

impl PartialEq<ParseIntError> for ParseIntError

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

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

impl<A, B> PartialEq<(A, B)> for (A, B) where
    A: PartialEq<A>,
    B: PartialEq<B> + ?Sized, 

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

fn ne(&self, other: &(A, B)) -> 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: &fn(A, B, C, D, E) -> Ret) -> bool

impl<Ret, A> PartialEq<unsafe extern "C" fn(A) -> Ret> for unsafe extern "C" fn(A) -> Ret

fn eq(&self, other: &unsafe extern "C" fn(A) -> Ret) -> 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: &unsafe extern "C" fn(A, B, C, D, ...) -> Ret) -> bool

impl<Ret, A, B> PartialEq<extern "C" fn(A, B) -> Ret> for extern "C" fn(A, B) -> Ret

fn eq(&self, other: &extern "C" fn(A, B) -> Ret) -> bool

impl<Idx> PartialEq<RangeTo<Idx>> for RangeTo<Idx> where
    Idx: PartialEq<Idx>, 

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

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

impl<A, B, C, D, E, F> PartialEq<(A, B, C, D, E, F)> for (A, B, C, D, E, F) where
    A: PartialEq<A>,
    B: PartialEq<B>,
    C: PartialEq<C>,
    D: PartialEq<D>,
    E: PartialEq<E>,
    F: PartialEq<F> + ?Sized, 

fn eq(&self, other: &(A, B, C, D, E, F)) -> bool

fn ne(&self, other: &(A, B, C, D, E, F)) -> 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: &extern "C" fn(A, B, C, D) -> Ret) -> 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: &unsafe extern "C" fn(A, B) -> Ret) -> bool

impl<A, B, C, D> PartialEq<(A, B, C, D)> for (A, B, C, D) where
    A: PartialEq<A>,
    B: PartialEq<B>,
    C: PartialEq<C>,
    D: PartialEq<D> + ?Sized, 

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

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

impl PartialEq<Layout> for Layout

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

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

impl PartialEq<f64> for f64

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

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

impl PartialEq<u8> for u8

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

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

impl PartialEq<NonZeroI16> for NonZeroI16

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

fn ne(&self, other: &NonZeroI16) -> 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: &unsafe fn(A, B, C, D, E, F, G) -> Ret) -> bool

impl<T> PartialEq<NonNull<T>> for NonNull<T> where
    T: ?Sized, 

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

impl<T> PartialEq<Wrapping<T>> for Wrapping<T> where
    T: PartialEq<T>, 

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

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

impl PartialEq<AllocErr> for AllocErr

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

impl PartialEq<Error> for Error

fn eq(&self, other: &Error) -> 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: &unsafe extern "C" fn(A, B, C, D, E, F, G, H, ...) -> Ret
) -> 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: &unsafe extern "C" fn(A, B, C) -> Ret) -> 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: &unsafe extern "C" fn(A, B, C, ...) -> Ret) -> 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: &fn(A, B, C, D) -> Ret) -> bool

impl PartialEq<bool> for bool

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

fn ne(&self, other: &bool) -> 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: &unsafe fn(A, B, C, D, E, F, G, H) -> Ret) -> bool

impl PartialEq<Ordering> for Ordering

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

impl PartialEq<NonZeroUsize> for NonZeroUsize

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

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

impl PartialEq<i16> for i16

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

fn ne(&self, other: &i16) -> 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: &extern "C" fn(A, B, C, D, E, F, G, H, I) -> Ret) -> 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: &unsafe extern "C" fn(A, B, C, D, E, F, G, H, I, J, K, ...) -> Ret
) -> 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: &extern "C" fn(A, B, C, D, E, F, G, H, I, J, K) -> Ret
) -> 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: &unsafe extern "C" fn(A, B, C, D, E, F, G, ...) -> Ret
) -> 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: &fn(A, B, C, D, E, F, G, H, I) -> Ret) -> bool

impl<T> PartialEq<*const T> for *const T where
    T: ?Sized, 

fn eq(&self, other: &*const T) -> 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: &unsafe extern "C" fn(A, B, C, D, E, F, G, H, I, J, K) -> Ret
) -> bool

impl PartialEq<i128> for i128

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

fn ne(&self, other: &i128) -> 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: &unsafe extern "C" fn(A, B, C, D, E, F, G, H, I, J, ...) -> Ret
) -> bool

impl<A, B, C> PartialEq<(A, B, C)> for (A, B, C) where
    A: PartialEq<A>,
    B: PartialEq<B>,
    C: PartialEq<C> + ?Sized, 

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

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

impl<T> PartialEq<*mut T> for *mut T where
    T: ?Sized, 

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

impl<Idx> PartialEq<Range<Idx>> for Range<Idx> where
    Idx: PartialEq<Idx>, 

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

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

impl PartialEq<TypeId> for TypeId

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

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

impl PartialEq<NonZeroU16> for NonZeroU16

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

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

impl<Ret, A> PartialEq<extern "C" fn(A) -> Ret> for extern "C" fn(A) -> Ret

fn eq(&self, other: &extern "C" fn(A) -> Ret) -> 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: &fn(A, B, C, D, E, F, G, H, I, J, K, L) -> Ret) -> 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: &unsafe extern "C" fn(A, B, C, D, E, F, G, H, I, ...) -> Ret
) -> bool

impl<const N: usize, A, B> PartialEq<[B; N]> for [A; N] where
    A: PartialEq<B>,
    [A; N]: LengthAtMost32,
    [B; N]: LengthAtMost32, 

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

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

impl PartialEq<IntErrorKind> for IntErrorKind

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

impl PartialEq<NonZeroU8> for NonZeroU8

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

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

impl PartialEq<NonZeroU64> for NonZeroU64

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

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

impl<const N: usize, A, B> PartialEq<[B]> for [A; N] where
    A: PartialEq<B>,
    [A; N]: LengthAtMost32, 

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

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

impl PartialEq<ParseCharError> for ParseCharError

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

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

impl<Ret, A> PartialEq<unsafe fn(A) -> Ret> for unsafe fn(A) -> Ret

fn eq(&self, other: &unsafe fn(A) -> Ret) -> 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: &unsafe extern "C" fn(A, B, C, D, E, F, G, H) -> Ret
) -> 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: &unsafe fn(A, B, C, D, E, F, G, H, I) -> Ret) -> bool

impl PartialEq<!> for !

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

impl<H> PartialEq<BuildHasherDefault<H>> for BuildHasherDefault<H>

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

impl PartialEq<CpuidResult> for CpuidResult

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

fn ne(&self, other: &CpuidResult) -> 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: &extern "C" fn(A, B, C, D, E) -> Ret) -> 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: &unsafe extern "C" fn(A, B, ...) -> Ret) -> 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: &unsafe fn(A, B, C, D, E, F) -> Ret) -> bool

impl PartialEq<FpCategory> for FpCategory

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

impl<Ret, A> PartialEq<unsafe extern "C" fn(A, ...) -> Ret> for unsafe extern "C" fn(A, ...) -> Ret

fn eq(&self, other: &unsafe extern "C" fn(A, ...) -> Ret) -> bool

impl PartialEq<u128> for u128

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

fn ne(&self, other: &u128) -> 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: &unsafe extern "C" fn(A, B, C, D, E, F) -> Ret) -> bool

impl<A> PartialEq<(A,)> for (A,) where
    A: PartialEq<A> + ?Sized, 

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

fn ne(&self, other: &(A,)) -> 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: &extern "C" fn(A, B, C) -> Ret) -> 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: &unsafe fn(A, B, C, D) -> Ret) -> 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: &extern "C" fn(A, B, C, D, E, F, G, H, I, J, K, ...) -> Ret
) -> 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: &unsafe fn(A, B, C, D, E) -> Ret) -> bool

impl<Ret, A, B, C> PartialEq<unsafe fn(A, B, C) -> Ret> for unsafe fn(A, B, C) -> Ret

fn eq(&self, other: &unsafe fn(A, B, C) -> Ret) -> bool

impl PartialEq<Infallible> for Infallible

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

impl<'b, const N: usize, A, B> PartialEq<[A; N]> for &'b [B] where
    B: PartialEq<A>,
    [A; N]: LengthAtMost32, 

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

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

impl PartialEq<Duration> for Duration

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

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

impl<Ret> PartialEq<fn() -> Ret> for fn() -> Ret

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

impl PartialEq<RawWakerVTable> for RawWakerVTable

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

fn ne(&self, other: &RawWakerVTable) -> 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: &extern "C" fn(A, B, C, D, E, F) -> Ret) -> bool

impl PartialEq<ParseFloatError> for ParseFloatError

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

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

impl PartialEq<NonZeroI64> for NonZeroI64

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

fn ne(&self, other: &NonZeroI64) -> 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, C, D, E, F, G, H, I, J, 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
    A: PartialEq<A>,
    B: PartialEq<B>,
    C: PartialEq<C>,
    D: PartialEq<D>,
    E: PartialEq<E>,
    F: PartialEq<F>,
    G: PartialEq<G>,
    H: PartialEq<H>,
    I: PartialEq<I>,
    J: PartialEq<J>,
    K: PartialEq<K> + ?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<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: &extern "C" fn(A, B, C, D, E, F, G) -> Ret) -> bool

impl PartialEq<NonZeroU32> for NonZeroU32

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

fn ne(&self, other: &NonZeroU32) -> 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: &unsafe extern "C" fn(A, B, C, D, E, F, G, H, I, J, K, L) -> Ret
) -> bool

impl PartialEq<SearchStep> for SearchStep

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

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

impl PartialEq<i64> for i64

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

fn ne(&self, other: &i64) -> 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: &unsafe fn(A, B, C, D, E, F, G, H, I, J, K) -> Ret) -> bool

impl<'b, const N: usize, A, B> PartialEq<&'b [B]> for [A; N] where
    A: PartialEq<B>,
    [A; N]: LengthAtMost32, 

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

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

impl<Ret, A> PartialEq<extern "C" fn(A, ...) -> Ret> for extern "C" fn(A, ...) -> Ret

fn eq(&self, other: &extern "C" fn(A, ...) -> Ret) -> bool

impl PartialEq<ReallocPlacement> for ReallocPlacement

fn eq(&self, other: &ReallocPlacement) -> 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: &unsafe fn(A, B, C, D, E, F, G, H, I, J) -> Ret) -> bool

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

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

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

impl PartialEq<RangeFull> for RangeFull

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

impl<'b, const N: usize, A, B> PartialEq<&'b mut [B]> for [A; N] where
    A: PartialEq<B>,
    [A; N]: LengthAtMost32, 

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

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

impl<Ret> PartialEq<unsafe extern "C" fn() -> Ret> for unsafe extern "C" fn() -> Ret

fn eq(&self, other: &unsafe extern "C" fn() -> Ret) -> bool

impl<Idx> PartialEq<RangeToInclusive<Idx>> for RangeToInclusive<Idx> where
    Idx: PartialEq<Idx>, 

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

fn ne(&self, other: &RangeToInclusive<Idx>) -> 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: &unsafe extern "C" fn(A, B, C, D, E, F, G, H, I, J) -> Ret
) -> bool

impl PartialEq<NonZeroI8> for NonZeroI8

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

fn ne(&self, other: &NonZeroI8) -> 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: &unsafe extern "C" fn(A, B, C, D, E, F, G) -> Ret) -> 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: &extern "C" fn(A, B, C, D, E, F, G, H, I, J, K, L) -> Ret
) -> 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: &extern "C" fn(A, B, C, D, E, F, G, H, I, J, ...) -> Ret
) -> bool

impl PartialEq<u64> for u64

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

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

impl PartialEq<char> for char

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

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

impl<Ret, A, B> PartialEq<extern "C" fn(A, B, ...) -> Ret> for extern "C" fn(A, B, ...) -> Ret

fn eq(&self, other: &extern "C" fn(A, B, ...) -> Ret) -> 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: &extern "C" fn(A, B, C, D, ...) -> Ret) -> 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: &unsafe extern "C" fn(A, B, C, D, E, F, ...) -> Ret) -> bool

impl PartialEq<LayoutErr> for LayoutErr

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

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

impl<T> PartialEq<Option<T>> for Option<T> where
    T: PartialEq<T>, 

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

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

impl PartialEq<isize> for isize

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

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

impl<Ret> PartialEq<unsafe fn() -> Ret> for unsafe fn() -> Ret

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

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

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

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

impl<T> PartialEq<Cell<T>> for Cell<T> where
    T: PartialEq<T> + Copy, 

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

impl PartialEq<f32> for f32

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

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

impl<T, E> PartialEq<Result<T, E>> for Result<T, E> where
    E: PartialEq<E>,
    T: PartialEq<T>, 

fn eq(&self, other: &Result<T, E>) -> bool

fn ne(&self, other: &Result<T, E>) -> bool

impl<P, Q> PartialEq<Pin<Q>> for Pin<P> where
    P: Deref,
    Q: Deref,
    <P as Deref>::Target: PartialEq<<Q as Deref>::Target>, 

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

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

impl PartialEq<ParseBoolError> for ParseBoolError

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

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

impl<const N: usize, A, B> PartialEq<[A; N]> for [B] where
    B: PartialEq<A>,
    [A; N]: LengthAtMost32, 

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

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

impl<A, B, C, D, E, F, G, H, I, J> PartialEq<(A, B, C, D, E, F, G, H, I, J)> for (A, B, C, D, E, F, G, H, I, J) where
    A: PartialEq<A>,
    B: PartialEq<B>,
    C: PartialEq<C>,
    D: PartialEq<D>,
    E: PartialEq<E>,
    F: PartialEq<F>,
    G: PartialEq<G>,
    H: PartialEq<H>,
    I: PartialEq<I>,
    J: PartialEq<J> + ?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<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: &extern "C" fn(A, B, C, D, E, F, G, H, ...) -> Ret) -> bool

impl PartialEq<DecodeUtf16Error> for DecodeUtf16Error

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

fn ne(&self, other: &DecodeUtf16Error) -> 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: &fn(A, B, C, D, E, F) -> Ret) -> bool

impl PartialEq<NonZeroU128> for NonZeroU128

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

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

impl PartialEq<NonZeroIsize> for NonZeroIsize

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

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

impl PartialEq<u16> for u16

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

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

impl<'b, const N: usize, A, B> PartialEq<[A; N]> for &'b mut [B] where
    B: PartialEq<A>,
    [A; N]: LengthAtMost32, 

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

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

impl<A, B, C, D, E, F, G, H> PartialEq<(A, B, C, D, E, F, G, H)> for (A, B, C, D, E, F, G, H) where
    A: PartialEq<A>,
    B: PartialEq<B>,
    C: PartialEq<C>,
    D: PartialEq<D>,
    E: PartialEq<E>,
    F: PartialEq<F>,
    G: PartialEq<G>,
    H: PartialEq<H> + ?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<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: &extern "C" fn(A, B, C, D, E, F, ...) -> Ret) -> bool

impl<Idx> PartialEq<RangeFrom<Idx>> for RangeFrom<Idx> where
    Idx: PartialEq<Idx>, 

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

fn ne(&self, other: &RangeFrom<Idx>) -> 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: &extern "C" fn(A, B, C, D, E, ...) -> Ret) -> bool

impl<T> PartialEq<ManuallyDrop<T>> for ManuallyDrop<T> where
    T: PartialEq<T> + ?Sized, 

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

fn ne(&self, other: &ManuallyDrop<T>) -> 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: &extern "C" fn(A, B, C, ...) -> Ret) -> 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: &unsafe extern "C" fn(A, B, C, D, E) -> Ret) -> bool

impl<Y, R> PartialEq<GeneratorState<Y, R>> for GeneratorState<Y, R> where
    R: PartialEq<R>,
    Y: PartialEq<Y>, 

fn eq(&self, other: &GeneratorState<Y, R>) -> bool

fn ne(&self, other: &GeneratorState<Y, R>) -> 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: &extern "C" fn(A, B, C, D, E, F, G, H, I, J) -> Ret) -> bool

impl<T> PartialEq<Discriminant<T>> for Discriminant<T>

fn eq(&self, rhs: &Discriminant<T>) -> 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: &fn(A, B, C, D, E, F, G, H, I, J, K) -> Ret) -> bool

impl PartialEq<()> for ()

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

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

impl PartialEq<Utf8Error> for Utf8Error

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

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

impl PartialEq<TryFromIntError> for TryFromIntError

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

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

impl<Ret, A, B, C> PartialEq<fn(A, B, C) -> Ret> for fn(A, B, C) -> Ret

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

impl<Idx> PartialEq<RangeInclusive<Idx>> for RangeInclusive<Idx> where
    Idx: PartialEq<Idx>, 

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

fn ne(&self, other: &RangeInclusive<Idx>) -> 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: &fn(A, B, C, D, E, F, G, H, I, J) -> Ret) -> 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: &unsafe extern "C" fn(A, B, C, D) -> Ret) -> 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: &extern "C" fn(A, B, C, D, E, F, G, H) -> Ret) -> 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: &fn(A, B, C, D, E, F, G, H) -> Ret) -> bool

impl PartialEq<RawWaker> for RawWaker

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

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

impl PartialEq<i8> for i8

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

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

impl PartialEq<str> for str

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

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

impl<A, B, C, D, E, F, G, H, I, J, K, 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
    A: PartialEq<A>,
    B: PartialEq<B>,
    C: PartialEq<C>,
    D: PartialEq<D>,
    E: PartialEq<E>,
    F: PartialEq<F>,
    G: PartialEq<G>,
    H: PartialEq<H>,
    I: PartialEq<I>,
    J: PartialEq<J>,
    K: PartialEq<K>,
    L: PartialEq<L> + ?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<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: &fn(A, B, C, D, E, F, G) -> Ret) -> bool

impl<A, B, C, D, E, F, G> PartialEq<(A, B, C, D, E, F, G)> for (A, B, C, D, E, F, G) where
    A: PartialEq<A>,
    B: PartialEq<B>,
    C: PartialEq<C>,
    D: PartialEq<D>,
    E: PartialEq<E>,
    F: PartialEq<F>,
    G: PartialEq<G> + ?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<Ret, A, B> PartialEq<fn(A, B) -> Ret> for fn(A, B) -> Ret

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

impl PartialEq<i32> for i32

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

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

impl<T> PartialEq<Poll<T>> for Poll<T> where
    T: PartialEq<T>, 

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

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

impl PartialEq<NonZeroI32> for NonZeroI32

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

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

impl PartialEq<u32> for u32

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

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

impl<A, B, C, D, E> PartialEq<(A, B, C, D, E)> for (A, B, C, D, E) where
    A: PartialEq<A>,
    B: PartialEq<B>,
    C: PartialEq<C>,
    D: PartialEq<D>,
    E: PartialEq<E> + ?Sized, 

fn eq(&self, other: &(A, B, C, D, E)) -> bool

fn ne(&self, other: &(A, B, C, D, E)) -> 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: &extern "C" fn(A, B, C, D, E, F, G, ...) -> Ret) -> bool

impl PartialEq<NonZeroI128> for NonZeroI128

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

fn ne(&self, other: &NonZeroI128) -> 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: &unsafe extern "C" fn(A, B, C, D, E, F, G, H, I, J, K, L, ...) -> Ret
) -> bool

impl PartialEq<NoneError> for NoneError

fn eq(&self, other: &NoneError) -> 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: &unsafe fn(A, B, C, D, E, F, G, H, I, J, K, L) -> Ret
) -> 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: &unsafe extern "C" fn(A, B, C, D, E, F, G, H, I) -> Ret
) -> 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: &extern "C" fn(A, B, C, D, E, F, G, H, I, J, K, L, ...) -> Ret
) -> bool

impl PartialEq<PhantomPinned> for PhantomPinned

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

impl<Ret, A> PartialEq<fn(A) -> Ret> for fn(A) -> Ret

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

impl PartialEq<CharTryFromError> for CharTryFromError

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

fn ne(&self, other: &CharTryFromError) -> 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: &unsafe extern "C" fn(A, B, C, D, E, ...) -> Ret) -> bool

impl<A, B, C, D, E, F, G, H, I> PartialEq<(A, B, C, D, E, F, G, H, I)> for (A, B, C, D, E, F, G, H, I) where
    A: PartialEq<A>,
    B: PartialEq<B>,
    C: PartialEq<C>,
    D: PartialEq<D>,
    E: PartialEq<E>,
    F: PartialEq<F>,
    G: PartialEq<G>,
    H: PartialEq<H>,
    I: PartialEq<I> + ?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 PartialEq<usize> for usize

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

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

impl<'_, '_, A, B> PartialEq<&'_ mut [B]> for Cow<'_, [A]> where
    A: PartialEq<B> + Clone, 

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

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

impl<A, B> PartialEq<Vec<B>> for Vec<A> where
    A: PartialEq<B>, 

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

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

impl<'a, 'b, B, C> PartialEq<Cow<'b, C>> for Cow<'a, B> where
    B: PartialEq<C> + ToOwned + ?Sized,
    C: ToOwned + ?Sized, 

fn eq(&self, other: &Cow<'b, C>) -> bool

impl<'_, const N: usize, A, B> PartialEq<&'_ [B; N]> for Vec<A> where
    A: PartialEq<B>,
    [B; N]: LengthAtMost32, 

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

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

impl<'_, '_, A, B> PartialEq<&'_ [B]> for Cow<'_, [A]> where
    A: PartialEq<B> + Clone, 

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

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

impl<'a, 'b> PartialEq<&'b str> for Cow<'a, str>

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

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

impl<'a, 'b> PartialEq<str> for String

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

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

impl<'_, A, B> PartialEq<&'_ mut [B]> for Vec<A> where
    A: PartialEq<B>, 

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

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

impl<'a, 'b> PartialEq<String> for &'a str

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

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

impl<'a, 'b> PartialEq<Cow<'a, str>> for &'b str

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

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

impl<'a, 'b> PartialEq<&'a str> for String

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

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

impl<'_, A, B> PartialEq<Vec<B>> for Cow<'_, [A]> where
    A: PartialEq<B> + Clone, 

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

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

impl<T> PartialEq<Box<T>> for Box<T> where
    T: PartialEq<T> + ?Sized, 

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

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

impl<'a, 'b> PartialEq<String> for str

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

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

impl<const N: usize, A, B> PartialEq<[B; N]> for Vec<A> where
    A: PartialEq<B>,
    [B; N]: LengthAtMost32, 

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

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

impl PartialEq<String> for String

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

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

impl<'a, 'b> PartialEq<String> for Cow<'a, str>

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

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

impl<'a, 'b> PartialEq<Cow<'a, str>> for str

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

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

impl<T> PartialEq<Arc<T>> for Arc<T> where
    T: PartialEq<T> + ?Sized, 

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

Equality for two Arcs.

Two Arcs are equal if their inner values are equal, even if they are stored in different allocation.

If T also implements Eq (implying reflexivity of equality), two Arcs that point to the same allocation are always equal.

Examples

use std::sync::Arc;

let five = Arc::new(5);

assert!(five == Arc::new(5));

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

Inequality for two Arcs.

Two Arcs are unequal if their inner values are unequal.

If T also implements Eq (implying reflexivity of equality), two Arcs that point to the same value are never unequal.

Examples

use std::sync::Arc;

let five = Arc::new(5);

assert!(five != Arc::new(6));

impl<T> PartialEq<Rc<T>> for Rc<T> where
    T: PartialEq<T> + ?Sized, 

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

Equality for two Rcs.

Two Rcs are equal if their inner values are equal, even if they are stored in different allocation.

If T also implements Eq (implying reflexivity of equality), two Rcs that point to the same allocation are always equal.

Examples

use std::rc::Rc;

let five = Rc::new(5);

assert!(five == Rc::new(5));

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

Inequality for two Rcs.

Two Rcs are unequal if their inner values are unequal.

If T also implements Eq (implying reflexivity of equality), two Rcs that point to the same allocation are never unequal.

Examples

use std::rc::Rc;

let five = Rc::new(5);

assert!(five != Rc::new(6));

impl PartialEq<FromUtf8Error> for FromUtf8Error

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

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

impl<'a, 'b> PartialEq<Cow<'a, str>> for String

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

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

impl<'_, A, B> PartialEq<&'_ [B]> for Vec<A> where
    A: PartialEq<B>, 

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

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

impl<'a, 'b> PartialEq<str> for Cow<'a, str>

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

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

impl PartialEq<_Unwind_Action> for _Unwind_Action

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

impl PartialEq<_Unwind_Reason_Code> for _Unwind_Reason_Code

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

impl PartialEq<PrintFmt> for PrintFmt

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

impl<T, S> PartialEq<HashSet<T, S>> for HashSet<T, S> where
    S: BuildHasher,
    T: Eq + Hash, 

fn eq(&self, other: &HashSet<T, S>) -> bool

impl<K, V, S> PartialEq<HashMap<K, V, S>> for HashMap<K, V, S> where
    K: Eq + Hash,
    S: BuildHasher,
    V: PartialEq<V>, 

fn eq(&self, other: &HashMap<K, V, S>) -> bool

impl PartialEq<CollectionAllocErr> for CollectionAllocErr

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

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

impl<T, S1, S2> PartialEq<IndexSet<T, S2>> for IndexSet<T, S1> where
    S1: BuildHasher,
    S2: BuildHasher,
    T: Hash + Eq, 

fn eq(&self, other: &IndexSet<T, S2>) -> bool

impl<K, V1, S1, V2, S2> PartialEq<IndexMap<K, V2, S2>> for IndexMap<K, V1, S1> where
    K: Hash + Eq,
    S1: BuildHasher,
    S2: BuildHasher,
    V1: PartialEq<V2>, 

fn eq(&self, other: &IndexMap<K, V2, S2>) -> bool

impl PartialEq<Z0> for Z0

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

impl PartialEq<ATerm> for ATerm

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

impl PartialEq<Greater> for Greater

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

impl PartialEq<Equal> for Equal

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

impl PartialEq<B1> for B1

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

impl PartialEq<B0> for B0

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

impl PartialEq<UTerm> for UTerm

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

impl<U> PartialEq<NInt<U>> for NInt<U> where
    U: NonZero + Unsigned + PartialEq<U>, 

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

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

impl<U, B> PartialEq<UInt<U, B>> for UInt<U, B> where
    B: PartialEq<B>,
    U: PartialEq<U>, 

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

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

impl<U> PartialEq<PInt<U>> for PInt<U> where
    U: NonZero + Unsigned + PartialEq<U>, 

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

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

impl<V, A> PartialEq<TArr<V, A>> for TArr<V, A> where
    A: PartialEq<A>,
    V: PartialEq<V>, 

fn eq(&self, other: &TArr<V, A>) -> bool

fn ne(&self, other: &TArr<V, A>) -> bool

impl PartialEq<Less> for Less

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

impl<T> PartialEq<ModInt<T>> for i8 where
    T: PrimInt, 

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

impl<T> PartialEq<ModInt<T>> for i16 where
    T: PrimInt, 

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

impl<T> PartialEq<ModInt<T>> for i32 where
    T: PrimInt, 

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

impl<T> PartialEq<ModInt<T>> for i64 where
    T: PrimInt, 

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

impl<T> PartialEq<ModInt<T>> for u8 where
    T: PrimInt, 

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

impl<T> PartialEq<ModInt<T>> for u16 where
    T: PrimInt, 

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

impl<T> PartialEq<ModInt<T>> for u32 where
    T: PrimInt, 

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

impl<T> PartialEq<ModInt<T>> for u64 where
    T: PrimInt, 

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

impl<T> PartialEq<ModInt<T>> for isize where
    T: PrimInt, 

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

impl<T> PartialEq<ModInt<T>> for usize where
    T: PrimInt, 

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

Loading content...

Implementors

impl PartialEq<Sign> for Sign

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

impl PartialEq<Ordering> for competitive_hpp::prelude::Ordering

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

impl PartialEq<TryReserveError> for TryReserveError

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

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

impl PartialEq<ParseBigIntError> for ParseBigIntError

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

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

impl PartialEq<ParseRatioError> for ParseRatioError

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

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

impl PartialEq<BigInt> for BigInt

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

impl PartialEq<BigUint> for BigUint

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

impl PartialEq<Eratosthenes> for Eratosthenes

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

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

impl<'_, A, B> PartialEq<&'_ [B]> for VecDeque<A> where
    A: PartialEq<B>, 

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

impl<'_, A, B> PartialEq<&'_ mut [B]> for VecDeque<A> where
    A: PartialEq<B>, 

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

impl<'_, const N: usize, A, B> PartialEq<&'_ [B; N]> for VecDeque<A> where
    A: PartialEq<B>,
    [B; N]: LengthAtMost32, 

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

impl<'_, const N: usize, A, B> PartialEq<&'_ mut [B; N]> for VecDeque<A> where
    A: PartialEq<B>,
    [B; N]: LengthAtMost32, 

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

impl<A> PartialEq<ExtendedGcd<A>> for ExtendedGcd<A> where
    A: PartialEq<A>, 

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

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

impl<A> PartialEq<VecDeque<A>> for VecDeque<A> where
    A: PartialEq<A>, 

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

impl<A, B> PartialEq<EitherOrBoth<A, B>> for EitherOrBoth<A, B> where
    A: PartialEq<A>,
    B: PartialEq<B>, 

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

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

impl<A, B> PartialEq<Vec<B>> for VecDeque<A> where
    A: PartialEq<B>, 

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

impl<E> PartialEq<ParseComplexError<E>> for ParseComplexError<E> where
    E: PartialEq<E>, 

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

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

impl<K, V> PartialEq<BTreeMap<K, V>> for BTreeMap<K, V> where
    K: PartialEq<K>,
    V: PartialEq<V>, 

fn eq(&self, other: &BTreeMap<K, V>) -> bool

impl<K, V, S> PartialEq<HashMap<K, V, S>> for competitive_hpp::prelude::HashMap<K, V, S> where
    K: Eq + Hash,
    S: BuildHasher,
    V: PartialEq<V>, 

fn eq(&self, other: &HashMap<K, V, S>) -> bool

impl<L, R> PartialEq<Either<L, R>> for Either<L, R> where
    L: PartialEq<L>,
    R: PartialEq<R>, 

fn eq(&self, other: &Either<L, R>) -> bool

fn ne(&self, other: &Either<L, R>) -> bool

impl<T> PartialEq<Bound<T>> for Bound<T> where
    T: PartialEq<T>, 

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

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

impl<T> PartialEq<FoldWhile<T>> for FoldWhile<T> where
    T: PartialEq<T>, 

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

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

impl<T> PartialEq<MinMaxResult<T>> for MinMaxResult<T> where
    T: PartialEq<T>, 

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

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

impl<T> PartialEq<Position<T>> for Position<T> where
    T: PartialEq<T>, 

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

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

impl<T> PartialEq<Ratio<T>> for Ratio<T> where
    T: Clone + Integer, 

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

impl<T> PartialEq<BTreeSet<T>> for BTreeSet<T> where
    T: PartialEq<T>, 

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

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

impl<T> PartialEq<Complex<T>> for Complex<T> where
    T: PartialEq<T>, 

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

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

impl<T> PartialEq<LinkedList<T>> for LinkedList<T> where
    T: PartialEq<T>, 

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

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

impl<T> PartialEq<Reverse<T>> for Reverse<T> where
    T: PartialEq<T>, 

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

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

impl<T> PartialEq<T> for ModInt<T> where
    T: PrimInt, 

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

impl<T, S> PartialEq<HashSet<T, S>> for competitive_hpp::prelude::HashSet<T, S> where
    S: BuildHasher,
    T: Eq + Hash, 

fn eq(&self, other: &HashSet<T, S>) -> bool

impl<T: PartialEq> PartialEq<ModFact<T>> for ModFact<T>

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

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

impl<T: PartialEq> PartialEq<ModInt<T>> for ModInt<T>

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

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

impl<T: PartialEq> PartialEq<Total<T>> for Total<T>

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

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

impl<const N: usize, A, B> PartialEq<[B; N]> for VecDeque<A> where
    A: PartialEq<B>,
    [B; N]: LengthAtMost32, 

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

Loading content...