Struct nalgebra::base::ArrayStorage [−][src]
A array-based statically sized matrix data storage.
Trait Implementations
impl<T: Clone, const R: usize, const C: usize> Clone for ArrayStorage<T, R, C>
[src]
fn clone(&self) -> ArrayStorage<T, R, C>
[src]
pub fn clone_from(&mut self, source: &Self)
1.0.0[src]
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>, Buffer = Self>,
[src]
T: Scalar,
DefaultAllocator: Allocator<T, Const<R>, Const<C>, Buffer = Self>,
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>, Buffer = Self>,
[src]
T: Scalar,
DefaultAllocator: Allocator<T, Const<R>, Const<C>, Buffer = Self>,
impl<T: Copy, const R: usize, const C: usize> Copy for ArrayStorage<T, R, C>
[src]
impl<T: Debug, const R: usize, const C: usize> Debug for ArrayStorage<T, R, C>
[src]
impl<T: Default, const R: usize, const C: usize> Default for ArrayStorage<T, R, C> where
[[T; R]; C]: Default,
[src]
[[T; R]; C]: Default,
impl<T: Eq, const R: usize, const C: usize> Eq for ArrayStorage<T, R, C>
[src]
impl<T: Hash, const R: usize, const C: usize> Hash for ArrayStorage<T, R, C>
[src]
fn hash<__H: Hasher>(&self, state: &mut __H)
[src]
pub fn hash_slice<H>(data: &[Self], state: &mut H) where
H: Hasher,
1.3.0[src]
H: Hasher,
impl<T: PartialEq, const R: usize, const C: usize> PartialEq<ArrayStorage<T, R, C>> for ArrayStorage<T, R, C>
[src]
fn eq(&self, other: &ArrayStorage<T, R, C>) -> bool
[src]
fn ne(&self, other: &ArrayStorage<T, R, C>) -> bool
[src]
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 = Prod<<Const<R1> as ToTypenum>::Typenum, <Const<C1> as ToTypenum>::Typenum>>,
[src]
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 = Prod<<Const<R1> as ToTypenum>::Typenum, <Const<C1> as ToTypenum>::Typenum>>,
type Output = ArrayStorage<T, R2, C2>
The reshaped storage type.
fn reshape_generic(self, _: Const<R2>, _: Const<C2>) -> Self::Output
[src]
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 = Self>,
[src]
T: Scalar,
DefaultAllocator: Allocator<T, Const<R>, Const<C>, Buffer = Self>,
type RStride = Const<1>
The static stride of this storage’s rows.
type CStride = Const<R>
The static stride of this storage’s columns.
fn ptr(&self) -> *const T
[src]
fn shape(&self) -> (Const<R>, Const<C>)
[src]
fn strides(&self) -> (Self::RStride, Self::CStride)
[src]
fn is_contiguous(&self) -> bool
[src]
fn into_owned(self) -> Owned<T, Const<R>, Const<C>> where
DefaultAllocator: Allocator<T, Const<R>, Const<C>>,
[src]
DefaultAllocator: Allocator<T, Const<R>, Const<C>>,
fn clone_owned(&self) -> Owned<T, Const<R>, Const<C>> where
DefaultAllocator: Allocator<T, Const<R>, Const<C>>,
[src]
DefaultAllocator: Allocator<T, Const<R>, Const<C>>,
fn as_slice(&self) -> &[T]
[src]
fn linear_index(&self, irow: usize, icol: usize) -> usize
[src]
unsafe fn get_address_unchecked_linear(&self, i: usize) -> *const T
[src]
unsafe fn get_address_unchecked(&self, irow: usize, icol: usize) -> *const T
[src]
unsafe fn get_unchecked_linear(&self, i: usize) -> &T
[src]
unsafe fn get_unchecked(&self, irow: usize, icol: usize) -> &T
[src]
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>, Buffer = Self>,
[src]
T: Scalar,
DefaultAllocator: Allocator<T, Const<R>, Const<C>, Buffer = Self>,
fn ptr_mut(&mut self) -> *mut T
[src]
fn as_mut_slice(&mut self) -> &mut [T]
[src]
unsafe fn get_address_unchecked_linear_mut(&mut self, i: usize) -> *mut T
[src]
unsafe fn get_address_unchecked_mut(
&mut self,
irow: usize,
icol: usize
) -> *mut T
[src]
&mut self,
irow: usize,
icol: usize
) -> *mut T
unsafe fn get_unchecked_linear_mut(&mut self, i: usize) -> &mut T
[src]
unsafe fn get_unchecked_mut(&mut self, irow: usize, icol: usize) -> &mut T
[src]
unsafe fn swap_unchecked_linear(&mut self, i1: usize, i2: usize)
[src]
unsafe fn swap_unchecked(
&mut self,
row_col1: (usize, usize),
row_col2: (usize, usize)
)
[src]
&mut self,
row_col1: (usize, usize),
row_col2: (usize, usize)
)
impl<T, const R: usize, const C: usize> StructuralEq for ArrayStorage<T, R, C>
[src]
impl<T, const R: usize, const C: usize> StructuralPartialEq for ArrayStorage<T, R, C>
[src]
Auto Trait Implementations
impl<T, const R: usize, const C: usize> RefUnwindSafe for ArrayStorage<T, R, C> where
T: RefUnwindSafe,
T: RefUnwindSafe,
impl<T, const R: usize, const C: usize> Send for ArrayStorage<T, R, C> where
T: Send,
T: Send,
impl<T, const R: usize, const C: usize> Sync for ArrayStorage<T, R, C> where
T: Sync,
T: Sync,
impl<T, const R: usize, const C: usize> Unpin for ArrayStorage<T, R, C> where
T: Unpin,
T: Unpin,
impl<T, const R: usize, const C: usize> UnwindSafe for ArrayStorage<T, R, C> where
T: UnwindSafe,
T: UnwindSafe,
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
pub fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T> Same<T> for T
[src]
type Output = T
Should always be Self
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
[src]
SS: SubsetOf<SP>,
pub fn to_subset(&self) -> Option<SS>
[src]
pub fn is_in_subset(&self) -> bool
[src]
pub fn to_subset_unchecked(&self) -> SS
[src]
pub fn from_subset(element: &SS) -> SP
[src]
impl<T> ToOwned for T where
T: Clone,
[src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
pub fn to_owned(&self) -> T
[src]
pub fn clone_into(&self, target: &mut T)
[src]
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
pub fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error
The type returned in the event of a conversion error.
pub fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>
[src]
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
V: MultiLane<T>,