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
171
|
// 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/adaptor/map.hpp>
#include <boost/test/test_tools.hpp>
#include <boost/test/unit_test.hpp>
#include <boost/array.hpp>
#include <boost/assign.hpp>
#include <boost/range/algorithm_ext.hpp>
#include <algorithm>
#include <map>
#include <vector>
namespace boost
{
namespace
{
template< class Container >
void map_test_keys( Container& c )
{
using namespace boost::adaptors;
std::vector<int> keys;
boost::push_back(keys, c | map_keys);
std::vector<int> keys2;
boost::push_back(keys2, adaptors::keys(c));
std::vector<int> reference_keys;
typedef BOOST_DEDUCED_TYPENAME Container::const_iterator iter_t;
for (iter_t it = c.begin(); it != c.end(); ++it)
{
reference_keys.push_back(it->first);
}
BOOST_CHECK_EQUAL_COLLECTIONS( reference_keys.begin(),
reference_keys.end(),
keys.begin(),
keys.end() );
BOOST_CHECK_EQUAL_COLLECTIONS( reference_keys.begin(),
reference_keys.end(),
keys2.begin(),
keys2.end() );
}
template< class Container >
void map_test_values( Container& c )
{
using namespace boost::adaptors;
std::vector<int> values;
boost::push_back(values, c | map_values);
std::vector<int> values2;
boost::push_back(values2, adaptors::values(c));
std::vector<int> reference_values;
typedef BOOST_DEDUCED_TYPENAME Container::const_iterator iter_t;
for (iter_t it = c.begin(); it != c.end(); ++it)
{
reference_values.push_back(it->second);
}
BOOST_CHECK_EQUAL_COLLECTIONS( reference_values.begin(),
reference_values.end(),
values.begin(),
values.end() );
BOOST_CHECK_EQUAL_COLLECTIONS( reference_values.begin(),
reference_values.end(),
values2.begin(),
values2.end() );
}
template< class Container >
void map_test_impl()
{
using namespace boost::assign;
Container c;
// Test empty
map_test_keys(c);
map_test_values(c);
// Test one element
c.insert(std::make_pair(1,2));
map_test_keys(c);
map_test_values(c);
// Test many elements
for (int x = 2; x < 10; ++x)
{
c.insert(std::make_pair(x, x * 2));
}
map_test_keys(c);
map_test_values(c);
}
void map_test()
{
map_test_impl< std::map<int,int> >();
}
void test_trac_item_4388()
{
typedef std::pair<int,char> pair_t;
const boost::array<pair_t,3> ar = {{
pair_t(3, 'a'),
pair_t(1, 'b'),
pair_t(4, 'c')
}};
const boost::array<int, 3> expected_keys = {{ 3, 1, 4 }};
const boost::array<char, 3> expected_values = {{ 'a', 'b', 'c' }};
{
std::vector<int> test;
boost::push_back(test, ar | boost::adaptors::map_keys);
BOOST_CHECK_EQUAL_COLLECTIONS(
expected_keys.begin(), expected_keys.end(),
test.begin(), test.end()
);
}
{
std::vector<char> test;
boost::push_back(test, ar | boost::adaptors::map_values);
BOOST_CHECK_EQUAL_COLLECTIONS(
expected_values.begin(), expected_values.end(),
test.begin(), test.end()
);
}
{
std::vector<char> test;
boost::array<std::pair<int, char>, 3> src(ar);
boost::push_back(test, src | boost::adaptors::map_values);
BOOST_CHECK_EQUAL_COLLECTIONS(
expected_values.begin(), expected_values.end(),
test.begin(), test.end()
);
}
}
}
}
boost::unit_test::test_suite*
init_unit_test_suite(int argc, char* argv[])
{
boost::unit_test::test_suite* test
= BOOST_TEST_SUITE( "RangeTestSuite.adaptor.map" );
test->add( BOOST_TEST_CASE( &boost::map_test ) );
test->add( BOOST_TEST_CASE( &boost::test_trac_item_4388 ) );
return test;
}
|
