ViewStorageMut in nalgebra::base - Rust
Description: A mutable matrix data storage for mutable matrix view. Only contains an internal mutable reference to another matrix data storage.
Keywords: rust, rustlang, rust-lang, ViewStorageMut

# Struct nalgebra::base::ViewStorageMut

source ·

    pub struct ViewStorageMut<'a, T, R: Dim, C: Dim, RStride: Dim, CStride: Dim> { /* private fields */ }

Expand description

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

## Implementations§

source§

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

source

#### pub unsafe fn from_raw_parts(
ptr: *mut T,
shape: (R, C),
strides: (RStride, CStride)
) -> Selfwhere
RStride: Dim,
CStride: Dim,

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

source§

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

source

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

Create a new matrix view without bounds checking.

source

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

Create a new matrix view without bounds checking.

source§

### impl<'a, T, R: Dim, C: Dim, RStride: Dim, CStride: Dim> ViewStorageMut<'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.

source§

### impl<'a, T: Scalar, R: Dim, C: Dim, RStride: Dim, CStride: Dim> ViewStorageMut<'a, T, R, C, RStride, CStride>where
Self: RawStorageMut<T, R, C> + IsContiguous,

source

#### pub fn into_slice_mut(self) -> &'a mut [T]

Extracts the original slice from this storage

## Trait Implementations§

source§

### impl<'a, T: Debug, R: Debug + Dim, C: Debug + Dim, RStride: Debug + Dim, CStride: Debug + Dim> Debug for ViewStorageMut<'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 ViewStorageMut<'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`. Read more
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, R: Dim, C: Dim, RStride: Dim, CStride: Dim> RawStorageMut<T, R, C> for ViewStorageMut<'a, T, R, C, RStride, CStride>

source§

#### fn ptr_mut(&mut self) -> *mut T

The matrix mutable data pointer.
source§

#### unsafe fn as_mut_slice_unchecked(&mut self) -> &mut [T]

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

#### fn get_address_unchecked_linear_mut(&mut self, i: usize) -> *mut T

Gets the mutable address of the i-th matrix component without performing bound-checking. Read more
source§

#### fn get_address_unchecked_mut(&mut self, irow: usize, icol: usize) -> *mut T

Gets the mutable address of the i-th matrix component without performing bound-checking. Read more
source§

#### unsafe fn get_unchecked_linear_mut(&mut self, i: usize) -> &mut T

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

#### unsafe fn get_unchecked_mut(&mut self, irow: usize, icol: usize) -> &mut T

Retrieves a mutable reference to the element at `(irow, icol)` without bound-checking. Read more
source§

#### unsafe fn swap_unchecked_linear(&mut self, i1: usize, i2: usize)

Swaps two elements using their linear index without bound-checking. Read more
source§

#### unsafe fn swap_unchecked(
&mut self,
row_col1: (usize, usize),
row_col2: (usize, usize)
)

Swaps two elements without bound-checking. Read more
source§

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

§

#### type Output = ViewStorageMut<'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 ViewStorageMut<'a, T, R, C, RStride, CStride>

source§

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

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

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

source§

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

source§

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

source§

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

## Auto Trait Implementations§

§

### impl<'a, T, R, C, RStride, CStride> RefUnwindSafe for ViewStorageMut<'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 ViewStorageMut<'a, T, R, C, RStride, CStride>where
C: Unpin,
CStride: Unpin,
R: Unpin,
RStride: Unpin,

§

### impl<'a, T, R, C, RStride, CStride> !UnwindSafe for ViewStorageMut<'a, T, R, C, RStride, CStride>

## Blanket Implementations§

source§

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

source§

#### fn type_id(&self) -> TypeId

Gets the `TypeId` of `self`. Read more
source§

### impl<T> Borrow<T> for Twhere
T: ?Sized,

const: unstable · source§

#### fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

### impl<T> BorrowMut<T> for Twhere
T: ?Sized,

const: unstable · source§

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

Mutably borrows from an owned value. Read more
source§

### impl<T> From<T> for T

const: unstable · source§

#### fn from(t: T) -> T

Returns the argument unchanged.

source§

### impl<T, U> Into<U> for Twhere
U: From<T>,

const: unstable · 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<T> for T

§

#### type Output = T

Should always be `Self`
source§

### impl<SS, SP> SupersetOf<SS> for SPwhere
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, U> TryFrom<U> for Twhere
U: Into<T>,

§

#### type Error = Infallible

The type returned in the event of a conversion error.
const: unstable · source§

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

Performs the conversion.
source§

### impl<T, U> TryInto<U> for Twhere
U: TryFrom<T>,

§

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

The type returned in the event of a conversion error.
const: unstable · source§

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

Performs the conversion.
source§

### impl<S, T, R, C> StorageMut<T, R, C> for Swhere
R: Dim,
C: Dim,
S: Storage<T, R, C> + RawStorageMut<T, R, C>,