boostorg/move
1
0
Fork 1
mirror of https://github.com/boostorg/move.git synced 2025-08-02 13:44:28 +02:00
Code Issues Packages Projects Releases Wiki Activity

Add std::sort to the benchmark

Browse Source
This commit is contained in:
Ion Gaztañaga
2018-01-30 14:19:13 +01:00
parent a296628ce3
commit 06e5c18802
1 changed files with 9 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
test/bench_sort.cpp
View File

@@ -78,6 +78,7 @@ enum AlgoType
MergeSort, MergeSort,
StableSort, StableSort,
PdQsort, PdQsort,
StdSort,
AdaptiveSort, AdaptiveSort,
SqrtHAdaptiveSort, SqrtHAdaptiveSort,
SqrtAdaptiveSort, SqrtAdaptiveSort,
@@ -92,6 +93,7 @@ enum AlgoType
const char *AlgoNames [] = { "MergeSort " const char *AlgoNames [] = { "MergeSort "
, "StableSort " , "StableSort "
, "PdQsort " , "PdQsort "
, "StdSort "
, "AdaptSort " , "AdaptSort "
, "SqrtHAdaptSort " , "SqrtHAdaptSort "
, "SqrtAdaptSort " , "SqrtAdaptSort "
@@ -126,6 +128,9 @@ bool measure_algo(T *elements, std::size_t key_reps[], std::size_t element_count
case PdQsort: case PdQsort:
boost::movelib::pdqsort(elements,elements+element_count,order_type_less()); boost::movelib::pdqsort(elements,elements+element_count,order_type_less());
break; break;
case StdSort:
std::sort(elements,elements+element_count,order_type_less());
break;
case AdaptiveSort: case AdaptiveSort:
boost::movelib::adaptive_sort(elements, elements+element_count, order_type_less()); boost::movelib::adaptive_sort(elements, elements+element_count, order_type_less());
break; break;
@@ -190,7 +195,7 @@ bool measure_algo(T *elements, std::size_t key_reps[], std::size_t element_count
, units , units
, prev_clock ? double(new_clock)/double(prev_clock): 1.0); , prev_clock ? double(new_clock)/double(prev_clock): 1.0);
prev_clock = new_clock; prev_clock = new_clock;
bool res = is_order_type_ordered(elements, element_count, alg != HeapSort && alg != PdQsort); bool res = is_order_type_ordered(elements, element_count, alg != HeapSort && alg != PdQsort && alg != StdSort);
return res; return res;
} }
@@ -216,6 +221,9 @@ bool measure_all(std::size_t L, std::size_t NK)
res = res && measure_algo(A,Keys,L,NK,PdQsort, prev_clock); res = res && measure_algo(A,Keys,L,NK,PdQsort, prev_clock);
// //
prev_clock = back_clock; prev_clock = back_clock;
res = res && measure_algo(A,Keys,L,NK,StdSort, prev_clock);
//
prev_clock = back_clock;
res = res && measure_algo(A,Keys,L,NK,HeapSort, prev_clock); res = res && measure_algo(A,Keys,L,NK,HeapSort, prev_clock);
// //
prev_clock = back_clock; prev_clock = back_clock;