Trait bit_reverse::ParallelReverse
[−]
[src]
pub trait ParallelReverse<T> { fn swap_bits(self) -> T; }
Computes bit reversal by using a divide and conquer approach. Pairs of bits are swapped. Then neighboring bit pairs are swapped. Each time swapping the next largest group of bits. This is done until the entire data has been bit reversed.
Required Methods
fn swap_bits(self) -> T
Swaps the bits such that bit i is now bit N-i, where N is the length of the T in bits.
Implementors
impl ParallelReverse<u8> for u8
impl ParallelReverse<u16> for u16
impl ParallelReverse<u32> for u32
impl ParallelReverse<u64> for u64
impl ParallelReverse<usize> for usize
impl ParallelReverse<i8> for i8
impl ParallelReverse<i16> for i16
impl ParallelReverse<i32> for i32
impl ParallelReverse<i64> for i64
impl ParallelReverse<isize> for isize