A fast IndexMapping that approximates the memory-optimal LogarithmicMapping by extracting the floor value of the logarithm to the base 2 from the binary representations of floating-point values and cubically interpolating the logarithm in-between.

A fast IndexMapping that approximates the memory-optimal LogarithmicMapping by extracting the floor value of the logarithm to the base 2 from the binary representations of floating-point values and linearly interpolating the logarithm in-between.

An IndexMapping that is memory-optimal, that is to say that given a targeted relative accuracy, it requires the least number of indices to cover a given range of values.