Struct oxygengine_physics_2d::prelude::nalgebra::base::ArrayStorage
source · #[repr(transparent)]pub struct ArrayStorage<T, const R: usize, const C: usize>(pub [[T; R]; C]);
Expand description
A array-based statically sized matrix data storage.
Tuple Fields§
§0: [[T; R]; C]
Implementations§
Trait Implementations§
source§impl<T, const R: usize, const C: usize> Clone for ArrayStorage<T, R, C>where
T: Clone,
impl<T, const R: usize, const C: usize> Clone for ArrayStorage<T, R, C>where T: Clone,
source§fn clone(&self) -> ArrayStorage<T, R, C>
fn clone(&self) -> ArrayStorage<T, R, C>
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<T, const R: usize, const C: usize> Default for ArrayStorage<T, R, C>where
T: Default,
[[T; R]; C]: Default,
impl<T, const R: usize, const C: usize> Default for ArrayStorage<T, R, C>where T: Default, [[T; R]; C]: Default,
source§fn default() -> ArrayStorage<T, R, C>
fn default() -> ArrayStorage<T, R, C>
Returns the “default value” for a type. Read more
source§impl<'a, T, const R: usize, const C: usize> Deserialize<'a> for ArrayStorage<T, R, C>where
T: Scalar + Deserialize<'a>,
impl<'a, T, const R: usize, const C: usize> Deserialize<'a> for ArrayStorage<T, R, C>where T: Scalar + Deserialize<'a>,
source§fn deserialize<D>(
deserializer: D
) -> Result<ArrayStorage<T, R, C>, <D as Deserializer<'a>>::Error>where
D: Deserializer<'a>,
fn deserialize<D>( deserializer: D ) -> Result<ArrayStorage<T, R, C>, <D as Deserializer<'a>>::Error>where D: Deserializer<'a>,
Deserialize this value from the given Serde deserializer. Read more
source§impl<T, const R: usize, const C: usize> PartialEq<ArrayStorage<T, R, C>> for ArrayStorage<T, R, C>where
T: PartialEq<T>,
impl<T, const R: usize, const C: usize> PartialEq<ArrayStorage<T, R, C>> for ArrayStorage<T, R, C>where T: PartialEq<T>,
source§fn eq(&self, other: &ArrayStorage<T, R, C>) -> bool
fn eq(&self, other: &ArrayStorage<T, R, C>) -> bool
This method tests for
self
and other
values to be equal, and is used
by ==
.source§impl<T, const R: usize, const C: usize> RawStorage<T, Const<R>, Const<C>> for ArrayStorage<T, R, C>
impl<T, const R: usize, const C: usize> RawStorage<T, Const<R>, Const<C>> for ArrayStorage<T, R, C>
source§fn shape(&self) -> (Const<R>, Const<C>)
fn shape(&self) -> (Const<R>, Const<C>)
The dimension of the matrix at run-time. Arr length of zero indicates the additive identity
element of any dimension. Must be equal to
Self::dimension()
if it is not None
.source§fn strides(
&self
) -> (<ArrayStorage<T, R, C> as RawStorage<T, Const<R>, Const<C>>>::RStride, <ArrayStorage<T, R, C> as RawStorage<T, Const<R>, Const<C>>>::CStride)
fn strides( &self ) -> (<ArrayStorage<T, R, C> as RawStorage<T, Const<R>, Const<C>>>::RStride, <ArrayStorage<T, R, C> as RawStorage<T, Const<R>, Const<C>>>::CStride)
The spacing between consecutive row elements and consecutive column elements. Read more
source§fn is_contiguous(&self) -> bool
fn is_contiguous(&self) -> bool
Indicates whether this data buffer stores its elements contiguously. Read more
source§unsafe fn as_slice_unchecked(&self) -> &[T]
unsafe fn as_slice_unchecked(&self) -> &[T]
Retrieves the data buffer as a contiguous slice. Read more
source§fn linear_index(&self, irow: usize, icol: usize) -> usize
fn linear_index(&self, irow: usize, icol: usize) -> usize
Compute the index corresponding to the irow-th row and icol-th column of this matrix. The
index must be such that the following holds: Read more
source§fn get_address_unchecked_linear(&self, i: usize) -> *const T
fn get_address_unchecked_linear(&self, i: usize) -> *const T
Gets the address of the i-th matrix component without performing bound-checking. Read more
source§fn get_address_unchecked(&self, irow: usize, icol: usize) -> *const T
fn get_address_unchecked(&self, irow: usize, icol: usize) -> *const T
Gets the address of the i-th matrix component without performing bound-checking. Read more
source§impl<T, const R: usize, const C: usize> RawStorageMut<T, Const<R>, Const<C>> for ArrayStorage<T, R, C>
impl<T, const R: usize, const C: usize> RawStorageMut<T, Const<R>, Const<C>> for ArrayStorage<T, R, C>
source§unsafe fn as_mut_slice_unchecked(&mut self) -> &mut [T]
unsafe fn as_mut_slice_unchecked(&mut self) -> &mut [T]
Retrieves the mutable data buffer as a contiguous slice. Read more
source§fn get_address_unchecked_linear_mut(&mut self, i: usize) -> *mut T
fn get_address_unchecked_linear_mut(&mut self, i: usize) -> *mut T
Gets the mutable address of the i-th matrix component without performing bound-checking. Read more
source§fn get_address_unchecked_mut(&mut self, irow: usize, icol: usize) -> *mut T
fn get_address_unchecked_mut(&mut self, irow: usize, icol: usize) -> *mut T
Gets the mutable address of the i-th matrix component without performing bound-checking. Read more
source§unsafe fn get_unchecked_linear_mut(&mut self, i: usize) -> &mut T
unsafe fn get_unchecked_linear_mut(&mut self, i: usize) -> &mut T
Retrieves a mutable reference to the i-th element without bound-checking. Read more
source§unsafe fn get_unchecked_mut(&mut self, irow: usize, icol: usize) -> &mut T
unsafe fn get_unchecked_mut(&mut self, irow: usize, icol: usize) -> &mut T
Retrieves a mutable reference to the element at
(irow, icol)
without bound-checking. Read moresource§impl<T, const R1: usize, const C1: usize, const R2: usize, const C2: usize> ReshapableStorage<T, Const<R1>, Const<C1>, Const<R2>, Const<C2>> for ArrayStorage<T, R1, C1>where
T: Scalar,
Const<R1>: ToTypenum,
Const<C1>: ToTypenum,
Const<R2>: ToTypenum,
Const<C2>: ToTypenum,
<Const<R1> as ToTypenum>::Typenum: Mul<<Const<C1> as ToTypenum>::Typenum>,
<Const<R2> as ToTypenum>::Typenum: Mul<<Const<C2> as ToTypenum>::Typenum, Output = <<Const<R1> as ToTypenum>::Typenum as Mul<<Const<C1> as ToTypenum>::Typenum>>::Output>,
impl<T, const R1: usize, const C1: usize, const R2: usize, const C2: usize> ReshapableStorage<T, Const<R1>, Const<C1>, Const<R2>, Const<C2>> for ArrayStorage<T, R1, C1>where T: Scalar, Const<R1>: ToTypenum, Const<C1>: ToTypenum, Const<R2>: ToTypenum, Const<C2>: ToTypenum, <Const<R1> as ToTypenum>::Typenum: Mul<<Const<C1> as ToTypenum>::Typenum>, <Const<R2> as ToTypenum>::Typenum: Mul<<Const<C2> as ToTypenum>::Typenum, Output = <<Const<R1> as ToTypenum>::Typenum as Mul<<Const<C1> as ToTypenum>::Typenum>>::Output>,
§type Output = ArrayStorage<T, R2, C2>
type Output = ArrayStorage<T, R2, C2>
The reshaped storage type.
source§fn reshape_generic(
self,
_: Const<R2>,
_: Const<C2>
) -> <ArrayStorage<T, R1, C1> as ReshapableStorage<T, Const<R1>, Const<C1>, Const<R2>, Const<C2>>>::Output
fn reshape_generic( self, _: Const<R2>, _: Const<C2> ) -> <ArrayStorage<T, R1, C1> as ReshapableStorage<T, Const<R1>, Const<C1>, Const<R2>, Const<C2>>>::Output
Reshapes the storage into the output storage type.
source§impl<T, const R: usize, const C: usize> Serialize for ArrayStorage<T, R, C>where
T: Scalar + Serialize,
impl<T, const R: usize, const C: usize> Serialize for ArrayStorage<T, R, C>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
source§impl<T, const R: usize, const C: usize> Storage<T, Const<R>, Const<C>> for ArrayStorage<T, R, C>where
T: Scalar,
DefaultAllocator: Allocator<T, Const<R>, Const<C>, Buffer = ArrayStorage<T, R, C>>,
impl<T, const R: usize, const C: usize> Storage<T, Const<R>, Const<C>> for ArrayStorage<T, R, C>where T: Scalar, DefaultAllocator: Allocator<T, Const<R>, Const<C>, Buffer = ArrayStorage<T, R, C>>,
source§fn into_owned(
self
) -> <DefaultAllocator as Allocator<T, Const<R>, Const<C>>>::Bufferwhere
DefaultAllocator: Allocator<T, Const<R>, Const<C>>,
fn into_owned( self ) -> <DefaultAllocator as Allocator<T, Const<R>, Const<C>>>::Bufferwhere DefaultAllocator: Allocator<T, Const<R>, Const<C>>,
Builds a matrix data storage that does not contain any reference.
source§fn clone_owned(
&self
) -> <DefaultAllocator as Allocator<T, Const<R>, Const<C>>>::Bufferwhere
DefaultAllocator: Allocator<T, Const<R>, Const<C>>,
fn clone_owned( &self ) -> <DefaultAllocator as Allocator<T, Const<R>, Const<C>>>::Bufferwhere DefaultAllocator: Allocator<T, Const<R>, Const<C>>,
Clones this data storage to one that does not contain any reference.
impl<T, const R: usize, const C: usize> Copy for ArrayStorage<T, R, C>where T: Copy,
impl<T, const R: usize, const C: usize> Eq for ArrayStorage<T, R, C>where T: Eq,
impl<T, const R: usize, const C: usize> IsContiguous for ArrayStorage<T, R, C>
impl<T, const R: usize, const C: usize> StructuralEq for ArrayStorage<T, R, C>
impl<T, const R: usize, const C: usize> StructuralPartialEq for ArrayStorage<T, R, C>
Auto Trait Implementations§
impl<T, const R: usize, const C: usize> RefUnwindSafe for ArrayStorage<T, R, C>where T: RefUnwindSafe,
impl<T, const R: usize, const C: usize> Send for ArrayStorage<T, R, C>where T: Send,
impl<T, const R: usize, const C: usize> Sync for ArrayStorage<T, R, C>where T: Sync,
impl<T, const R: usize, const C: usize> Unpin for ArrayStorage<T, R, C>where T: Unpin,
impl<T, const R: usize, const C: usize> UnwindSafe for ArrayStorage<T, R, C>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<T> Initialize for Twhere
T: Default,
impl<T> Initialize for Twhere T: Default,
fn initialize(&mut self)
§unsafe fn initialize_raw(data: *mut ())
unsafe fn initialize_raw(data: *mut ())
Safety Read more
§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.