pub struct ZipEq<Rows, Cols, Head: MatShape<Rows = Rows, Cols = Cols>, Tail: MatShape<Rows = Rows, Cols = Cols>>(/* private fields */);Implementations§
source§impl<Rows: Copy + Eq, Cols: Copy + Eq, Head: MatShape<Rows = Rows, Cols = Cols>, Tail: MatShape<Rows = Rows, Cols = Cols>> ZipEq<Rows, Cols, Head, Tail>
impl<Rows: Copy + Eq, Cols: Copy + Eq, Head: MatShape<Rows = Rows, Cols = Cols>, Tail: MatShape<Rows = Rows, Cols = Cols>> ZipEq<Rows, Cols, Head, Tail>
pub fn new(head: Head, tail: Tail) -> Self
pub fn new_unchecked(head: Head, tail: Tail) -> Self
source§impl<Head: for<'a> MatIndex<'a, Rows = (), Cols = usize, Index = ((), usize), LayoutTransform = VecLayoutTransform>, Tail: for<'a> MatIndex<'a, Rows = (), Cols = usize, Index = ((), usize), LayoutTransform = VecLayoutTransform>> ZipEq<(), usize, Head, Tail>
impl<Head: for<'a> MatIndex<'a, Rows = (), Cols = usize, Index = ((), usize), LayoutTransform = VecLayoutTransform>, Tail: for<'a> MatIndex<'a, Rows = (), Cols = usize, Index = ((), usize), LayoutTransform = VecLayoutTransform>> ZipEq<(), usize, Head, Tail>
source§impl<Head: for<'a> MatIndex<'a, Rows = usize, Cols = (), Index = (usize, ()), LayoutTransform = VecLayoutTransform>, Tail: for<'a> MatIndex<'a, Rows = usize, Cols = (), Index = (usize, ()), LayoutTransform = VecLayoutTransform>> ZipEq<usize, (), Head, Tail>
impl<Head: for<'a> MatIndex<'a, Rows = usize, Cols = (), Index = (usize, ()), LayoutTransform = VecLayoutTransform>, Tail: for<'a> MatIndex<'a, Rows = usize, Cols = (), Index = (usize, ()), LayoutTransform = VecLayoutTransform>> ZipEq<usize, (), Head, Tail>
source§impl<Head: for<'a> MatIndex<'a, Rows = usize, Cols = usize, Index = (usize, usize), LayoutTransform = MatLayoutTransform>, Tail: for<'a> MatIndex<'a, Rows = usize, Cols = usize, Index = (usize, usize), LayoutTransform = MatLayoutTransform>> ZipEq<usize, usize, Head, Tail>
impl<Head: for<'a> MatIndex<'a, Rows = usize, Cols = usize, Index = (usize, usize), LayoutTransform = MatLayoutTransform>, Tail: for<'a> MatIndex<'a, Rows = usize, Cols = usize, Index = (usize, usize), LayoutTransform = MatLayoutTransform>> ZipEq<usize, usize, Head, Tail>
pub fn for_each(self, f: impl for<'a> FnMut(<Self as MatIndex<'a>>::Item))
pub fn for_each_triangular_lower( self, diag: Diag, f: impl for<'a> FnMut(<Self as MatIndex<'a>>::Item) )
pub fn for_each_triangular_upper( self, diag: Diag, f: impl for<'a> FnMut(<Self as MatIndex<'a>>::Item) )
pub fn map<E: Entity>( self, f: impl for<'a> FnMut(<Self as MatIndex<'a>>::Item) -> E ) -> Mat<E>
Trait Implementations§
source§impl<Rows: Clone, Cols: Clone, Head: Clone + MatShape<Rows = Rows, Cols = Cols>, Tail: Clone + MatShape<Rows = Rows, Cols = Cols>> Clone for ZipEq<Rows, Cols, Head, Tail>
impl<Rows: Clone, Cols: Clone, Head: Clone + MatShape<Rows = Rows, Cols = Cols>, Tail: Clone + MatShape<Rows = Rows, Cols = Cols>> Clone for ZipEq<Rows, Cols, Head, Tail>
source§impl<Rows: Debug, Cols: Debug, Head: Debug + MatShape<Rows = Rows, Cols = Cols>, Tail: Debug + MatShape<Rows = Rows, Cols = Cols>> Debug for ZipEq<Rows, Cols, Head, Tail>
impl<Rows: Debug, Cols: Debug, Head: Debug + MatShape<Rows = Rows, Cols = Cols>, Tail: Debug + MatShape<Rows = Rows, Cols = Cols>> Debug for ZipEq<Rows, Cols, Head, Tail>
source§impl<'a, Rows: Copy + Eq, Cols: Copy + Eq, Head: MatIndex<'a, Rows = Rows, Cols = Cols>, Tail: MatIndex<'a, Rows = Rows, Cols = Cols, Index = Head::Index, LayoutTransform = Head::LayoutTransform>> MatIndex<'a> for ZipEq<Rows, Cols, Head, Tail>
impl<'a, Rows: Copy + Eq, Cols: Copy + Eq, Head: MatIndex<'a, Rows = Rows, Cols = Cols>, Tail: MatIndex<'a, Rows = Rows, Cols = Cols, Index = Head::Index, LayoutTransform = Head::LayoutTransform>> MatIndex<'a> for ZipEq<Rows, Cols, Head, Tail>
type Item = Zip<<Head as MatIndex<'a>>::Item, <Tail as MatIndex<'a>>::Item>
unsafe fn get_unchecked(&'a mut self, index: Self::Index) -> Self::Item
unsafe fn get_from_slice_unchecked( slice: &'a mut Self::Slice, idx: usize ) -> Self::Item
fn is_contiguous(&self) -> bool
fn preferred_layout(&self) -> Self::LayoutTransform
fn with_layout(self, layout: Self::LayoutTransform) -> Self
source§impl<Rows: Copy + Eq, Cols: Copy + Eq, Head: MatShape<Rows = Rows, Cols = Cols>, Tail: MatShape<Rows = Rows, Cols = Cols>> MatShape for ZipEq<Rows, Cols, Head, Tail>
impl<Rows: Copy + Eq, Cols: Copy + Eq, Head: MatShape<Rows = Rows, Cols = Cols>, Tail: MatShape<Rows = Rows, Cols = Cols>> MatShape for ZipEq<Rows, Cols, Head, Tail>
source§impl<Rows: Copy + Eq, Cols: Copy + Eq, Head: MaybeContiguous<Rows = Rows, Cols = Cols>, Tail: MaybeContiguous<Rows = Rows, Cols = Cols, Index = Head::Index, LayoutTransform = Head::LayoutTransform>> MaybeContiguous for ZipEq<Rows, Cols, Head, Tail>
impl<Rows: Copy + Eq, Cols: Copy + Eq, Head: MaybeContiguous<Rows = Rows, Cols = Cols>, Tail: MaybeContiguous<Rows = Rows, Cols = Cols, Index = Head::Index, LayoutTransform = Head::LayoutTransform>> MaybeContiguous for ZipEq<Rows, Cols, Head, Tail>
type Index = <Head as MaybeContiguous>::Index
type Slice = Zip<<Head as MaybeContiguous>::Slice, <Tail as MaybeContiguous>::Slice>
type LayoutTransform = <Head as MaybeContiguous>::LayoutTransform
unsafe fn get_slice_unchecked( &mut self, idx: Self::Index, n_elems: usize ) -> Self::Slice
impl<Rows: Copy, Cols: Copy, Head: Copy + MatShape<Rows = Rows, Cols = Cols>, Tail: Copy + MatShape<Rows = Rows, Cols = Cols>> Copy for ZipEq<Rows, Cols, Head, Tail>
Auto Trait Implementations§
impl<Rows, Cols, Head, Tail> RefUnwindSafe for ZipEq<Rows, Cols, Head, Tail>where
Head: RefUnwindSafe,
Tail: RefUnwindSafe,
impl<Rows, Cols, Head, Tail> Send for ZipEq<Rows, Cols, Head, Tail>
impl<Rows, Cols, Head, Tail> Sync for ZipEq<Rows, Cols, Head, Tail>
impl<Rows, Cols, Head, Tail> Unpin for ZipEq<Rows, Cols, Head, Tail>
impl<Rows, Cols, Head, Tail> UnwindSafe for ZipEq<Rows, Cols, Head, Tail>where
Head: UnwindSafe,
Tail: 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
Mutably borrows from an owned value. Read more