forked from OctaForge/libostd
don't use lambda
parent
708100d171
commit
4850e2454f
|
@ -40,6 +40,15 @@ namespace octa {
|
||||||
insertion_sort(range, Less<typename RangeTraits<R>::value>());
|
insertion_sort(range, Less<typename RangeTraits<R>::value>());
|
||||||
}
|
}
|
||||||
|
|
||||||
|
namespace internal {
|
||||||
|
template<typename T, typename U>
|
||||||
|
struct UnaryCompare {
|
||||||
|
T val;
|
||||||
|
U comp;
|
||||||
|
bool operator()(const T &v) const { return comp(v, val); }
|
||||||
|
};
|
||||||
|
}
|
||||||
|
|
||||||
template<typename R, typename C>
|
template<typename R, typename C>
|
||||||
void quicksort(R range, C compare) {
|
void quicksort(R range, C compare) {
|
||||||
if (range.length() <= 10) {
|
if (range.length() <= 10) {
|
||||||
|
@ -48,8 +57,8 @@ namespace octa {
|
||||||
}
|
}
|
||||||
typename RangeTraits<R>::reference p = range[range.length() / 2];
|
typename RangeTraits<R>::reference p = range[range.length() / 2];
|
||||||
swap(p, range.last());
|
swap(p, range.last());
|
||||||
R r = partition(range, [p, compare](decltype(p) v) {
|
R r = partition(range, internal::UnaryCompare<decltype(p), C>{
|
||||||
return compare(v, p);
|
p, compare
|
||||||
});
|
});
|
||||||
R l = range.slice(0, range.length() - r.length());
|
R l = range.slice(0, range.length() - r.length());
|
||||||
swap(r.first(), r.last());
|
swap(r.first(), r.last());
|
||||||
|
|
Loading…
Reference in New Issue