pub struct HashablePartialEq<T> { /* private fields */ }Expand description
A structure that implements Eq and is hashable even if the wrapped data implements only
PartialEq.
Implementations§
Source§impl<T> HashablePartialEq<T>
impl<T> HashablePartialEq<T>
Sourcepub unsafe fn new(value: T) -> HashablePartialEq<T>
pub unsafe fn new(value: T) -> HashablePartialEq<T>
Creates a new HashablePartialEq. This is unsafe because you must be sure that you really
want to transform the wrapped object’s partial equality to an equivalence relation.
Trait Implementations§
Source§impl<T: Clone> Clone for HashablePartialEq<T>
impl<T: Clone> Clone for HashablePartialEq<T>
Source§fn clone(&self) -> HashablePartialEq<T>
fn clone(&self) -> HashablePartialEq<T>
Returns a duplicate of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl<T: Debug> Debug for HashablePartialEq<T>
impl<T: Debug> Debug for HashablePartialEq<T>
Source§impl<T: AsBytes> Hash for HashablePartialEq<T>
impl<T: AsBytes> Hash for HashablePartialEq<T>
Source§impl<T: PartialEq> PartialEq for HashablePartialEq<T>
impl<T: PartialEq> PartialEq for HashablePartialEq<T>
impl<T: PartialEq> Eq for HashablePartialEq<T>
impl<T> StructuralPartialEq for HashablePartialEq<T>
Auto Trait Implementations§
impl<T> Freeze for HashablePartialEq<T>where
T: Freeze,
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§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
Source§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
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.Source§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Convert
Rc<Trait> (where Trait: Downcast) to Rc<Any>. Rc<Any> can then be
further downcast into Rc<ConcreteType> where ConcreteType implements Trait.Source§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
Convert
&Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &Any’s vtable from &Trait’s.Source§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
Convert
&mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &mut Any’s vtable from &mut Trait’s.Source§impl<T> DowncastSync for T
impl<T> DowncastSync for T
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.