Trait signature_core::lib::cmp::PartialEq

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, c of type A, B, C):

• Symmetric: if A: PartialEq<B> and B: PartialEq<A>, then a == b implies b == a; and

• Transitive: if A: PartialEq<B> and B: PartialEq<C> and A: PartialEq<C>, then a == b and b == c implies a == c.

Note that the B: PartialEq<A> (symmetric) and A: PartialEq<C> (transitive) impls are not forced to exist, but these requirements apply whenever they do exist.

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<RawWaker> for RawWaker

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

pub fn ne(&self, other: &RawWaker) -> 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

pub 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> PartialEq<fn(A, B, C, D, E, F, G) -> Ret> for fn(A, B, C, D, E, F, G) -> Ret

pub fn eq(&self, other: &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<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

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

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

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

pub fn eq(&self, other: &fn() -> 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

pub 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, 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

pub fn eq(
    &self,
    other: &extern "C" fn(A, B, C, D, E, F, G, H, ...) -> Ret
) -> bool

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

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

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

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

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

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

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

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

impl PartialEq<Ordering> for Ordering

pub fn eq(&self, other: &Ordering) -> 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

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

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

pub fn eq(&self, other: &fn(A) -> 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
    C: PartialEq<C>,
    D: PartialEq<D>,
    A: PartialEq<A>,
    B: PartialEq<B>,
    E: PartialEq<E>,
    F: PartialEq<F>,
    I: PartialEq<I> + ?Sized,
    G: PartialEq<G>,
    H: PartialEq<H>, 

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

pub fn ne(&self, other: &(A, B, C, D, E, F, G, H, I)) -> bool

impl PartialEq<CpuidResult> for CpuidResult

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

pub fn ne(&self, other: &CpuidResult) -> 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
    C: PartialEq<C>,
    D: PartialEq<D>,
    A: PartialEq<A>,
    B: PartialEq<B>,
    E: PartialEq<E>,
    F: PartialEq<F>,
    K: PartialEq<K> + ?Sized,
    I: PartialEq<I>,
    G: PartialEq<G>,
    H: PartialEq<H>,
    J: PartialEq<J>, 

pub fn eq(&self, other: &(A, B, C, D, E, F, G, H, I, J, K)) -> bool

pub 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, 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

pub 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> PartialEq<extern "C" fn(A, B, C, D, E, F, G) -> Ret> for extern "C" fn(A, B, C, D, E, F, G) -> Ret

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

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

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

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

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

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

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

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

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

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

impl PartialEq<i16> for i16

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

pub fn ne(&self, other: &i16) -> 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

pub fn eq(&self, other: &fn(A, B, C, D, E, F, G, H, I, J, K, L) -> Ret) -> bool

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

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

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

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

pub fn ne(&self, other: &Bound<T>) -> 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

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

pub fn eq(
    &self,
    other: &unsafe 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> 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

pub fn eq(
    &self,
    other: &extern "C" fn(A, B, C, D, E, F, G, H, I, ...) -> Ret
) -> bool

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

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

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

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

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

pub fn eq(&self, other: &unsafe fn() -> Ret) -> 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

pub fn eq(
    &self,
    other: &unsafe 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> 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

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

pub 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> PartialEq<fn(A, B, C, D, E, F, G, H, I) -> Ret> for fn(A, B, C, D, E, F, G, H, I) -> Ret

pub fn eq(&self, other: &fn(A, B, C, D, E, F, G, H, I) -> Ret) -> bool

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

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

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

pub fn eq(
    &self,
    other: &unsafe extern "C" fn(A, B, C, D, E, F, G, H, I, J) -> Ret
) -> bool

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

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

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

impl PartialEq<ParseCharError> for ParseCharError

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

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

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

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

pub fn ne(&self, other: &(A,)) -> 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
    C: PartialEq<C>,
    D: PartialEq<D>,
    A: PartialEq<A>,
    B: PartialEq<B>,
    E: PartialEq<E>,
    F: PartialEq<F>,
    I: PartialEq<I>,
    G: PartialEq<G>,
    H: PartialEq<H>,
    J: PartialEq<J> + ?Sized, 

pub fn eq(&self, other: &(A, B, C, D, E, F, G, H, I, J)) -> bool

pub fn ne(&self, other: &(A, B, C, D, E, F, G, H, I, J)) -> bool

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

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

pub fn ne(&self, other: &Poll<T>) -> 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

pub fn eq(
    &self,
    other: &unsafe extern "C" fn(A, B, C, D, E, F, G, H, I, J, ...) -> Ret
) -> bool

impl PartialEq<u128> for u128

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

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

impl PartialEq<bool> for bool

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

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

impl PartialEq<!> for !

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

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

pub fn eq(&self, other: &fn(A, B, C) -> 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

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

impl PartialEq<usize> for usize

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

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

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

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

pub fn ne(&self, other: &RangeTo<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

pub fn eq(&self, other: &extern "C" 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

pub fn eq(&self, other: &unsafe fn(A, B, C) -> 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

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

impl PartialEq<RangeFull> for RangeFull

pub fn eq(&self, other: &RangeFull) -> 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

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

pub fn eq(
    &self,
    other: &extern "C" fn(A, B, C, D, E, F, G, H, I, J, K, L) -> Ret
) -> bool

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

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

pub fn ne(&self, other: &[A; N]) -> 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

pub fn eq(&self, other: &extern "C" fn(A, B, C, D, E, F, G, ...) -> Ret) -> bool

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

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

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

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

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

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

pub fn eq(&self, other: &unsafe fn(A, B) -> 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

pub fn eq(&self, other: &unsafe fn(A, B, C, D, E, F, G, H, I) -> Ret) -> bool

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

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

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

impl PartialEq<i128> for i128

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

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

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

pub fn eq(&self, other: &unsafe extern "C" fn() -> Ret) -> 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

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

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

pub fn eq(&self, other: &extern "C" fn(A, B, C, D, E, F, G, H) -> Ret) -> bool

impl PartialEq<u16> for u16

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

pub fn ne(&self, other: &u16) -> 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

pub 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> PartialEq<fn(A, B, C, D, E, F, G, H) -> Ret> for fn(A, B, C, D, E, F, G, H) -> Ret

pub fn eq(&self, other: &fn(A, B, C, D, E, F, G, H) -> 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
    C: PartialEq<C>,
    D: PartialEq<D>,
    A: PartialEq<A>,
    B: PartialEq<B>,
    E: PartialEq<E>,
    F: PartialEq<F>,
    G: PartialEq<G> + ?Sized, 

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

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

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

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

pub fn ne(&self, other: &[A; N]) -> 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

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

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

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

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

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

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

impl PartialEq<f64> for f64

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

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

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

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

pub fn ne(&self, other: &&mut B) -> 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
    C: PartialEq<C>,
    D: PartialEq<D>,
    A: PartialEq<A>,
    B: PartialEq<B>,
    E: PartialEq<E>,
    F: PartialEq<F>,
    K: PartialEq<K>,
    I: PartialEq<I>,
    G: PartialEq<G>,
    H: PartialEq<H>,
    J: PartialEq<J>,
    L: PartialEq<L> + ?Sized, 

pub fn eq(&self, other: &(A, B, C, D, E, F, G, H, I, J, K, L)) -> bool

pub 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> PartialEq<unsafe extern "C" fn(A, B, C, D, E, F) -> Ret> for unsafe extern "C" fn(A, B, C, D, E, F) -> Ret

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

pub fn eq(&self, other: &unsafe fn(A, B, C, D, E, F, G, H, I, J) -> Ret) -> bool

impl PartialEq<LayoutError> for LayoutError

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

pub fn ne(&self, other: &LayoutError) -> 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

pub fn eq(
    &self,
    other: &extern "C" fn(A, B, C, D, E, F, G, H, I, J) -> Ret
) -> bool

impl PartialEq<i32> for i32

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

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

impl PartialEq<AllocError> for AllocError

pub fn eq(&self, other: &AllocError) -> 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

pub fn eq(&self, other: &unsafe fn(A, B, C, D, E) -> 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

pub 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> PartialEq<unsafe extern "C" fn(A, B, C, D) -> Ret> for unsafe extern "C" fn(A, B, C, D) -> Ret

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

impl<B, C> PartialEq<ControlFlow<B, C>> for ControlFlow<B, C> where
    C: PartialEq<C>,
    B: PartialEq<B>, 

pub fn eq(&self, other: &ControlFlow<B, C>) -> bool

pub fn ne(&self, other: &ControlFlow<B, C>) -> bool

impl PartialEq<RawWakerVTable> for RawWakerVTable

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

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

impl PartialEq<DecodeUtf16Error> for DecodeUtf16Error

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

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

impl PartialEq<TypeId> for TypeId

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

pub fn ne(&self, other: &TypeId) -> 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

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

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

pub 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> PartialEq<fn(A, B, C, D, E, F) -> Ret> for fn(A, B, C, D, E, F) -> Ret

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

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

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

impl<A, B> PartialEq<[B]> for [A] where
    A: PartialEq<B>, 

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

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

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

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

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

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

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

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

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

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

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

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

impl PartialEq<char> for char

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

pub fn ne(&self, other: &char) -> 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

pub fn eq(
    &self,
    other: &unsafe extern "C" fn(A, B, C, D, E, F, G, H) -> Ret
) -> bool

impl PartialEq<u32> for u32

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

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

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

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

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

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

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

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

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

impl PartialEq<f32> for f32

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

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

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

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

impl PartialEq<Layout> for Layout

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

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

impl PartialEq<i8> for i8

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

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

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

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

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

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

impl PartialEq<()> for ()

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

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

impl<'a> PartialEq<Location<'a>> for Location<'a>

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

pub fn ne(&self, other: &Location<'a>) -> 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

pub fn eq(&self, other: &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
    C: PartialEq<C> + ?Sized,
    A: PartialEq<A>,
    B: PartialEq<B>, 

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

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

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

pub fn eq(&self, other: &unsafe fn(A) -> 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

pub fn eq(
    &self,
    other: &unsafe extern "C" fn(A, B, C, D, E, F, G, H, I) -> Ret
) -> bool

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

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

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

impl PartialEq<u64> for u64

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

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

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

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

impl PartialEq<str> for str

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

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

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

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

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

impl PartialEq<u8> for u8

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

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

impl PartialEq<i64> for i64

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

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

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

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

impl PartialEq<CharTryFromError> for CharTryFromError

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

pub fn ne(&self, other: &CharTryFromError) -> 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

pub fn eq(
    &self,
    other: &extern "C" fn(A, B, C, D, E, F, G, H, I, J, K) -> Ret
) -> bool

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

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

pub fn ne(&self, other: &RangeInclusive<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

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

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

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

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

impl PartialEq<isize> for isize

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

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

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

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

pub 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
    C: PartialEq<C>,
    D: PartialEq<D>,
    A: PartialEq<A>,
    B: PartialEq<B>,
    E: PartialEq<E>,
    F: PartialEq<F>,
    G: PartialEq<G>,
    H: PartialEq<H> + ?Sized, 

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

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

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

pub fn eq(
    &self,
    other: &unsafe fn(A, B, C, D, E, F, G, H, I, J, K, L) -> Ret
) -> bool

impl<Dyn> PartialEq<DynMetadata<Dyn>> for DynMetadata<Dyn> where
    Dyn: ?Sized, 

pub fn eq(&self, other: &DynMetadata<Dyn>) -> bool

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

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

impl PartialEq<Duration> for Duration

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

pub fn ne(&self, other: &Duration) -> 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

pub fn eq(
    &self,
    other: &unsafe extern "C" fn(A, B, C, D, E, F, ...) -> Ret
) -> bool

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

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

pub fn eq(
    &self,
    other: &extern "C" fn(A, B, C, D, E, F, G, H, I) -> Ret
) -> bool

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

pub fn eq(&self, other: &extern "C" fn(A) -> Ret) -> 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

pub fn eq(&self, other: &fn(A, B, C, D, E, F, G, H, I, J, K) -> Ret) -> bool

impl PartialEq<FileType> for FileType

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

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

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

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

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

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

impl PartialEq<Ipv6Addr> for IpAddr

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

impl PartialEq<TryRecvError> for TryRecvError

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

impl PartialEq<CString> for CString

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

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

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

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

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

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

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

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

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

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

impl PartialEq<OsStr> for OsStr

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

impl PartialEq<BacktraceStatus> for BacktraceStatus

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

impl PartialEq<Ipv6Addr> for Ipv6Addr

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

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

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

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

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

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

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

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

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

impl PartialEq<FromBytesWithNulError> for FromBytesWithNulError

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

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

impl PartialEq<PathBuf> for PathBuf

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

impl PartialEq<Ipv4Addr> for IpAddr

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

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

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

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

impl PartialEq<ExitStatus> for ExitStatus

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

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

impl PartialEq<CStr> for CStr

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

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

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

impl PartialEq<WaitTimeoutResult> for WaitTimeoutResult

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

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

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

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

impl PartialEq<FromVecWithNulError> for FromVecWithNulError

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

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

impl PartialEq<Path> for Path

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

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

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

impl PartialEq<RecvTimeoutError> for RecvTimeoutError

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

impl PartialEq<UCred> for UCred

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

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

impl PartialEq<ThreadId> for ThreadId

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

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

impl PartialEq<str> for OsString

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

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

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

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

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

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

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

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

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

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

impl PartialEq<IpAddr> for Ipv6Addr

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

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

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

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

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

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

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

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

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

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

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

impl PartialEq<AccessError> for AccessError

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

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

impl PartialEq<AddrParseError> for AddrParseError

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

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

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

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

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

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

impl PartialEq<IpAddr> for Ipv4Addr

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

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

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

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

impl PartialEq<VarError> for VarError

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

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

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

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

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

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

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

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

impl PartialEq<SeekFrom> for SeekFrom

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

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

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

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

impl PartialEq<str> for OsStr

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

impl PartialEq<IpAddr> for IpAddr

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

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

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

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

impl PartialEq<OsString> for OsString

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

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

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

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

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

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

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

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

impl PartialEq<RecvError> for RecvError

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

impl PartialEq<IntoStringError> for IntoStringError

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

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

impl PartialEq<SocketAddrV4> for SocketAddrV4

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

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

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

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

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

impl PartialEq<StripPrefixError> for StripPrefixError

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

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

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

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

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

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

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

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

impl PartialEq<Output> for Output

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

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

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

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

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

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

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

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

impl PartialEq<NulError> for NulError

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

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

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

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

impl PartialEq<ErrorKind> for ErrorKind

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

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

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

impl PartialEq<OsStr> for str

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

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

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

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

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

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

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

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

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

impl PartialEq<SocketAddr> for SocketAddr

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

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

impl PartialEq<OsString> for str

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

impl PartialEq<Shutdown> for Shutdown

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

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

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

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

impl PartialEq<Permissions> for Permissions

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

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

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

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

impl PartialEq<SystemTime> for SystemTime

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

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

impl PartialEq<Instant> for Instant

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

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

impl PartialEq<Ipv4Addr> for Ipv4Addr

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

impl PartialEq<Ipv6MulticastScope> for Ipv6MulticastScope

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

impl PartialEq<SocketAddrV6> for SocketAddrV6

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

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

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

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

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

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

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

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

impl<T, U, A> PartialEq<Vec<U, A>> for Vec<T, A> where
    T: PartialEq<U>,
    A: Allocator, 

pub fn eq(&self, other: &Vec<U, A>) -> bool

pub fn ne(&self, other: &Vec<U, A>) -> bool

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

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

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

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

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

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

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

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

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

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

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

impl<T, U, A> PartialEq<[U]> for Vec<T, A> where
    T: PartialEq<U>,
    A: Allocator, 

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

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

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

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

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

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

pub fn eq(&self, other: &Vec<U, A>) -> bool

pub fn ne(&self, other: &Vec<U, A>) -> bool

impl<'_, T, U, A> PartialEq<Vec<U, A>> for &'_ [T] where
    T: PartialEq<U>,
    A: Allocator, 

pub fn eq(&self, other: &Vec<U, A>) -> bool

pub fn ne(&self, other: &Vec<U, A>) -> bool

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

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

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

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

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

impl PartialEq<TryReserveError> for TryReserveError

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

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

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

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

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

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

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

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

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

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

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

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

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

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

impl<'_, T, U, A> PartialEq<&'_ [U]> for Vec<T, A> where
    T: PartialEq<U>,
    A: Allocator, 

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

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

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

pub fn eq(&self, other: &Vec<U, A>) -> bool

pub fn ne(&self, other: &Vec<U, A>) -> bool

impl PartialEq<String> for String

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

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

impl<T, U, A, const N: usize> PartialEq<[U; N]> for Vec<T, A> where
    T: PartialEq<U>,
    A: Allocator, 

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

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

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

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

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

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

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

impl<'_, T, U, A, const N: usize> PartialEq<&'_ [U; N]> for Vec<T, A> where
    T: PartialEq<U>,
    A: Allocator, 

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

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

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

pub 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));

pub 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<A, B, const N: usize> PartialEq<[B; N]> for VecDeque<A> where
    A: PartialEq<B>, 

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

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

pub 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));

pub 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<'a, 'b, B, C> PartialEq<Cow<'b, C>> for Cow<'a, B> where
    C: ToOwned + ?Sized,
    B: PartialEq<C> + ToOwned + ?Sized, 

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

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

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

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

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

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

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

impl<T, U, A> PartialEq<Vec<U, A>> for [T] where
    T: PartialEq<U>,
    A: Allocator, 

pub fn eq(&self, other: &Vec<U, A>) -> bool

pub fn ne(&self, other: &Vec<U, A>) -> bool

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

impl PartialEq<FromUtf8Error> for FromUtf8Error

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

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

impl PartialEq<_Unwind_Reason_Code> for _Unwind_Reason_Code

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

impl PartialEq<_Unwind_Action> for _Unwind_Action

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

impl<T, N> PartialEq<GenericArray<T, N>> for GenericArray<T, N> where
    T: PartialEq<T>,
    N: ArrayLength<T>, 

pub fn eq(&self, other: &GenericArray<T, N>) -> bool

impl PartialEq<ATerm> for ATerm

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

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

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

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

impl PartialEq<Greater> for Greater

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

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

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

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

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

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

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

impl PartialEq<Less> for Less

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

impl PartialEq<UTerm> for UTerm

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

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

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

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

impl PartialEq<Equal> for Equal

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

impl<M> PartialEq<Output<M>> for Output<M> where
    M: Mac, 

pub fn eq(&self, x: &Output<M>) -> bool

impl PartialEq<MacError> for MacError

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

impl PartialEq<InvalidKeyLength> for InvalidKeyLength

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

impl PartialEq<Gt> for Gt

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

impl PartialEq<Scalar> for Scalar

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

impl PartialEq<G1Projective> for G1Projective

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

impl PartialEq<G2Projective> for G2Projective

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

impl PartialEq<G2Affine> for G2Affine

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

impl PartialEq<G1Affine> for G1Affine

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

impl<'_, '_, M1, M2, O1, O2, T1, T2> PartialEq<BitRef<'_, M2, O2, T2>> for BitRef<'_, M1, O1, T1> where
    T1: BitStore,
    T2: BitStore,
    M1: Mutability,
    M2: Mutability,
    O1: BitOrder,
    O2: BitOrder, 

Test equality of proxy references by the value of their proxied bit.

To test equality by address, decay to a BitPtr with into_bitptr.

pub fn eq(&self, other: &BitRef<'_, M2, O2, T2>) -> bool

impl<'_, O1, O2, T1, T2> PartialEq<BitSlice<O2, T2>> for &'_ mut BitSlice<O1, T1> where
    T1: BitStore,
    T2: BitStore,
    O1: BitOrder,
    O2: BitOrder, 

pub fn eq(&self, rhs: &BitSlice<O2, T2>) -> bool

impl<M1, M2, T1, T2> PartialEq<Address<M2, T2>> for Address<M1, T1> where
    T1: BitStore,
    T2: BitStore,
    M1: Mutability,
    M2: Mutability, 

pub fn eq(&self, other: &Address<M2, T2>) -> bool

impl<M1, M2, O, T1, T2> PartialEq<BitPtrRange<M2, O, T2>> for BitPtrRange<M1, O, T1> where
    O: BitOrder,
    T1: BitStore,
    T2: BitStore,
    M1: Mutability,
    M2: Mutability, 

pub fn eq(&self, other: &BitPtrRange<M2, O, T2>) -> bool

impl<R> PartialEq<BitIdxError<R>> for BitIdxError<R> where
    R: PartialEq<R> + BitRegister, 

pub fn eq(&self, other: &BitIdxError<R>) -> bool

pub fn ne(&self, other: &BitIdxError<R>) -> bool

impl<'_, O1, O2, T1, T2> PartialEq<BitSlice<O2, T2>> for &'_ BitSlice<O1, T1> where
    T1: BitStore,
    T2: BitStore,
    O1: BitOrder,
    O2: BitOrder, 

pub fn eq(&self, rhs: &BitSlice<O2, T2>) -> bool

impl PartialEq<Msb0> for Msb0

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

impl<M1, M2, O, T1, T2> PartialEq<BitPtr<M2, O, T2>> for BitPtr<M1, O, T1> where
    O: BitOrder,
    T1: BitStore,
    T2: BitStore,
    M1: Mutability,
    M2: Mutability, 

pub fn eq(&self, other: &BitPtr<M2, O, T2>) -> bool

impl<O1, O2, T1, T2> PartialEq<BitSlice<O2, T2>> for BitSlice<O1, T1> where
    T1: BitStore,
    T2: BitStore,
    O1: BitOrder,
    O2: BitOrder, 

Tests if two BitSlices are semantically — not bitwise — equal.

It is valid to compare slices of different ordering or memory types.

The equality condition requires that they have the same length and that at each index, the two slices have the same bit value.

pub fn eq(&self, rhs: &BitSlice<O2, T2>) -> bool

impl<O, V, Rhs> PartialEq<Rhs> for BitArray<O, V> where
    Rhs: ?Sized,
    V: BitView,
    O: BitOrder,
    BitSlice<O, <V as BitView>::Store>: PartialEq<Rhs>, 

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

impl<'_, O1, O2, T1, T2> PartialEq<&'_ BitSlice<O2, T2>> for BitSlice<O1, T1> where
    T1: BitStore,
    T2: BitStore,
    O1: BitOrder,
    O2: BitOrder, 

pub fn eq(&self, rhs: &&BitSlice<O2, T2>) -> bool

impl PartialEq<Const> for Const

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

impl PartialEq<Mut> for Mut

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

impl<T> PartialEq<BitSpanError<T>> for BitSpanError<T> where
    T: PartialEq<T> + BitStore, 

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

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

impl<'a, O, T> PartialEq<IterOnes<'a, O, T>> for IterOnes<'a, O, T> where
    T: PartialEq<T> + BitStore,
    O: PartialEq<O> + BitOrder, 

pub fn eq(&self, other: &IterOnes<'a, O, T>) -> bool

pub fn ne(&self, other: &IterOnes<'a, O, T>) -> bool

impl<O, V, T> PartialEq<BitArray<O, V>> for BitSlice<O, T> where
    T: BitStore,
    V: BitView,
    O: BitOrder, 

pub fn eq(&self, other: &BitArray<O, V>) -> bool

impl<R> PartialEq<BitIdx<R>> for BitIdx<R> where
    R: PartialEq<R> + BitRegister, 

pub fn eq(&self, other: &BitIdx<R>) -> bool

pub fn ne(&self, other: &BitIdx<R>) -> bool

impl<'a, O, T> PartialEq<IterZeros<'a, O, T>> for IterZeros<'a, O, T> where
    T: PartialEq<T> + BitStore,
    O: PartialEq<O> + BitOrder, 

pub fn eq(&self, other: &IterZeros<'a, O, T>) -> bool

pub fn ne(&self, other: &IterZeros<'a, O, T>) -> bool

impl PartialEq<Lsb0> for Lsb0

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

impl<R> PartialEq<BitPos<R>> for BitPos<R> where
    R: PartialEq<R> + BitRegister, 

pub fn eq(&self, other: &BitPos<R>) -> bool

pub fn ne(&self, other: &BitPos<R>) -> bool

impl<R> PartialEq<BitMask<R>> for BitMask<R> where
    R: PartialEq<R> + BitRegister, 

pub fn eq(&self, other: &BitMask<R>) -> bool

pub fn ne(&self, other: &BitMask<R>) -> bool

impl<T> PartialEq<BitPtrError<T>> for BitPtrError<T> where
    T: PartialEq<T> + BitStore,
    <T as BitStore>::Mem: PartialEq<<T as BitStore>::Mem>, 

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

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

impl<'_, O1, O2, T1, T2> PartialEq<&'_ mut BitSlice<O2, T2>> for BitSlice<O1, T1> where
    T1: BitStore,
    T2: BitStore,
    O1: BitOrder,
    O2: BitOrder, 

pub fn eq(&self, rhs: &&mut BitSlice<O2, T2>) -> bool

impl<'_, '_, M, O, T> PartialEq<&'_ bool> for BitRef<'_, M, O, T> where
    T: BitStore,
    M: Mutability,
    O: BitOrder, 

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

impl<'_, M, O, T> PartialEq<bool> for BitRef<'_, M, O, T> where
    T: BitStore,
    M: Mutability,
    O: BitOrder, 

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

impl<R> PartialEq<BitSel<R>> for BitSel<R> where
    R: PartialEq<R> + BitRegister, 

pub fn eq(&self, other: &BitSel<R>) -> bool

pub fn ne(&self, other: &BitSel<R>) -> bool

impl<T> PartialEq<AddressError<T>> for AddressError<T> where
    T: PartialEq<T> + BitStore, 

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

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

impl<R> PartialEq<BitTail<R>> for BitTail<R> where
    R: PartialEq<R> + BitRegister, 

pub fn eq(&self, other: &BitTail<R>) -> bool

pub fn ne(&self, other: &BitTail<R>) -> bool

impl<Z> PartialEq<Zeroizing<Z>> for Zeroizing<Z> where
    Z: PartialEq<Z> + Zeroize, 

pub fn eq(&self, other: &Zeroizing<Z>) -> bool

pub fn ne(&self, other: &Zeroizing<Z>) -> bool

impl PartialEq<LittleEndian> for LittleEndian

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

impl PartialEq<BigEndian> for BigEndian

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

impl<'a, 'b, N> PartialEq<String<N>> for &'a str where
    N: ArrayLength<u8>, 

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

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

impl<K, V, N, N2> PartialEq<LinearMap<K, V, N2>> for LinearMap<K, V, N> where
    N: ArrayLength<(K, V)>,
    N2: ArrayLength<(K, V)>,
    K: Eq,
    V: PartialEq<V>, 

pub fn eq(&self, other: &LinearMap<K, V, N2>) -> bool

impl<T, N1, N2, S1, S2> PartialEq<IndexSet<T, N2, S2>> for IndexSet<T, N1, S1> where
    T: Eq + Hash,
    N1: ArrayLength<Bucket<T, ()>> + ArrayLength<Option<Pos>>,
    N2: ArrayLength<Bucket<T, ()>> + ArrayLength<Option<Pos>>,
    S2: BuildHasher,
    S1: BuildHasher, 

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

impl<K, V, N, S, N2, S2> PartialEq<IndexMap<K, V, N2, S2>> for IndexMap<K, V, N, S> where
    S: BuildHasher,
    N: ArrayLength<Bucket<K, V>> + ArrayLength<Option<Pos>>,
    N2: ArrayLength<Bucket<K, V>> + ArrayLength<Option<Pos>>,
    K: Eq + Hash,
    V: Eq,
    S2: BuildHasher, 

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

impl<P> PartialEq<Box<P, Init>> for Box<P, Init> where
    P: Pool,
    <P as Pool>::Data: PartialEq<<P as Pool>::Data>, 

pub fn eq(&self, rhs: &Box<P, Init>) -> bool

impl<T, N, U, C, N2, U2, C2> PartialEq<Queue<T, N2, U2, C2>> for Queue<T, N, U, C> where
    C: XCore,
    T: PartialEq<T>,
    N: ArrayLength<T>,
    U2: Uxx,
    N2: ArrayLength<T>,
    U: Uxx,
    C2: XCore, 

pub fn eq(&self, other: &Queue<T, N2, U2, C2>) -> bool

impl<T> PartialEq<Box<T, Init>> for Box<T, Init> where
    T: PartialEq<T>, 

pub fn eq(&self, rhs: &Box<T, Init>) -> bool

impl<'a, 'b, N> PartialEq<String<N>> for str where
    N: ArrayLength<u8>, 

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

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

impl<T, N> PartialEq<GenericArray<T, N>> for GenericArray<T, N> where
    T: PartialEq<T>,
    N: ArrayLength<T>, 

pub fn eq(&self, other: &GenericArray<T, N>) -> bool

impl<T, N> PartialEq<GenericArray<T, N>> for GenericArray<T, N> where
    T: PartialEq<T>,
    N: ArrayLength<T>, 

pub fn eq(&self, other: &GenericArray<T, N>) -> bool

impl PartialEq<Error> for Error

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

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

impl<'a> PartialEq<Unexpected<'a>> for Unexpected<'a>

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

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

impl PartialEq<TryReserveError> for TryReserveError

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

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

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

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

impl PartialEq<Error> for Error

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

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

Loading content...

Implementors

impl PartialEq<Infallible> for Infallible

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

impl PartialEq<FpCategory> for FpCategory

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

impl PartialEq<IntErrorKind> for IntErrorKind

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

impl PartialEq<SearchStep> for SearchStep

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

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

impl PartialEq<Ordering> for signature_core::lib::cmp::Ordering

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

impl PartialEq<Challenge> for Challenge

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

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

impl PartialEq<Commitment> for Commitment

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

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

impl PartialEq<Message> for Message

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

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

impl PartialEq<Nonce> for Nonce

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

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

impl PartialEq<SignatureBlinding> for SignatureBlinding

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

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

impl PartialEq<Error> for signature_core::lib::fmt::Error

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

impl PartialEq<PhantomPinned> for PhantomPinned

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

impl PartialEq<NonZeroI8> for NonZeroI8

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

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

impl PartialEq<NonZeroI16> for NonZeroI16

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

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

impl PartialEq<NonZeroI32> for NonZeroI32

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

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

impl PartialEq<NonZeroI64> for NonZeroI64

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

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

impl PartialEq<NonZeroI128> for NonZeroI128

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

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

impl PartialEq<NonZeroIsize> for NonZeroIsize

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

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

impl PartialEq<NonZeroU8> for NonZeroU8

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

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

impl PartialEq<NonZeroU16> for NonZeroU16

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

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

impl PartialEq<NonZeroU32> for NonZeroU32

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

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

impl PartialEq<NonZeroU64> for NonZeroU64

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

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

impl PartialEq<NonZeroU128> for NonZeroU128

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

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

impl PartialEq<NonZeroUsize> for NonZeroUsize

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

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

impl PartialEq<ParseFloatError> for ParseFloatError

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

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

impl PartialEq<ParseIntError> for ParseIntError

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

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

impl PartialEq<TryFromIntError> for TryFromIntError

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

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

impl PartialEq<NoneError> for NoneError

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

impl PartialEq<ParseBoolError> for ParseBoolError

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

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

impl PartialEq<Utf8Error> for Utf8Error

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

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

impl PartialEq<B0> for B0

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

impl PartialEq<B1> for B1

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

impl PartialEq<Z0> for Z0

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

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

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

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

impl<'a, 'b, A, B, N> PartialEq<&'a [B; 0]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<&'a [B; 1]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<&'a [B; 2]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<&'a [B; 3]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<&'a [B; 4]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<&'a [B; 5]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<&'a [B; 6]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<&'a [B; 7]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<&'a [B; 8]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<&'a [B; 9]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<&'a [B; 10]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<&'a [B; 11]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<&'a [B; 12]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<&'a [B; 13]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<&'a [B; 14]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<&'a [B; 15]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<&'a [B; 16]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<&'a [B; 17]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<&'a [B; 18]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<&'a [B; 19]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<&'a [B; 20]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<&'a [B; 21]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<&'a [B; 22]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<&'a [B; 23]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<&'a [B; 24]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<&'a [B; 25]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<&'a [B; 26]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<&'a [B; 27]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<&'a [B; 28]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<&'a [B; 29]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<&'a [B; 30]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<&'a [B; 31]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<&'a [B; 32]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<[B; 0]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<[B; 1]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<[B; 2]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<[B; 3]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<[B; 4]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<[B; 5]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<[B; 6]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<[B; 7]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<[B; 8]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<[B; 9]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<[B; 10]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<[B; 11]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<[B; 12]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<[B; 13]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<[B; 14]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<[B; 15]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<[B; 16]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<[B; 17]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<[B; 18]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<[B; 19]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<[B; 20]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<[B; 21]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<[B; 22]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<[B; 23]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<[B; 24]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<[B; 25]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<[B; 26]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<[B; 27]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<[B; 28]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<[B; 29]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<[B; 30]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<[B; 31]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<[B; 32]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<&'a [B]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<&'a mut [B]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, A, B, N> PartialEq<[B]> for signature_core::lib::Vec<A, N> where
    N: ArrayLength<A>,
    A: PartialEq<B>, 

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

impl<'a, 'b, N> PartialEq<&'a str> for signature_core::lib::String<N> where
    N: ArrayLength<u8>, 

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

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

impl<'a, 'b, N> PartialEq<str> for signature_core::lib::String<N> where
    N: ArrayLength<u8>, 

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

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

impl<A, B, N1, N2> PartialEq<Vec<B, N2>> for signature_core::lib::Vec<A, N1> where
    A: PartialEq<B>,
    N1: ArrayLength<A>,
    N2: ArrayLength<B>, 

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

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

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

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

impl<K, V, S, A> PartialEq<HashMap<K, V, S, A>> for signature_core::lib::HashMap<K, V, S, A> where
    S: BuildHasher,
    A: Allocator + Clone,
    K: Eq + Hash,
    V: PartialEq<V>, 

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

impl<N1, N2> PartialEq<String<N2>> for signature_core::lib::String<N1> where
    N1: ArrayLength<u8>,
    N2: ArrayLength<u8>, 

pub fn eq(&self, rhs: &String<N2>) -> bool

pub fn ne(&self, rhs: &String<N2>) -> bool

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

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

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

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

pub fn eq(&self, rhs: &Discriminant<T>) -> bool

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

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

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

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

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

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

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

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

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

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

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

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

Panics

Panics if the value in either RefCell is currently borrowed.

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

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

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

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

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

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

impl<T, S, A> PartialEq<HashSet<T, S, A>> for signature_core::lib::HashSet<T, S, A> where
    S: BuildHasher,
    T: Eq + Hash,
    A: Allocator + Clone, 

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

Loading content...