#[repr(C)]pub struct VecStorage<T, R, C>{ /* private fields */ }
Expand description
A Vec-based matrix data storage. It may be dynamically-sized.
Implementations§
source§impl<T, R, C> VecStorage<T, R, C>
impl<T, R, C> VecStorage<T, R, C>
sourcepub fn new(nrows: R, ncols: C, data: Vec<T>) -> VecStorage<T, R, C>
pub fn new(nrows: R, ncols: C, data: Vec<T>) -> VecStorage<T, R, C>
Creates a new dynamic matrix data storage from the given vector and shape.
sourcepub unsafe fn as_vec_mut(&mut self) -> &mut Vec<T>
pub unsafe fn as_vec_mut(&mut self) -> &mut Vec<T>
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.
sourcepub unsafe fn resize(self, sz: usize) -> Vec<MaybeUninit<T>>
pub unsafe fn resize(self, sz: usize) -> Vec<MaybeUninit<T>>
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.
sourcepub fn as_slice(&self) -> &[T]
pub fn as_slice(&self) -> &[T]
A slice containing all the components stored in this storage in column-major order.
sourcepub fn as_mut_slice(&mut self) -> &mut [T]
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§
source§impl<T, R, C> Clone for VecStorage<T, R, C>
impl<T, R, C> Clone for VecStorage<T, R, C>
source§fn clone(&self) -> VecStorage<T, R, C>
fn clone(&self) -> VecStorage<T, R, C>
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read moresource§impl<T, R, C> Debug for VecStorage<T, R, C>
impl<T, R, C> Debug for VecStorage<T, R, C>
source§impl<T, R, C> Default for VecStorage<T, R, C>
impl<T, R, C> Default for VecStorage<T, R, C>
source§fn default() -> VecStorage<T, R, C>
fn default() -> VecStorage<T, R, C>
source§impl<'a, T, R, C> Deserialize<'a> for VecStorage<T, R, C>
impl<'a, T, R, C> Deserialize<'a> for VecStorage<T, R, C>
source§fn deserialize<Des>(
deserializer: Des,
) -> Result<VecStorage<T, R, C>, <Des as Deserializer<'a>>::Error>where
Des: Deserializer<'a>,
fn deserialize<Des>(
deserializer: Des,
) -> Result<VecStorage<T, R, C>, <Des as Deserializer<'a>>::Error>where
Des: Deserializer<'a>,
source§impl<'a, T, R> Extend<&'a T> for VecStorage<T, R, Dyn>
impl<'a, T, R> Extend<&'a T> for VecStorage<T, R, Dyn>
source§fn extend<I>(&mut self, iter: I)where
I: IntoIterator<Item = &'a T>,
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
.
source§fn extend_one(&mut self, item: A)
fn extend_one(&mut self, item: A)
extend_one
)source§fn extend_reserve(&mut self, additional: usize)
fn extend_reserve(&mut self, additional: usize)
extend_one
)source§impl<T, R, RV, SV> Extend<Matrix<T, RV, Const<1>, SV>> for VecStorage<T, R, Dyn>
impl<T, R, RV, SV> Extend<Matrix<T, RV, Const<1>, SV>> for VecStorage<T, R, Dyn>
source§fn extend<I>(&mut self, iter: I)
fn extend<I>(&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)
fn extend_one(&mut self, item: A)
extend_one
)source§fn extend_reserve(&mut self, additional: usize)
fn extend_reserve(&mut self, additional: usize)
extend_one
)source§impl<T> Extend<T> for VecStorage<T, Dyn, Const<1>>
impl<T> Extend<T> for VecStorage<T, Dyn, Const<1>>
source§fn extend<I>(&mut self, iter: I)where
I: IntoIterator<Item = T>,
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.
source§fn extend_one(&mut self, item: A)
fn extend_one(&mut self, item: A)
extend_one
)source§fn extend_reserve(&mut self, additional: usize)
fn extend_reserve(&mut self, additional: usize)
extend_one
)source§impl<T, R> Extend<T> for VecStorage<T, R, Dyn>where
R: Dim,
impl<T, R> Extend<T> for VecStorage<T, R, Dyn>where
R: Dim,
source§fn extend<I>(&mut self, iter: I)where
I: IntoIterator<Item = T>,
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
.
source§fn extend_one(&mut self, item: A)
fn extend_one(&mut self, item: A)
extend_one
)source§fn extend_reserve(&mut self, additional: usize)
fn extend_reserve(&mut self, additional: usize)
extend_one
)source§impl<T, R, C> From<VecStorage<T, R, C>> for Vec<T>
impl<T, R, C> From<VecStorage<T, R, C>> for Vec<T>
source§fn from(vec: VecStorage<T, R, C>) -> Vec<T>
fn from(vec: VecStorage<T, R, C>) -> Vec<T>
source§impl<T, R, C> PartialEq for VecStorage<T, R, C>
impl<T, R, C> PartialEq for VecStorage<T, R, C>
source§impl<T, C> RawStorage<T, Dyn, C> for VecStorage<T, Dyn, C>where
C: Dim,
impl<T, C> RawStorage<T, Dyn, C> for VecStorage<T, Dyn, C>where
C: Dim,
source§fn shape(&self) -> (Dyn, C)
fn shape(&self) -> (Dyn, C)
Self::dimension()
if it is not None
.source§fn strides(
&self,
) -> (<VecStorage<T, Dyn, C> as RawStorage<T, Dyn, C>>::RStride, <VecStorage<T, Dyn, C> as RawStorage<T, Dyn, C>>::CStride)
fn strides( &self, ) -> (<VecStorage<T, Dyn, C> as RawStorage<T, Dyn, C>>::RStride, <VecStorage<T, Dyn, C> as RawStorage<T, Dyn, C>>::CStride)
source§fn is_contiguous(&self) -> bool
fn is_contiguous(&self) -> bool
source§unsafe fn as_slice_unchecked(&self) -> &[T]
unsafe fn as_slice_unchecked(&self) -> &[T]
source§fn linear_index(&self, irow: usize, icol: usize) -> usize
fn linear_index(&self, irow: usize, icol: usize) -> usize
source§fn get_address_unchecked_linear(&self, i: usize) -> *const T
fn get_address_unchecked_linear(&self, i: usize) -> *const T
source§fn get_address_unchecked(&self, irow: usize, icol: usize) -> *const T
fn get_address_unchecked(&self, irow: usize, icol: usize) -> *const T
source§impl<T, R> RawStorage<T, R, Dyn> for VecStorage<T, R, Dyn>where
R: DimName,
impl<T, R> RawStorage<T, R, Dyn> for VecStorage<T, R, Dyn>where
R: DimName,
source§fn shape(&self) -> (R, Dyn)
fn shape(&self) -> (R, Dyn)
Self::dimension()
if it is not None
.source§fn strides(
&self,
) -> (<VecStorage<T, R, Dyn> as RawStorage<T, R, Dyn>>::RStride, <VecStorage<T, R, Dyn> as RawStorage<T, R, Dyn>>::CStride)
fn strides( &self, ) -> (<VecStorage<T, R, Dyn> as RawStorage<T, R, Dyn>>::RStride, <VecStorage<T, R, Dyn> as RawStorage<T, R, Dyn>>::CStride)
source§fn is_contiguous(&self) -> bool
fn is_contiguous(&self) -> bool
source§unsafe fn as_slice_unchecked(&self) -> &[T]
unsafe fn as_slice_unchecked(&self) -> &[T]
source§fn linear_index(&self, irow: usize, icol: usize) -> usize
fn linear_index(&self, irow: usize, icol: usize) -> usize
source§fn get_address_unchecked_linear(&self, i: usize) -> *const T
fn get_address_unchecked_linear(&self, i: usize) -> *const T
source§fn get_address_unchecked(&self, irow: usize, icol: usize) -> *const T
fn get_address_unchecked(&self, irow: usize, icol: usize) -> *const T
source§impl<T, C> RawStorageMut<T, Dyn, C> for VecStorage<T, Dyn, C>where
C: Dim,
impl<T, C> RawStorageMut<T, Dyn, C> for VecStorage<T, Dyn, C>where
C: Dim,
source§unsafe fn as_mut_slice_unchecked(&mut self) -> &mut [T]
unsafe fn as_mut_slice_unchecked(&mut self) -> &mut [T]
source§fn get_address_unchecked_linear_mut(&mut self, i: usize) -> *mut T
fn get_address_unchecked_linear_mut(&mut self, i: usize) -> *mut T
source§fn get_address_unchecked_mut(&mut self, irow: usize, icol: usize) -> *mut T
fn get_address_unchecked_mut(&mut self, irow: usize, icol: usize) -> *mut T
source§unsafe fn get_unchecked_linear_mut(&mut self, i: usize) -> &mut T
unsafe fn get_unchecked_linear_mut(&mut self, i: usize) -> &mut T
source§unsafe fn get_unchecked_mut(&mut self, irow: usize, icol: usize) -> &mut T
unsafe fn get_unchecked_mut(&mut self, irow: usize, icol: usize) -> &mut T
(irow, icol)
without bound-checking. Read moresource§impl<T, R> RawStorageMut<T, R, Dyn> for VecStorage<T, R, Dyn>where
R: DimName,
impl<T, R> RawStorageMut<T, R, Dyn> for VecStorage<T, R, Dyn>where
R: DimName,
source§unsafe fn as_mut_slice_unchecked(&mut self) -> &mut [T]
unsafe fn as_mut_slice_unchecked(&mut self) -> &mut [T]
source§fn get_address_unchecked_linear_mut(&mut self, i: usize) -> *mut T
fn get_address_unchecked_linear_mut(&mut self, i: usize) -> *mut T
source§fn get_address_unchecked_mut(&mut self, irow: usize, icol: usize) -> *mut T
fn get_address_unchecked_mut(&mut self, irow: usize, icol: usize) -> *mut T
source§unsafe fn get_unchecked_linear_mut(&mut self, i: usize) -> &mut T
unsafe fn get_unchecked_linear_mut(&mut self, i: usize) -> &mut T
source§unsafe fn get_unchecked_mut(&mut self, irow: usize, icol: usize) -> &mut T
unsafe fn get_unchecked_mut(&mut self, irow: usize, icol: usize) -> &mut T
(irow, icol)
without bound-checking. Read moresource§impl<T, C1, C2> ReshapableStorage<T, Dyn, C1, Dyn, C2> for VecStorage<T, Dyn, C1>
impl<T, C1, C2> ReshapableStorage<T, Dyn, C1, Dyn, C2> for VecStorage<T, Dyn, C1>
source§type Output = VecStorage<T, Dyn, C2>
type Output = VecStorage<T, Dyn, C2>
source§fn reshape_generic(
self,
nrows: Dyn,
ncols: C2,
) -> <VecStorage<T, Dyn, C1> as ReshapableStorage<T, Dyn, C1, Dyn, C2>>::Output
fn reshape_generic( self, nrows: Dyn, ncols: C2, ) -> <VecStorage<T, Dyn, C1> as ReshapableStorage<T, Dyn, C1, Dyn, C2>>::Output
source§impl<T, C1, R2> ReshapableStorage<T, Dyn, C1, R2, Dyn> for VecStorage<T, Dyn, C1>
impl<T, C1, R2> ReshapableStorage<T, Dyn, C1, R2, Dyn> for VecStorage<T, Dyn, C1>
source§type Output = VecStorage<T, R2, Dyn>
type Output = VecStorage<T, R2, Dyn>
source§fn reshape_generic(
self,
nrows: R2,
ncols: Dyn,
) -> <VecStorage<T, Dyn, C1> as ReshapableStorage<T, Dyn, C1, R2, Dyn>>::Output
fn reshape_generic( self, nrows: R2, ncols: Dyn, ) -> <VecStorage<T, Dyn, C1> as ReshapableStorage<T, Dyn, C1, R2, Dyn>>::Output
source§impl<T, R1, C2> ReshapableStorage<T, R1, Dyn, Dyn, C2> for VecStorage<T, R1, Dyn>
impl<T, R1, C2> ReshapableStorage<T, R1, Dyn, Dyn, C2> for VecStorage<T, R1, Dyn>
source§type Output = VecStorage<T, Dyn, C2>
type Output = VecStorage<T, Dyn, C2>
source§fn reshape_generic(
self,
nrows: Dyn,
ncols: C2,
) -> <VecStorage<T, R1, Dyn> as ReshapableStorage<T, R1, Dyn, Dyn, C2>>::Output
fn reshape_generic( self, nrows: Dyn, ncols: C2, ) -> <VecStorage<T, R1, Dyn> as ReshapableStorage<T, R1, Dyn, Dyn, C2>>::Output
source§impl<T, R1, R2> ReshapableStorage<T, R1, Dyn, R2, Dyn> for VecStorage<T, R1, Dyn>
impl<T, R1, R2> ReshapableStorage<T, R1, Dyn, R2, Dyn> for VecStorage<T, R1, Dyn>
source§type Output = VecStorage<T, R2, Dyn>
type Output = VecStorage<T, R2, Dyn>
source§fn reshape_generic(
self,
nrows: R2,
ncols: Dyn,
) -> <VecStorage<T, R1, Dyn> as ReshapableStorage<T, R1, Dyn, R2, Dyn>>::Output
fn reshape_generic( self, nrows: R2, ncols: Dyn, ) -> <VecStorage<T, R1, Dyn> as ReshapableStorage<T, R1, Dyn, R2, Dyn>>::Output
source§impl<T, R, C> Serialize for VecStorage<T, R, C>
impl<T, R, C> Serialize for VecStorage<T, R, C>
source§fn serialize<Ser>(
&self,
serializer: Ser,
) -> Result<<Ser as Serializer>::Ok, <Ser as Serializer>::Error>where
Ser: Serializer,
fn serialize<Ser>(
&self,
serializer: Ser,
) -> Result<<Ser as Serializer>::Ok, <Ser as Serializer>::Error>where
Ser: Serializer,
source§impl<T, C> Storage<T, Dyn, C> for VecStorage<T, Dyn, C>
impl<T, C> Storage<T, Dyn, C> for VecStorage<T, Dyn, C>
source§fn into_owned(self) -> <DefaultAllocator as Allocator<Dyn, C>>::Buffer<T>
fn into_owned(self) -> <DefaultAllocator as Allocator<Dyn, C>>::Buffer<T>
source§fn clone_owned(&self) -> <DefaultAllocator as Allocator<Dyn, C>>::Buffer<T>
fn clone_owned(&self) -> <DefaultAllocator as Allocator<Dyn, C>>::Buffer<T>
source§fn forget_elements(self)
fn forget_elements(self)
source§impl<T, R> Storage<T, R, Dyn> for VecStorage<T, R, Dyn>where
T: Scalar,
R: DimName,
DefaultAllocator: Allocator<R, Dyn, Buffer<T> = VecStorage<T, R, Dyn>>,
impl<T, R> Storage<T, R, Dyn> for VecStorage<T, R, Dyn>where
T: Scalar,
R: DimName,
DefaultAllocator: Allocator<R, Dyn, Buffer<T> = VecStorage<T, R, Dyn>>,
source§fn into_owned(self) -> <DefaultAllocator as Allocator<R, Dyn>>::Buffer<T>
fn into_owned(self) -> <DefaultAllocator as Allocator<R, Dyn>>::Buffer<T>
source§fn clone_owned(&self) -> <DefaultAllocator as Allocator<R, Dyn>>::Buffer<T>
fn clone_owned(&self) -> <DefaultAllocator as Allocator<R, Dyn>>::Buffer<T>
source§fn forget_elements(self)
fn forget_elements(self)
impl<T, R, C> Eq for VecStorage<T, R, C>
impl<T, R, C> IsContiguous for VecStorage<T, R, C>
impl<T, R, C> StructuralPartialEq for VecStorage<T, R, C>
Auto Trait Implementations§
impl<T, R, C> Freeze for VecStorage<T, R, C>
impl<T, R, C> RefUnwindSafe for VecStorage<T, R, C>
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>
impl<T, R, C> UnwindSafe for VecStorage<T, R, C>
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
source§unsafe fn clone_to_uninit(&self, dst: *mut T)
unsafe fn clone_to_uninit(&self, dst: *mut T)
clone_to_uninit
)§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key
and return true
if they are equal.§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
source§impl<T> FromDhall for Twhere
T: DeserializeOwned,
impl<T> FromDhall for Twhere
T: DeserializeOwned,
fn from_dhall(v: &Value) -> Result<T, Error>
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
source§impl<T> IntoEither for T
impl<T> IntoEither for T
source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
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 moresource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
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
impl<T> Pointable for T
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
self
from the equivalent element of its
superset. Read more§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
self
is actually part of its subset T
(and can be converted to it).§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
self.to_subset
but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
self
to the equivalent element of its superset.