I think this can be done by adding and making some other accommodating changes ``` uint_mapping(Forward, missing) = 2^8sizeof(UInt)-1 uint_mapping(Reverse, missing) = UInt(0) ``` This is the approach taken in [SortingLab.jl](https://github.com/xiaodaigh/SortingLab.jl) to support sorting of `Vector{Union{Missing, T}}` for radix-sort.