Struct bevy_rapier2d::prelude::nalgebra::ArrayStorage[−][src]

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

[src]

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

[src]

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

Converts this array storage to a slice.

[src]

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

Converts this array storage to a mutable slice.

Trait Implementations

[src]

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

[src]

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

Returns a copy of the value. Read more

1.0.0[src]

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

Performs copy-assignment from source. Read more

[src]

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

[src]

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

Formats the value using the given formatter. Read more

[src]

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

[src]

pub fn default() -> ArrayStorage<T, R, C>

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

[src]

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

[src]

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

Feeds this value into the given Hasher. Read more

1.3.0[src]

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

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

[src]

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

[src]

pub 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

[src]

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

This method tests for !=.

[src]

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

type RStride = Const<1_usize>

The static stride of this storage’s rows.

type CStride = Const<R>

The static stride of this storage’s columns.

[src]

pub fn ptr(&self) -> *const T

The matrix data pointer.

[src]

pub 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

[src]

pub fn strides(
&self
) -> (<ArrayStorage<T, R, C> as RawStorage<T, Const<R>, Const<C>>>::RStride, <ArrayStorage<T, R, C> as RawStorage<T, Const<R>, Const<C>>>::CStride )

The spacing between consecutive row elements and consecutive column elements. Read more

[src]

pub fn is_contiguous(&self) -> bool

Indicates whether this data buffer stores its elements contiguously. Read more

[src]

