Struct nalgebra::base::ArrayStorage

source ·
#[repr(transparent)]
pub struct ArrayStorage<T, const R: usize, const C: usize>(pub [[T; R]; C]);
Expand description

An array-based statically sized matrix data storage.

Tuple Fields§

§0: [[T; R]; C]

Implementations§

source§

impl<T, const R: usize, const C: usize> ArrayStorage<T, R, C>

source

pub fn as_slice(&self) -> &[T]

Converts this array storage to a slice.

source

pub fn as_mut_slice(&mut self) -> &mut [T]

Converts this array storage to a mutable slice.

Trait Implementations§

source§

impl<T: Clone, const R: usize, const C: usize> Clone for ArrayStorage<T, R, C>

source§

fn clone(&self) -> ArrayStorage<T, R, C>

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<T: Debug, const R: usize, const C: usize> Debug for ArrayStorage<T, R, C>

source§

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

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

impl<T: Default, const R: usize, const C: usize> Default for ArrayStorage<T, R, C>
where [[T; R]; C]: Default,

source§

fn default() -> Self

Returns the “default value” for a type. Read more
source§

impl<T: Hash, const R: usize, const C: usize> Hash for ArrayStorage<T, R, C>

source§

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher. Read more
1.3.0 · source§

fn hash_slice<H>(data: &[Self], state: &mut H)
where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher. Read more
source§

impl<T: PartialEq, const R: usize, const C: usize> PartialEq for ArrayStorage<T, R, C>

source§

fn eq(&self, other: &ArrayStorage<T, R, C>) -> 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, const R: usize, const C: usize> RawStorage<T, Const<R>, Const<C>> for ArrayStorage<T, R, C>

§

type RStride = Const<1>

The static stride of this storage’s rows.
§

type CStride = Const<R>

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

fn ptr(&self) -> *const T

The matrix data pointer.
source§

fn shape(&self) -> (Const<R>, Const<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) -> (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, const R: usize, const C: usize> RawStorageMut<T, Const<R>, Const<C>> for ArrayStorage<T, R, 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, const R1: usize, const C1: usize, const R2: usize, const C2: usize> ReshapableStorage<T, Const<R1>, Const<C1>, Const<R2>, Const<C2>> for ArrayStorage<T, R1, C1>
where T: Scalar, Const<R1>: ToTypenum, Const<C1>: ToTypenum, Const<R2>: ToTypenum, Const<C2>: ToTypenum, <Const<R1> as ToTypenum>::Typenum: Mul<<Const<C1> as ToTypenum>::Typenum>, <Const<R2> as ToTypenum>::Typenum: Mul<<Const<C2> as ToTypenum>::Typenum, Output = Prod<<Const<R1> as ToTypenum>::Typenum, <Const<C1> as ToTypenum>::Typenum>>,

§

type Output = ArrayStorage<T, R2, C2>

The reshaped storage type.
source§

fn reshape_generic(self, _: Const<R2>, _: Const<C2>) -> Self::Output

Reshapes the storage into the output storage type.
source§

impl<T: Scalar, const R: usize, const C: usize> Storage<T, Const<R>, Const<C>> for ArrayStorage<T, R, C>
where DefaultAllocator: Allocator<Const<R>, Const<C>, Buffer<T> = Self>,

source§

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

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

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

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

fn forget_elements(self)

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

impl<T: Copy, const R: usize, const C: usize> Copy for ArrayStorage<T, R, C>

source§

impl<T: Eq, const R: usize, const C: usize> Eq for ArrayStorage<T, R, C>

source§

impl<T, const R: usize, const C: usize> IsContiguous for ArrayStorage<T, R, C>

source§

impl<T, const R: usize, const C: usize> StructuralPartialEq for ArrayStorage<T, R, C>

Auto Trait Implementations§

§

impl<T, const R: usize, const C: usize> Freeze for ArrayStorage<T, R, C>
where T: Freeze,

§

impl<T, const R: usize, const C: usize> RefUnwindSafe for ArrayStorage<T, R, C>
where T: RefUnwindSafe,

§

impl<T, const R: usize, const C: usize> Send for ArrayStorage<T, R, C>
where T: Send,

§

impl<T, const R: usize, const C: usize> Sync for ArrayStorage<T, R, C>
where T: Sync,

§

impl<T, const R: usize, const C: usize> Unpin for ArrayStorage<T, R, C>
where T: Unpin,

§

impl<T, const R: usize, const C: usize> UnwindSafe for ArrayStorage<T, R, C>
where T: UnwindSafe,

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
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> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

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> Same for T

§

type Output = T

Should always be Self
source§

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

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

source§

impl<S, T, R, C> StorageMut<T, R, C> for S
where T: Scalar, R: Dim, C: Dim, S: Storage<T, R, C> + RawStorageMut<T, R, C>,