Struct bevy_rapier3d::prelude::nalgebra::base::ArrayStorage[−][src]

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

Trait Implementations

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>[src]

Returns a copy of the value. Read more

fn clone_from(&mut self, source: &Self)1.0.0 [src]

Performs copy-assignment from source. Read more

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>[src]

Formats the value using the given formatter. Read more

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>[src]

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

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,

[src]

Feeds this value into the given Hasher. Read more

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

1.3.0 [src]

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

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[src]

This method tests for self and other values to be equal, and is used by ==. Read more

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

This method tests for !=.

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,

[src]

type Output = ArrayStorage<T, R2, C2>

The reshaped storage type.

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

[src]

Reshapes the storage into the output storage type.

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]

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.

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

The matrix data pointer.

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

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

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

[src]

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

pub fn is_contiguous(&self) -> bool[src]

Indicates whether this data buffer stores its elements contiguously.

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

[src]

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

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

[src]

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

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

Retrieves the data buffer as a contiguous slice. Read more

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

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

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

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

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

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

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

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

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

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

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

[src]

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

The matrix mutable data pointer.

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

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

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

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

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

[src]

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

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

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

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

Retrieves a mutable reference to the element at (irow, icol) without bound-checking.

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

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

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

[src]

Swaps two elements without bound-checking.

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

[src]

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

[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> StructuralEq for ArrayStorage<T, R, C>[src]

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

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,

[src]

pub fn type_id(&self) -> TypeId[src]

Gets the TypeId of self. Read more

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

[src]

pub fn borrow(&self) -> &T[src]

Immutably borrows from an owned value. Read more

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

[src]

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

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> DowncastSync for T where
    T: Any + Send + Sync,

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

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)

impl<T> From<T> for T[src]

pub fn from(t: T) -> T[src]

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]

impl<T> Instrument for T[src]

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

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

fn in_current_span(self) -> Instrumented<Self>[src]

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

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

[src]

pub fn into(self) -> U[src]

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

impl<T> Same<T> for T

type Output = T

Should always be Self

impl<T> Scalar for T where
    T: Copy + PartialEq<T> + Debug + Any,

[src]

pub fn inlined_clone(&self) -> T[src]

Performance hack: Clone doesn’t get inlined for Copy types in debug mode, so make it inline anyway.

fn is<T>() -> bool where
    T: Scalar,

[src]

Tests if Self the same as the type T Read more

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.

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

[src]

type Owned = T

The resulting type after obtaining ownership.

pub fn to_owned(&self) -> T[src]

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

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

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

recently added

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

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

[src]

type Error = Infallible

The type returned in the event of a conversion error.

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

Performs the conversion.

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

[src]

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.

pub fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>[src]

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<V, T> VZip<V> for T where
    V: MultiLane<T>,

pub fn vzip(self) -> V

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