pub struct Const<const R: usize>;Trait Implementations§
source§impl<T: Scalar, const R: usize, const C: usize> Allocator<T, Const<R>, Const<C>> for DefaultAllocator
impl<T: Scalar, const R: usize, const C: usize> Allocator<T, Const<R>, Const<C>> for DefaultAllocator
§type Buffer = ArrayStorage<T, R, C>
type Buffer = ArrayStorage<T, R, C>
The type of buffer this allocator can instantiate.
§type BufferUninit = ArrayStorage<MaybeUninit<T>, R, C>
type BufferUninit = ArrayStorage<MaybeUninit<T>, R, C>
The type of buffer with uninitialized components this allocator can instantiate.
source§fn allocate_uninit(
_: Const<R>,
_: Const<C>
) -> ArrayStorage<MaybeUninit<T>, R, C>
fn allocate_uninit( _: Const<R>, _: Const<C> ) -> ArrayStorage<MaybeUninit<T>, R, C>
Allocates a buffer with the given number of rows and columns without initializing its content.
source§unsafe fn assume_init(
uninit: ArrayStorage<MaybeUninit<T>, R, C>
) -> ArrayStorage<T, R, C>
unsafe fn assume_init( uninit: ArrayStorage<MaybeUninit<T>, R, C> ) -> ArrayStorage<T, R, C>
Assumes a data buffer to be initialized. Read more
source§fn allocate_from_iterator<I: IntoIterator<Item = T>>(
nrows: Const<R>,
ncols: Const<C>,
iter: I
) -> Self::Buffer
fn allocate_from_iterator<I: IntoIterator<Item = T>>( nrows: Const<R>, ncols: Const<C>, iter: I ) -> Self::Buffer
Allocates a buffer initialized with the content of the given iterator.
source§fn allocate_from_row_iterator<I: IntoIterator<Item = T>>(
nrows: R,
ncols: C,
iter: I
) -> Self::Buffer
fn allocate_from_row_iterator<I: IntoIterator<Item = T>>( nrows: R, ncols: C, iter: I ) -> Self::Buffer
Allocates a buffer initialized with the content of the given row-major order iterator.
source§impl<'de, const D: usize> Deserialize<'de> for Const<D>
impl<'de, const D: usize> Deserialize<'de> for Const<D>
source§fn deserialize<Des>(deserializer: Des) -> Result<Self, Des::Error>where
Des: Deserializer<'de>,
fn deserialize<Des>(deserializer: Des) -> Result<Self, Des::Error>where
Des: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
source§impl<const T: usize> Dim for Const<T>
impl<const T: usize> Dim for Const<T>
source§fn try_to_usize() -> Option<usize>
fn try_to_usize() -> Option<usize>
Gets the compile-time value of
Self. Returns None if it is not known, i.e., if Self = Dyn.source§fn value(&self) -> usize
fn value(&self) -> usize
Gets the run-time value of
self. For type-level integers, this is the same as
Self::try_to_usize().unwrap().source§fn from_usize(dim: usize) -> Self
fn from_usize(dim: usize) -> Self
Builds an instance of
Self from a run-time value. Panics if Self is a type-level
integer and dim != Self::try_to_usize().unwrap().fn is<D: Dim>() -> bool
source§impl<const R: usize> PartialEq for Const<R>
impl<const R: usize> PartialEq for Const<R>
source§impl<T, const R: usize, const C: usize> RawStorage<T, Const<R>, Const<C>> for ArrayStorage<T, R, C>
impl<T, const R: usize, const C: usize> RawStorage<T, Const<R>, Const<C>> for ArrayStorage<T, R, C>
source§fn shape(&self) -> (Const<R>, Const<C>)
fn shape(&self) -> (Const<R>, Const<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.source§fn strides(&self) -> (Self::RStride, Self::CStride)
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
fn is_contiguous(&self) -> bool
Indicates whether this data buffer stores its elements contiguously. Read more
source§unsafe fn as_slice_unchecked(&self) -> &[T]
unsafe fn as_slice_unchecked(&self) -> &[T]
Retrieves the data buffer as a contiguous slice. Read more
source§fn linear_index(&self, irow: usize, icol: usize) -> usize
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§fn get_address_unchecked_linear(&self, i: usize) -> *const T
fn get_address_unchecked_linear(&self, i: usize) -> *const T
Gets the address of the i-th matrix component without performing bound-checking. Read more
source§fn get_address_unchecked(&self, irow: usize, icol: usize) -> *const T
fn get_address_unchecked(&self, irow: usize, icol: usize) -> *const T
Gets the address of the i-th matrix component without performing bound-checking. Read more
source§impl<T, const R: usize, const C: usize> RawStorageMut<T, Const<R>, Const<C>> for ArrayStorage<T, R, C>
impl<T, const R: usize, const C: usize> RawStorageMut<T, Const<R>, Const<C>> for ArrayStorage<T, R, C>
source§unsafe fn as_mut_slice_unchecked(&mut self) -> &mut [T]
unsafe fn as_mut_slice_unchecked(&mut self) -> &mut [T]
Retrieves the mutable data buffer as a contiguous slice. Read more
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
Gets the mutable address of the i-th matrix component without performing bound-checking. Read more
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
Gets the mutable address of the i-th matrix component without performing bound-checking. Read more
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
Retrieves a mutable reference to the i-th element without bound-checking. Read more
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
Retrieves a mutable reference to the element at
(irow, icol) without bound-checking. Read moresource§impl<T: Scalar, CTo, const RFROM: usize, const CFROM: usize> Reallocator<T, Const<RFROM>, Const<CFROM>, Dyn, CTo> for DefaultAllocatorwhere
CTo: Dim,
impl<T: Scalar, CTo, const RFROM: usize, const CFROM: usize> Reallocator<T, Const<RFROM>, Const<CFROM>, Dyn, CTo> for DefaultAllocatorwhere
CTo: Dim,
source§unsafe fn reallocate_copy(
rto: Dyn,
cto: CTo,
buf: ArrayStorage<T, RFROM, CFROM>
) -> VecStorage<MaybeUninit<T>, Dyn, CTo>
unsafe fn reallocate_copy( rto: Dyn, cto: CTo, buf: ArrayStorage<T, RFROM, CFROM> ) -> VecStorage<MaybeUninit<T>, Dyn, CTo>
Reallocates a buffer of shape
(RTo, CTo), possibly reusing a previously allocated buffer
buf. Data stored by buf are linearly copied to the output: Read moresource§impl<T: Scalar, RTo, const RFROM: usize, const CFROM: usize> Reallocator<T, Const<RFROM>, Const<CFROM>, RTo, Dyn> for DefaultAllocatorwhere
RTo: DimName,
impl<T: Scalar, RTo, const RFROM: usize, const CFROM: usize> Reallocator<T, Const<RFROM>, Const<CFROM>, RTo, Dyn> for DefaultAllocatorwhere
RTo: DimName,
source§unsafe fn reallocate_copy(
rto: RTo,
cto: Dyn,
buf: ArrayStorage<T, RFROM, CFROM>
) -> VecStorage<MaybeUninit<T>, RTo, Dyn>
unsafe fn reallocate_copy( rto: RTo, cto: Dyn, buf: ArrayStorage<T, RFROM, CFROM> ) -> VecStorage<MaybeUninit<T>, RTo, Dyn>
Reallocates a buffer of shape
(RTo, CTo), possibly reusing a previously allocated buffer
buf. Data stored by buf are linearly copied to the output: Read moresource§impl<T: Scalar, RFrom, CFrom, const RTO: usize, const CTO: usize> Reallocator<T, RFrom, CFrom, Const<RTO>, Const<CTO>> for DefaultAllocator
impl<T: Scalar, RFrom, CFrom, const RTO: usize, const CTO: usize> Reallocator<T, RFrom, CFrom, Const<RTO>, Const<CTO>> for DefaultAllocator
source§unsafe fn reallocate_copy(
rto: Const<RTO>,
cto: Const<CTO>,
buf: <Self as Allocator<T, RFrom, CFrom>>::Buffer
) -> ArrayStorage<MaybeUninit<T>, RTO, CTO>
unsafe fn reallocate_copy( rto: Const<RTO>, cto: Const<CTO>, buf: <Self as Allocator<T, RFrom, CFrom>>::Buffer ) -> ArrayStorage<MaybeUninit<T>, RTO, CTO>
Reallocates a buffer of shape
(RTo, CTo), possibly reusing a previously allocated buffer
buf. Data stored by buf are linearly copied to the output: Read moresource§impl<T, const R1: usize, const C1: usize, const R2: usize, const C2: usize> ReshapableStorage<T, Const<R1>, Const<C1>, Const<R2>, Const<C2>> for ArrayStorage<T, R1, C1>where
T: Scalar,
Const<R1>: ToTypenum,
Const<C1>: ToTypenum,
Const<R2>: ToTypenum,
Const<C2>: ToTypenum,
<Const<R1> as ToTypenum>::Typenum: Mul<<Const<C1> as ToTypenum>::Typenum>,
<Const<R2> as ToTypenum>::Typenum: Mul<<Const<C2> as ToTypenum>::Typenum, Output = Prod<<Const<R1> as ToTypenum>::Typenum, <Const<C1> as ToTypenum>::Typenum>>,
impl<T, const R1: usize, const C1: usize, const R2: usize, const C2: usize> ReshapableStorage<T, Const<R1>, Const<C1>, Const<R2>, Const<C2>> for ArrayStorage<T, R1, C1>where
T: Scalar,
Const<R1>: ToTypenum,
Const<C1>: ToTypenum,
Const<R2>: ToTypenum,
Const<C2>: ToTypenum,
<Const<R1> as ToTypenum>::Typenum: Mul<<Const<C1> as ToTypenum>::Typenum>,
<Const<R2> as ToTypenum>::Typenum: Mul<<Const<C2> as ToTypenum>::Typenum, Output = Prod<<Const<R1> as ToTypenum>::Typenum, <Const<C1> as ToTypenum>::Typenum>>,
§type Output = ArrayStorage<T, R2, C2>
type Output = ArrayStorage<T, R2, C2>
The reshaped storage type.
source§impl<T: Scalar, const R: usize, const C: usize> Storage<T, Const<R>, Const<C>> for ArrayStorage<T, R, C>
impl<T: Scalar, const R: usize, const C: usize> Storage<T, Const<R>, Const<C>> for ArrayStorage<T, R, C>
impl<const R: usize> Copy for Const<R>
impl<const R: usize> Eq for Const<R>
impl<const R: usize> StructuralPartialEq for Const<R>
Auto Trait Implementations§
impl<const R: usize> Freeze for Const<R>
impl<const R: usize> RefUnwindSafe for Const<R>
impl<const R: usize> Send for Const<R>
impl<const R: usize> Sync for Const<R>
impl<const R: usize> Unpin for Const<R>
impl<const R: usize> UnwindSafe for Const<R>
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
Mutably borrows from an owned value. Read more
source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moresource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.