Struct oxygengine_physics_2d::prelude::nalgebra::base::coordinates::M3x6
source · #[repr(C)]pub struct M3x6<T>where
T: Scalar,{Show 18 fields
pub m11: T,
pub m21: T,
pub m31: T,
pub m12: T,
pub m22: T,
pub m32: T,
pub m13: T,
pub m23: T,
pub m33: T,
pub m14: T,
pub m24: T,
pub m34: T,
pub m15: T,
pub m25: T,
pub m35: T,
pub m16: T,
pub m26: T,
pub m36: 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
§m12: T
§m22: T
§m32: T
§m13: T
§m23: T
§m33: T
§m14: T
§m24: T
§m34: T
§m15: T
§m25: T
§m35: T
§m16: T
§m26: T
§m36: T
Trait Implementations§
source§impl<'de, T> Deserialize<'de> for M3x6<T>where
T: Scalar + Deserialize<'de>,
impl<'de, T> Deserialize<'de> for M3x6<T>where T: Scalar + Deserialize<'de>,
source§fn deserialize<__D>(
__deserializer: __D
) -> Result<M3x6<T>, <__D as Deserializer<'de>>::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>( __deserializer: __D ) -> Result<M3x6<T>, <__D as Deserializer<'de>>::Error>where __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
source§impl<T> PartialEq<M3x6<T>> for M3x6<T>where
T: PartialEq<T> + Scalar,
impl<T> PartialEq<M3x6<T>> for M3x6<T>where T: PartialEq<T> + Scalar,
source§impl<T> Serialize for M3x6<T>where
T: Scalar + Serialize,
impl<T> Serialize for M3x6<T>where T: Scalar + Serialize,
source§fn serialize<__S>(
&self,
__serializer: __S
) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>where
__S: Serializer,
fn serialize<__S>( &self, __serializer: __S ) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>where __S: Serializer,
Serialize this value into the given Serde serializer. Read more
impl<T> Copy for M3x6<T>where T: Copy + Scalar,
impl<T> Eq for M3x6<T>where T: Eq + Scalar,
impl<T> StructuralEq for M3x6<T>where T: Scalar,
impl<T> StructuralPartialEq for M3x6<T>where T: Scalar,
Auto Trait Implementations§
impl<T> RefUnwindSafe for M3x6<T>where T: RefUnwindSafe,
impl<T> Send for M3x6<T>where T: Send,
impl<T> Sync for M3x6<T>where T: Sync,
impl<T> Unpin for M3x6<T>where T: Unpin,
impl<T> UnwindSafe for M3x6<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
§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere T: Any,
§fn into_any(self: Box<T, Global>) -> Box<dyn Any, Global>
fn into_any(self: Box<T, Global>) -> Box<dyn Any, 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
.§fn into_any_rc(self: Rc<T, Global>) -> Rc<dyn Any, Global>
fn into_any_rc(self: Rc<T, Global>) -> Rc<dyn Any, Global>
Convert
Rc<Trait>
(where Trait: Downcast
) to Rc<Any>
. Rc<Any>
can then be
further downcast
into Rc<ConcreteType>
where ConcreteType
implements Trait
.§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.§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.§impl<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,
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more
§impl<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,
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.§impl<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,
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more
source§impl<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,
source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.§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 more§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).§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.