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
|
/* Copyright 2017-2021 PaGMO development team
This file is part of the PaGMO library.
The PaGMO library is free software; you can redistribute it and/or modify
it under the terms of either:
* 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.
or
* the GNU General Public License as published by the Free Software
Foundation; either version 3 of the License, or (at your option) any
later version.
or both in parallel, as here.
The PaGMO library 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 General Public License
for more details.
You should have received copies of the GNU General Public License and the
GNU Lesser General Public License along with the PaGMO library. If not,
see https://www.gnu.org/licenses/. */
#define BOOST_TEST_MODULE thread_island_test
#define BOOST_TEST_DYN_LINK
#include <boost/test/unit_test.hpp>
#include <initializer_list>
#include <stdexcept>
#include <utility>
#include <boost/algorithm/string/predicate.hpp>
#include <pagmo/island.hpp>
#include <pagmo/islands/thread_island.hpp>
#include <pagmo/population.hpp>
#include <pagmo/problem.hpp>
#include <pagmo/threading.hpp>
#include <pagmo/types.hpp>
using namespace pagmo;
// Thread-unsafe UDA.
struct tu_uda {
population evolve(const population &pop) const
{
return pop;
}
thread_safety get_thread_safety() const
{
return thread_safety::none;
}
};
// Thread unsafe UDP.
struct tu_udp {
vector_double fitness(const vector_double &) const
{
return {1};
}
std::pair<vector_double, vector_double> get_bounds() const
{
return {{0}, {1}};
}
thread_safety get_thread_safety() const
{
return thread_safety::none;
}
};
BOOST_AUTO_TEST_CASE(thread_island_test)
{
{
island isl(thread_island{}, tu_uda{}, problem(), 20u);
isl.evolve();
BOOST_CHECK_EXCEPTION(isl.wait_check(), std::invalid_argument, [](const std::invalid_argument &ia) {
return boost::contains(ia.what(),
"the 'thread_island' UDI requires an algorithm providing at least the 'basic' "
"thread safety guarantee");
});
}
{
island isl(thread_island{}, algorithm(), tu_udp{}, 20u);
isl.evolve();
BOOST_CHECK_EXCEPTION(isl.wait_check(), std::invalid_argument, [](const std::invalid_argument &ia) {
return boost::contains(ia.what(),
"the 'thread_island' UDI requires a problem providing at least the 'basic' "
"thread safety guarantee");
});
}
}
|
