JDBtracker
/
libostd
forked from OctaForge/libostd
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

get rid of __Octa/__octa in algorithm

master
Daniel Kolesa 2015-06-03 22:43:07 +01:00
parent 6c20f00494
commit ae05420994
1 changed files with 80 additions and 74 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

42
octa/algorithm.h
View File

@ -39,8 +39,9 @@ namespace octa {
/* sorting */
namespace detail {
template<typename _R, typename _C>
void __octa_insort(_R __range, _C __compare) {
void insort(_R __range, _C __compare) {
octa::RangeSize<_R> __rlen = __range.size();
for (octa::RangeSize<_R> __i = 1; __i < __rlen; ++__i) {
octa::RangeSize<_R> __j = __i;
@ -54,14 +55,14 @@ namespace octa {
}
template<typename _T, typename _U>
struct __OctaUnaryCompare {
struct UnaryCompare {
const _T &__val;
_U __comp;
bool operator()(const _T &__v) const { return __comp(__v, __val); }
};
template<typename _R, typename _C>
void __octa_hs_sift_down(_R __range, octa::RangeSize<_R> __s,
void hs_sift_down(_R __range, octa::RangeSize<_R> __s,
octa::RangeSize<_R> __e, _C __compare) {
octa::RangeSize<_R> __r = __s;
while ((__r * 2 + 1) <= __e) {
@ -79,50 +80,51 @@ namespace octa {
}
template<typename _R, typename _C>
void __octa_heapsort(_R __range, _C __compare) {
void heapsort(_R __range, _C __compare) {
octa::RangeSize<_R> __len = __range.size();
octa::RangeSize<_R> __st = (__len - 2) / 2;
for (;;) {
__octa_hs_sift_down(__range, __st, __len - 1, __compare);
octa::detail::hs_sift_down(__range, __st, __len - 1, __compare);
if (__st-- == 0) break;
}
octa::RangeSize<_R> __e = __len - 1;
while (__e > 0) {
octa::swap(__range[__e], __range[0]);
--__e;
__octa_hs_sift_down(__range, 0, __e, __compare);
octa::detail::hs_sift_down(__range, 0, __e, __compare);
}
}
template<typename _R, typename _C>
void __octa_introloop(_R __range, _C __compare, RangeSize<_R> __depth) {
void introloop(_R __range, _C __compare, RangeSize<_R> __depth) {
if (__range.size() <= 10) {
__octa_insort(__range, __compare);
octa::detail::insort(__range, __compare);
return;
}
if (__depth == 0) {
__octa_heapsort(__range, __compare);
octa::detail::heapsort(__range, __compare);
return;
}
octa::RangeReference<_R> __p = __range[__range.size() / 2];
octa::swap(__p, __range.back());
_R __r = octa::partition(__range,
__OctaUnaryCompare<decltype(__p), _C>{ __p, __compare });
octa::detail::UnaryCompare<decltype(__p), _C>{ __p, __compare });
_R __l = __range.slice(0, __range.size() - __r.size());
octa::swap(__r.front(), __r.back());
__octa_introloop(__l, __compare, __depth - 1);
__octa_introloop(__r, __compare, __depth - 1);
octa::detail::introloop(__l, __compare, __depth - 1);
octa::detail::introloop(__r, __compare, __depth - 1);
}
template<typename _R, typename _C>
void __octa_introsort(_R __range, _C __compare) {
__octa_introloop(__range, __compare, octa::RangeSize<_R>(2
void introsort(_R __range, _C __compare) {
octa::detail::introloop(__range, __compare, octa::RangeSize<_R>(2
* (log(__range.size()) / log(2))));
}
}
template<typename _R, typename _C>
void sort(_R __range, _C __compare) {
__octa_introsort(__range, __compare);
octa::detail::introsort(__range, __compare);
}
template<typename _R>
@ -489,12 +491,16 @@ namespace octa {
}
};
template<typename _R, typename _F> using __OctaMapReturnType
namespace detail {
template<typename _R, typename _F> using MapReturnType
= decltype(declval<_F>()(octa::declval<octa::RangeReference<_R>>()));
}
template<typename _R, typename _F>
MapRange<_R, __OctaMapReturnType<_R, _F>> map(_R __range, _F __func) {
return octa::MapRange<_R, __OctaMapReturnType<_R, _F>>(__range, __func);
MapRange<_R, octa::detail::MapReturnType<_R, _F>> map(_R __range,
_F __func) {
return octa::MapRange<_R, octa::detail::MapReturnType<_R, _F>>(__range,
__func);
}
template<typename _T>