Struct jumpy::core::physics::rapier::nalgebra::base::dimension::Dyn

source ·
pub struct Dyn(pub usize);
Expand description

Dim of dynamically-sized algebraic entities.

Tuple Fields§

§0: usize

Implementations§

source§

impl Dyn

source

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

👎Deprecated: use Dyn(value) instead.

A dynamic size equal to value.

Trait Implementations§

source§

impl Add<usize> for Dyn

§

type Output = Dyn

The resulting type after applying the + operator.
source§

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

Performs the + operation. Read more
source§

impl<T, C> Allocator<T, Dyn, C> for DefaultAllocator
where T: Scalar, C: Dim,

§

type Buffer = VecStorage<T, Dyn, C>

The type of buffer this allocator can instantiate.
§

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

The type of buffer with uninitialized components this allocator can instantiate.
source§

fn allocate_uninit(nrows: Dyn, ncols: C) -> VecStorage<MaybeUninit<T>, Dyn, 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>, Dyn, C>, ) -> VecStorage<T, Dyn, C>

Assumes a data buffer to be initialized. Read more
source§

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

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

fn allocate_from_row_iterator<I>(nrows: R, ncols: C, iter: I) -> Self::Buffer
where 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, Dyn> for DefaultAllocator
where T: Scalar, R: DimName,

§

type Buffer = VecStorage<T, R, Dyn>

The type of buffer this allocator can instantiate.
§

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

The type of buffer with uninitialized components this allocator can instantiate.
source§

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

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, Dyn>, ) -> VecStorage<T, R, Dyn>

Assumes a data buffer to be initialized. Read more
source§

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

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

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

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

impl Clone for Dyn

source§

fn clone(&self) -> Dyn

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 Dyn

source§

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

Formats the value using the given formatter. Read more
source§

impl Dim for Dyn

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 = Dyn.
source§

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

Gets the run-time value of self. For type-level integers, this is the same as Self::try_to_usize().unwrap().
source§

fn is<D>() -> bool
where D: Dim,

source§

impl<D> DimAdd<D> for Dyn
where D: Dim,

§

type Output = Dyn

source§

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

source§

impl<D> DimDiv<D> for Dyn
where D: Dim,

§

type Output = Dyn

source§

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

source§

impl<D> DimEq<D, Dyn> for ShapeConstraint
where 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.
source§

impl<D> DimEq<Dyn, D> for ShapeConstraint
where 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.
source§

impl<D> DimMax<D> for Dyn
where D: Dim,

§

type Output = Dyn

source§

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

source§

impl<D> DimMin<D> for Dyn
where D: Dim,

§

type Output = Dyn

source§

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

source§

impl<D> DimMul<D> for Dyn
where D: Dim,

§

type Output = Dyn

source§

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

source§

impl<D> DimSub<D> for Dyn
where D: Dim,

§

type Output = Dyn

source§

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

source§

impl PartialEq for Dyn

source§

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

This method tests for self and other values to be equal, and is used by ==.
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.
source§

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

§

type RStride = Const<1>

The static stride of this storage’s rows.
§

type CStride = Dyn

The static stride of this storage’s columns.
source§

fn ptr(&self) -> *const T

The matrix data pointer.
source§

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)

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, Dyn> for VecStorage<T, R, Dyn>
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, 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)

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, Dyn, C> for VecStorage<T, Dyn, 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, Dyn> for VecStorage<T, R, Dyn>
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>, Dyn, CTo> for DefaultAllocator
where T: Scalar, CTo: Dim,

source§

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 more
source§

impl<T, RTo, const RFROM: usize, const CFROM: usize> Reallocator<T, Const<RFROM>, Const<CFROM>, RTo, Dyn> for DefaultAllocator
where T: Scalar, RTo: DimName,

source§

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 more
source§

impl<T, CFrom, CTo> Reallocator<T, Dyn, CFrom, Dyn, CTo> for DefaultAllocator
where T: Scalar, CFrom: Dim, CTo: Dim,

source§

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 more
source§

impl<T, CFrom, RTo> Reallocator<T, Dyn, CFrom, RTo, Dyn> for DefaultAllocator
where T: Scalar, CFrom: Dim, RTo: DimName,

