pub struct Const<const R: usize>;
Trait Implementations§
source§impl<const R: usize, const C: usize> Allocator<Const<R>, Const<C>> for DefaultAllocator
impl<const R: usize, const C: usize> Allocator<Const<R>, Const<C>> for DefaultAllocator
§type Buffer<T: Scalar> = ArrayStorage<T, R, C>
type Buffer<T: Scalar> = ArrayStorage<T, R, C>
The type of buffer this allocator can instantiate.
§type BufferUninit<T: Scalar> = ArrayStorage<MaybeUninit<T>, R, C>
type BufferUninit<T: Scalar> = ArrayStorage<MaybeUninit<T>, R, C>
The type of buffer with uninitialized components this allocator can instantiate.
source§fn allocate_uninit<T>(
_: Const<R>,
_: Const<C>,
) -> ArrayStorage<MaybeUninit<T>, R, C>where
T: Scalar,
fn allocate_uninit<T>(
_: Const<R>,
_: Const<C>,
) -> ArrayStorage<MaybeUninit<T>, R, C>where
T: Scalar,
Allocates a buffer with the given number of rows and columns without initializing its content.
source§unsafe fn assume_init<T>(
uninit: ArrayStorage<MaybeUninit<T>, R, C>,
) -> ArrayStorage<T, R, C>where
T: Scalar,
unsafe fn assume_init<T>(
uninit: ArrayStorage<MaybeUninit<T>, R, C>,
) -> ArrayStorage<T, R, C>where
T: Scalar,
Assumes a data buffer to be initialized. Read more
source§fn allocate_from_iterator<T, I>(
nrows: Const<R>,
ncols: Const<C>,
iter: I,
) -> <DefaultAllocator as Allocator<Const<R>, Const<C>>>::Buffer<T>where
T: Scalar,
I: IntoIterator<Item = T>,
fn allocate_from_iterator<T, I>(
nrows: Const<R>,
ncols: Const<C>,
iter: I,
) -> <DefaultAllocator as Allocator<Const<R>, Const<C>>>::Buffer<T>where
T: Scalar,
I: IntoIterator<Item = T>,
Allocates a buffer initialized with the content of the given iterator.
source§fn allocate_from_row_iterator<T, I>(
nrows: R,
ncols: C,
iter: I,
) -> Self::Buffer<T>where
T: Scalar,
I: IntoIterator<Item = T>,
fn allocate_from_row_iterator<T, I>(
nrows: R,
ncols: C,
iter: I,
) -> Self::Buffer<T>where
T: Scalar,
I: IntoIterator<Item = T>,
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<Const<D>, <Des as Deserializer<'de>>::Error>where
Des: Deserializer<'de>,
fn deserialize<Des>(
deserializer: Des,
) -> Result<Const<D>, <Des as Deserializer<'de>>::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) -> Const<T>
fn from_usize(dim: usize) -> Const<T>
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>() -> boolwhere
D: Dim,
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,
) -> (<ArrayStorage<T, R, C> as RawStorage<T, Const<R>, Const<C>>>::RStride, <ArrayStorage<T, R, C> as RawStorage<T, Const<R>, Const<C>>>::CStride)
fn strides( &self, ) -> (<ArrayStorage<T, R, C> as RawStorage<T, Const<R>, Const<C>>>::RStride, <ArrayStorage<T, R, C> as RawStorage<T, Const<R>, Const<C>>>::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, CTo, const RFROM: usize, const CFROM: usize> Reallocator<T, Const<RFROM>, Const<CFROM>, Dyn, CTo> for DefaultAllocator
impl<T, CTo, const RFROM: usize, const CFROM: usize> Reallocator<T, Const<RFROM>, Const<CFROM>, Dyn, CTo> for DefaultAllocator
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, RTo, const RFROM: usize, const CFROM: usize> Reallocator<T, Const<RFROM>, Const<CFROM>, RTo, Dyn> for DefaultAllocator
impl<T, RTo, const RFROM: usize, const CFROM: usize> Reallocator<T, Const<RFROM>, Const<CFROM>, RTo, Dyn> for DefaultAllocator
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, RFrom, CFrom, const RTO: usize, const CTO: usize> Reallocator<T, RFrom, CFrom, Const<RTO>, Const<CTO>> for DefaultAllocator
impl<T, 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: <DefaultAllocator as Allocator<RFrom, CFrom>>::Buffer<T>,
) -> ArrayStorage<MaybeUninit<T>, RTO, CTO>
unsafe fn reallocate_copy( rto: Const<RTO>, cto: Const<CTO>, buf: <DefaultAllocator as Allocator<RFrom, CFrom>>::Buffer<T>, ) -> 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 = <<Const<R1> as ToTypenum>::Typenum as Mul<<Const<C1> as ToTypenum>::Typenum>>::Output>,
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 = <<Const<R1> as ToTypenum>::Typenum as Mul<<Const<C1> as ToTypenum>::Typenum>>::Output>,
§type Output = ArrayStorage<T, R2, C2>
type Output = ArrayStorage<T, R2, C2>
The reshaped storage type.
source§fn reshape_generic(
self,
_: Const<R2>,
_: Const<C2>,
) -> <ArrayStorage<T, R1, C1> as ReshapableStorage<T, Const<R1>, Const<C1>, Const<R2>, Const<C2>>>::Output
fn reshape_generic( self, _: Const<R2>, _: Const<C2>, ) -> <ArrayStorage<T, R1, C1> as ReshapableStorage<T, Const<R1>, Const<C1>, Const<R2>, Const<C2>>>::Output
Reshapes the storage into the output storage type.
source§impl<const D: usize> Serialize for Const<D>
impl<const D: usize> Serialize for Const<D>
source§fn serialize<S>(
&self,
serializer: S,
) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>where
S: Serializer,
fn serialize<S>(
&self,
serializer: S,
) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>where
S: Serializer,
Serialize this value into the given Serde serializer. Read more
source§impl<T, const R: usize, const C: usize> Storage<T, Const<R>, Const<C>> for ArrayStorage<T, R, C>where
T: Scalar,
DefaultAllocator: Allocator<Const<R>, Const<C>, Buffer<T> = ArrayStorage<T, R, C>>,
impl<T, const R: usize, const C: usize> Storage<T, Const<R>, Const<C>> for ArrayStorage<T, R, C>where
T: Scalar,
DefaultAllocator: Allocator<Const<R>, Const<C>, Buffer<T> = ArrayStorage<T, R, C>>,
source§fn into_owned(
self,
) -> <DefaultAllocator as Allocator<Const<R>, Const<C>>>::Buffer<T>
fn into_owned( self, ) -> <DefaultAllocator as Allocator<Const<R>, Const<C>>>::Buffer<T>
Builds a matrix data storage that does not contain any reference.
source§fn clone_owned(
&self,
) -> <DefaultAllocator as Allocator<Const<R>, Const<C>>>::Buffer<T>
fn clone_owned( &self, ) -> <DefaultAllocator as Allocator<Const<R>, Const<C>>>::Buffer<T>
Clones this data storage to one that does not contain any reference.
source§fn forget_elements(self)
fn forget_elements(self)
Drops the storage without calling the destructors on the contained elements.
impl<const R: usize> Copy for Const<R>
impl<const R: usize> Eq for Const<R>
impl IsNotStaticOne for Const<0>
impl IsNotStaticOne for Const<10>
impl IsNotStaticOne for Const<100>
impl IsNotStaticOne for Const<101>
impl IsNotStaticOne for Const<102>
impl IsNotStaticOne for Const<103>
impl IsNotStaticOne for Const<104>
impl IsNotStaticOne for Const<105>
impl IsNotStaticOne for Const<106>
impl IsNotStaticOne for Const<107>
impl IsNotStaticOne for Const<108>
impl IsNotStaticOne for Const<109>
impl IsNotStaticOne for Const<11>
impl IsNotStaticOne for Const<110>
impl IsNotStaticOne for Const<111>
impl IsNotStaticOne for Const<112>
impl IsNotStaticOne for Const<113>
impl IsNotStaticOne for Const<114>
impl IsNotStaticOne for Const<115>
impl IsNotStaticOne for Const<116>
impl IsNotStaticOne for Const<117>
impl IsNotStaticOne for Const<118>
impl IsNotStaticOne for Const<119>
impl IsNotStaticOne for Const<12>
impl IsNotStaticOne for Const<120>
impl IsNotStaticOne for Const<121>
impl IsNotStaticOne for Const<122>
impl IsNotStaticOne for Const<123>
impl IsNotStaticOne for Const<124>
impl IsNotStaticOne for Const<125>
impl IsNotStaticOne for Const<126>
impl IsNotStaticOne for Const<127>
impl IsNotStaticOne for Const<13>
impl IsNotStaticOne for Const<14>
impl IsNotStaticOne for Const<15>
impl IsNotStaticOne for Const<16>
impl IsNotStaticOne for Const<17>
impl IsNotStaticOne for Const<18>
impl IsNotStaticOne for Const<19>
impl IsNotStaticOne for Const<2>
impl IsNotStaticOne for Const<20>
impl IsNotStaticOne for Const<21>
impl IsNotStaticOne for Const<22>
impl IsNotStaticOne for Const<23>
impl IsNotStaticOne for Const<24>
impl IsNotStaticOne for Const<25>
impl IsNotStaticOne for Const<26>
impl IsNotStaticOne for Const<27>
impl IsNotStaticOne for Const<28>
impl IsNotStaticOne for Const<29>
impl IsNotStaticOne for Const<3>
impl IsNotStaticOne for Const<30>
impl IsNotStaticOne for Const<31>
impl IsNotStaticOne for Const<32>
impl IsNotStaticOne for Const<33>
impl IsNotStaticOne for Const<34>
impl IsNotStaticOne for Const<35>
impl IsNotStaticOne for Const<36>
impl IsNotStaticOne for Const<37>
impl IsNotStaticOne for Const<38>
impl IsNotStaticOne for Const<39>
impl IsNotStaticOne for Const<4>
impl IsNotStaticOne for Const<40>
impl IsNotStaticOne for Const<41>
impl IsNotStaticOne for Const<42>
impl IsNotStaticOne for Const<43>
impl IsNotStaticOne for Const<44>
impl IsNotStaticOne for Const<45>
impl IsNotStaticOne for Const<46>
impl IsNotStaticOne for Const<47>
impl IsNotStaticOne for Const<48>
impl IsNotStaticOne for Const<49>
impl IsNotStaticOne for Const<5>
impl IsNotStaticOne for Const<50>
impl IsNotStaticOne for Const<51>
impl IsNotStaticOne for Const<52>
impl IsNotStaticOne for Const<53>
impl IsNotStaticOne for Const<54>
impl IsNotStaticOne for Const<55>
impl IsNotStaticOne for Const<56>
impl IsNotStaticOne for Const<57>
impl IsNotStaticOne for Const<58>
impl IsNotStaticOne for Const<59>
impl IsNotStaticOne for Const<6>
impl IsNotStaticOne for Const<60>
impl IsNotStaticOne for Const<61>
impl IsNotStaticOne for Const<62>
impl IsNotStaticOne for Const<63>
impl IsNotStaticOne for Const<64>
impl IsNotStaticOne for Const<65>
impl IsNotStaticOne for Const<66>
impl IsNotStaticOne for Const<67>
impl IsNotStaticOne for Const<68>
impl IsNotStaticOne for Const<69>
impl IsNotStaticOne for Const<7>
impl IsNotStaticOne for Const<70>
impl IsNotStaticOne for Const<71>
impl IsNotStaticOne for Const<72>
impl IsNotStaticOne for Const<73>
impl IsNotStaticOne for Const<74>
impl IsNotStaticOne for Const<75>
impl IsNotStaticOne for Const<76>
impl IsNotStaticOne for Const<77>
impl IsNotStaticOne for Const<78>
impl IsNotStaticOne for Const<79>
impl IsNotStaticOne for Const<8>
impl IsNotStaticOne for Const<80>
impl IsNotStaticOne for Const<81>
impl IsNotStaticOne for Const<82>
impl IsNotStaticOne for Const<83>
impl IsNotStaticOne for Const<84>
impl IsNotStaticOne for Const<85>
impl IsNotStaticOne for Const<86>
impl IsNotStaticOne for Const<87>
impl IsNotStaticOne for Const<88>
impl IsNotStaticOne for Const<89>
impl IsNotStaticOne for Const<9>
impl IsNotStaticOne for Const<90>
impl IsNotStaticOne for Const<91>
impl IsNotStaticOne for Const<92>
impl IsNotStaticOne for Const<93>
impl IsNotStaticOne for Const<94>
impl IsNotStaticOne for Const<95>
impl IsNotStaticOne for Const<96>
impl IsNotStaticOne for Const<97>
impl IsNotStaticOne for Const<98>
impl IsNotStaticOne for Const<99>
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<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)
🔬This is a nightly-only experimental API. (
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
Checks if this value is equivalent to the given key. Read more
§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
Compare self to
key
and return true
if they are equal.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>
Converts
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>
Converts
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>
The inverse inclusion map: attempts to construct
self
from the equivalent element of its
superset. Read more§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).§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.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self
to the equivalent element of its superset.