Struct nyx_space::dimensions::SliceStorage [−][src]
pub struct SliceStorage<'a, N, R, C, RStride, CStride> where
C: Dim,
N: Scalar,
R: Dim,
RStride: Dim,
CStride: Dim, { /* fields omitted */ }
Expand description
A matrix data storage for a matrix slice. Only contains an internal reference to another matrix data storage.
Implementations
pub unsafe fn from_raw_parts(
ptr: *const N,
shape: (R, C),
strides: (RStride, CStride)
) -> SliceStorage<'a, N, R, C, RStride, CStride> where
RStride: Dim,
CStride: Dim,
[src]
pub unsafe fn from_raw_parts(
ptr: *const N,
shape: (R, C),
strides: (RStride, CStride)
) -> SliceStorage<'a, N, R, C, RStride, CStride> where
RStride: Dim,
CStride: Dim,
[src]Create a new matrix slice without bound checking and from a raw pointer.
Create a new matrix slice without bound checking.
Create a new matrix slice without bound checking.
Trait Implementations
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
pub fn strides(
&self
) -> (<SliceStorage<'a, N, R, C, RStride, CStride> as Storage<N, R, C>>::RStride, <SliceStorage<'a, N, R, C, RStride, CStride> as Storage<N, R, C>>::CStride)
[src]
pub fn strides(
&self
) -> (<SliceStorage<'a, N, R, C, RStride, CStride> as Storage<N, R, C>>::RStride, <SliceStorage<'a, N, R, C, RStride, CStride> as Storage<N, R, C>>::CStride)
[src]The spacing between consecutive row elements and consecutive column elements. Read more
Indicates whether this data buffer stores its elements contiguously.
pub fn into_owned(self) -> <DefaultAllocator as Allocator<N, R, C>>::Buffer where
DefaultAllocator: Allocator<N, R, C>,
[src]
pub fn into_owned(self) -> <DefaultAllocator as Allocator<N, R, C>>::Buffer where
DefaultAllocator: Allocator<N, R, C>,
[src]Builds a matrix data storage that does not contain any reference.
pub fn clone_owned(&self) -> <DefaultAllocator as Allocator<N, R, C>>::Buffer where
DefaultAllocator: Allocator<N, R, C>,
[src]
pub fn clone_owned(&self) -> <DefaultAllocator as Allocator<N, R, C>>::Buffer where
DefaultAllocator: Allocator<N, R, C>,
[src]Clones this data storage to one that does not contain any reference.
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.
Gets the address of the i-th matrix component without performing bound-checking.
Retrieves a reference to the i-th element without bound-checking.
Retrieves a reference to the i-th element without bound-checking.
impl<'a, N, R, C> ContiguousStorage<N, R, C> for SliceStorage<'a, N, R, C, U1, R> where
C: Dim + IsNotStaticOne,
N: Scalar,
R: DimName,
[src]impl<'a, N, R, CStride> ContiguousStorage<N, R, U1> for SliceStorage<'a, N, R, U1, U1, CStride> where
N: Scalar,
R: Dim,
CStride: Dim,
[src]impl<'a, N, R, C, RStride, CStride> Copy for SliceStorage<'a, N, R, C, RStride, CStride> where
C: Dim,
N: Scalar,
R: Dim,
RStride: Dim,
CStride: Dim,
[src]Auto Trait Implementations
impl<'a, N, R, C, RStride, CStride> RefUnwindSafe for SliceStorage<'a, N, R, C, RStride, CStride> where
C: RefUnwindSafe,
CStride: RefUnwindSafe,
N: RefUnwindSafe,
R: RefUnwindSafe,
RStride: RefUnwindSafe,
impl<'a, N, R, C, RStride, CStride> Unpin for SliceStorage<'a, N, R, C, RStride, CStride> where
C: Unpin,
CStride: Unpin,
R: Unpin,
RStride: Unpin,
impl<'a, N, R, C, RStride, CStride> UnwindSafe for SliceStorage<'a, N, R, C, RStride, CStride> where
C: UnwindSafe,
CStride: UnwindSafe,
N: RefUnwindSafe,
R: UnwindSafe,
RStride: UnwindSafe,
Blanket Implementations
Mutably borrows from an owned value. Read more
type Output = T
type Output = T
Should always be Self
The inverse inclusion map: attempts to construct self
from the equivalent element of its
superset. Read more
pub 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).
pub 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.
pub 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.
pub fn vzip(self) -> V