/dports/science/pagmo2/pagmo2-2.18.0/tests/ |
H A D | default_bfe.cpp | 116 BOOST_CHECK(p.get_fevals() == 0u); in BOOST_AUTO_TEST_CASE() 119 BOOST_CHECK(p.get_fevals() == 3u); in BOOST_AUTO_TEST_CASE() 124 BOOST_CHECK(p.get_fevals() == 0u); in BOOST_AUTO_TEST_CASE() 127 BOOST_CHECK(p.get_fevals() == 3u); in BOOST_AUTO_TEST_CASE()
|
H A D | member_bfe.cpp | 84 BOOST_CHECK(p.get_fevals() == 0u); in BOOST_AUTO_TEST_CASE() 87 BOOST_CHECK(p.get_fevals() == 3u); in BOOST_AUTO_TEST_CASE()
|
H A D | thread_bfe.cpp | 74 BOOST_CHECK_EQUAL(p0.get_fevals(), 5000u); in BOOST_AUTO_TEST_CASE() 88 BOOST_CHECK_EQUAL(p0.get_fevals(), 2500u); in BOOST_AUTO_TEST_CASE()
|
H A D | cstrs_self_adaptive.cpp | 84 BOOST_CHECK_EQUAL(udp_p.m_pop_ptr->get_problem().get_fevals(), NP); in BOOST_AUTO_TEST_CASE() 91 BOOST_CHECK_EQUAL(udp_p.m_pop_ptr->get_problem().get_fevals(), NP); in BOOST_AUTO_TEST_CASE() 94 BOOST_CHECK_EQUAL(udp_p.m_pop_ptr->get_problem().get_fevals(), NP + 1); in BOOST_AUTO_TEST_CASE() 97 BOOST_CHECK_EQUAL(udp_p.m_pop_ptr->get_problem().get_fevals(), NP + 1); in BOOST_AUTO_TEST_CASE()
|
H A D | population.cpp | 176 BOOST_CHECK(pop.get_problem().get_fevals() == 5u); in BOOST_AUTO_TEST_CASE() 406 BOOST_CHECK(pop0.get_problem().get_fevals() == 0u); in BOOST_AUTO_TEST_CASE() 413 BOOST_CHECK(pop100.get_problem().get_fevals() == 100u); in BOOST_AUTO_TEST_CASE() 427 BOOST_CHECK(pop1000.get_problem().get_fevals() == 1000u); in BOOST_AUTO_TEST_CASE() 440 BOOST_CHECK(pop1000.get_problem().get_fevals() == 1000u); in BOOST_AUTO_TEST_CASE()
|
H A D | problem.cpp | 352 BOOST_CHECK(p1.get_fevals() == 0u); in BOOST_AUTO_TEST_CASE() 401 BOOST_CHECK(p2.get_fevals() == 1u); in BOOST_AUTO_TEST_CASE() 506 BOOST_CHECK(p2.get_fevals() == 1u); in BOOST_AUTO_TEST_CASE() 712 BOOST_CHECK(p2.get_fevals() == N); in BOOST_AUTO_TEST_CASE() 1349 BOOST_CHECK(p.get_fevals() == 0u); in BOOST_AUTO_TEST_CASE() 1351 BOOST_CHECK(p.get_fevals() == 100u); in BOOST_AUTO_TEST_CASE() 1353 BOOST_CHECK(p.get_fevals() == 110u); in BOOST_AUTO_TEST_CASE() 1355 BOOST_CHECK(p.get_fevals() == 110u); in BOOST_AUTO_TEST_CASE() 1549 BOOST_CHECK(p.get_fevals() == 3u); in BOOST_AUTO_TEST_CASE()
|
H A D | island.cpp | 563 BOOST_CHECK(pop.get_problem().get_fevals() == 1000u); in BOOST_AUTO_TEST_CASE() 576 BOOST_CHECK(pop.get_problem().get_fevals() == 1000u); in BOOST_AUTO_TEST_CASE() 589 BOOST_CHECK(pop.get_problem().get_fevals() == 1000u); in BOOST_AUTO_TEST_CASE() 601 BOOST_CHECK(pop.get_problem().get_fevals() == 1000u); in BOOST_AUTO_TEST_CASE() 614 BOOST_CHECK(pop.get_problem().get_fevals() == 1000u); in BOOST_AUTO_TEST_CASE() 627 BOOST_CHECK(pop.get_problem().get_fevals() == 1000u); in BOOST_AUTO_TEST_CASE()
|
H A D | archipelago.cpp | 811 BOOST_CHECK(pop.get_problem().get_fevals() == 100u); in BOOST_AUTO_TEST_CASE() 825 BOOST_CHECK(pop.get_problem().get_fevals() == 100u); in BOOST_AUTO_TEST_CASE() 839 BOOST_CHECK(pop.get_problem().get_fevals() == 100u); in BOOST_AUTO_TEST_CASE() 854 BOOST_CHECK(pop.get_problem().get_fevals() == 100u); in BOOST_AUTO_TEST_CASE() 868 BOOST_CHECK(pop.get_problem().get_fevals() == 100u); in BOOST_AUTO_TEST_CASE() 882 BOOST_CHECK(pop.get_problem().get_fevals() == 100u); in BOOST_AUTO_TEST_CASE() 897 BOOST_CHECK(pop.get_problem().get_fevals() == 100u); in BOOST_AUTO_TEST_CASE() 912 BOOST_CHECK(pop.get_problem().get_fevals() == 100u); in BOOST_AUTO_TEST_CASE()
|
/dports/science/pagmo2/pagmo2-2.18.0/tutorials/ |
H A D | problem_basic.cpp | 95 pagmo::print("fevals: ", p0.get_fevals(), "\n"); in main() 99 pagmo::print("fevals: ", p0.get_fevals(), "\n"); in main() 101 pagmo::print("fevals: ", p0.get_fevals(), "\n"); in main()
|
H A D | problem_basic_s.cpp | 134 pagmo::print("fevals: ", p0.get_fevals(), "\n"); in main() 138 pagmo::print("fevals: ", p0.get_fevals(), "\n"); in main()
|
H A D | problem_basic_gh.cpp | 189 pagmo::print("fevals: ", p0.get_fevals(), "\n"); in main() 193 pagmo::print("fevals: ", p0.get_fevals(), "\n\n"); in main()
|
/dports/science/pagmo2/pagmo2-2.18.0/src/algorithms/ |
H A D | sea.cpp | 63 auto fevals0 = prob.get_fevals(); // disount for the already made fevals in evolve() 132 print(std::setw(7), i, std::setw(15), prob.get_fevals() - fevals0, std::setw(15), in evolve() 136 … m_log.emplace_back(i, prob.get_fevals() - fevals0, pop.get_f()[best_idx][0], improvement, mut); in evolve() 148 print(std::setw(7), i, std::setw(15), prob.get_fevals() - fevals0, std::setw(15), in evolve() 152 … m_log.emplace_back(i, prob.get_fevals() - fevals0, pop.get_f()[best_idx][0], improvement, mut); in evolve()
|
H A D | compass_search.cpp | 87 auto fevals0 = prob.get_fevals(); // discount for the already made fevals in evolve() 175 … print(std::setw(7), prob.get_fevals() - fevals0, std::setw(15), cur_best_f[0], std::setw(15), n, in evolve() 179 m_log.emplace_back(prob.get_fevals() - fevals0, cur_best_f[0], n, l, newrange); in evolve()
|
H A D | mbh.cpp | 114 auto fevals0 = prob.get_fevals(); // discount for the already made fevals in evolve() 189 … print(std::setw(7), prob.get_fevals() - fevals0, std::setw(15), cur_best_f[0], std::setw(15), n, in evolve() 197 m_log.emplace_back(prob.get_fevals() - fevals0, cur_best_f[0], n, l, i); in evolve()
|
H A D | bee_colony.cpp | 73 auto fevals0 = prob.get_fevals(); // fevals already made in evolve() 228 …print(std::setw(7), gen, std::setw(15), prob.get_fevals() - fevals0, std::setw(15), pop.champion_f… in evolve() 232 …m_log.emplace_back(gen, prob.get_fevals() - fevals0, pop.champion_f()[0], pop.get_f()[best_idx][0]… in evolve()
|
H A D | ihs.cpp | 85 auto fevals0 = prob.get_fevals(); // discount for the already made fevals in evolve() 305 …print(std::setw(7), prob.get_fevals() - fevals0, std::setw(15), ppar_cur, std::setw(15), bw_cur, s… in log_a_line() 317 m_log.emplace_back(prob.get_fevals() - fevals0, ppar_cur, bw_cur, dx, df, n, l, ideal_point); in log_a_line()
|
H A D | moead.cpp | 114 auto fevals0 = prob.get_fevals(); // discount for the fevals already made in evolve() 195 … print(std::setw(7), gen, std::setw(15), prob.get_fevals() - fevals0, std::setw(15), adf); in evolve() 205 m_log.emplace_back(gen, prob.get_fevals() - fevals0, adf, ideal_point); in evolve()
|
H A D | de.cpp | 87 auto fevals0 = prob.get_fevals(); // disount for the already made fevals in evolve() 342 print(std::setw(7), gen, std::setw(15), prob.get_fevals() - fevals0, std::setw(15), in evolve() 346 … m_log.emplace_back(gen, prob.get_fevals() - fevals0, pop.get_f()[best_idx][0], dx, df); in evolve()
|
H A D | nsga2.cpp | 100 auto fevals0 = prob.get_fevals(); // discount for the fevals already made in evolve() 162 print(std::setw(7), gen, std::setw(15), prob.get_fevals() - fevals0); in evolve() 172 m_log.emplace_back(gen, prob.get_fevals() - fevals0, ideal_point); in evolve()
|
H A D | xnes.cpp | 107 auto fevals0 = prob.get_fevals(); // discount for the already made fevals in evolve() 282 print(std::setw(7), gen, std::setw(15), prob.get_fevals() - fevals0, std::setw(15), in evolve() 286 … m_log.emplace_back(gen, prob.get_fevals() - fevals0, pop.get_f()[idx_b][0], dx, df, sigma); in evolve()
|
H A D | simulated_annealing.cpp | 103 auto fevals0 = prob.get_fevals(); // disount for the already made fevals in evolve() 190 auto fevals_count = prob.get_fevals() - fevals0; in evolve()
|
H A D | maco.cpp | 104 auto fevals0 = prob.get_fevals(); // discount for the already made fevals in evolve() 440 print(std::setw(7), gen, std::setw(15), prob.get_fevals() - fevals0); in evolve() 443 print(std::setw(7), gen, std::setw(15), prob.get_fevals()); in evolve() 455 m_log.emplace_back(gen, prob.get_fevals() - fevals0, ideal_point_sol_arch); in evolve() 458 m_log.emplace_back(gen, prob.get_fevals(), ideal_point_sol_arch); in evolve()
|
/dports/science/py-pygmo2/pygmo2-2.18.0/doc/tutorials/ |
H A D | using_population.rst | 32 >>> print(pop1.problem.get_fevals()) 36 >>> print(pop2.problem.get_fevals()) 77 >>> pop1.problem.get_fevals() == 1 103 >>> pop1.problem.get_fevals() == 1 111 >>> pop1.problem.get_fevals() == 1 116 >>> pop1.problem.get_fevals() == 2 121 >>> pop1.problem.get_fevals() == 2
|
H A D | using_problem.rst | 69 >>> prob.get_fevals() == 0 78 >>> prob.get_fevals() == 1
|
/dports/science/py-pygmo2/pygmo2-2.18.0/pygmo/ |
H A D | _algorithm_test.py | 461 self.assertTrue(popc.problem.get_fevals() > 1) 474 self.assertTrue(popc.problem.get_fevals() > 1) 490 self.assertTrue(popc.problem.get_fevals() > 1) 510 self.assertTrue(popc.problem.get_fevals() > 1) 524 self.assertTrue(popc.problem.get_fevals() > 1)
|