Enum fyrox_math::RotationOrder
source · pub enum RotationOrder {
XYZ,
XZY,
YZX,
YXZ,
ZXY,
ZYX,
}
Variants§
Trait Implementations§
source§impl Clone for RotationOrder
impl Clone for RotationOrder
source§fn clone(&self) -> RotationOrder
fn clone(&self) -> RotationOrder
Returns a copy 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 Hash for RotationOrder
impl Hash for RotationOrder
source§impl Ord for RotationOrder
impl Ord for RotationOrder
source§fn cmp(&self, other: &RotationOrder) -> Ordering
fn cmp(&self, other: &RotationOrder) -> Ordering
1.21.0 · source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere
Self: Sized,
Compares and returns the maximum of two values. Read more
source§impl PartialEq for RotationOrder
impl PartialEq for RotationOrder
source§fn eq(&self, other: &RotationOrder) -> bool
fn eq(&self, other: &RotationOrder) -> bool
This method tests for
self
and other
values to be equal, and is used
by ==
.source§impl PartialOrd for RotationOrder
impl PartialOrd for RotationOrder
source§fn partial_cmp(&self, other: &RotationOrder) -> Option<Ordering>
fn partial_cmp(&self, other: &RotationOrder) -> Option<Ordering>
1.0.0 · source§fn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
This method tests less than or equal to (for
self
and other
) and is used by the <=
operator. Read moreimpl Copy for RotationOrder
impl Eq for RotationOrder
impl StructuralPartialEq for RotationOrder
Auto Trait Implementations§
impl RefUnwindSafe for RotationOrder
impl Send for RotationOrder
impl Sync for RotationOrder
impl Unpin for RotationOrder
impl UnwindSafe for RotationOrder
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<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.