Sort implementation for key of radix sortable type type with default sorting.
More...
template<typename RandomAccessIt, typename UnaryOperation, typename LessT, typename SortKey, std::size_t small_size, bool M>
struct kblib::detail_sort::sort_transform_impl< RandomAccessIt, UnaryOperation, std::less< LessT >, SortKey, small_size, M, false, true, false >
Sort implementation for key of radix sortable type type with default sorting.
Definition at line 627 of file sort.h.
template<typename RandomAccessIt , typename UnaryOperation , typename LessT , typename SortKey , std::size_t small_size, bool M>
static constexpr auto kblib::detail_sort::sort_transform_impl< RandomAccessIt, UnaryOperation, std::less< LessT >, SortKey, small_size, M, false, true, false >::inplace |
( |
RandomAccessIt |
begin, |
|
|
const RandomAccessIt |
end, |
|
|
UnaryOperation && |
transform, |
|
|
std::less< LessT > && |
compare |
|
) |
| -> void |
|
inlinestaticconstexpr |
TODO(killerbee13): write efficient inplace radix sort_transform
Definition at line 629 of file sort.h.