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