Struct na::VecStorage

#[repr(C)]
pub struct VecStorage<T, R, C>where
    R: Dim,
    C: Dim,{ /* private fields */ }

A Vec-based matrix data storage. It may be dynamically-sized.

Implementations

impl<T, R, C> VecStorage<T, R, C>where R: Dim, C: Dim,

pub fn new(nrows: R, ncols: C, data: Vec<T, Global>) -> VecStorage<T, R, C>

Creates a new dynamic matrix data storage from the given vector and shape.

pub fn as_vec(&self) -> &Vec<T, Global>

The underlying data storage.

pub unsafe fn as_vec_mut(&mut self) -> &mut Vec<T, Global>

The underlying mutable data storage.

Safety

This is unsafe because this may cause UB if the size of the vector is changed by the user.

pub unsafe fn resize(self, sz: usize) -> Vec<MaybeUninit<T>, Global>

Resizes the underlying mutable data storage and unwraps it.

Safety

• If sz is larger than the current size, additional elements are uninitialized.
• If sz is smaller than the current size, additional elements are truncated but not dropped. It is the responsibility of the caller of this method to drop these elements.

pub fn len(&self) -> usize

The number of elements on the underlying vector.

pub fn is_empty(&self) -> bool

Returns true if the underlying vector contains no elements.

pub fn as_slice(&self) -> &[T]

A slice containing all the components stored in this storage in column-major order.

pub fn as_mut_slice(&mut self) -> &mut [T]

A mutable slice containing all the components stored in this storage in column-major order.

Trait Implementations

impl<T, R, C> Clone for VecStorage<T, R, C>where T: Clone, R: Clone + Dim, C: Clone + Dim,

fn clone(&self) -> VecStorage<T, R, C>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T, R, C> Debug for VecStorage<T, R, C>where T: Debug, R: Debug + Dim, C: Debug + Dim,

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

Formats the value using the given formatter.

impl<'a, T, R> Extend<&'a T> for VecStorage<T, R, Dyn>where T: 'a + Copy, R: Dim,

fn extend<I>(&mut self, iter: I)where I: IntoIterator<Item = &'a T>,

Extends the number of columns of the VecStorage with elements from the given iterator.

Panics

This function panics if the number of elements yielded by the given iterator is not a multiple of the number of rows of the VecStorage.

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl<T, R, RV, SV> Extend<Matrix<T, RV, Const<1>, SV>> for VecStorage<T, R, Dyn>where T: Scalar, R: Dim, RV: Dim, SV: RawStorage<T, RV, Const<1>>, ShapeConstraint: SameNumberOfRows<R, RV>,

fn extend<I>(&mut self, iter: I)where I: IntoIterator<Item = Matrix<T, RV, Const<1>, SV>>,

Extends the number of columns of the VecStorage with vectors from the given iterator.

Panics

This function panics if the number of rows of each Vector yielded by the iterator is not equal to the number of rows of this VecStorage.

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl<T> Extend<T> for VecStorage<T, Dyn, Const<1>>

fn extend<I>(&mut self, iter: I)where I: IntoIterator<Item = T>,

Extends the number of rows of the VecStorage with elements from the given iterator.

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl<T, R> Extend<T> for VecStorage<T, R, Dyn>where R: Dim,

fn extend<I>(&mut self, iter: I)where I: IntoIterator<Item = T>,

Extends the number of columns of the VecStorage with elements from the given iterator.

Panics

This function panics if the number of elements yielded by the given iterator is not a multiple of the number of rows of the VecStorage.

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl<T, R, C> PartialEq<VecStorage<T, R, C>> for VecStorage<T, R, C>where T: PartialEq<T>, R: PartialEq<R> + Dim, C: PartialEq<C> + Dim,

