Struct Dyn

pub struct Dyn(pub usize);

Dim of dynamically-sized algebraic entities.

Tuple Fields

0: usize

Implementations

impl Dyn

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

👎Deprecated: use Dyn(value) instead.

A dynamic size equal to value.

Trait Implementations

impl Add<usize> for Dyn

type Output = Dyn

The resulting type after applying the + operator.

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

Performs the + operation.

impl<C: Dim> Allocator<Dyn, C> for DefaultAllocator

type Buffer<T: Scalar> = VecStorage<T, Dyn, C>

The type of buffer this allocator can instantiate.

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

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

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

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

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

Assumes a data buffer to be initialized.

fn allocate_from_iterator<T: Scalar, I: IntoIterator<Item = T>>( nrows: Dyn, ncols: C, iter: I, ) -> Self::Buffer<T>

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

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

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

impl<R: DimName> Allocator<R, Dyn> for DefaultAllocator

type Buffer<T: Scalar> = VecStorage<T, R, Dyn>

The type of buffer this allocator can instantiate.

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

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

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

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

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

Assumes a data buffer to be initialized.

fn allocate_from_iterator<T: Scalar, I: IntoIterator<Item = T>>( nrows: R, ncols: Dyn, iter: I, ) -> Self::Buffer<T>

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

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

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

impl Archive for Dyn

where usize: Archive,

type Archived = ArchivedDyn

The archived representation of this type.

type Resolver = DynResolver

The resolver for this type. It must contain all the additional information from serializing needed to make the archived type from the normal type.

unsafe fn resolve( &self, pos: usize, resolver: Self::Resolver, out: *mut Self::Archived, )

Creates the archived version of this value at the given position and writes it to the given output.

impl Clone for Dyn

fn clone(&self) -> Dyn

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for Dyn

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for Dyn

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<__D: Fallible + ?Sized> Deserialize<Dyn, __D> for Archived<Dyn>

where usize: Archive, Archived<usize>: Deserialize<usize, __D>,

fn deserialize(&self, deserializer: &mut __D) -> Result<Dyn, __D::Error>

Deserializes using the given deserializer

impl Dim for Dyn

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.

fn from_usize(dim: usize) -> Self

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 value(&self) -> usize

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

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

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

type Output = Dyn

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

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

type Output = Dyn

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

impl<D: DimName> DimEq<D, Dyn> for ShapeConstraint

type Representative = D

This is either equal to D1 or D2, always choosing the one (if any) which is a type-level constant.

fn representative(d1: D1, d2: D2) -> Option<Self::Representative>

This constructs a value of type Representative with the correct value

impl<D: DimName> DimEq<Dyn, D> for ShapeConstraint

type Representative = D

This is either equal to D1 or D2, always choosing the one (if any) which is a type-level constant.

fn representative(d1: D1, d2: D2) -> Option<Self::Representative>

This constructs a value of type Representative with the correct value

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

type Output = Dyn

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

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

type Output = Dyn

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

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

type Output = Dyn

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

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

type Output = Dyn

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

impl PartialEq for Dyn

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

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

type RStride = Const<1>

The static stride of this storage’s rows.

type CStride = Dyn

The static stride of this storage’s columns.

fn ptr(&self) -> *const T

The matrix data pointer.

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.

fn strides(&self) -> (Self::RStride, Self::CStride)

The spacing between consecutive row elements and consecutive column elements.

fn is_contiguous(&self) -> bool

Indicates whether this data buffer stores its elements contiguously.

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

Retrieves the data buffer as a contiguous slice.

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:

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

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

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

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

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

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

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

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

impl<T, R: DimName> RawStorage<T, R, Dyn> for VecStorage<T, R, Dyn>

type RStride = Const<1>

The static stride of this storage’s rows.

type CStride = R

The static stride of this storage’s columns.

fn ptr(&self) -> *const T

The matrix data pointer.

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.

fn strides(&self) -> (Self::RStride, Self::CStride)

The spacing between consecutive row elements and consecutive column elements.

fn is_contiguous(&self) -> bool

Indicates whether this data buffer stores its elements contiguously.

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

Retrieves the data buffer as a contiguous slice.

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:

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

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

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

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

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

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

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

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

impl<T, C: Dim> RawStorageMut<T, Dyn, C> for VecStorage<T, Dyn, C>

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

The matrix mutable data pointer.

unsafe fn as_mut_slice_unchecked(&mut self) -> &mut [T]

Retrieves the mutable data buffer as a contiguous slice.

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.

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.

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

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

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.

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

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

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

Swaps two elements without bound-checking.

impl<T, R: DimName> RawStorageMut<T, R, Dyn> for VecStorage<T, R, Dyn>

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

