Struct nalgebra::base::SliceStorageMut
source · [−]pub struct SliceStorageMut<'a, T, R: Dim, C: Dim, RStride: Dim, CStride: Dim> { /* private fields */ }
Expand description
A mutable matrix data storage for mutable matrix slice. Only contains an internal mutable reference to another matrix data storage.
Implementations
sourceimpl<'a, T, R: Dim, C: Dim, RStride: Dim, CStride: Dim> SliceStorageMut<'a, T, R, C, RStride, CStride>
impl<'a, T, R: Dim, C: Dim, RStride: Dim, CStride: Dim> SliceStorageMut<'a, T, R, C, RStride, CStride>
sourcepub unsafe fn from_raw_parts(
ptr: *mut T,
shape: (R, C),
strides: (RStride, CStride)
) -> Selfwhere
RStride: Dim,
CStride: Dim,
pub unsafe fn from_raw_parts(
ptr: *mut T,
shape: (R, C),
strides: (RStride, CStride)
) -> Selfwhere
RStride: Dim,
CStride: Dim,
Create a new matrix slice without bound checking and from a raw pointer.
sourceimpl<'a, T, R: Dim, C: Dim> SliceStorageMut<'a, T, R, C, Dynamic, Dynamic>
impl<'a, T, R: Dim, C: Dim> SliceStorageMut<'a, T, R, C, Dynamic, Dynamic>
sourcepub 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: RawStorageMut<T, RStor, CStor>,
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: RawStorageMut<T, RStor, CStor>,
Create a new matrix slice without bound checking.
sourcepub 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: RawStorageMut<T, RStor, CStor>,
RStride: Dim,
CStride: Dim,
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: RawStorageMut<T, RStor, CStor>,
RStride: Dim,
CStride: Dim,
Create a new matrix slice without bound checking.
sourceimpl<'a, T, R: Dim, C: Dim, RStride: Dim, CStride: Dim> SliceStorageMut<'a, T, R, C, RStride, CStride>where
Self: RawStorage<T, R, C> + IsContiguous,
impl<'a, T, R: Dim, C: Dim, RStride: Dim, CStride: Dim> SliceStorageMut<'a, T, R, C, RStride, CStride>where
Self: RawStorage<T, R, C> + IsContiguous,
sourceimpl<'a, T: Scalar, R: Dim, C: Dim, RStride: Dim, CStride: Dim> SliceStorageMut<'a, T, R, C, RStride, CStride>where
Self: RawStorageMut<T, R, C> + IsContiguous,
impl<'a, T: Scalar, R: Dim, C: Dim, RStride: Dim, CStride: Dim> SliceStorageMut<'a, T, R, C, RStride, CStride>where
Self: RawStorageMut<T, R, C> + IsContiguous,
Trait Implementations
sourceimpl<'a, T: Debug, R: Debug + Dim, C: Debug + Dim, RStride: Debug + Dim, CStride: Debug + Dim> Debug for SliceStorageMut<'a, T, R, C, RStride, CStride>
impl<'a, T: Debug, R: Debug + Dim, C: Debug + Dim, RStride: Debug + Dim, CStride: Debug + Dim> Debug for SliceStorageMut<'a, T, R, C, RStride, CStride>
sourceimpl<'a, T, R: Dim, C: Dim, RStride: Dim, CStride: Dim> RawStorage<T, R, C> for SliceStorageMut<'a, T, R, C, RStride, CStride>
impl<'a, T, R: Dim, C: Dim, RStride: Dim, CStride: Dim> RawStorage<T, R, C> for SliceStorageMut<'a, T, R, C, RStride, CStride>
type RStride = RStride
type RStride = RStride
The static stride of this storage’s rows.
type CStride = CStride
type CStride = CStride
The static stride of this storage’s columns.
sourcefn shape(&self) -> (R, C)
fn shape(&self) -> (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 moresourcefn strides(&self) -> (Self::RStride, Self::CStride)
fn strides(&self) -> (Self::RStride, Self::CStride)
The spacing between consecutive row elements and consecutive column elements. Read more
sourcefn is_contiguous(&self) -> bool
fn is_contiguous(&self) -> bool
Indicates whether this data buffer stores its elements contiguously. Read more
sourceunsafe fn as_slice_unchecked(&self) -> &[T]ⓘNotable traits for &mut [u8]impl Write for &mut [u8]impl Read for &[u8]
unsafe fn as_slice_unchecked(&self) -> &[T]ⓘNotable traits for &mut [u8]impl Write for &mut [u8]impl Read for &[u8]
Retrieves the data buffer as a contiguous slice. Read more
sourcefn 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
sourcefn 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
sourcefn 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
sourceunsafe fn get_unchecked_linear(&self, i: usize) -> &T
unsafe fn get_unchecked_linear(&self, i: usize) -> &T
Retrieves a reference to the i-th element without bound-checking. Read more
sourceimpl<'a, T, R: Dim, C: Dim, RStride: Dim, CStride: Dim> RawStorageMut<T, R, C> for SliceStorageMut<'a, T, R, C, RStride, CStride>
impl<'a, T, R: Dim, C: Dim, RStride: Dim, CStride: Dim> RawStorageMut<T, R, C> for SliceStorageMut<'a, T, R, C, RStride, CStride>
sourceunsafe fn as_mut_slice_unchecked(&mut self) -> &mut [T]ⓘNotable traits for &mut [u8]impl Write for &mut [u8]impl Read for &[u8]
unsafe fn as_mut_slice_unchecked(&mut self) -> &mut [T]ⓘNotable traits for &mut [u8]impl Write for &mut [u8]impl Read for &[u8]
Retrieves the mutable data buffer as a contiguous slice. Read more
sourcefn 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
sourcefn 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
sourceunsafe 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
sourceunsafe 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 moresourceunsafe fn swap_unchecked_linear(&mut self, i1: usize, i2: usize)
unsafe fn swap_unchecked_linear(&mut self, i1: usize, i2: usize)
Swaps two elements using their linear index without bound-checking. Read more
sourceimpl<'a, T: Scalar, R: Dim, C: Dim, RStride: Dim, CStride: Dim> Storage<T, R, C> for SliceStorageMut<'a, T, R, C, RStride, CStride>
impl<'a, T: Scalar, R: Dim, C: Dim, RStride: Dim, CStride: Dim> Storage<T, R, C> for SliceStorageMut<'a, T, R, C, RStride, CStride>
sourcefn into_owned(self) -> Owned<T, R, C>where
DefaultAllocator: Allocator<T, R, C>,
fn into_owned(self) -> Owned<T, R, C>where
DefaultAllocator: Allocator<T, R, C>,
Builds a matrix data storage that does not contain any reference.
sourcefn clone_owned(&self) -> Owned<T, R, C>where
DefaultAllocator: Allocator<T, R, C>,
fn clone_owned(&self) -> Owned<T, R, C>where
DefaultAllocator: Allocator<T, R, C>,
Clones this data storage to one that does not contain any reference.
impl<'a, T, R: DimName, C: Dim + IsNotStaticOne> IsContiguous for SliceStorageMut<'a, T, R, C, U1, R>
impl<'a, T, R: Dim, CStride: Dim> IsContiguous for SliceStorageMut<'a, T, R, U1, U1, CStride>
impl<'a, T: Send, R: Dim, C: Dim, RStride: Dim, CStride: Dim> Send for SliceStorageMut<'a, T, R, C, RStride, CStride>
impl<'a, T: Sync, R: Dim, C: Dim, RStride: Dim, CStride: Dim> Sync for SliceStorageMut<'a, T, R, C, RStride, CStride>
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> 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>
Blanket Implementations
sourceimpl<T> ArchivePointee for T
impl<T> ArchivePointee for T
type ArchivedMetadata = ()
type ArchivedMetadata = ()
The archived version of the pointer metadata for this type.
sourcefn pointer_metadata(
&<T as ArchivePointee>::ArchivedMetadata
) -> <T as Pointee>::Metadata
fn pointer_metadata(
&<T as ArchivePointee>::ArchivedMetadata
) -> <T as Pointee>::Metadata
Converts some archived metadata to the pointer metadata for itself.
sourceimpl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
sourceimpl<F, W, T, D> Deserialize<With<T, W>, D> for Fwhere
W: DeserializeWith<F, T, D>,
D: Fallible + ?Sized,
F: ?Sized,
impl<F, W, T, D> Deserialize<With<T, W>, D> for Fwhere
W: DeserializeWith<F, T, D>,
D: Fallible + ?Sized,
F: ?Sized,
sourceimpl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
sourcefn 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 moresourcefn 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).sourcefn 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.sourcefn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self
to the equivalent element of its superset.sourceimpl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
sourcefn 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 moresourcefn 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).sourceunsafe fn to_subset_unchecked(&self) -> SS
unsafe fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset
but without any property checks. Always succeeds.sourcefn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self
to the equivalent element of its superset.