Chris@102: 
Chris@102: ///////////////////////////////////////////////////////////////////////////////
Chris@102: //  Copyright 2013 Nikhar Agrawal
Chris@102: //  Copyright 2013 Christopher Kormanyos
Chris@102: //  Copyright 2013 John Maddock
Chris@102: //  Copyright 2013 Paul Bristow
Chris@102: //  Distributed under the Boost
Chris@102: //  Software License, Version 1.0. (See accompanying file
Chris@102: //  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
Chris@102: 
Chris@102: #ifndef _BOOST_BERNOULLI_B2N_2013_05_30_HPP_
Chris@102: #define _BOOST_BERNOULLI_B2N_2013_05_30_HPP_
Chris@102: 
Chris@102: #include <boost/math/special_functions/math_fwd.hpp>
Chris@102: #include <boost/math/special_functions/detail/unchecked_bernoulli.hpp>
Chris@102: #include <boost/math/special_functions/detail/bernoulli_details.hpp>
Chris@102: 
Chris@102: namespace boost { namespace math { 
Chris@102:    
Chris@102: namespace detail {
Chris@102: 
Chris@102: template <class T, class OutputIterator, class Policy, int N>
Chris@102: OutputIterator bernoulli_number_imp(OutputIterator out, std::size_t start, std::size_t n, const Policy& pol, const mpl::int_<N>& tag)
Chris@102: {
Chris@102:    for(std::size_t i = start; (i <= max_bernoulli_b2n<T>::value) && (i < start + n); ++i)
Chris@102:    {
Chris@102:       *out = unchecked_bernoulli_imp<T>(i, tag);
Chris@102:       ++out;
Chris@102:    }
Chris@102:    
Chris@102:    for(std::size_t i = (std::max)(static_cast<std::size_t>(max_bernoulli_b2n<T>::value + 1), start); i < start + n; ++i)
Chris@102:    {
Chris@102:       // We must overflow:
Chris@102:       *out = (i & 1 ? 1 : -1) * policies::raise_overflow_error<T>("boost::math::bernoulli_b2n<%1%>(n)", 0, T(i), pol);
Chris@102:       ++out;
Chris@102:    }
Chris@102:    return out;
Chris@102: }
Chris@102: 
Chris@102: template <class T, class OutputIterator, class Policy>
Chris@102: OutputIterator bernoulli_number_imp(OutputIterator out, std::size_t start, std::size_t n, const Policy& pol, const mpl::int_<0>& tag)
Chris@102: {
Chris@102:    for(std::size_t i = start; (i <= max_bernoulli_b2n<T>::value) && (i < start + n); ++i)
Chris@102:    {
Chris@102:       *out = unchecked_bernoulli_imp<T>(i, tag);
Chris@102:       ++out;
Chris@102:    }
Chris@102:    //
Chris@102:    // Short circuit return so we don't grab the mutex below unless we have to:
Chris@102:    //
Chris@102:    if(start + n <= max_bernoulli_b2n<T>::value)
Chris@102:       return out;
Chris@102: 
Chris@102:    return get_bernoulli_numbers_cache<T, Policy>().copy_bernoulli_numbers(out, start, n, pol);
Chris@102: }
Chris@102: 
Chris@102: } // namespace detail
Chris@102: 
Chris@102: template <class T, class Policy>
Chris@102: inline T bernoulli_b2n(const int i, const Policy &pol)
Chris@102: {
Chris@102:    typedef mpl::int_<detail::bernoulli_imp_variant<T>::value> tag_type;
Chris@102:    if(i < 0)
Chris@102:       return policies::raise_domain_error<T>("boost::math::bernoulli_b2n<%1%>", "Index should be >= 0 but got %1%", T(i), pol);
Chris@102: 
Chris@102:    T result = 0; // The = 0 is just to silence compiler warings :-(
Chris@102:    boost::math::detail::bernoulli_number_imp<T>(&result, static_cast<std::size_t>(i), 1u, pol, tag_type());
Chris@102:    return result;
Chris@102: }
Chris@102: 
Chris@102: template <class T>
Chris@102: inline T bernoulli_b2n(const int i)
Chris@102: {
Chris@102:    return boost::math::bernoulli_b2n<T>(i, policies::policy<>());
Chris@102: }
Chris@102: 
Chris@102: template <class T, class OutputIterator, class Policy>
Chris@102: inline OutputIterator bernoulli_b2n(const int start_index,
Chris@102:                                     const unsigned number_of_bernoullis_b2n,
Chris@102:                                     OutputIterator out_it,
Chris@102:                                     const Policy& pol)
Chris@102: {
Chris@102:    typedef mpl::int_<detail::bernoulli_imp_variant<T>::value> tag_type;
Chris@102:    if(start_index < 0)
Chris@102:    {
Chris@102:       *out_it = policies::raise_domain_error<T>("boost::math::bernoulli_b2n<%1%>", "Index should be >= 0 but got %1%", T(start_index), pol);
Chris@102:       return ++out_it;
Chris@102:    }
Chris@102: 
Chris@102:    return boost::math::detail::bernoulli_number_imp<T>(out_it, start_index, number_of_bernoullis_b2n, pol, tag_type());
Chris@102: }
Chris@102: 
Chris@102: template <class T, class OutputIterator>
Chris@102: inline OutputIterator bernoulli_b2n(const int start_index,
Chris@102:                                     const unsigned number_of_bernoullis_b2n,
Chris@102:                                     OutputIterator out_it)
Chris@102: {
Chris@102:    return boost::math::bernoulli_b2n<T, OutputIterator>(start_index, number_of_bernoullis_b2n, out_it, policies::policy<>());
Chris@102: }
Chris@102: 
Chris@102: template <class T, class Policy>
Chris@102: inline T tangent_t2n(const int i, const Policy &pol)
Chris@102: {
Chris@102:    if(i < 0)
Chris@102:       return policies::raise_domain_error<T>("boost::math::tangent_t2n<%1%>", "Index should be >= 0 but got %1%", T(i), pol);
Chris@102: 
Chris@102:    T result;
Chris@102:    boost::math::detail::get_bernoulli_numbers_cache<T, Policy>().copy_tangent_numbers(&result, i, 1, pol);
Chris@102:    return result;
Chris@102: }
Chris@102: 
Chris@102: template <class T>
Chris@102: inline T tangent_t2n(const int i)
Chris@102: {
Chris@102:    return boost::math::tangent_t2n<T>(i, policies::policy<>());
Chris@102: }
Chris@102: 
Chris@102: template <class T, class OutputIterator, class Policy>
Chris@102: inline OutputIterator tangent_t2n(const int start_index,
Chris@102:                                     const unsigned number_of_tangent_t2n,
Chris@102:                                     OutputIterator out_it,
Chris@102:                                     const Policy& pol)
Chris@102: {
Chris@102:    if(start_index < 0)
Chris@102:    {
Chris@102:       *out_it = policies::raise_domain_error<T>("boost::math::tangent_t2n<%1%>", "Index should be >= 0 but got %1%", T(start_index), pol);
Chris@102:       return ++out_it;
Chris@102:    }
Chris@102: 
Chris@102:    return boost::math::detail::get_bernoulli_numbers_cache<T, Policy>().copy_tangent_numbers(out_it, start_index, number_of_tangent_t2n, pol);
Chris@102: }
Chris@102: 
Chris@102: template <class T, class OutputIterator>
Chris@102: inline OutputIterator tangent_t2n(const int start_index,
Chris@102:                                     const unsigned number_of_tangent_t2n,
Chris@102:                                     OutputIterator out_it)
Chris@102: {
Chris@102:    return boost::math::tangent_t2n<T, OutputIterator>(start_index, number_of_tangent_t2n, out_it, policies::policy<>());
Chris@102: }
Chris@102: 
Chris@102: } } // namespace boost::math
Chris@102: 
Chris@102: #endif // _BOOST_BERNOULLI_B2N_2013_05_30_HPP_