There are several problem with that.
Once you are down to packing two, 3-bit or 4-bit values per byte, the cost of the encoding gets harder to claw back.
With the bit-encode sequences, you would have to count the zero and non-zero-ness of pairs, or triples or quads of bits. For 2 and 4 bits, this could be done using vec, but not very efficiently. Doing it for triples would be very laborious.
In reply to Re^3: Hamming Distance Between 2 Strings - Fast(est) Way?
by BrowserUk
in thread Hamming Distance Between 2 Strings - Fast(est) Way?
by monkfan
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |