Struct nalgebra::base::coordinates::M5x5
source · #[repr(C)]pub struct M5x5<N: Scalar> {Show 25 fields
pub m11: N,
pub m21: N,
pub m31: N,
pub m41: N,
pub m51: N,
pub m12: N,
pub m22: N,
pub m32: N,
pub m42: N,
pub m52: N,
pub m13: N,
pub m23: N,
pub m33: N,
pub m43: N,
pub m53: N,
pub m14: N,
pub m24: N,
pub m34: N,
pub m44: N,
pub m54: N,
pub m15: N,
pub m25: N,
pub m35: N,
pub m45: N,
pub m55: N,
}
Expand description
Data structure used to provide access to matrix and vector coordinates with the dot
notation, e.g., v.x
is the same as v[0]
for a vector.
Fields§
§m11: N
§m21: N
§m31: N
§m41: N
§m51: N
§m12: N
§m22: N
§m32: N
§m42: N
§m52: N
§m13: N
§m23: N
§m33: N
§m43: N
§m53: N
§m14: N
§m24: N
§m34: N
§m44: N
§m54: N
§m15: N
§m25: N
§m35: N
§m45: N
§m55: N
Trait Implementations§
source§impl<N: PartialEq + Scalar> PartialEq<M5x5<N>> for M5x5<N>
impl<N: PartialEq + Scalar> PartialEq<M5x5<N>> for M5x5<N>
impl<N: Copy + Scalar> Copy for M5x5<N>
impl<N: Eq + Scalar> Eq for M5x5<N>
impl<N: Scalar> StructuralEq for M5x5<N>
impl<N: Scalar> StructuralPartialEq for M5x5<N>
Auto Trait Implementations§
impl<N> RefUnwindSafe for M5x5<N>where
N: RefUnwindSafe,
impl<N> Send for M5x5<N>where
N: Send,
impl<N> Sync for M5x5<N>where
N: Sync,
impl<N> Unpin for M5x5<N>where
N: Unpin,
impl<N> UnwindSafe for M5x5<N>where
N: UnwindSafe,
Blanket Implementations§
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§unsafe fn to_subset_unchecked(&self) -> SS
unsafe 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.