Struct lnkit::prelude::ArrayStorage [−][src]
A array-based statically sized matrix data storage.
Trait Implementations
impl<T, const R: usize, const C: usize> Clone for ArrayStorage<T, R, C> where
T: Clone,
[src]
impl<T, const R: usize, const C: usize> Clone for ArrayStorage<T, R, C> where
T: Clone,
[src]pub 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>>,
<DefaultAllocator as Allocator<T, Const<R>, Const<C>>>::Buffer == ArrayStorage<T, R, C>,
[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>>,
<DefaultAllocator as Allocator<T, Const<R>, Const<C>>>::Buffer == ArrayStorage<T, R, C>,
[src]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>,
[src]
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>,
[src]impl<T, const R: usize, const C: usize> Default for ArrayStorage<T, R, C> where
T: Default,
[[T; R]; C]: Default,
[src]
impl<T, const R: usize, const C: usize> Default for ArrayStorage<T, R, C> where
T: Default,
[[T; R]; C]: Default,
[src]pub fn default() -> ArrayStorage<T, R, C>
[src]
impl<'a, T, const R: usize, const C: usize> Deserialize<'a> for ArrayStorage<T, R, C> where
T: Scalar + Deserialize<'a>,
[src]
impl<'a, T, const R: usize, const C: usize> Deserialize<'a> for ArrayStorage<T, R, C> where
T: Scalar + Deserialize<'a>,
[src]pub fn deserialize<D>(
deserializer: D
) -> Result<ArrayStorage<T, R, C>, <D as Deserializer<'a>>::Error> where
D: Deserializer<'a>,
[src]
deserializer: D
) -> Result<ArrayStorage<T, R, C>, <D as Deserializer<'a>>::Error> where
D: Deserializer<'a>,
impl<T, const R: usize, const C: usize> PartialEq<ArrayStorage<T, R, C>> for ArrayStorage<T, R, C> where
T: PartialEq<T>,
[src]
impl<T, const R: usize, const C: usize> PartialEq<ArrayStorage<T, R, C>> for ArrayStorage<T, R, C> where
T: PartialEq<T>,
[src]pub fn eq(&self, other: &ArrayStorage<T, R, C>) -> bool
[src]
pub 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>,
<<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,
[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>,
<<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,
[src]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
[src]
self,
Const<R2>,
Const<C2>
) -> <ArrayStorage<T, R1, C1> as ReshapableStorage<T, Const<R1>, Const<C1>, Const<R2>, Const<C2>>>::Output
impl<T, const R: usize, const C: usize> Serialize for ArrayStorage<T, R, C> where
T: Scalar + Serialize,
[src]
impl<T, const R: usize, const C: usize> Serialize for ArrayStorage<T, R, C> where
T: Scalar + Serialize,
[src]pub fn serialize<S>(
&self,
serializer: S
) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error> where
S: Serializer,
[src]
&self,
serializer: S
) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error> where
S: Serializer,
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>,
[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>>,
<DefaultAllocator as Allocator<T, Const<R>, Const<C>>>::Buffer == ArrayStorage<T, R, C>,
[src]type RStride = Const<1_usize>
The static stride of this storage’s rows.
type CStride = Const<R>
The static stride of this storage’s columns.
pub fn ptr(&self) -> *const T
[src]
pub fn shape(&self) -> (Const<R>, Const<C>)
[src]
pub fn strides(
&self
) -> (<ArrayStorage<T, R, C> as Storage<T, Const<R>, Const<C>>>::RStride, <ArrayStorage<T, R, C> as Storage<T, Const<R>, Const<C>>>::CStride)
[src]
&self
) -> (<ArrayStorage<T, R, C> as Storage<T, Const<R>, Const<C>>>::RStride, <ArrayStorage<T, R, C> as Storage<T, Const<R>, Const<C>>>::CStride)
pub fn is_contiguous(&self) -> bool
[src]
pub fn into_owned(
self
) -> <DefaultAllocator as Allocator<T, Const<R>, Const<C>>>::Buffer where
DefaultAllocator: Allocator<T, Const<R>, Const<C>>,
[src]
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>>,
[src]
&self
) -> <DefaultAllocator as Allocator<T, Const<R>, Const<C>>>::Buffer where
DefaultAllocator: Allocator<T, Const<R>, Const<C>>,
pub fn as_slice(&self) -> &[T]
[src]
pub fn linear_index(&self, irow: usize, icol: usize) -> usize
[src]
pub unsafe fn get_address_unchecked_linear(&self, i: usize) -> *const T
[src]
pub unsafe fn get_address_unchecked(&self, irow: usize, icol: usize) -> *const T
[src]
pub unsafe fn get_unchecked_linear(&self, i: usize) -> &T
[src]
pub 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>>,
<DefaultAllocator as Allocator<T, Const<R>, Const<C>>>::Buffer == ArrayStorage<T, R, C>,
[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>>,
<DefaultAllocator as Allocator<T, Const<R>, Const<C>>>::Buffer == ArrayStorage<T, R, C>,
[src]pub fn ptr_mut(&mut self) -> *mut T
[src]
pub fn as_mut_slice(&mut self) -> &mut [T]
[src]
pub unsafe fn get_address_unchecked_linear_mut(&mut self, i: usize) -> *mut T
[src]
pub unsafe fn get_address_unchecked_mut(
&mut self,
irow: usize,
icol: usize
) -> *mut T
[src]
&mut self,
irow: usize,
icol: usize
) -> *mut T
pub unsafe fn get_unchecked_linear_mut(&mut self, i: usize) -> &mut T
[src]
pub unsafe fn get_unchecked_mut(&mut self, irow: usize, icol: usize) -> &mut T
[src]
pub unsafe fn swap_unchecked_linear(&mut self, i1: usize, i2: usize)
[src]
pub 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> StructuralEq for ArrayStorage<T, R, C>
[src]impl<T, const R: usize, const C: usize> StructuralPartialEq 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,
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> 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> 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> 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,
impl<T, const R: usize, const C: usize> UnwindSafe for ArrayStorage<T, R, C> where
T: UnwindSafe,
Blanket Implementations
impl<T, U> Cast<U> for T where
U: FromCast<T>,
impl<T, U> Cast<U> for T where
U: FromCast<T>,
pub fn cast(self) -> U
impl<T> DeserializeOwned for T where
T: for<'de> Deserialize<'de>,
[src]
impl<T> DeserializeOwned for T where
T: for<'de> Deserialize<'de>,
[src]impl<T> Downcast for T where
T: Any,
impl<T> Downcast for T where
T: Any,
impl<T> FromBits<T> for T
impl<T> FromBits<T> for T
pub fn from_bits(t: T) -> T
impl<T> FromCast<T> for T
impl<T> FromCast<T> for T
pub fn from_cast(t: T) -> T
impl<T, U> IntoBits<U> for T where
U: FromBits<T>,
impl<T, U> IntoBits<U> for T where
U: FromBits<T>,
pub fn into_bits(self) -> U
impl<T> Same<T> for T
impl<T> Same<T> for 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>,
pub fn to_subset(&self) -> Option<SS>
pub fn is_in_subset(&self) -> bool
pub fn to_subset_unchecked(&self) -> SS
pub fn from_subset(element: &SS) -> SP
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
impl<V, T> VZip<V> for T where
V: MultiLane<T>,