Struct bevy_rapier2d::prelude::nalgebra::VecStorage

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

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

Implementations

impl<T, R, C> VecStorage<T, R, C> where
    C: Dim,
    R: 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.

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

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.

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.

Trait Implementations

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

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

pub 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, Dynamic> where
    T: 'a + Copy,
    R: Dim, 

pub 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_usize>, SV>> for VecStorage<T, R, Dynamic> where
    T: Scalar,
    R: Dim,
    RV: Dim,
    SV: Storage<T, RV, Const<1_usize>>,
    ShapeConstraint: SameNumberOfRows<R, RV>, 

pub fn extend<I>(&mut self, iter: I) where
    I: IntoIterator<Item = Matrix<T, RV, Const<1_usize>, 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, R> Extend<T> for VecStorage<T, R, Dynamic> where
    R: Dim, 

pub 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> Extend<T> for VecStorage<T, Dynamic, Const<1_usize>>

pub 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, C> Into<Vec<T, Global>> for VecStorage<T, R, C> where
    C: Dim,
    R: Dim, 

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

Performs the conversion.

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

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

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

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

This method tests for !=.

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.

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

Reshapes the storage into the output storage type.

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.

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

Reshapes the storage into the output storage type.

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

type Output = VecStorage<T, Dynamic, C2>

The reshaped storage type.

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

Reshapes the storage into the output storage type.

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.

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

Reshapes the storage into the output storage type.

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

type RStride = Const<1_usize>

The static stride of this storage’s rows.

type CStride = Dynamic

The static stride of this storage’s columns.

pub fn ptr(&self) -> *const T

The matrix data pointer.

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

pub fn strides(
    &self
) -> (<VecStorage<T, Dynamic, C> as Storage<T, Dynamic, C>>::RStride, <VecStorage<T, Dynamic, C> as Storage<T, Dynamic, C>>::CStride)

The spacing between consecutive row elements and consecutive column elements.

pub fn is_contiguous(&self) -> bool

Indicates whether this data buffer stores its elements contiguously.

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

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

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

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

pub fn as_slice(&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:

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

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

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.

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

type RStride = Const<1_usize>

The static stride of this storage’s rows.

type CStride = R

The static stride of this storage’s columns.

pub fn ptr(&self) -> *const T

The matrix data pointer.

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

pub fn strides(
    &self
) -> (<VecStorage<T, R, Dynamic> as Storage<T, R, Dynamic>>::RStride, <VecStorage<T, R, Dynamic> as Storage<T, R, Dynamic>>::CStride)

The spacing between consecutive row elements and consecutive column elements.

pub fn is_contiguous(&self) -> bool

Indicates whether this data buffer stores its elements contiguously.

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

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

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

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

pub fn as_slice(&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:

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

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

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.

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

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

The matrix mutable data pointer.

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

Retrieves the mutable data buffer as a contiguous slice.

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.

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.

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

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

The matrix mutable data pointer.

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

Retrieves the mutable data buffer as a contiguous slice.

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.

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.

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

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

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

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

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

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

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