/* 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 island_test
#define BOOST_TEST_DYN_LINK
#include <boost/test/unit_test.hpp>

#include <atomic>
#include <initializer_list>
#include <iostream>
#include <sstream>
#include <stdexcept>
#include <string>
#include <thread>
#include <type_traits>
#include <typeindex>
#include <typeinfo>
#include <utility>
#include <vector>

#include <boost/algorithm/string/predicate.hpp>
#include <boost/lexical_cast.hpp>

#include <pagmo/algorithms/de.hpp>
#include <pagmo/algorithms/null_algorithm.hpp>
#include <pagmo/batch_evaluators/thread_bfe.hpp>
#include <pagmo/bfe.hpp>
#include <pagmo/config.hpp>
#include <pagmo/detail/type_name.hpp>
#include <pagmo/io.hpp>
#include <pagmo/island.hpp>
#include <pagmo/islands/thread_island.hpp>
#include <pagmo/population.hpp>
#include <pagmo/problem.hpp>
#include <pagmo/problems/inventory.hpp>
#include <pagmo/problems/null_problem.hpp>
#include <pagmo/problems/rosenbrock.hpp>
#include <pagmo/problems/zdt.hpp>
#include <pagmo/r_policies/fair_replace.hpp>
#include <pagmo/r_policy.hpp>
#include <pagmo/s11n.hpp>
#include <pagmo/s_policies/select_best.hpp>
#include <pagmo/s_policy.hpp>
#include <pagmo/threading.hpp>
#include <pagmo/types.hpp>

using namespace pagmo;

struct udi_01 {
    void run_evolve(island &) const {}
    std::string get_name() const
    {
        return "udi_01";
    }
    std::string get_extra_info() const
    {
        return "extra bits";
    }
};

struct udi_01a {
    void run_evolve(island &) const {}
};

struct udi_02 {
    void run_evolve(island &);
};

struct udi_03 {
    void run_evolve(const island &) const;
};

BOOST_AUTO_TEST_CASE(island_type_traits)
{
    BOOST_CHECK(is_udi<thread_island>::value);
    BOOST_CHECK(!is_udi<int>::value);
    BOOST_CHECK(!is_udi<const thread_island>::value);
    BOOST_CHECK(!is_udi<const thread_island &>::value);
    BOOST_CHECK(!is_udi<thread_island &>::value);
    BOOST_CHECK(!is_udi<void>::value);
    BOOST_CHECK(is_udi<udi_01>::value);
    BOOST_CHECK(!is_udi<udi_02>::value);
    BOOST_CHECK(is_udi<udi_03>::value);
}

// Minimal udrp/udsp to test the constructors
// with policies arguments.

struct udrp00 {
    individuals_group_t replace(const individuals_group_t &, const vector_double::size_type &,
                                const vector_double::size_type &, const vector_double::size_type &,
                                const vector_double::size_type &, const vector_double::size_type &,
                                const vector_double &, const individuals_group_t &) const
    {
        return individuals_group_t{};
    }
    template <typename Archive>
    void serialize(Archive &, unsigned)
    {
    }
};

PAGMO_S11N_R_POLICY_EXPORT(udrp00)

struct udsp00 {
    individuals_group_t select(const individuals_group_t &, const vector_double::size_type &,
                               const vector_double::size_type &, const vector_double::size_type &,
                               const vector_double::size_type &, const vector_double::size_type &,
                               const vector_double &) const
    {
        return individuals_group_t{};
    }
    template <typename Archive>
    void serialize(Archive &, unsigned)
    {
    }
};

PAGMO_S11N_S_POLICY_EXPORT(udsp00)

BOOST_AUTO_TEST_CASE(island_constructors)
{
    // Various constructors.
    island isl;
    BOOST_CHECK(isl.get_algorithm().is<null_algorithm>());
    BOOST_CHECK(isl.get_population().get_problem().is<null_problem>());
    BOOST_CHECK(isl.get_r_policy().is<fair_replace>());
    BOOST_CHECK(isl.get_s_policy().is<select_best>());
    BOOST_CHECK(isl.get_population().size() == 0u);
    auto isl2(isl);
    BOOST_CHECK(isl2.get_algorithm().is<null_algorithm>());
    BOOST_CHECK(isl2.get_population().get_problem().is<null_problem>());
    BOOST_CHECK(isl2.get_population().size() == 0u);
    BOOST_CHECK(isl2.get_r_policy().is<fair_replace>());
    BOOST_CHECK(isl2.get_s_policy().is<select_best>());
    island isl3{de{}, population{rosenbrock{}, 25}};
    BOOST_CHECK(isl3.get_algorithm().is<de>());
    BOOST_CHECK(isl3.get_population().get_problem().is<rosenbrock>());
    BOOST_CHECK(isl3.get_population().size() == 25u);
    BOOST_CHECK(isl3.get_r_policy().is<fair_replace>());
    BOOST_CHECK(isl3.get_s_policy().is<select_best>());
    auto isl4(isl3);
    BOOST_CHECK(isl4.get_algorithm().is<de>());
    BOOST_CHECK(isl4.get_population().get_problem().is<rosenbrock>());
    BOOST_CHECK(isl4.get_population().size() == 25u);
    BOOST_CHECK(isl4.get_r_policy().is<fair_replace>());
    BOOST_CHECK(isl4.get_s_policy().is<select_best>());
    // Ctor from algo, pop, policies.
    island isl4a{de{}, population{rosenbrock{}, 25}, udrp00{}, udsp00{}};
    BOOST_CHECK(isl4a.get_algorithm().is<de>());
    BOOST_CHECK(isl4a.get_population().get_problem().is<rosenbrock>());
    BOOST_CHECK(isl4a.get_population().size() == 25u);
    BOOST_CHECK(isl4a.get_r_policy().is<udrp00>());
    BOOST_CHECK(isl4a.get_s_policy().is<udsp00>());
    auto isl4b(isl4a);
    BOOST_CHECK(isl4b.get_algorithm().is<de>());
    BOOST_CHECK(isl4b.get_population().get_problem().is<rosenbrock>());
    BOOST_CHECK(isl4b.get_population().size() == 25u);
    BOOST_CHECK(isl4b.get_r_policy().is<udrp00>());
    BOOST_CHECK(isl4b.get_s_policy().is<udsp00>());
    // Ctor from UDI, algo, pop.
    island isl5{thread_island{}, de{}, population{rosenbrock{}, 26}};
    BOOST_CHECK(isl5.get_algorithm().is<de>());
    BOOST_CHECK(isl5.get_population().get_problem().is<rosenbrock>());
    BOOST_CHECK(isl5.get_population().size() == 26u);
    BOOST_CHECK(isl5.get_r_policy().is<fair_replace>());
    BOOST_CHECK(isl5.get_s_policy().is<select_best>());
    // Ctor from UDI, algo, pop and policies.
    island isl5a{thread_island{}, de{}, population{rosenbrock{}, 26}, udrp00{}, udsp00{}};
    BOOST_CHECK(isl5a.get_algorithm().is<de>());
    BOOST_CHECK(isl5a.get_population().get_problem().is<rosenbrock>());
    BOOST_CHECK(isl5a.get_population().size() == 26u);
    BOOST_CHECK(isl5a.get_r_policy().is<udrp00>());
    BOOST_CHECK(isl5a.get_s_policy().is<udsp00>());
    // Ctor form algo, prob, size and seed.
    island isl6{de{}, rosenbrock{}, 27};
    BOOST_CHECK(isl6.get_algorithm().is<de>());
    BOOST_CHECK(isl6.get_population().get_problem().is<rosenbrock>());
    BOOST_CHECK(isl6.get_population().size() == 27u);
    BOOST_CHECK(isl6.get_r_policy().is<fair_replace>());
    BOOST_CHECK(isl6.get_s_policy().is<select_best>());
    island isl7{de{}, rosenbrock{}, 27, 123};
    BOOST_CHECK(isl7.get_algorithm().is<de>());
    BOOST_CHECK(isl7.get_population().get_problem().is<rosenbrock>());
    BOOST_CHECK(isl7.get_population().size() == 27u);
    BOOST_CHECK(isl7.get_population().get_seed() == 123u);
    BOOST_CHECK(isl7.get_r_policy().is<fair_replace>());
    BOOST_CHECK(isl7.get_s_policy().is<select_best>());
    // Ctor form algo, prob, size, policies and seed.
    island isl6a{de{}, rosenbrock{}, 27, udrp00{}, udsp00{}};
    BOOST_CHECK(isl6a.get_algorithm().is<de>());
    BOOST_CHECK(isl6a.get_population().get_problem().is<rosenbrock>());
    BOOST_CHECK(isl6a.get_population().size() == 27u);
    BOOST_CHECK(isl6a.get_r_policy().is<udrp00>());
    BOOST_CHECK(isl6a.get_s_policy().is<udsp00>());
    island isl7a{de{}, rosenbrock{}, 27, udrp00{}, udsp00{}, 123};
    BOOST_CHECK(isl7a.get_algorithm().is<de>());
    BOOST_CHECK(isl7a.get_population().get_problem().is<rosenbrock>());
    BOOST_CHECK(isl7a.get_population().size() == 27u);
    BOOST_CHECK(isl7a.get_population().get_seed() == 123u);
    BOOST_CHECK(isl7a.get_r_policy().is<udrp00>());
    BOOST_CHECK(isl7a.get_s_policy().is<udsp00>());
    // Ctor from UDI, algo, prob and size.
    island isl8{thread_island{}, de{}, rosenbrock{}, 28};
    BOOST_CHECK(isl8.get_algorithm().is<de>());
    BOOST_CHECK(isl8.get_population().get_problem().is<rosenbrock>());
    BOOST_CHECK(isl8.get_population().size() == 28u);
    BOOST_CHECK(isl8.get_r_policy().is<fair_replace>());
    BOOST_CHECK(isl8.get_s_policy().is<select_best>());
    island isl9{thread_island{}, de{}, rosenbrock{}, 29, 124};
    BOOST_CHECK(isl9.get_algorithm().is<de>());
    BOOST_CHECK(isl9.get_population().get_problem().is<rosenbrock>());
    BOOST_CHECK(isl9.get_population().size() == 29u);
    BOOST_CHECK(isl9.get_population().get_seed() == 124u);
    BOOST_CHECK(isl9.get_r_policy().is<fair_replace>());
    BOOST_CHECK(isl9.get_s_policy().is<select_best>());
    // Ctor from UDI, algo, prob, size and policies.
    island isl8a{thread_island{}, de{}, rosenbrock{}, 28, udrp00{}, udsp00{}};
    BOOST_CHECK(isl8a.get_algorithm().is<de>());
    BOOST_CHECK(isl8a.get_population().get_problem().is<rosenbrock>());
    BOOST_CHECK(isl8a.get_population().size() == 28u);
    BOOST_CHECK(isl8a.get_r_policy().is<udrp00>());
    BOOST_CHECK(isl8a.get_s_policy().is<udsp00>());
    island isl9a{thread_island{}, de{}, rosenbrock{}, 29, udrp00{}, udsp00{}, 124};
    BOOST_CHECK(isl9a.get_algorithm().is<de>());
    BOOST_CHECK(isl9a.get_population().get_problem().is<rosenbrock>());
    BOOST_CHECK(isl9a.get_population().size() == 29u);
    BOOST_CHECK(isl9a.get_population().get_seed() == 124u);
    BOOST_CHECK(isl9a.get_r_policy().is<udrp00>());
    BOOST_CHECK(isl9a.get_s_policy().is<udsp00>());
    island isl10{std::move(isl9a)};
    BOOST_CHECK(isl10.get_algorithm().is<de>());
    BOOST_CHECK(isl10.get_population().get_problem().is<rosenbrock>());
    BOOST_CHECK(isl10.get_population().size() == 29u);
    BOOST_CHECK(isl10.get_population().get_seed() == 124u);
    BOOST_CHECK(isl10.get_r_policy().is<udrp00>());
    BOOST_CHECK(isl10.get_s_policy().is<udsp00>());
    // Revive isl9a;
    isl9a = island{thread_island{}, de{}, rosenbrock{}, 29, 124};
    BOOST_CHECK(isl9a.get_algorithm().is<de>());
    BOOST_CHECK(isl9a.get_population().get_problem().is<rosenbrock>());
    BOOST_CHECK(isl9a.get_population().size() == 29u);
    BOOST_CHECK(isl9a.get_population().get_seed() == 124u);
    BOOST_CHECK(isl9a.get_r_policy().is<fair_replace>());
    BOOST_CHECK(isl9a.get_s_policy().is<select_best>());
    // Copy assignment.
    isl9a = isl8a;
    BOOST_CHECK(isl9a.get_algorithm().is<de>());
    BOOST_CHECK(isl9a.get_population().get_problem().is<rosenbrock>());
    BOOST_CHECK(isl9a.get_population().size() == 28u);
    BOOST_CHECK(isl9a.get_r_policy().is<udrp00>());
    BOOST_CHECK(isl9a.get_s_policy().is<udsp00>());
    // Self assignment.
    BOOST_CHECK((std::is_same<island &, decltype(isl9a = isl9a)>::value));
    isl9a = *&isl9a;
    BOOST_CHECK(isl9a.get_algorithm().is<de>());
    BOOST_CHECK(isl9a.get_population().get_problem().is<rosenbrock>());
    BOOST_CHECK(isl9a.get_population().size() == 28u);
    BOOST_CHECK(isl9a.get_r_policy().is<udrp00>());
    BOOST_CHECK(isl9a.get_s_policy().is<udsp00>());
#if !defined(__clang__)
    BOOST_CHECK((std::is_same<island &, decltype(isl9a = std::move(isl9a))>::value));
    isl9a = std::move(isl9a);
    BOOST_CHECK(isl9a.get_algorithm().is<de>());
    BOOST_CHECK(isl9a.get_population().get_problem().is<rosenbrock>());
    BOOST_CHECK(isl9a.get_population().size() == 28u);
    BOOST_CHECK(isl9a.get_r_policy().is<udrp00>());
    BOOST_CHECK(isl9a.get_s_policy().is<udsp00>());
#endif
    // Some type-traits.
    BOOST_CHECK((std::is_constructible<island, de, population>::value));
    BOOST_CHECK((std::is_constructible<island, de, problem &&, unsigned>::value));
    BOOST_CHECK((std::is_constructible<island, de, problem &&, unsigned>::value));
    BOOST_CHECK((std::is_constructible<island, const thread_island &, de, problem &&, unsigned>::value));
    BOOST_CHECK((!std::is_constructible<island, double, std::string &&>::value));
}

BOOST_AUTO_TEST_CASE(island_concurrent_access)
{
    island isl{de{}, rosenbrock{}, 27, 123};
    auto thread_func = [&isl]() {
        for (auto i = 0; i < 100; ++i) {
            auto pop = isl.get_population();
            isl.set_population(pop);
            auto algo = isl.get_algorithm();
            isl.set_algorithm(algo);
        }
    };
    std::thread t1(thread_func), t2(thread_func), t3(thread_func), t4(thread_func);
    t1.join();
    t2.join();
    t3.join();
    t4.join();
}

BOOST_AUTO_TEST_CASE(island_evolve)
{
    island isl{de{}, population{rosenbrock{}, 25}};
    isl.evolve(0);
    isl.wait_check();
    isl.evolve();
    isl.wait_check();
    isl.evolve(20);
    isl.wait_check();
    // Copy/move operations with a few tasks queued.
    auto enqueue_n = [](island &is, int n) {
        for (auto i = 0; i < n; ++i) {
            is.evolve(20);
        }
    };
    enqueue_n(isl, 10);
    auto isl2(isl);
    auto isl3(std::move(isl));
    isl = island{de{}, population{rosenbrock{}, 25}};
    enqueue_n(isl, 10);
    isl2 = isl;
    isl3 = std::move(isl);
    isl2.wait();
    isl3.wait_check();
}

static std::atomic_bool flag = ATOMIC_VAR_INIT(false);

struct prob_01 {
    vector_double fitness(const vector_double &) const
    {
        while (!flag.load()) {
        }
        return {.5};
    }
    std::pair<vector_double, vector_double> get_bounds() const
    {
        return {{0.}, {1.}};
    }
};

BOOST_AUTO_TEST_CASE(island_get_wait_busy)
{
    flag.store(true);
    island isl{de{}, population{prob_01{}, 25}};
    BOOST_CHECK(isl.status() != evolve_status::busy);
    flag.store(false);
    isl.evolve();
    BOOST_CHECK(isl.status() == evolve_status::busy);
    flag.store(true);
    isl.wait();
    flag.store(false);
    isl = island{de{}, population{rosenbrock{}, 3}};
    isl.evolve(10);
    isl.evolve(10);
    isl.evolve(10);
    isl.evolve(10);
    isl.wait();
    BOOST_CHECK_THROW(isl.wait_check(), std::invalid_argument);
    isl.evolve(10);
    isl.evolve(10);
    isl.evolve(10);
    BOOST_CHECK_THROW(isl.wait_check(), std::invalid_argument);
    isl.wait_check();
    isl.wait();
}

BOOST_AUTO_TEST_CASE(island_name_info_stream)
{
    std::ostringstream oss;
    island isl{de{}, population{rosenbrock{}, 25}};
    oss << isl;
    BOOST_CHECK(!oss.str().empty());
    BOOST_CHECK(isl.get_name() == "Thread island");
    BOOST_CHECK(!isl.get_extra_info().empty());
    oss.str("");
    isl = island{udi_01{}, de{}, population{rosenbrock{}, 25}};
    oss << isl;
    BOOST_CHECK(!oss.str().empty());
    BOOST_CHECK(isl.get_name() == "udi_01");
    BOOST_CHECK((island{udi_01a{}, de{}, population{rosenbrock{}, 25}}.get_name()) == detail::type_name<udi_01a>());
    BOOST_CHECK(isl.get_extra_info() == "extra bits");
    BOOST_CHECK(boost::contains(oss.str(), "Replacement policy: Fair replace"));
    BOOST_CHECK(boost::contains(oss.str(), "Selection policy: Select best"));
    // Make sure champion info is printed.
    BOOST_CHECK(boost::contains(oss.str(), "Champion decision vector"));
    BOOST_CHECK(boost::contains(oss.str(), "Champion fitness"));
    std::cout << isl << '\n';

    // Make sure champion info is skipped for MO/sto problems.
    isl = island{udi_01{}, de{}, population{zdt{}, 25}};
    oss.str("");
    oss << isl;
    BOOST_CHECK(!boost::contains(oss.str(), "Champion decision vector"));
    BOOST_CHECK(!boost::contains(oss.str(), "Champion fitness"));

    isl = island{udi_01{}, de{}, population{inventory{}, 25}};
    oss.str("");
    oss << isl;
    BOOST_CHECK(!boost::contains(oss.str(), "Champion decision vector"));
    BOOST_CHECK(!boost::contains(oss.str(), "Champion fitness"));
}

BOOST_AUTO_TEST_CASE(island_serialization)
{
    island isl{de{}, population{rosenbrock{}, 25}, udrp00{}, udsp00{}};
    isl.evolve();
    isl.wait_check();
    std::stringstream ss;
    auto before = boost::lexical_cast<std::string>(isl);
    // Now serialize, deserialize and compare the result.
    {
        boost::archive::binary_oarchive oarchive(ss);
        oarchive << isl;
    }
    isl = island{de{}, population{rosenbrock{}, 25}};
    {
        boost::archive::binary_iarchive iarchive(ss);
        iarchive >> isl;
    }
    auto after = boost::lexical_cast<std::string>(isl);
    BOOST_CHECK_EQUAL(before, after);
}

BOOST_AUTO_TEST_CASE(island_status)
{
    island isl{de{}, population{rosenbrock{}, 3}};
    isl.evolve();
    isl.wait();
    auto s = isl.status();
    BOOST_CHECK(s == evolve_status::idle_error);
    isl = island{de{}, population{rosenbrock{}, 3}};
    isl.evolve();
    isl.wait();
    flag.store(true);
    isl.set_population(population{prob_01{}, 30});
    flag.store(false);
    isl.evolve();
    s = isl.status();
    BOOST_CHECK(s == evolve_status::busy_error);
    flag.store(true);
    isl.wait();
    isl = island{de{}, population{prob_01{}, 30}};
    flag.store(false);
    isl.evolve();
    s = isl.status();
    BOOST_CHECK(s == evolve_status::busy);
    flag.store(true);
    isl.wait();
    s = isl.status();
    BOOST_CHECK(s == evolve_status::idle);
    isl = island{de{}, population{rosenbrock{}, 3}};
    isl.evolve();
    isl.wait();
    s = isl.status();
    BOOST_CHECK(s == evolve_status::idle_error);
    // Two consecutive errors, one good.
    isl = island{de{}, population{rosenbrock{}, 3}};
    isl.evolve();
    isl.evolve();
    isl.wait();
    isl.set_population(population{rosenbrock{}, 30});
    isl.evolve();
    isl.wait();
    BOOST_CHECK(isl.status() == evolve_status::idle_error);
    BOOST_CHECK_THROW(isl.wait_check(), std::invalid_argument);
}

BOOST_AUTO_TEST_CASE(island_evolve_status)
{
    std::ostringstream ss;
    stream(ss, evolve_status::idle);
    BOOST_CHECK_EQUAL(ss.str(), "idle");
    ss.str("");
    stream(ss, evolve_status::busy);
    BOOST_CHECK_EQUAL(ss.str(), "busy");
    ss.str("");
    stream(ss, evolve_status::busy_error);
    BOOST_CHECK_EQUAL(ss.str(), "busy - **error occurred**");
    ss.str("");
    stream(ss, evolve_status::idle_error);
    BOOST_CHECK_EQUAL(ss.str(), "idle - **error occurred**");
}

// An algorithm that changes its state at every evolve() call.
struct stateful_algo {
    population evolve(const population &pop) const
    {
        ++n_evolve;
        return pop;
    }
    mutable int n_evolve = 0;
};

// Check that the thread island correctly replaces the original
// algorithm with the one used for evolving the population.
BOOST_AUTO_TEST_CASE(thread_island_algo_state)
{
    island isl(thread_island{}, stateful_algo{}, null_problem{}, 20);
    isl.evolve(5);
    isl.wait_check();
    BOOST_CHECK(isl.get_algorithm().extract<stateful_algo>()->n_evolve == 5);
}

// Extract functionality.
BOOST_AUTO_TEST_CASE(island_extract)
{
    island isl(thread_island{}, stateful_algo{}, null_problem{}, 20);
    BOOST_CHECK(isl.extract<thread_island>() != nullptr);
    BOOST_CHECK(static_cast<const island &>(isl).extract<thread_island>() != nullptr);
    BOOST_CHECK((std::is_same<thread_island *, decltype(isl.extract<thread_island>())>::value));
    BOOST_CHECK((std::is_same<thread_island const *,
                              decltype(static_cast<const island &>(isl).extract<thread_island>())>::value));
    BOOST_CHECK(isl.is<thread_island>());
#if !defined(_MSC_VER) || defined(__clang__)
    BOOST_CHECK(isl.extract<const thread_island>() == nullptr);
#endif
    BOOST_CHECK(isl.extract<udi_01>() == nullptr);
    BOOST_CHECK(!isl.is<udi_01>());
    isl = island(udi_01{}, stateful_algo{}, null_problem{}, 20);
    BOOST_CHECK(isl.extract<thread_island>() == nullptr);
    BOOST_CHECK(!isl.is<thread_island>());
    BOOST_CHECK(isl.extract<udi_01>() != nullptr);
    BOOST_CHECK(static_cast<const island &>(isl).extract<udi_01>() != nullptr);
    BOOST_CHECK((std::is_same<udi_01 *, decltype(isl.extract<udi_01>())>::value));
    BOOST_CHECK((std::is_same<udi_01 const *, decltype(static_cast<const island &>(isl).extract<udi_01>())>::value));
    BOOST_CHECK(isl.is<udi_01>());
#if !defined(_MSC_VER) || defined(__clang__)
    BOOST_CHECK(isl.extract<const udi_01>() == nullptr);
#endif
}

// Constructors with bfe arguments.
BOOST_AUTO_TEST_CASE(island_bfe_ctors)
{
    island isl00{stateful_algo{}, rosenbrock{10}, bfe{}, 1000};
    BOOST_CHECK(isl00.get_algorithm().is<stateful_algo>());
    BOOST_CHECK(isl00.get_population().get_problem().is<rosenbrock>());
    BOOST_CHECK(isl00.get_population().size() == 1000u);
    BOOST_CHECK(isl00.get_r_policy().is<fair_replace>());
    BOOST_CHECK(isl00.get_s_policy().is<select_best>());
    auto pop = isl00.get_population();
    BOOST_CHECK(pop.get_problem().get_fevals() == 1000u);
    for (auto i = 0u; i < 1000u; ++i) {
        BOOST_CHECK(pop.get_f()[i] == pop.get_problem().fitness(pop.get_x()[i]));
    }

    // Try also with a udbfe.
    isl00 = island{stateful_algo{}, rosenbrock{10}, thread_bfe{}, 1000};
    BOOST_CHECK(isl00.get_algorithm().is<stateful_algo>());
    BOOST_CHECK(isl00.get_population().get_problem().is<rosenbrock>());
    BOOST_CHECK(isl00.get_population().size() == 1000u);
    BOOST_CHECK(isl00.get_r_policy().is<fair_replace>());
    BOOST_CHECK(isl00.get_s_policy().is<select_best>());
    pop = isl00.get_population();
    BOOST_CHECK(pop.get_problem().get_fevals() == 1000u);
    for (auto i = 0u; i < 1000u; ++i) {
        BOOST_CHECK(pop.get_f()[i] == pop.get_problem().fitness(pop.get_x()[i]));
    }

    // With policies.
    isl00 = island{stateful_algo{}, rosenbrock{10}, thread_bfe{}, 1000, udrp00{}, udsp00{}};
    BOOST_CHECK(isl00.get_algorithm().is<stateful_algo>());
    BOOST_CHECK(isl00.get_population().get_problem().is<rosenbrock>());
    BOOST_CHECK(isl00.get_population().size() == 1000u);
    BOOST_CHECK(isl00.get_r_policy().is<udrp00>());
    BOOST_CHECK(isl00.get_s_policy().is<udsp00>());
    pop = isl00.get_population();
    BOOST_CHECK(pop.get_problem().get_fevals() == 1000u);
    for (auto i = 0u; i < 1000u; ++i) {
        BOOST_CHECK(pop.get_f()[i] == pop.get_problem().fitness(pop.get_x()[i]));
    }

    isl00 = island{thread_island{}, stateful_algo{}, rosenbrock{10}, bfe{}, 1000};
    BOOST_CHECK(isl00.get_algorithm().is<stateful_algo>());
    BOOST_CHECK(isl00.get_population().get_problem().is<rosenbrock>());
    BOOST_CHECK(isl00.get_population().size() == 1000u);
    BOOST_CHECK(isl00.get_r_policy().is<fair_replace>());
    BOOST_CHECK(isl00.get_s_policy().is<select_best>());
    pop = isl00.get_population();
    BOOST_CHECK(pop.get_problem().get_fevals() == 1000u);
    for (auto i = 0u; i < 1000u; ++i) {
        BOOST_CHECK(pop.get_f()[i] == pop.get_problem().fitness(pop.get_x()[i]));
    }

    // Try also with a udbfe.
    isl00 = island{thread_island{}, stateful_algo{}, rosenbrock{10}, thread_bfe{}, 1000};
    BOOST_CHECK(isl00.get_algorithm().is<stateful_algo>());
    BOOST_CHECK(isl00.get_population().get_problem().is<rosenbrock>());
    BOOST_CHECK(isl00.get_population().size() == 1000u);
    BOOST_CHECK(isl00.get_r_policy().is<fair_replace>());
    BOOST_CHECK(isl00.get_s_policy().is<select_best>());
    pop = isl00.get_population();
    BOOST_CHECK(pop.get_problem().get_fevals() == 1000u);
    for (auto i = 0u; i < 1000u; ++i) {
        BOOST_CHECK(pop.get_f()[i] == pop.get_problem().fitness(pop.get_x()[i]));
    }

    // With policies.
    isl00 = island{thread_island{}, stateful_algo{}, rosenbrock{10}, thread_bfe{}, 1000, udrp00{}, udsp00{}};
    BOOST_CHECK(isl00.get_algorithm().is<stateful_algo>());
    BOOST_CHECK(isl00.get_population().get_problem().is<rosenbrock>());
    BOOST_CHECK(isl00.get_population().size() == 1000u);
    BOOST_CHECK(isl00.get_r_policy().is<udrp00>());
    BOOST_CHECK(isl00.get_s_policy().is<udsp00>());
    pop = isl00.get_population();
    BOOST_CHECK(pop.get_problem().get_fevals() == 1000u);
    for (auto i = 0u; i < 1000u; ++i) {
        BOOST_CHECK(pop.get_f()[i] == pop.get_problem().fitness(pop.get_x()[i]));
    }
}

BOOST_AUTO_TEST_CASE(is_valid)
{
    island p0;
    BOOST_CHECK(p0.is_valid());
    island p1(std::move(p0));
    BOOST_CHECK(!p0.is_valid());
    p0 = island{udi_01{}, de{}, population{rosenbrock{}, 25}};
    BOOST_CHECK(p0.is_valid());
    p1 = std::move(p0);
    BOOST_CHECK(!p0.is_valid());
    p0 = island{udi_01{}, de{}, population{rosenbrock{}, 25}};
    BOOST_CHECK(p0.is_valid());
}

BOOST_AUTO_TEST_CASE(type_index)
{
    island p0;
    BOOST_CHECK(p0.get_type_index() == std::type_index(typeid(thread_island)));
    p0 = island{udi_01a{}, de{}, population{rosenbrock{}, 25}};
    BOOST_CHECK(p0.get_type_index() == std::type_index(typeid(udi_01a)));
}

BOOST_AUTO_TEST_CASE(get_ptr)
{
    island p0;
    BOOST_CHECK(p0.get_ptr() == p0.extract<thread_island>());
    BOOST_CHECK(static_cast<const island &>(p0).get_ptr() == static_cast<const island &>(p0).extract<thread_island>());
    p0 = island{udi_01a{}, de{}, population{rosenbrock{}, 25}};
    BOOST_CHECK(p0.get_ptr() == p0.extract<udi_01a>());
    BOOST_CHECK(static_cast<const island &>(p0).get_ptr() == static_cast<const island &>(p0).extract<udi_01a>());
}