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
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
|
/*-----------------------------------------------------------------------------+
Copyright (c) 2011-2011: Joachim Faulhaber
+------------------------------------------------------------------------------+
Distributed under the Boost Software License, Version 1.0.
(See accompanying file LICENCE.txt or copy at
http://www.boost.org/LICENSE_1_0.txt)
+-----------------------------------------------------------------------------*/
#define BOOST_TEST_MODULE icl::fix_icl_after_thread unit test
#include <libs/icl/test/disable_test_warnings.hpp>
#include "../unit_test_unwarned.hpp"
//#define BOOST_ICL_USE_STATIC_BOUNDED_INTERVALS
#include <boost/icl/interval_map.hpp>
#include <boost/icl/split_interval_map.hpp>
#include <boost/icl/separate_interval_set.hpp>
#include <boost/icl/split_interval_set.hpp>
#include <iostream>
using namespace std;
using namespace boost;
using namespace unit_test;
using namespace boost::icl;
BOOST_AUTO_TEST_CASE(ticket_5482)
{
typedef interval_map<int,int,partial_absorber,std::less> m1_t;
typedef interval_map<int,int,partial_absorber,std::greater> m2_t;
m1_t m1;
m2_t m2;
m1.insert(make_pair(m1_t::interval_type(1), 20));
m1.insert(make_pair(m1_t::interval_type(2), 20));
m1.insert(make_pair(m1_t::interval_type(3), 20));
m2.insert(make_pair(m2_t::interval_type(1), 20));
m2.insert(make_pair(m2_t::interval_type(2), 20));
m2.insert(make_pair(m2_t::interval_type(3), 20));
BOOST_CHECK_EQUAL(m1.iterative_size(), m2.iterative_size());
BOOST_CHECK_EQUAL(m1.iterative_size(), 1);
BOOST_CHECK_EQUAL(m2.iterative_size(), 1);
}
#include <boost/cstdint.hpp>
BOOST_AUTO_TEST_CASE(ticket_5559_Denis)
{
//Submitted by Denis
typedef boost::icl::interval_set<boost::uint32_t, std::greater> Set;
const uint32_t ui32_max = (std::numeric_limits<uint32_t>::max)();
Set q1( Set::interval_type::closed(ui32_max, 0) );
Set q5( Set::interval_type::closed(0, 0) );
BOOST_CHECK_EQUAL(q1, q1+q5);
}
//------------------------------------------------------------------------------
// Ticket #6095 Marvin Sielenkemper
//------------------------------------------------------------------------------
BOOST_AUTO_TEST_CASE(ticket_6095_Marvin_Sielenkemper_isEmptyTest)
{
typedef int Value;
typedef boost::icl::interval<Value> Interval;
typedef std::numeric_limits<Value> Limits;
Value const max((Limits::max)());
//Interval::interval_type piff = Interval::open(max, max);
BOOST_CHECK(!icl::is_empty(Interval::open(max - 2, max)));
BOOST_CHECK( icl::is_empty(Interval::open(max - 1, max)));
BOOST_CHECK( icl::is_empty(Interval::open(max, max)));
}
BOOST_AUTO_TEST_CASE(ticket_6095_Marvin_Sielenkemper_totalRangeTest)
{
typedef int Value;
typedef boost::icl::interval<Value> Interval;
typedef std::numeric_limits<Value> Limits;
Value const min((Limits::min)());
Value const max((Limits::max)());
boost::icl::interval_map<Value, int, boost::icl::total_enricher> intervals;
intervals += std::make_pair(Interval::closed(min, max), 0);
intervals += std::make_pair(Interval::right_open(0, 10), 3);
BOOST_CHECK_EQUAL(intervals.iterative_size(), 3);
}
BOOST_AUTO_TEST_CASE(test_ticket_7871)
{
boost::icl::split_interval_map <int, int> a, b;
a = b;
BOOST_CHECK_EQUAL(a, b);
}
//------------------------------------------------------------------------------
// Ticket #11308 Stephen Hewitt
//------------------------------------------------------------------------------
BOOST_AUTO_TEST_CASE(ticket_11308_Stephen_Hewitt_extreme_valued_closed_intervals)
{
typedef boost::icl::closed_interval<boost::uint16_t, std::less> interval_t;
typedef boost::icl::split_interval_set<boost::uint16_t, std::less, interval_t> set_t;
set_t s1, s2;
s1 += interval_t(0x0000, 0x9fff);
s1 += interval_t(0xa000, 0xbfff);
s1 += interval_t(0xc000, 0xffff);
s2 += interval_t(0x0000, 0xffff);
s2 += interval_t(0xa000, 0xbfff);
BOOST_CHECK_EQUAL(s1, s2);
}
BOOST_AUTO_TEST_CASE(extreme_valued_right_open_intervals)
{
typedef boost::icl::right_open_interval<boost::uint16_t, std::less> interval_t;
typedef boost::icl::split_interval_set<boost::uint16_t, std::less, interval_t> set_t;
set_t s1, s2;
s1 += interval_t(0x0000, 0xa000);
s1 += interval_t(0xa000, 0xc000);
s1 += interval_t(0xc000, 0xffff); //Contains 0xfffe as largest element
s2 += interval_t(0x0000, 0xffff);
s2 += interval_t(0xa000, 0xc000);
BOOST_CHECK_EQUAL(s1, s2);
}
BOOST_AUTO_TEST_CASE(extreme_valued_left_open_intervals)
{
typedef boost::icl::left_open_interval<boost::uint16_t, std::less> interval_t;
typedef boost::icl::split_interval_set<boost::uint16_t, std::less, interval_t> set_t;
set_t s1, s2;
s1 += interval_t(0x0000, 0x9fff); //Contains 1 as smallest element
s1 += interval_t(0x9fff, 0xbfff);
s1 += interval_t(0xbfff, 0xffff);
s2 += interval_t(0x0000, 0xffff);
s2 += interval_t(0x9fff, 0xbfff);
BOOST_CHECK_EQUAL(s1, s2);
}
BOOST_AUTO_TEST_CASE(extreme_valued_open_intervals)
{
typedef boost::icl::open_interval<boost::uint16_t, std::less> interval_t;
typedef boost::icl::split_interval_set<boost::uint16_t, std::less, interval_t> set_t;
set_t s1, s2;
s1 += interval_t(0x0000, 0xa000); //Contains 1 as smallest element
s1 += interval_t(0x9fff, 0xc000);
s1 += interval_t(0xbfff, 0xffff); //Contains 0xfffe as largest element
s2 += interval_t(0x0000, 0xffff);
s2 += interval_t(0x9fff, 0xc000);
BOOST_CHECK_EQUAL(s1, s2);
}
BOOST_AUTO_TEST_CASE(test_span_and_hull)
{
typedef closed_interval<int> cl_I_int;
cl_I_int span_1_2 = span< cl_I_int >(1,2);
cl_I_int span_2_1 = span< cl_I_int >(2,1);
BOOST_CHECK_EQUAL(span_1_2, span_2_1);
BOOST_CHECK_EQUAL(hull< cl_I_int >(1,2), hull< cl_I_int >(2,1));
BOOST_CHECK_EQUAL( span< right_open_interval<int> >(2,1)
, construct< right_open_interval<int> >(1,2) );
BOOST_CHECK_EQUAL( hull< right_open_interval<int> >(2,1)
, construct< right_open_interval<int> >(1,3) );
}
BOOST_AUTO_TEST_CASE(test_ticket_11942)
{
boost::icl::split_interval_set<int> intervals;
intervals.insert(boost::icl::discrete_interval<int>(1, 2));
intervals.insert(boost::icl::discrete_interval<int>(2, 3));
intervals.insert(boost::icl::discrete_interval<int>(0, 3));
BOOST_CHECK_EQUAL(intervals.size(), 3);
}
BOOST_AUTO_TEST_CASE(test_ticket_12872)
{
boost::icl::split_interval_set<unsigned> ss
= boost::icl::split_interval_set<unsigned>();
std::vector<std::pair<unsigned, unsigned> > rs;
rs.push_back(make_pair(88, 96));
rs.push_back(make_pair(72, 96));
rs.push_back(make_pair(80, 96));
rs.push_back(make_pair(24, 64));
rs.push_back(make_pair(80, 96));
rs.push_back(make_pair(32, 72));
rs.push_back(make_pair(88, 96));
rs.push_back(make_pair(16, 56));
// {{88, 96}, {72, 96}, {80, 96}, {24, 64}, {80, 96}, {32, 72},
// {88, 96}, {16, 56}};
for(int i=0; i < rs.size(); i++) {
ss.add( boost::icl::interval<unsigned>::right_open(rs[i].first, rs[i].second) );
}
boost::icl::split_interval_map<unsigned, unsigned> im
= boost::icl::split_interval_map<unsigned, unsigned>();
for(int i=0; i < rs.size(); i++) {
im.add( make_pair( boost::icl::interval<unsigned>::right_open(rs[i].first, rs[i].second), 1 ) );
}
BOOST_CHECK_EQUAL(interval_count(ss), interval_count(im));
BOOST_CHECK_EQUAL(icl::size(ss), icl::size(im));
BOOST_CHECK_EQUAL(hull(ss), hull(im));
}
BOOST_AUTO_TEST_CASE(test_ticket_12926)
{
boost::icl::interval_set<int> a;
a.insert(boost::icl::interval<int>::right_open(-100, 100));
a.insert(-50);
BOOST_CHECK_EQUAL(a.size(), 200);
}
|
