Struct heron::rapier_plugin::rapier2d::prelude::nalgebra::base::coordinates::M5x5
source · pub struct M5x5<T>where
T: Scalar,{Show 25 fields
pub m11: T,
pub m21: T,
pub m31: T,
pub m41: T,
pub m51: T,
pub m12: T,
pub m22: T,
pub m32: T,
pub m42: T,
pub m52: T,
pub m13: T,
pub m23: T,
pub m33: T,
pub m43: T,
pub m53: T,
pub m14: T,
pub m24: T,
pub m34: T,
pub m44: T,
pub m54: T,
pub m15: T,
pub m25: T,
pub m35: T,
pub m45: T,
pub m55: T,
}
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: T
m21: T
m31: T
m41: T
m51: T
m12: T
m22: T
m32: T
m42: T
m52: T
m13: T
m23: T
m33: T
m43: T
m53: T
m14: T
m24: T
m34: T
m44: T
m54: T
m15: T
m25: T
m35: T
m45: T
m55: T
Trait Implementations
sourceimpl<T> PartialEq<M5x5<T>> for M5x5<T>where
T: PartialEq<T> + Scalar,
impl<T> PartialEq<M5x5<T>> for M5x5<T>where
T: PartialEq<T> + Scalar,
impl<T> Copy for M5x5<T>where
T: Copy + Scalar,
impl<T> Eq for M5x5<T>where
T: Eq + Scalar,
impl<T> StructuralEq for M5x5<T>where
T: Scalar,
impl<T> StructuralPartialEq for M5x5<T>where
T: Scalar,
Auto Trait Implementations
impl<T> RefUnwindSafe for M5x5<T>where
T: RefUnwindSafe,
impl<T> Send for M5x5<T>where
T: Send,
impl<T> Sync for M5x5<T>where
T: Sync,
impl<T> Unpin for M5x5<T>where
T: Unpin,
impl<T> UnwindSafe for M5x5<T>where
T: UnwindSafe,
Blanket Implementations
impl<T, U> AsBindGroupShaderType<U> for Twhere
U: ShaderType,
&'a T: for<'a> Into<U>,
impl<T, U> AsBindGroupShaderType<U> for Twhere
U: ShaderType,
&'a T: for<'a> Into<U>,
fn as_bind_group_shader_type(
&self,
_images: &HashMap<Handle<Image>, <Image as RenderAsset>::PreparedAsset, RandomState, Global>
) -> U
fn as_bind_group_shader_type(
&self,
_images: &HashMap<Handle<Image>, <Image as RenderAsset>::PreparedAsset, RandomState, Global>
) -> U
Return the
T
[ShaderType
] for self
. When used in [AsBindGroup
]
derives, it is safe to assume that all images in self
exist. Read moresourceimpl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>
fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>
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 morefn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
Convert
Rc<Trait>
(where Trait: Downcast
) to Rc<Any>
. Rc<Any>
can then be
further downcast
into Rc<ConcreteType>
where ConcreteType
implements Trait
. Read morefn 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. Read morefn 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. Read moreimpl<T> DynHash for Twhere
T: DynEq + Hash,
impl<T> DynHash for Twhere
T: DynEq + Hash,
sourceimpl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
sourcefn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.sourceimpl<T> Instrument for T
impl<T> Instrument for T
sourcefn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
sourcefn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
impl<T> Pointable for T
impl<T> Pointable for T
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
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 morefn 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).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.fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self
to the equivalent element of its superset.