fibonacci.cpp

Go to the documentation of this file.

/******************************************************************************
** Copyright © 2002 by J.M.McGuiness, coder@hussar.me.uk
**
** This library 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 2.1 of the License, or (at your option) any later version.
**
** This 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
** Lesser General Public License for more details.
**
** You should have received a copy of the GNU Lesser General Public
** License along with this library; if not, write to the Free Software
** Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
 
#include "stdafx.h"
 
#define BOOST_TEST_MODULE libjmmcg_tests
#include <boost/test/included/unit_test.hpp>
 
#include <boost/mpl/list.hpp>
 
#include "core/fibonacci.hpp"
 
using namespace libjmmcg;
 
typedef boost::mpl::list<
   std::pair<mpl::fibonacci<0>, boost::mpl::int_<1>>,
   std::pair<mpl::fibonacci<1>, boost::mpl::int_<1>>,
   std::pair<mpl::fibonacci<2>, boost::mpl::int_<2>>,
   std::pair<mpl::fibonacci<3>, boost::mpl::int_<3>>,
   std::pair<mpl::fibonacci<4>, boost::mpl::int_<5>>,
   std::pair<mpl::fibonacci<5>, boost::mpl::int_<8>>,
   std::pair<mpl::fibonacci<6>, boost::mpl::int_<13>>,
   std::pair<mpl::fibonacci<7>, boost::mpl::int_<21>>,
   std::pair<mpl::fibonacci<8>, boost::mpl::int_<34>>,
   std::pair<mpl::fibonacci<9>, boost::mpl::int_<55>>,
   std::pair<mpl::fibonacci<10>, boost::mpl::int_<89>>
> check_mpl_fibonacci_tests;
 
BOOST_AUTO_TEST_SUITE(fibonacci_tests)
 
BOOST_AUTO_TEST_SUITE(mpl)
 
BOOST_AUTO_TEST_CASE_TEMPLATE(check_value, fibonacci_t, check_mpl_fibonacci_tests) {
   BOOST_CHECK_EQUAL(fibonacci_t::first_type::value, fibonacci_t::second_type::value);
}
 
BOOST_AUTO_TEST_SUITE_END()
 
BOOST_AUTO_TEST_SUITE(dyn)
 
BOOST_AUTO_TEST_CASE(fibonacci_0) {
   BOOST_CHECK_EQUAL(libjmmcg::dyn::fibonacci::result(0), 1ull);
}
 
BOOST_AUTO_TEST_CASE(fibonacci_1) {
   BOOST_CHECK_EQUAL(libjmmcg::dyn::fibonacci::result(1), 1ull);
}
 
BOOST_AUTO_TEST_CASE(fibonacci_2) {
   BOOST_CHECK_EQUAL(libjmmcg::dyn::fibonacci::result(2), 2ull);
}
 
BOOST_AUTO_TEST_CASE(fibonacci_3) {
   BOOST_CHECK_EQUAL(libjmmcg::dyn::fibonacci::result(3), 3ull);
}
 
BOOST_AUTO_TEST_CASE(fibonacci_4) {
   BOOST_CHECK_EQUAL(libjmmcg::dyn::fibonacci::result(4), 5ull);
}
 
BOOST_AUTO_TEST_CASE(fibonacci_5) {
   BOOST_CHECK_EQUAL(libjmmcg::dyn::fibonacci::result(5), 8ull);
}
 
BOOST_AUTO_TEST_CASE(fibonacci_6) {
   BOOST_CHECK_EQUAL(libjmmcg::dyn::fibonacci::result(6), 13ull);
}
 
BOOST_AUTO_TEST_CASE(fibonacci_7) {
   BOOST_CHECK_EQUAL(libjmmcg::dyn::fibonacci::result(7), 21ull);
}
 
BOOST_AUTO_TEST_CASE(fibonacci_8) {
   BOOST_CHECK_EQUAL(libjmmcg::dyn::fibonacci::result(8), 34ull);
}
 
BOOST_AUTO_TEST_CASE(fibonacci_9) {
   BOOST_CHECK_EQUAL(libjmmcg::dyn::fibonacci::result(9), 55ull);
}
 
BOOST_AUTO_TEST_CASE(fibonacci_10) {
   BOOST_CHECK_EQUAL(libjmmcg::dyn::fibonacci::result(10), 89ull);
}
 
BOOST_AUTO_TEST_SUITE_END()
 
BOOST_AUTO_TEST_SUITE_END()