Struct nalgebra::base::SliceStorageMut

source · [−]

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

Expand description

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

Implementations

source

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

source

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

Create a new matrix slice without bound checking and from a raw pointer.

source

impl<'a, T: Scalar, R: Dim, C: Dim> SliceStorageMut<'a, T, R, C, Dynamic, Dynamic>

source

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

Create a new matrix slice without bound 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)
) -> SliceStorageMut<'a, T, R, C, RStride, CStride> where
 RStor: Dim,
 CStor: Dim,
 S: StorageMut<T, RStor, CStor>,
 RStride: Dim,
 CStride: Dim,

Create a new matrix slice without bound checking.

Trait Implementations

source

impl<'a, T: Debug + Scalar, R: Debug + Dim, C: Debug + Dim, RStride: Debug + Dim, CStride: Debug + Dim> Debug for SliceStorageMut<'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: Scalar, R: Dim, C: Dim, RStride: Dim, CStride: Dim> Storage<T, R, C> for SliceStorageMut<'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.

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

fn as_slice(&self) -> &[T]ⓘNotable traits for &'_ [u8 ]`impl<'_> Read for &'_ [u8]impl<'_> Write for &'_ mut [u8]`

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

unsafe fn get_address_unchecked_linear(&self, i: usize) -> *const T

Gets the address of the i-th matrix component without performing bound-checking.

source

unsafe fn get_address_unchecked(&self, irow: usize, icol: usize) -> *const T

Gets the address of the i-th matrix component without performing bound-checking.

source

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

Retrieves a reference to the i-th element without bound-checking.

source

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

Retrieves a reference to the i-th element without bound-checking.

source

impl<'a, T: Scalar, R: Dim, C: Dim, RStride: Dim, CStride: Dim> StorageMut<T, R, C> for SliceStorageMut<'a, T, R, C, RStride, CStride>

source

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

The matrix mutable data pointer.

source

fn as_mut_slice(&mut self) -> &mut [T]ⓘNotable traits for &'_ [u8 ]`impl<'_> Read for &'_ [u8]impl<'_> Write for &'_ mut [u8]`

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

source

unsafe 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.

source

unsafe 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.

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.

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.

source

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

Swaps two elements using their linear index without bound-checking.

source

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

Swaps two elements without bound-checking.

source

impl<'a, T: Scalar, R: DimName, C: Dim + IsNotStaticOne> ContiguousStorage<T, R, C> for SliceStorageMut<'a, T, R, C, U1, R>

source

impl<'a, T: Scalar, R: Dim, CStride: Dim> ContiguousStorage<T, R, Const<1_usize>> for SliceStorageMut<'a, T, R, U1, U1, CStride>

source

impl<'a, T: Scalar, R: DimName, C: Dim + IsNotStaticOne> ContiguousStorageMut<T, R, C> for SliceStorageMut<'a, T, R, C, U1, R>

source

impl<'a, T: Scalar, R: Dim, CStride: Dim> ContiguousStorageMut<T, R, Const<1_usize>> for SliceStorageMut<'a, T, R, U1, U1, CStride>

source

impl<'a, T: Scalar + Send, R: Dim, C: Dim, RStride: Dim, CStride: Dim> Send for SliceStorageMut<'a, T, R, C, RStride, CStride>

source

impl<'a, T: Scalar + Sync, R: Dim, C: Dim, RStride: Dim, CStride: Dim> Sync for SliceStorageMut<'a, T, R, C, RStride, CStride>

Auto Trait Implementations

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

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

Blanket Implementations

source

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

source

pub fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

source

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

const: unstable · source

pub fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

source

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

const: unstable · source

pub 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

pub fn from(t: T) -> T

Returns the argument unchanged.

source

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

const: unstable · source

pub 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 SP where
SS: SubsetOf<SP>,

source

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

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

source

pub fn is_in_subset(&self) -> bool

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

source

pub fn to_subset_unchecked(&self) -> SS

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

source

pub fn from_subset(element: &SS) -> SP

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

source

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

type Error = Infallible

The type returned in the event of a conversion error.

const: unstable · source

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

Performs the conversion.

source

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

type Error = >::Error

The type returned in the event of a conversion error.

const: unstable · source

