nyx_space::linalg

Struct ViewStorageMut

source
pub struct ViewStorageMut<'a, T, R, C, RStride, CStride>
where 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, C, RStride, CStride> ViewStorageMut<'a, T, R, C, RStride, CStride>
where R: Dim, C: Dim, RStride: Dim, CStride: Dim,

source

pub unsafe fn from_raw_parts( ptr: *mut T, shape: (R, C), strides: (RStride, CStride), ) -> ViewStorageMut<'a, T, R, C, RStride, CStride>
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, C> ViewStorageMut<'a, T, R, C, Dyn, Dyn>
where R: Dim, C: Dim,

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 as RawStorage<T, RStor, CStor>>::RStride, <S as RawStorage<T, RStor, CStor>>::CStride>
where RStor: Dim, CStor: Dim, S: RawStorageMut<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 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.

§Safety

strides must be a valid stride indexing.

source§

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

source

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

Extracts the original slice from this storage.

source§

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

source§

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

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

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

source§

type RStride = RStride

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

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, ) -> (<ViewStorageMut<'a, T, R, C, RStride, CStride> as RawStorage<T, R, C>>::RStride, <ViewStorageMut<'a, T, R, C, RStride, CStride> as RawStorage<T, R, C>>::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, C, RStride, CStride> RawStorageMut<T, R, C> for ViewStorageMut<'a, T, R, C, RStride, CStride>
where R: Dim, C: Dim, RStride: Dim, CStride: Dim,

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, Const<1>, R1>
where T: Scalar, R1: Dim, C1: Dim, R2: Dim, C2: Dim,

source§

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

The reshaped storage type.
source§

fn reshape_generic( self, nrows: R2, ncols: C2, ) -> <ViewStorageMut<'a, T, R1, C1, Const<1>, R1> as ReshapableStorage<T, R1, C1, R2, C2>>::Output

Reshapes the storage into the output storage type.
source§

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

source§

fn into_owned(self) -> <DefaultAllocator as Allocator<R, C>>::Buffer<T>

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

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

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, R, C> IsContiguous for ViewStorageMut<'a, T, R, C, Const<1>, R>
where R: DimName, C: Dim + IsNotStaticOne,

source§

impl<'a, T, R, CStride> IsContiguous for ViewStorageMut<'a, T, R, Const<1>, Const<1>, CStride>
where R: Dim, CStride: Dim,

source§

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

source§

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

Auto Trait Implementations§

§

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

§

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

§

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

§

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

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.

§

impl<T> Instrument for T

§

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided [Span], returning an Instrumented wrapper. Read more
§

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
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> IntoEither for T

source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
§

impl<T> Pointable for T

§

const ALIGN: usize = _

The alignment of pointer.
§

type Init = T

The type for initializers.
§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
source§

impl<T> Same for T

source§

type Output = T

Should always be Self
§

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

§

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

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

fn is_in_subset(&self) -> bool

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

fn to_subset_unchecked(&self) -> SS

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

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 T
where U: Into<T>,

source§

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>,

source§

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

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

§

fn vzip(self) -> V

§

impl<T> WithSubscriber for T

§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a [WithDispatch] wrapper. Read more
§

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a [WithDispatch] wrapper. Read more
§

impl<T> Allocation for T
where T: RefUnwindSafe + Send + Sync,

source§

impl<S, T, R, C> StorageMut<T, R, C> for S
where T: Scalar, R: Dim, C: Dim, S: Storage<T, R, C> + RawStorageMut<T, R, C>,