Struct heron::rapier_plugin::rapier2d::prelude::nalgebra::base::dimension::Dynamic [−][src]
pub struct Dynamic { /* fields omitted */ }
Expand description
Dim of dynamically-sized algebraic entities.
Implementations
Trait Implementations
type Buffer = VecStorage<T, Dynamic, C>
type Buffer = VecStorage<T, Dynamic, C>
The type of buffer this allocator can instanciate.
type BufferUninit = VecStorage<MaybeUninit<T>, Dynamic, C>
type BufferUninit = VecStorage<MaybeUninit<T>, Dynamic, C>
The type of buffer with uninitialized components this allocator can instanciate.
Allocates a buffer with the given number of rows and columns without initializing its content.
pub unsafe fn assume_init(
uninit: VecStorage<MaybeUninit<T>, Dynamic, C>
) -> VecStorage<T, Dynamic, C>
pub unsafe fn assume_init(
uninit: VecStorage<MaybeUninit<T>, Dynamic, C>
) -> VecStorage<T, Dynamic, C>
Assumes a data buffer to be initialized. Read more
pub fn allocate_from_iterator<I>(
nrows: Dynamic,
ncols: C,
iter: I
) -> <DefaultAllocator as Allocator<T, Dynamic, C>>::Buffer where
I: IntoIterator<Item = T>,
pub fn allocate_from_iterator<I>(
nrows: Dynamic,
ncols: C,
iter: I
) -> <DefaultAllocator as Allocator<T, Dynamic, C>>::Buffer where
I: IntoIterator<Item = T>,
Allocates a buffer initialized with the content of the given iterator.
type Buffer = VecStorage<T, R, Dynamic>
type Buffer = VecStorage<T, R, Dynamic>
The type of buffer this allocator can instanciate.
type BufferUninit = VecStorage<MaybeUninit<T>, R, Dynamic>
type BufferUninit = VecStorage<MaybeUninit<T>, R, Dynamic>
The type of buffer with uninitialized components this allocator can instanciate.
Allocates a buffer with the given number of rows and columns without initializing its content.
pub unsafe fn assume_init(
uninit: VecStorage<MaybeUninit<T>, R, Dynamic>
) -> VecStorage<T, R, Dynamic>
pub unsafe fn assume_init(
uninit: VecStorage<MaybeUninit<T>, R, Dynamic>
) -> VecStorage<T, R, Dynamic>
Assumes a data buffer to be initialized. Read more
pub fn allocate_from_iterator<I>(
nrows: R,
ncols: Dynamic,
iter: I
) -> <DefaultAllocator as Allocator<T, R, Dynamic>>::Buffer where
I: IntoIterator<Item = T>,
pub fn allocate_from_iterator<I>(
nrows: R,
ncols: Dynamic,
iter: I
) -> <DefaultAllocator as Allocator<T, R, Dynamic>>::Buffer where
I: IntoIterator<Item = T>,
Allocates a buffer initialized with the content of the given iterator.
Gets the compile-time value of Self
. Returns None
if it is not known, i.e., if Self = Dynamic
. Read more
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()
. Read more
Gets the run-time value of self
. For type-level integers, this is the same as
Self::try_to_usize().unwrap()
. Read more
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. Read more
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. Read more
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
. Read more
pub fn strides(
&self
) -> (<VecStorage<T, Dynamic, C> as RawStorage<T, Dynamic, C>>::RStride, <VecStorage<T, Dynamic, C> as RawStorage<T, Dynamic, C>>::CStride)
pub fn strides(
&self
) -> (<VecStorage<T, Dynamic, C> as RawStorage<T, Dynamic, C>>::RStride, <VecStorage<T, Dynamic, C> as RawStorage<T, Dynamic, C>>::CStride)
The spacing between consecutive row elements and consecutive column elements. Read more
Indicates whether this data buffer stores its elements contiguously. Read more
Retrieves the data buffer as a contiguous slice. Read more
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
Gets the address of the i-th matrix component without performing bound-checking. Read more
Gets the address of the i-th matrix component without performing bound-checking. Read more
Retrieves a reference to the i-th element without bound-checking. Read more
type CStride = R
type CStride = R
The static stride of this storage’s columns.
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
. Read more
pub fn strides(
&self
) -> (<VecStorage<T, R, Dynamic> as RawStorage<T, R, Dynamic>>::RStride, <VecStorage<T, R, Dynamic> as RawStorage<T, R, Dynamic>>::CStride)
pub fn strides(
&self
) -> (<VecStorage<T, R, Dynamic> as RawStorage<T, R, Dynamic>>::RStride, <VecStorage<T, R, Dynamic> as RawStorage<T, R, Dynamic>>::CStride)
The spacing between consecutive row elements and consecutive column elements. Read more
Indicates whether this data buffer stores its elements contiguously. Read more
Retrieves the data buffer as a contiguous slice. Read more
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
Gets the address of the i-th matrix component without performing bound-checking. Read more
Gets the address of the i-th matrix component without performing bound-checking. Read more
Retrieves a reference to the i-th element without bound-checking. Read more
Retrieves the mutable data buffer as a contiguous slice. Read more
Gets the mutable address of the i-th matrix component without performing bound-checking. Read more
Gets the mutable address of the i-th matrix component without performing bound-checking. Read more
Retrieves a mutable reference to the i-th element without bound-checking. Read more
Retrieves a mutable reference to the element at (irow, icol)
without bound-checking. Read more
Swaps two elements using their linear index without bound-checking. Read more
Retrieves the mutable data buffer as a contiguous slice. Read more
Gets the mutable address of the i-th matrix component without performing bound-checking. Read more
Gets the mutable address of the i-th matrix component without performing bound-checking. Read more
Retrieves a mutable reference to the i-th element without bound-checking. Read more
Retrieves a mutable reference to the element at (irow, icol)
without bound-checking. Read more
Swaps two elements using their linear index without bound-checking. Read more
impl<T, CTo, const RFROM: usize, const CFROM: usize> Reallocator<T, Const<RFROM>, Const<CFROM>, Dynamic, CTo> for DefaultAllocator where
T: Scalar,
CTo: Dim,
impl<T, CTo, const RFROM: usize, const CFROM: usize> Reallocator<T, Const<RFROM>, Const<CFROM>, Dynamic, CTo> for DefaultAllocator where
T: Scalar,
CTo: Dim,
pub unsafe fn reallocate_copy(
rto: Dynamic,
cto: CTo,
buf: ArrayStorage<T, RFROM, CFROM>
) -> VecStorage<MaybeUninit<T>, Dynamic, CTo>
pub 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 more
impl<T, RTo, const RFROM: usize, const CFROM: usize> Reallocator<T, Const<RFROM>, Const<CFROM>, RTo, Dynamic> for DefaultAllocator where
T: Scalar,
RTo: DimName,
impl<T, RTo, const RFROM: usize, const CFROM: usize> Reallocator<T, Const<RFROM>, Const<CFROM>, RTo, Dynamic> for DefaultAllocator where
T: Scalar,
RTo: DimName,
pub unsafe fn reallocate_copy(
rto: RTo,
cto: Dynamic,
buf: ArrayStorage<T, RFROM, CFROM>
) -> VecStorage<MaybeUninit<T>, RTo, Dynamic>
pub 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 more
impl<T, CFrom, CTo> Reallocator<T, Dynamic, CFrom, Dynamic, CTo> for DefaultAllocator where
T: Scalar,
CFrom: Dim,
CTo: Dim,
impl<T, CFrom, CTo> Reallocator<T, Dynamic, CFrom, Dynamic, CTo> for DefaultAllocator where
T: Scalar,
CFrom: Dim,
CTo: Dim,
pub unsafe fn reallocate_copy(
rto: Dynamic,
cto: CTo,
buf: VecStorage<T, Dynamic, CFrom>
) -> VecStorage<MaybeUninit<T>, Dynamic, CTo>
pub unsafe fn reallocate_copy(
rto: Dynamic,
cto: CTo,
buf: VecStorage<T, Dynamic, 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 more
impl<T, CFrom, RTo> Reallocator<T, Dynamic, CFrom, RTo, Dynamic> for DefaultAllocator where
T: Scalar,
CFrom: Dim,
RTo: DimName,
impl<T, CFrom, RTo> Reallocator<T, Dynamic, CFrom, RTo, Dynamic> for DefaultAllocator where
T: Scalar,
CFrom: Dim,
RTo: DimName,
pub unsafe fn reallocate_copy(
rto: RTo,
cto: Dynamic,
buf: VecStorage<T, Dynamic, CFrom>
) -> VecStorage<MaybeUninit<T>, RTo, Dynamic>
pub unsafe fn reallocate_copy(
rto: RTo,
cto: Dynamic,
buf: VecStorage<T, Dynamic, 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 more
impl<T, RFrom, CTo> Reallocator<T, RFrom, Dynamic, Dynamic, CTo> for DefaultAllocator where
T: Scalar,
RFrom: DimName,
CTo: Dim,
impl<T, RFrom, CTo> Reallocator<T, RFrom, Dynamic, Dynamic, CTo> for DefaultAllocator where
T: Scalar,
RFrom: DimName,
CTo: Dim,
pub unsafe fn reallocate_copy(
rto: Dynamic,
cto: CTo,
buf: VecStorage<T, RFrom, Dynamic>
) -> VecStorage<MaybeUninit<T>, Dynamic, CTo>
pub unsafe fn reallocate_copy(
rto: Dynamic,
cto: CTo,
buf: VecStorage<T, RFrom, Dynamic>
) -> 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 more
impl<T, RFrom, RTo> Reallocator<T, RFrom, Dynamic, RTo, Dynamic> for DefaultAllocator where
T: Scalar,
RFrom: DimName,
RTo: DimName,
impl<T, RFrom, RTo> Reallocator<T, RFrom, Dynamic, RTo, Dynamic> for DefaultAllocator where
T: Scalar,
RFrom: DimName,
RTo: DimName,
pub unsafe fn reallocate_copy(
rto: RTo,
cto: Dynamic,
buf: VecStorage<T, RFrom, Dynamic>
) -> VecStorage<MaybeUninit<T>, RTo, Dynamic>
pub unsafe fn reallocate_copy(
rto: RTo,
cto: Dynamic,
buf: VecStorage<T, RFrom, Dynamic>
) -> 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 more
impl<T, C1, C2> ReshapableStorage<T, Dynamic, C1, Dynamic, C2> for VecStorage<T, Dynamic, C1> where
T: Scalar,
C1: Dim,
C2: Dim,
impl<T, C1, C2> ReshapableStorage<T, Dynamic, C1, Dynamic, C2> for VecStorage<T, Dynamic, C1> where
T: Scalar,
C1: Dim,
C2: Dim,
type Output = VecStorage<T, Dynamic, C2>
type Output = VecStorage<T, Dynamic, C2>
The reshaped storage type.
pub fn reshape_generic(
self,
nrows: Dynamic,
ncols: C2
) -> <VecStorage<T, Dynamic, C1> as ReshapableStorage<T, Dynamic, C1, Dynamic, C2>>::Output
pub fn reshape_generic(
self,
nrows: Dynamic,
ncols: C2
) -> <VecStorage<T, Dynamic, C1> as ReshapableStorage<T, Dynamic, C1, Dynamic, C2>>::Output
Reshapes the storage into the output storage type.
impl<T, C1, R2> ReshapableStorage<T, Dynamic, C1, R2, Dynamic> for VecStorage<T, Dynamic, C1> where
T: Scalar,
C1: Dim,
R2: DimName,
impl<T, C1, R2> ReshapableStorage<T, Dynamic, C1, R2, Dynamic> for VecStorage<T, Dynamic, C1> where
T: Scalar,
C1: Dim,
R2: DimName,
type Output = VecStorage<T, R2, Dynamic>
type Output = VecStorage<T, R2, Dynamic>
The reshaped storage type.
pub fn reshape_generic(
self,
nrows: R2,
ncols: Dynamic
) -> <VecStorage<T, Dynamic, C1> as ReshapableStorage<T, Dynamic, C1, R2, Dynamic>>::Output
pub fn reshape_generic(
self,
nrows: R2,
ncols: Dynamic
) -> <VecStorage<T, Dynamic, C1> as ReshapableStorage<T, Dynamic, C1, R2, Dynamic>>::Output
Reshapes the storage into the output storage type.
impl<T, R1, C2> ReshapableStorage<T, R1, Dynamic, Dynamic, C2> for VecStorage<T, R1, Dynamic> where
T: Scalar,
R1: DimName,
C2: Dim,
impl<T, R1, C2> ReshapableStorage<T, R1, Dynamic, Dynamic, C2> for VecStorage<T, R1, Dynamic> where
T: Scalar,
R1: DimName,
C2: Dim,
type Output = VecStorage<T, Dynamic, C2>
type Output = VecStorage<T, Dynamic, C2>
The reshaped storage type.
pub fn reshape_generic(
self,
nrows: Dynamic,
ncols: C2
) -> <VecStorage<T, R1, Dynamic> as ReshapableStorage<T, R1, Dynamic, Dynamic, C2>>::Output
pub fn reshape_generic(
self,
nrows: Dynamic,
ncols: C2
) -> <VecStorage<T, R1, Dynamic> as ReshapableStorage<T, R1, Dynamic, Dynamic, C2>>::Output
Reshapes the storage into the output storage type.
impl<T, R1, R2> ReshapableStorage<T, R1, Dynamic, R2, Dynamic> for VecStorage<T, R1, Dynamic> where
T: Scalar,
R1: DimName,
R2: DimName,
impl<T, R1, R2> ReshapableStorage<T, R1, Dynamic, R2, Dynamic> for VecStorage<T, R1, Dynamic> where
T: Scalar,
R1: DimName,
R2: DimName,
type Output = VecStorage<T, R2, Dynamic>
type Output = VecStorage<T, R2, Dynamic>
The reshaped storage type.
pub fn reshape_generic(
self,
nrows: R2,
ncols: Dynamic
) -> <VecStorage<T, R1, Dynamic> as ReshapableStorage<T, R1, Dynamic, R2, Dynamic>>::Output
pub fn reshape_generic(
self,
nrows: R2,
ncols: Dynamic
) -> <VecStorage<T, R1, Dynamic> as ReshapableStorage<T, R1, Dynamic, R2, Dynamic>>::Output
Reshapes the storage into the output storage type.
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. Read more
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. Read more
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. Read more
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. Read more
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. Read more
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. Read more
impl<T, C> Storage<T, Dynamic, C> for VecStorage<T, Dynamic, C> where
T: Scalar,
C: Dim,
DefaultAllocator: Allocator<T, Dynamic, C>,
<DefaultAllocator as Allocator<T, Dynamic, C>>::Buffer == VecStorage<T, Dynamic, C>,
impl<T, C> Storage<T, Dynamic, C> for VecStorage<T, Dynamic, C> where
T: Scalar,
C: Dim,
DefaultAllocator: Allocator<T, Dynamic, C>,
<DefaultAllocator as Allocator<T, Dynamic, C>>::Buffer == VecStorage<T, Dynamic, C>,
pub fn into_owned(
self
) -> <DefaultAllocator as Allocator<T, Dynamic, C>>::Buffer where
DefaultAllocator: Allocator<T, Dynamic, C>,
pub fn into_owned(
self
) -> <DefaultAllocator as Allocator<T, Dynamic, C>>::Buffer where
DefaultAllocator: Allocator<T, Dynamic, C>,
Builds a matrix data storage that does not contain any reference.
pub fn clone_owned(
&self
) -> <DefaultAllocator as Allocator<T, Dynamic, C>>::Buffer where
DefaultAllocator: Allocator<T, Dynamic, C>,
pub fn clone_owned(
&self
) -> <DefaultAllocator as Allocator<T, Dynamic, C>>::Buffer where
DefaultAllocator: Allocator<T, Dynamic, C>,
Clones this data storage to one that does not contain any reference.
impl<T, R> Storage<T, R, Dynamic> for VecStorage<T, R, Dynamic> where
T: Scalar,
R: DimName,
DefaultAllocator: Allocator<T, R, Dynamic>,
<DefaultAllocator as Allocator<T, R, Dynamic>>::Buffer == VecStorage<T, R, Dynamic>,
impl<T, R> Storage<T, R, Dynamic> for VecStorage<T, R, Dynamic> where
T: Scalar,
R: DimName,
DefaultAllocator: Allocator<T, R, Dynamic>,
<DefaultAllocator as Allocator<T, R, Dynamic>>::Buffer == VecStorage<T, R, Dynamic>,
pub fn into_owned(
self
) -> <DefaultAllocator as Allocator<T, R, Dynamic>>::Buffer where
DefaultAllocator: Allocator<T, R, Dynamic>,
pub fn into_owned(
self
) -> <DefaultAllocator as Allocator<T, R, Dynamic>>::Buffer where
DefaultAllocator: Allocator<T, R, Dynamic>,
Builds a matrix data storage that does not contain any reference.
pub fn clone_owned(
&self
) -> <DefaultAllocator as Allocator<T, R, Dynamic>>::Buffer where
DefaultAllocator: Allocator<T, R, Dynamic>,
pub fn clone_owned(
&self
) -> <DefaultAllocator as Allocator<T, R, Dynamic>>::Buffer where
DefaultAllocator: Allocator<T, R, Dynamic>,
Clones this data storage to one that does not contain any reference.
Auto Trait Implementations
impl RefUnwindSafe for Dynamic
impl UnwindSafe for Dynamic
Blanket Implementations
Mutably borrows from an owned value. Read more
impl<T> Downcast for T where
T: Any,
impl<T> Downcast for T where
T: Any,
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
. Read more
pub fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
pub fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
Convert Rc<Trait>
(where Trait: Downcast
) to Rc<Any>
. Rc<Any>
can then be
further downcast
into Rc<ConcreteType>
where ConcreteType
implements Trait
. Read more
Convert &Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &Any
’s vtable from &Trait
’s. Read more
pub fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
pub 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. Read more
impl<T> Pointable for T
impl<T> Pointable for T
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
The inverse inclusion map: attempts to construct self
from the equivalent element of its
superset. Read more
pub fn is_in_subset(&self) -> bool
pub fn is_in_subset(&self) -> bool
Checks if self
is actually part of its subset T
(and can be converted to it).
pub fn to_subset_unchecked(&self) -> SS
pub fn to_subset_unchecked(&self) -> SS
Use with care! Same as self.to_subset
but without any property checks. Always succeeds.
pub fn from_subset(element: &SS) -> SP
pub fn from_subset(element: &SS) -> SP
The inclusion map: converts self
to the equivalent element of its superset.
pub fn clone_type_data(&self) -> Box<dyn TypeData + 'static, Global>
pub fn vzip(self) -> V
Attaches the provided Subscriber
to this type, returning a
WithDispatch
wrapper. Read more
Attaches the current default Subscriber
to this type, returning a
WithDispatch
wrapper. Read more