Struct parry3d_f64::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
impl<T> HashablePartialEq<T>
[src]
impl<T> HashablePartialEq<T>
[src]pub unsafe fn new(value: T) -> HashablePartialEq<T>
[src]
pub unsafe fn new(value: T) -> HashablePartialEq<T>
[src]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
impl<T: Clone> Clone for HashablePartialEq<T>
[src]
impl<T: Clone> Clone for HashablePartialEq<T>
[src]fn clone(&self) -> HashablePartialEq<T>
[src]
fn clone(&self) -> HashablePartialEq<T>
[src]Returns a copy of the value. Read more
fn clone_from(&mut self, source: &Self)
1.0.0[src]
fn clone_from(&mut self, source: &Self)
1.0.0[src]Performs copy-assignment from source
. Read more
impl<T: Debug> Debug for HashablePartialEq<T>
[src]
impl<T: Debug> Debug for HashablePartialEq<T>
[src]impl<T: AsBytes> Hash for HashablePartialEq<T>
[src]
impl<T: AsBytes> Hash for HashablePartialEq<T>
[src]impl<T: PartialEq> PartialEq<HashablePartialEq<T>> for HashablePartialEq<T>
[src]
impl<T: PartialEq> PartialEq<HashablePartialEq<T>> for HashablePartialEq<T>
[src]fn eq(&self, other: &HashablePartialEq<T>) -> bool
[src]
fn eq(&self, other: &HashablePartialEq<T>) -> bool
[src]This method tests for self
and other
values to be equal, and is used
by ==
. Read more
fn ne(&self, other: &HashablePartialEq<T>) -> bool
[src]
fn ne(&self, other: &HashablePartialEq<T>) -> bool
[src]This method tests for !=
.
impl<T: PartialEq> Eq for HashablePartialEq<T>
[src]
impl<T> StructuralPartialEq for HashablePartialEq<T>
[src]
Auto Trait Implementations
impl<T> RefUnwindSafe for HashablePartialEq<T> where
T: RefUnwindSafe,
T: RefUnwindSafe,
impl<T> Send for HashablePartialEq<T> where
T: Send,
T: Send,
impl<T> Sync for HashablePartialEq<T> where
T: Sync,
T: Sync,
impl<T> Unpin for HashablePartialEq<T> where
T: Unpin,
T: Unpin,
impl<T> UnwindSafe for HashablePartialEq<T> where
T: UnwindSafe,
T: UnwindSafe,
Blanket Implementations
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]pub fn borrow_mut(&mut self) -> &mut T
[src]
pub fn borrow_mut(&mut self) -> &mut T
[src]Mutably borrows from an owned value. Read more
impl<T> Downcast for T where
T: Any,
[src]
impl<T> Downcast for T where
T: Any,
[src]pub fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>
[src]
pub fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>
[src]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
pub fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
[src]
pub fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
[src]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
pub fn as_any(&self) -> &(dyn Any + 'static)
[src]
pub fn as_any(&self) -> &(dyn Any + 'static)
[src]Convert &Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &Any
’s vtable from &Trait
’s. Read more
pub fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
[src]
pub fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
[src]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
impl<T> DowncastSync for T where
T: Any + Send + Sync,
[src]
impl<T> DowncastSync for T where
T: Any + Send + Sync,
[src]impl<T> Same<T> for T
impl<T> Same<T> for T
type Output = T
type Output = T
Should always be Self
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
[src]
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
[src]pub fn to_subset(&self) -> Option<SS>
[src]
pub fn to_subset(&self) -> Option<SS>
[src]The inverse inclusion map: attempts to construct self
from the equivalent element of its
superset. Read more
pub fn is_in_subset(&self) -> bool
[src]
pub fn is_in_subset(&self) -> bool
[src]Checks if self
is actually part of its subset T
(and can be converted to it).
pub fn to_subset_unchecked(&self) -> SS
[src]
pub fn to_subset_unchecked(&self) -> SS
[src]Use with care! Same as self.to_subset
but without any property checks. Always succeeds.
pub fn from_subset(element: &SS) -> SP
[src]
pub fn from_subset(element: &SS) -> SP
[src]The inclusion map: converts self
to the equivalent element of its superset.
impl<T> ToOwned for T where
T: Clone,
[src]
impl<T> ToOwned for T where
T: Clone,
[src]type Owned = T
type Owned = T
The resulting type after obtaining ownership.
pub fn to_owned(&self) -> T
[src]
pub fn to_owned(&self) -> T
[src]Creates owned data from borrowed data, usually by cloning. Read more
pub fn clone_into(&self, target: &mut T)
[src]
pub fn clone_into(&self, target: &mut T)
[src]🔬 This is a nightly-only experimental API. (toowned_clone_into
)
recently added
Uses borrowed data to replace owned data, usually by cloning. Read more