Struct nalgebra::base::ArrayStorage

source · [−]

#[repr(C)]
pub struct ArrayStorage<T, const R: usize, const C: usize>(pub [[T; R]; C]);

Expand description

A array-based statically sized matrix data storage.

Tuple Fields

0: [[T; R]; C]

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,

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

source

impl<T: PartialEq, const R: usize, const C: usize> PartialEq<ArrayStorage<T, R, C>> 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 ==. Read more

source

fn ne(&self, other: &ArrayStorage<T, R, C>) -> bool

This method tests for !=.

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, const R: usize, const C: usize> Storage<T, Const<R>, Const<C>> for ArrayStorage<T, R, C> where
T: Scalar,
DefaultAllocator: Allocator<T, Const<R>, Const<C>, Buffer = Self>,

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

source

fn into_owned(self) -> Owned<T, Const<R>, Const<C>> where
DefaultAllocator: Allocator<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>> where
DefaultAllocator: Allocator<T, Const<R>, Const<C>>,

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

source

fn as_slice(&self) -> &[T]ⓘNotable traits for &'_ [u8 ]`impl<'_> Read for &'_ [u8]impl<'_> Write for &'_ mut [u8]`

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

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

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

source

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

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

source

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

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

source

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

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

source

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

source

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

The matrix mutable data pointer.

source

fn as_mut_slice(&mut self) -> &mut [T]ⓘNotable traits for &'_ [u8 ]`impl<'_> Read for &'_ [u8]impl<'_> Write for &'_ mut [u8]`

Retrieves the mutable data buffer as a contiguous slice. Read more

source

unsafe 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.

source

unsafe 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.

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.

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.

source

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

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

source

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

Swaps two elements without bound-checking.

source

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

source

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

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

pub fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

source

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

const: unstable · source

pub fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

source

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

const: unstable · source

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

Mutably borrows from an owned value. Read more

source

impl<T> From<T> for T

const: unstable · source

pub fn from(t: T) -> T

Returns the argument unchanged.

source

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

const: unstable · source

pub 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 SP where
SS: SubsetOf<SP>,

source

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

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

source

pub fn is_in_subset(&self) -> bool

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

source

pub fn to_subset_unchecked(&self) -> SS

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

source

pub 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

pub fn to_owned(&self) -> T

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

source

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

🔬 This is a nightly-only experimental API. (toowned_clone_into)

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

source

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

type Error = Infallible

The type returned in the event of a conversion error.

const: unstable · source

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

Performs the conversion.

source

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

type Error = >::Error

The type returned in the event of a conversion error.

const: unstable · source

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

Performs the conversion.

source

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

source

Struct nalgebra::base::ArrayStorage

Tuple Fields

Trait Implementations

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

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

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

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

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

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

fn default() -> Self

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

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

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

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

fn eq(&self, other: &ArrayStorage<T, R, C>) -> bool

fn ne(&self, other: &ArrayStorage<T, R, C>) -> bool

type Output = ArrayStorage<T, R2, C2>

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

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

type RStride = Const<1>

type CStride = Const<R>

fn ptr(&self) -> *const T

fn shape(&self) -> (Const<R>, Const<C>)

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

fn is_contiguous(&self) -> bool

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

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

fn as_slice(&self) -> &[T]ⓘNotable traits for &'_ [u8]impl<'_> Read for &'_ [u8]impl<'_> Write for &'_ mut [u8]

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

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

unsafe 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, const R: usize, const C: usize> StorageMut<T, Const<R>, Const<C>> for ArrayStorage<T, R, C> where T: Scalar, DefaultAllocator: Allocator<T, Const<R>, Const<C>, Buffer = Self>,

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

fn as_mut_slice(&mut self) -> &mut [T]ⓘNotable traits for &'_ [u8]impl<'_> Read for &'_ [u8]impl<'_> Write for &'_ mut [u8]

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

unsafe fn get_address_unchecked_mut( &mut self, irow: usize, icol: usize) -> *mut T

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

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

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

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

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

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

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

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

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

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

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

pub fn type_id(&self) -> TypeId

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

pub fn borrow(&self) -> &T

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

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

impl<T> From<T> for T

pub fn from(t: T) -> T

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

pub fn into(self) -> U

impl<T> Same<T> for T

type Output = T

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

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

pub fn is_in_subset(&self) -> bool

pub fn to_subset_unchecked(&self) -> SS

pub fn from_subset(element: &SS) -> SP

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

type Owned = T

pub fn to_owned(&self) -> T

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

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

type Error = Infallible

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

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

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

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

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

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

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

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

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

fn as_slice(&self) -> &[T]ⓘNotable traits for &'_ [u8 ]`impl<'_> Read for &'_ [u8]impl<'_> Write for &'_ mut [u8]`

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

fn as_mut_slice(&mut self) -> &mut [T]ⓘNotable traits for &'_ [u8 ]`impl<'_> Read for &'_ [u8]impl<'_> Write for &'_ mut [u8]`

unsafe fn get_address_unchecked_mut(
&mut self,
irow: usize,
icol: usize
) -> *mut T

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

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

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

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,

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

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

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

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

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

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

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

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

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