Struct oxygengine_physics_2d::prelude::nalgebra::Const
source · pub struct Const<const R: usize>;
Trait Implementations§
source§impl<T, const R: usize, const C: usize> Allocator<T, Const<R>, Const<C>> for DefaultAllocatorwhere
T: Scalar,
impl<T, const R: usize, const C: usize> Allocator<T, Const<R>, Const<C>> for DefaultAllocatorwhere T: Scalar,
§type Buffer = ArrayStorage<T, R, C>
type Buffer = ArrayStorage<T, R, C>
The type of buffer this allocator can instanciate.
§type BufferUninit = ArrayStorage<MaybeUninit<T>, R, C>
type BufferUninit = ArrayStorage<MaybeUninit<T>, R, C>
The type of buffer with uninitialized components this allocator can instanciate.
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>(
nrows: Const<R>,
ncols: Const<C>,
iter: I
) -> <DefaultAllocator as Allocator<T, Const<R>, Const<C>>>::Bufferwhere
I: IntoIterator<Item = T>,
fn allocate_from_iterator<I>( nrows: Const<R>, ncols: Const<C>, iter: I ) -> <DefaultAllocator as Allocator<T, Const<R>, Const<C>>>::Bufferwhere I: IntoIterator<Item = T>,
Allocates a buffer initialized with the content of the given 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 = Dynamic
.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<const A: usize, const B: usize> DimAdd<Const<B>> for Const<A>where
Const<A>: ToTypenum,
Const<B>: ToTypenum,
<Const<A> as ToTypenum>::Typenum: Add<<Const<B> as ToTypenum>::Typenum>,
<<Const<A> as ToTypenum>::Typenum as Add<<Const<B> as ToTypenum>::Typenum>>::Output: ToConst,
impl<const A: usize, const B: usize> DimAdd<Const<B>> for Const<A>where Const<A>: ToTypenum, Const<B>: ToTypenum, <Const<A> as ToTypenum>::Typenum: Add<<Const<B> as ToTypenum>::Typenum>, <<Const<A> as ToTypenum>::Typenum as Add<<Const<B> as ToTypenum>::Typenum>>::Output: ToConst,
source§impl<const A: usize, const B: usize> DimDiv<Const<B>> for Const<A>where
Const<A>: ToTypenum,
Const<B>: ToTypenum,
<Const<A> as ToTypenum>::Typenum: Div<<Const<B> as ToTypenum>::Typenum>,
<<Const<A> as ToTypenum>::Typenum as Div<<Const<B> as ToTypenum>::Typenum>>::Output: ToConst,
impl<const A: usize, const B: usize> DimDiv<Const<B>> for Const<A>where Const<A>: ToTypenum, Const<B>: ToTypenum, <Const<A> as ToTypenum>::Typenum: Div<<Const<B> as ToTypenum>::Typenum>, <<Const<A> as ToTypenum>::Typenum as Div<<Const<B> as ToTypenum>::Typenum>>::Output: ToConst,
source§impl<const A: usize, const B: usize> DimMax<Const<B>> for Const<A>where
Const<A>: ToTypenum,
Const<B>: ToTypenum,
<Const<A> as ToTypenum>::Typenum: Max<<Const<B> as ToTypenum>::Typenum>,
<<Const<A> as ToTypenum>::Typenum as Max<<Const<B> as ToTypenum>::Typenum>>::Output: ToConst,
impl<const A: usize, const B: usize> DimMax<Const<B>> for Const<A>where Const<A>: ToTypenum, Const<B>: ToTypenum, <Const<A> as ToTypenum>::Typenum: Max<<Const<B> as ToTypenum>::Typenum>, <<Const<A> as ToTypenum>::Typenum as Max<<Const<B> as ToTypenum>::Typenum>>::Output: ToConst,
source§impl<const A: usize, const B: usize> DimMin<Const<B>> for Const<A>where
Const<A>: ToTypenum,
Const<B>: ToTypenum,
<Const<A> as ToTypenum>::Typenum: Min<<Const<B> as ToTypenum>::Typenum>,
<<Const<A> as ToTypenum>::Typenum as Min<<Const<B> as ToTypenum>::Typenum>>::Output: ToConst,
impl<const A: usize, const B: usize> DimMin<Const<B>> for Const<A>where Const<A>: ToTypenum, Const<B>: ToTypenum, <Const<A> as ToTypenum>::Typenum: Min<<Const<B> as ToTypenum>::Typenum>, <<Const<A> as ToTypenum>::Typenum as Min<<Const<B> as ToTypenum>::Typenum>>::Output: ToConst,
source§impl<const A: usize, const B: usize> DimMul<Const<B>> for Const<A>where
Const<A>: ToTypenum,
Const<B>: ToTypenum,
<Const<A> as ToTypenum>::Typenum: Mul<<Const<B> as ToTypenum>::Typenum>,
<<Const<A> as ToTypenum>::Typenum as Mul<<Const<B> as ToTypenum>::Typenum>>::Output: ToConst,
impl<const A: usize, const B: usize> DimMul<Const<B>> for Const<A>where Const<A>: ToTypenum, Const<B>: ToTypenum, <Const<A> as ToTypenum>::Typenum: Mul<<Const<B> as ToTypenum>::Typenum>, <<Const<A> as ToTypenum>::Typenum as Mul<<Const<B> as ToTypenum>::Typenum>>::Output: ToConst,
source§impl<const A: usize, const B: usize> DimNameAdd<Const<B>> for Const<A>where
Const<A>: ToTypenum,
Const<B>: ToTypenum,
<Const<A> as ToTypenum>::Typenum: Add<<Const<B> as ToTypenum>::Typenum>,
<<Const<A> as ToTypenum>::Typenum as Add<<Const<B> as ToTypenum>::Typenum>>::Output: ToConst,
impl<const A: usize, const B: usize> DimNameAdd<Const<B>> for Const<A>where Const<A>: ToTypenum, Const<B>: ToTypenum, <Const<A> as ToTypenum>::Typenum: Add<<Const<B> as ToTypenum>::Typenum>, <<Const<A> as ToTypenum>::Typenum as Add<<Const<B> as ToTypenum>::Typenum>>::Output: ToConst,
source§impl<const A: usize, const B: usize> DimNameDiv<Const<B>> for Const<A>where
Const<A>: ToTypenum,
Const<B>: ToTypenum,
<Const<A> as ToTypenum>::Typenum: Div<<Const<B> as ToTypenum>::Typenum>,
<<Const<A> as ToTypenum>::Typenum as Div<<Const<B> as ToTypenum>::Typenum>>::Output: ToConst,
impl<const A: usize, const B: usize> DimNameDiv<Const<B>> for Const<A>where Const<A>: ToTypenum, Const<B>: ToTypenum, <Const<A> as ToTypenum>::Typenum: Div<<Const<B> as ToTypenum>::Typenum>, <<Const<A> as ToTypenum>::Typenum as Div<<Const<B> as ToTypenum>::Typenum>>::Output: ToConst,
source§impl<const A: usize, const B: usize> DimNameMax<Const<B>> for Const<A>where
Const<A>: ToTypenum,
Const<B>: ToTypenum,
<Const<A> as ToTypenum>::Typenum: Max<<Const<B> as ToTypenum>::Typenum>,
<<Const<A> as ToTypenum>::Typenum as Max<<Const<B> as ToTypenum>::Typenum>>::Output: ToConst,
impl<const A: usize, const B: usize> DimNameMax<Const<B>> for Const<A>where Const<A>: ToTypenum, Const<B>: ToTypenum, <Const<A> as ToTypenum>::Typenum: Max<<Const<B> as ToTypenum>::Typenum>, <<Const<A> as ToTypenum>::Typenum as Max<<Const<B> as ToTypenum>::Typenum>>::Output: ToConst,
source§impl<const A: usize, const B: usize> DimNameMin<Const<B>> for Const<A>where
Const<A>: ToTypenum,
Const<B>: ToTypenum,
<Const<A> as ToTypenum>::Typenum: Min<<Const<B> as ToTypenum>::Typenum>,
<<Const<A> as ToTypenum>::Typenum as Min<<Const<B> as ToTypenum>::Typenum>>::Output: ToConst,
impl<const A: usize, const B: usize> DimNameMin<Const<B>> for Const<A>where Const<A>: ToTypenum, Const<B>: ToTypenum, <Const<A> as ToTypenum>::Typenum: Min<<Const<B> as ToTypenum>::Typenum>, <<Const<A> as ToTypenum>::Typenum as Min<<Const<B> as ToTypenum>::Typenum>>::Output: ToConst,
source§impl<const A: usize, const B: usize> DimNameMul<Const<B>> for Const<A>where
Const<A>: ToTypenum,
Const<B>: ToTypenum,
<Const<A> as ToTypenum>::Typenum: Mul<<Const<B> as ToTypenum>::Typenum>,
<<Const<A> as ToTypenum>::Typenum as Mul<<Const<B> as ToTypenum>::Typenum>>::Output: ToConst,
impl<const A: usize, const B: usize> DimNameMul<Const<B>> for Const<A>where Const<A>: ToTypenum, Const<B>: ToTypenum, <Const<A> as ToTypenum>::Typenum: Mul<<Const<B> as ToTypenum>::Typenum>, <<Const<A> as ToTypenum>::Typenum as Mul<<Const<B> as ToTypenum>::Typenum>>::Output: ToConst,
source§impl<const A: usize, const B: usize> DimNameSub<Const<B>> for Const<A>where
Const<A>: ToTypenum,
Const<B>: ToTypenum,
<Const<A> as ToTypenum>::Typenum: Sub<<Const<B> as ToTypenum>::Typenum>,
<<Const<A> as ToTypenum>::Typenum as Sub<<Const<B> as ToTypenum>::Typenum>>::Output: ToConst,
impl<const A: usize, const B: usize> DimNameSub<Const<B>> for Const<A>where Const<A>: ToTypenum, Const<B>: ToTypenum, <Const<A> as ToTypenum>::Typenum: Sub<<Const<B> as ToTypenum>::Typenum>, <<Const<A> as ToTypenum>::Typenum as Sub<<Const<B> as ToTypenum>::Typenum>>::Output: ToConst,
source§impl<const A: usize, const B: usize> DimSub<Const<B>> for Const<A>where
Const<A>: ToTypenum,
Const<B>: ToTypenum,
<Const<A> as ToTypenum>::Typenum: Sub<<Const<B> as ToTypenum>::Typenum>,
<<Const<A> as ToTypenum>::Typenum as Sub<<Const<B> as ToTypenum>::Typenum>>::Output: ToConst,
impl<const A: usize, const B: usize> DimSub<Const<B>> for Const<A>where Const<A>: ToTypenum, Const<B>: ToTypenum, <Const<A> as ToTypenum>::Typenum: Sub<<Const<B> as ToTypenum>::Typenum>, <<Const<A> as ToTypenum>::Typenum as Sub<<Const<B> as ToTypenum>::Typenum>>::Output: ToConst,
source§impl<const R: usize> PartialEq<Const<R>> for Const<R>
impl<const R: usize> PartialEq<Const<R>> 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
) -> (<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>, Dynamic, CTo> for DefaultAllocatorwhere
T: Scalar,
CTo: Dim,
impl<T, CTo, const RFROM: usize, const CFROM: usize> Reallocator<T, Const<RFROM>, Const<CFROM>, Dynamic, CTo> for DefaultAllocatorwhere T: Scalar, CTo: Dim,
source§unsafe fn reallocate_copy(
rto: Dynamic,
cto: CTo,
buf: ArrayStorage<T, RFROM, CFROM>
) -> VecStorage<MaybeUninit<T>, Dynamic, CTo>
unsafe fn reallocate_copy( rto: Dynamic, cto: CTo, buf: ArrayStorage<T, RFROM, CFROM> ) -> VecStorage<MaybeUninit<T>, Dynamic, 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, Dynamic> for DefaultAllocatorwhere
T: Scalar,
RTo: DimName,
impl<T, RTo, const RFROM: usize, const CFROM: usize> Reallocator<T, Const<RFROM>, Const<CFROM>, RTo, Dynamic> for DefaultAllocatorwhere T: Scalar, RTo: DimName,
source§unsafe fn reallocate_copy(
rto: RTo,
cto: Dynamic,
buf: ArrayStorage<T, RFROM, CFROM>
) -> VecStorage<MaybeUninit<T>, RTo, Dynamic>
unsafe fn reallocate_copy( rto: RTo, cto: Dynamic, buf: ArrayStorage<T, RFROM, CFROM> ) -> VecStorage<MaybeUninit<T>, RTo, Dynamic>
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 DefaultAllocatorwhere
T: Scalar,
RFrom: Dim,
CFrom: Dim,
DefaultAllocator: Allocator<T, RFrom, CFrom>,
impl<T, RFrom, CFrom, const RTO: usize, const CTO: usize> Reallocator<T, RFrom, CFrom, Const<RTO>, Const<CTO>> for DefaultAllocatorwhere T: Scalar, RFrom: Dim, CFrom: Dim, DefaultAllocator: Allocator<T, RFrom, CFrom>,
source§unsafe fn reallocate_copy(
rto: Const<RTO>,
cto: Const<CTO>,
buf: <DefaultAllocator as Allocator<T, RFrom, CFrom>>::Buffer
) -> ArrayStorage<MaybeUninit<T>, RTO, CTO>
unsafe fn reallocate_copy( rto: Const<RTO>, cto: Const<CTO>, buf: <DefaultAllocator 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 = <<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<T, Const<R>, Const<C>, Buffer = 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<T, Const<R>, Const<C>, Buffer = ArrayStorage<T, R, C>>,
source§fn into_owned(
self
) -> <DefaultAllocator as Allocator<T, Const<R>, Const<C>>>::Bufferwhere
DefaultAllocator: Allocator<T, Const<R>, Const<C>>,
fn into_owned( self ) -> <DefaultAllocator as Allocator<T, Const<R>, Const<C>>>::Bufferwhere DefaultAllocator: Allocator<T, Const<R>, Const<C>>,
Builds a matrix data storage that does not contain any reference.
source§fn clone_owned(
&self
) -> <DefaultAllocator as Allocator<T, Const<R>, Const<C>>>::Bufferwhere
DefaultAllocator: Allocator<T, Const<R>, Const<C>>,
fn clone_owned( &self ) -> <DefaultAllocator as Allocator<T, Const<R>, Const<C>>>::Bufferwhere DefaultAllocator: Allocator<T, Const<R>, Const<C>>,
Clones this data storage to one that does not contain any reference.
impl<const R: usize> Copy for Const<R>
impl<const R: usize> Eq for Const<R>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U0::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U100::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U101::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U102::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U103::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U104::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U105::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U106::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U107::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U108::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U109::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U10::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U110::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U111::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U112::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U113::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U114::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U115::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U116::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U117::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U118::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U119::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U11::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U120::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U121::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U122::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U123::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U124::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U125::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U126::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U127::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U12::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U13::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U14::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U15::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U16::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U17::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U18::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U19::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U20::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U21::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U22::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U23::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U24::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U25::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U26::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U27::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U28::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U29::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U2::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U30::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U31::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U32::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U33::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U34::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U35::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U36::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U37::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U38::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U39::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U3::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U40::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U41::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U42::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U43::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U44::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U45::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U46::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U47::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U48::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U49::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U4::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U50::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U51::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U52::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U53::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U54::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U55::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U56::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U57::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U58::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U59::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U5::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U60::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U61::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U62::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U63::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U64::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U65::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U66::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U67::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U68::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U69::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U6::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U70::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U71::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U72::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U73::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U74::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U75::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U76::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U77::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U78::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U79::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U7::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U80::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U81::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U82::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U83::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U84::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U85::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U86::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U87::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U88::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U89::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U8::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U90::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U91::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U92::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U93::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U94::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U95::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U96::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U97::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U98::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U99::{constant#0}>
impl IsNotStaticOne for Const<nalgebra::::base::dimension::U9::{constant#0}>
impl<const R: usize> StructuralEq for Const<R>
impl<const R: usize> StructuralPartialEq for Const<R>
Auto Trait Implementations§
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
§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere T: Any,
§fn into_any(self: Box<T, Global>) -> Box<dyn Any, Global>
fn into_any(self: Box<T, Global>) -> Box<dyn Any, Global>
Convert
Box<dyn Trait>
(where Trait: Downcast
) to Box<dyn Any>
. Box<dyn Any>
can
then be further downcast
into Box<ConcreteType>
where ConcreteType
implements Trait
.§fn into_any_rc(self: Rc<T, Global>) -> Rc<dyn Any, Global>
fn into_any_rc(self: Rc<T, Global>) -> Rc<dyn Any, Global>
Convert
Rc<Trait>
(where Trait: Downcast
) to Rc<Any>
. Rc<Any>
can then be
further downcast
into Rc<ConcreteType>
where ConcreteType
implements Trait
.§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
Convert
&Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &Any
’s vtable from &Trait
’s.§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
Convert
&mut Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &mut Any
’s vtable from &mut Trait
’s.§impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,
§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 Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,
§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 Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,
§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<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,
source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.§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.