fn eq(&self, other: &VecStorage<T, R, C>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<T, C> RawStorage<T, Dyn, C> for VecStorage<T, Dyn, C>where C: Dim,

type RStride = Const<1>

The static stride of this storage’s rows.

type CStride = Dyn

The static stride of this storage’s columns.

fn ptr(&self) -> *const T

The matrix data pointer.

fn shape(&self) -> (Dyn, 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.

fn strides( &self ) -> (<VecStorage<T, Dyn, C> as RawStorage<T, Dyn, C>>::RStride, <VecStorage<T, Dyn, C> as RawStorage<T, Dyn, C>>::CStride)

The spacing between consecutive row elements and consecutive column elements.

fn is_contiguous(&self) -> bool

Indicates whether this data buffer stores its elements contiguously.

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

Retrieves the data buffer as a contiguous slice.

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:

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

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

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

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

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

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

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

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

impl<T, R> RawStorage<T, R, Dyn> for VecStorage<T, R, Dyn>where R: DimName,

type RStride = Const<1>

The static stride of this storage’s rows.

type CStride = R

The static stride of this storage’s columns.

fn ptr(&self) -> *const T

The matrix data pointer.

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

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.

fn strides( &self ) -> (<VecStorage<T, R, Dyn> as RawStorage<T, R, Dyn>>::RStride, <VecStorage<T, R, Dyn> as RawStorage<T, R, Dyn>>::CStride)

The spacing between consecutive row elements and consecutive column elements.

fn is_contiguous(&self) -> bool

Indicates whether this data buffer stores its elements contiguously.

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

Retrieves the data buffer as a contiguous slice.

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:

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

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

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

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

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

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

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

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

impl<T, C> RawStorageMut<T, Dyn, C> for VecStorage<T, Dyn, C>where C: Dim,

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

The matrix mutable data pointer.

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

Retrieves the mutable data buffer as a contiguous slice.

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.

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.

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

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

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.

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

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

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

Swaps two elements without bound-checking.

impl<T, R> RawStorageMut<T, R, Dyn> for VecStorage<T, R, Dyn>where R: DimName,

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

The matrix mutable data pointer.

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

Retrieves the mutable data buffer as a contiguous slice.

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.

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.

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

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

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.

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

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

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

Swaps two elements without bound-checking.

impl<T, C1, C2> ReshapableStorage<T, Dyn, C1, Dyn, C2> for VecStorage<T, Dyn, C1>where T: Scalar, C1: Dim, C2: Dim,

type Output = VecStorage<T, Dyn, C2>

The reshaped storage type.

fn reshape_generic( self, nrows: Dyn, ncols: C2 ) -> <VecStorage<T, Dyn, C1> as ReshapableStorage<T, Dyn, C1, Dyn, C2>>::Output

Reshapes the storage into the output storage type.

impl<T, C1, R2> ReshapableStorage<T, Dyn, C1, R2, Dyn> for VecStorage<T, Dyn, C1>where T: Scalar, C1: Dim, R2: DimName,

type Output = VecStorage<T, R2, Dyn>

The reshaped storage type.

fn reshape_generic( self, nrows: R2, ncols: Dyn ) -> <VecStorage<T, Dyn, C1> as ReshapableStorage<T, Dyn, C1, R2, Dyn>>::Output

Reshapes the storage into the output storage type.

impl<T, R1, C2> ReshapableStorage<T, R1, Dyn, Dyn, C2> for VecStorage<T, R1, Dyn>where T: Scalar, R1: DimName, C2: Dim,

type Output = VecStorage<T, Dyn, C2>

The reshaped storage type.

fn reshape_generic( self, nrows: Dyn, ncols: C2 ) -> <VecStorage<T, R1, Dyn> as ReshapableStorage<T, R1, Dyn, Dyn, C2>>::Output

Reshapes the storage into the output storage type.

impl<T, R1, R2> ReshapableStorage<T, R1, Dyn, R2, Dyn> for VecStorage<T, R1, Dyn>where T: Scalar, R1: DimName, R2: DimName,

type Output = VecStorage<T, R2, Dyn>

The reshaped storage type.

fn reshape_generic( self, nrows: R2, ncols: Dyn ) -> <VecStorage<T, R1, Dyn> as ReshapableStorage<T, R1, Dyn, R2, Dyn>>::Output

Reshapes the storage into the output storage type.

impl<T, C> Storage<T, Dyn, C> for VecStorage<T, Dyn, C>where T: Scalar, C: Dim, DefaultAllocator: Allocator<T, Dyn, C, Buffer = VecStorage<T, Dyn, C>>,

fn into_owned(self) -> <DefaultAllocator as Allocator<T, Dyn, C>>::Bufferwhere DefaultAllocator: Allocator<T, Dyn, C>,

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

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

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

impl<T, R> Storage<T, R, Dyn> for VecStorage<T, R, Dyn>where T: Scalar, R: DimName, DefaultAllocator: Allocator<T, R, Dyn, Buffer = VecStorage<T, R, Dyn>>,

fn into_owned(self) -> <DefaultAllocator as Allocator<T, R, Dyn>>::Bufferwhere DefaultAllocator: Allocator<T, R, Dyn>,

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

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

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

impl<T, R, C> Eq for VecStorage<T, R, C>where T: Eq, R: Eq + Dim, C: Eq + Dim,

impl<T, R, C> IsContiguous for VecStorage<T, R, C>where R: Dim, C: Dim,

impl<T, R, C> StructuralEq for VecStorage<T, R, C>where R: Dim, C: Dim,

impl<T, R, C> StructuralPartialEq for VecStorage<T, R, C>where R: Dim, C: Dim,