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
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
|
// Boost.Range library
//
// Copyright Neil Groves 2009. Use, modification and
// distribution is subject to the Boost Software License, Version
// 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
//
//
// For more information, see http://www.boost.org/libs/range/
//
#include <boost/range/algorithm/partial_sort.hpp>
#include <boost/test/test_tools.hpp>
#include <boost/test/unit_test.hpp>
#include <boost/assign.hpp>
#include <algorithm>
#include <functional>
#include <list>
#include <numeric>
#include <deque>
#include <vector>
namespace boost
{
namespace
{
struct partial_sort_policy
{
template<class Container, class Iterator>
void test_partial_sort(Container& cont, Iterator mid)
{
const Container old_cont(cont);
boost::partial_sort(cont, mid);
const std::size_t index = std::distance(cont.begin(), mid);
Container cont2(old_cont);
Iterator mid2(cont2.begin());
std::advance(mid2, index);
boost::partial_sort(cont2, mid2);
BOOST_CHECK_EQUAL_COLLECTIONS( cont.begin(), cont.end(),
cont2.begin(), cont2.end() );
}
template<class Container, class Iterator>
void reference_partial_sort(Container& cont, Iterator mid)
{
std::partial_sort(cont.begin(), mid, cont.end());
}
};
template<class BinaryPredicate>
struct partial_sort_pred_policy
{
template<class Container, class Iterator>
void test_partial_sort(Container& cont, Iterator mid)
{
const Container old_cont(cont);
boost::partial_sort(cont, mid, BinaryPredicate());
const std::size_t index = std::distance(cont.begin(), mid);
Container cont2(old_cont);
Iterator mid2(cont2.begin());
std::advance(mid2, index);
boost::partial_sort(cont2, mid2, BinaryPredicate());
BOOST_CHECK_EQUAL_COLLECTIONS( cont.begin(), cont.end(),
cont2.begin(), cont2.end() );
}
template<class Container, class Iterator>
void reference_partial_sort(Container& cont, Iterator mid)
{
std::partial_sort(cont.begin(), mid, cont.end(), BinaryPredicate());
}
};
template<class Container, class TestPolicy>
void test_partial_sort_tp_impl(Container& cont, TestPolicy policy)
{
Container reference(cont);
Container test(cont);
typedef BOOST_DEDUCED_TYPENAME range_iterator<Container>::type iterator_t;
BOOST_CHECK_EQUAL( reference.size(), test.size() );
if (reference.size() != test.size())
return;
iterator_t reference_mid = reference.begin();
iterator_t test_mid = test.begin();
bool complete = false;
while (!complete)
{
if (reference_mid == reference.end())
complete = true;
policy.test_partial_sort(test, test_mid);
policy.reference_partial_sort(reference, reference_mid);
BOOST_CHECK_EQUAL_COLLECTIONS(
reference.begin(), reference.end(),
test.begin(), test.end()
);
if (reference_mid != reference.end())
{
++reference_mid;
++test_mid;
}
}
}
template<class Container>
void test_partial_sort_impl(Container& cont)
{
test_partial_sort_tp_impl(cont, partial_sort_policy());
}
template<class Container, class BinaryPredicate>
void test_partial_sort_impl(Container& cont, BinaryPredicate pred)
{
test_partial_sort_tp_impl(cont, partial_sort_pred_policy<BinaryPredicate>());
}
template<class Container>
void test_partial_sort_impl()
{
using namespace boost::assign;
Container cont;
test_partial_sort_impl(cont);
test_partial_sort_impl(cont, std::less<int>());
test_partial_sort_impl(cont, std::greater<int>());
cont.clear();
cont += 1;
test_partial_sort_impl(cont);
test_partial_sort_impl(cont, std::less<int>());
test_partial_sort_impl(cont, std::greater<int>());
cont.clear();
cont += 1,2,3,4,5,6,7,8,9;
test_partial_sort_impl(cont);
test_partial_sort_impl(cont, std::less<int>());
test_partial_sort_impl(cont, std::greater<int>());
}
void test_partial_sort()
{
test_partial_sort_impl< std::vector<int> >();
test_partial_sort_impl< std::deque<int> >();
}
}
}
boost::unit_test::test_suite*
init_unit_test_suite(int argc, char* argv[])
{
boost::unit_test::test_suite* test
= BOOST_TEST_SUITE( "RangeTestSuite.algorithm.partial_sort" );
test->add( BOOST_TEST_CASE( &boost::test_partial_sort ) );
return test;
}
|
