Struct nalgebra::base::SliceStorage
source · [−]pub struct SliceStorage<'a, T: Scalar, R: Dim, C: Dim, RStride: Dim, CStride: Dim> { /* private fields */ }Expand description
A matrix data storage for a matrix slice. Only contains an internal reference to another matrix data storage.
Implementations
sourceimpl<'a, T: Scalar, R: Dim, C: Dim, RStride: Dim, CStride: Dim> SliceStorage<'a, T, R, C, RStride, CStride>
impl<'a, T: Scalar, R: Dim, C: Dim, RStride: Dim, CStride: Dim> SliceStorage<'a, T, R, C, RStride, CStride>
sourceimpl<'a, T: Scalar, R: Dim, C: Dim> SliceStorage<'a, T, R, C, Dynamic, Dynamic>
impl<'a, T: Scalar, R: Dim, C: Dim> SliceStorage<'a, T, R, C, Dynamic, Dynamic>
sourcepub unsafe fn new_unchecked<RStor, CStor, S>(
storage: &'a S,
start: (usize, usize),
shape: (R, C)
) -> SliceStorage<'a, T, R, C, S::RStride, S::CStride> where
RStor: Dim,
CStor: Dim,
S: Storage<T, RStor, CStor>,
pub unsafe fn new_unchecked<RStor, CStor, S>(
storage: &'a S,
start: (usize, usize),
shape: (R, C)
) -> SliceStorage<'a, T, R, C, S::RStride, S::CStride> where
RStor: Dim,
CStor: Dim,
S: Storage<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 S,
start: (usize, usize),
shape: (R, C),
strides: (RStride, CStride)
) -> SliceStorage<'a, T, R, C, RStride, CStride> where
RStor: Dim,
CStor: Dim,
S: Storage<T, RStor, CStor>,
RStride: Dim,
CStride: Dim,
pub unsafe fn new_with_strides_unchecked<S, RStor, CStor, RStride, CStride>(
storage: &'a S,
start: (usize, usize),
shape: (R, C),
strides: (RStride, CStride)
) -> SliceStorage<'a, T, R, C, RStride, CStride> where
RStor: Dim,
CStor: Dim,
S: Storage<T, RStor, CStor>,
RStride: Dim,
CStride: Dim,
Create a new matrix slice without bound checking.
Trait Implementations
sourceimpl<'a, T: Scalar, R: Dim, C: Dim, RStride: Dim, CStride: Dim> Clone for SliceStorage<'a, T, R, C, RStride, CStride>
impl<'a, T: Scalar, R: Dim, C: Dim, RStride: Dim, CStride: Dim> Clone for SliceStorage<'a, T, R, C, RStride, CStride>
sourceimpl<'a, T: Debug + Scalar, R: Debug + Dim, C: Debug + Dim, RStride: Debug + Dim, CStride: Debug + Dim> Debug for SliceStorage<'a, T, R, C, RStride, CStride>
impl<'a, T: Debug + Scalar, R: Debug + Dim, C: Debug + Dim, RStride: Debug + Dim, CStride: Debug + Dim> Debug for SliceStorage<'a, T, R, C, RStride, CStride>
sourceimpl<'a, T: Scalar, R: Dim, C: Dim, RStride: Dim, CStride: Dim> Storage<T, R, C> for SliceStorage<'a, T, R, C, RStride, CStride>
impl<'a, T: Scalar, R: Dim, C: Dim, RStride: Dim, CStride: Dim> Storage<T, R, C> for SliceStorage<'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 more
sourcefn 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.
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.
sourcefn as_slice(&self) -> &[T]ⓘNotable traits for &'_ [u8]impl<'_> Read for &'_ [u8]impl<'_> Write for &'_ mut [u8]
fn as_slice(&self) -> &[T]ⓘNotable traits for &'_ [u8]impl<'_> Read for &'_ [u8]impl<'_> Write for &'_ mut [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
sourceunsafe fn get_address_unchecked_linear(&self, i: usize) -> *const T
unsafe fn get_address_unchecked_linear(&self, i: usize) -> *const T
Gets the address of the i-th matrix component without performing bound-checking.
sourceunsafe fn get_address_unchecked(&self, irow: usize, icol: usize) -> *const T
unsafe fn get_address_unchecked(&self, irow: usize, icol: usize) -> *const T
Gets the address of the i-th matrix component without performing bound-checking.
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.
sourceunsafe fn get_unchecked(&self, irow: usize, icol: usize) -> &T
unsafe fn get_unchecked(&self, irow: usize, icol: usize) -> &T
Retrieves a reference to the i-th element without bound-checking.
impl<'a, T: Scalar, R: DimName, C: Dim + IsNotStaticOne> ContiguousStorage<T, R, C> for SliceStorage<'a, T, R, C, U1, R>
impl<'a, T: Scalar, R: Dim, CStride: Dim> ContiguousStorage<T, R, Const<1_usize>> for SliceStorage<'a, T, R, U1, U1, CStride>
impl<'a, T: Scalar, R: Dim, C: Dim, RStride: Dim, CStride: Dim> Copy for SliceStorage<'a, T, R, C, RStride, CStride>
impl<'a, T: Scalar + Send, R: Dim, C: Dim, RStride: Dim, CStride: Dim> Send for SliceStorage<'a, T, R, C, RStride, CStride>
impl<'a, T: Scalar + Sync, R: Dim, C: Dim, RStride: Dim, CStride: Dim> Sync for SliceStorage<'a, T, R, C, RStride, CStride>
Auto Trait Implementations
impl<'a, T, R, C, RStride, CStride> RefUnwindSafe for SliceStorage<'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 SliceStorage<'a, T, R, C, RStride, CStride> where
C: Unpin,
CStride: Unpin,
R: Unpin,
RStride: Unpin,
impl<'a, T, R, C, RStride, CStride> UnwindSafe for SliceStorage<'a, T, R, C, RStride, CStride> where
C: UnwindSafe,
CStride: UnwindSafe,
R: UnwindSafe,
RStride: UnwindSafe,
T: RefUnwindSafe,
Blanket Implementations
sourceimpl<T> BorrowMut<T> for T where
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
const: unstable · sourcepub fn borrow_mut(&mut self) -> &mut T
pub fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
sourceimpl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
sourcepub fn to_subset(&self) -> Option<SS>
pub fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct self from the equivalent element of its
superset. Read more
sourcepub 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).
sourcepub 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.
sourcepub 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.
sourceimpl<T> ToOwned for T where
T: Clone,
impl<T> ToOwned for T where
T: Clone,
type Owned = T
type Owned = T
The resulting type after obtaining ownership.
sourcepub fn to_owned(&self) -> T
pub fn to_owned(&self) -> T
Creates owned data from borrowed data, usually by cloning. Read more
sourcepub fn clone_into(&self, target: &mut T)
pub fn clone_into(&self, target: &mut T)
toowned_clone_into)Uses borrowed data to replace owned data, usually by cloning. Read more