Struct nalgebra::base::SliceStorage [−][src]
Expand description
A matrix data storage for a matrix slice. Only contains an internal reference to another matrix data storage.
Implementations
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: RawStorage<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: RawStorage<T, RStor, CStor>,
Create a new matrix slice without bound checking.
Create a new matrix slice without bound checking.
impl<'a, T, R: Dim, C: Dim, RStride: Dim, CStride: Dim> SliceStorage<'a, T, R, C, RStride, CStride> where
Self: RawStorage<T, R, C> + IsContiguous,
impl<'a, T, R: Dim, C: Dim, RStride: Dim, CStride: Dim> SliceStorage<'a, T, R, C, RStride, CStride> where
Self: RawStorage<T, R, C> + IsContiguous,
Trait Implementations
impl<'a, T, R: Dim, C: Dim, RStride: Dim, CStride: Dim> RawStorage<T, R, C> for SliceStorage<'a, T, R, C, RStride, CStride>
impl<'a, T, R: Dim, C: Dim, RStride: Dim, CStride: Dim> RawStorage<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.
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
The spacing between consecutive row elements and consecutive column elements. Read more
Indicates whether this data buffer stores its elements contiguously. Read more
Retrieves the data buffer as a contiguous slice. Read more
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
Gets the address of the i-th matrix component without performing bound-checking. Read more
Gets the address of the i-th matrix component without performing bound-checking. Read more
Retrieves a reference to the i-th element without bound-checking. Read more
Builds a matrix data storage that does not contain any reference.
Clones this data storage to one that does not contain any reference.
impl<'a, T: Scalar, R: Dim, C: Dim, RStride: Dim, CStride: Dim> Copy for SliceStorage<'a, T, R, C, RStride, CStride>
impl<'a, T, R: DimName, C: Dim + IsNotStaticOne> IsContiguous for SliceStorage<'a, T, R, C, U1, R>
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
Mutably borrows from an owned value. Read more
The inverse inclusion map: attempts to construct self
from the equivalent element of its
superset. Read more
Checks if self
is actually part of its subset T
(and can be converted to it).
Use with care! Same as self.to_subset
but without any property checks. Always succeeds.
The inclusion map: converts self
to the equivalent element of its superset.