This library provides a number of ways to compute the bit reversal of all primitive integers. There are currently 3 different algorithms implemented: Bitwise, Parallel, and Lookup reversal.
Relatively bitwise is slower than parallel and lookup reversal. Parallel seems to be slightly slower than lookup for small sized integers, but regaining a lead for larger sized integers.
Bitwise uses the least amount of memory only using three integers to compute the reversal. Parallel allocates 3 constants of the same size of the type being reversed. Lookup allocates 256 u8s or 256 bytes to do its byte lookup reversal.
```rust use bit_reverse::ParallelReverse;
asserteq!(0xA0u8.swapbits(), 0x05u8); ```