The matrix mutable data pointer.

unsafe fn as_mut_slice_unchecked(&mut self) -> &mut [T]

Retrieves the mutable data buffer as a contiguous slice.

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.

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.

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

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

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.

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

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

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

Swaps two elements without bound-checking.

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

where CTo: Dim,

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:

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

where RTo: DimName,

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:

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

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:

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

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:

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

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:

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

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:

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.

fn reshape_generic(self, nrows: Dyn, ncols: C2) -> Self::Output

Reshapes the storage into the output storage type.

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.

fn reshape_generic(self, nrows: R2, ncols: Dyn) -> Self::Output

Reshapes the storage into the output storage type.

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.

fn reshape_generic(self, nrows: Dyn, ncols: C2) -> Self::Output

Reshapes the storage into the output storage type.

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.

fn reshape_generic(self, nrows: R2, ncols: Dyn) -> Self::Output

Reshapes the storage into the output storage type.

impl<D: DimName> SameDimension<D, Dyn> for ShapeConstraint

type Representative = D

This is either equal to D1 or D2, always choosing the one (if any) which is a type-level constant.

impl<D: DimName> SameDimension<Dyn, D> for ShapeConstraint

type Representative = D

This is either equal to D1 or D2, always choosing the one (if any) which is a type-level constant.

impl<D: DimName> SameNumberOfColumns<D, Dyn> for ShapeConstraint

type Representative = D

This is either equal to D1 or D2, always choosing the one (if any) which is a type-level constant.

fn representative( d1: D1, d2: D2, ) -> Option<<Self as SameNumberOfColumns<D1, D2>>::Representative>

Returns a representative dimension instance if the two are equal, otherwise None.

impl<D: DimName> SameNumberOfColumns<Dyn, D> for ShapeConstraint

type Representative = D

This is either equal to D1 or D2, always choosing the one (if any) which is a type-level constant.

fn representative( d1: D1, d2: D2, ) -> Option<<Self as SameNumberOfColumns<D1, D2>>::Representative>

Returns a representative dimension instance if the two are equal, otherwise None.

impl<D: DimName> SameNumberOfRows<D, Dyn> for ShapeConstraint

type Representative = D

This is either equal to D1 or D2, always choosing the one (if any) which is a type-level constant.

fn representative( d1: D1, d2: D2, ) -> Option<<Self as SameNumberOfRows<D1, D2>>::Representative>

Returns a representative dimension instance if the two are equal, otherwise None.

impl<D: DimName> SameNumberOfRows<Dyn, D> for ShapeConstraint

type Representative = D

This is either equal to D1 or D2, always choosing the one (if any) which is a type-level constant.

fn representative( d1: D1, d2: D2, ) -> Option<<Self as SameNumberOfRows<D1, D2>>::Representative>

Returns a representative dimension instance if the two are equal, otherwise None.

impl<__S: Fallible + ?Sized> Serialize<__S> for Dyn

where usize: Serialize<__S>,

fn serialize(&self, serializer: &mut __S) -> Result<Self::Resolver, __S::Error>

Writes the dependencies for the object and returns a resolver that can create the archived type.

impl Serialize for Dyn

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>

where S: Serializer,

Serialize this value into the given Serde serializer.

impl<T: Scalar, C: Dim> Storage<T, Dyn, C> for VecStorage<T, Dyn, C>

where DefaultAllocator: Allocator<Dyn, C, Buffer<T> = Self>,

fn into_owned(self) -> Owned<T, Dyn, C>

where DefaultAllocator: Allocator<Dyn, C>,

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

fn clone_owned(&self) -> Owned<T, Dyn, C>

where DefaultAllocator: Allocator<Dyn, C>,

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

fn forget_elements(self)

Drops the storage without calling the destructors on the contained elements.

impl<T: Scalar, R: DimName> Storage<T, R, Dyn> for VecStorage<T, R, Dyn>

where DefaultAllocator: Allocator<R, Dyn, Buffer<T> = Self>,

fn into_owned(self) -> Owned<T, R, Dyn>

where DefaultAllocator: Allocator<R, Dyn>,

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

fn clone_owned(&self) -> Owned<T, R, Dyn>

where DefaultAllocator: Allocator<R, Dyn>,

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

fn forget_elements(self)

Drops the storage without calling the destructors on the contained elements.

impl Sub<usize> for Dyn

type Output = Dyn

The resulting type after applying the - operator.

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

Performs the - operation.

impl Copy for Dyn

impl Eq for Dyn

impl IsDynamic for Dyn

impl IsNotStaticOne for Dyn

impl StructuralPartialEq for Dyn