Struct heron::rapier_plugin::rapier2d::prelude::nalgebra::ArrayStorage [−][src]
Expand description
A array-based statically sized matrix data storage.
Trait Implementations
Returns the “default value” for a type. Read more
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>,
This method tests for self
and other
values to be equal, and is used
by ==
. Read more
This method tests for !=
.
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>,
<<Const<R2> as ToTypenum>::Typenum as 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>,
<<Const<R2> as ToTypenum>::Typenum as 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.
pub fn reshape_generic(
self,
Const<R2>,
Const<C2>
) -> <ArrayStorage<T, R1, C1> as ReshapableStorage<T, Const<R1>, Const<C1>, Const<R2>, Const<C2>>>::Output
pub 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.
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>>,
<DefaultAllocator as 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>>,
<DefaultAllocator as Allocator<T, Const<R>, Const<C>>>::Buffer == ArrayStorage<T, R, 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
. Read more
The spacing between consecutive row elements and consecutive column elements. Read more
Indicates whether this data buffer stores its elements contiguously.
pub fn into_owned(
self
) -> <DefaultAllocator as Allocator<T, Const<R>, Const<C>>>::Buffer where
DefaultAllocator: Allocator<T, Const<R>, Const<C>>,
pub fn into_owned(
self
) -> <DefaultAllocator as Allocator<T, Const<R>, Const<C>>>::Buffer where
DefaultAllocator: Allocator<T, Const<R>, Const<C>>,
Builds a matrix data storage that does not contain any reference.
pub fn clone_owned(
&self
) -> <DefaultAllocator as Allocator<T, Const<R>, Const<C>>>::Buffer where
DefaultAllocator: Allocator<T, Const<R>, Const<C>>,
pub fn clone_owned(
&self
) -> <DefaultAllocator as Allocator<T, Const<R>, Const<C>>>::Buffer where
DefaultAllocator: Allocator<T, Const<R>, Const<C>>,
Clones this data storage to one that does not contain any reference.
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
Gets the address of the i-th matrix component without performing bound-checking.
Gets the address of the i-th matrix component without performing bound-checking.
Retrieves a reference to the i-th element without bound-checking.
Retrieves a reference to the i-th element without bound-checking.
impl<T, const R: usize, const C: usize> StorageMut<T, Const<R>, Const<C>> for ArrayStorage<T, R, C> where
T: Scalar,
DefaultAllocator: Allocator<T, Const<R>, Const<C>>,
<DefaultAllocator as Allocator<T, Const<R>, Const<C>>>::Buffer == ArrayStorage<T, R, C>,
impl<T, const R: usize, const C: usize> StorageMut<T, Const<R>, Const<C>> for ArrayStorage<T, R, C> where
T: Scalar,
DefaultAllocator: Allocator<T, Const<R>, Const<C>>,
<DefaultAllocator as Allocator<T, Const<R>, Const<C>>>::Buffer == ArrayStorage<T, R, C>,
Retrieves the mutable data buffer as a contiguous slice. Read more
Gets the mutable address of the i-th matrix component without performing bound-checking.
Gets the mutable address of the i-th matrix component without performing bound-checking.
Retrieves a mutable reference to the i-th element without bound-checking.
Retrieves a mutable reference to the element at (irow, icol)
without bound-checking.
Swaps two elements using their linear index without bound-checking.
impl<T, const R: usize, const C: usize> ContiguousStorage<T, Const<R>, Const<C>> for ArrayStorage<T, R, C> where
T: Scalar,
DefaultAllocator: Allocator<T, Const<R>, Const<C>>,
<DefaultAllocator as Allocator<T, Const<R>, Const<C>>>::Buffer == ArrayStorage<T, R, C>,
impl<T, const R: usize, const C: usize> ContiguousStorageMut<T, Const<R>, Const<C>> for ArrayStorage<T, R, C> where
T: Scalar,
DefaultAllocator: Allocator<T, Const<R>, Const<C>>,
<DefaultAllocator as Allocator<T, Const<R>, Const<C>>>::Buffer == 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
Mutably borrows from an owned value. Read more
impl<T> CallHasher for T where
T: Hash,
impl<T> CallHasher for T where
T: Hash,
impl<T> Downcast for T where
T: Any,
impl<T> Downcast for T where
T: Any,
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 more
pub fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
pub 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 more
Convert &Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &Any
’s vtable from &Trait
’s. Read more
pub fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
pub 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 more
impl<T> DynHash for T where
T: DynEq + Hash,
impl<T> DynHash for T where
T: DynEq + Hash,
Compare self to key
and return true
if they are equal.
impl<T> FromWorld for T where
T: Default,
impl<T> FromWorld for T where
T: Default,
pub fn from_world(_world: &mut World) -> T
pub fn from_world(_world: &mut World) -> T
Creates Self
using data from the given [World]
Instruments this type with the provided Span
, returning an
Instrumented
wrapper. Read more
impl<T> Pointable for T
impl<T> Pointable for T
type Output = T
type Output = T
Should always be Self
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
The inverse inclusion map: attempts to construct self
from the equivalent element of its
superset. Read more
pub fn is_in_subset(&self) -> bool
pub fn is_in_subset(&self) -> bool
Checks if self
is actually part of its subset T
(and can be converted to it).
pub fn to_subset_unchecked(&self) -> SS
pub fn to_subset_unchecked(&self) -> SS
Use with care! Same as self.to_subset
but without any property checks. Always succeeds.
pub fn from_subset(element: &SS) -> SP
pub fn from_subset(element: &SS) -> SP
The inclusion map: converts self
to the equivalent element of its superset.
pub fn clone_type_data(&self) -> Box<dyn TypeData + 'static, Global>
pub fn vzip(self) -> V