Struct nalgebra::base::ArrayStorage
source · Expand description
A array-based statically sized matrix data storage.
Tuple Fields§
§0: [[T; R]; C]
Implementations§
Trait Implementations§
source§impl<T, const R: usize, const C: usize> Archive for ArrayStorage<T, R, C>where
T: Archive,
[[T; R]; C]: Archive<Archived = [[T::Archived; R]; C]> + Archive,
impl<T, const R: usize, const C: usize> Archive for ArrayStorage<T, R, C>where
T: Archive,
[[T; R]; C]: Archive<Archived = [[T::Archived; R]; C]> + Archive,
§type Archived = ArrayStorage<<T as Archive>::Archived, R, C>
type Archived = ArrayStorage<<T as Archive>::Archived, R, C>
The archived representation of this type. Read more
§type Resolver = ArrayStorageResolver<T, R, C>
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.
source§impl<__C: ?Sized, T, const R: usize, const C: usize> CheckBytes<__C> for ArrayStorage<T, R, C>where
[[T; R]; C]: CheckBytes<__C>,
impl<__C: ?Sized, T, const R: usize, const C: usize> CheckBytes<__C> for ArrayStorage<T, R, C>where
[[T; R]; C]: CheckBytes<__C>,
§type Error = TupleStructCheckError
type Error = TupleStructCheckError
The error that may result from checking the type.
source§unsafe fn check_bytes<'__bytecheck>(
value: *const Self,
context: &mut __C
) -> Result<&'__bytecheck Self, TupleStructCheckError>
unsafe fn check_bytes<'__bytecheck>(
value: *const Self,
context: &mut __C
) -> Result<&'__bytecheck Self, TupleStructCheckError>
Checks whether the given pointer points to a valid value within the
given context. Read more
source§impl<T: Clone, const R: usize, const C: usize> Clone for ArrayStorage<T, R, C>
impl<T: Clone, const R: usize, const C: usize> Clone for ArrayStorage<T, R, C>
source§fn clone(&self) -> ArrayStorage<T, R, C>
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)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moresource§impl<T: Default, const R: usize, const C: usize> Default for ArrayStorage<T, R, C>where
[[T; R]; C]: Default,
impl<T: Default, const R: usize, const C: usize> Default for ArrayStorage<T, R, C>where
[[T; R]; C]: Default,
source§impl<'a, T, const R: usize, const C: usize> Deserialize<'a> for ArrayStorage<T, R, C>where
T: Scalar + Deserialize<'a>,
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>,
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: Archive,
[[T; R]; C]: Archive<Archived = [[T::Archived; R]; C]> + Archive,
Archived<[[T; R]; C]>: Deserialize<[[T; R]; C], __D>,
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: Archive,
[[T; R]; C]: Archive<Archived = [[T::Archived; 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>
fn deserialize(
&self,
deserializer: &mut __D
) -> Result<ArrayStorage<T, R, C>, __D::Error>
Deserializes using the given deserializer
source§impl<T: PartialEq, const R: usize, const C: usize> PartialEq<ArrayStorage<T, R, C>> for ArrayStorage<T, R, C>
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
fn eq(&self, other: &ArrayStorage<T, R, C>) -> bool
This method tests for
self
and other
values to be equal, and is used
by ==
.source§impl<T, const R: usize, const C: usize> RawStorage<T, Const<R>, Const<C>> for ArrayStorage<T, R, C>
impl<T, const R: usize, const C: usize> RawStorage<T, Const<R>, Const<C>> for ArrayStorage<T, R, C>
source§fn shape(&self) -> (Const<R>, Const<C>)
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)
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
fn is_contiguous(&self) -> bool
Indicates whether this data buffer stores its elements contiguously. Read more
source§unsafe fn as_slice_unchecked(&self) -> &[T] ⓘ
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
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
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
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§impl<T, const R: usize, const C: usize> RawStorageMut<T, Const<R>, Const<C>> for ArrayStorage<T, R, C>
impl<T, const R: usize, const C: usize> RawStorageMut<T, Const<R>, Const<C>> for ArrayStorage<T, R, C>
source§unsafe fn as_mut_slice_unchecked(&mut self) -> &mut [T] ⓘ
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
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
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
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
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 moresource§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>>,
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>
type Output = ArrayStorage<T, R2, C2>
The reshaped storage type.
source§impl<__S: Fallible + ?Sized, T, const R: usize, const C: usize> Serialize<__S> for ArrayStorage<T, R, C>where
T: Archive,
[[T; R]; C]: Archive<Archived = [[T::Archived; R]; C]> + Serialize<__S>,
impl<__S: Fallible + ?Sized, T, const R: usize, const C: usize> Serialize<__S> for ArrayStorage<T, R, C>where
T: Archive,
[[T; R]; C]: Archive<Archived = [[T::Archived; R]; C]> + Serialize<__S>,
source§impl<T, const R: usize, const C: usize> Serialize for ArrayStorage<T, R, C>where
T: Scalar + Serialize,
impl<T, const R: usize, const C: usize> Serialize for ArrayStorage<T, R, C>where
T: Scalar + Serialize,
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>,
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>>,
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>>,
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>
impl<T: Scalar + Copy + Zeroable, const R: usize, const C: usize> Zeroable for ArrayStorage<T, R, C>
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§
source§impl<T> ArchivePointee for T
impl<T> ArchivePointee for T
§type ArchivedMetadata = ()
type ArchivedMetadata = ()
The archived version of the pointer metadata for this type.
source§fn pointer_metadata(
_: &<T as ArchivePointee>::ArchivedMetadata
) -> <T as Pointee>::Metadata
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,
impl<T> ArchiveUnsized for Twhere
T: Archive,
§type Archived = <T as Archive>::Archived
type Archived = <T as Archive>::Archived
The archived counterpart of this type. Unlike
Archive
, it may be unsized. Read more§type MetadataResolver = ()
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
)
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§impl<T> CheckedBitPattern for Twhere
T: AnyBitPattern,
impl<T> CheckedBitPattern for Twhere
T: AnyBitPattern,
§type Bits = T
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
.source§fn is_valid_bit_pattern(_bits: &T) -> bool
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,
impl<F, W, T, D> Deserialize<With<T, W>, D> for Fwhere
W: DeserializeWith<F, T, D>,
D: Fallible + ?Sized,
F: ?Sized,
source§impl<T> LayoutRaw for T
impl<T> LayoutRaw for T
source§fn layout_raw(_: *const T) -> Layout
fn layout_raw(_: *const T) -> Layout
Gets the layout of the type.
§impl<T> Pointable for T
impl<T> Pointable for T
source§impl<T, S> SerializeUnsized<S> for Twhere
T: Serialize<S>,
S: Serializer + ?Sized,
impl<T, S> SerializeUnsized<S> for Twhere
T: Serialize<S>,
S: Serializer + ?Sized,
source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self
from the equivalent element of its
superset. Read moresource§fn is_in_subset(&self) -> bool
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
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
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>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self
from the equivalent element of its
superset. Read moresource§fn is_in_subset(&self) -> bool
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
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
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self
to the equivalent element of its superset.