Struct heron::rapier_plugin::rapier2d::prelude::nalgebra::Dynamic

source ·

pub struct Dynamic { /* private fields */ }

Expand description

Dim of dynamically-sized algebraic entities.

Implementations

source

impl Dynamic

source

pub const fn new(value: usize) -> Dynamic

A dynamic size equal to value.

Trait Implementations

source

impl Add<usize> for Dynamic

type Output = Dynamic

The resulting type after applying the + operator.

source

fn add(self, rhs: usize) -> Dynamic

Performs the + operation. Read more

source

impl<T, C> Allocator<T, Dynamic, C> for DefaultAllocatorwhere
T: Scalar,
C: Dim,

type Buffer = VecStorage<T, Dynamic, C>

The type of buffer this allocator can instanciate.

type BufferUninit = VecStorage<MaybeUninit<T>, Dynamic, C>

The type of buffer with uninitialized components this allocator can instanciate.

source

fn allocate_uninit(
nrows: Dynamic,
ncols: C
) -> VecStorage<MaybeUninit<T>, Dynamic, C>

Allocates a buffer with the given number of rows and columns without initializing its content.

source

unsafe fn assume_init(
uninit: VecStorage<MaybeUninit<T>, Dynamic, C>
) -> VecStorage<T, Dynamic, C>

Assumes a data buffer to be initialized. Read more

source

fn allocate_from_iterator(
 nrows: Dynamic,
 ncols: C,
 iter: I
) -> <DefaultAllocator as Allocator<T, Dynamic, C>>::Bufferwhere
 I: IntoIterator<Item = T>,

Allocates a buffer initialized with the content of the given iterator.

source

fn allocate_from_row_iterator(nrows: R, ncols: C, iter: I) -> Self::Bufferwhere
I: IntoIterator<Item = T>,

Allocates a buffer initialized with the content of the given row-major order iterator.

source

impl<T, R> Allocator<T, R, Dynamic> for DefaultAllocatorwhere
T: Scalar,
R: DimName,

type Buffer = VecStorage<T, R, Dynamic>

The type of buffer this allocator can instanciate.

type BufferUninit = VecStorage<MaybeUninit<T>, R, Dynamic>

The type of buffer with uninitialized components this allocator can instanciate.

source

fn allocate_uninit(
nrows: R,
ncols: Dynamic
) -> VecStorage<MaybeUninit<T>, R, Dynamic>

Allocates a buffer with the given number of rows and columns without initializing its content.

source

unsafe fn assume_init(
uninit: VecStorage<MaybeUninit<T>, R, Dynamic>
) -> VecStorage<T, R, Dynamic>

Assumes a data buffer to be initialized. Read more

source

fn allocate_from_iterator(
 nrows: R,
 ncols: Dynamic,
 iter: I
) -> <DefaultAllocator as Allocator<T, R, Dynamic>>::Bufferwhere
 I: IntoIterator<Item = T>,

Allocates a buffer initialized with the content of the given iterator.

source

fn allocate_from_row_iterator(nrows: R, ncols: C, iter: I) -> Self::Bufferwhere
I: IntoIterator<Item = T>,

Allocates a buffer initialized with the content of the given row-major order iterator.

source

impl Clone for Dynamic

source

fn clone(&self) -> Dynamic

Returns a copy of the value. Read more

1.0.0 · source

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more

source

impl Debug for Dynamic

source

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter. Read more

source

impl Dim for Dynamic

source

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. Read more

source

fn from_usize(dim: usize) -> Dynamic

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

source

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(). Read more

source

fn is<D>() -> boolwhere
D: Dim,

source

impl<D> DimAdd<D> for Dynamicwhere
D: Dim,

type Output = Dynamic

source

fn add(self, other: D) -> Dynamic

source

impl<D> DimDiv<D> for Dynamicwhere
D: Dim,

type Output = Dynamic

source

fn div(self, other: D) -> Dynamic

source

