-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtests.cpp
174 lines (137 loc) · 4.2 KB
/
tests.cpp
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
172
173
174
#define BOOST_TEST_MAIN
#define BOOST_TEST_DYN_LINK
#include <cstdio>
#include <boost/concept_check.hpp>
#include <boost/iterator/counting_iterator.hpp>
#include <boost/iterator/iterator_concepts.hpp>
#include <boost/test/unit_test.hpp>
#include <list>
#include <set>
#include <vector>
#include "combinations_iterator.hpp"
#include "pairs_iterator.hpp"
using namespace boost;
using namespace boost_concepts;
struct test_init
{
test_init() { }
};
BOOST_GLOBAL_FIXTURE(test_init);
BOOST_AUTO_TEST_SUITE(pairs_iterator_tests)
struct Foo
{
Foo(int a, int b) { }
};
void concept_check()
{
typedef std::list<int>::iterator ListIt;
typedef std::set<int>::iterator SetIt;
typedef std::vector<int>::iterator VectorIt;
typedef pairs_iterator<ListIt> CListIt;
typedef pairs_iterator<SetIt> CSetIt;
typedef pairs_iterator<VectorIt> CVectorIt;
typedef pairs_iterator<ListIt, Foo> CFListIt;
typedef pairs_iterator<SetIt, Foo> CFSetIt;
typedef pairs_iterator<VectorIt, Foo> CFVectorIt;
BOOST_CONCEPT_ASSERT((ForwardTraversalConcept<CListIt>));
BOOST_CONCEPT_ASSERT((ReadableIteratorConcept<CListIt>));
BOOST_CONCEPT_ASSERT((ForwardTraversalConcept<CSetIt>));
BOOST_CONCEPT_ASSERT((ReadableIteratorConcept<CSetIt>));
BOOST_CONCEPT_ASSERT((ForwardTraversalConcept<CVectorIt>));
BOOST_CONCEPT_ASSERT((ReadableIteratorConcept<CVectorIt>));
BOOST_CONCEPT_ASSERT((ForwardTraversalConcept<CFListIt>));
BOOST_CONCEPT_ASSERT((ReadableIteratorConcept<CFListIt>));
BOOST_CONCEPT_ASSERT((ForwardTraversalConcept<CFSetIt>));
BOOST_CONCEPT_ASSERT((ReadableIteratorConcept<CFSetIt>));
BOOST_CONCEPT_ASSERT((ForwardTraversalConcept<CFVectorIt>));
BOOST_CONCEPT_ASSERT((ReadableIteratorConcept<CFVectorIt>));
pairs_iterator<ListIt, Foo> p;
*p;
}
BOOST_AUTO_TEST_CASE(Simple)
{
int in[] = { 0, 1, 2, 3, 4 };
typedef std::pair<int, int> ValueT;
typedef std::vector<ValueT> Container;
int* begin = in;
int* end = in + sizeof(in)/sizeof(int);
Container out(
make_pairs_iterator(begin, end),
make_pairs_iterator(end, end)
);
BOOST_REQUIRE_EQUAL(out.size(), 10);
Container::const_iterator it = out.begin();
for (int i = 0; i < 5; ++i)
{
for (int j = i + 1; j < 5; ++j)
{
BOOST_CHECK_EQUAL(i, it->first);
BOOST_CHECK_EQUAL(j, it->second);
++it;
}
}
}
BOOST_AUTO_TEST_CASE(Subset)
{
std::vector<int> in(
make_counting_iterator(0),
make_counting_iterator(10)
);
typedef std::pair<int, int> ValueT;
typedef std::vector<ValueT> Container;
Container out(
make_pairs_iterator(in.begin() + 3, in.end() - 1),
make_pairs_iterator(in.end() - 1, in.end() - 1)
);
BOOST_REQUIRE_EQUAL(out.size(), 15);
Container::const_iterator it = out.begin();
for (int i = 3; i < 9; ++i)
{
for (int j = i + 1; j < 9; ++j)
{
BOOST_CHECK_EQUAL(i, it->first);
BOOST_CHECK_EQUAL(j, it->second);
++it;
}
}
}
BOOST_AUTO_TEST_CASE(Empty)
{
std::vector<int> in;
typedef std::pair<int, int> ValueT;
typedef std::vector<ValueT> Container;
Container out(
make_pairs_iterator(in.begin(), in.end()),
make_pairs_iterator(in.end(), in.end())
);
BOOST_CHECK_EQUAL(out.size(), 0);
}
BOOST_AUTO_TEST_CASE(AlmostEmpty)
{
std::vector<int> in(
make_counting_iterator(0),
make_counting_iterator(2)
);
typedef std::array<int, 4> ValueT;
typedef std::vector<ValueT> Container;
Container out(
make_combinations_iterator<4>(in.begin(), in.end()),
make_combinations_iterator<4>(in.end(), in.end())
);
BOOST_CHECK_EQUAL(out.size(), 0);
}
BOOST_AUTO_TEST_CASE(Triples)
{
std::vector<int> in(
make_counting_iterator(1),
make_counting_iterator(6)
);
typedef std::array<int, 3> ValueT;
typedef std::vector<ValueT> Container;
Container out(
make_combinations_iterator<3>(in.begin(), in.end()),
make_combinations_iterator<3>(in.end(), in.end())
);
BOOST_CHECK_EQUAL(out.size(), 10);
}
BOOST_AUTO_TEST_SUITE_END()