source§

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 more
source§

impl<T, RFrom, CTo> Reallocator<T, RFrom, Dyn, Dyn, CTo> for DefaultAllocator
where T: Scalar, RFrom: DimName, CTo: Dim,

source§

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 more
source§

impl<T, RFrom, RTo> Reallocator<T, RFrom, Dyn, RTo, Dyn> for DefaultAllocator
where T: Scalar, RFrom: DimName, RTo: DimName,

source§

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 more
source§

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

§

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

Reshapes the storage into the output storage type.
source§

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

§

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

Reshapes the storage into the output storage type.
source§

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

§

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

Reshapes the storage into the output storage type.
source§

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

§

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

Reshapes the storage into the output storage type.
source§

impl<D> SameDimension<D, Dyn> for ShapeConstraint
where 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.
source§

impl<D> SameDimension<Dyn, D> for ShapeConstraint
where 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.
source§

impl<D> SameNumberOfColumns<D, Dyn> for ShapeConstraint
where 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.
source§

impl<D> SameNumberOfColumns<Dyn, D> for ShapeConstraint
where 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.
source§

impl<D> SameNumberOfRows<D, Dyn> for ShapeConstraint
where 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.
source§

impl<D> SameNumberOfRows<Dyn, D> for ShapeConstraint
where 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.
source§

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

source§

fn into_owned(self) -> <DefaultAllocator as Allocator<T, Dyn, C>>::Buffer

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

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

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

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

source§

fn into_owned(self) -> <DefaultAllocator as Allocator<T, R, Dyn>>::Buffer

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

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

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

impl Sub<usize> for Dyn

§

type Output = Dyn

The resulting type after applying the - operator.
source§

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

Performs the - operation. Read more
source§

impl Copy for Dyn

source§

impl Eq for Dyn

source§

impl IsDynamic for Dyn

source§

impl IsNotStaticOne for Dyn

source§

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> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
§

impl<T> AnyEq for T
where T: Any + PartialEq,

§

fn equals(&self, other: &(dyn Any + 'static)) -> bool

§

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

§

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

§

fn as_bind_group_shader_type(&self, _images: &RenderAssets<Image>) -> U

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

impl<'a, T, E> AsTaggedExplicit<'a, E> for T
where T: 'a,

§

fn explicit(self, class: Class, tag: u32) -> TaggedParser<'a, Explicit, Self, E>

§

impl<'a, T, E> AsTaggedImplicit<'a, E> for T
where T: 'a,

§

fn implicit( self, class: Class, constructed: bool, tag: u32, ) -> TaggedParser<'a, Implicit, Self, E>

source§

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

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> CloneToUninit for T
where T: Copy,

source§

unsafe fn clone_to_uninit(&self, dst: *mut T)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dst. Read more
source§

impl<T> CloneToUninit for T
where T: Clone,

source§

default unsafe fn clone_to_uninit(&self, dst: *mut T)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dst. Read more
§

impl<T> Conv for T

§

fn conv<T>(self) -> T
where Self: Into<T>,

Converts self into T using Into<T>. Read more
source§

impl<D> DimAdd<Dyn> for D
where D: DimName,

§

type Output = Dyn

source§

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

source§

impl<D> DimDiv<Dyn> for D
where D: DimName,

§

type Output = Dyn

source§

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

source§

impl<D> DimMax<Dyn> for D
where D: DimName,

§

type Output = Dyn

source§

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

source§

impl<D> DimMin<Dyn> for D
where D: DimName,

§

type Output = Dyn

source§

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

source§

impl<D> DimMul<Dyn> for D
where D: DimName,

§

type Output = Dyn

source§

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

source§

impl<D> DimSub<Dyn> for D
where D: DimName,

§

type Output = Dyn

source§

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

§

impl<T> Downcast<T> for T

§

fn downcast(&self) -> &T

§

impl<T> Downcast for T
where T: Any,

§

fn into_any(self: Box<T>) -> Box<dyn 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.
§

fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>

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)

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)

Convert &mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot generate &mut Any’s vtable from &mut Trait’s.
§

impl<T> DowncastSync for T
where T: Any + Send + Sync,

§

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

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

