Dyn in nalgebra::base::dimension - Rust
Description: Dim of dynamically-sized algebraic entities.
Keywords: rust, rustlang, rust-lang, Dyn

# Struct 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) -> Self

👎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) -> Self

Performs the `+` operation. Read more
source§

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

§

#### type Buffer = VecStorage<T, Dyn, C>

The type of buffer this allocator can instanciate.
§

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

The type of buffer with uninitialized components this allocator can instanciate.
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: IntoIterator<Item = T>>(
nrows: Dyn,
ncols: C,
iter: I
) -> Self::Buffer

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

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

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

### impl<T: Scalar, R: DimName> Allocator<T, R, Dyn> for DefaultAllocator

§

#### type Buffer = VecStorage<T, R, Dyn>

The type of buffer this allocator can instanciate.
§

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

The type of buffer with uninitialized components this allocator can instanciate.
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: IntoIterator<Item = T>>(
nrows: R,
ncols: Dyn,
iter: I
) -> Self::Buffer

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

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

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

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`. Read more
source§

#### 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()`. 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: Dim>() -> bool

source§

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

§

#### type Output = Dyn

source§

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

source§

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

§

#### type Output = Dyn

source§

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

source§

### 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. Read more
source§

### 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. Read more
source§

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

§

#### type Output = Dyn

source§

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

source§

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

§

#### type Output = Dyn

source§

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

source§

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

§

#### type Output = Dyn

source§

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

source§

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

§

#### type Output = Dyn

source§

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

source§

### impl PartialEq<Dyn> for Dyn

source§

#### fn eq(&self, other: &Dyn) -> 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: 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.
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`. Read more
source§

#### fn strides(&self) -> (Self::RStride, Self::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: 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.
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`. Read more
source§

#### fn strides(&self) -> (Self::RStride, Self::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: Dim> RawStorageMut<T, Dyn, C> for VecStorage<T, Dyn, C>

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: DimName> RawStorageMut<T, R, Dyn> for VecStorage<T, R, Dyn>

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: Scalar, CTo, const RFROM: usize, const CFROM: usize> Reallocator<T, Const<RFROM>, Const<CFROM>, Dyn, CTo> for DefaultAllocator where
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: Scalar, RTo, const RFROM: usize, const CFROM: usize> Reallocator<T, Const<RFROM>, Const<CFROM>, RTo, Dyn> for DefaultAllocator where
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: Scalar, CFrom: Dim, CTo: Dim> Reallocator<T, Dyn, CFrom, Dyn, CTo> for DefaultAllocator

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: Scalar, CFrom: Dim, RTo: DimName> Reallocator<T, Dyn, CFrom, RTo, Dyn> for DefaultAllocator

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: Scalar, RFrom: DimName, CTo: Dim> Reallocator<T, RFrom, Dyn, Dyn, CTo> for DefaultAllocator

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: Scalar, RFrom: DimName, RTo: DimName> Reallocator<T, RFrom, Dyn, RTo, Dyn> for DefaultAllocator

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) -> Self::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) -> Self::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) -> Self::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) -> Self::Output

Reshapes the storage into the output storage type.
source§

### 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. Read more
source§

### 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. Read more
source§

### 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. Read more
source§

### 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. Read more
source§

### 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. Read more
source§

### 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. Read more
source§

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

source§

#### fn into_owned(self) -> Owned<T, Dyn, C>where
DefaultAllocator: Allocator<T, Dyn, C>,

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

#### fn clone_owned(&self) -> Owned<T, Dyn, C>where
DefaultAllocator: Allocator<T, Dyn, C>,

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

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

source§

#### fn into_owned(self) -> Owned<T, R, Dyn>where
DefaultAllocator: Allocator<T, R, Dyn>,

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

#### fn clone_owned(&self) -> Owned<T, R, Dyn>where
DefaultAllocator: Allocator<T, R, Dyn>,

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) -> Self

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 StructuralEq for Dyn

source§

### impl StructuralPartialEq for Dyn

## Auto Trait Implementations§

§

### 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 Twhere
T: 'static + ?Sized,

source§

#### fn type_id(&self) -> TypeId

Gets the `TypeId` of `self`. 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<Dyn> for Dwhere
D: DimName,

§

#### type Output = Dyn

source§

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

source§

### impl<D> DimDiv<Dyn> for Dwhere
D: DimName,

§

#### type Output = Dyn

source§

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

source§

### impl<D> DimMax<Dyn> for Dwhere
D: DimName,

§

#### type Output = Dyn

source§

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

source§

### impl<D> DimMin<Dyn> for Dwhere
D: DimName,

§

#### type Output = Dyn

source§

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

source§

### impl<D> DimMul<Dyn> for Dwhere
D: DimName,

§

#### type Output = Dyn

source§

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

source§

### impl<D> DimSub<Dyn> for Dwhere
D: DimName,

§

#### type Output = Dyn

source§

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

source§

### impl<T> From<T> for T

const: unstable · source§

#### fn from(t: T) -> T

Returns the argument unchanged.

source§

### impl<T, U> Into<U> 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.

source§

### impl<T> Same<T> for T

§

#### type Output = T

Should always be `Self`
source§

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

source§

#### fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct `self` from the equivalent element of its superset. Read more
source§

#### fn is_in_subset(&self) -> bool

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

#### fn to_subset_unchecked(&self) -> SS

Use with care! Same as `self.to_subset` but without any property checks. Always succeeds.
source§

#### 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<U> 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<U>>::Error>

Performs the conversion.
source§

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

§

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

The type returned in the event of a conversion error.
const: unstable · source§

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

Performs the conversion.