pub unsafe fn as_slice_unchecked(&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

[src]

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

[src]

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

[src]

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

[src]

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

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

[src]

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

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

[src]

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

[src]

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

The matrix mutable data pointer.

[src]

pub unsafe fn as_mut_slice_unchecked(&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

[src]

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

[src]

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

[src]

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

[src]

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

[src]

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

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

[src]

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

Swaps two elements without bound-checking. Read more

[src]

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>,
 <<Const<R2> as ToTypenum>::Typenum as Mul<<Const<C2> as ToTypenum>::Typenum>>::Output == <<Const<R1> as ToTypenum>::Typenum as Mul<<Const<C1> as ToTypenum>::Typenum>>::Output,

type Output = ArrayStorage<T, R2, C2>

The reshaped storage type.

[src]

pub fn reshape_generic(
 self,
 Const<R2>,
 Const<C2>
) -> <ArrayStorage<T, R1, C1> as ReshapableStorage<T, Const<R1>, Const<C1>, Const<R2>, Const<C2>>>::Output

Reshapes the storage into the output storage type.

[src]

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>>,
 <DefaultAllocator as Allocator<T, Const<R>, Const<C>>>::Buffer == ArrayStorage<T, R, C>,

[src]

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

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

[src]

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

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

[src]

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

[src]

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

[src]

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

[src]

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

[src]

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

[src]

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

[src]

pub fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

[src]

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

[src]

pub fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

[src]

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

[src]

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

Mutably borrows from an owned value. Read more

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

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

impl<T> Downcast for T where
T: Any,

pub fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>

Convert Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>. Box<dyn Any> can then be further downcast into Box<ConcreteType> where ConcreteType implements Trait. Read more

pub fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>

Convert Rc<Trait> (where Trait: Downcast) to Rc<Any>. Rc<Any> can then be further downcast into Rc<ConcreteType> where ConcreteType implements Trait. Read more

pub fn as_any(&self) -> &(dyn Any + 'static)

Convert &Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot generate &Any’s vtable from &Trait’s. Read more

pub fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)

Convert &mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot generate &mut Any’s vtable from &mut Trait’s. Read more

impl<T> Downcast<T> for T

pub fn downcast(&self) -> &T

impl<T> DowncastSync for T where
T: Any + Send + Sync,

pub fn into_any_arc(self: Arc<T>) -> Arc<dyn Any + Send + Sync + 'static>

Convert Arc<Trait> (where Trait: Downcast) to Arc<Any>. Arc<Any> can then be further downcast into Arc<ConcreteType> where ConcreteType implements Trait. Read more

impl<T> DynEq for T where
T: Any + Eq,

pub fn as_any(&self) -> &(dyn Any + 'static)

pub fn dyn_eq(&self, other: &(dyn DynEq + 'static)) -> bool

impl<T> DynHash for T where
T: DynEq + Hash,

pub fn as_dyn_eq(&self) -> &(dyn DynEq + 'static)

pub fn dyn_hash(&self, state: &mut dyn Hasher)

[src]

impl<Q, K> Equivalent<K> for Q where
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,

[src]

pub fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.

[src]

impl<T> From<T> for T

[src]

pub fn from(t: T) -> T

Performs the conversion.

impl<T> FromWorld for T where
T: Default,

pub fn from_world(_world: &mut World) -> T

Creates Self using data from the given [World]

[src]

impl<T> Instrument for T

[src]

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more

[src]

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more

[src]

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

[src]

pub fn into(self) -> U

Performs the conversion.

impl<T> Pointable for T

pub const ALIGN: usize

The alignment of pointer.

type Init = T

The type for initializers.

pub unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more

pub unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more

pub unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more

pub unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more

[src]

impl<T> Same<T> for T

type Output = T

Should always be Self

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

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

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

pub fn is_in_subset(&self) -> bool

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

pub fn to_subset_unchecked(&self) -> SS

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

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

The inclusion map: converts self to the equivalent element of its superset.

[src]

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

type Owned = T

The resulting type after obtaining ownership.

[src]

pub fn to_owned(&self) -> T

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

[src]

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

[src]

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

type Error = Infallible

The type returned in the event of a conversion error.

[src]

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

Performs the conversion.

[src]

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

type Error = >::Error

The type returned in the event of a conversion error.

[src]

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

Performs the conversion.

impl<T> TypeData for T where
T: 'static + Send + Sync + Clone,

pub fn clone_type_data(&self) -> Box<dyn TypeData + 'static, Global>

impl<T> Upcast<T> for T

pub fn upcast(&self) -> Option<&T>

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

pub fn vzip(self) -> V

[src]

impl<T> WithSubscriber for T

[src]

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self> where
S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more

[src]

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a WithDispatch wrapper. Read more

impl<T> Resource for T where
T: 'static + Send + Sync,

[src]

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

impl<T> StateData for T where
T: 'static + Send + Sync + Clone + Eq + Debug + Hash,

[src]

Struct bevy_rapier2d::prelude::nalgebra::ArrayStorage[−][src]

Tuple Fields

Implementations

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

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

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

Trait Implementations

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

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

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

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

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

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

pub fn default() -> ArrayStorage<T, R, C>

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

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

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

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

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

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

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

type RStride = Const<1_usize>

type CStride = Const<R>

pub fn ptr(&self) -> *const T

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

pub fn strides( &self) -> (<ArrayStorage<T, R, C> as RawStorage<T, Const<R>, Const<C>>>::RStride, <ArrayStorage<T, R, C> as RawStorage<T, Const<R>, Const<C>>>::CStride)

pub fn is_contiguous(&self) -> bool

pub unsafe fn as_slice_unchecked(&self) -> &[T]ⓘNotable traits for &'_ [u8]impl<'_> Read for &'_ [u8]impl<'_> Write for &'_ mut [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>

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

pub unsafe fn as_mut_slice_unchecked(&mut self) -> &mut [T]ⓘNotable traits for &'_ [u8]impl<'_> Read for &'_ [u8]impl<'_> Write for &'_ mut [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>

pub fn reshape_generic( self, Const<R2>, Const<C2>) -> <ArrayStorage<T, R1, C1> as ReshapableStorage<T, Const<R1>, Const<C1>, Const<R2>, Const<C2>>>::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>>, <DefaultAllocator as Allocator<T, Const<R>, Const<C>>>::Buffer == ArrayStorage<T, R, C>,

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

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

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

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

impl<T, const R: usize, const C: usize> IsContiguous 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> CallHasher for T where T: Hash + ?Sized,

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

impl<T> Downcast for T where T: Any,

pub fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>

pub fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>

pub fn as_any(&self) -> &(dyn Any + 'static)

pub fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)

impl<T> Downcast<T> for T

pub fn downcast(&self) -> &T

impl<T> DowncastSync for T where T: Any + Send + Sync,

pub fn into_any_arc(self: Arc<T>) -> Arc<dyn Any + Send + Sync + 'static>

impl<T> DynEq for T where T: Any + Eq,

pub fn as_any(&self) -> &(dyn Any + 'static)

pub fn dyn_eq(&self, other: &(dyn DynEq + 'static)) -> bool

impl<T> DynHash for T where T: DynEq + Hash,

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

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

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

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

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

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

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

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

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

pub fn strides(
&self
) -> (<ArrayStorage<T, R, C> as RawStorage<T, Const<R>, Const<C>>>::RStride, <ArrayStorage<T, R, C> as RawStorage<T, Const<R>, Const<C>>>::CStride )

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

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

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

pub fn reshape_generic(
self,
Const<R2>,
Const<C2>
) -> <ArrayStorage<T, R1, C1> as ReshapableStorage<T, Const<R1>, Const<C1>, Const<R2>, Const<C2>>>::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>>,
<DefaultAllocator as Allocator<T, Const<R>, Const<C>>>::Buffer == ArrayStorage<T, R, C>,

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

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

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

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

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> CallHasher for T where
T: Hash + ?Sized,

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

impl<T> Downcast for T where
T: Any,

impl<T> DowncastSync for T where
T: Any + Send + Sync,

impl<T> DynEq for T where
T: Any + Eq,

impl<T> DynHash for T where
T: DynEq + Hash,

impl<Q, K> Equivalent<K> for Q where
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,

impl<T> FromWorld for T where
T: Default,

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<T> TypeData for T where
T: 'static + Send + Sync + Clone,

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

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self> where
S: Into<Dispatch>,

impl<T> Resource for T where
T: 'static + Send + Sync,

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

impl<T> StateData for T where
T: 'static + Send + Sync + Clone + Eq + Debug + Hash,

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