pub struct Transpose<C>(pub C);Expand description
Data block transposition wrapper
Like Parallel but reinterpreting data as transpose [[X; N]] <-> [[X]; N]
such that block() and inplace() are lowered.
Tuple Fields§
§0: CTrait Implementations§
Source§impl<X: Copy, C0, C1, S0, S1> SplitInplace<[X; 2], (S0, S1)> for Transpose<(C0, C1)>where
C0: SplitInplace<X, S0>,
C1: SplitInplace<X, S1>,
impl<X: Copy, C0, C1, S0, S1> SplitInplace<[X; 2], (S0, S1)> for Transpose<(C0, C1)>where
C0: SplitInplace<X, S0>,
C1: SplitInplace<X, S1>,
Source§impl<X: Copy + Default, C, S, const N: usize> SplitInplace<[X; N], [S; N]> for Transpose<[C; N]>where
C: SplitInplace<X, S>,
impl<X: Copy + Default, C, S, const N: usize> SplitInplace<[X; N], [S; N]> for Transpose<[C; N]>where
C: SplitInplace<X, S>,
Source§impl<X: Copy, Y, C0, C1, S0, S1> SplitProcess<[X; 2], [Y; 2], (S0, S1)> for Transpose<(C0, C1)>where
C0: SplitProcess<X, Y, S0>,
C1: SplitProcess<X, Y, S1>,
impl<X: Copy, Y, C0, C1, S0, S1> SplitProcess<[X; 2], [Y; 2], (S0, S1)> for Transpose<(C0, C1)>where
C0: SplitProcess<X, Y, S0>,
C1: SplitProcess<X, Y, S1>,
Source§impl<X: Copy, Y: Copy + Default, C, S, const N: usize> SplitProcess<[X; N], [Y; N], [S; N]> for Transpose<[C; N]>where
C: SplitProcess<X, Y, S>,
impl<X: Copy, Y: Copy + Default, C, S, const N: usize> SplitProcess<[X; N], [Y; N], [S; N]> for Transpose<[C; N]>where
C: SplitProcess<X, Y, S>,
impl<C: Copy> Copy for Transpose<C>
Auto Trait Implementations§
impl<C> Freeze for Transpose<C>where
C: Freeze,
impl<C> RefUnwindSafe for Transpose<C>where
C: RefUnwindSafe,
impl<C> Send for Transpose<C>where
C: Send,
impl<C> Sync for Transpose<C>where
C: Sync,
impl<C> Unpin for Transpose<C>where
C: Unpin,
impl<C> UnwindSafe for Transpose<C>where
C: 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