285 lines
7.1 KiB
C++
285 lines
7.1 KiB
C++
// Copyright John Maddock 2007.
|
|
// Use, modification and distribution are subject to the
|
|
// Boost Software License, Version 1.0. (See accompanying file
|
|
// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
|
|
|
#include "required_defines.hpp"
|
|
|
|
#include "performance_measure.hpp"
|
|
|
|
#include <boost/math/special_functions/gamma.hpp>
|
|
#include <boost/array.hpp>
|
|
|
|
#define T double
|
|
#include "../test/test_gamma_data.ipp"
|
|
|
|
template <std::size_t N>
|
|
double gamma_evaluate2(const boost::array<boost::array<T, 3>, N>& data)
|
|
{
|
|
double result = 0;
|
|
for(unsigned i = 0; i < N; ++i)
|
|
result += boost::math::tgamma(data[i][0]);
|
|
return result;
|
|
}
|
|
|
|
BOOST_MATH_PERFORMANCE_TEST(gamma_test, "gamma")
|
|
{
|
|
double result = gamma_evaluate2(factorials);
|
|
result += gamma_evaluate2(near_1);
|
|
result += gamma_evaluate2(near_2);
|
|
result += gamma_evaluate2(near_0);
|
|
result += gamma_evaluate2(near_m10);
|
|
result += gamma_evaluate2(near_m55);
|
|
|
|
consume_result(result);
|
|
set_call_count(
|
|
(sizeof(factorials)
|
|
+ sizeof(near_1)
|
|
+ sizeof(near_2)
|
|
+ sizeof(near_0)
|
|
+ sizeof(near_m10)
|
|
+ sizeof(near_m55)) / sizeof(factorials[0]));
|
|
}
|
|
|
|
template <std::size_t N>
|
|
double lgamma_evaluate2(const boost::array<boost::array<T, 3>, N>& data)
|
|
{
|
|
double result = 0;
|
|
for(unsigned i = 0; i < N; ++i)
|
|
result += boost::math::lgamma(data[i][0]);
|
|
return result;
|
|
}
|
|
|
|
BOOST_MATH_PERFORMANCE_TEST(lgamma_test, "lgamma")
|
|
{
|
|
double result = lgamma_evaluate2(factorials);
|
|
result += lgamma_evaluate2(near_1);
|
|
result += lgamma_evaluate2(near_2);
|
|
result += lgamma_evaluate2(near_0);
|
|
result += lgamma_evaluate2(near_m10);
|
|
result += lgamma_evaluate2(near_m55);
|
|
|
|
consume_result(result);
|
|
set_call_count(
|
|
(sizeof(factorials)
|
|
+ sizeof(near_1)
|
|
+ sizeof(near_2)
|
|
+ sizeof(near_0)
|
|
+ sizeof(near_m10)
|
|
+ sizeof(near_m55)) / sizeof(factorials[0]));
|
|
}
|
|
|
|
template <std::size_t N>
|
|
double tgamma1pm1_evaluate2(const boost::array<boost::array<T, 2>, N>& data)
|
|
{
|
|
double result = 0;
|
|
for(unsigned i = 0; i < N; ++i)
|
|
result += boost::math::tgamma1pm1(data[i][0]);
|
|
return result;
|
|
}
|
|
|
|
BOOST_MATH_PERFORMANCE_TEST(gamma1pm1_test, "tgamma1pm1")
|
|
{
|
|
double result = tgamma1pm1_evaluate2(gammap1m1_data);
|
|
|
|
consume_result(result);
|
|
set_call_count(
|
|
sizeof(gammap1m1_data) / sizeof(gammap1m1_data[0]));
|
|
}
|
|
|
|
#ifdef TEST_CEPHES
|
|
|
|
extern "C" {
|
|
|
|
double gamma(double);
|
|
double lgam(double);
|
|
|
|
}
|
|
|
|
template <std::size_t N>
|
|
double gamma_evaluate_cephes(const boost::array<boost::array<T, 3>, N>& data)
|
|
{
|
|
double result = 0;
|
|
for(unsigned i = 0; i < N; ++i)
|
|
result += gamma(data[i][0]);
|
|
return result;
|
|
}
|
|
|
|
BOOST_MATH_PERFORMANCE_TEST(gamma_test, "gamma-cephes")
|
|
{
|
|
double result = gamma_evaluate_cephes(factorials);
|
|
result += gamma_evaluate_cephes(near_1);
|
|
result += gamma_evaluate_cephes(near_2);
|
|
result += gamma_evaluate_cephes(near_0);
|
|
result += gamma_evaluate_cephes(near_m10);
|
|
result += gamma_evaluate_cephes(near_m55);
|
|
|
|
consume_result(result);
|
|
set_call_count(
|
|
(sizeof(factorials)
|
|
+ sizeof(near_1)
|
|
+ sizeof(near_2)
|
|
+ sizeof(near_0)
|
|
+ sizeof(near_m10)
|
|
+ sizeof(near_m55)) / sizeof(factorials[0]));
|
|
}
|
|
|
|
template <std::size_t N>
|
|
double lgamma_evaluate_cephes(const boost::array<boost::array<T, 3>, N>& data)
|
|
{
|
|
double result = 0;
|
|
for(unsigned i = 0; i < N; ++i)
|
|
result += lgam(data[i][0]);
|
|
return result;
|
|
}
|
|
|
|
BOOST_MATH_PERFORMANCE_TEST(lgamma_test, "lgamma-cephes")
|
|
{
|
|
double result = lgamma_evaluate_cephes(factorials);
|
|
result += lgamma_evaluate_cephes(near_1);
|
|
result += lgamma_evaluate_cephes(near_2);
|
|
result += lgamma_evaluate_cephes(near_0);
|
|
result += lgamma_evaluate_cephes(near_m10);
|
|
result += lgamma_evaluate_cephes(near_m55);
|
|
|
|
consume_result(result);
|
|
set_call_count(
|
|
(sizeof(factorials)
|
|
+ sizeof(near_1)
|
|
+ sizeof(near_2)
|
|
+ sizeof(near_0)
|
|
+ sizeof(near_m10)
|
|
+ sizeof(near_m55)) / sizeof(factorials[0]));
|
|
}
|
|
|
|
#endif
|
|
|
|
#ifdef TEST_GSL
|
|
|
|
#include <gsl/gsl_sf_gamma.h>
|
|
|
|
template <std::size_t N>
|
|
double gamma_evaluate_gsl(const boost::array<boost::array<T, 3>, N>& data)
|
|
{
|
|
double result = 0;
|
|
for(unsigned i = 0; i < N; ++i)
|
|
result += gsl_sf_gamma(data[i][0]);
|
|
return result;
|
|
}
|
|
|
|
BOOST_MATH_PERFORMANCE_TEST(gamma_test, "gamma-gsl")
|
|
{
|
|
double result = gamma_evaluate_gsl(factorials);
|
|
result += gamma_evaluate_gsl(near_1);
|
|
result += gamma_evaluate_gsl(near_2);
|
|
result += gamma_evaluate_gsl(near_0);
|
|
result += gamma_evaluate_gsl(near_m10);
|
|
result += gamma_evaluate_gsl(near_m55);
|
|
|
|
consume_result(result);
|
|
set_call_count(
|
|
(sizeof(factorials)
|
|
+ sizeof(near_1)
|
|
+ sizeof(near_2)
|
|
+ sizeof(near_0)
|
|
+ sizeof(near_m10)
|
|
+ sizeof(near_m55)) / sizeof(factorials[0]));
|
|
}
|
|
|
|
template <std::size_t N>
|
|
double lgamma_evaluate_gsl(const boost::array<boost::array<T, 3>, N>& data)
|
|
{
|
|
double result = 0;
|
|
for(unsigned i = 0; i < N; ++i)
|
|
result += gsl_sf_lngamma(data[i][0]);
|
|
return result;
|
|
}
|
|
|
|
BOOST_MATH_PERFORMANCE_TEST(lgamma_test, "lgamma-gsl")
|
|
{
|
|
double result = lgamma_evaluate_gsl(factorials);
|
|
result += lgamma_evaluate_gsl(near_1);
|
|
result += lgamma_evaluate_gsl(near_2);
|
|
result += lgamma_evaluate_gsl(near_0);
|
|
result += lgamma_evaluate_gsl(near_m10);
|
|
result += lgamma_evaluate_gsl(near_m55);
|
|
|
|
consume_result(result);
|
|
set_call_count(
|
|
(sizeof(factorials)
|
|
+ sizeof(near_1)
|
|
+ sizeof(near_2)
|
|
+ sizeof(near_0)
|
|
+ sizeof(near_m10)
|
|
+ sizeof(near_m55)) / sizeof(factorials[0]));
|
|
}
|
|
|
|
#endif
|
|
|
|
#ifdef TEST_DCDFLIB
|
|
#include <dcdflib.h>
|
|
|
|
template <std::size_t N>
|
|
double gamma_evaluate2_dcd(const boost::array<boost::array<T, 3>, N>& data)
|
|
{
|
|
double result = 0;
|
|
for(unsigned i = 0; i < N; ++i)
|
|
{
|
|
double x = data[i][0];
|
|
result += gamma_x(&x);
|
|
}
|
|
return result;
|
|
}
|
|
|
|
BOOST_MATH_PERFORMANCE_TEST(gamma_test_dcd, "gamma-dcd")
|
|
{
|
|
double result = gamma_evaluate2_dcd(factorials);
|
|
result += gamma_evaluate2_dcd(near_1);
|
|
result += gamma_evaluate2_dcd(near_2);
|
|
result += gamma_evaluate2_dcd(near_0);
|
|
result += gamma_evaluate2_dcd(near_m10);
|
|
result += gamma_evaluate2_dcd(near_m55);
|
|
|
|
consume_result(result);
|
|
set_call_count(
|
|
(sizeof(factorials)
|
|
+ sizeof(near_1)
|
|
+ sizeof(near_2)
|
|
+ sizeof(near_0)
|
|
+ sizeof(near_m10)
|
|
+ sizeof(near_m55)) / sizeof(factorials[0]));
|
|
}
|
|
|
|
template <std::size_t N>
|
|
double lgamma_evaluate2_dcd(const boost::array<boost::array<T, 3>, N>& data)
|
|
{
|
|
double result = 0;
|
|
for(unsigned i = 0; i < N; ++i)
|
|
{
|
|
double x = data[i][0];
|
|
result += gamma_log(&x);
|
|
}
|
|
return result;
|
|
}
|
|
|
|
BOOST_MATH_PERFORMANCE_TEST(lgamma_test_dcd, "lgamma-dcd")
|
|
{
|
|
double result = lgamma_evaluate2_dcd(factorials);
|
|
result += lgamma_evaluate2_dcd(near_1);
|
|
result += lgamma_evaluate2_dcd(near_2);
|
|
result += lgamma_evaluate2_dcd(near_0);
|
|
result += lgamma_evaluate2_dcd(near_m10);
|
|
result += lgamma_evaluate2_dcd(near_m55);
|
|
|
|
consume_result(result);
|
|
set_call_count(
|
|
(sizeof(factorials)
|
|
+ sizeof(near_1)
|
|
+ sizeof(near_2)
|
|
+ sizeof(near_0)
|
|
+ sizeof(near_m10)
|
|
+ sizeof(near_m55)) / sizeof(factorials[0]));
|
|
}
|
|
|
|
#endif
|