Struct parry3d::utils::HashablePartialEq [−][src]
pub struct HashablePartialEq<T> { /* fields omitted */ }
Expand description
A structure that implements Eq
and is hashable even if the wrapped data implements only
PartialEq
.
Implementations
Creates a new HashablePartialEq
. Please make sure that you really
want to transform the wrapped object’s partial equality to an equivalence relation.
Trait Implementations
This method tests for self
and other
values to be equal, and is used
by ==
. Read more
This method tests for !=
.
Auto Trait Implementations
impl<T> RefUnwindSafe for HashablePartialEq<T> where
T: RefUnwindSafe,
impl<T> Send for HashablePartialEq<T> where
T: Send,
impl<T> Sync for HashablePartialEq<T> where
T: Sync,
impl<T> Unpin for HashablePartialEq<T> where
T: Unpin,
impl<T> UnwindSafe for HashablePartialEq<T> where
T: UnwindSafe,
Blanket Implementations
Mutably borrows from an owned value. Read more
Convert Box<dyn Trait>
(where Trait: Downcast
) to Box<dyn Any>
. Box<dyn Any>
can
then be further downcast
into Box<ConcreteType>
where ConcreteType
implements Trait
. Read more
Convert Rc<Trait>
(where Trait: Downcast
) to Rc<Any>
. Rc<Any>
can then be
further downcast
into Rc<ConcreteType>
where ConcreteType
implements Trait
. Read more
Convert &Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &Any
’s vtable from &Trait
’s. Read more
Convert &mut Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &mut Any
’s vtable from &mut Trait
’s. Read more
The inverse inclusion map: attempts to construct self
from the equivalent element of its
superset. Read more
Checks if self
is actually part of its subset T
(and can be converted to it).
Use with care! Same as self.to_subset
but without any property checks. Always succeeds.
The inclusion map: converts self
to the equivalent element of its superset.