nerdcruft/libcruft-util
1
0
Fork 0
Code Issues Releases Activity

sort: use a comparator object for index sort

Browse Source
This commit is contained in:
Danny Robson 2020-10-15 09:40:01 +10:00
parent 801ccf2ebd
commit f3302ffd5f
1 changed files with 15 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

19
algo/sort.hpp
View File

@ -96,16 +96,27 @@ namespace cruft::sort {
/// RandomIterator `data`. /// RandomIterator `data`.
/// ///
/// Does not modify any data element pointed to by `data`. /// Does not modify any data element pointed to by `data`.
template <typename IndexT, typename RandomT> template <
typename IndexT,
typename RandomT,
typename ComparatorT = std::less<>
>
void void
indices (IndexT idx_first, IndexT idx_last, RandomT data) indices (
{ IndexT idx_first,
IndexT idx_last,
RandomT data,
ComparatorT &&cmp
) {
// initialise a monotonic sequence of indices // initialise a monotonic sequence of indices
std::iota (idx_first, idx_last, 0); std::iota (idx_first, idx_last, 0);
// sort using the indices // sort using the indices
std::sort (idx_first, idx_last, [&] (auto a, auto b) { std::sort (idx_first, idx_last, [&] (auto a, auto b) {
return *(data + a) < *(data + b); return cmp (
*(data + a),
*(data + b)
);
}); });
} }