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

unexpose insertion sort

master
Daniel Kolesa 2015-05-24 18:22:35 +01:00
parent 96d2404c0e
commit ffbb7da63a
1 changed files with 5 additions and 11 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

16
octa/algorithm.h
View File

@ -37,13 +37,14 @@ namespace octa {
return true;
}
/* insertion sort */
/* sorting */
template<typename R, typename C>
void insertion_sort(R range, C compare) {
void __octa_insort(R range, C compare) {
RangeSize<R> rlen = range.length();
for (RangeSize<R> i = 1; i < rlen; ++i) {
RangeSize<R> j = i, v = range[i];
RangeSize<R> j = i;
RangeReference<R> v = range[i];
while (j > 0 && !compare(range[j - 1], v)) {
range[j] = range[j - 1];
--j;
@ -52,13 +53,6 @@ namespace octa {
}
}
template<typename R>
void insertion_sort(R range) {
insertion_sort(range, Less<RangeValue<R>>());
}
/* sort (introsort) */
template<typename T, typename U>
struct __OctaUnaryCompare {
const T &val;
@ -103,7 +97,7 @@ namespace octa {
template<typename R, typename C>
void __octa_introloop(R range, C compare, RangeSize<R> depth) {
if (range.length() <= 10) {
insertion_sort(range, compare);
__octa_insort(range, compare);
return;
}
if (depth == 0) {