Sorted set lex ranges stress tester.
ZREMRANGE* commands refactored into a single generic function.
Always pass sorted set range objects by reference.
ZREMRANGEBYLEX implemented.
HyperLogLog low level merge extracted from PFMERGE.
PFCOUNT support for multi-key union.
Speedup SUM(2^-reg[m]) in HyperLogLog computation.

When the register is set to zero, we need to add 2^-0 to E, which is 1,
but it is faster to just add 'ez' at the end, which is the number of
registers set to zero, a value we need to compute anyway.
Speedup hllRawSum() processing 8 bytes per iteration.

The internal HLL raw encoding used by PFCOUNT when merging multiple keys
is aligned to 8 bits (1 byte per register) so we can exploit this to
improve performances by processing multiple bytes per iteration.

In benchmarks the new code was several times faster with HLLs with many
registers set to zero, while no slowdown was observed with populated
HLLs.
PFCOUNT multi-key test added.
ZREMRANGEBYLEX memory leak removed calling zslFreeLexRange().
Fuzzy test for ZREMRANGEBYLEX added.