coffee/etl
1
0
Fork 0
mirror of https://github.com/ETLCPP/etl.git synced 2026-04-30 19:09:10 +08:00
Code Issues Packages Projects Releases Wiki Activity

Support empty ranges in selection_sort

Browse Source
This commit is contained in:
Roland Reichwein 2026-03-08 21:19:40 +01:00
parent 570a431cfd
commit 19a1d7733b
2 changed files with 29 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
include/etl/algorithm.h
View File

@ -3109,6 +3109,11 @@ namespace etl
ETL_CONSTEXPR20
void selection_sort(TIterator first, TIterator last, TCompare compare)
{
if (first == last)
{
return;
}
TIterator min;
const TIterator ilast = private_algorithm::get_before_last(first, last);
const TIterator jlast = last;

24
test/test_algorithm.cpp
View File

@ -2163,6 +2163,30 @@ namespace
}
}
//*************************************************************************
TEST(selection_sort_empty_range)
{
// Forward iterators
std::forward_list<int> fwd_data;
etl::selection_sort(fwd_data.begin(), fwd_data.end());
CHECK(fwd_data.empty());
// Bidirectional iterators
std::list<int> bidir_data;
etl::selection_sort(bidir_data.begin(), bidir_data.end());
CHECK(bidir_data.empty());
// Random access iterators
std::vector<int> ra_data;
etl::selection_sort(ra_data.begin(), ra_data.end());
CHECK(ra_data.empty());
// With comparator
std::forward_list<int> fwd_data2;
etl::selection_sort(fwd_data2.begin(), fwd_data2.end(), std::greater<int>());
CHECK(fwd_data2.empty());
}
//*************************************************************************
TEST(heap_sort_default)
{