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
|
/************************************************************************
*
* Copyright (C) 2022-2024 IRCAD France
*
* This file is part of Sight.
*
* Sight is free software: you can redistribute it and/or modify it under
* the terms of the GNU Lesser General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* Sight is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with Sight. If not, see <https://www.gnu.org/licenses/>.
*
***********************************************************************/
#include "container_test.hpp"
#include <core/com/signal.hpp>
#include <core/com/signal.hxx>
#include <core/compare.hpp>
#include <data/container.hpp>
#include <data/integer.hpp>
#include <array>
#include <deque>
#include <list>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector>
// Registers the fixture into the 'registry'
CPPUNIT_TEST_SUITE_REGISTRATION(sight::data::ut::container_test);
namespace sight::data::ut
{
//------------------------------------------------------------------------------
template<class C>
inline static void test_container(const C& _source, const C& _modified_source)
{
class container : public data::container<C>
{
public:
using data::container<C>::container;
using container_wrapper<C>::operator=;
};
// Initialization test
{
container container(_source);
// Should be a perfect copy, is_equal will also test default forward iterators
CPPUNIT_ASSERT(core::is_equal(container, _source));
class container modified_container(_modified_source);
// Should be different
CPPUNIT_ASSERT(!core::is_equal(container, modified_container));
}
// Assignement test
{
container container;
container = _source;
// Should be a perfect copy, is_equal will also test default forward iterators
CPPUNIT_ASSERT(core::is_equal(container, _source));
class container modified_container;
modified_container = _modified_source;
// Should be different
CPPUNIT_ASSERT(!core::is_equal(container, modified_container));
}
// Initializer list test
// std::copy test
{
container container;
std::copy(_source.cbegin(), _source.cend(), inserter(container));
// Should be a perfect copy
CPPUNIT_ASSERT(core::is_equal(container, _source));
class container modified_container;
std::copy(_modified_source.cbegin(), _modified_source.cend(), inserter(modified_container));
// Should be different (test inequality operator)
CPPUNIT_ASSERT(!core::is_equal(container, modified_container));
}
// Clear test
if constexpr(core::is_container_dynamic<C>::value)
{
container container(_source);
class container empty;
CPPUNIT_ASSERT(!core::is_equal(container, empty));
container.clear();
CPPUNIT_ASSERT(core::is_equal(container, empty));
}
// Special features of vector kind container
if constexpr(core::is_vector<C>::value)
{
container container(_source);
const auto& element = _source[0];
// Add some elements
container.push_back(element);
container.push_back(element);
container.push_back(element);
// Test remove one (container[0] should be removed)
CPPUNIT_ASSERT(container.size() == (_source.size() + 3));
container.remove_one(element);
CPPUNIT_ASSERT(container.size() == (_source.size() + 2));
CPPUNIT_ASSERT(container.front() != element);
CPPUNIT_ASSERT(container.back() == element);
container.remove_one(element);
CPPUNIT_ASSERT(container.size() == (_source.size() + 1));
CPPUNIT_ASSERT(container.front() != element);
CPPUNIT_ASSERT(container.back() == element);
// Test returned iterator
const auto& it = container.remove_one(element);
CPPUNIT_ASSERT(container.size() == _source.size());
CPPUNIT_ASSERT(container.front() != element);
CPPUNIT_ASSERT(container.back() == element);
CPPUNIT_ASSERT_NO_THROW(container.erase(it));
CPPUNIT_ASSERT(container.size() == (_source.size() - 1));
CPPUNIT_ASSERT(container.front() != element);
CPPUNIT_ASSERT(container.back() != element);
// Removing an element that does not exist should not change the container
container.remove_one(element);
CPPUNIT_ASSERT(container.size() == _source.size() - 1);
// Add some elements
container.push_back(_source[0]);
container.push_back(_source[0]);
container.push_back(_source[0]);
// Test remove all
CPPUNIT_ASSERT(container.size() == (_source.size() + 2));
container.remove(_source[0]);
CPPUNIT_ASSERT(container.size() == (_source.size() - 1));
// Removing an element that does not exist should not change the container
container.remove(_source[0]);
CPPUNIT_ASSERT(container.size() == (_source.size() - 1));
}
}
//------------------------------------------------------------------------------
template<class C>
inline static void test_dispatcher(
const std::initializer_list<C>& _original_list,
const std::initializer_list<C>& _modified_list
)
{
test_container<std::vector<C> >(_original_list, _modified_list);
test_container<std::deque<C> >(_original_list, _modified_list);
test_container<std::list<C> >(_original_list, _modified_list);
test_container<std::set<C> >(_original_list, _modified_list);
test_container<std::multiset<C> >(_original_list, _modified_list);
test_container<std::unordered_set<C> >(_original_list, _modified_list);
test_container<std::unordered_multiset<C> >(_original_list, _modified_list);
test_container<sequenced_set<C> >(_original_list, _modified_list);
}
//------------------------------------------------------------------------------
template<class Key, class T>
inline static void map_test_dispatcher(
const std::initializer_list<std::pair<const Key, T> >& _original_list,
const std::initializer_list<std::pair<const Key, T> >& _modified_list
)
{
test_container<std::map<Key, T> >(_original_list, _modified_list);
test_container<std::multimap<Key, T> >(_original_list, _modified_list);
test_container<std::unordered_map<Key, T> >(_original_list, _modified_list);
test_container<std::unordered_multimap<Key, T> >(_original_list, _modified_list);
}
//------------------------------------------------------------------------------
void container_test::setUp()
{
}
//------------------------------------------------------------------------------
void container_test::tearDown()
{
}
//------------------------------------------------------------------------------
void container_test::array_test()
{
}
//------------------------------------------------------------------------------
void container_test::generic_test()
{
}
//------------------------------------------------------------------------------
void container_test::map_test()
{
}
} // namespace sight::data::ut
|
