Struct nalgebra::base::VecStorage [−][src]
Expand description
A Vec-based matrix data storage. It may be dynamically-sized.
Implementations
Creates a new dynamic matrix data storage from the given vector and shape.
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.
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.
A slice containing all the components stored in this storage in column-major order.
Trait Implementations
impl<'a, T, R: Dim, C: Dim> Deserialize<'a> for VecStorage<T, R, C> where
T: Deserialize<'a>,
R: Deserialize<'a>,
C: Deserialize<'a>,
impl<'a, T, R: Dim, C: Dim> Deserialize<'a> for VecStorage<T, R, C> where
T: Deserialize<'a>,
R: Deserialize<'a>,
C: Deserialize<'a>,
fn deserialize<Des>(deserializer: Des) -> Result<Self, Des::Error> where
Des: Deserializer<'a>,
fn deserialize<Des>(deserializer: Des) -> Result<Self, Des::Error> where
Des: Deserializer<'a>,
Deserialize this value from the given Serde deserializer. Read more
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
.
extend_one
)Extends a collection with exactly one element.
extend_one
)Reserves capacity in a collection for the given number of additional elements. Read more
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: RawStorage<T, RV>,
ShapeConstraint: SameNumberOfRows<R, RV>,
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: RawStorage<T, RV>,
ShapeConstraint: SameNumberOfRows<R, RV>,
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
.
extend_one
)Extends a collection with exactly one element.
extend_one
)Reserves capacity in a collection for the given number of additional elements. Read more
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
.
extend_one
)Extends a collection with exactly one element.
extend_one
)Reserves capacity in a collection for the given number of additional elements. Read more
Extends the number of rows of the VecStorage
with elements
from the given iterator.
extend_one
)Extends a collection with exactly one element.
extend_one
)Reserves capacity in a collection for the given number of additional elements. Read more
Performs the conversion.
impl<T: PartialEq, R: PartialEq + Dim, C: PartialEq + Dim> PartialEq<VecStorage<T, R, C>> for VecStorage<T, R, C>
impl<T: PartialEq, R: PartialEq + Dim, C: PartialEq + Dim> PartialEq<VecStorage<T, R, C>> for VecStorage<T, R, C>
This method tests for self
and other
values to be equal, and is used
by ==
. Read more
This method tests for !=
.
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
The spacing between consecutive row elements and consecutive column elements. Read more
Indicates whether this data buffer stores its elements contiguously. Read more
Retrieves the data buffer as a contiguous slice. Read more
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
Gets the address of the i-th matrix component without performing bound-checking. Read more
Gets the address of the i-th matrix component without performing bound-checking. Read more
Retrieves a reference to the i-th element without bound-checking. Read more
type CStride = R
type CStride = R
The static stride of this storage’s columns.
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
The spacing between consecutive row elements and consecutive column elements. Read more
Indicates whether this data buffer stores its elements contiguously. Read more
Retrieves the data buffer as a contiguous slice. Read more
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
Gets the address of the i-th matrix component without performing bound-checking. Read more
Gets the address of the i-th matrix component without performing bound-checking. Read more
Retrieves a reference to the i-th element without bound-checking. Read more
Retrieves the mutable data buffer as a contiguous slice. Read more
Gets the mutable address of the i-th matrix component without performing bound-checking. Read more
Gets the mutable address of the i-th matrix component without performing bound-checking. Read more
Retrieves a mutable reference to the i-th element without bound-checking. Read more
Retrieves a mutable reference to the element at (irow, icol)
without bound-checking. Read more
Swaps two elements using their linear index without bound-checking. Read more
Retrieves the mutable data buffer as a contiguous slice. Read more
Gets the mutable address of the i-th matrix component without performing bound-checking. Read more
Gets the mutable address of the i-th matrix component without performing bound-checking. Read more
Retrieves a mutable reference to the i-th element without bound-checking. Read more
Retrieves a mutable reference to the element at (irow, icol)
without bound-checking. Read more
Swaps two elements using their linear index without bound-checking. Read more
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, 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>
type Output = VecStorage<T, Dynamic, C2>
The reshaped storage type.
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,
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>
type Output = VecStorage<T, R2, Dynamic>
The reshaped storage type.
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,
R1: DimName,
C2: Dim,
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>
type Output = VecStorage<T, Dynamic, C2>
The reshaped storage type.
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,
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>
type Output = VecStorage<T, R2, Dynamic>
The reshaped storage type.
Reshapes the storage into the output storage type.
impl<T: Scalar, C: Dim> Storage<T, Dynamic, C> for VecStorage<T, Dynamic, C> where
DefaultAllocator: Allocator<T, Dynamic, C, Buffer = Self>,
impl<T: Scalar, C: Dim> Storage<T, Dynamic, C> for VecStorage<T, Dynamic, C> where
DefaultAllocator: Allocator<T, Dynamic, C, Buffer = Self>,
Builds a matrix data storage that does not contain any reference.
fn clone_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>,
Clones this data storage to one that does not contain any reference.
impl<T: Scalar, R: DimName> Storage<T, R, Dynamic> for VecStorage<T, R, Dynamic> where
DefaultAllocator: Allocator<T, R, Dynamic, Buffer = Self>,
impl<T: Scalar, R: DimName> Storage<T, R, Dynamic> for VecStorage<T, R, Dynamic> where
DefaultAllocator: Allocator<T, R, Dynamic, Buffer = Self>,
Builds a matrix data storage that does not contain any reference.
fn clone_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>,
Clones this data storage to one that does not contain any reference.
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
Mutably borrows from an owned value. Read more
The inverse inclusion map: attempts to construct self
from the equivalent element of its
superset. Read more
Checks if self
is actually part of its subset T
(and can be converted to it).
Use with care! Same as self.to_subset
but without any property checks. Always succeeds.
The inclusion map: converts self
to the equivalent element of its superset.