impl<T> DynClone for T
where T: Clone,

§

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

§

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

Casts the type to dyn Any.
§

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

This method tests for self and other values to be equal. Read more
§

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

§

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
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

§

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

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

impl<Q, K> Equivalent<K> for Q
where 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.
§

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

§

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

§

impl<T> FmtForward for T

§

fn fmt_binary(self) -> FmtBinary<Self>
where Self: Binary,

Causes self to use its Binary implementation when Debug-formatted.
§

fn fmt_display(self) -> FmtDisplay<Self>
where Self: Display,

Causes self to use its Display implementation when Debug-formatted.
§

fn fmt_lower_exp(self) -> FmtLowerExp<Self>
where Self: LowerExp,

Causes self to use its LowerExp implementation when Debug-formatted.
§

fn fmt_lower_hex(self) -> FmtLowerHex<Self>
where Self: LowerHex,

Causes self to use its LowerHex implementation when Debug-formatted.
§

fn fmt_octal(self) -> FmtOctal<Self>
where Self: Octal,

Causes self to use its Octal implementation when Debug-formatted.
§

fn fmt_pointer(self) -> FmtPointer<Self>
where Self: Pointer,

Causes self to use its Pointer implementation when Debug-formatted.
§

fn fmt_upper_exp(self) -> FmtUpperExp<Self>
where Self: UpperExp,

Causes self to use its UpperExp implementation when Debug-formatted.
§

fn fmt_upper_hex(self) -> FmtUpperHex<Self>
where Self: UpperHex,

Causes self to use its UpperHex implementation when Debug-formatted.
§

fn fmt_list(self) -> FmtList<Self>
where &'a Self: for<'a> IntoIterator,

Formats each item in a sequence. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

§

impl<S> FromSample<S> for S

§

fn from_sample_(s: S) -> S

§

impl<T> Instrument for T

§

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

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

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<U> for T
where U: From<T>,

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.

source§

impl<T> IntoEither for T

source§

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 more
source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

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<F, T> IntoSample<T> for F
where T: FromSample<F>,

§

fn into_sample(self) -> T

§

impl<T> Pipe for T
where T: ?Sized,

§

fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> R
where Self: Sized,

Pipes by value. This is generally the method you want to use. Read more
§

fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> R
where R: 'a,

Borrows self and passes that borrow into the pipe function. Read more
§

fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> R
where R: 'a,

Mutably borrows self and passes that borrow into the pipe function. Read more
§

fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R
where Self: Borrow<B>, B: 'a + ?Sized, R: 'a,

Borrows self, then passes self.borrow() into the pipe function. Read more
§

