An implementation of Elias–Fano's representation of monotone sequences; an element occupies a number of bits bounded by two plus the logarithm of the average gap.

A transformation strategy that converts strings representing integers between 0 (inclusive)
and 2^{k} (exclusive)) into fixed-length binary vectors (most-significant
bit is the 0-th).