Struct nalgebra::base::SliceStorage

source ·
pub struct SliceStorage<'a, N: 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§

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§

Returns a copy of the value. Read more
Performs copy-assignment from source. Read more
Formats the value using the given formatter. Read more
The static stride of this storage’s rows.
The static stride of this storage’s columns.
The matrix data pointer.
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.
Builds a matrix data storage that does not contain any reference.
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.

Auto Trait Implementations§

Blanket Implementations§

Gets the TypeId of self. Read more
Immutably borrows from an owned value. Read more
Mutably borrows from an owned value. Read more

Returns the argument unchanged.

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Should always be Self
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.
The resulting type after obtaining ownership.
Creates owned data from borrowed data, usually by cloning. Read more
Uses borrowed data to replace owned data, usually by cloning. Read more
The type returned in the event of a conversion error.
Performs the conversion.
The type returned in the event of a conversion error.
Performs the conversion.