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
|
// Copyright (C) 2009 by Thomas Moulard, AIST, CNRS, INRIA.
//
// This file is part of the roboptim.
//
// roboptim 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.
//
// roboptim 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 roboptim. If not, see <http://www.gnu.org/licenses/>.
#include "shared-tests/fixture.hh"
#include <iostream>
#include <boost/mpl/vector.hpp>
#include <roboptim/core/io.hh>
#include <roboptim/core/solver-factory.hh>
using namespace roboptim;
// Specify the solver that will be used.
typedef Solver<Function, boost::mpl::vector<Function> > solver_t;
// Define a simple function.
struct F : public Function
{
F () : Function (4, 1, "a * d * (a + b + c) + d")
{}
void impl_compute (result_t& result, const argument_t& argument)
const throw ()
{
result (0) = argument[0] * argument[3]
* (argument[0] + argument[1] + argument[2]) + argument[3];
}
// No gradient, hessian.
};
BOOST_FIXTURE_TEST_SUITE (core, TestSuiteConfiguration)
BOOST_AUTO_TEST_CASE (plugin)
{
boost::shared_ptr<boost::test_tools::output_test_stream>
output = retrievePattern ("plugin");
// Instantiate the function and the problem.
F f;
solver_t::problem_t pb (f);
// Instantiate the factory using the dummy solver.
SolverFactory<solver_t> factory ("dummy", pb);
// Retrieve a solver instance from the factory.
solver_t& solver = factory ();
// Get the Boost.Variant minimum.
solver_t::result_t res = solver.minimum ();
// Get the "real" minimum.
solver.getMinimum<SolverError> ();
// Display problem and solver.
(*output) << pb << std::endl
<< "---" << std::endl
<< solver << std::endl;
std::cout << pb << std::endl
<< "---" << std::endl
<< solver << std::endl;
// Try to get the minimum from a GenericSolver*.
GenericSolver* gs = &solver;
(*output) << gs->getMinimum <SolverError> ().what ()
<< std::endl;
std::cout << output->str () << std::endl;
BOOST_CHECK (output->match_pattern ());
}
BOOST_AUTO_TEST_SUITE_END ()
|