Struct nalgebra::base::VecStorage

source · [−]

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

Expand description

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

Implementations

source

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

source

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

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

source

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

The underlying data storage.

source

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

The underlying mutable data storage.

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

source

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

Resizes the underlying mutable data storage and unwraps it.

If sz is larger than the current size, additional elements are uninitialized. If sz is smaller than the current size, additional elements are truncated.

source

pub fn len(&self) -> usize

The number of elements on the underlying vector.

source

pub fn is_empty(&self) -> bool

Returns true if the underlying vector contains no elements.

Trait Implementations

source

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

source

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

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<T: Debug, R: Debug + Dim, C: Debug + Dim> Debug for VecStorage<T, R, C>

source

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

Formats the value using the given formatter. Read more

source

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

source

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

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.

source

fn extend_one(&mut self, item: A)

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

Extends a collection with exactly one element.

source

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. Read more

source

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

source

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

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.

source

fn extend_one(&mut self, item: A)

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

Extends a collection with exactly one element.

source

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. Read more

source

impl<T, R: Dim> Extend<T> for VecStorage<T, R, Dynamic>

source

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

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.

source

fn extend_one(&mut self, item: A)

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

Extends a collection with exactly one element.

source

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. Read more

source

impl<T> Extend<T> for VecStorage<T, Dynamic, U1>

source

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

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

source

fn extend_one(&mut self, item: A)

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

Extends a collection with exactly one element.

source

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. Read more

source

impl<T, R: Dim, C: Dim> Into<Vec<T, Global>> for VecStorage<T, R, C>

source

fn into(self) -> Vec<T>

Performs the conversion.

source

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

source

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

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

source

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

This method tests for !=.

source

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

type Output = VecStorage<T, Dynamic, C2>

The reshaped storage type.

source

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

Reshapes the storage into the output storage type.

source

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

type Output = VecStorage<T, R2, Dynamic>

The reshaped storage type.

source

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

Reshapes the storage into the output storage type.

source

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

type Output = VecStorage<T, Dynamic, C2>

The reshaped storage type.

source

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

Reshapes the storage into the output storage type.

source

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

type Output = VecStorage<T, R2, Dynamic>

The reshaped storage type.

source

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

Reshapes the storage into the output storage type.

source

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

type RStride = U1

The static stride of this storage’s rows.

type CStride = Dynamic

The static stride of this storage’s columns.

source

fn ptr(&self) -> *const T

The matrix data pointer.

source