fn pipe_borrow_mut<'a, B, R>( &'a mut self, func: impl FnOnce(&'a mut B) -> R, ) -> R
where Self: BorrowMut<B>, B: 'a + ?Sized, R: 'a,

Mutably borrows self, then passes self.borrow_mut() into the pipe function. Read more
§

fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
where Self: AsRef<U>, U: 'a + ?Sized, R: 'a,

Borrows self, then passes self.as_ref() into the pipe function.
§

fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R
where Self: AsMut<U>, U: 'a + ?Sized, R: 'a,

Mutably borrows self, then passes self.as_mut() into the pipe function.
§

fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
where Self: Deref<Target = T>, T: 'a + ?Sized, R: 'a,

Borrows self, then passes self.deref() into the pipe function.
§

fn pipe_deref_mut<'a, T, R>( &'a mut self, func: impl FnOnce(&'a mut T) -> R, ) -> R
where Self: DerefMut<Target = T> + Deref, T: 'a + ?Sized, R: 'a,

Mutably borrows self, then passes self.deref_mut() into the pipe function.
§

impl<T> Pointable for T

§

const ALIGN: usize = _

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
§

impl<T> RawClone for T
where T: Clone,

§

unsafe fn raw_clone(src: *const c_void, dst: *mut c_void)

Write the default value of the type to the pointer. Read more
§

fn raw_clone_cb() -> Unsafe<&'static (dyn Fn(*const c_void, *mut c_void) + Send + Sync)>

Get a callback suitable for [SchemaData].
§

impl<T> RawDrop for T

§

unsafe fn raw_drop(ptr: *mut c_void)

Write the default value of the type to the pointer. Read more
§

fn raw_drop_cb() -> Unsafe<&'static (dyn Fn(*mut c_void) + Send + Sync)>

Get a callback suitable for [SchemaData].
§

impl<T> RawEq for T
where T: Eq,

§

unsafe fn raw_eq(a: *const c_void, b: *const c_void) -> bool

Get the hash of the type. Read more
§

fn raw_eq_cb() -> Unsafe<&'static (dyn Fn(*const c_void, *const c_void) -> bool + Send + Sync)>

Get a callback suitable for [SchemaData].
source§

impl<T> Same for T

§

type Output = T

Should always be Self
§

impl<SS, SP> SupersetOf<SS> for SP
where 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.
§

impl<T> Tap for T

§

fn tap(self, func: impl FnOnce(&Self)) -> Self

Immutable access to a value. Read more
§

fn tap_mut(self, func: impl FnOnce(&mut Self)) -> Self

Mutable access to a value. Read more
§

fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
where Self: Borrow<B>, B: ?Sized,

Immutable access to the Borrow<B> of a value. Read more
§

fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
where Self: BorrowMut<B>, B: ?Sized,

Mutable access to the BorrowMut<B> of a value. Read more
§

fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
where Self: AsRef<R>, R: ?Sized,

Immutable access to the AsRef<R> view of a value. Read more
§

fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
where Self: AsMut<R>, R: ?Sized,

Mutable access to the AsMut<R> view of a value. Read more
§

fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
where Self: Deref<Target = T>, T: ?Sized,

Immutable access to the Deref::Target of a value. Read more
§

fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
where Self: DerefMut<Target = T> + Deref, T: ?Sized,

Mutable access to the Deref::Target of a value. Read more
§

fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self

Calls .tap() only in debug builds, and is erased in release builds.
§

fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self

Calls .tap_mut() only in debug builds, and is erased in release builds.
§

fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
where Self: Borrow<B>, B: ?Sized,

Calls .tap_borrow() only in debug builds, and is erased in release builds.
§

fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
where Self: BorrowMut<B>, B: ?Sized,

Calls .tap_borrow_mut() only in debug builds, and is erased in release builds.
§

fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
where Self: AsRef<R>, R: ?Sized,

Calls .tap_ref() only in debug builds, and is erased in release builds.
§

fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
where Self: AsMut<R>, R: ?Sized,

Calls .tap_ref_mut() only in debug builds, and is erased in release builds.
§

fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
where Self: Deref<Target = T>, T: ?Sized,

Calls .tap_deref() only in debug builds, and is erased in release builds.
§

fn tap_deref_mut_dbg<T>(self, func: impl FnOnce(&mut T)) -> Self
where Self: DerefMut<Target = T> + Deref, T: ?Sized,

Calls .tap_deref_mut() only in debug builds, and is erased in release builds.
source§

impl<T> ToOwned for T
where 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
§

impl<Q> ToOwnedEquivalent<<Q as ToOwned>::Owned> for Q
where Q: ToOwned + Eq + ?Sized,

§

fn to_owned_equivalent(&self) -> <Q as ToOwned>::Owned

§

impl<T, U> ToSample<U> for T
where U: FromSample<T>,

§

fn to_sample_(self) -> U

§

impl<T> TryConv for T

§

fn try_conv<T>(self) -> Result<T, Self::Error>
where Self: TryInto<T>,

Attempts to convert self into T using TryInto<T>. Read more
source§

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

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

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

Performs the conversion.
source§

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

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

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

Performs the conversion.
§

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

§

fn clone_type_data(&self) -> Box<dyn TypeData>

§

impl<T> Upcast<T> for T

§

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

§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

§

fn vzip(self) -> V

§

impl<T> WithSubscriber for T

§

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
§

fn with_current_subscriber(self) -> WithDispatch<Self>

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

impl<S, T> Duplex<S> for T
where T: FromSample<S> + ToSample<S>,

source§

impl<T> Scalar for T
where T: 'static + Clone + PartialEq + Debug,

§

impl<T> SerializableAny for T
where T: 'static + Any + Clone + for<'a> Send + Sync,