Actually we also support floating-point (32/64 bit, possibly even 16).
I've previously also looked into radix sort: https://arxiv.org/abs/1008.2849
Radix sort may actually be faster if you know that only a few bytes are guaranteed to distinguish keys, but that's difficult to guarantee/assume at the library level.
Radix sort may actually be faster if you know that only a few bytes are guaranteed to distinguish keys, but that's difficult to guarantee/assume at the library level.