fn shape(&self) -> (Dynamic, 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, Dynamic, C> where
DefaultAllocator: Allocator<T, Dynamic, C>,

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

source

fn clone_owned(&self) -> Owned<T, Dynamic, C> where
DefaultAllocator: Allocator<T, Dynamic, 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<T: Scalar, R: DimName> Storage<T, R, Dynamic> for VecStorage<T, R, Dynamic> where
DefaultAllocator: Allocator<T, R, Dynamic, Buffer = Self>,

type RStride = U1

The static stride of this storage’s rows.

type CStride = R

The static stride of this storage’s columns.

source

fn ptr(&self) -> *const T

The matrix data pointer.

source

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

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, Dynamic> where
DefaultAllocator: Allocator<T, R, Dynamic>,

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

source

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

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<T: Scalar, C: Dim> StorageMut<T, Dynamic, C> for VecStorage<T, Dynamic, C> where
DefaultAllocator: Allocator<T, Dynamic, C, Buffer = Self>,

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<T: Scalar, R: DimName> StorageMut<T, R, Dynamic> for VecStorage<T, R, Dynamic> where
DefaultAllocator: Allocator<T, R, Dynamic, Buffer = Self>,

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<T: Scalar, C: Dim> ContiguousStorage<T, Dynamic, C> for VecStorage<T, Dynamic, C> where
DefaultAllocator: Allocator<T, Dynamic, C, Buffer = Self>,

source

impl<T: Scalar, R: DimName> ContiguousStorage<T, R, Dynamic> for VecStorage<T, R, Dynamic> where
DefaultAllocator: Allocator<T, R, Dynamic, Buffer = Self>,

source

impl<T: Scalar, C: Dim> ContiguousStorageMut<T, Dynamic, C> for VecStorage<T, Dynamic, C> where
DefaultAllocator: Allocator<T, Dynamic, C, Buffer = Self>,

source

impl<T: Scalar, R: DimName> ContiguousStorageMut<T, R, Dynamic> for VecStorage<T, R, Dynamic> where
DefaultAllocator: Allocator<T, R, Dynamic, Buffer = Self>,

source

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

source

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

source

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

Auto Trait Implementations

impl<T, R, C> RefUnwindSafe for VecStorage<T, R, C> where
 C: RefUnwindSafe,
 R: RefUnwindSafe,
 T: RefUnwindSafe,

impl<T, R, C> Send for VecStorage<T, R, C> where
T: Send,

impl<T, R, C> Sync for VecStorage<T, R, C> where
T: Sync,

impl<T, R, C> Unpin for VecStorage<T, R, C> where
 C: Unpin,
 R: Unpin,
 T: Unpin,

impl<T, R, C> UnwindSafe for VecStorage<T, R, C> where
 C: UnwindSafe,
 R: UnwindSafe,
 T: UnwindSafe,

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> ToOwned for T where
T: Clone,

type Owned = T

The resulting type after obtaining ownership.

source

pub fn to_owned(&self) -> T

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

source

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

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

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

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::VecStorage

Implementations

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

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

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

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

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

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

Trait Implementations

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

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

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

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

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

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

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

fn extend_one(&mut self, item: A)

fn extend_reserve(&mut self, additional: usize)

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

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

fn extend_one(&mut self, item: A)

fn extend_reserve(&mut self, additional: usize)

impl<T, R: Dim> Extend<T> for VecStorage<T, R, Dynamic>

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

fn extend_one(&mut self, item: A)

fn extend_reserve(&mut self, additional: usize)

impl<T> Extend<T> for VecStorage<T, Dynamic, U1>

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

fn extend_one(&mut self, item: A)

fn extend_reserve(&mut self, additional: usize)

impl<T, R: Dim, C: Dim> Into<Vec<T, Global>> for VecStorage<T, R, C>

fn into(self) -> Vec<T>

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

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

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

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

type Output = VecStorage<T, Dynamic, C2>

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

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

type Output = VecStorage<T, R2, Dynamic>

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

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

type Output = VecStorage<T, Dynamic, C2>

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

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

type Output = VecStorage<T, R2, Dynamic>

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

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

type RStride = U1

type CStride = Dynamic

fn ptr(&self) -> *const T

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

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

fn is_contiguous(&self) -> bool

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

fn clone_owned(&self) -> Owned<T, Dynamic, C> where DefaultAllocator: Allocator<T, Dynamic, 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<T: Scalar, R: DimName> Storage<T, R, Dynamic> for VecStorage<T, R, Dynamic> where DefaultAllocator: Allocator<T, R, Dynamic, Buffer = Self>,

type RStride = U1

type CStride = R

fn ptr(&self) -> *const T

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

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

fn is_contiguous(&self) -> bool

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

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

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<T: Scalar, C: Dim> StorageMut<T, Dynamic, C> for VecStorage<T, Dynamic, C> where DefaultAllocator: Allocator<T, Dynamic, C, Buffer = Self>,

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

impl<T: Scalar, C: Dim> StorageMut<T, Dynamic, C> for VecStorage<T, Dynamic, C> where
DefaultAllocator: Allocator<T, Dynamic, C, Buffer = Self>,

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<T: Scalar, R: DimName> StorageMut<T, R, Dynamic> for VecStorage<T, R, Dynamic> where
DefaultAllocator: Allocator<T, R, Dynamic, Buffer = Self>,

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<T: Scalar, C: Dim> ContiguousStorage<T, Dynamic, C> for VecStorage<T, Dynamic, C> where
DefaultAllocator: Allocator<T, Dynamic, C, Buffer = Self>,

impl<T: Scalar, R: DimName> ContiguousStorage<T, R, Dynamic> for VecStorage<T, R, Dynamic> where
DefaultAllocator: Allocator<T, R, Dynamic, Buffer = Self>,

impl<T: Scalar, C: Dim> ContiguousStorageMut<T, Dynamic, C> for VecStorage<T, Dynamic, C> where
DefaultAllocator: Allocator<T, Dynamic, C, Buffer = Self>,

impl<T: Scalar, R: DimName> ContiguousStorageMut<T, R, Dynamic> for VecStorage<T, R, Dynamic> where
DefaultAllocator: Allocator<T, R, Dynamic, Buffer = Self>,

impl<T, R, C> RefUnwindSafe for VecStorage<T, R, C> where
C: RefUnwindSafe,
R: RefUnwindSafe,
T: RefUnwindSafe,

impl<T, R, C> Send for VecStorage<T, R, C> where
T: Send,

impl<T, R, C> Sync for VecStorage<T, R, C> where
T: Sync,

impl<T, R, C> Unpin for VecStorage<T, R, C> where
C: Unpin,
R: Unpin,
T: Unpin,

impl<T, R, C> UnwindSafe for VecStorage<T, R, C> where
C: UnwindSafe,
R: UnwindSafe,
T: UnwindSafe,

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> ToOwned for T where
T: Clone,

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