Struct nalgebra::base::ViewStorage

source ·
pub struct ViewStorage<'a, T, R: Dim, C: Dim, RStride: Dim, CStride: Dim> { /* private fields */ }
Expand description

A matrix data storage for a matrix view. Only contains an internal reference to another matrix data storage.

Implementations§

source§

impl<'a, T, R: Dim, C: Dim, RStride: Dim, CStride: Dim> ViewStorage<'a, T, R, C, RStride, CStride>

source

pub unsafe fn from_raw_parts( ptr: *const T, shape: (R, C), strides: (RStride, CStride) ) -> Self
where RStride: Dim, CStride: Dim,

Create a new matrix view without bounds checking and from a raw pointer.

§Safety

*ptr must point to memory that is valid [T; R * C].

source§

impl<'a, T, R: Dim, C: Dim> ViewStorage<'a, T, R, C, Dyn, Dyn>

source

pub unsafe fn new_unchecked<RStor, CStor, S>( storage: &'a S, start: (usize, usize), shape: (R, C) ) -> ViewStorage<'a, T, R, C, S::RStride, S::CStride>
where RStor: Dim, CStor: Dim, S: RawStorage<T, RStor, CStor>,

Create a new matrix view without bounds checking.

§Safety

storage contains sufficient elements beyond start + R * C such that all accesses are within bounds.

source

pub unsafe fn new_with_strides_unchecked<S, RStor, CStor, RStride, CStride>( storage: &'a S, start: (usize, usize), shape: (R, C), strides: (RStride, CStride) ) -> ViewStorage<'a, T, R, C, RStride, CStride>
where RStor: Dim, CStor: Dim, S: RawStorage<T, RStor, CStor>, RStride: Dim, CStride: Dim,

Create a new matrix view without bounds checking.

§Safety

strides must be a valid stride indexing.

source§

impl<'a, T, R: Dim, C: Dim, RStride: Dim, CStride: Dim> ViewStorage<'a, T, R, C, RStride, CStride>
where Self: RawStorage<T, R, C> + IsContiguous,

source

pub fn into_slice(self) -> &'a [T]

Extracts the original slice from this storage.

Trait Implementations§

source§

impl<'a, T: Scalar, R: Dim, C: Dim, RStride: Dim, CStride: Dim> Clone for ViewStorage<'a, T, R, C, RStride, CStride>

source§

fn clone(&self) -> Self

Returns a copy of the value. Read more
1.0.0 · source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
source§

impl<'a, T: Debug, R: Debug + Dim, C: Debug + Dim, RStride: Debug + Dim, CStride: Debug + Dim> Debug for ViewStorage<'a, T, R, C, RStride, CStride>

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl<'a, T, R: Dim, C: Dim, RStride: Dim, CStride: Dim> RawStorage<T, R, C> for ViewStorage<'a, T, R, C, RStride, CStride>

§

type RStride = RStride

The static stride of this storage’s rows.
§

type CStride = CStride

The static stride of this storage’s columns.
source§

fn ptr(&self) -> *const T

The matrix data pointer.
source§

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.
source§

fn strides(&self) -> (Self::RStride, Self::CStride)

The spacing between consecutive row elements and consecutive column elements. Read more
source§

fn is_contiguous(&self) -> bool

Indicates whether this data buffer stores its elements contiguously. Read more
source§

unsafe fn as_slice_unchecked(&self) -> &[T]

Retrieves the data buffer as a contiguous slice. Read more
source§

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
source§

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
source§

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
source§

unsafe fn get_unchecked_linear(&self, i: usize) -> &T

Retrieves a reference to the i-th element without bound-checking. Read more
source§

unsafe fn get_unchecked(&self, irow: usize, icol: usize) -> &T

Retrieves a reference to the i-th element without bound-checking. Read more
source§

impl<'a, T, R1, C1, R2, C2> ReshapableStorage<T, R1, C1, R2, C2> for ViewStorage<'a, T, R1, C1, U1, R1>
where T: Scalar, R1: Dim, C1: Dim, R2: Dim, C2: Dim,

§

type Output = ViewStorage<'a, T, R2, C2, Const<1>, R2>

The reshaped storage type.
source§

fn reshape_generic(self, nrows: R2, ncols: C2) -> Self::Output

Reshapes the storage into the output storage type.
source§

impl<'a, T: Scalar, R: Dim, C: Dim, RStride: Dim, CStride: Dim> Storage<T, R, C> for ViewStorage<'a, T, R, C, RStride, CStride>

source§

fn into_owned(self) -> Owned<T, R, C>

Builds a matrix data storage that does not contain any reference.
source§

fn clone_owned(&self) -> Owned<T, R, C>

Clones this data storage to one that does not contain any reference.
source§

fn forget_elements(self)

Drops the storage without calling the destructors on the contained elements.
source§

impl<'a, T: Scalar, R: Dim, C: Dim, RStride: Dim, CStride: Dim> Copy for ViewStorage<'a, T, R, C, RStride, CStride>

source§

impl<'a, T, R: DimName, C: Dim + IsNotStaticOne> IsContiguous for ViewStorage<'a, T, R, C, U1, R>

source§

impl<'a, T, R: Dim, CStride: Dim> IsContiguous for ViewStorage<'a, T, R, U1, U1, CStride>

source§

impl<'a, T: Send, R: Dim, C: Dim, RStride: Dim, CStride: Dim> Send for ViewStorage<'a, T, R, C, RStride, CStride>

source§

impl<'a, T: Sync, R: Dim, C: Dim, RStride: Dim, CStride: Dim> Sync for ViewStorage<'a, T, R, C, RStride, CStride>

Auto Trait Implementations§

§

impl<'a, T, R, C, RStride, CStride> Freeze for ViewStorage<'a, T, R, C, RStride, CStride>
where R: Freeze, C: Freeze, RStride: Freeze, CStride: Freeze,

§

impl<'a, T, R, C, RStride, CStride> RefUnwindSafe for ViewStorage<'a, T, R, C, RStride, CStride>

§

impl<'a, T, R, C, RStride, CStride> Unpin for ViewStorage<'a, T, R, C, RStride, CStride>
where R: Unpin, C: Unpin, RStride: Unpin, CStride: Unpin,

§

impl<'a, T, R, C, RStride, CStride> UnwindSafe for ViewStorage<'a, T, R, C, RStride, CStride>
where T: RefUnwindSafe, R: UnwindSafe, C: UnwindSafe, RStride: UnwindSafe, CStride: UnwindSafe,

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

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

source§

impl<T> Same for T

§

type Output = T

Should always be Self
source§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
source§

fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).
source§

fn to_subset_unchecked(&self) -> SS

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
source§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
source§

impl<T> ToOwned for T
where T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.