[−][src]Struct cv::nalgebra::base::ArrayStorage
A array-based statically sized matrix data storage.
Methods from Deref<Target = GenericArray<N, <<R as DimName>::Value as Mul<<C as DimName>::Value>>::Output>>
pub fn as_slice(&self) -> &[T]
Extracts a slice containing the entire array.
pub fn as_mut_slice(&mut self) -> &mut [T]
Extracts a mutable slice containing the entire array.
Trait Implementations
impl<N, R, C> Clone for ArrayStorage<N, R, C> where
C: DimName,
N: Clone,
R: DimName,
<R as DimName>::Value: Mul<<C as DimName>::Value>,
<<R as DimName>::Value as Mul<<C as DimName>::Value>>::Output: ArrayLength<N>,
[src]
C: DimName,
N: Clone,
R: DimName,
<R as DimName>::Value: Mul<<C as DimName>::Value>,
<<R as DimName>::Value as Mul<<C as DimName>::Value>>::Output: ArrayLength<N>,
fn clone(&self) -> ArrayStorage<N, R, C>
[src]
fn clone_from(&mut self, source: &Self)
1.0.0[src]
impl<N, R, C> ContiguousStorage<N, R, C> for ArrayStorage<N, R, C> where
C: DimName,
N: Scalar,
R: DimName,
<R as DimName>::Value: Mul<<C as DimName>::Value>,
<<R as DimName>::Value as Mul<<C as DimName>::Value>>::Output: ArrayLength<N>,
DefaultAllocator: Allocator<N, R, C>,
<DefaultAllocator as Allocator<N, R, C>>::Buffer == ArrayStorage<N, R, C>,
[src]
C: DimName,
N: Scalar,
R: DimName,
<R as DimName>::Value: Mul<<C as DimName>::Value>,
<<R as DimName>::Value as Mul<<C as DimName>::Value>>::Output: ArrayLength<N>,
DefaultAllocator: Allocator<N, R, C>,
<DefaultAllocator as Allocator<N, R, C>>::Buffer == ArrayStorage<N, R, C>,
impl<N, R, C> ContiguousStorageMut<N, R, C> for ArrayStorage<N, R, C> where
C: DimName,
N: Scalar,
R: DimName,
<R as DimName>::Value: Mul<<C as DimName>::Value>,
<<R as DimName>::Value as Mul<<C as DimName>::Value>>::Output: ArrayLength<N>,
DefaultAllocator: Allocator<N, R, C>,
<DefaultAllocator as Allocator<N, R, C>>::Buffer == ArrayStorage<N, R, C>,
[src]
C: DimName,
N: Scalar,
R: DimName,
<R as DimName>::Value: Mul<<C as DimName>::Value>,
<<R as DimName>::Value as Mul<<C as DimName>::Value>>::Output: ArrayLength<N>,
DefaultAllocator: Allocator<N, R, C>,
<DefaultAllocator as Allocator<N, R, C>>::Buffer == ArrayStorage<N, R, C>,
impl<N, R, C> Copy for ArrayStorage<N, R, C> where
C: DimName,
N: Copy,
R: DimName,
<R as DimName>::Value: Mul<<C as DimName>::Value>,
<<R as DimName>::Value as Mul<<C as DimName>::Value>>::Output: ArrayLength<N>,
GenericArray<N, <<R as DimName>::Value as Mul<<C as DimName>::Value>>::Output>: Copy,
[src]
C: DimName,
N: Copy,
R: DimName,
<R as DimName>::Value: Mul<<C as DimName>::Value>,
<<R as DimName>::Value as Mul<<C as DimName>::Value>>::Output: ArrayLength<N>,
GenericArray<N, <<R as DimName>::Value as Mul<<C as DimName>::Value>>::Output>: Copy,
impl<N, R, C> Debug for ArrayStorage<N, R, C> where
C: DimName,
N: Debug,
R: DimName,
<R as DimName>::Value: Mul<<C as DimName>::Value>,
<<R as DimName>::Value as Mul<<C as DimName>::Value>>::Output: ArrayLength<N>,
[src]
C: DimName,
N: Debug,
R: DimName,
<R as DimName>::Value: Mul<<C as DimName>::Value>,
<<R as DimName>::Value as Mul<<C as DimName>::Value>>::Output: ArrayLength<N>,
impl<N, R, C> Default for ArrayStorage<N, R, C> where
C: DimName,
N: Default,
R: DimName,
<R as DimName>::Value: Mul<<C as DimName>::Value>,
<<R as DimName>::Value as Mul<<C as DimName>::Value>>::Output: ArrayLength<N>,
[src]
C: DimName,
N: Default,
R: DimName,
<R as DimName>::Value: Mul<<C as DimName>::Value>,
<<R as DimName>::Value as Mul<<C as DimName>::Value>>::Output: ArrayLength<N>,
fn default() -> ArrayStorage<N, R, C>
[src]
impl<N, R, C> Deref for ArrayStorage<N, R, C> where
C: DimName,
R: DimName,
<R as DimName>::Value: Mul<<C as DimName>::Value>,
<<R as DimName>::Value as Mul<<C as DimName>::Value>>::Output: ArrayLength<N>,
[src]
C: DimName,
R: DimName,
<R as DimName>::Value: Mul<<C as DimName>::Value>,
<<R as DimName>::Value as Mul<<C as DimName>::Value>>::Output: ArrayLength<N>,
type Target = GenericArray<N, <<R as DimName>::Value as Mul<<C as DimName>::Value>>::Output>
The resulting type after dereferencing.
fn deref(&self) -> &<ArrayStorage<N, R, C> as Deref>::Target
[src]
impl<N, R, C> DerefMut for ArrayStorage<N, R, C> where
C: DimName,
R: DimName,
<R as DimName>::Value: Mul<<C as DimName>::Value>,
<<R as DimName>::Value as Mul<<C as DimName>::Value>>::Output: ArrayLength<N>,
[src]
C: DimName,
R: DimName,
<R as DimName>::Value: Mul<<C as DimName>::Value>,
<<R as DimName>::Value as Mul<<C as DimName>::Value>>::Output: ArrayLength<N>,
fn deref_mut(&mut self) -> &mut <ArrayStorage<N, R, C> as Deref>::Target
[src]
impl<N, R, C> Eq for ArrayStorage<N, R, C> where
C: DimName,
N: Eq,
R: DimName,
<R as DimName>::Value: Mul<<C as DimName>::Value>,
<<R as DimName>::Value as Mul<<C as DimName>::Value>>::Output: ArrayLength<N>,
[src]
C: DimName,
N: Eq,
R: DimName,
<R as DimName>::Value: Mul<<C as DimName>::Value>,
<<R as DimName>::Value as Mul<<C as DimName>::Value>>::Output: ArrayLength<N>,
impl<N, R, C> Hash for ArrayStorage<N, R, C> where
C: DimName,
N: Hash,
R: DimName,
<R as DimName>::Value: Mul<<C as DimName>::Value>,
<<R as DimName>::Value as Mul<<C as DimName>::Value>>::Output: ArrayLength<N>,
[src]
C: DimName,
N: Hash,
R: DimName,
<R as DimName>::Value: Mul<<C as DimName>::Value>,
<<R as DimName>::Value as Mul<<C as DimName>::Value>>::Output: ArrayLength<N>,
fn hash<H>(&self, state: &mut H) where
H: Hasher,
[src]
H: Hasher,
fn hash_slice<H>(data: &[Self], state: &mut H) where
H: Hasher,
1.3.0[src]
H: Hasher,
impl<N, R, C> PartialEq<ArrayStorage<N, R, C>> for ArrayStorage<N, R, C> where
C: DimName,
N: PartialEq<N>,
R: DimName,
<R as DimName>::Value: Mul<<C as DimName>::Value>,
<<R as DimName>::Value as Mul<<C as DimName>::Value>>::Output: ArrayLength<N>,
[src]
C: DimName,
N: PartialEq<N>,
R: DimName,
<R as DimName>::Value: Mul<<C as DimName>::Value>,
<<R as DimName>::Value as Mul<<C as DimName>::Value>>::Output: ArrayLength<N>,
fn eq(&self, right: &ArrayStorage<N, R, C>) -> bool
[src]
#[must_use]fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl<N, R, C> Storage<N, R, C> for ArrayStorage<N, R, C> where
C: DimName,
N: Scalar,
R: DimName,
<R as DimName>::Value: Mul<<C as DimName>::Value>,
<<R as DimName>::Value as Mul<<C as DimName>::Value>>::Output: ArrayLength<N>,
DefaultAllocator: Allocator<N, R, C>,
<DefaultAllocator as Allocator<N, R, C>>::Buffer == ArrayStorage<N, R, C>,
[src]
C: DimName,
N: Scalar,
R: DimName,
<R as DimName>::Value: Mul<<C as DimName>::Value>,
<<R as DimName>::Value as Mul<<C as DimName>::Value>>::Output: ArrayLength<N>,
DefaultAllocator: Allocator<N, R, C>,
<DefaultAllocator as Allocator<N, R, C>>::Buffer == ArrayStorage<N, R, C>,
type RStride = U1
The static stride of this storage's rows.
type CStride = R
The static stride of this storage's columns.
fn ptr(&self) -> *const N
[src]
fn shape(&self) -> (R, C)
[src]
fn strides(
&self
) -> (<ArrayStorage<N, R, C> as Storage<N, R, C>>::RStride, <ArrayStorage<N, R, C> as Storage<N, R, C>>::CStride)
[src]
&self
) -> (<ArrayStorage<N, R, C> as Storage<N, R, C>>::RStride, <ArrayStorage<N, R, C> as Storage<N, R, C>>::CStride)
fn is_contiguous(&self) -> bool
[src]
fn into_owned(self) -> <DefaultAllocator as Allocator<N, R, C>>::Buffer where
DefaultAllocator: Allocator<N, R, C>,
[src]
DefaultAllocator: Allocator<N, R, C>,
fn clone_owned(&self) -> <DefaultAllocator as Allocator<N, R, C>>::Buffer where
DefaultAllocator: Allocator<N, R, C>,
[src]
DefaultAllocator: Allocator<N, R, C>,
fn as_slice(&self) -> &[N]
[src]
fn linear_index(&self, irow: usize, icol: usize) -> usize
[src]
unsafe fn get_address_unchecked_linear(&self, i: usize) -> *const N
[src]
unsafe fn get_address_unchecked(&self, irow: usize, icol: usize) -> *const N
[src]
unsafe fn get_unchecked_linear(&self, i: usize) -> &N
[src]
unsafe fn get_unchecked(&self, irow: usize, icol: usize) -> &N
[src]
impl<N, R, C> StorageMut<N, R, C> for ArrayStorage<N, R, C> where
C: DimName,
N: Scalar,
R: DimName,
<R as DimName>::Value: Mul<<C as DimName>::Value>,
<<R as DimName>::Value as Mul<<C as DimName>::Value>>::Output: ArrayLength<N>,
DefaultAllocator: Allocator<N, R, C>,
<DefaultAllocator as Allocator<N, R, C>>::Buffer == ArrayStorage<N, R, C>,
[src]
C: DimName,
N: Scalar,
R: DimName,
<R as DimName>::Value: Mul<<C as DimName>::Value>,
<<R as DimName>::Value as Mul<<C as DimName>::Value>>::Output: ArrayLength<N>,
DefaultAllocator: Allocator<N, R, C>,
<DefaultAllocator as Allocator<N, R, C>>::Buffer == ArrayStorage<N, R, C>,
fn ptr_mut(&mut self) -> *mut N
[src]
fn as_mut_slice(&mut self) -> &mut [N]
[src]
unsafe fn get_address_unchecked_linear_mut(&mut self, i: usize) -> *mut N
[src]
unsafe fn get_address_unchecked_mut(
&mut self,
irow: usize,
icol: usize
) -> *mut N
[src]
&mut self,
irow: usize,
icol: usize
) -> *mut N
unsafe fn get_unchecked_linear_mut(&mut self, i: usize) -> &mut N
[src]
unsafe fn get_unchecked_mut(&mut self, irow: usize, icol: usize) -> &mut N
[src]
unsafe fn swap_unchecked_linear(&mut self, i1: usize, i2: usize)
[src]
unsafe fn swap_unchecked(
&mut self,
row_col1: (usize, usize),
row_col2: (usize, usize)
)
[src]
&mut self,
row_col1: (usize, usize),
row_col2: (usize, usize)
)
Auto Trait Implementations
impl<N, R, C> RefUnwindSafe for ArrayStorage<N, R, C> where
<<<R as DimName>::Value as Mul<<C as DimName>::Value>>::Output as ArrayLength<N>>::ArrayType: RefUnwindSafe,
<<<R as DimName>::Value as Mul<<C as DimName>::Value>>::Output as ArrayLength<N>>::ArrayType: RefUnwindSafe,
impl<N, R, C> Send for ArrayStorage<N, R, C> where
N: Send,
N: Send,
impl<N, R, C> Sync for ArrayStorage<N, R, C> where
N: Sync,
N: Sync,
impl<N, R, C> Unpin for ArrayStorage<N, R, C> where
<<<R as DimName>::Value as Mul<<C as DimName>::Value>>::Output as ArrayLength<N>>::ArrayType: Unpin,
<<<R as DimName>::Value as Mul<<C as DimName>::Value>>::Output as ArrayLength<N>>::ArrayType: Unpin,
impl<N, R, C> UnwindSafe for ArrayStorage<N, R, C> where
<<<R as DimName>::Value as Mul<<C as DimName>::Value>>::Output as ArrayLength<N>>::ArrayType: UnwindSafe,
<<<R as DimName>::Value as Mul<<C as DimName>::Value>>::Output as ArrayLength<N>>::ArrayType: UnwindSafe,
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T> Same<T> for T
type Output = T
Should always be Self
impl<T> Scalar for T where
T: PartialEq<T> + Copy + Any + Debug,
[src]
T: PartialEq<T> + Copy + Any + Debug,
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
SS: SubsetOf<SP>,
fn to_subset(&self) -> Option<SS>
fn is_in_subset(&self) -> bool
fn to_subset_unchecked(&self) -> SS
fn from_subset(element: &SS) -> SP
impl<T> ToOwned for T where
T: Clone,
[src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
fn to_owned(&self) -> T
[src]
fn clone_into(&self, target: &mut T)
[src]
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error
The type returned in the event of a conversion error.
fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>
[src]
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
V: MultiLane<T>,