pub struct LastEq<Rows, Cols, Mat>(pub Mat)
where
Mat: MatShape<Rows = Rows, Cols = Cols>;
Expand description
Single matrix view.
Tuple Fields§
§0: Mat
Implementations§
§impl<M> LastEq<usize, usize, M>
impl<M> LastEq<usize, usize, M>
pub fn for_each(
self,
f: impl for<'a> FnMut(<LastEq<usize, usize, M> as MatIndex<'a>>::Item),
)
pub fn for_each( self, f: impl for<'a> FnMut(<LastEq<usize, usize, M> as MatIndex<'a>>::Item), )
Applies f
to each element of self
.
pub fn for_each_with_index(
self,
f: impl for<'a> FnMut(usize, usize, <LastEq<usize, usize, M> as MatIndex<'a>>::Item),
)
pub fn for_each_with_index( self, f: impl for<'a> FnMut(usize, usize, <LastEq<usize, usize, M> as MatIndex<'a>>::Item), )
Applies f
to each element of self
, while passing the indices of the position of the
current element.
pub fn for_each_triangular_lower_with_index(
self,
diag: Diag,
f: impl for<'a> FnMut(usize, usize, <LastEq<usize, usize, M> as MatIndex<'a>>::Item),
)
pub fn for_each_triangular_lower_with_index( self, diag: Diag, f: impl for<'a> FnMut(usize, usize, <LastEq<usize, usize, M> as MatIndex<'a>>::Item), )
Applies f
to each element of the lower triangular half of self
, while passing the
indices of the position of the current element.
diag
specifies whether the diagonal should be included or excluded.
pub fn for_each_triangular_upper_with_index(
self,
diag: Diag,
f: impl for<'a> FnMut(usize, usize, <LastEq<usize, usize, M> as MatIndex<'a>>::Item),
)
pub fn for_each_triangular_upper_with_index( self, diag: Diag, f: impl for<'a> FnMut(usize, usize, <LastEq<usize, usize, M> as MatIndex<'a>>::Item), )
Applies f
to each element of the upper triangular half of self
, while passing the
indices of the position of the current element.
diag
specifies whether the diagonal should be included or excluded.
pub fn for_each_triangular_lower(
self,
diag: Diag,
f: impl for<'a> FnMut(<LastEq<usize, usize, M> as MatIndex<'a>>::Item),
)
pub fn for_each_triangular_lower( self, diag: Diag, f: impl for<'a> FnMut(<LastEq<usize, usize, M> as MatIndex<'a>>::Item), )
Applies f
to each element of the lower triangular half of self
.
diag
specifies whether the diagonal should be included or excluded.
pub fn for_each_triangular_upper(
self,
diag: Diag,
f: impl for<'a> FnMut(<LastEq<usize, usize, M> as MatIndex<'a>>::Item),
)
pub fn for_each_triangular_upper( self, diag: Diag, f: impl for<'a> FnMut(<LastEq<usize, usize, M> as MatIndex<'a>>::Item), )
Applies f
to each element of the upper triangular half of self
.
diag
specifies whether the diagonal should be included or excluded.
§impl<M> LastEq<(), usize, M>
impl<M> LastEq<(), usize, M>
pub fn for_each(
self,
f: impl for<'a> FnMut(<LastEq<(), usize, M> as MatIndex<'a>>::Item),
)
pub fn for_each( self, f: impl for<'a> FnMut(<LastEq<(), usize, M> as MatIndex<'a>>::Item), )
Applies f
to each element of self
.
pub fn for_each_with_index(
self,
f: impl for<'a> FnMut(usize, <LastEq<(), usize, M> as MatIndex<'a>>::Item),
)
pub fn for_each_with_index( self, f: impl for<'a> FnMut(usize, <LastEq<(), usize, M> as MatIndex<'a>>::Item), )
Applies f
to each element of self
, while passing in the index of the current element.
§impl<M> LastEq<usize, (), M>
impl<M> LastEq<usize, (), M>
pub fn for_each(
self,
f: impl for<'a> FnMut(<LastEq<usize, (), M> as MatIndex<'a>>::Item),
)
pub fn for_each( self, f: impl for<'a> FnMut(<LastEq<usize, (), M> as MatIndex<'a>>::Item), )
Applies f
to each element of self
.
pub fn for_each_with_index(
self,
f: impl for<'a> FnMut(usize, <LastEq<usize, (), M> as MatIndex<'a>>::Item),
)
pub fn for_each_with_index( self, f: impl for<'a> FnMut(usize, <LastEq<usize, (), M> as MatIndex<'a>>::Item), )
Applies f
to each element of self
, while passing in the index of the current element.
Trait Implementations§
§impl<'a, Rows, Cols, Mat> MatIndex<'a> for LastEq<Rows, Cols, Mat>
impl<'a, Rows, Cols, Mat> MatIndex<'a> for LastEq<Rows, Cols, Mat>
§unsafe fn get_unchecked(
&'a mut self,
index: <LastEq<Rows, Cols, Mat> as MaybeContiguous>::Index,
) -> <LastEq<Rows, Cols, Mat> as MatIndex<'a>>::Item
unsafe fn get_unchecked( &'a mut self, index: <LastEq<Rows, Cols, Mat> as MaybeContiguous>::Index, ) -> <LastEq<Rows, Cols, Mat> as MatIndex<'a>>::Item
§unsafe fn get_from_slice_unchecked(
slice: &'a mut <LastEq<Rows, Cols, Mat> as MaybeContiguous>::Slice,
idx: usize,
) -> <LastEq<Rows, Cols, Mat> as MatIndex<'a>>::Item
unsafe fn get_from_slice_unchecked( slice: &'a mut <LastEq<Rows, Cols, Mat> as MaybeContiguous>::Slice, idx: usize, ) -> <LastEq<Rows, Cols, Mat> as MatIndex<'a>>::Item
§fn is_contiguous(&self) -> bool
fn is_contiguous(&self) -> bool
§fn preferred_layout(
&self,
) -> <LastEq<Rows, Cols, Mat> as MaybeContiguous>::LayoutTransform
fn preferred_layout( &self, ) -> <LastEq<Rows, Cols, Mat> as MaybeContiguous>::LayoutTransform
§fn with_layout(
self,
layout: <LastEq<Rows, Cols, Mat> as MaybeContiguous>::LayoutTransform,
) -> LastEq<Rows, Cols, Mat>
fn with_layout( self, layout: <LastEq<Rows, Cols, Mat> as MaybeContiguous>::LayoutTransform, ) -> LastEq<Rows, Cols, Mat>
§impl<Rows, Cols, Mat> MaybeContiguous for LastEq<Rows, Cols, Mat>
impl<Rows, Cols, Mat> MaybeContiguous for LastEq<Rows, Cols, Mat>
§type Index = <Mat as MaybeContiguous>::Index
type Index = <Mat as MaybeContiguous>::Index
§type Slice = Last<<Mat as MaybeContiguous>::Slice>
type Slice = Last<<Mat as MaybeContiguous>::Slice>
§type LayoutTransform = <Mat as MaybeContiguous>::LayoutTransform
type LayoutTransform = <Mat as MaybeContiguous>::LayoutTransform
§unsafe fn get_slice_unchecked(
&mut self,
idx: <LastEq<Rows, Cols, Mat> as MaybeContiguous>::Index,
n_elems: usize,
) -> <LastEq<Rows, Cols, Mat> as MaybeContiguous>::Slice
unsafe fn get_slice_unchecked( &mut self, idx: <LastEq<Rows, Cols, Mat> as MaybeContiguous>::Index, n_elems: usize, ) -> <LastEq<Rows, Cols, Mat> as MaybeContiguous>::Slice
n_elems
.impl<Rows, Cols, Mat> Copy for LastEq<Rows, Cols, Mat>
Auto Trait Implementations§
impl<Rows, Cols, Mat> Freeze for LastEq<Rows, Cols, Mat>where
Mat: Freeze,
impl<Rows, Cols, Mat> RefUnwindSafe for LastEq<Rows, Cols, Mat>where
Mat: RefUnwindSafe,
impl<Rows, Cols, Mat> Send for LastEq<Rows, Cols, Mat>where
Mat: Send,
impl<Rows, Cols, Mat> Sync for LastEq<Rows, Cols, Mat>where
Mat: Sync,
impl<Rows, Cols, Mat> Unpin for LastEq<Rows, Cols, Mat>where
Mat: Unpin,
impl<Rows, Cols, Mat> UnwindSafe for LastEq<Rows, Cols, Mat>where
Mat: UnwindSafe,
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
source§unsafe fn clone_to_uninit(&self, dst: *mut T)
unsafe fn clone_to_uninit(&self, dst: *mut T)
clone_to_uninit
)source§impl<T> IntoEither for T
impl<T> IntoEither for T
source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moresource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read more