rexy712/rexylib
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

move quicksort partitioner to detail namespace

Browse Source
This commit is contained in:
rexy712 2020-05-07 11:57:06 -07:00
parent 31a177fc86
commit ef5cccee73
1 changed files with 21 additions and 19 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
include/rexy/cx/algorithm.hpp
View File

@ -25,6 +25,7 @@
namespace rexy::cx{ namespace rexy::cx{
namespace detail{
template<class Iter, class Compare> template<class Iter, class Compare>
constexpr Iter qs_partition(Iter left, Iter right, const Compare& cmp) constexpr Iter qs_partition(Iter left, Iter right, const Compare& cmp)
noexcept(std::is_nothrow_invocable<Compare,decltype(*left),decltype(*right)>::value && noexcept(std::is_nothrow_invocable<Compare,decltype(*left),decltype(*right)>::value &&
@ -46,13 +47,14 @@ namespace rexy::cx{
cx::swap(*left, *right); cx::swap(*left, *right);
return left; return left;
} }
}
template<class Iter, class Compare> template<class Iter, class Compare>
constexpr void quicksort(Iter left, Iter right, const Compare& cmp) constexpr void quicksort(Iter left, Iter right, const Compare& cmp)
noexcept(noexcept(cx::qs_partition(left, right, cmp))) noexcept(noexcept(cx::detail::qs_partition(left, right, cmp)))
{ {
while(left < right){ while(left < right){
auto real_right = right-1; auto real_right = right-1;
auto pivot = qs_partition(left, real_right, cmp); auto pivot = detail::qs_partition(left, real_right, cmp);
quicksort(left, pivot, cmp); quicksort(left, pivot, cmp);
left = ++pivot; left = ++pivot;
} }