pub fn try_into(self) -> Result<U, >::Error>

Performs the conversion.

source

impl<V, T> VZip<V> for T where
V: MultiLane<T>,

source

Struct nalgebra::base::SliceStorageMut

Implementations

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

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

impl<'a, T: Scalar, R: Dim, C: Dim> SliceStorageMut<'a, T, R, C, Dynamic, Dynamic>

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

Trait Implementations

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

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

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

type RStride = RStride

type CStride = CStride

fn ptr(&self) -> *const T

fn shape(&self) -> (R, C)

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

fn is_contiguous(&self) -> bool

fn into_owned(self) -> Owned<T, R, C> where DefaultAllocator: Allocator<T, R, C>,

fn clone_owned(&self) -> Owned<T, R, C> where DefaultAllocator: Allocator<T, R, C>,

fn as_slice(&self) -> &[T]ⓘNotable traits for &'_ [u8]impl<'_> Read for &'_ [u8]impl<'_> Write for &'_ mut [u8]

fn linear_index(&self, irow: usize, icol: usize) -> usize

unsafe fn get_address_unchecked_linear(&self, i: usize) -> *const T

unsafe fn get_address_unchecked(&self, irow: usize, icol: usize) -> *const T

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

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

impl<'a, T: Scalar, R: Dim, C: Dim, RStride: Dim, CStride: Dim> StorageMut<T, R, C> for SliceStorageMut<'a, T, R, C, RStride, CStride>

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

fn as_mut_slice(&mut self) -> &mut [T]ⓘNotable traits for &'_ [u8]impl<'_> Read for &'_ [u8]impl<'_> Write for &'_ mut [u8]

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

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

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

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

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

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

impl<'a, T: Scalar, R: DimName, C: Dim + IsNotStaticOne> ContiguousStorage<T, R, C> for SliceStorageMut<'a, T, R, C, U1, R>

impl<'a, T: Scalar, R: Dim, CStride: Dim> ContiguousStorage<T, R, Const<1_usize>> for SliceStorageMut<'a, T, R, U1, U1, CStride>

impl<'a, T: Scalar, R: DimName, C: Dim + IsNotStaticOne> ContiguousStorageMut<T, R, C> for SliceStorageMut<'a, T, R, C, U1, R>

impl<'a, T: Scalar, R: Dim, CStride: Dim> ContiguousStorageMut<T, R, Const<1_usize>> for SliceStorageMut<'a, T, R, U1, U1, CStride>

impl<'a, T: Scalar + Send, R: Dim, C: Dim, RStride: Dim, CStride: Dim> Send for SliceStorageMut<'a, T, R, C, RStride, CStride>

impl<'a, T: Scalar + Sync, R: Dim, C: Dim, RStride: Dim, CStride: Dim> Sync for SliceStorageMut<'a, T, R, C, RStride, CStride>

Auto Trait Implementations

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

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

Blanket Implementations

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

pub fn type_id(&self) -> TypeId

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

pub fn borrow(&self) -> &T

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

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

impl<T> From<T> for T

pub fn from(t: T) -> T

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

pub fn into(self) -> U

impl<T> Same<T> for T

type Output = T

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

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

pub fn is_in_subset(&self) -> bool

pub fn to_subset_unchecked(&self) -> SS

pub fn from_subset(element: &SS) -> SP

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

type Error = Infallible

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

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

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

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

impl<V, T> VZip<V> for T where V: MultiLane<T>,

pub fn vzip(self) -> V

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

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

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

fn into_owned(self) -> Owned<T, R, C> where
DefaultAllocator: Allocator<T, R, C>,

fn clone_owned(&self) -> Owned<T, R, C> where
DefaultAllocator: Allocator<T, R, C>,

fn as_slice(&self) -> &[T]ⓘNotable traits for &'_ [u8 ]`impl<'_> Read for &'_ [u8]impl<'_> Write for &'_ mut [u8]`

fn as_mut_slice(&mut self) -> &mut [T]ⓘNotable traits for &'_ [u8 ]`impl<'_> Read for &'_ [u8]impl<'_> Write for &'_ mut [u8]`

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

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

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

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

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

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

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

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

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

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

impl<V, T> VZip<V> for T where
V: MultiLane<T>,