Struct nalgebra::base::ArrayStorage

source · [−]

#[repr(transparent)]
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]

Implementations

source

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

source

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

Converts this array storage to a slice.

source

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

Converts this array storage to a mutable slice.

Trait Implementations

source

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

type Archived = ArchivedArrayStorage<T, R, C>

The archived representation of this type. Read more

type Resolver = ArrayStorageResolver<T, R, C>

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

source

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

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<'a, T, const R: usize, const C: usize> Deserialize<'a> for ArrayStorage<T, R, C>where
T: Scalar + Deserialize<'a>,

source

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>where
D: Deserializer<'a>,

Deserialize this value from the given Serde deserializer. Read more

source

impl<D: Fallible + ?Sized, T, const R: usize, const C: usize> Deserialize<ArrayStorage<T, R, C>, D> for Archived<ArrayStorage<T, R, C>>where
[[T; R]; C]: Archive,
Archived<[[T; R]; C]>: Deserialize<[[T; R]; C], __D>,

source

fn deserialize(
&self,
deserializer: &mut D
) -> Result<ArrayStorage<T, R, C>, D::Error>

Deserializes using the given deserializer

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

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, 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. 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]ⓘNotable traits for &mut [u8]`impl Write for &mut [u8]impl Read for &[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

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]ⓘNotable traits for &mut [u8]`impl Write for &mut [u8]impl Read for &[u8]`

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<S: Fallible + ?Sized, T, const R: usize, const C: usize> Serialize<S> for ArrayStorage<T, R, C>where
[[T; R]; C]: Serialize<__S>,

source

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

source

impl<T, const R: usize, const C: usize> Serialize for ArrayStorage<T, R, C>where
T: Scalar + Serialize,

source

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

Serialize this value into the given Serde serializer. Read more

source

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

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

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

source

fn zeroed() -> Self

Calls zeroed. Read more

source

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

source

impl<T: DeviceCopy, const R: usize, const C: usize> DeviceCopy 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: Scalar + Copy + Pod, const R: usize, const C: usize> Pod for ArrayStorage<T, R, C>

source

impl<T, const R: usize, const C: usize> StructuralEq 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> 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 Twhere
T: 'static + ?Sized,

source

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

source

impl<T> ArchivePointee for T

type ArchivedMetadata = ()

The archived version of the pointer metadata for this type.

source

fn pointer_metadata(
&<T as ArchivePointee>::ArchivedMetadata
) -> <T as Pointee>::Metadata

Converts some archived metadata to the pointer metadata for itself.

source

impl<T> ArchiveUnsized for Twhere
T: Archive,

type Archived = <T as Archive>::Archived

The archived counterpart of this type. Unlike Archive, it may be unsized. Read more

type MetadataResolver = ()

The resolver for the metadata of this type. Read more

source

unsafe fn resolve_metadata(
 &self,
 usize,
 <T as ArchiveUnsized>::MetadataResolver,
 *mut <<T as ArchiveUnsized>::Archived as ArchivePointee>::ArchivedMetadata
)

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

source

unsafe fn resolve_unsized(
 &self,
 from: usize,
 to: usize,
 resolver: Self::MetadataResolver,
 out: *mut RelPtr<Self::Archived, <isize as Archive>::Archived>
)

Resolves a relative pointer to this value with the given from and to and writes it to the given output. 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

impl<T> CallHasher for Twhere
T: Hash + ?Sized,

default fn get_hash<H, B>(value: &H, build_hasher: &B) -> u64where
H: Hash + ?Sized,
B: BuildHasher,

source

impl<T> CheckedBitPattern for Twhere
T: AnyBitPattern,

type Bits = T

Self must have the same layout as the specified Bits except for the possible invalid bit patterns being checked during is_valid_bit_pattern. Read more

source

fn is_valid_bit_pattern(_bits: &T) -> bool

If this function returns true, then it must be valid to reinterpret bits as &Self.

source

impl<F, W, T, D> Deserialize<With<T, W>, D> for Fwhere
 W: DeserializeWith<F, T, D>,
 D: Fallible + ?Sized,
 F: ?Sized,

source

fn deserialize(
&self,
deserializer: &mut D
) -> Result<With<T, W>, <D as Fallible>::Error>

Deserializes using the given deserializer

source

impl<T> From<T> for T

const: unstable · source

fn from(t: T) -> T

Returns the argument unchanged.

source

impl<T, U> Into 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> LayoutRaw for T

source

fn layout_raw(*const T) -> Layout

Gets the layout of the type.

impl<T> Pointee for T

type Metadata = ()

The type for metadata in pointers and references to Self.

source

impl<T> Same<T> for T

type Output = T

Should always be Self

source

impl<T, S> SerializeUnsized<S> for Twhere
T: Serialize<S>,
S: Serializer + ?Sized,

source

fn serialize_unsized(
&self,
serializer: &mut S
) -> Result<usize, <S as Fallible>::Error>

Writes the object and returns the position of the archived type.

source

fn serialize_metadata(&self, &mut S) -> Result<(), <S as Fallible>::Error>

Serializes the metadata for the given type.

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

unsafe 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 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>::Error>

Performs the conversion.

source

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

type Error = >::Error

The type returned in the event of a conversion error.

const: unstable · source

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

Performs the conversion.

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

Struct nalgebra::base::ArrayStorage

Tuple Fields

Implementations

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

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

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

Trait Implementations

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

type Archived = ArchivedArrayStorage<T, R, C>

type Resolver = ArrayStorageResolver<T, R, C>

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

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<'a, T, const R: usize, const C: usize> Deserialize<'a> for ArrayStorage<T, R, C>where T: Scalar + Deserialize<'a>,

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>where D: Deserializer<'a>,

impl<__D: Fallible + ?Sized, T, const R: usize, const C: usize> Deserialize<ArrayStorage<T, R, C>, __D> for Archived<ArrayStorage<T, R, C>>where [[T; R]; C]: Archive, Archived<[[T; R]; C]>: Deserialize<[[T; R]; C], __D>,

fn deserialize( &self, deserializer: &mut __D) -> Result<ArrayStorage<T, R, C>, __D::Error>

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, Self: Sized,

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: &Rhs) -> bool

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

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

unsafe fn as_slice_unchecked(&self) -> &[T]ⓘNotable traits for &mut [u8]impl Write for &mut [u8]impl Read for &[u8]

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

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

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> RawStorageMut<T, Const<R>, Const<C>> for ArrayStorage<T, R, C>

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

unsafe fn as_mut_slice_unchecked(&mut self) -> &mut [T]ⓘNotable traits for &mut [u8]impl Write for &mut [u8]impl Read for &[u8]

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

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

type Output = ArrayStorage<T, R2, C2>

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

impl<__S: Fallible + ?Sized, T, const R: usize, const C: usize> Serialize<__S> for ArrayStorage<T, R, C>where [[T; R]; C]: Serialize<__S>,

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

impl<T, const R: usize, const C: usize> Serialize for ArrayStorage<T, R, C>where T: Scalar + Serialize,

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

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

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

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

fn zeroed() -> Self

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

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

impl<T: Scalar + Copy + Pod, const R: usize, const C: usize> Pod 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 Twhere T: 'static + ?Sized,

fn type_id(&self) -> TypeId

impl<T> ArchivePointee for T

type ArchivedMetadata = ()

fn pointer_metadata( &<T as ArchivePointee>::ArchivedMetadata) -> <T as Pointee>::Metadata

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

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

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

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

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

impl<'a, T, const R: usize, const C: usize> Deserialize<'a> for ArrayStorage<T, R, C>where
T: Scalar + Deserialize<'a>,

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>where
D: Deserializer<'a>,

impl<D: Fallible + ?Sized, T, const R: usize, const C: usize> Deserialize<ArrayStorage<T, R, C>, D> for Archived<ArrayStorage<T, R, C>>where
[[T; R]; C]: Archive,
Archived<[[T; R]; C]>: Deserialize<[[T; R]; C], __D>,

fn deserialize(
&self,
deserializer: &mut D
) -> Result<ArrayStorage<T, R, C>, D::Error>

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

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

unsafe fn as_slice_unchecked(&self) -> &[T]ⓘNotable traits for &mut [u8]`impl Write for &mut [u8]impl Read for &[u8]`

unsafe fn as_mut_slice_unchecked(&mut self) -> &mut [T]ⓘNotable traits for &mut [u8]`impl Write for &mut [u8]impl Read for &[u8]`

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

impl<S: Fallible + ?Sized, T, const R: usize, const C: usize> Serialize<S> for ArrayStorage<T, R, C>where
[[T; R]; C]: Serialize<__S>,

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

impl<T, const R: usize, const C: usize> Serialize for ArrayStorage<T, R, C>where
T: Scalar + Serialize,

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

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

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

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

fn pointer_metadata(
&<T as ArchivePointee>::ArchivedMetadata
) -> <T as Pointee>::Metadata

impl<T> ArchiveUnsized for Twhere
T: Archive,

unsafe fn resolve_metadata(
&self,
usize,
<T as ArchiveUnsized>::MetadataResolver,
*mut <<T as ArchiveUnsized>::Archived as ArchivePointee>::ArchivedMetadata
)

unsafe fn resolve_unsized(
&self,
from: usize,
to: usize,
resolver: Self::MetadataResolver,
out: *mut RelPtr<Self::Archived, <isize as Archive>::Archived>
)

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

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

impl<T> CallHasher for Twhere
T: Hash + ?Sized,

default fn get_hash<H, B>(value: &H, build_hasher: &B) -> u64where
H: Hash + ?Sized,
B: BuildHasher,

impl<T> CheckedBitPattern for Twhere
T: AnyBitPattern,

impl<F, W, T, D> Deserialize<With<T, W>, D> for Fwhere
W: DeserializeWith<F, T, D>,
D: Fallible + ?Sized,
F: ?Sized,

fn deserialize(
&self,
deserializer: &mut D
) -> Result<With<T, W>, <D as Fallible>::Error>

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

impl<T, S> SerializeUnsized<S> for Twhere
T: Serialize<S>,
S: Serializer + ?Sized,

fn serialize_unsized(
&self,
serializer: &mut S
) -> Result<usize, <S as Fallible>::Error>

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

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

impl<T> ToOwned for Twhere
T: Clone,

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

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

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

impl<T> AnyBitPattern for Twhere
T: Pod,

impl<T> DeserializeOwned for Twhere
T: for<'de> Deserialize<'de>,

impl<T> NoUninit for Twhere
T: Pod,

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