Trait std::cmp::Eq
[−]
[src]
pub trait Eq: PartialEq<Self> { fn assert_receiver_is_total_eq(&self) { ... } }
Trait for equality comparisons which are equivalence relations.
This means, that in addition to a == b
and a != b
being strict inverses, the equality must
be (for all a
, b
and c
):
- reflexive:
a == a
; - symmetric:
a == b
impliesb == a
; and - transitive:
a == b
andb == c
impliesa == c
.
This property cannot be checked by the compiler, and therefore Eq
implies
PartialEq
, and has no extra methods.
This trait can be used with #[derive]
.
Provided Methods
fn assert_receiver_is_total_eq(&self)
Implementors
impl<T> Eq for Wrapping<T> where T: Eq
impl<'a> Eq for Part<'a>
impl Eq for Sign
impl<'a> Eq for Decimal<'a>
impl<'a> Eq for ParseResult<'a>
impl Eq for Big32x40
impl Eq for Big8x3
impl<T> Eq for NonZero<T> where T: Zeroable + Eq
impl<T> Eq for *const T where T: ?Sized
impl<T> Eq for *mut T where T: ?Sized
impl<Ret> Eq for fn() -> Ret
impl<Ret> Eq for extern "C" fn() -> Ret
impl<Ret> Eq for unsafe fn() -> Ret
impl<Ret> Eq for unsafe extern "C" fn() -> Ret
impl<Ret, A> Eq for fn(A) -> Ret
impl<Ret, A> Eq for extern "C" fn(A) -> Ret
impl<Ret, A> Eq for unsafe fn(A) -> Ret
impl<Ret, A> Eq for unsafe extern "C" fn(A) -> Ret
impl<Ret, A, B> Eq for fn(A, B) -> Ret
impl<Ret, A, B> Eq for extern "C" fn(A, B) -> Ret
impl<Ret, A, B> Eq for unsafe fn(A, B) -> Ret
impl<Ret, A, B> Eq for unsafe extern "C" fn(A, B) -> Ret
impl<Ret, A, B, C> Eq for fn(A, B, C) -> Ret
impl<Ret, A, B, C> Eq for extern "C" fn(A, B, C) -> Ret
impl<Ret, A, B, C> Eq for unsafe fn(A, B, C) -> Ret
impl<Ret, A, B, C> Eq for unsafe extern "C" fn(A, B, C) -> Ret
impl<Ret, A, B, C, D> Eq for fn(A, B, C, D) -> Ret
impl<Ret, A, B, C, D> Eq for extern "C" fn(A, B, C, D) -> Ret
impl<Ret, A, B, C, D> Eq for unsafe fn(A, B, C, D) -> Ret
impl<Ret, A, B, C, D> Eq for unsafe extern "C" fn(A, B, C, D) -> Ret
impl<Ret, A, B, C, D, E> Eq for fn(A, B, C, D, E) -> Ret
impl<Ret, A, B, C, D, E> Eq for extern "C" fn(A, B, C, D, E) -> Ret
impl<Ret, A, B, C, D, E> Eq for unsafe fn(A, B, C, D, E) -> Ret
impl<Ret, A, B, C, D, E> Eq for unsafe extern "C" fn(A, B, C, D, E) -> Ret
impl<Ret, A, B, C, D, E, F> Eq for fn(A, B, C, D, E, F) -> Ret
impl<Ret, A, B, C, D, E, F> Eq for extern "C" fn(A, B, C, D, E, F) -> Ret
impl<Ret, A, B, C, D, E, F> Eq for unsafe fn(A, B, C, D, E, F) -> Ret
impl<Ret, A, B, C, D, E, F> Eq for unsafe extern "C" fn(A, B, C, D, E, F) -> Ret
impl<Ret, A, B, C, D, E, F, G> Eq for fn(A, B, C, D, E, F, G) -> Ret
impl<Ret, A, B, C, D, E, F, G> Eq for extern "C" fn(A, B, C, D, E, F, G) -> Ret
impl<Ret, A, B, C, D, E, F, G> Eq for unsafe fn(A, B, C, D, E, F, G) -> Ret
impl<Ret, A, B, C, D, E, F, G> Eq for unsafe extern "C" fn(A, B, C, D, E, F, G) -> Ret
impl<Ret, A, B, C, D, E, F, G, H> Eq for fn(A, B, C, D, E, F, G, H) -> Ret
impl<Ret, A, B, C, D, E, F, G, H> Eq for extern "C" fn(A, B, C, D, E, F, G, H) -> Ret
impl<Ret, A, B, C, D, E, F, G, H> Eq for unsafe fn(A, B, C, D, E, F, G, H) -> Ret
impl<Ret, A, B, C, D, E, F, G, H> Eq for unsafe extern "C" fn(A, B, C, D, E, F, G, H) -> Ret
impl<Ret, A, B, C, D, E, F, G, H, I> Eq for fn(A, B, C, D, E, F, G, H, I) -> Ret
impl<Ret, A, B, C, D, E, F, G, H, I> Eq for extern "C" fn(A, B, C, D, E, F, G, H, I) -> Ret
impl<Ret, A, B, C, D, E, F, G, H, I> Eq for unsafe fn(A, B, C, D, E, F, G, H, I) -> Ret
impl<Ret, A, B, C, D, E, F, G, H, I> Eq for unsafe extern "C" fn(A, B, C, D, E, F, G, H, I) -> Ret
impl<Ret, A, B, C, D, E, F, G, H, I, J> Eq for fn(A, B, C, D, E, F, G, H, I, J) -> Ret
impl<Ret, A, B, C, D, E, F, G, H, I, J> Eq for extern "C" fn(A, B, C, D, E, F, G, H, I, J) -> Ret
impl<Ret, A, B, C, D, E, F, G, H, I, J> Eq for unsafe fn(A, B, C, D, E, F, G, H, I, J) -> Ret
impl<Ret, A, B, C, D, E, F, G, H, I, J> Eq for unsafe extern "C" fn(A, B, C, D, E, F, G, H, I, J) -> Ret
impl<Ret, A, B, C, D, E, F, G, H, I, J, K> Eq for fn(A, B, C, D, E, F, G, H, I, J, K) -> Ret
impl<Ret, A, B, C, D, E, F, G, H, I, J, K> Eq for extern "C" fn(A, B, C, D, E, F, G, H, I, J, K) -> Ret
impl<Ret, A, B, C, D, E, F, G, H, I, J, K> Eq for unsafe fn(A, B, C, D, E, F, G, H, I, J, K) -> Ret
impl<Ret, A, B, C, D, E, F, G, H, I, J, K> Eq for unsafe extern "C" fn(A, B, C, D, E, F, G, H, I, J, K) -> Ret
impl<Ret, A, B, C, D, E, F, G, H, I, J, K, L> Eq for fn(A, B, C, D, E, F, G, H, I, J, K, L) -> Ret
impl<Ret, A, B, C, D, E, F, G, H, I, J, K, L> Eq for extern "C" fn(A, B, C, D, E, F, G, H, I, J, K, L) -> Ret
impl<Ret, A, B, C, D, E, F, G, H, I, J, K, L> Eq for unsafe fn(A, B, C, D, E, F, G, H, I, J, K, L) -> Ret
impl<Ret, A, B, C, D, E, F, G, H, I, J, K, L> Eq for unsafe extern "C" fn(A, B, C, D, E, F, G, H, I, J, K, L) -> Ret
impl<T> Eq for PhantomData<T> where T: ?Sized
impl Eq for RangeFull
impl<Idx> Eq for Range<Idx> where Idx: Eq
impl<Idx> Eq for RangeFrom<Idx> where Idx: Eq
impl<Idx> Eq for RangeTo<Idx> where Idx: Eq
impl Eq for Ordering
impl Eq for ()
impl Eq for bool
impl Eq for char
impl Eq for usize
impl Eq for u8
impl Eq for u16
impl Eq for u32
impl Eq for u64
impl Eq for isize
impl Eq for i8
impl Eq for i16
impl Eq for i32
impl Eq for i64
impl<'a, A> Eq for &'a A where A: Eq + ?Sized
impl<'a, A> Eq for &'a mut A where A: Eq + ?Sized
impl Eq for TypeId
impl<T> Eq for [T; 0] where T: Eq
impl<T> Eq for [T; 1] where T: Eq
impl<T> Eq for [T; 2] where T: Eq
impl<T> Eq for [T; 3] where T: Eq
impl<T> Eq for [T; 4] where T: Eq
impl<T> Eq for [T; 5] where T: Eq
impl<T> Eq for [T; 6] where T: Eq
impl<T> Eq for [T; 7] where T: Eq
impl<T> Eq for [T; 8] where T: Eq
impl<T> Eq for [T; 9] where T: Eq
impl<T> Eq for [T; 10] where T: Eq
impl<T> Eq for [T; 11] where T: Eq
impl<T> Eq for [T; 12] where T: Eq
impl<T> Eq for [T; 13] where T: Eq
impl<T> Eq for [T; 14] where T: Eq
impl<T> Eq for [T; 15] where T: Eq
impl<T> Eq for [T; 16] where T: Eq
impl<T> Eq for [T; 17] where T: Eq
impl<T> Eq for [T; 18] where T: Eq
impl<T> Eq for [T; 19] where T: Eq
impl<T> Eq for [T; 20] where T: Eq
impl<T> Eq for [T; 21] where T: Eq
impl<T> Eq for [T; 22] where T: Eq
impl<T> Eq for [T; 23] where T: Eq
impl<T> Eq for [T; 24] where T: Eq
impl<T> Eq for [T; 25] where T: Eq
impl<T> Eq for [T; 26] where T: Eq
impl<T> Eq for [T; 27] where T: Eq
impl<T> Eq for [T; 28] where T: Eq
impl<T> Eq for [T; 29] where T: Eq
impl<T> Eq for [T; 30] where T: Eq
impl<T> Eq for [T; 31] where T: Eq
impl<T> Eq for [T; 32] where T: Eq
impl<T> Eq for Cell<T> where T: Copy + Eq
impl Eq for BorrowState
impl<T> Eq for RefCell<T> where T: Eq + ?Sized
impl<T> Eq for Option<T> where T: Eq
impl<T, E> Eq for Result<T, E> where E: Eq, T: Eq
impl<T> Eq for [T] where T: Eq
impl Eq for SearchStep
impl Eq for Utf8Error
impl Eq for str
impl<A> Eq for (A,) where A: Eq
impl<A, B> Eq for (A, B) where A: Eq, B: Eq
impl<A, B, C> Eq for (A, B, C) where B: Eq, C: Eq, A: Eq
impl<A, B, C, D> Eq for (A, B, C, D) where A: Eq, B: Eq, C: Eq, D: Eq
impl<A, B, C, D, E> Eq for (A, B, C, D, E) where A: Eq, B: Eq, E: Eq, D: Eq, C: Eq
impl<A, B, C, D, E, F> Eq for (A, B, C, D, E, F) where B: Eq, F: Eq, D: Eq, A: Eq, E: Eq, C: Eq
impl<A, B, C, D, E, F, G> Eq for (A, B, C, D, E, F, G) where B: Eq, A: Eq, G: Eq, C: Eq, D: Eq, F: Eq, E: Eq
impl<A, B, C, D, E, F, G, H> Eq for (A, B, C, D, E, F, G, H) where G: Eq, H: Eq, E: Eq, C: Eq, A: Eq, F: Eq, D: Eq, B: Eq
impl<A, B, C, D, E, F, G, H, I> Eq for (A, B, C, D, E, F, G, H, I) where G: Eq, H: Eq, A: Eq, F: Eq, C: Eq, E: Eq, D: Eq, I: Eq, B: Eq
impl<A, B, C, D, E, F, G, H, I, J> Eq for (A, B, C, D, E, F, G, H, I, J) where I: Eq, F: Eq, C: Eq, J: Eq, A: Eq, B: Eq, E: Eq, H: Eq, G: Eq, D: Eq
impl<A, B, C, D, E, F, G, H, I, J, K> Eq for (A, B, C, D, E, F, G, H, I, J, K) where H: Eq, K: Eq, J: Eq, F: Eq, C: Eq, D: Eq, B: Eq, E: Eq, I: Eq, A: Eq, G: Eq
impl<A, B, C, D, E, F, G, H, I, J, K, L> Eq for (A, B, C, D, E, F, G, H, I, J, K, L) where J: Eq, L: Eq, G: Eq, B: Eq, A: Eq, C: Eq, H: Eq, K: Eq, E: Eq, I: Eq, F: Eq, D: Eq
impl<T> Eq for Box<T> where T: Eq + ?Sized
impl<T> Eq for Arc<T> where T: Eq + ?Sized
impl<T> Eq for Rc<T> where T: Eq + ?Sized
impl<K, V> Eq for BTreeMap<K, V> where V: Eq, K: Eq
impl<T> Eq for BTreeSet<T> where T: Eq
impl<'a, B> Eq for Cow<'a, B> where B: Eq + ToOwned + ?Sized
impl<E> Eq for EnumSet<E> where E: Eq
impl<A> Eq for LinkedList<A> where A: Eq
impl Eq for String
impl Eq for ParseError
impl<T> Eq for Vec<T> where T: Eq
impl<A> Eq for VecDeque<A> where A: Eq
impl<T> Eq for Bound<T> where T: Eq
impl<K, V, S> Eq for HashMap<K, V, S> where K: Eq + Hash, V: Eq, S: HashState
impl<T, S> Eq for HashSet<T, S> where T: Eq + Hash, S: HashState