pub struct Dyn(pub usize);
Expand description
Dim of dynamically-sized algebraic entities.
Tuple Fields§
§0: usize
Implementations§
Trait Implementations§
source§impl<C> Allocator<Dyn, C> for DefaultAllocatorwhere
C: Dim,
impl<C> Allocator<Dyn, C> for DefaultAllocatorwhere
C: Dim,
source§type Buffer<T: Scalar> = VecStorage<T, Dyn, C>
type Buffer<T: Scalar> = VecStorage<T, Dyn, C>
The type of buffer this allocator can instantiate.
source§type BufferUninit<T: Scalar> = VecStorage<MaybeUninit<T>, Dyn, C>
type BufferUninit<T: Scalar> = VecStorage<MaybeUninit<T>, Dyn, C>
The type of buffer with uninitialized components this allocator can instantiate.
source§fn allocate_uninit<T>(
nrows: Dyn,
ncols: C,
) -> VecStorage<MaybeUninit<T>, Dyn, C>where
T: Scalar,
fn allocate_uninit<T>(
nrows: Dyn,
ncols: C,
) -> VecStorage<MaybeUninit<T>, Dyn, 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: VecStorage<MaybeUninit<T>, Dyn, C>,
) -> VecStorage<T, Dyn, C>where
T: Scalar,
unsafe fn assume_init<T>(
uninit: VecStorage<MaybeUninit<T>, Dyn, C>,
) -> VecStorage<T, Dyn, C>where
T: Scalar,
Assumes a data buffer to be initialized. Read more
source§fn allocate_from_iterator<T, I>(
nrows: Dyn,
ncols: C,
iter: I,
) -> <DefaultAllocator as Allocator<Dyn, C>>::Buffer<T>where
T: Scalar,
I: IntoIterator<Item = T>,
fn allocate_from_iterator<T, I>(
nrows: Dyn,
ncols: C,
iter: I,
) -> <DefaultAllocator as Allocator<Dyn, 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<R> Allocator<R, Dyn> for DefaultAllocatorwhere
R: DimName,
impl<R> Allocator<R, Dyn> for DefaultAllocatorwhere
R: DimName,
source§type Buffer<T: Scalar> = VecStorage<T, R, Dyn>
type Buffer<T: Scalar> = VecStorage<T, R, Dyn>
The type of buffer this allocator can instantiate.
source§type BufferUninit<T: Scalar> = VecStorage<MaybeUninit<T>, R, Dyn>
type BufferUninit<T: Scalar> = VecStorage<MaybeUninit<T>, R, Dyn>
The type of buffer with uninitialized components this allocator can instantiate.
source§fn allocate_uninit<T>(
nrows: R,
ncols: Dyn,
) -> VecStorage<MaybeUninit<T>, R, Dyn>where
T: Scalar,
fn allocate_uninit<T>(
nrows: R,
ncols: Dyn,
) -> VecStorage<MaybeUninit<T>, R, Dyn>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: VecStorage<MaybeUninit<T>, R, Dyn>,
) -> VecStorage<T, R, Dyn>where
T: Scalar,
unsafe fn assume_init<T>(
uninit: VecStorage<MaybeUninit<T>, R, Dyn>,
) -> VecStorage<T, R, Dyn>where
T: Scalar,
Assumes a data buffer to be initialized. Read more
source§fn allocate_from_iterator<T, I>(
nrows: R,
ncols: Dyn,
iter: I,
) -> <DefaultAllocator as Allocator<R, Dyn>>::Buffer<T>where
T: Scalar,
I: IntoIterator<Item = T>,
fn allocate_from_iterator<T, I>(
nrows: R,
ncols: Dyn,
iter: I,
) -> <DefaultAllocator as Allocator<R, Dyn>>::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> Deserialize<'de> for Dyn
impl<'de> Deserialize<'de> for Dyn
source§fn deserialize<D>(
deserializer: D,
) -> Result<Dyn, <D as Deserializer<'de>>::Error>where
D: Deserializer<'de>,
fn deserialize<D>(
deserializer: D,
) -> Result<Dyn, <D as Deserializer<'de>>::Error>where
D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
source§impl Dim for Dyn
impl Dim for Dyn
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 from_usize(dim: usize) -> Dyn
fn from_usize(dim: usize) -> Dyn
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()
.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()
.fn is<D>() -> boolwhere
D: Dim,
source§impl<D> DimEq<D, Dyn> for ShapeConstraintwhere
D: DimName,
impl<D> DimEq<D, Dyn> for ShapeConstraintwhere
D: DimName,
source§type Representative = D
type Representative = D
This is either equal to
D1
or D2
, always choosing the one (if any) which is a type-level
constant.source§fn representative(d1: D1, d2: D2) -> Option<Self::Representative>
fn representative(d1: D1, d2: D2) -> Option<Self::Representative>
This constructs a value of type
Representative
with the
correct valuesource§impl<D> DimEq<Dyn, D> for ShapeConstraintwhere
D: DimName,
impl<D> DimEq<Dyn, D> for ShapeConstraintwhere
D: DimName,
source§type Representative = D
type Representative = D
This is either equal to
D1
or D2
, always choosing the one (if any) which is a type-level
constant.source§fn representative(d1: D1, d2: D2) -> Option<Self::Representative>
fn representative(d1: D1, d2: D2) -> Option<Self::Representative>
This constructs a value of type
Representative
with the
correct valuesource§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)
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,
) -> (<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)
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, 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)
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,
) -> (<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)
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, 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]
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, 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]
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, CFrom, CTo> Reallocator<T, Dyn, CFrom, Dyn, CTo> for DefaultAllocator
impl<T, CFrom, CTo> Reallocator<T, Dyn, CFrom, Dyn, CTo> for DefaultAllocator
source§unsafe fn reallocate_copy(
rto: Dyn,
cto: CTo,
buf: VecStorage<T, Dyn, CFrom>,
) -> VecStorage<MaybeUninit<T>, Dyn, CTo>
unsafe fn reallocate_copy( rto: Dyn, cto: CTo, buf: VecStorage<T, Dyn, 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, CFrom, RTo> Reallocator<T, Dyn, CFrom, RTo, Dyn> for DefaultAllocator
impl<T, CFrom, RTo> Reallocator<T, Dyn, CFrom, RTo, Dyn> for DefaultAllocator
source§unsafe fn reallocate_copy(
rto: RTo,
cto: Dyn,
buf: VecStorage<T, Dyn, CFrom>,
) -> VecStorage<MaybeUninit<T>, RTo, Dyn>
unsafe fn reallocate_copy( rto: RTo, cto: Dyn, buf: VecStorage<T, Dyn, 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, CTo> Reallocator<T, RFrom, Dyn, Dyn, CTo> for DefaultAllocator
impl<T, RFrom, CTo> Reallocator<T, RFrom, Dyn, Dyn, CTo> for DefaultAllocator
source§unsafe fn reallocate_copy(
rto: Dyn,
cto: CTo,
buf: VecStorage<T, RFrom, Dyn>,
) -> VecStorage<MaybeUninit<T>, Dyn, CTo>
unsafe fn reallocate_copy( rto: Dyn, cto: CTo, buf: VecStorage<T, RFrom, Dyn>, ) -> 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, RFrom, RTo> Reallocator<T, RFrom, Dyn, RTo, Dyn> for DefaultAllocator
impl<T, RFrom, RTo> Reallocator<T, RFrom, Dyn, RTo, Dyn> for DefaultAllocator
source§unsafe fn reallocate_copy(
rto: RTo,
cto: Dyn,
buf: VecStorage<T, RFrom, Dyn>,
) -> VecStorage<MaybeUninit<T>, RTo, Dyn>
unsafe fn reallocate_copy( rto: RTo, cto: Dyn, buf: VecStorage<T, RFrom, Dyn>, ) -> 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, 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>
The reshaped storage type.
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
Reshapes the storage into the output storage type.
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>
The reshaped storage type.
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
Reshapes the storage into the output storage type.
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>
The reshaped storage type.
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
Reshapes the storage into the output storage type.
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>
The reshaped storage type.
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
Reshapes the storage into the output storage type.
source§impl<D> SameDimension<D, Dyn> for ShapeConstraintwhere
D: DimName,
impl<D> SameDimension<D, Dyn> for ShapeConstraintwhere
D: DimName,
source§type Representative = D
type Representative = D
This is either equal to
D1
or D2
, always choosing the one (if any) which is a type-level
constant.source§impl<D> SameDimension<Dyn, D> for ShapeConstraintwhere
D: DimName,
impl<D> SameDimension<Dyn, D> for ShapeConstraintwhere
D: DimName,
source§type Representative = D
type Representative = D
This is either equal to
D1
or D2
, always choosing the one (if any) which is a type-level
constant.source§impl<D> SameNumberOfColumns<D, Dyn> for ShapeConstraintwhere
D: DimName,
impl<D> SameNumberOfColumns<D, Dyn> for ShapeConstraintwhere
D: DimName,
source§type Representative = D
type Representative = D
This is either equal to
D1
or D2
, always choosing the one (if any) which is a type-level
constant.source§fn representative(d1: D1, d2: D2) -> Option<Self::Representative>
fn representative(d1: D1, d2: D2) -> Option<Self::Representative>
Returns a representative dimension instance if the two are equal,
otherwise
None
.source§impl<D> SameNumberOfColumns<Dyn, D> for ShapeConstraintwhere
D: DimName,
impl<D> SameNumberOfColumns<Dyn, D> for ShapeConstraintwhere
D: DimName,
source§type Representative = D
type Representative = D
This is either equal to
D1
or D2
, always choosing the one (if any) which is a type-level
constant.source§fn representative(d1: D1, d2: D2) -> Option<Self::Representative>
fn representative(d1: D1, d2: D2) -> Option<Self::Representative>
Returns a representative dimension instance if the two are equal,
otherwise
None
.source§impl<D> SameNumberOfRows<D, Dyn> for ShapeConstraintwhere
D: DimName,
impl<D> SameNumberOfRows<D, Dyn> for ShapeConstraintwhere
D: DimName,
source§type Representative = D
type Representative = D
This is either equal to
D1
or D2
, always choosing the one (if any) which is a type-level
constant.source§fn representative(d1: D1, d2: D2) -> Option<Self::Representative>
fn representative(d1: D1, d2: D2) -> Option<Self::Representative>
Returns a representative dimension instance if the two are equal,
otherwise
None
.source§impl<D> SameNumberOfRows<Dyn, D> for ShapeConstraintwhere
D: DimName,
impl<D> SameNumberOfRows<Dyn, D> for ShapeConstraintwhere
D: DimName,
source§type Representative = D
type Representative = D
This is either equal to
D1
or D2
, always choosing the one (if any) which is a type-level
constant.source§fn representative(d1: D1, d2: D2) -> Option<Self::Representative>
fn representative(d1: D1, d2: D2) -> Option<Self::Representative>
Returns a representative dimension instance if the two are equal,
otherwise
None
.source§impl Serialize for Dyn
impl Serialize for Dyn
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, 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>
Builds a matrix data storage that does not contain any reference.
source§fn clone_owned(&self) -> <DefaultAllocator as Allocator<Dyn, C>>::Buffer<T>
fn clone_owned(&self) -> <DefaultAllocator as Allocator<Dyn, 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.
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>
Builds a matrix data storage that does not contain any reference.
source§fn clone_owned(&self) -> <DefaultAllocator as Allocator<R, Dyn>>::Buffer<T>
fn clone_owned(&self) -> <DefaultAllocator as Allocator<R, Dyn>>::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 Copy for Dyn
impl Eq for Dyn
impl IsDynamic for Dyn
impl IsNotStaticOne for Dyn
impl StructuralPartialEq for Dyn
Auto Trait Implementations§
impl Freeze for Dyn
impl RefUnwindSafe for Dyn
impl Send for Dyn
impl Sync for Dyn
impl Unpin for Dyn
impl UnwindSafe for Dyn
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.§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
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.