Struct nalgebra::base::SliceStorageMut [−][src]
pub struct SliceStorageMut<'a, T: Scalar, R: Dim, C: Dim, RStride: Dim, CStride: Dim> { /* fields omitted */ }
A mutable matrix data storage for mutable matrix slice. Only contains an internal mutable reference to another matrix data storage.
Implementations
impl<'a, T: Scalar, R: Dim, C: Dim, RStride: Dim, CStride: Dim> SliceStorageMut<'a, T, R, C, RStride, CStride>
[src]
impl<'a, T: Scalar, R: Dim, C: Dim, RStride: Dim, CStride: Dim> SliceStorageMut<'a, T, R, C, RStride, CStride>
[src]impl<'a, T: Scalar, R: Dim, C: Dim> SliceStorageMut<'a, T, R, C, Dynamic, Dynamic>
[src]
impl<'a, T: Scalar, R: Dim, C: Dim> SliceStorageMut<'a, T, R, C, Dynamic, Dynamic>
[src]pub unsafe fn new_unchecked<RStor, CStor, S>(
storage: &'a mut S,
start: (usize, usize),
shape: (R, C)
) -> SliceStorageMut<'a, T, R, C, S::RStride, S::CStride> where
RStor: Dim,
CStor: Dim,
S: StorageMut<T, RStor, CStor>,
[src]
storage: &'a mut S,
start: (usize, usize),
shape: (R, C)
) -> SliceStorageMut<'a, T, R, C, S::RStride, S::CStride> where
RStor: Dim,
CStor: Dim,
S: StorageMut<T, RStor, CStor>,
Create a new matrix slice without bound checking.
pub unsafe fn new_with_strides_unchecked<S, RStor, CStor, RStride, CStride>(
storage: &'a mut S,
start: (usize, usize),
shape: (R, C),
strides: (RStride, CStride)
) -> SliceStorageMut<'a, T, R, C, RStride, CStride> where
RStor: Dim,
CStor: Dim,
S: StorageMut<T, RStor, CStor>,
RStride: Dim,
CStride: Dim,
[src]
storage: &'a mut S,
start: (usize, usize),
shape: (R, C),
strides: (RStride, CStride)
) -> SliceStorageMut<'a, T, R, C, RStride, CStride> where
RStor: Dim,
CStor: Dim,
S: StorageMut<T, RStor, CStor>,
RStride: Dim,
CStride: Dim,
Create a new matrix slice without bound checking.
Trait Implementations
impl<'a, T: Scalar, R: DimName, C: Dim + IsNotStaticOne> ContiguousStorage<T, R, C> for SliceStorageMut<'a, T, R, C, U1, R>
[src]
impl<'a, T: Scalar, R: DimName, C: Dim + IsNotStaticOne> ContiguousStorage<T, R, C> for SliceStorageMut<'a, T, R, C, U1, R>
[src]impl<'a, T: Scalar, R: Dim, CStride: Dim> ContiguousStorage<T, R, Const<1_usize>> for SliceStorageMut<'a, T, R, U1, U1, CStride>
[src]
impl<'a, T: Scalar, R: Dim, CStride: Dim> ContiguousStorage<T, R, Const<1_usize>> for SliceStorageMut<'a, T, R, U1, U1, CStride>
[src]impl<'a, T: Scalar, R: DimName, C: Dim + IsNotStaticOne> ContiguousStorageMut<T, R, C> for SliceStorageMut<'a, T, R, C, U1, R>
[src]
impl<'a, T: Scalar, R: DimName, C: Dim + IsNotStaticOne> ContiguousStorageMut<T, R, C> for SliceStorageMut<'a, T, R, C, U1, R>
[src]impl<'a, T: Scalar, R: Dim, CStride: Dim> ContiguousStorageMut<T, R, Const<1_usize>> for SliceStorageMut<'a, T, R, U1, U1, CStride>
[src]
impl<'a, T: Scalar, R: Dim, CStride: Dim> ContiguousStorageMut<T, R, Const<1_usize>> for SliceStorageMut<'a, T, R, U1, U1, CStride>
[src]impl<'a, T: Debug + Scalar, R: Debug + Dim, C: Debug + Dim, RStride: Debug + Dim, CStride: Debug + Dim> Debug for SliceStorageMut<'a, T, R, C, RStride, CStride>
[src]
impl<'a, T: Debug + Scalar, R: Debug + Dim, C: Debug + Dim, RStride: Debug + Dim, CStride: Debug + Dim> Debug for SliceStorageMut<'a, T, R, C, RStride, CStride>
[src]impl<'a, T: Scalar + Send, R: Dim, C: Dim, RStride: Dim, CStride: Dim> Send for SliceStorageMut<'a, T, R, C, RStride, CStride>
[src]
impl<'a, T: Scalar + Send, R: Dim, C: Dim, RStride: Dim, CStride: Dim> Send for SliceStorageMut<'a, T, R, C, RStride, CStride>
[src]impl<'a, T: Scalar, R: Dim, C: Dim, RStride: Dim, CStride: Dim> Storage<T, R, C> for SliceStorageMut<'a, T, R, C, RStride, CStride>
[src]
impl<'a, T: Scalar, R: Dim, C: Dim, RStride: Dim, CStride: Dim> Storage<T, R, C> for SliceStorageMut<'a, T, R, C, RStride, CStride>
[src]type RStride = RStride
The static stride of this storage’s rows.
type CStride = CStride
The static stride of this storage’s columns.
fn ptr(&self) -> *const T
[src]
fn shape(&self) -> (R, C)
[src]
fn strides(&self) -> (Self::RStride, Self::CStride)
[src]
fn is_contiguous(&self) -> bool
[src]
fn into_owned(self) -> Owned<T, R, C> where
DefaultAllocator: Allocator<T, R, C>,
[src]
DefaultAllocator: Allocator<T, R, C>,
fn clone_owned(&self) -> Owned<T, R, C> where
DefaultAllocator: Allocator<T, R, C>,
[src]
DefaultAllocator: Allocator<T, R, 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<'a, T: Scalar, R: Dim, C: Dim, RStride: Dim, CStride: Dim> StorageMut<T, R, C> for SliceStorageMut<'a, T, R, C, RStride, CStride>
[src]
impl<'a, T: Scalar, R: Dim, C: Dim, RStride: Dim, CStride: Dim> StorageMut<T, R, C> for SliceStorageMut<'a, T, R, C, RStride, CStride>
[src]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)
)
Auto Trait Implementations
impl<'a, T, R, C, RStride, CStride> RefUnwindSafe for SliceStorageMut<'a, T, R, C, RStride, CStride> where
C: RefUnwindSafe,
CStride: RefUnwindSafe,
R: RefUnwindSafe,
RStride: RefUnwindSafe,
T: RefUnwindSafe,
impl<'a, T, R, C, RStride, CStride> RefUnwindSafe for SliceStorageMut<'a, T, R, C, RStride, CStride> where
C: RefUnwindSafe,
CStride: RefUnwindSafe,
R: RefUnwindSafe,
RStride: RefUnwindSafe,
T: RefUnwindSafe,
impl<'a, T, R, C, RStride, CStride> Unpin for SliceStorageMut<'a, T, R, C, RStride, CStride> where
C: Unpin,
CStride: Unpin,
R: Unpin,
RStride: Unpin,
impl<'a, T, R, C, RStride, CStride> Unpin for SliceStorageMut<'a, T, R, C, RStride, CStride> where
C: Unpin,
CStride: Unpin,
R: Unpin,
RStride: Unpin,
impl<'a, T, R, C, RStride, CStride> !UnwindSafe for SliceStorageMut<'a, T, R, C, RStride, CStride>
impl<'a, T, R, C, RStride, CStride> !UnwindSafe for SliceStorageMut<'a, T, R, C, RStride, CStride>
Blanket Implementations
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
[src]
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
[src]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<V, T> VZip<V> for T where
V: MultiLane<T>,
impl<V, T> VZip<V> for T where
V: MultiLane<T>,