impl<D> DimEq<D, Dynamic> for ShapeConstraintwhere
D: DimName,

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

source

impl<D> DimEq<Dynamic, D> for ShapeConstraintwhere
D: DimName,

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

source

impl<D> DimMax<D> for Dynamicwhere
D: Dim,

type Output = Dynamic

source

fn max(self, other: D) -> Dynamic

source

impl<D> DimMin<D> for Dynamicwhere
D: Dim,

type Output = Dynamic

source

fn min(self, other: D) -> Dynamic

source

impl<D> DimMul<D> for Dynamicwhere
D: Dim,

type Output = Dynamic

source

fn mul(self, other: D) -> Dynamic

source

impl<D> DimSub<D> for Dynamicwhere
D: Dim,

fn eq(&self, other: &Dynamic) -> bool

This method tests for self and other values to be equal, and is used by ==. Read more

1.0.0 · source

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason. Read more

source

impl<T, C> RawStorage<T, Dynamic, C> for VecStorage<T, Dynamic, C>where
C: Dim,

type RStride = Const<1>

The static stride of this storage’s rows.

type CStride = Dynamic

The static stride of this storage’s columns.

source

fn ptr(&self) -> *const T

The matrix data pointer.

source

fn shape(&self) -> (Dynamic, 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. Read more

source

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

source

fn is_contiguous(&self) -> bool

Indicates whether this data buffer stores its elements contiguously. Read more

source

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

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

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

Gets the address of the i-th matrix component without performing bound-checking. Read more

source

unsafe fn get_unchecked_linear(&self, i: usize) -> &T

Retrieves a reference to the i-th element without bound-checking. Read more

source

unsafe fn get_unchecked(&self, irow: usize, icol: usize) -> &T

Retrieves a reference to the i-th element without bound-checking. Read more

source

impl<T, R> RawStorage<T, R, Dynamic> for VecStorage<T, R, Dynamic>where
R: DimName,

type RStride = Const<1>

The static stride of this storage’s rows.

type CStride = R

The static stride of this storage’s columns.

source

fn ptr(&self) -> *const T

The matrix data pointer.

source

fn shape(&self) -> (R, Dynamic)

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

source

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

source

fn is_contiguous(&self) -> bool

Indicates whether this data buffer stores its elements contiguously. Read more

source

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

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

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

Gets the address of the i-th matrix component without performing bound-checking. Read more

source

unsafe fn get_unchecked_linear(&self, i: usize) -> &T

Retrieves a reference to the i-th element without bound-checking. Read more

source

unsafe fn get_unchecked(&self, irow: usize, icol: usize) -> &T

Retrieves a reference to the i-th element without bound-checking. Read more

source

impl<T, C> RawStorageMut<T, Dynamic, C> for VecStorage<T, Dynamic, C>where
C: Dim,

source

fn ptr_mut(&mut self) -> *mut T

The matrix mutable data pointer.

source

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

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

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

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

Retrieves a mutable reference to the element at (irow, icol) without bound-checking. Read more

source

unsafe fn swap_unchecked_linear(&mut self, i1: usize, i2: usize)

Swaps two elements using their linear index without bound-checking. Read more

source

unsafe fn swap_unchecked(
    &mut self,
    row_col1: (usize, usize),
    row_col2: (usize, usize)
)

Swaps two elements without bound-checking. Read more

source

impl<T, R> RawStorageMut<T, R, Dynamic> for VecStorage<T, R, Dynamic>where
R: DimName,

source

fn ptr_mut(&mut self) -> *mut T

The matrix mutable data pointer.

source

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

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

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

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

Retrieves a mutable reference to the element at (irow, icol) without bound-checking. Read more

source

unsafe fn swap_unchecked_linear(&mut self, i1: usize, i2: usize)

Swaps two elements using their linear index without bound-checking. Read more

source

unsafe fn swap_unchecked(
    &mut self,
    row_col1: (usize, usize),
    row_col2: (usize, usize)
)

Swaps two elements without bound-checking. Read more

source

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>

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

source

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>

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

source

impl<T, CFrom, CTo> Reallocator<T, Dynamic, CFrom, Dynamic, CTo> for DefaultAllocatorwhere
 T: Scalar,
 CFrom: Dim,
 CTo: Dim,

source

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

source

impl<T, CFrom, RTo> Reallocator<T, Dynamic, CFrom, RTo, Dynamic> for DefaultAllocatorwhere
 T: Scalar,
 CFrom: Dim,
 RTo: DimName,

source

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

source

impl<T, RFrom, CTo> Reallocator<T, RFrom, Dynamic, Dynamic, CTo> for DefaultAllocatorwhere
 T: Scalar,
 RFrom: DimName,
 CTo: Dim,

source

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

source

impl<T, RFrom, RTo> Reallocator<T, RFrom, Dynamic, RTo, Dynamic> for DefaultAllocatorwhere
 T: Scalar,
 RFrom: DimName,
 RTo: DimName,

source

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

source

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>

The reshaped storage type.

source

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.

source

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>

The reshaped storage type.

source

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.

source

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>

The reshaped storage type.

source

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.

source

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>

The reshaped storage type.

source

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.

source

impl<D> SameDimension<D, Dynamic> for ShapeConstraintwhere
D: DimName,

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

source

impl<D> SameDimension<Dynamic, D> for ShapeConstraintwhere
D: DimName,

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

source

impl<D> SameNumberOfColumns<D, Dynamic> for ShapeConstraintwhere
D: DimName,

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

source

impl<D> SameNumberOfColumns<Dynamic, D> for ShapeConstraintwhere
D: DimName,

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

source

impl<D> SameNumberOfRows<D, Dynamic> for ShapeConstraintwhere
D: DimName,

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

source

impl<D> SameNumberOfRows<Dynamic, D> for ShapeConstraintwhere
D: DimName,

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

source

impl<T, C> Storage<T, Dynamic, C> for VecStorage<T, Dynamic, C>where
 T: Scalar,
 C: Dim,
 DefaultAllocator: Allocator<T, Dynamic, C, Buffer = VecStorage<T, Dynamic, C>>,

source

fn into_owned(self) -> <DefaultAllocator as Allocator<T, Dynamic, C>>::Bufferwhere
DefaultAllocator: Allocator<T, Dynamic, C>,

Builds a matrix data storage that does not contain any reference.

source

fn clone_owned(&self) -> <DefaultAllocator as Allocator<T, Dynamic, C>>::Bufferwhere
DefaultAllocator: Allocator<T, Dynamic, C>,

Clones this data storage to one that does not contain any reference.

source

impl<T, R> Storage<T, R, Dynamic> for VecStorage<T, R, Dynamic>where
 T: Scalar,
 R: DimName,
 DefaultAllocator: Allocator<T, R, Dynamic, Buffer = VecStorage<T, R, Dynamic>>,

source

fn into_owned(self) -> <DefaultAllocator as Allocator<T, R, Dynamic>>::Bufferwhere
DefaultAllocator: Allocator<T, R, Dynamic>,

Builds a matrix data storage that does not contain any reference.

source

fn clone_owned(&self) -> <DefaultAllocator as Allocator<T, R, Dynamic>>::Bufferwhere
DefaultAllocator: Allocator<T, R, Dynamic>,

Clones this data storage to one that does not contain any reference.

source

impl Sub<usize> for Dynamic

type Output = Dynamic

The resulting type after applying the - operator.

source

fn sub(self, rhs: usize) -> Dynamic

Performs the - operation. Read more

source

impl Copy for Dynamic

source

impl Eq for Dynamic

source

impl IsDynamic for Dynamic

source

impl IsNotStaticOne for Dynamic

source

impl StructuralEq for Dynamic

source

impl StructuralPartialEq for Dynamic

Auto Trait Implementations

impl RefUnwindSafe for Dynamic

impl Send for Dynamic

impl Sync for Dynamic

impl Unpin for Dynamic

impl UnwindSafe for Dynamic

Blanket Implementations

source

impl<T> Any for Twhere
T: 'static + ?Sized,

source

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

impl<T, U> AsBindGroupShaderType for Twhere
U: ShaderType,
&'a T: for<'a> Into,

fn as_bind_group_shader_type(
&self,
_images: &HashMap<Handle<Image>, <Image as RenderAsset>::PreparedAsset, RandomState, Global>
) -> U

Return the T [ShaderType] for self. When used in [AsBindGroup] derives, it is safe to assume that all images in self exist. Read more

source

impl<T> Borrow<T> for Twhere
T: ?Sized,

const: unstable · source

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

source

impl<T> BorrowMut<T> for Twhere
T: ?Sized,

const: unstable · source

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

source

impl<D> DimAdd<Dynamic> for Dwhere
D: DimName,

type Output = Dynamic

source

fn add(self, other: Dynamic) -> Dynamic

source

impl<D> DimDiv<Dynamic> for Dwhere
D: DimName,

type Output = Dynamic

source

fn div(self, other: Dynamic) -> Dynamic

source

impl<D> DimMax<Dynamic> for Dwhere
D: DimName,

type Output = Dynamic

source

fn max(self, other: Dynamic) -> Dynamic

source

impl<D> DimMin<Dynamic> for Dwhere
D: DimName,

type Output = Dynamic

source

fn min(self, other: Dynamic) -> Dynamic

source

impl<D> DimMul<Dynamic> for Dwhere
D: DimName,

type Output = Dynamic

source

fn mul(self, other: Dynamic) -> Dynamic

source

impl<D> DimSub<Dynamic> for Dwhere
D: DimName,

type Output = Dynamic

source

fn sub(self, other: Dynamic) -> Dynamic

impl<T> Downcast<T> for T

fn downcast(&self) -> &T

impl<T> Downcast for Twhere
T: Any,

fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, 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. Read more

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

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. Read more

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> DowncastSync for Twhere
T: Any + Send + Sync,

fn into_any_arc(self: Arc<T>) -> Arc<dyn Any + Sync + Send + 'static>

Convert Arc<Trait> (where Trait: Downcast) to Arc<Any>. Arc<Any> can then be further downcast into Arc<ConcreteType> where ConcreteType implements Trait. Read more

impl<T> DynEq for Twhere
T: Any + Eq,

fn as_any(&self) -> &(dyn Any + 'static)

fn dyn_eq(&self, other: &(dyn DynEq + 'static)) -> bool

source

impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,

source

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.

source

impl<T> From<T> for T

const: unstable · source

fn from(t: T) -> T

Returns the argument unchanged.

source

impl<T> Instrument for T

source

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more

source

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more

source

impl<T, U> Into for Twhere
U: From<T>,

const: unstable · source

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

impl<T> Pointable for T

const ALIGN: usize = mem::align_of::<T>()

The alignment of pointer.

type Init = T

The type for initializers.

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more

source

impl<T> Same<T> for T

type Output = T

Should always be Self

impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,

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

Checks if self is actually part of its subset T (and can be converted to it).

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

The inclusion map: converts self to the equivalent element of its superset.

source

impl<T> ToOwned for Twhere
T: Clone,

type Owned = T

The resulting type after obtaining ownership.

source

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more

source

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more

source

impl<T, U> TryFrom for Twhere
U: Into<T>,

type Error = Infallible

The type returned in the event of a conversion error.

const: unstable · source

fn try_from(value: U) -> Result<T, <T as TryFrom>::Error>

Performs the conversion.

source

impl<T, U> TryInto for Twhere
U: TryFrom<T>,

type Error = >::Error

The type returned in the event of a conversion error.

const: unstable · source

fn try_into(self) -> Result<U, >::Error>

Performs the conversion.

impl<T> TypeData for Twhere
T: 'static + Send + Sync + Clone,

fn clone_type_data(&self) -> Box<dyn TypeData + 'static, Global>

impl<T> Upcast<T> for T

fn upcast(&self) -> Option<&T>

source

impl<T> WithSubscriber for T

source

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>where
S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more

source

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a WithDispatch wrapper. Read more

impl<T> Event for Twhere
T: 'static + Send + Sync,

impl<T> Resource for Twhere
T: 'static + Send + Sync,

source

Struct heron::rapier_plugin::rapier2d::prelude::nalgebra::Dynamic

Implementations

impl Dynamic

pub const fn new(value: usize) -> Dynamic

Trait Implementations

impl Add<usize> for Dynamic

type Output = Dynamic

fn add(self, rhs: usize) -> Dynamic

impl<T, C> Allocator<T, Dynamic, C> for DefaultAllocatorwhere T: Scalar, C: Dim,

type Buffer = VecStorage<T, Dynamic, C>

type BufferUninit = VecStorage<MaybeUninit<T>, Dynamic, C>

fn allocate_uninit( nrows: Dynamic, ncols: C) -> VecStorage<MaybeUninit<T>, Dynamic, C>

unsafe fn assume_init( uninit: VecStorage<MaybeUninit<T>, Dynamic, C>) -> VecStorage<T, Dynamic, C>

fn allocate_from_iterator<I>( nrows: Dynamic, ncols: C, iter: I) -> <DefaultAllocator as Allocator<T, Dynamic, C>>::Bufferwhere I: IntoIterator<Item = T>,

fn allocate_from_row_iterator<I>(nrows: R, ncols: C, iter: I) -> Self::Bufferwhere I: IntoIterator<Item = T>,

impl<T, R> Allocator<T, R, Dynamic> for DefaultAllocatorwhere T: Scalar, R: DimName,

type Buffer = VecStorage<T, R, Dynamic>

type BufferUninit = VecStorage<MaybeUninit<T>, R, Dynamic>

fn allocate_uninit( nrows: R, ncols: Dynamic) -> VecStorage<MaybeUninit<T>, R, Dynamic>

unsafe fn assume_init( uninit: VecStorage<MaybeUninit<T>, R, Dynamic>) -> VecStorage<T, R, Dynamic>

fn allocate_from_iterator<I>( nrows: R, ncols: Dynamic, iter: I) -> <DefaultAllocator as Allocator<T, R, Dynamic>>::Bufferwhere I: IntoIterator<Item = T>,

fn allocate_from_row_iterator<I>(nrows: R, ncols: C, iter: I) -> Self::Bufferwhere I: IntoIterator<Item = T>,

impl Clone for Dynamic

fn clone(&self) -> Dynamic

fn clone_from(&mut self, source: &Self)

impl Debug for Dynamic

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

impl Dim for Dynamic

fn try_to_usize() -> Option<usize>

fn from_usize(dim: usize) -> Dynamic

fn value(&self) -> usize

fn is<D>() -> boolwhere D: Dim,

impl<D> DimAdd<D> for Dynamicwhere D: Dim,

type Output = Dynamic

fn add(self, other: D) -> Dynamic

impl<D> DimDiv<D> for Dynamicwhere D: Dim,

type Output = Dynamic

fn div(self, other: D) -> Dynamic

impl<D> DimEq<D, Dynamic> for ShapeConstraintwhere D: DimName,

type Representative = D

impl<D> DimEq<Dynamic, D> for ShapeConstraintwhere D: DimName,

type Representative = D

impl<D> DimMax<D> for Dynamicwhere D: Dim,

type Output = Dynamic

fn max(self, other: D) -> Dynamic

impl<D> DimMin<D> for Dynamicwhere D: Dim,

type Output = Dynamic

fn min(self, other: D) -> Dynamic

impl<D> DimMul<D> for Dynamicwhere D: Dim,

type Output = Dynamic

fn mul(self, other: D) -> Dynamic

impl<D> DimSub<D> for Dynamicwhere D: Dim,

type Output = Dynamic

fn sub(self, other: D) -> Dynamic

impl PartialEq<Dynamic> for Dynamic

fn eq(&self, other: &Dynamic) -> bool

fn ne(&self, other: &Rhs) -> bool

impl<T, C> RawStorage<T, Dynamic, C> for VecStorage<T, Dynamic, C>where C: Dim,

type RStride = Const<1>

type CStride = Dynamic

fn ptr(&self) -> *const T

fn shape(&self) -> (Dynamic, C)

fn strides( &self) -> (<VecStorage<T, Dynamic, C> as RawStorage<T, Dynamic, C>>::RStride, <VecStorage<T, Dynamic, C> as RawStorage<T, Dynamic, C>>::CStride)

fn is_contiguous(&self) -> bool

unsafe fn as_slice_unchecked(&self) -> &[T] ⓘ

fn linear_index(&self, irow: usize, icol: usize) -> usize

fn get_address_unchecked_linear(&self, i: usize) -> *const T

fn get_address_unchecked(&self, irow: usize, icol: usize) -> *const T

unsafe fn get_unchecked_linear(&self, i: usize) -> &T

unsafe fn get_unchecked(&self, irow: usize, icol: usize) -> &T

impl<T, R> RawStorage<T, R, Dynamic> for VecStorage<T, R, Dynamic>where R: DimName,

type RStride = Const<1>

type CStride = R

fn ptr(&self) -> *const T

fn shape(&self) -> (R, Dynamic)

fn strides( &self) -> (<VecStorage<T, R, Dynamic> as RawStorage<T, R, Dynamic>>::RStride, <VecStorage<T, R, Dynamic> as RawStorage<T, R, Dynamic>>::CStride)

fn is_contiguous(&self) -> bool

unsafe fn as_slice_unchecked(&self) -> &[T] ⓘ

fn linear_index(&self, irow: usize, icol: usize) -> usize

fn get_address_unchecked_linear(&self, i: usize) -> *const T

impl<T, C> Allocator<T, Dynamic, C> for DefaultAllocatorwhere
T: Scalar,
C: Dim,

fn allocate_uninit(
nrows: Dynamic,
ncols: C
) -> VecStorage<MaybeUninit<T>, Dynamic, C>

unsafe fn assume_init(
uninit: VecStorage<MaybeUninit<T>, Dynamic, C>
) -> VecStorage<T, Dynamic, C>

fn allocate_from_iterator<I>(
nrows: Dynamic,
ncols: C,
iter: I
) -> <DefaultAllocator as Allocator<T, Dynamic, C>>::Bufferwhere
I: IntoIterator<Item = T>,

fn allocate_from_row_iterator<I>(nrows: R, ncols: C, iter: I) -> Self::Bufferwhere
I: IntoIterator<Item = T>,

impl<T, R> Allocator<T, R, Dynamic> for DefaultAllocatorwhere
T: Scalar,
R: DimName,

fn allocate_uninit(
nrows: R,
ncols: Dynamic
) -> VecStorage<MaybeUninit<T>, R, Dynamic>

unsafe fn assume_init(
uninit: VecStorage<MaybeUninit<T>, R, Dynamic>
) -> VecStorage<T, R, Dynamic>

fn allocate_from_iterator<I>(
nrows: R,
ncols: Dynamic,
iter: I
) -> <DefaultAllocator as Allocator<T, R, Dynamic>>::Bufferwhere
I: IntoIterator<Item = T>,

fn allocate_from_row_iterator<I>(nrows: R, ncols: C, iter: I) -> Self::Bufferwhere
I: IntoIterator<Item = T>,

fn is<D>() -> boolwhere
D: Dim,

impl<D> DimAdd<D> for Dynamicwhere
D: Dim,

impl<D> DimDiv<D> for Dynamicwhere
D: Dim,

impl<D> DimEq<D, Dynamic> for ShapeConstraintwhere
D: DimName,

impl<D> DimEq<Dynamic, D> for ShapeConstraintwhere
D: DimName,

impl<D> DimMax<D> for Dynamicwhere
D: Dim,

impl<D> DimMin<D> for Dynamicwhere
D: Dim,

impl<D> DimMul<D> for Dynamicwhere
D: Dim,

impl<D> DimSub<D> for Dynamicwhere
D: Dim,

impl<T, C> RawStorage<T, Dynamic, C> for VecStorage<T, Dynamic, C>where
C: Dim,

fn strides(
&self
) -> (<VecStorage<T, Dynamic, C> as RawStorage<T, Dynamic, C>>::RStride, <VecStorage<T, Dynamic, C> as RawStorage<T, Dynamic, C>>::CStride)

impl<T, R> RawStorage<T, R, Dynamic> for VecStorage<T, R, Dynamic>where
R: DimName,

fn strides(
&self
) -> (<VecStorage<T, R, Dynamic> as RawStorage<T, R, Dynamic>>::RStride, <VecStorage<T, R, Dynamic> as RawStorage<T, R, Dynamic>>::CStride)

impl<T, C> RawStorageMut<T, Dynamic, C> for VecStorage<T, Dynamic, C>where
C: Dim,

unsafe fn swap_unchecked(
&mut self,
row_col1: (usize, usize),
row_col2: (usize, usize)
)

impl<T, R> RawStorageMut<T, R, Dynamic> for VecStorage<T, R, Dynamic>where
R: DimName,

unsafe fn swap_unchecked(
&mut self,
row_col1: (usize, usize),
row_col2: (usize, usize)
)

impl<T, CTo, const RFROM: usize, const CFROM: usize> Reallocator<T, Const<RFROM>, Const<CFROM>, Dynamic, CTo> for DefaultAllocatorwhere
T: Scalar,
CTo: Dim,

unsafe fn reallocate_copy(
rto: Dynamic,
cto: CTo,
buf: ArrayStorage<T, RFROM, CFROM>
) -> VecStorage<MaybeUninit<T>, Dynamic, CTo>

impl<T, RTo, const RFROM: usize, const CFROM: usize> Reallocator<T, Const<RFROM>, Const<CFROM>, RTo, Dynamic> for DefaultAllocatorwhere
T: Scalar,
RTo: DimName,

unsafe fn reallocate_copy(
rto: RTo,
cto: Dynamic,
buf: ArrayStorage<T, RFROM, CFROM>
) -> VecStorage<MaybeUninit<T>, RTo, Dynamic>

impl<T, CFrom, CTo> Reallocator<T, Dynamic, CFrom, Dynamic, CTo> for DefaultAllocatorwhere
T: Scalar,
CFrom: Dim,
CTo: Dim,

unsafe fn reallocate_copy(
rto: Dynamic,
cto: CTo,
buf: VecStorage<T, Dynamic, CFrom>
) -> VecStorage<MaybeUninit<T>, Dynamic, CTo>

impl<T, CFrom, RTo> Reallocator<T, Dynamic, CFrom, RTo, Dynamic> for DefaultAllocatorwhere
T: Scalar,
CFrom: Dim,
RTo: DimName,

unsafe fn reallocate_copy(
rto: RTo,
cto: Dynamic,
buf: VecStorage<T, Dynamic, CFrom>
) -> VecStorage<MaybeUninit<T>, RTo, Dynamic>

impl<T, RFrom, CTo> Reallocator<T, RFrom, Dynamic, Dynamic, CTo> for DefaultAllocatorwhere
T: Scalar,
RFrom: DimName,
CTo: Dim,

unsafe fn reallocate_copy(
rto: Dynamic,
cto: CTo,
buf: VecStorage<T, RFrom, Dynamic>
) -> VecStorage<MaybeUninit<T>, Dynamic, CTo>

impl<T, RFrom, RTo> Reallocator<T, RFrom, Dynamic, RTo, Dynamic> for DefaultAllocatorwhere
T: Scalar,
RFrom: DimName,
RTo: DimName,

unsafe fn reallocate_copy(
rto: RTo,
cto: Dynamic,
buf: VecStorage<T, RFrom, Dynamic>
) -> VecStorage<MaybeUninit<T>, RTo, Dynamic>

impl<T, C1, C2> ReshapableStorage<T, Dynamic, C1, Dynamic, C2> for VecStorage<T, Dynamic, C1>where
T: Scalar,
C1: Dim,
C2: Dim,

fn reshape_generic(
self,
nrows: Dynamic,
ncols: C2
) -> <VecStorage<T, Dynamic, C1> as ReshapableStorage<T, Dynamic, C1, Dynamic, C2>>::Output

impl<T, C1, R2> ReshapableStorage<T, Dynamic, C1, R2, Dynamic> for VecStorage<T, Dynamic, C1>where
T: Scalar,
C1: Dim,
R2: DimName,

fn reshape_generic(
self,
nrows: R2,
ncols: Dynamic
) -> <VecStorage<T, Dynamic, C1> as ReshapableStorage<T, Dynamic, C1, R2, Dynamic>>::Output

impl<T, R1, C2> ReshapableStorage<T, R1, Dynamic, Dynamic, C2> for VecStorage<T, R1, Dynamic>where
T: Scalar,
R1: DimName,
C2: Dim,

fn reshape_generic(
self,
nrows: Dynamic,
ncols: C2
) -> <VecStorage<T, R1, Dynamic> as ReshapableStorage<T, R1, Dynamic, Dynamic, C2>>::Output

impl<T, R1, R2> ReshapableStorage<T, R1, Dynamic, R2, Dynamic> for VecStorage<T, R1, Dynamic>where
T: Scalar,
R1: DimName,
R2: DimName,

fn reshape_generic(
self,
nrows: R2,
ncols: Dynamic
) -> <VecStorage<T, R1, Dynamic> as ReshapableStorage<T, R1, Dynamic, R2, Dynamic>>::Output

impl<D> SameDimension<D, Dynamic> for ShapeConstraintwhere
D: DimName,

impl<D> SameDimension<Dynamic, D> for ShapeConstraintwhere
D: DimName,

impl<D> SameNumberOfColumns<D, Dynamic> for ShapeConstraintwhere
D: DimName,

impl<D> SameNumberOfColumns<Dynamic, D> for ShapeConstraintwhere
D: DimName,

impl<D> SameNumberOfRows<D, Dynamic> for ShapeConstraintwhere
D: DimName,

impl<D> SameNumberOfRows<Dynamic, D> for ShapeConstraintwhere
D: DimName,

impl<T, C> Storage<T, Dynamic, C> for VecStorage<T, Dynamic, C>where
T: Scalar,
C: Dim,
DefaultAllocator: Allocator<T, Dynamic, C, Buffer = VecStorage<T, Dynamic, C>>,

fn into_owned(self) -> <DefaultAllocator as Allocator<T, Dynamic, C>>::Bufferwhere
DefaultAllocator: Allocator<T, Dynamic, C>,

fn clone_owned(&self) -> <DefaultAllocator as Allocator<T, Dynamic, C>>::Bufferwhere
DefaultAllocator: Allocator<T, Dynamic, C>,

impl<T, R> Storage<T, R, Dynamic> for VecStorage<T, R, Dynamic>where
T: Scalar,
R: DimName,
DefaultAllocator: Allocator<T, R, Dynamic, Buffer = VecStorage<T, R, Dynamic>>,

fn into_owned(self) -> <DefaultAllocator as Allocator<T, R, Dynamic>>::Bufferwhere
DefaultAllocator: Allocator<T, R, Dynamic>,

fn clone_owned(&self) -> <DefaultAllocator as Allocator<T, R, Dynamic>>::Bufferwhere
DefaultAllocator: Allocator<T, R, Dynamic>,