algorithm/test/sort_subrange_test.cpp at develop · boostorg/algorithm · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
#include <boost/config.hpp>
#include <boost/algorithm/sort_subrange.hpp>
#include <boost/algorithm/cxx11/is_sorted.hpp>

#define BOOST_TEST_MAIN
#include <boost/test/unit_test.hpp>

#include <vector>
#include <iostream>

#if (__cplusplus >= 201103L) || defined(BOOST_NO_CXX98_RANDOM_SHUFFLE)
#include <random>

std::default_random_engine gen;
template<typename RandomIt>
void do_shuffle(RandomIt first, RandomIt last)
{ std::shuffle(first, last, gen); }
#else
template<typename RandomIt>
void do_shuffle(RandomIt first, RandomIt last)
{ std::random_shuffle(first, last); }
#endif

namespace ba = boost::algorithm;

template <typename Iter>
void check_sequence ( Iter first, Iter last, Iter sf, Iter sl )
{
	if (sf == sl) return;
	for (Iter i = first; i < sf; ++i)
		BOOST_CHECK(*i < *sf);
	BOOST_CHECK(ba::is_sorted(sf, sl));
	for (Iter i = sl; i < last; ++i)
		BOOST_CHECK(*(sl-1) < *i);
}

template <typename Iter, typename Pred>
void check_sequence ( Iter first, Iter last, Iter sf, Iter sl, Pred p )
{
	if (sf == sl) return;
	for (Iter i = first; i < sf; ++i)
		BOOST_CHECK(p(*i, *sf));
	BOOST_CHECK(ba::is_sorted(sf, sl, p));
	for (Iter i = sl; i < last; ++i)
		BOOST_CHECK(p(*(sl-1), *i));

}

// 	for ( int i = 0; i < v.size(); ++i )
// 		std::cout << v[i] << ' ';
// 	std::cout << std::endl;


BOOST_AUTO_TEST_CASE( test_main )
{
	{
	std::vector<int> v;
	for ( int i = 0; i < 10; ++i )
		v.push_back(i);

	const std::vector<int>::iterator b = v.begin();
	ba::sort_subrange(b, v.end(), b + 3, b + 6);
	check_sequence   (b, v.end(), b + 3, b + 6);

	BOOST_CHECK_EQUAL(v[3], 3);
	BOOST_CHECK_EQUAL(v[4], 4);
	BOOST_CHECK_EQUAL(v[5], 5);

//	Mix them up and try again - single element
	do_shuffle(v.begin(), v.end());
	ba::sort_subrange(b, v.end(), b + 7, b + 8);
	check_sequence   (b, v.end(), b + 7, b + 8);

	BOOST_CHECK_EQUAL(v[7], 7);

//	Mix them up and try again - at the end
	do_shuffle(v.begin(), v.end());
	ba::sort_subrange(b, v.end(), b + 7, v.end());
	check_sequence   (b, v.end(), b + 7, v.end());

	BOOST_CHECK_EQUAL(v[7], 7);
	BOOST_CHECK_EQUAL(v[8], 8);
	BOOST_CHECK_EQUAL(v[9], 9);

//	Mix them up and try again - at the beginning
	do_shuffle(v.begin(), v.end());
	ba::sort_subrange(b, v.end(), b, b + 2);
	check_sequence   (b, v.end(), b, b + 2);

	BOOST_CHECK_EQUAL(v[0], 0);
	BOOST_CHECK_EQUAL(v[1], 1);

//	Mix them up and try again - empty subrange
	do_shuffle(v.begin(), v.end());
	ba::sort_subrange(b, v.end(), b, b);
	check_sequence   (b, v.end(), b, b);

//	Mix them up and try again - entire subrange
	do_shuffle(v.begin(), v.end());
	ba::sort_subrange(b, v.end(), b, v.end());
	check_sequence   (b, v.end(), b, v.end());
	}

	{
	std::vector<int> v;
	for ( int i = 0; i < 10; ++i )
		v.push_back(i);

	const std::vector<int>::iterator b = v.begin();
	ba::sort_subrange(b, v.end(), b + 3, b + 6, std::greater<int>());
	check_sequence   (b, v.end(), b + 3, b + 6, std::greater<int>());

	BOOST_CHECK_EQUAL(v[3], 6);
	BOOST_CHECK_EQUAL(v[4], 5);
	BOOST_CHECK_EQUAL(v[5], 4);

//	Mix them up and try again - single element
	do_shuffle(v.begin(), v.end());
	ba::sort_subrange(b, v.end(), b + 7, b + 8, std::greater<int>());
	check_sequence   (b, v.end(), b + 7, b + 8, std::greater<int>());

	BOOST_CHECK_EQUAL(v[7], 2);

//	Mix them up and try again - at the end
	do_shuffle(v.begin(), v.end());
	ba::sort_subrange(b, v.end(), b + 7, v.end(), std::greater<int>());
	check_sequence   (b, v.end(), b + 7, v.end(), std::greater<int>());

	BOOST_CHECK_EQUAL(v[7], 2);
	BOOST_CHECK_EQUAL(v[8], 1);
	BOOST_CHECK_EQUAL(v[9], 0);

//	Mix them up and try again - at the beginning
	do_shuffle(v.begin(), v.end());
	ba::sort_subrange(b, v.end(), b, b + 2, std::greater<int>());
	check_sequence   (b, v.end(), b, b + 2, std::greater<int>());

	BOOST_CHECK_EQUAL(v[0], 9);
	BOOST_CHECK_EQUAL(v[1], 8);

//	Mix them up and try again - empty subrange
	do_shuffle(v.begin(), v.end());
	ba::sort_subrange(b, v.end(), b, b, std::greater<int>());
	check_sequence   (b, v.end(), b, b, std::greater<int>());

//	Mix them up and try again - entire subrange
	do_shuffle(v.begin(), v.end());
	ba::sort_subrange(b, v.end(), b, v.end(), std::greater<int>());
	check_sequence   (b, v.end(), b, v.end(), std::greater<int>());
	}
}