boostorg/algorithm
1
0
Fork 1
mirror of https://github.com/boostorg/algorithm.git synced 2025-07-29 20:17:17 +02:00
Code Issues Packages Projects Releases Wiki Activity

Split test cases

Browse Source
This commit is contained in:
Marshall Clow
2023-06-20 20:31:08 -07:00
parent 3ae9ee2f92
commit 8be54b3eb7
1 changed files with 4 additions and 13 deletions
Download Patch File Download Diff File Expand all files Collapse all files

17
test/indirect_sort_test.cpp
View File

@ -78,7 +78,7 @@ void test_one_sort(Iter first, Iter last, Comp comp) {
}
void test_sort () {
BOOST_AUTO_TEST_CASE(test_sort) {
int num[] = { 1,3,5,7,9, 2, 4, 6, 8, 10 };
const int sz = sizeof (num)/sizeof(num[0]);
int *first = &num[0];
@ -176,7 +176,7 @@ void test_one_stable_sort(Iter first, Iter last, Comp comp) {
BOOST_CHECK (boost::algorithm::is_sorted(v.begin(), v.end(), comp));
}
void test_stable_sort () {
BOOST_AUTO_TEST_CASE(test_stable_sort) {
typedef MyPair<int, long> Pair;
const int sz = 10;
Pair vals[sz];
@ -248,7 +248,7 @@ void test_one_partial_sort(Iter first, Iter middle, Iter last, Comp comp) {
}
void test_partial_sort () {
BOOST_AUTO_TEST_CASE(test_partial_sort) {
int num[] = { 1,3,5,7,9, 2, 4, 6, 8, 10 };
const int sz = sizeof (num)/sizeof(num[0]);
int *first = &num[0];
@ -323,7 +323,7 @@ void test_one_nth_element(Iter first, Iter nth, Iter last, Comp comp) {
}
void test_nth_element () {
BOOST_AUTO_TEST_CASE(test_nth_element) {
int num[] = { 1, 3, 5, 7, 9, 2, 4, 6, 8, 10, 1, 2, 3, 4, 5 };
const int sz = sizeof (num)/sizeof(num[0]);
int *first = &num[0];
@ -346,12 +346,3 @@ void test_nth_element () {
test_one_nth_element(v.begin(), v.begin() + (sz / 2), v.end());
test_one_nth_element(v.begin(), v.begin() + (sz / 2), v.end(), std::greater<int>());
}
BOOST_AUTO_TEST_CASE( test_main )
{
test_sort ();
test_stable_sort ();
test_partial_sort ();
test_nth_element ();
}