|
|
Boost-Commit : |
Subject: [Boost-commit] svn:boost r83913 - in branches/release: boost/math boost/math/bindings boost/math/bindings/detail boost/math/concepts boost/math/constants boost/math/distributions boost/math/policies boost/math/special_functions boost/math/special_functions/detail boost/math/tools libs/math libs/math/doc/sf_and_dist libs/math/doc/sf_and_dist/distributions libs/math/doc/sf_and_dist/graphs libs/math/doc/sf_and_dist/html libs/math/doc/sf_and_dist/html/index libs/math/doc/sf_and_dist/html/math_toolkit libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders libs/math/doc/sf_and_dist/html/math_toolkit/constants libs/math/doc/sf_and_dist/html/math_toolkit/constants/tutorial libs/math/doc/sf_and_dist/html/math_toolkit/dist libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/cs_eg libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/find_eg libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/nccs_eg libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/normal_example libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg libs/math/doc/sf_and_dist/html/math_toolkit/extern_c libs/math/doc/sf_and_dist/html/math_toolkit/main_overview libs/math/doc/sf_and_dist/html/math_toolkit/perf libs/math/doc/sf_and_dist/html/math_toolkit/policy libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial libs/math/doc/sf_and_dist/html/math_toolkit/special libs/math/doc/sf_and_dist/html/math_toolkit/special/airy libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint libs/math/doc/sf_and_dist/html/math_toolkit/special/expint libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials libs/math/doc/sf_and_dist/html/math_toolkit/special/hankel libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper libs/math/doc/sf_and_dist/html/math_toolkit/special/jacobi libs/math/doc/sf_and_dist/html/math_toolkit/special/powers libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_erf libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly libs/math/doc/sf_and_dist/html/math_toolkit/special/sinc libs/math/doc/sf_and_dist/html/math_toolkit/special/zetas libs/math/doc/sf_and_dist/html/math_toolkit/status libs/math/doc/sf_and_dist/html/math_toolkit/toolkit libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1 libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2 libs/math/doc/sf_and_dist/html/math_toolkit/using_udt libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/high_precision libs/math/doc/sf_and_dist/html/math_toolkit/utils libs/math/doc/sf_and_dist/html/math_toolkit/utils/fp_facets libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float libs/math/doc/sf_and_dist/html/math_toolkit/utils/rounding libs/math/example libs/math/minimax libs/math/test libs/math/test/compile_test libs/math/test/test_instances libs/math/test/test_rational_instances libs/math/tools
From: john_at_[hidden]
Date: 2013-04-15 04:48:16
Author: johnmaddock
Date: 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
New Revision: 83913
URL: http://svn.boost.org/trac/boost/changeset/83913
Log:
Big merge of all pending Math lib changes from trunk.
Added:
branches/release/boost/math/special_functions/detail/airy_ai_bi_zero.hpp
- copied unchanged from r83900, /trunk/boost/math/special_functions/detail/airy_ai_bi_zero.hpp
branches/release/boost/math/special_functions/detail/bessel_jy_zero.hpp
- copied unchanged from r83900, /trunk/boost/math/special_functions/detail/bessel_jy_zero.hpp
branches/release/libs/math/doc/sf_and_dist/graphs/airy_zeros.png
- copied unchanged from r83900, /trunk/libs/math/doc/sf_and_dist/graphs/airy_zeros.png
branches/release/libs/math/doc/sf_and_dist/graphs/airy_zeros.svg
- copied unchanged from r83900, /trunk/libs/math/doc/sf_and_dist/graphs/airy_zeros.svg
branches/release/libs/math/doc/sf_and_dist/graphs/bessel_j_zeros.png
- copied unchanged from r83900, /trunk/libs/math/doc/sf_and_dist/graphs/bessel_j_zeros.png
branches/release/libs/math/doc/sf_and_dist/graphs/bessel_j_zeros.svg
- copied unchanged from r83900, /trunk/libs/math/doc/sf_and_dist/graphs/bessel_j_zeros.svg
branches/release/libs/math/doc/sf_and_dist/graphs/neumann_y_zeros.png
- copied unchanged from r83900, /trunk/libs/math/doc/sf_and_dist/graphs/neumann_y_zeros.png
branches/release/libs/math/doc/sf_and_dist/graphs/neumann_y_zeros.svg
- copied unchanged from r83900, /trunk/libs/math/doc/sf_and_dist/graphs/neumann_y_zeros.svg
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel/bessel0.html
- copied unchanged from r83900, /trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel/bessel0.html
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/cos_pi.html
- copied unchanged from r83900, /trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/cos_pi.html
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/sin_pi.html
- copied unchanged from r83900, /trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/sin_pi.html
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/high_precision/
- copied from r83900, /trunk/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/high_precision/
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/high_precision.html
- copied unchanged from r83900, /trunk/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/high_precision.html
branches/release/libs/math/example/airy_zeros_example.cpp
- copied unchanged from r83900, /trunk/libs/math/example/airy_zeros_example.cpp
branches/release/libs/math/example/bessel_errors_example.cpp
- copied unchanged from r83900, /trunk/libs/math/example/bessel_errors_example.cpp
branches/release/libs/math/example/bessel_zeros_example.cpp
- copied unchanged from r83900, /trunk/libs/math/example/bessel_zeros_example.cpp
branches/release/libs/math/example/bessel_zeros_example_1.cpp
- copied unchanged from r83900, /trunk/libs/math/example/bessel_zeros_example_1.cpp
branches/release/libs/math/example/bessel_zeros_interator_example.cpp
- copied unchanged from r83900, /trunk/libs/math/example/bessel_zeros_interator_example.cpp
branches/release/libs/math/example/big_seventh.cpp
- copied unchanged from r83900, /trunk/libs/math/example/big_seventh.cpp
branches/release/libs/math/example/fft_sines_table.cpp
- copied unchanged from r83900, /trunk/libs/math/example/fft_sines_table.cpp
branches/release/libs/math/example/neumann_zeros_example_1.cpp
- copied unchanged from r83900, /trunk/libs/math/example/neumann_zeros_example_1.cpp
branches/release/libs/math/example/numerical_derivative_example.cpp
- copied unchanged from r83900, /trunk/libs/math/example/numerical_derivative_example.cpp
branches/release/libs/math/example/sines.hpp
- copied unchanged from r83900, /trunk/libs/math/example/sines.hpp
branches/release/libs/math/example/test_cpp_float_close_fraction.cpp
- copied unchanged from r83900, /trunk/libs/math/example/test_cpp_float_close_fraction.cpp
branches/release/libs/math/test/multiprc_concept_check_1.cpp
- copied unchanged from r83900, /trunk/libs/math/test/multiprc_concept_check_1.cpp
branches/release/libs/math/test/multiprc_concept_check_2.cpp
- copied unchanged from r83900, /trunk/libs/math/test/multiprc_concept_check_2.cpp
branches/release/libs/math/test/multiprc_concept_check_3.cpp
- copied unchanged from r83900, /trunk/libs/math/test/multiprc_concept_check_3.cpp
branches/release/libs/math/test/multiprc_concept_check_4.cpp
- copied unchanged from r83900, /trunk/libs/math/test/multiprc_concept_check_4.cpp
branches/release/libs/math/test/test_bessel_airy_zeros.cpp
- copied unchanged from r83900, /trunk/libs/math/test/test_bessel_airy_zeros.cpp
branches/release/libs/math/test/test_instances/
- copied from r83900, /trunk/libs/math/test/test_instances/
Removed:
branches/release/libs/math/test/double_test_instances.cpp
branches/release/libs/math/test/float_test_instances.cpp
branches/release/libs/math/test/ldouble_test_instances.cpp
branches/release/libs/math/test/real_concept_test_instances.cpp
branches/release/libs/math/test/test_instances.hpp
Properties modified:
branches/release/boost/math/ (props changed)
branches/release/libs/math/ (props changed)
branches/release/libs/math/doc/sf_and_dist/faq.qbk (contents, props changed)
branches/release/libs/math/test/s_.ipp (props changed)
Text files modified:
branches/release/boost/math/bindings/detail/big_digamma.hpp | 1
branches/release/boost/math/bindings/detail/big_lanczos.hpp | 1
branches/release/boost/math/bindings/e_float.hpp | 1
branches/release/boost/math/bindings/mpfr.hpp | 80 +++
branches/release/boost/math/concepts/real_concept.hpp | 7
branches/release/boost/math/concepts/std_real_concept.hpp | 3
branches/release/boost/math/constants/calculate_constants.hpp | 10
branches/release/boost/math/constants/constants.hpp | 76 ++
branches/release/boost/math/constants/generate.hpp | 4
branches/release/boost/math/distributions/poisson.hpp | 39
branches/release/boost/math/policies/error_handling.hpp | 217 ++++----
branches/release/boost/math/policies/policy.hpp | 10
branches/release/boost/math/special_functions/airy.hpp | 191 +++++++
branches/release/boost/math/special_functions/bessel.hpp | 357 ++++++++++++-
branches/release/boost/math/special_functions/detail/bessel_j0.hpp | 5
branches/release/boost/math/special_functions/detail/bessel_j1.hpp | 8
branches/release/boost/math/special_functions/detail/bessel_jn.hpp | 8
branches/release/boost/math/special_functions/detail/bessel_jy.hpp | 1027 ++++++++++++++++++++-------------------
branches/release/boost/math/special_functions/detail/bessel_jy_asym.hpp | 178 +-----
branches/release/boost/math/special_functions/detail/bessel_y0.hpp | 8
branches/release/boost/math/special_functions/detail/bessel_y1.hpp | 8
branches/release/boost/math/special_functions/detail/bessel_yn.hpp | 3
branches/release/boost/math/special_functions/detail/ibeta_inverse.hpp | 14
branches/release/boost/math/special_functions/detail/igamma_inverse.hpp | 2
branches/release/boost/math/special_functions/detail/round_fwd.hpp | 21
branches/release/boost/math/special_functions/detail/unchecked_factorial.hpp | 20
branches/release/boost/math/special_functions/factorials.hpp | 1
branches/release/boost/math/special_functions/fpclassify.hpp | 81 +-
branches/release/boost/math/special_functions/gamma.hpp | 97 ++-
branches/release/boost/math/special_functions/jacobi_elliptic.hpp | 8
branches/release/boost/math/special_functions/math_fwd.hpp | 278 +++++++---
branches/release/boost/math/special_functions/next.hpp | 95 ++-
branches/release/boost/math/special_functions/round.hpp | 9
branches/release/boost/math/special_functions/sign.hpp | 21
branches/release/boost/math/special_functions/sinc.hpp | 52 -
branches/release/boost/math/special_functions/spherical_harmonic.hpp | 2
branches/release/boost/math/special_functions/trunc.hpp | 22
branches/release/boost/math/special_functions/zeta.hpp | 6
branches/release/boost/math/tools/big_constant.hpp | 4
branches/release/boost/math/tools/config.hpp | 47 +
branches/release/boost/math/tools/precision.hpp | 2
branches/release/boost/math/tools/roots.hpp | 12
branches/release/boost/math/tools/test.hpp | 2
branches/release/boost/math/tools/toms748_solve.hpp | 2
branches/release/libs/math/doc/sf_and_dist/bessel_ik.qbk | 2
branches/release/libs/math/doc/sf_and_dist/bessel_jy.qbk | 380 +++++++++++++-
branches/release/libs/math/doc/sf_and_dist/bessel_spherical.qbk | 2
branches/release/libs/math/doc/sf_and_dist/common_overviews.qbk | 98 +-
branches/release/libs/math/doc/sf_and_dist/concepts.qbk | 351 ++++++++++---
branches/release/libs/math/doc/sf_and_dist/constants.qbk | 78 +-
branches/release/libs/math/doc/sf_and_dist/credits.qbk | 14
branches/release/libs/math/doc/sf_and_dist/distributions/distribution_construction.qbk | 16
branches/release/libs/math/doc/sf_and_dist/distributions/negative_binomial.qbk | 92 +-
branches/release/libs/math/doc/sf_and_dist/distributions/rayleigh.qbk | 36
branches/release/libs/math/doc/sf_and_dist/error.qbk | 30
branches/release/libs/math/doc/sf_and_dist/faq.qbk | 46 +
branches/release/libs/math/doc/sf_and_dist/html/index.html | 45 +
branches/release/libs/math/doc/sf_and_dist/html/index/s13.html | 31
branches/release/libs/math/doc/sf_and_dist/html/index/s14.html | 12
branches/release/libs/math/doc/sf_and_dist/html/index/s15.html | 12
branches/release/libs/math/doc/sf_and_dist/html/index/s16.html | 10
branches/release/libs/math/doc/sf_and_dist/html/index/s17.html | 105 ++-
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/implementation.html | 58 +-
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/lanczos.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/refs.html | 22
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/relative_error.html | 27
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/remez.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/constants.html | 10
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/constants/FAQ.html | 21
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/constants/constants.html | 10
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/constants/intro.html | 41
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/constants/new_const.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/constants/tutorial.html | 10
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/constants/tutorial/non_templ.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/constants/tutorial/templ.html | 10
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/constants/tutorial/user_def.html | 42 +
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist.html | 10
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dist_algorithms.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/bernoulli_dist.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/beta_dist.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/binomial_dist.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/cauchy_dist.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/chi_squared_dist.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/exp_dist.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/extreme_dist.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/f_dist.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/gamma_dist.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/geometric_dist.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/hypergeometric_dist.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/inverse_chi_squared_dist.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/inverse_gamma_dist.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/inverse_gaussian_dist.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/laplace_dist.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/logistic_dist.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/lognormal_dist.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/nc_beta_dist.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/nc_chi_squared_dist.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/nc_f_dist.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/nc_t_dist.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/negative_binomial_dist.html | 11
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/normal_dist.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/pareto.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/poisson_dist.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/rayleigh.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/skew_normal_dist.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/students_t_dist.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/triangular_dist.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/uniform_dist.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/weibull_dist.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/nmp.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/future.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut.html | 10
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/dist_params.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/complements.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/generic.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/headers.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/objects.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/parameters.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/summary.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/variates.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg.html | 12
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg/binom_conf.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg/binom_size_eg.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg/binomial_coinflip_example.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg/binomial_quiz_example.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/c_sharp.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/cs_eg.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/cs_eg/chi_sq_intervals.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/cs_eg/chi_sq_size.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/cs_eg/chi_sq_test.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/dist_construct_eg.html | 181 +++++-
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/error_eg.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/f_eg.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/find_eg.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/find_eg/find_location_eg.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/find_eg/find_mean_and_sd_eg.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/find_eg/find_scale_eg.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/geometric_eg.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/inverse_chi_squared_eg.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/nag_library.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/nccs_eg.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/nccs_eg/nccs_power_eg.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg/neg_binom_conf.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg/neg_binom_size_eg.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg/negative_binomial_example1.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg/negative_binomial_example2.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/normal_example.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/normal_example/normal_misc.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg.html | 10
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg/paired_st.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg/tut_mean_intervals.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg/tut_mean_size.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg/tut_mean_test.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg/two_sample_students_t.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/extern_c.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/extern_c/c99.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/extern_c/tr1.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/extern_c/tr1_ref.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/building.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/compilers_overview.html | 76 ++
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/config_macros.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/contact.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/conventions.html | 10
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/directories.html | 12
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/error_handling.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/faq.html | 29
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/hints.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/history1.html | 102 +++
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/intro.html | 12
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/namespaces.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/navigation.html | 10
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/perf_over.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/pol_overview.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/result_type.html | 19
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/threads.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/tr1.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf/comp_compilers.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf/comparisons.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf/getting_best.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf/interp.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf/perf_over.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf/perf_test_app.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf/tuning.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_overview.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/assert_undefined.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/discrete_quant_ref.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/error_handling_policies.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/internal_promotion.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/iteration_pol.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/namespace_pol.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/pol_ref_ref.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/policy_defaults.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/precision_pol.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/ad_hoc_dist_policies.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/ad_hoc_sf_policies.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/changing_policy_defaults.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/namespace_policies.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/policy_tut_defaults.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/policy_usage.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/understand_dis_quant.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/user_def_err_pol.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/what_is_a_policy.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special.html | 15
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/airy.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/airy/ai.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/airy/aip.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/airy/bi.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/airy/bip.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel.html | 10
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel/bessel.html | 31
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel/bessel_over.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel/mbessel.html | 17
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel/sph_bessel.html | 11
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_1.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_2.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_3.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_carlson.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_intro.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/expint.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/expint/expint_i.html | 10
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/expint/expint_n.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_binomial.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_double_factorial.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_factorial.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_falling_factorial.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_rising_factorial.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/hankel.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/hankel/cyl_hankel.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/hankel/sph_hankel.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper/acosh.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper/asinh.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper/atanh.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper/inv_hyper_over.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/jacobi.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/jacobi/jac_over.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/jacobi/jacobi_cd.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/jacobi/jacobi_cn.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/jacobi/jacobi_cs.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/jacobi/jacobi_dc.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/jacobi/jacobi_dn.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/jacobi/jacobi_ds.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/jacobi/jacobi_elliptic.html | 16
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/jacobi/jacobi_nc.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/jacobi/jacobi_nd.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/jacobi/jacobi_ns.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/jacobi/jacobi_sc.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/jacobi/jacobi_sd.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/jacobi/jacobi_sn.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/owens_t.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers.html | 21
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/cbrt.html | 10
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/ct_pow.html | 10
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/expm1.html | 10
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/hypot.html | 10
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/log1p.html | 16
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/powm1.html | 10
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/sqrt1pm1.html | 10
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta/beta_derivative.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta/beta_function.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta/ibeta_function.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta/ibeta_inv_function.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_erf.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_erf/error_function.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_erf/error_inv.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/digamma.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/gamma_derivatives.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/gamma_ratios.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/igamma.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/igamma_inv.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/lgamma.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/tgamma.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly/hermite.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly/laguerre.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly/legendre.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly/sph_harm.html | 10
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sinc.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sinc/sinc_overview.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sinc/sinc_pi.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sinc/sinhc_pi.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/zetas.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/zetas/zeta.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/status.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/status/credits.html | 23
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/status/history1.html | 102 +++
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/status/issues.html | 39 +
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/cf.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/minima.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/rational.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/roots.html | 43
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/roots2.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/series_evaluation.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/tuples.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2/error_test.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2/minimax.html | 11
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2/polynomials.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2/test_data.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals_overview.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt.html | 37
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/archetypes.html | 20
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/concepts.html | 36
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/dist_concept.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/e_float.html | 2
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/use_mpfr.html | 2
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/use_ntl.html | 2
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/fp_facets.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/fp_facets/examples.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/fp_facets/intro.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/fp_facets/portability.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/fp_facets/rationale.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/fp_facets/reference.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/fpclass.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/float_advance.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/float_distance.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/float_next.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/float_prior.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/nextafter.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/rounding.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/rounding/modf.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/rounding/round.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/rounding/trunc.html | 8
branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/sign_functions.html | 24
branches/release/libs/math/doc/sf_and_dist/html4_symbols.qbk | 12
branches/release/libs/math/doc/sf_and_dist/implementation.qbk | 45
branches/release/libs/math/doc/sf_and_dist/issues.qbk | 30
branches/release/libs/math/doc/sf_and_dist/jacobi_elliptic.qbk | 8
branches/release/libs/math/doc/sf_and_dist/math.qbk | 14
branches/release/libs/math/doc/sf_and_dist/minimax.qbk | 36
branches/release/libs/math/doc/sf_and_dist/overview.qbk | 47
branches/release/libs/math/doc/sf_and_dist/performance.qbk | 99 +-
branches/release/libs/math/doc/sf_and_dist/powers.qbk | 56 ++
branches/release/libs/math/doc/sf_and_dist/references.qbk | 12
branches/release/libs/math/doc/sf_and_dist/result_type_calc.qbk | 36
branches/release/libs/math/doc/sf_and_dist/roadmap.qbk | 21
branches/release/libs/math/doc/sf_and_dist/roots.qbk | 58 +-
branches/release/libs/math/doc/sf_and_dist/sign.qbk | 16
branches/release/libs/math/doc/sf_and_dist/spherical_harmonic.qbk | 2
branches/release/libs/math/example/Jamfile.v2 | 6
branches/release/libs/math/example/constants_eg1.cpp | 30
branches/release/libs/math/example/distribution_construction.cpp | 159 ++++-
branches/release/libs/math/minimax/main.cpp | 5
branches/release/libs/math/test/Jamfile.v2 | 646 ++++++++++++------------
branches/release/libs/math/test/acosh_test.hpp | 2
branches/release/libs/math/test/asinh_test.hpp | 2
branches/release/libs/math/test/atanh_test.hpp | 2
branches/release/libs/math/test/compile_test/instantiate.hpp | 236 ++++++++
branches/release/libs/math/test/complex_test.cpp | 7
branches/release/libs/math/test/hypot_test.cpp | 6
branches/release/libs/math/test/log1p_expm1_test.cpp | 6
branches/release/libs/math/test/log1p_expm1_test.hpp | 4
branches/release/libs/math/test/pch.hpp | 2
branches/release/libs/math/test/pch_light.hpp | 2
branches/release/libs/math/test/pow_test.cpp | 7
branches/release/libs/math/test/powm1_sqrtp1m1_test.cpp | 6
branches/release/libs/math/test/sinc_test.hpp | 2
branches/release/libs/math/test/sinhc_test.hpp | 2
branches/release/libs/math/test/test_airy.cpp | 6
branches/release/libs/math/test/test_bernoulli.cpp | 8
branches/release/libs/math/test/test_bessel_i.cpp | 5
branches/release/libs/math/test/test_bessel_i.hpp | 3
branches/release/libs/math/test/test_bessel_j.cpp | 12
branches/release/libs/math/test/test_bessel_j.hpp | 16
branches/release/libs/math/test/test_bessel_k.cpp | 5
branches/release/libs/math/test/test_bessel_k.hpp | 3
branches/release/libs/math/test/test_bessel_y.cpp | 10
branches/release/libs/math/test/test_bessel_y.hpp | 3
branches/release/libs/math/test/test_beta.cpp | 3
branches/release/libs/math/test/test_beta.hpp | 3
branches/release/libs/math/test/test_beta_dist.cpp | 8
branches/release/libs/math/test/test_binomial.cpp | 8
branches/release/libs/math/test/test_binomial_coeff.cpp | 3
branches/release/libs/math/test/test_binomial_coeff.hpp | 3
branches/release/libs/math/test/test_carlson.cpp | 4
branches/release/libs/math/test/test_carlson.hpp | 3
branches/release/libs/math/test/test_cauchy.cpp | 8
branches/release/libs/math/test/test_cbrt.cpp | 3
branches/release/libs/math/test/test_cbrt.hpp | 5
branches/release/libs/math/test/test_chi_squared.cpp | 8
branches/release/libs/math/test/test_classify.cpp | 6
branches/release/libs/math/test/test_constant_generate.cpp | 1
branches/release/libs/math/test/test_constants.cpp | 60 ++
branches/release/libs/math/test/test_digamma.cpp | 3
branches/release/libs/math/test/test_digamma.hpp | 3
branches/release/libs/math/test/test_dist_overloads.cpp | 8
branches/release/libs/math/test/test_ellint_1.cpp | 3
branches/release/libs/math/test/test_ellint_1.hpp | 3
branches/release/libs/math/test/test_ellint_2.cpp | 3
branches/release/libs/math/test/test_ellint_2.hpp | 3
branches/release/libs/math/test/test_ellint_3.cpp | 3
branches/release/libs/math/test/test_ellint_3.hpp | 3
branches/release/libs/math/test/test_erf.cpp | 3
branches/release/libs/math/test/test_erf.hpp | 3
branches/release/libs/math/test/test_error_handling.cpp | 8
branches/release/libs/math/test/test_expint.cpp | 3
branches/release/libs/math/test/test_expint.hpp | 3
branches/release/libs/math/test/test_exponential_dist.cpp | 8
branches/release/libs/math/test/test_extreme_value.cpp | 9
branches/release/libs/math/test/test_factorials.cpp | 7
branches/release/libs/math/test/test_find_location.cpp | 9
branches/release/libs/math/test/test_find_scale.cpp | 9
branches/release/libs/math/test/test_fisher_f.cpp | 9
branches/release/libs/math/test/test_gamma.cpp | 4
branches/release/libs/math/test/test_gamma.hpp | 16
branches/release/libs/math/test/test_gamma_dist.cpp | 19
branches/release/libs/math/test/test_geometric.cpp | 9
branches/release/libs/math/test/test_hankel.cpp | 7
branches/release/libs/math/test/test_hermite.cpp | 4
branches/release/libs/math/test/test_hermite.hpp | 3
branches/release/libs/math/test/test_hypergeometric_dist.cpp | 9
branches/release/libs/math/test/test_ibeta.cpp | 4
branches/release/libs/math/test/test_ibeta.hpp | 8
branches/release/libs/math/test/test_ibeta_inv.cpp | 4
branches/release/libs/math/test/test_ibeta_inv.hpp | 3
branches/release/libs/math/test/test_ibeta_inv_ab.cpp | 4
branches/release/libs/math/test/test_ibeta_inv_ab.hpp | 3
branches/release/libs/math/test/test_igamma.cpp | 4
branches/release/libs/math/test/test_igamma.hpp | 3
branches/release/libs/math/test/test_igamma_inv.cpp | 4
branches/release/libs/math/test/test_igamma_inv.hpp | 3
branches/release/libs/math/test/test_igamma_inva.cpp | 4
branches/release/libs/math/test/test_igamma_inva.hpp | 3
branches/release/libs/math/test/test_inv_hyp.cpp | 7
branches/release/libs/math/test/test_inverse_chi_squared.cpp | 9
branches/release/libs/math/test/test_inverse_chi_squared_distribution.cpp | 9
branches/release/libs/math/test/test_inverse_gamma_distribution.cpp | 9
branches/release/libs/math/test/test_inverse_gaussian.cpp | 9
branches/release/libs/math/test/test_jacobi.cpp | 4
branches/release/libs/math/test/test_jacobi.hpp | 6
branches/release/libs/math/test/test_laguerre.cpp | 4
branches/release/libs/math/test/test_laguerre.hpp | 3
branches/release/libs/math/test/test_legendre.cpp | 4
branches/release/libs/math/test/test_legendre.hpp | 3
branches/release/libs/math/test/test_logistic_dist.cpp | 9
branches/release/libs/math/test/test_lognormal.cpp | 9
branches/release/libs/math/test/test_long_double_support.cpp | 123 ++--
branches/release/libs/math/test/test_minima.cpp | 7
branches/release/libs/math/test/test_nc_beta.cpp | 9
branches/release/libs/math/test/test_nc_chi_squared.cpp | 9
branches/release/libs/math/test/test_nc_f.cpp | 9
branches/release/libs/math/test/test_nc_t.cpp | 9
branches/release/libs/math/test/test_negative_binomial.cpp | 9
branches/release/libs/math/test/test_next.cpp | 7
branches/release/libs/math/test/test_normal.cpp | 9
branches/release/libs/math/test/test_owens_t.cpp | 9
branches/release/libs/math/test/test_pareto.cpp | 9
branches/release/libs/math/test/test_poisson.cpp | 29
branches/release/libs/math/test/test_policy.cpp | 9
branches/release/libs/math/test/test_policy_2.cpp | 10
branches/release/libs/math/test/test_policy_3.cpp | 9
branches/release/libs/math/test/test_policy_4.cpp | 10
branches/release/libs/math/test/test_policy_5.cpp | 9
branches/release/libs/math/test/test_policy_6.cpp | 10
branches/release/libs/math/test/test_policy_7.cpp | 9
branches/release/libs/math/test/test_policy_8.cpp | 10
branches/release/libs/math/test/test_policy_sf.cpp | 7
branches/release/libs/math/test/test_rational_instances/test_rational.hpp | 12
branches/release/libs/math/test/test_rationals.cpp | 7
branches/release/libs/math/test/test_rayleigh.cpp | 9
branches/release/libs/math/test/test_real_concept.cpp | 9
branches/release/libs/math/test/test_remez.cpp | 7
branches/release/libs/math/test/test_roots.cpp | 7
branches/release/libs/math/test/test_round.cpp | 194 ++++--
branches/release/libs/math/test/test_sign.cpp | 11
branches/release/libs/math/test/test_skew_normal.cpp | 9
branches/release/libs/math/test/test_spherical_harmonic.cpp | 7
branches/release/libs/math/test/test_students_t.cpp | 9
branches/release/libs/math/test/test_tgamma_ratio.cpp | 21
branches/release/libs/math/test/test_tgamma_ratio.hpp | 54 +
branches/release/libs/math/test/test_toms748_solve.cpp | 7
branches/release/libs/math/test/test_tr1.cpp | 7
branches/release/libs/math/test/test_triangular.cpp | 9
branches/release/libs/math/test/test_uniform.cpp | 9
branches/release/libs/math/test/test_weibull.cpp | 9
branches/release/libs/math/test/test_zeta.cpp | 4
branches/release/libs/math/test/test_zeta.hpp | 36 +
branches/release/libs/math/test/zztest_max_digits10.cpp | 9
branches/release/libs/math/tools/carlson_ellint_data.cpp | 4
branches/release/libs/math/tools/digamma_data.cpp | 4
branches/release/libs/math/tools/ellint_e_data.cpp | 4
branches/release/libs/math/tools/ellint_f_data.cpp | 4
branches/release/libs/math/tools/ellint_k_data.cpp | 4
branches/release/libs/math/tools/ellint_pi2_data.cpp | 4
branches/release/libs/math/tools/ellint_pi3_data.cpp | 4
branches/release/libs/math/tools/erf_data.cpp | 4
branches/release/libs/math/tools/gamma_P_inva_data.cpp | 4
branches/release/libs/math/tools/hermite_data.cpp | 4
branches/release/libs/math/tools/hypergeometric_dist_data.cpp | 4
branches/release/libs/math/tools/ibeta_data.cpp | 4
branches/release/libs/math/tools/ibeta_inv_data.cpp | 4
branches/release/libs/math/tools/ibeta_invab_data.cpp | 4
branches/release/libs/math/tools/igamma_data.cpp | 4
branches/release/libs/math/tools/inv_hyp_data.cpp | 4
branches/release/libs/math/tools/laguerre_data.cpp | 4
branches/release/libs/math/tools/lanczos_generator.cpp | 4
branches/release/libs/math/tools/legendre_data.cpp | 4
branches/release/libs/math/tools/spherical_harmonic_data.cpp | 4
branches/release/libs/math/tools/tgamma_ratio_data.cpp | 4
branches/release/libs/math/tools/zeta_data.cpp | 4
519 files changed, 6496 insertions(+), 4031 deletions(-)
Modified: branches/release/boost/math/bindings/detail/big_digamma.hpp
==============================================================================
--- branches/release/boost/math/bindings/detail/big_digamma.hpp (original)
+++ branches/release/boost/math/bindings/detail/big_digamma.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -9,6 +9,7 @@
#include <boost/math/tools/rational.hpp>
#include <boost/math/policies/error_handling.hpp>
#include <boost/math/constants/constants.hpp>
+#include <boost/lexical_cast.hpp>
namespace boost{ namespace math{ namespace detail{
Modified: branches/release/boost/math/bindings/detail/big_lanczos.hpp
==============================================================================
--- branches/release/boost/math/bindings/detail/big_lanczos.hpp (original)
+++ branches/release/boost/math/bindings/detail/big_lanczos.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -7,7 +7,6 @@
#define BOOST_BIG_LANCZOS_HPP
#include <boost/math/special_functions/lanczos.hpp>
-#include <boost/lexical_cast.hpp>
namespace boost{ namespace math{ namespace lanczos{
Modified: branches/release/boost/math/bindings/e_float.hpp
==============================================================================
--- branches/release/boost/math/bindings/e_float.hpp (original)
+++ branches/release/boost/math/bindings/e_float.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -25,6 +25,7 @@
#include <boost/math/special_functions/fpclassify.hpp>
#include <boost/math/bindings/detail/big_digamma.hpp>
#include <boost/math/bindings/detail/big_lanczos.hpp>
+#include <boost/lexical_cast.hpp>
namespace boost{ namespace math{ namespace ef{
Modified: branches/release/boost/math/bindings/mpfr.hpp
==============================================================================
--- branches/release/boost/math/bindings/mpfr.hpp (original)
+++ branches/release/boost/math/bindings/mpfr.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -12,6 +12,7 @@
#define BOOST_MATH_MPLFR_BINDINGS_HPP
#include <boost/config.hpp>
+#include <boost/lexical_cast.hpp>
#ifdef BOOST_MSVC
//
@@ -40,14 +41,25 @@
{
return abs(v);
}
+template <class T, class U>
+inline mpfr_class fabs(const __gmp_expr<T,U>& v)
+{
+ return abs(static_cast<mpfr_class>(v));
+}
-inline mpfr_class pow(const mpfr_class& b, const mpfr_class e)
+inline mpfr_class pow(const mpfr_class& b, const mpfr_class& e)
{
mpfr_class result;
mpfr_pow(result.__get_mp(), b.__get_mp(), e.__get_mp(), GMP_RNDN);
return result;
}
-
+/*
+template <class T, class U, class V, class W>
+inline mpfr_class pow(const __gmp_expr<T,U>& b, const __gmp_expr<V,W>& e)
+{
+ return pow(static_cast<mpfr_class>(b), static_cast<mpfr_class>(e));
+}
+*/
inline mpfr_class ldexp(const mpfr_class& v, int e)
{
//int e = mpfr_get_exp(*v.__get_mp());
@@ -55,6 +67,11 @@
mpfr_set_exp(result.__get_mp(), e);
return result;
}
+template <class T, class U>
+inline mpfr_class ldexp(const __gmp_expr<T,U>& v, int e)
+{
+ return ldexp(static_cast<mpfr_class>(v), e);
+}
inline mpfr_class frexp(const mpfr_class& v, int* expon)
{
@@ -64,6 +81,11 @@
*expon = e;
return result;
}
+template <class T, class U>
+inline mpfr_class frexp(const __gmp_expr<T,U>& v, int* expon)
+{
+ return frexp(static_cast<mpfr_class>(v), expon);
+}
inline mpfr_class fmod(const mpfr_class& v1, const mpfr_class& v2)
{
@@ -74,6 +96,11 @@
n = floor(v1 / v2);
return v1 - n * v2;
}
+template <class T, class U, class V, class W>
+inline mpfr_class fmod(const __gmp_expr<T,U>& v1, const __gmp_expr<V,W>& v2)
+{
+ return fmod(static_cast<mpfr_class>(v1), static_cast<mpfr_class>(v2));
+}
template <class Policy>
inline mpfr_class modf(const mpfr_class& v, long long* ipart, const Policy& pol)
@@ -81,41 +108,77 @@
*ipart = lltrunc(v, pol);
return v - boost::math::tools::real_cast<mpfr_class>(*ipart);
}
+template <class T, class U, class Policy>
+inline mpfr_class modf(const __gmp_expr<T,U>& v, long long* ipart, const Policy& pol)
+{
+ return modf(static_cast<mpfr_class>(v), ipart, pol);
+}
+
template <class Policy>
inline int iround(mpfr_class const& x, const Policy& pol)
{
return boost::math::tools::real_cast<int>(boost::math::round(x, pol));
}
+template <class T, class U, class Policy>
+inline int iround(__gmp_expr<T,U> const& x, const Policy& pol)
+{
+ return iround(static_cast<mpfr_class>(x), pol);
+}
template <class Policy>
inline long lround(mpfr_class const& x, const Policy& pol)
{
return boost::math::tools::real_cast<long>(boost::math::round(x, pol));
}
+template <class T, class U, class Policy>
+inline long lround(__gmp_expr<T,U> const& x, const Policy& pol)
+{
+ return lround(static_cast<mpfr_class>(x), pol);
+}
template <class Policy>
inline long long llround(mpfr_class const& x, const Policy& pol)
{
return boost::math::tools::real_cast<long long>(boost::math::round(x, pol));
}
+template <class T, class U, class Policy>
+inline long long llround(__gmp_expr<T,U> const& x, const Policy& pol)
+{
+ return llround(static_cast<mpfr_class>(x), pol);
+}
template <class Policy>
inline int itrunc(mpfr_class const& x, const Policy& pol)
{
return boost::math::tools::real_cast<int>(boost::math::trunc(x, pol));
}
+template <class T, class U, class Policy>
+inline int itrunc(__gmp_expr<T,U> const& x, const Policy& pol)
+{
+ return itrunc(static_cast<mpfr_class>(x), pol);
+}
template <class Policy>
inline long ltrunc(mpfr_class const& x, const Policy& pol)
{
return boost::math::tools::real_cast<long>(boost::math::trunc(x, pol));
}
+template <class T, class U, class Policy>
+inline long ltrunc(__gmp_expr<T,U> const& x, const Policy& pol)
+{
+ return ltrunc(static_cast<mpfr_class>(x), pol);
+}
template <class Policy>
inline long long lltrunc(mpfr_class const& x, const Policy& pol)
{
return boost::math::tools::real_cast<long long>(boost::math::trunc(x, pol));
}
+template <class T, class U, class Policy>
+inline long long lltrunc(__gmp_expr<T,U> const& x, const Policy& pol)
+{
+ return lltrunc(static_cast<mpfr_class>(x), pol);
+}
namespace boost{ namespace math{
@@ -203,6 +266,19 @@
} // namespace lanczos
+namespace constants{
+
+template <class Real, class Policy>
+struct construction_traits;
+
+template <class Policy>
+struct construction_traits<mpfr_class, Policy>
+{
+ typedef mpl::int_<0> type;
+};
+
+}
+
namespace tools
{
Modified: branches/release/boost/math/concepts/real_concept.hpp
==============================================================================
--- branches/release/boost/math/concepts/real_concept.hpp (original)
+++ branches/release/boost/math/concepts/real_concept.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -84,6 +84,9 @@
real_concept(float c) : m_value(c){}
real_concept(double c) : m_value(c){}
real_concept(long double c) : m_value(c){}
+#ifdef BOOST_MATH_USE_FLOAT128
+ real_concept(__float128 c) : m_value(c){}
+#endif
// Assignment:
real_concept& operator=(char c) { m_value = c; return *this; }
@@ -366,7 +369,7 @@
template <>
inline int digits<concepts::real_concept>(BOOST_MATH_EXPLICIT_TEMPLATE_TYPE_SPEC(concepts::real_concept))
-{
+{
// Assume number of significand bits is same as real_concept_base_type,
// unless std::numeric_limits<T>::is_specialized to provide digits.
return tools::digits<concepts::real_concept_base_type>();
@@ -432,7 +435,7 @@
#if BOOST_WORKAROUND(BOOST_MSVC, <= 1310)
//
-// For some strange reason ADL sometimes fails to find the
+// For some strange reason ADL sometimes fails to find the
// correct overloads, unless we bring these declarations into scope:
//
using concepts::itrunc;
Modified: branches/release/boost/math/concepts/std_real_concept.hpp
==============================================================================
--- branches/release/boost/math/concepts/std_real_concept.hpp (original)
+++ branches/release/boost/math/concepts/std_real_concept.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -67,6 +67,9 @@
std_real_concept(float c) : m_value(c){}
std_real_concept(double c) : m_value(c){}
std_real_concept(long double c) : m_value(c){}
+#ifdef BOOST_MATH_USE_FLOAT128
+ std_real_concept(__float128 c) : m_value(c){}
+#endif
// Assignment:
std_real_concept& operator=(char c) { m_value = c; return *this; }
Modified: branches/release/boost/math/constants/calculate_constants.hpp
==============================================================================
--- branches/release/boost/math/constants/calculate_constants.hpp (original)
+++ branches/release/boost/math/constants/calculate_constants.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -122,6 +122,14 @@
template <class T>
template<int N>
+inline T constant_log_root_two_pi<T>::compute(BOOST_MATH_EXPLICIT_TEMPLATE_TYPE_SPEC(mpl::int_<N>))
+{
+ BOOST_MATH_STD_USING
+ return log(root_two_pi<T, policies::policy<policies::digits2<N> > >());
+}
+
+template <class T>
+template<int N>
inline T constant_root_ln_four<T>::compute(BOOST_MATH_EXPLICIT_TEMPLATE_TYPE_SPEC(mpl::int_<N>))
{
BOOST_MATH_STD_USING
@@ -161,7 +169,7 @@
// See equation 17 with p = 2.
//
T n = 3 + (M ? (std::min)(M, tools::digits<T>()) : tools::digits<T>()) / 4;
- T lim = M ? ldexp(T(1), (std::min)(M, tools::digits<T>())) : tools::epsilon<T>();
+ T lim = M ? ldexp(T(1), 1 - (std::min)(M, tools::digits<T>())) : tools::epsilon<T>();
T lnn = log(n);
T term = 1;
T N = -lnn;
Modified: branches/release/boost/math/constants/constants.hpp
==============================================================================
--- branches/release/boost/math/constants/constants.hpp (original)
+++ branches/release/boost/math/constants/constants.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -14,7 +14,9 @@
#pragma warning(push)
#pragma warning(disable: 4127 4701)
#endif
+#ifndef BOOST_MATH_NO_LEXICAL_CAST
#include <boost/lexical_cast.hpp>
+#endif
#ifdef BOOST_MSVC
#pragma warning(pop)
#endif
@@ -23,11 +25,12 @@
#include <boost/mpl/int.hpp>
#include <boost/type_traits/is_convertible.hpp>
+
namespace boost{ namespace math
{
namespace constants
{
- // To permit other calculations at about 100 decimal digits with NTL::RR type,
+ // To permit other calculations at about 100 decimal digits with some UDT,
// it is obviously necessary to define constants to this accuracy.
// However, some compilers do not accept decimal digits strings as long as this.
@@ -46,7 +49,10 @@
construct_from_float = 1,
construct_from_double = 2,
construct_from_long_double = 3,
- construct_from_string = 4
+ construct_from_string = 4,
+ construct_from_float128 = 5,
+ // Must be the largest value above:
+ construct_max = construct_from_float128
};
//
@@ -63,6 +69,9 @@
typedef typename policies::precision<float, Policy>::type t2;
typedef typename policies::precision<double, Policy>::type t3;
typedef typename policies::precision<long double, Policy>::type t4;
+#ifdef BOOST_MATH_USE_FLOAT128
+ typedef mpl::int_<113> t5;
+#endif
public:
typedef typename mpl::if_<
mpl::and_<boost::is_convertible<float, Real>, mpl::bool_< t1::value <= t2::value>, mpl::bool_<0 != t1::value> >,
@@ -73,11 +82,23 @@
typename mpl::if_<
mpl::and_<boost::is_convertible<long double, Real>, mpl::bool_< t1::value <= t4::value>, mpl::bool_<0 != t1::value> >,
mpl::int_<construct_from_long_double>,
+#ifdef BOOST_MATH_USE_FLOAT128
+ typename mpl::if_<
+ mpl::and_<boost::is_convertible<__float128, Real>, mpl::bool_< t1::value <= t5::value>, mpl::bool_<0 != t1::value> >,
+ mpl::int_<construct_from_float128>,
+ typename mpl::if_<
+ mpl::and_<mpl::bool_< t1::value <= max_string_digits>, mpl::bool_<0 != t1::value> >,
+ mpl::int_<construct_from_string>,
+ mpl::int_<t1::value>
+ >::type
+ >::type
+#else
typename mpl::if_<
mpl::and_<mpl::bool_< t1::value <= max_string_digits>, mpl::bool_<0 != t1::value> >,
mpl::int_<construct_from_string>,
mpl::int_<t1::value>
>::type
+#endif
>::type
>::type
>::type type;
@@ -93,10 +114,24 @@
namespace detail{
+ template <class Real, class Policy = boost::math::policies::policy<> >
+ struct constant_return
+ {
+ typedef typename construction_traits<Real, Policy>::type construct_type;
+ typedef typename mpl::if_c<
+ (construct_type::value == construct_from_string) || (construct_type::value > construct_max),
+ const Real&, Real>::type type;
+ };
+
template <class Real>
Real convert_from_string(const char* p, const mpl::false_&)
{
+#ifdef BOOST_MATH_NO_LEXICAL_CAST
+ // This function should not compile, we don't have the necesary functionality to support it:
+ BOOST_STATIC_ASSERT(sizeof(Real) == 0);
+#else
return boost::lexical_cast<Real>(p);
+#endif
}
template <class Real>
const char* convert_from_string(const char* p, const mpl::true_&)
@@ -104,7 +139,7 @@
return p;
}
- template <class T, T (*F)(BOOST_EXPLICIT_TEMPLATE_TYPE_SPEC(T))>
+ template <class T, const T& (*F)(BOOST_EXPLICIT_TEMPLATE_TYPE_SPEC(T))>
struct constant_initializer
{
static void force_instantiate()
@@ -127,10 +162,10 @@
static const initializer init;
};
- template <class T, T (*F)(BOOST_EXPLICIT_TEMPLATE_TYPE_SPEC(T))>
+ template <class T, const T& (*F)(BOOST_EXPLICIT_TEMPLATE_TYPE_SPEC(T))>
typename constant_initializer<T, F>::initializer const constant_initializer<T, F>::init;
- template <class T, int N, T (*F)(BOOST_MATH_EXPLICIT_TEMPLATE_TYPE_SPEC(mpl::int_<N>) BOOST_MATH_APPEND_EXPLICIT_TEMPLATE_TYPE_SPEC(T))>
+ template <class T, int N, const T& (*F)(BOOST_MATH_EXPLICIT_TEMPLATE_TYPE_SPEC(mpl::int_<N>) BOOST_MATH_APPEND_EXPLICIT_TEMPLATE_TYPE_SPEC(T))>
struct constant_initializer2
{
static void force_instantiate()
@@ -153,26 +188,39 @@
static const initializer init;
};
- template <class T, int N, T (*F)(BOOST_MATH_EXPLICIT_TEMPLATE_TYPE_SPEC(mpl::int_<N>) BOOST_MATH_APPEND_EXPLICIT_TEMPLATE_TYPE_SPEC(T))>
+ template <class T, int N, const T& (*F)(BOOST_MATH_EXPLICIT_TEMPLATE_TYPE_SPEC(mpl::int_<N>) BOOST_MATH_APPEND_EXPLICIT_TEMPLATE_TYPE_SPEC(T))>
typename constant_initializer2<T, N, F>::initializer const constant_initializer2<T, N, F>::init;
}
+#ifdef BOOST_MATH_USE_FLOAT128
+# define BOOST_MATH_FLOAT128_CONSTANT_OVERLOAD(x) \
+ static inline BOOST_CONSTEXPR T get(const mpl::int_<construct_from_float128>&)\
+ { return BOOST_JOIN(x, Q); }
+#else
+# define BOOST_MATH_FLOAT128_CONSTANT_OVERLOAD(x)
+#endif
+
#define BOOST_DEFINE_MATH_CONSTANT(name, x, y)\
namespace detail{\
template <class T> struct BOOST_JOIN(constant_, name){\
private:\
/* The default implementations come next: */ \
- static inline T get_from_string()\
+ static inline const T& get_from_string()\
{\
static const T result = convert_from_string<T>(y, boost::is_convertible<const char*, T>());\
return result;\
}\
/* This one is for very high precision that is none the less known at compile time: */ \
template <int N> static T compute(BOOST_MATH_EXPLICIT_TEMPLATE_TYPE_SPEC(mpl::int_<N>));\
+ template <int N> static inline const T& get_from_compute(BOOST_MATH_EXPLICIT_TEMPLATE_TYPE_SPEC(mpl::int_<N>))\
+ {\
+ static const T result = compute<N>();\
+ return result;\
+ }\
/* public getters come next */\
public:\
- static inline T get(const mpl::int_<construct_from_string>&)\
+ static inline const T& get(const mpl::int_<construct_from_string>&)\
{\
constant_initializer<T, & BOOST_JOIN(constant_, name)<T>::get_from_string >::force_instantiate();\
return get_from_string();\
@@ -183,10 +231,11 @@
{ return x; }\
static inline BOOST_CONSTEXPR T get(const mpl::int_<construct_from_long_double>&)\
{ return BOOST_JOIN(x, L); }\
- template <int N> static inline T get(const mpl::int_<N>&)\
+ BOOST_MATH_FLOAT128_CONSTANT_OVERLOAD(x) \
+ template <int N> static inline const T& get(const mpl::int_<N>&)\
{\
- constant_initializer2<T, N, & BOOST_JOIN(constant_, name)<T>::template compute<N> >::force_instantiate();\
- return compute<N>(); \
+ constant_initializer2<T, N, & BOOST_JOIN(constant_, name)<T>::template get_from_compute<N> >::force_instantiate();\
+ return get_from_compute<N>(); \
}\
/* This one is for true arbitary precision, which may well vary at runtime: */ \
static inline T get(const mpl::int_<0>&)\
@@ -196,9 +245,9 @@
\
\
/* The actual forwarding function: */ \
- template <class T, class Policy> inline BOOST_CONSTEXPR T name(BOOST_MATH_EXPLICIT_TEMPLATE_TYPE_SPEC(T) BOOST_MATH_APPEND_EXPLICIT_TEMPLATE_TYPE_SPEC(Policy))\
+ template <class T, class Policy> inline BOOST_CONSTEXPR typename detail::constant_return<T, Policy>::type name(BOOST_MATH_EXPLICIT_TEMPLATE_TYPE_SPEC(T) BOOST_MATH_APPEND_EXPLICIT_TEMPLATE_TYPE_SPEC(Policy))\
{ return detail:: BOOST_JOIN(constant_, name)<T>::get(typename construction_traits<T, Policy>::type()); }\
- template <class T> inline BOOST_CONSTEXPR T name(BOOST_MATH_EXPLICIT_TEMPLATE_TYPE_SPEC(T))\
+ template <class T> inline BOOST_CONSTEXPR typename detail::constant_return<T>::type name(BOOST_MATH_EXPLICIT_TEMPLATE_TYPE_SPEC(T))\
{ return name<T, boost::math::policies::policy<> >(); }\
\
\
@@ -233,6 +282,7 @@
BOOST_DEFINE_MATH_CONSTANT(root_pi, 1.772453850905516027298167483341145182e+00, "1.77245385090551602729816748334114518279754945612238712821380778985291128459103218137495065673854466541622682362e+00")
BOOST_DEFINE_MATH_CONSTANT(root_half_pi, 1.253314137315500251207882642405522626e+00, "1.25331413731550025120788264240552262650349337030496915831496178817114682730392098747329791918902863305800498633e+00")
BOOST_DEFINE_MATH_CONSTANT(root_two_pi, 2.506628274631000502415765284811045253e+00, "2.50662827463100050241576528481104525300698674060993831662992357634229365460784197494659583837805726611600997267e+00")
+ BOOST_DEFINE_MATH_CONSTANT(log_root_two_pi, 9.189385332046727417803297364056176398e-01, "9.18938533204672741780329736405617639861397473637783412817151540482765695927260397694743298635954197622005646625e-01")
BOOST_DEFINE_MATH_CONSTANT(one_div_root_pi, 5.641895835477562869480794515607725858e-01, "5.64189583547756286948079451560772585844050629328998856844085721710642468441493414486743660202107363443028347906e-01")
BOOST_DEFINE_MATH_CONSTANT(root_one_div_pi, 5.641895835477562869480794515607725858e-01, "5.64189583547756286948079451560772585844050629328998856844085721710642468441493414486743660202107363443028347906e-01")
BOOST_DEFINE_MATH_CONSTANT(pi_minus_three, 1.415926535897932384626433832795028841e-01, "1.41592653589793238462643383279502884197169399375105820974944592307816406286208998628034825342117067982148086513e-01")
Modified: branches/release/boost/math/constants/generate.hpp
==============================================================================
--- branches/release/boost/math/constants/generate.hpp (original)
+++ branches/release/boost/math/constants/generate.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -17,7 +17,7 @@
#elif defined(USE_MPREAL)
#include <boost/math/bindings/mpreal.hpp>
#elif defined(USE_CPP_FLOAT)
-#include <boost/multiprecision/cpp_float.hpp>
+#include <boost/multiprecision/cpp_dec_float.hpp>
#else
#include <boost/math/bindings/rr.hpp>
#endif
@@ -29,7 +29,7 @@
#elif defined(USE_MPREAL)
typedef mpfr::mpreal generator_type;
#elif defined(USE_CPP_FLOAT)
-typedef boost::multiprecision::mp_number<boost::multiprecision::cpp_float<500> > generator_type;
+typedef boost::multiprecision::number<boost::multiprecision::cpp_dec_float<500> > generator_type;
#else
typedef ntl::RR generator_type;
#endif
Modified: branches/release/boost/math/distributions/poisson.hpp
==============================================================================
--- branches/release/boost/math/distributions/poisson.hpp (original)
+++ branches/release/boost/math/distributions/poisson.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -443,9 +443,10 @@
inline RealType quantile(const poisson_distribution<RealType, Policy>& dist, const RealType& p)
{ // Quantile (or Percent Point) Poisson function.
// Return the number of expected events k for a given probability p.
+ static const char* function = "boost::math::quantile(const poisson_distribution<%1%>&, %1%)";
RealType result = 0; // of Argument checks:
if(false == poisson_detail::check_prob(
- "boost::math::quantile(const poisson_distribution<%1%>&, %1%)",
+ function,
p,
&result, Policy()))
{
@@ -455,23 +456,21 @@
if (dist.mean() == 0)
{ // if mean = 0 then p = 0, so k can be anything?
if (false == poisson_detail::check_mean_NZ(
- "boost::math::quantile(const poisson_distribution<%1%>&, %1%)",
+ function,
dist.mean(),
&result, Policy()))
{
return result;
}
}
- /*
- BOOST_MATH_STD_USING // ADL of std functions.
- // if(p == 0) NOT necessarily zero!
- // Not necessarily any special value of k because is unlimited.
- if (p <= exp(-dist.mean()))
- { // if p <= cdf for 0 events (== pdf for 0 events), then quantile must be zero.
- return 0;
+ if(p == 0)
+ {
+ return 0; // Exact result regardless of discrete-quantile Policy
+ }
+ if(p == 1)
+ {
+ return policies::raise_overflow_error<RealType>(function, 0, Policy());
}
- return gamma_q_inva(dist.mean(), p, Policy()) - 1;
- */
typedef typename Policy::discrete_quantile_type discrete_type;
boost::uintmax_t max_iter = policies::get_max_root_iterations<Policy>();
RealType guess, factor = 8;
@@ -512,11 +511,12 @@
// complement of the probability q.
//
// Error checks:
+ static const char* function = "boost::math::quantile(complement(const poisson_distribution<%1%>&, %1%))";
RealType q = c.param;
const poisson_distribution<RealType, Policy>& dist = c.dist;
RealType result = 0; // of argument checks.
if(false == poisson_detail::check_prob(
- "boost::math::quantile(const poisson_distribution<%1%>&, %1%)",
+ function,
q,
&result, Policy()))
{
@@ -526,20 +526,21 @@
if (dist.mean() == 0)
{ // if mean = 0 then p = 0, so k can be anything?
if (false == poisson_detail::check_mean_NZ(
- "boost::math::quantile(const poisson_distribution<%1%>&, %1%)",
+ function,
dist.mean(),
&result, Policy()))
{
return result;
}
}
- /*
- if (-q <= boost::math::expm1(-dist.mean()))
- { // if q <= cdf(complement for 0 events, then quantile must be zero.
- return 0;
+ if(q == 0)
+ {
+ return policies::raise_overflow_error<RealType>(function, 0, Policy());
+ }
+ if(q == 1)
+ {
+ return 0; // Exact result regardless of discrete-quantile Policy
}
- return gamma_p_inva(dist.mean(), q, Policy()) -1;
- */
typedef typename Policy::discrete_quantile_type discrete_type;
boost::uintmax_t max_iter = policies::get_max_root_iterations<Policy>();
RealType guess, factor = 8;
Modified: branches/release/boost/math/policies/error_handling.hpp
==============================================================================
--- branches/release/boost/math/policies/error_handling.hpp (original)
+++ branches/release/boost/math/policies/error_handling.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -46,7 +46,7 @@
namespace policies{
//
-// Forward declarations of user error handlers,
+// Forward declarations of user error handlers,
// it's up to the user to provide the definition of these:
//
template <class T>
@@ -117,9 +117,9 @@
template <class T>
inline T raise_domain_error(
- const char* function,
- const char* message,
- const T& val,
+ const char* function,
+ const char* message,
+ const T& val,
const ::boost::math::policies::domain_error< ::boost::math::policies::throw_on_error>&)
{
raise_error<std::domain_error, T>(function, message, val);
@@ -129,9 +129,9 @@
template <class T>
inline T raise_domain_error(
- const char* ,
- const char* ,
- const T& ,
+ const char* ,
+ const char* ,
+ const T& ,
const ::boost::math::policies::domain_error< ::boost::math::policies::ignore_error>&)
{
// This may or may not do the right thing, but the user asked for the error
@@ -141,9 +141,9 @@
template <class T>
inline T raise_domain_error(
- const char* ,
- const char* ,
- const T& ,
+ const char* ,
+ const char* ,
+ const T& ,
const ::boost::math::policies::domain_error< ::boost::math::policies::errno_on_error>&)
{
errno = EDOM;
@@ -154,9 +154,9 @@
template <class T>
inline T raise_domain_error(
- const char* function,
- const char* message,
- const T& val,
+ const char* function,
+ const char* message,
+ const T& val,
const ::boost::math::policies::domain_error< ::boost::math::policies::user_error>&)
{
return user_domain_error(function, message, val);
@@ -164,9 +164,9 @@
template <class T>
inline T raise_pole_error(
- const char* function,
- const char* message,
- const T& val,
+ const char* function,
+ const char* message,
+ const T& val,
const ::boost::math::policies::pole_error< ::boost::math::policies::throw_on_error>&)
{
return boost::math::policies::detail::raise_domain_error(function, message, val, ::boost::math::policies::domain_error< ::boost::math::policies::throw_on_error>());
@@ -174,9 +174,9 @@
template <class T>
inline T raise_pole_error(
- const char* function,
- const char* message,
- const T& val,
+ const char* function,
+ const char* message,
+ const T& val,
const ::boost::math::policies::pole_error< ::boost::math::policies::ignore_error>&)
{
return ::boost::math::policies::detail::raise_domain_error(function, message, val, ::boost::math::policies::domain_error< ::boost::math::policies::ignore_error>());
@@ -184,9 +184,9 @@
template <class T>
inline T raise_pole_error(
- const char* function,
- const char* message,
- const T& val,
+ const char* function,
+ const char* message,
+ const T& val,
const ::boost::math::policies::pole_error< ::boost::math::policies::errno_on_error>&)
{
return ::boost::math::policies::detail::raise_domain_error(function, message, val, ::boost::math::policies::domain_error< ::boost::math::policies::errno_on_error>());
@@ -194,9 +194,9 @@
template <class T>
inline T raise_pole_error(
- const char* function,
- const char* message,
- const T& val,
+ const char* function,
+ const char* message,
+ const T& val,
const ::boost::math::policies::pole_error< ::boost::math::policies::user_error>&)
{
return user_pole_error(function, message, val);
@@ -204,8 +204,8 @@
template <class T>
inline T raise_overflow_error(
- const char* function,
- const char* message,
+ const char* function,
+ const char* message,
const ::boost::math::policies::overflow_error< ::boost::math::policies::throw_on_error>&)
{
raise_error<std::overflow_error, T>(function, message ? message : "numeric overflow");
@@ -215,8 +215,8 @@
template <class T>
inline T raise_overflow_error(
- const char* ,
- const char* ,
+ const char* ,
+ const char* ,
const ::boost::math::policies::overflow_error< ::boost::math::policies::ignore_error>&)
{
// This may or may not do the right thing, but the user asked for the error
@@ -226,8 +226,8 @@
template <class T>
inline T raise_overflow_error(
- const char* ,
- const char* ,
+ const char* ,
+ const char* ,
const ::boost::math::policies::overflow_error< ::boost::math::policies::errno_on_error>&)
{
errno = ERANGE;
@@ -238,8 +238,8 @@
template <class T>
inline T raise_overflow_error(
- const char* function,
- const char* message,
+ const char* function,
+ const char* message,
const ::boost::math::policies::overflow_error< ::boost::math::policies::user_error>&)
{
return user_overflow_error(function, message, std::numeric_limits<T>::infinity());
@@ -247,8 +247,8 @@
template <class T>
inline T raise_underflow_error(
- const char* function,
- const char* message,
+ const char* function,
+ const char* message,
const ::boost::math::policies::underflow_error< ::boost::math::policies::throw_on_error>&)
{
raise_error<std::underflow_error, T>(function, message ? message : "numeric underflow");
@@ -258,8 +258,8 @@
template <class T>
inline T raise_underflow_error(
- const char* ,
- const char* ,
+ const char* ,
+ const char* ,
const ::boost::math::policies::underflow_error< ::boost::math::policies::ignore_error>&)
{
// This may or may not do the right thing, but the user asked for the error
@@ -269,8 +269,8 @@
template <class T>
inline T raise_underflow_error(
- const char* /* function */,
- const char* /* message */,
+ const char* /* function */,
+ const char* /* message */,
const ::boost::math::policies::underflow_error< ::boost::math::policies::errno_on_error>&)
{
errno = ERANGE;
@@ -281,8 +281,8 @@
template <class T>
inline T raise_underflow_error(
- const char* function,
- const char* message,
+ const char* function,
+ const char* message,
const ::boost::math::policies::underflow_error< ::boost::math::policies::user_error>&)
{
return user_underflow_error(function, message, T(0));
@@ -290,8 +290,8 @@
template <class T>
inline T raise_denorm_error(
- const char* function,
- const char* message,
+ const char* function,
+ const char* message,
const T& /* val */,
const ::boost::math::policies::denorm_error< ::boost::math::policies::throw_on_error>&)
{
@@ -302,8 +302,8 @@
template <class T>
inline T raise_denorm_error(
- const char* ,
- const char* ,
+ const char* ,
+ const char* ,
const T& val,
const ::boost::math::policies::denorm_error< ::boost::math::policies::ignore_error>&)
{
@@ -314,8 +314,8 @@
template <class T>
inline T raise_denorm_error(
- const char* ,
- const char* ,
+ const char* ,
+ const char* ,
const T& val,
const ::boost::math::policies::denorm_error< ::boost::math::policies::errno_on_error>&)
{
@@ -327,8 +327,8 @@
template <class T>
inline T raise_denorm_error(
- const char* function,
- const char* message,
+ const char* function,
+ const char* message,
const T& val,
const ::boost::math::policies::denorm_error< ::boost::math::policies::user_error>&)
{
@@ -337,9 +337,9 @@
template <class T>
inline T raise_evaluation_error(
- const char* function,
- const char* message,
- const T& val,
+ const char* function,
+ const char* message,
+ const T& val,
const ::boost::math::policies::evaluation_error< ::boost::math::policies::throw_on_error>&)
{
raise_error<boost::math::evaluation_error, T>(function, message, val);
@@ -349,9 +349,9 @@
template <class T>
inline T raise_evaluation_error(
- const char* ,
- const char* ,
- const T& val,
+ const char* ,
+ const char* ,
+ const T& val,
const ::boost::math::policies::evaluation_error< ::boost::math::policies::ignore_error>&)
{
// This may or may not do the right thing, but the user asked for the error
@@ -361,9 +361,9 @@
template <class T>
inline T raise_evaluation_error(
- const char* ,
- const char* ,
- const T& val,
+ const char* ,
+ const char* ,
+ const T& val,
const ::boost::math::policies::evaluation_error< ::boost::math::policies::errno_on_error>&)
{
errno = EDOM;
@@ -374,59 +374,61 @@
template <class T>
inline T raise_evaluation_error(
- const char* function,
- const char* message,
- const T& val,
+ const char* function,
+ const char* message,
+ const T& val,
const ::boost::math::policies::evaluation_error< ::boost::math::policies::user_error>&)
{
return user_evaluation_error(function, message, val);
}
template <class T, class TargetType>
-inline T raise_rounding_error(
- const char* function,
- const char* message,
- const T& val,
+inline TargetType raise_rounding_error(
+ const char* function,
+ const char* message,
+ const T& val,
const TargetType&,
const ::boost::math::policies::rounding_error< ::boost::math::policies::throw_on_error>&)
{
raise_error<boost::math::rounding_error, T>(function, message, val);
// we never get here:
- return T(0);
+ return TargetType(0);
}
template <class T, class TargetType>
-inline T raise_rounding_error(
- const char* ,
- const char* ,
- const T& val,
+inline TargetType raise_rounding_error(
+ const char* ,
+ const char* ,
+ const T& val,
const TargetType&,
const ::boost::math::policies::rounding_error< ::boost::math::policies::ignore_error>&)
{
// This may or may not do the right thing, but the user asked for the error
// to be ignored so here we go anyway:
- return std::numeric_limits<T>::is_specialized ? (val > 0 ? (std::numeric_limits<T>::max)() : -(std::numeric_limits<T>::max)()): val;
+ BOOST_STATIC_ASSERT(std::numeric_limits<TargetType>::is_specialized);
+ return val > 0 ? (std::numeric_limits<TargetType>::max)() : (std::numeric_limits<TargetType>::is_integer ? (std::numeric_limits<TargetType>::min)() : -(std::numeric_limits<TargetType>::max)());
}
template <class T, class TargetType>
-inline T raise_rounding_error(
- const char* ,
- const char* ,
- const T& val,
+inline TargetType raise_rounding_error(
+ const char* ,
+ const char* ,
+ const T& val,
const TargetType&,
const ::boost::math::policies::rounding_error< ::boost::math::policies::errno_on_error>&)
{
errno = ERANGE;
// This may or may not do the right thing, but the user asked for the error
// to be silent so here we go anyway:
- return std::numeric_limits<T>::is_specialized ? (val > 0 ? (std::numeric_limits<T>::max)() : -(std::numeric_limits<T>::max)()): val;
+ BOOST_STATIC_ASSERT(std::numeric_limits<TargetType>::is_specialized);
+ return val > 0 ? (std::numeric_limits<TargetType>::max)() : (std::numeric_limits<TargetType>::is_integer ? (std::numeric_limits<TargetType>::min)() : -(std::numeric_limits<TargetType>::max)());
}
template <class T, class TargetType>
-inline T raise_rounding_error(
- const char* function,
- const char* message,
- const T& val,
+inline TargetType raise_rounding_error(
+ const char* function,
+ const char* message,
+ const T& val,
const TargetType& t,
const ::boost::math::policies::rounding_error< ::boost::math::policies::user_error>&)
{
@@ -435,9 +437,9 @@
template <class T, class R>
inline T raise_indeterminate_result_error(
- const char* function,
- const char* message,
- const T& val,
+ const char* function,
+ const char* message,
+ const T& val,
const R& ,
const ::boost::math::policies::indeterminate_result_error< ::boost::math::policies::throw_on_error>&)
{
@@ -448,10 +450,10 @@
template <class T, class R>
inline T raise_indeterminate_result_error(
- const char* ,
- const char* ,
- const T& ,
- const R& result,
+ const char* ,
+ const char* ,
+ const T& ,
+ const R& result,
const ::boost::math::policies::indeterminate_result_error< ::boost::math::policies::ignore_error>&)
{
// This may or may not do the right thing, but the user asked for the error
@@ -461,10 +463,10 @@
template <class T, class R>
inline T raise_indeterminate_result_error(
- const char* ,
- const char* ,
- const T& ,
- const R& result,
+ const char* ,
+ const char* ,
+ const T& ,
+ const R& result,
const ::boost::math::policies::indeterminate_result_error< ::boost::math::policies::errno_on_error>&)
{
errno = EDOM;
@@ -475,10 +477,10 @@
template <class T, class R>
inline T raise_indeterminate_result_error(
- const char* function,
- const char* message,
- const T& val,
- const R& ,
+ const char* function,
+ const char* message,
+ const T& val,
+ const R& ,
const ::boost::math::policies::indeterminate_result_error< ::boost::math::policies::user_error>&)
{
return user_indeterminate_result_error(function, message, val);
@@ -491,7 +493,7 @@
{
typedef typename Policy::domain_error_type policy_type;
return detail::raise_domain_error(
- function, message ? message : "Domain Error evaluating function at %1%",
+ function, message ? message : "Domain Error evaluating function at %1%",
val, policy_type());
}
@@ -500,7 +502,7 @@
{
typedef typename Policy::pole_error_type policy_type;
return detail::raise_pole_error(
- function, message ? message : "Evaluation of function at pole %1%",
+ function, message ? message : "Evaluation of function at pole %1%",
val, policy_type());
}
@@ -509,7 +511,7 @@
{
typedef typename Policy::overflow_error_type policy_type;
return detail::raise_overflow_error<T>(
- function, message ? message : "Overflow Error",
+ function, message ? message : "Overflow Error",
policy_type());
}
@@ -518,7 +520,7 @@
{
typedef typename Policy::underflow_error_type policy_type;
return detail::raise_underflow_error<T>(
- function, message ? message : "Underflow Error",
+ function, message ? message : "Underflow Error",
policy_type());
}
@@ -527,7 +529,7 @@
{
typedef typename Policy::denorm_error_type policy_type;
return detail::raise_denorm_error<T>(
- function, message ? message : "Denorm Error",
+ function, message ? message : "Denorm Error",
val,
policy_type());
}
@@ -537,16 +539,16 @@
{
typedef typename Policy::evaluation_error_type policy_type;
return detail::raise_evaluation_error(
- function, message ? message : "Internal Evaluation Error, best value so far was %1%",
+ function, message ? message : "Internal Evaluation Error, best value so far was %1%",
val, policy_type());
}
template <class T, class TargetType, class Policy>
-inline T raise_rounding_error(const char* function, const char* message, const T& val, const TargetType& t, const Policy&)
+inline TargetType raise_rounding_error(const char* function, const char* message, const T& val, const TargetType& t, const Policy&)
{
typedef typename Policy::rounding_error_type policy_type;
return detail::raise_rounding_error(
- function, message ? message : "Value %1% can not be represented in the target integer type.",
+ function, message ? message : "Value %1% can not be represented in the target integer type.",
val, t, policy_type());
}
@@ -581,7 +583,8 @@
{
typedef typename R::value_type r_type;
r_type re, im;
- bool r = check_overflow<r_type>(val.real(), &re, function, pol) || check_overflow<r_type>(val.imag(), &im, function, pol);
+ bool r = check_overflow<r_type>(val.real(), &re, function, pol);
+ r = check_overflow<r_type>(val.imag(), &im, function, pol) || r;
*result = R(re, im);
return r;
}
@@ -600,7 +603,8 @@
{
typedef typename R::value_type r_type;
r_type re, im;
- bool r = check_underflow<r_type>(val.real(), &re, function, pol) || check_underflow<r_type>(val.imag(), &im, function, pol);
+ bool r = check_underflow<r_type>(val.real(), &re, function, pol);
+ r = check_underflow<r_type>(val.imag(), &im, function, pol) || r;
*result = R(re, im);
return r;
}
@@ -620,7 +624,8 @@
{
typedef typename R::value_type r_type;
r_type re, im;
- bool r = check_denorm<r_type>(val.real(), &re, function, pol) || check_denorm<r_type>(val.imag(), &im, function, pol);
+ bool r = check_denorm<r_type>(val.real(), &re, function, pol);
+ r = check_denorm<r_type>(val.imag(), &im, function, pol) || r;
*result = R(re, im);
return r;
}
Modified: branches/release/boost/math/policies/policy.hpp
==============================================================================
--- branches/release/boost/math/policies/policy.hpp (original)
+++ branches/release/boost/math/policies/policy.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -813,6 +813,16 @@
#endif
+#ifdef BOOST_MATH_USE_FLOAT128
+
+template <class Policy>
+struct precision<__float128, Policy>
+{
+ typedef mpl::int_<113> type;
+};
+
+#endif
+
namespace detail{
template <class T, class Policy>
Modified: branches/release/boost/math/special_functions/airy.hpp
==============================================================================
--- branches/release/boost/math/special_functions/airy.hpp (original)
+++ branches/release/boost/math/special_functions/airy.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -9,6 +9,8 @@
#include <boost/math/special_functions/bessel.hpp>
#include <boost/math/special_functions/cbrt.hpp>
+#include <boost/math/special_functions/detail/airy_ai_bi_zero.hpp>
+#include <boost/math/tools/roots.hpp>
namespace boost{ namespace math{
@@ -151,6 +153,99 @@
}
}
+template <class T, class Policy>
+T airy_ai_zero_imp(unsigned m, const Policy& pol)
+{
+ BOOST_MATH_STD_USING // ADL of std names, needed for log, sqrt.
+
+ // Handle case when the zero'th zero is requested.
+ if(m == 0U)
+ {
+ return policies::raise_domain_error<T>("boost::math::airy_ai_zero<%1%>(%1%,%1%)",
+ "The requested rank of the zero is %1%, but must be 1 or more !", static_cast<T>(m), pol);
+ }
+
+ // Set up the initial guess for the upcoming root-finding.
+ const T guess_root = boost::math::detail::airy_zero::airy_ai_zero_detail::initial_guess<T>(m);
+
+ // Select the maximum allowed iterations, being at least 24.
+ boost::uintmax_t number_of_iterations = (std::max)(24, int(std::numeric_limits<T>::digits10));
+
+ // Select the desired number of binary digits of precision.
+ // Account for the radix of number representations having non-two radix!
+ const int my_digits2 = int(float(std::numeric_limits<T>::digits)
+ * ( log(float(std::numeric_limits<T>::radix))
+ / log(2.0F)));
+
+ // Use a dynamic tolerance because the roots get closer the higher m gets.
+ T tolerance;
+
+ if (m <= 10U) { tolerance = T(0.3F); }
+ else if(m <= 100U) { tolerance = T(0.1F); }
+ else if(m <= 1000U) { tolerance = T(0.05F); }
+ else { tolerance = T(1) / sqrt(T(m)); }
+
+ // Perform the root-finding using Newton-Raphson iteration from Boost.Math.
+ const T am =
+ boost::math::tools::newton_raphson_iterate(
+ boost::math::detail::airy_zero::airy_ai_zero_detail::function_object_ai_and_ai_prime<T, Policy>(pol),
+ guess_root,
+ T(guess_root - tolerance),
+ T(guess_root + tolerance),
+ my_digits2,
+ number_of_iterations);
+
+ static_cast<void>(number_of_iterations);
+
+ return am;
+}
+
+template <class T, class Policy>
+T airy_bi_zero_imp(unsigned m, const Policy& pol)
+{
+ BOOST_MATH_STD_USING // ADL of std names, needed for log, sqrt.
+
+ // Handle case when the zero'th zero is requested.
+ if(m == 0U)
+ {
+ return policies::raise_domain_error<T>("boost::math::airy_bi_zero<%1%>(%1%,%1%)",
+ "The requested rank of the zero is %1%, but must be 1 or more !", static_cast<T>(m), pol);
+ }
+ // Set up the initial guess for the upcoming root-finding.
+ const T guess_root = boost::math::detail::airy_zero::airy_bi_zero_detail::initial_guess<T>(m);
+
+ // Select the maximum allowed iterations, being at least 24.
+ boost::uintmax_t number_of_iterations = (std::max)(24, int(std::numeric_limits<T>::digits10));
+
+ // Select the desired number of binary digits of precision.
+ // Account for the radix of number representations having non-two radix!
+ const int my_digits2 = int(float(std::numeric_limits<T>::digits)
+ * ( log(float(std::numeric_limits<T>::radix))
+ / log(2.0F)));
+
+ // Use a dynamic tolerance because the roots get closer the higher m gets.
+ T tolerance;
+
+ if (m <= 10U) { tolerance = T(0.3F); }
+ else if(m <= 100U) { tolerance = T(0.1F); }
+ else if(m <= 1000U) { tolerance = T(0.05F); }
+ else { tolerance = T(1) / sqrt(T(m)); }
+
+ // Perform the root-finding using Newton-Raphson iteration from Boost.Math.
+ const T bm =
+ boost::math::tools::newton_raphson_iterate(
+ boost::math::detail::airy_zero::airy_bi_zero_detail::function_object_bi_and_bi_prime<T, Policy>(pol),
+ guess_root,
+ T(guess_root - tolerance),
+ T(guess_root + tolerance),
+ my_digits2,
+ number_of_iterations);
+
+ static_cast<void>(number_of_iterations);
+
+ return bm;
+}
+
} // namespace detail
template <class T, class Policy>
@@ -241,6 +336,102 @@
return airy_bi_prime(x, policies::policy<>());
}
+template <class T, class Policy>
+inline T airy_ai_zero(unsigned m, const Policy& pol)
+{
+ BOOST_FPU_EXCEPTION_GUARD
+ typedef typename policies::evaluation<T, Policy>::type value_type;
+ typedef typename policies::normalise<
+ Policy,
+ policies::promote_float<false>,
+ policies::promote_double<false>,
+ policies::discrete_quantile<>,
+ policies::assert_undefined<> >::type forwarding_policy;
+ BOOST_STATIC_ASSERT_MSG(false == std::numeric_limits<T>::is_integer, "Airy return type must be a floating-point type.");
+ return policies::checked_narrowing_cast<T, Policy>(detail::airy_ai_zero_imp<T>(m, pol), "boost::math::airy_ai_zero<%1%>(unsigned)");
+}
+
+template <class T>
+inline T airy_ai_zero(unsigned m)
+{
+ return airy_ai_zero<T>(m, policies::policy<>());
+}
+
+template <class T, class OutputIterator, class Policy>
+inline OutputIterator airy_ai_zero(
+ unsigned start_index,
+ unsigned number_of_zeros,
+ OutputIterator out_it,
+ const Policy& pol)
+{
+ typedef T result_type;
+ BOOST_STATIC_ASSERT_MSG(false == std::numeric_limits<result_type>::is_integer, "Airy return type must be a floating-point type.");
+
+ for(unsigned i = 0; i < number_of_zeros; ++i)
+ {
+ *out_it = boost::math::airy_ai_zero<result_type>(start_index + i, pol);
+ ++out_it;
+ }
+ return out_it;
+}
+
+template <class T, class OutputIterator>
+inline OutputIterator airy_ai_zero(
+ unsigned start_index,
+ unsigned number_of_zeros,
+ OutputIterator out_it)
+{
+ return airy_ai_zero<T>(start_index, number_of_zeros, out_it, policies::policy<>());
+}
+
+template <class T, class Policy>
+inline T airy_bi_zero(unsigned m, const Policy& pol)
+{
+ BOOST_FPU_EXCEPTION_GUARD
+ typedef typename policies::evaluation<T, Policy>::type value_type;
+ typedef typename policies::normalise<
+ Policy,
+ policies::promote_float<false>,
+ policies::promote_double<false>,
+ policies::discrete_quantile<>,
+ policies::assert_undefined<> >::type forwarding_policy;
+ BOOST_STATIC_ASSERT_MSG(false == std::numeric_limits<T>::is_integer, "Airy return type must be a floating-point type.");
+ return policies::checked_narrowing_cast<T, Policy>(detail::airy_bi_zero_imp<T>(m, pol), "boost::math::airy_bi_zero<%1%>(unsigned)");
+}
+
+template <typename T>
+inline T airy_bi_zero(unsigned m)
+{
+ return airy_bi_zero<T>(m, policies::policy<>());
+}
+
+template <class T, class OutputIterator, class Policy>
+inline OutputIterator airy_bi_zero(
+ unsigned start_index,
+ unsigned number_of_zeros,
+ OutputIterator out_it,
+ const Policy& pol)
+{
+ typedef T result_type;
+ BOOST_STATIC_ASSERT_MSG(false == std::numeric_limits<result_type>::is_integer, "Airy return type must be a floating-point type.");
+
+ for(unsigned i = 0; i < number_of_zeros; ++i)
+ {
+ *out_it = boost::math::airy_bi_zero<result_type>(start_index + i, pol);
+ ++out_it;
+ }
+ return out_it;
+}
+
+template <class T, class OutputIterator>
+inline OutputIterator airy_bi_zero(
+ unsigned start_index,
+ unsigned number_of_zeros,
+ OutputIterator out_it)
+{
+ return airy_bi_zero<T>(start_index, number_of_zeros, out_it, policies::policy<>());
+}
+
}} // namespaces
#endif // BOOST_MATH_AIRY_HPP
Modified: branches/release/boost/math/special_functions/bessel.hpp
==============================================================================
--- branches/release/boost/math/special_functions/bessel.hpp (original)
+++ branches/release/boost/math/special_functions/bessel.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -1,4 +1,5 @@
-// Copyright (c) 2007 John Maddock
+// Copyright (c) 2007, 2013 John Maddock
+// Copyright Christopher Kormanyos 2013.
// 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)
@@ -11,12 +12,13 @@
#define BOOST_MATH_BESSEL_HPP
#ifdef _MSC_VER
-#pragma once
+# pragma once
#endif
#include <boost/math/special_functions/detail/bessel_jy.hpp>
#include <boost/math/special_functions/detail/bessel_jn.hpp>
#include <boost/math/special_functions/detail/bessel_yn.hpp>
+#include <boost/math/special_functions/detail/bessel_jy_zero.hpp>
#include <boost/math/special_functions/detail/bessel_ik.hpp>
#include <boost/math/special_functions/detail/bessel_i0.hpp>
#include <boost/math/special_functions/detail/bessel_i1.hpp>
@@ -30,6 +32,7 @@
#include <boost/math/tools/rational.hpp>
#include <boost/math/tools/promotion.hpp>
#include <boost/math/tools/series.hpp>
+#include <boost/math/tools/roots.hpp>
namespace boost{ namespace math{
@@ -98,22 +101,6 @@
function,
"Got x = %1%, but we need x >= 0", x, pol);
}
- if(x == 0)
- return (v == 0) ? 1 : (v > 0) ? 0 :
- policies::raise_domain_error<T>(
- function,
- "Got v = %1%, but require v >= 0 or a negative integer: the result would be complex.", v, pol);
-
-
- if((v >= 0) && ((x < 1) || (v > x * x / 4) || (x < 5)))
- {
- //
- // This series will actually converge rapidly for all small
- // x - say up to x < 20 - but the first few terms are large
- // and divergent which leads to large errors :-(
- //
- return bessel_j_small_z_series(v, x, pol);
- }
T j, y;
bessel_jy(v, x, &j, &y, need_j, pol);
@@ -125,9 +112,11 @@
{
BOOST_MATH_STD_USING // ADL of std names.
int ival = detail::iconv(v, pol);
- if((abs(ival) < 200) && (0 == v - ival))
+ // If v is an integer, use the integer recursion
+ // method, both that and Steeds method are O(v):
+ if((0 == v - ival))
{
- return bessel_jn(ival/*iround(v, pol)*/, x, pol);
+ return bessel_jn(ival, x, pol);
}
return cyl_bessel_j_imp(v, x, bessel_no_int_tag(), pol);
}
@@ -294,14 +283,13 @@
inline T cyl_neumann_imp(T v, T x, const bessel_maybe_int_tag&, const Policy& pol)
{
BOOST_MATH_STD_USING
- typedef typename bessel_asymptotic_tag<T, Policy>::type tag_type;
BOOST_MATH_INSTRUMENT_VARIABLE(v);
BOOST_MATH_INSTRUMENT_VARIABLE(x);
if(floor(v) == v)
{
- if((fabs(x) > asymptotic_bessel_y_limit<T>(tag_type())) && (fabs(x) > 5 * abs(v)))
+ if(asymptotic_bessel_large_x_limit(v, x))
{
T r = asymptotic_bessel_y_large_x_2(static_cast<T>(abs(v)), x);
if((v < 0) && (itrunc(v, pol) & 1))
@@ -325,12 +313,11 @@
inline T cyl_neumann_imp(int v, T x, const bessel_int_tag&, const Policy& pol)
{
BOOST_MATH_STD_USING
- typedef typename bessel_asymptotic_tag<T, Policy>::type tag_type;
BOOST_MATH_INSTRUMENT_VARIABLE(v);
BOOST_MATH_INSTRUMENT_VARIABLE(x);
- if((fabs(x) > asymptotic_bessel_y_limit<T>(tag_type())) && (fabs(x) > 5 * abs(v)))
+ if(asymptotic_bessel_large_x_limit(T(v), x))
{
T r = asymptotic_bessel_y_large_x_2(static_cast<T>(abs(v)), x);
if((v < 0) && (v & 1))
@@ -367,16 +354,188 @@
return result * tx;
}
+template <class T, class Policy>
+inline T cyl_bessel_j_zero_imp(T v, int m, const Policy& pol)
+{
+ BOOST_MATH_STD_USING // ADL of std names, needed for floor.
+
+ static const char* function = "boost::math::cyl_bessel_j_zero<%1%>(%1%, int)";
+
+ const T half_epsilon(boost::math::tools::epsilon<T>() / 2U);
+
+ // Handle non-finite order.
+ if (!(boost::math::isfinite)(v) )
+ {
+ return policies::raise_domain_error<T>(function, "Order argument is %1%, but must be finite >= 0 !", v, pol);
+ }
+
+ // Handle negative rank.
+ if(m < 0)
+ {
+ // Zeros of Jv(x) with negative rank are not defined and requesting one raises a domain error.
+ return policies::raise_domain_error<T>(function, "Requested the %1%'th zero, but the rank must be positive !", m, pol);
+ }
+
+ // Get the absolute value of the order.
+ const bool order_is_negative = (v < 0);
+ const T vv((!order_is_negative) ? v : T(-v));
+
+ // Check if the order is very close to zero or very close to an integer.
+ const bool order_is_zero = (vv < half_epsilon);
+ const bool order_is_integer = ((vv - floor(vv)) < half_epsilon);
+
+ if(m == 0)
+ {
+ if(order_is_zero)
+ {
+ // The zero'th zero of J0(x) is not defined and requesting it raises a domain error.
+ return policies::raise_domain_error<T>(function, "Requested the %1%'th zero of J0, but the rank must be > 0 !", m, pol);
+ }
+
+ // The zero'th zero of Jv(x) for v < 0 is not defined
+ // unless the order is a negative integer.
+ if(order_is_negative && (!order_is_integer))
+ {
+ // For non-integer, negative order, requesting the zero'th zero raises a domain error.
+ return policies::raise_domain_error<T>(function, "Requested the %1%'th zero of Jv for negative, non-integer order, but the rank must be > 0 !", m, pol);
+ }
+
+ // The zero'th zero does exist and its value is zero.
+ return T(0);
+ }
+
+ // Set up the initial guess for the upcoming root-finding.
+ // If the order is a negative integer, then use the corresponding
+ // positive integer for the order.
+ const T guess_root = boost::math::detail::bessel_zero::cyl_bessel_j_zero_detail::initial_guess<T, Policy>((order_is_integer ? vv : v), m, pol);
+
+ // Select the maximum allowed iterations from the policy.
+ boost::uintmax_t number_of_iterations = policies::get_max_root_iterations<Policy>();
+
+ // Select the desired number of binary digits of precision.
+ // Account for the radix of number representations having non-two radix!
+ const int my_digits2 = policies::digits<T, Policy>();
+
+ const T delta_lo = ((guess_root > 0.2F) ? T(0.2) : T(guess_root / 2U));
+
+ // Perform the root-finding using Newton-Raphson iteration from Boost.Math.
+ const T jvm =
+ boost::math::tools::newton_raphson_iterate(
+ boost::math::detail::bessel_zero::cyl_bessel_j_zero_detail::function_object_jv_and_jv_prime<T, Policy>((order_is_integer ? vv : v), order_is_zero, pol),
+ guess_root,
+ T(guess_root - delta_lo),
+ T(guess_root + 0.2F),
+ my_digits2,
+ number_of_iterations);
+
+ if(number_of_iterations >= policies::get_max_root_iterations<Policy>())
+ {
+ policies::raise_evaluation_error<T>(function, "Unable to locate root in a reasonable time:"
+ " Current best guess is %1%", jvm, Policy());
+ }
+
+ return jvm;
+}
+
+template <class T, class Policy>
+inline T cyl_neumann_zero_imp(T v, int m, const Policy& pol)
+{
+ BOOST_MATH_STD_USING // ADL of std names, needed for floor.
+
+ static const char* function = "boost::math::cyl_neumann_zero<%1%>(%1%, int)";
+
+ // Handle non-finite order.
+ if (!(boost::math::isfinite)(v) )
+ {
+ return policies::raise_domain_error<T>(function, "Order argument is %1%, but must be finite >= 0 !", v, pol);
+ }
+
+ // Handle negative rank.
+ if(m < 0)
+ {
+ return policies::raise_domain_error<T>(function, "Requested the %1%'th zero, but the rank must be positive !", m, pol);
+ }
+
+ const T half_epsilon(boost::math::tools::epsilon<T>() / 2U);
+
+ // Get the absolute value of the order.
+ const bool order_is_negative = (v < 0);
+ const T vv((!order_is_negative) ? v : T(-v));
+
+ const bool order_is_integer = ((vv - floor(vv)) < half_epsilon);
+
+ // For negative integers, use reflection to positive integer order.
+ if(order_is_negative && order_is_integer)
+ return boost::math::detail::cyl_neumann_zero_imp(vv, m, pol);
+
+ // Check if the order is very close to a negative half-integer.
+ const T delta_half_integer(vv - (floor(vv) + 0.5F));
+
+ const bool order_is_negative_half_integer =
+ (order_is_negative && ((delta_half_integer > -half_epsilon) && (delta_half_integer < +half_epsilon)));
+
+ // The zero'th zero of Yv(x) for v < 0 is not defined
+ // unless the order is a negative integer.
+ if((m == 0) && (!order_is_negative_half_integer))
+ {
+ // For non-integer, negative order, requesting the zero'th zero raises a domain error.
+ return policies::raise_domain_error<T>(function, "Requested the %1%'th zero of Yv for negative, non-half-integer order, but the rank must be > 0 !", m, pol);
+ }
+
+ // For negative half-integers, use the corresponding
+ // spherical Bessel function of positive half-integer order.
+ if(order_is_negative_half_integer)
+ return boost::math::detail::cyl_bessel_j_zero_imp(vv, m, pol);
+
+ // Set up the initial guess for the upcoming root-finding.
+ // If the order is a negative integer, then use the corresponding
+ // positive integer for the order.
+ const T guess_root = boost::math::detail::bessel_zero::cyl_neumann_zero_detail::initial_guess<T, Policy>(v, m, pol);
+
+ // Select the maximum allowed iterations from the policy.
+ boost::uintmax_t number_of_iterations = policies::get_max_root_iterations<Policy>();
+
+ // Select the desired number of binary digits of precision.
+ // Account for the radix of number representations having non-two radix!
+ const int my_digits2 = policies::digits<T, Policy>();
+
+ const T delta_lo = ((guess_root > 0.2F) ? T(0.2) : T(guess_root / 2U));
+
+ // Perform the root-finding using Newton-Raphson iteration from Boost.Math.
+ const T yvm =
+ boost::math::tools::newton_raphson_iterate(
+ boost::math::detail::bessel_zero::cyl_neumann_zero_detail::function_object_yv_and_yv_prime<T, Policy>(v, pol),
+ guess_root,
+ T(guess_root - delta_lo),
+ T(guess_root + 0.2F),
+ my_digits2,
+ number_of_iterations);
+
+ if(number_of_iterations >= policies::get_max_root_iterations<Policy>())
+ {
+ policies::raise_evaluation_error<T>(function, "Unable to locate root in a reasonable time:"
+ " Current best guess is %1%", yvm, Policy());
+ }
+
+ return yvm;
+}
+
} // namespace detail
template <class T1, class T2, class Policy>
-inline typename detail::bessel_traits<T1, T2, Policy>::result_type cyl_bessel_j(T1 v, T2 x, const Policy& pol)
+inline typename detail::bessel_traits<T1, T2, Policy>::result_type cyl_bessel_j(T1 v, T2 x, const Policy& /* pol */)
{
BOOST_FPU_EXCEPTION_GUARD
typedef typename detail::bessel_traits<T1, T2, Policy>::result_type result_type;
typedef typename detail::bessel_traits<T1, T2, Policy>::optimisation_tag tag_type;
typedef typename policies::evaluation<result_type, Policy>::type value_type;
- return policies::checked_narrowing_cast<result_type, Policy>(detail::cyl_bessel_j_imp<value_type>(v, static_cast<value_type>(x), tag_type(), pol), "boost::math::cyl_bessel_j<%1%>(%1%,%1%)");
+ typedef typename policies::normalise<
+ Policy,
+ policies::promote_float<false>,
+ policies::promote_double<false>,
+ policies::discrete_quantile<>,
+ policies::assert_undefined<> >::type forwarding_policy;
+ return policies::checked_narrowing_cast<result_type, Policy>(detail::cyl_bessel_j_imp<value_type>(v, static_cast<value_type>(x), tag_type(), forwarding_policy()), "boost::math::cyl_bessel_j<%1%>(%1%,%1%)");
}
template <class T1, class T2>
@@ -386,12 +545,18 @@
}
template <class T, class Policy>
-inline typename detail::bessel_traits<T, T, Policy>::result_type sph_bessel(unsigned v, T x, const Policy& pol)
+inline typename detail::bessel_traits<T, T, Policy>::result_type sph_bessel(unsigned v, T x, const Policy& /* pol */)
{
BOOST_FPU_EXCEPTION_GUARD
typedef typename detail::bessel_traits<T, T, Policy>::result_type result_type;
typedef typename policies::evaluation<result_type, Policy>::type value_type;
- return policies::checked_narrowing_cast<result_type, Policy>(detail::sph_bessel_j_imp<value_type>(v, static_cast<value_type>(x), pol), "boost::math::sph_bessel<%1%>(%1%,%1%)");
+ typedef typename policies::normalise<
+ Policy,
+ policies::promote_float<false>,
+ policies::promote_double<false>,
+ policies::discrete_quantile<>,
+ policies::assert_undefined<> >::type forwarding_policy;
+ return policies::checked_narrowing_cast<result_type, Policy>(detail::sph_bessel_j_imp<value_type>(v, static_cast<value_type>(x), forwarding_policy()), "boost::math::sph_bessel<%1%>(%1%,%1%)");
}
template <class T>
@@ -401,12 +566,18 @@
}
template <class T1, class T2, class Policy>
-inline typename detail::bessel_traits<T1, T2, Policy>::result_type cyl_bessel_i(T1 v, T2 x, const Policy& pol)
+inline typename detail::bessel_traits<T1, T2, Policy>::result_type cyl_bessel_i(T1 v, T2 x, const Policy& /* pol */)
{
BOOST_FPU_EXCEPTION_GUARD
typedef typename detail::bessel_traits<T1, T2, Policy>::result_type result_type;
typedef typename policies::evaluation<result_type, Policy>::type value_type;
- return policies::checked_narrowing_cast<result_type, Policy>(detail::cyl_bessel_i_imp<value_type>(v, static_cast<value_type>(x), pol), "boost::math::cyl_bessel_i<%1%>(%1%,%1%)");
+ typedef typename policies::normalise<
+ Policy,
+ policies::promote_float<false>,
+ policies::promote_double<false>,
+ policies::discrete_quantile<>,
+ policies::assert_undefined<> >::type forwarding_policy;
+ return policies::checked_narrowing_cast<result_type, Policy>(detail::cyl_bessel_i_imp<value_type>(v, static_cast<value_type>(x), forwarding_policy()), "boost::math::cyl_bessel_i<%1%>(%1%,%1%)");
}
template <class T1, class T2>
@@ -416,13 +587,19 @@
}
template <class T1, class T2, class Policy>
-inline typename detail::bessel_traits<T1, T2, Policy>::result_type cyl_bessel_k(T1 v, T2 x, const Policy& pol)
+inline typename detail::bessel_traits<T1, T2, Policy>::result_type cyl_bessel_k(T1 v, T2 x, const Policy& /* pol */)
{
BOOST_FPU_EXCEPTION_GUARD
typedef typename detail::bessel_traits<T1, T2, Policy>::result_type result_type;
typedef typename detail::bessel_traits<T1, T2, Policy>::optimisation_tag tag_type;
typedef typename policies::evaluation<result_type, Policy>::type value_type;
- return policies::checked_narrowing_cast<result_type, Policy>(detail::cyl_bessel_k_imp<value_type>(v, static_cast<value_type>(x), tag_type(), pol), "boost::math::cyl_bessel_k<%1%>(%1%,%1%)");
+ typedef typename policies::normalise<
+ Policy,
+ policies::promote_float<false>,
+ policies::promote_double<false>,
+ policies::discrete_quantile<>,
+ policies::assert_undefined<> >::type forwarding_policy;
+ return policies::checked_narrowing_cast<result_type, Policy>(detail::cyl_bessel_k_imp<value_type>(v, static_cast<value_type>(x), tag_type(), forwarding_policy()), "boost::math::cyl_bessel_k<%1%>(%1%,%1%)");
}
template <class T1, class T2>
@@ -432,13 +609,19 @@
}
template <class T1, class T2, class Policy>
-inline typename detail::bessel_traits<T1, T2, Policy>::result_type cyl_neumann(T1 v, T2 x, const Policy& pol)
+inline typename detail::bessel_traits<T1, T2, Policy>::result_type cyl_neumann(T1 v, T2 x, const Policy& /* pol */)
{
BOOST_FPU_EXCEPTION_GUARD
typedef typename detail::bessel_traits<T1, T2, Policy>::result_type result_type;
typedef typename detail::bessel_traits<T1, T2, Policy>::optimisation_tag tag_type;
typedef typename policies::evaluation<result_type, Policy>::type value_type;
- return policies::checked_narrowing_cast<result_type, Policy>(detail::cyl_neumann_imp<value_type>(v, static_cast<value_type>(x), tag_type(), pol), "boost::math::cyl_neumann<%1%>(%1%,%1%)");
+ typedef typename policies::normalise<
+ Policy,
+ policies::promote_float<false>,
+ policies::promote_double<false>,
+ policies::discrete_quantile<>,
+ policies::assert_undefined<> >::type forwarding_policy;
+ return policies::checked_narrowing_cast<result_type, Policy>(detail::cyl_neumann_imp<value_type>(v, static_cast<value_type>(x), tag_type(), forwarding_policy()), "boost::math::cyl_neumann<%1%>(%1%,%1%)");
}
template <class T1, class T2>
@@ -448,12 +631,18 @@
}
template <class T, class Policy>
-inline typename detail::bessel_traits<T, T, Policy>::result_type sph_neumann(unsigned v, T x, const Policy& pol)
+inline typename detail::bessel_traits<T, T, Policy>::result_type sph_neumann(unsigned v, T x, const Policy& /* pol */)
{
BOOST_FPU_EXCEPTION_GUARD
typedef typename detail::bessel_traits<T, T, Policy>::result_type result_type;
typedef typename policies::evaluation<result_type, Policy>::type value_type;
- return policies::checked_narrowing_cast<result_type, Policy>(detail::sph_neumann_imp<value_type>(v, static_cast<value_type>(x), pol), "boost::math::sph_neumann<%1%>(%1%,%1%)");
+ typedef typename policies::normalise<
+ Policy,
+ policies::promote_float<false>,
+ policies::promote_double<false>,
+ policies::discrete_quantile<>,
+ policies::assert_undefined<> >::type forwarding_policy;
+ return policies::checked_narrowing_cast<result_type, Policy>(detail::sph_neumann_imp<value_type>(v, static_cast<value_type>(x), forwarding_policy()), "boost::math::sph_neumann<%1%>(%1%,%1%)");
}
template <class T>
@@ -462,6 +651,102 @@
return sph_neumann(v, x, policies::policy<>());
}
+template <class T, class Policy>
+inline typename detail::bessel_traits<T, T, Policy>::result_type cyl_bessel_j_zero(T v, int m, const Policy& /* pol */)
+{
+ BOOST_FPU_EXCEPTION_GUARD
+ typedef typename detail::bessel_traits<T, T, Policy>::result_type result_type;
+ typedef typename policies::evaluation<result_type, Policy>::type value_type;
+ typedef typename policies::normalise<
+ Policy,
+ policies::promote_float<false>,
+ policies::promote_double<false>,
+ policies::discrete_quantile<>,
+ policies::assert_undefined<> >::type forwarding_policy;
+ BOOST_STATIC_ASSERT_MSG(false == std::numeric_limits<value_type>::is_integer, "Order must be a floating-point type.");
+ return policies::checked_narrowing_cast<result_type, Policy>(detail::cyl_bessel_j_zero_imp<value_type>(v, m, forwarding_policy()), "boost::math::cyl_bessel_j_zero<%1%>(%1%,%1%)");
+}
+
+template <class T>
+inline typename detail::bessel_traits<T, T, policies::policy<> >::result_type cyl_bessel_j_zero(T v, int m)
+{
+ BOOST_STATIC_ASSERT_MSG(false == std::numeric_limits<T>::is_integer, "Order must be a floating-point type.");
+ return cyl_bessel_j_zero<T, policies::policy<> >(v, m, policies::policy<>());
+}
+
+template <class T, class OutputIterator, class Policy>
+inline OutputIterator cyl_bessel_j_zero(T v,
+ int start_index,
+ unsigned number_of_zeros,
+ OutputIterator out_it,
+ const Policy& pol)
+{
+ BOOST_STATIC_ASSERT_MSG(false == std::numeric_limits<T>::is_integer, "Order must be a floating-point type.");
+ for(unsigned i = 0; i < number_of_zeros; ++i)
+ {
+ *out_it = boost::math::cyl_bessel_j_zero(v, start_index + i, pol);
+ ++out_it;
+ }
+ return out_it;
+}
+
+template <class T, class OutputIterator>
+inline OutputIterator cyl_bessel_j_zero(T v,
+ int start_index,
+ unsigned number_of_zeros,
+ OutputIterator out_it)
+{
+ return cyl_bessel_j_zero(v, start_index, number_of_zeros, out_it, policies::policy<>());
+}
+
+template <class T, class Policy>
+inline typename detail::bessel_traits<T, T, Policy>::result_type cyl_neumann_zero(T v, int m, const Policy& /* pol */)
+{
+ BOOST_FPU_EXCEPTION_GUARD
+ typedef typename detail::bessel_traits<T, T, Policy>::result_type result_type;
+ typedef typename policies::evaluation<result_type, Policy>::type value_type;
+ typedef typename policies::normalise<
+ Policy,
+ policies::promote_float<false>,
+ policies::promote_double<false>,
+ policies::discrete_quantile<>,
+ policies::assert_undefined<> >::type forwarding_policy;
+ BOOST_STATIC_ASSERT_MSG(false == std::numeric_limits<value_type>::is_integer, "Order must be a floating-point type.");
+ return policies::checked_narrowing_cast<result_type, Policy>(detail::cyl_neumann_zero_imp<value_type>(v, m, forwarding_policy()), "boost::math::cyl_neumann_zero<%1%>(%1%,%1%)");
+}
+
+template <class T>
+inline typename detail::bessel_traits<T, T, policies::policy<> >::result_type cyl_neumann_zero(T v, int m)
+{
+ BOOST_STATIC_ASSERT_MSG(false == std::numeric_limits<T>::is_integer, "Order must be a floating-point type.");
+ return cyl_neumann_zero<T, policies::policy<> >(v, m, policies::policy<>());
+}
+
+template <class T, class OutputIterator, class Policy>
+inline OutputIterator cyl_neumann_zero(T v,
+ int start_index,
+ unsigned number_of_zeros,
+ OutputIterator out_it,
+ const Policy& pol)
+{
+ BOOST_STATIC_ASSERT_MSG(false == std::numeric_limits<T>::is_integer, "Order must be a floating-point type.");
+ for(unsigned i = 0; i < number_of_zeros; ++i)
+ {
+ *out_it = boost::math::cyl_neumann_zero(v, start_index + i, pol);
+ ++out_it;
+ }
+ return out_it;
+}
+
+template <class T, class OutputIterator>
+inline OutputIterator cyl_neumann_zero(T v,
+ int start_index,
+ unsigned number_of_zeros,
+ OutputIterator out_it)
+{
+ return cyl_neumann_zero(v, start_index, number_of_zeros, out_it, policies::policy<>());
+}
+
} // namespace math
} // namespace boost
Modified: branches/release/boost/math/special_functions/detail/bessel_j0.hpp
==============================================================================
--- branches/release/boost/math/special_functions/detail/bessel_j0.hpp (original)
+++ branches/release/boost/math/special_functions/detail/bessel_j0.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -169,7 +169,7 @@
BOOST_ASSERT(sizeof(PS) == sizeof(QS));
rc = evaluate_rational(PC, QC, y2);
rs = evaluate_rational(PS, QS, y2);
- factor = sqrt(2 / (x * pi<T>()));
+ factor = constants::one_div_root_pi<T>() / sqrt(x);
//
// What follows is really just:
//
@@ -181,8 +181,7 @@
//
T sx = sin(x);
T cx = cos(x);
- value = factor * (rc * (cx * constants::one_div_root_two<T>() + sx * constants::half_root_two<T>())
- - y * rs * (sx * constants::one_div_root_two<T>() - cx * constants::half_root_two<T>()));
+ value = factor * (rc * (cx + sx) - y * rs * (sx - cx));
}
return value;
Modified: branches/release/boost/math/special_functions/detail/bessel_j1.hpp
==============================================================================
--- branches/release/boost/math/special_functions/detail/bessel_j1.hpp (original)
+++ branches/release/boost/math/special_functions/detail/bessel_j1.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -170,7 +170,7 @@
BOOST_ASSERT(sizeof(PS) == sizeof(QS));
rc = evaluate_rational(PC, QC, y2);
rs = evaluate_rational(PS, QS, y2);
- factor = sqrt(2 / (w * pi<T>()));
+ factor = 1 / (sqrt(w) * constants::root_pi<T>());
//
// What follows is really just:
//
@@ -178,12 +178,12 @@
// value = factor * (rc * cos(z) - y * rs * sin(z));
//
// but using the sin/cos addition rules plus constants
- // for the values of sin/cos of 3PI/4.
+ // for the values of sin/cos of 3PI/4 which then cancel
+ // out with corresponding terms in "factor".
//
T sx = sin(x);
T cx = cos(x);
- value = factor * (rc * (cx * -constants::one_div_root_two<T>() + sx * constants::half_root_two<T>())
- - y * rs * (sx * -constants::one_div_root_two<T>() - cx * constants::half_root_two<T>()));
+ value = factor * (rc * (sx - cx) + y * rs * (sx + cx));
}
if (x < 0)
Modified: branches/release/boost/math/special_functions/detail/bessel_jn.hpp
==============================================================================
--- branches/release/boost/math/special_functions/detail/bessel_jn.hpp (original)
+++ branches/release/boost/math/special_functions/detail/bessel_jn.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -64,8 +64,7 @@
return static_cast<T>(0);
}
- typedef typename bessel_asymptotic_tag<T, Policy>::type tag_type;
- if(fabs(x) > asymptotic_bessel_j_limit<T>(n, tag_type()))
+ if(asymptotic_bessel_large_x_limit(T(n), x))
return factor * asymptotic_bessel_j_large_x_2<T>(n, x);
BOOST_ASSERT(n > 1);
@@ -74,6 +73,7 @@
{
prev = bessel_j0(x);
current = bessel_j1(x);
+ policies::check_series_iterations<T>("boost::math::bessel_j_n<%1%>(%1%,%1%)", n, pol);
for (int k = 1; k < n; k++)
{
T fact = 2 * k / x;
@@ -91,7 +91,7 @@
current = value;
}
}
- else if(x < 1)
+ else if((x < 1) || (n > x * x / 4) || (x < 5))
{
return factor * bessel_j_small_z_series(T(n), x, pol);
}
@@ -102,6 +102,8 @@
boost::math::detail::CF1_jy(static_cast<T>(n), x, &fn, &s, pol);
prev = fn;
current = 1;
+ // Check recursion won't go on too far:
+ policies::check_series_iterations<T>("boost::math::bessel_j_n<%1%>(%1%,%1%)", n, pol);
for (int k = n; k > 0; k--)
{
T fact = 2 * k / x;
Modified: branches/release/boost/math/special_functions/detail/bessel_jy.hpp
==============================================================================
--- branches/release/boost/math/special_functions/detail/bessel_jy.hpp (original)
+++ branches/release/boost/math/special_functions/detail/bessel_jy.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -28,438 +28,460 @@
namespace boost { namespace math {
-namespace detail {
+ namespace detail {
-//
-// Simultaneous calculation of A&S 9.2.9 and 9.2.10
-// for use in A&S 9.2.5 and 9.2.6.
-// This series is quick to evaluate, but divergent unless
-// x is very large, in fact it's pretty hard to figure out
-// with any degree of precision when this series actually
-// *will* converge!! Consequently, we may just have to
-// try it and see...
-//
-template <class T, class Policy>
-bool hankel_PQ(T v, T x, T* p, T* q, const Policy& )
-{
- BOOST_MATH_STD_USING
- T tolerance = 2 * policies::get_epsilon<T, Policy>();
- *p = 1;
- *q = 0;
- T k = 1;
- T z8 = 8 * x;
- T sq = 1;
- T mu = 4 * v * v;
- T term = 1;
- bool ok = true;
- do
- {
- term *= (mu - sq * sq) / (k * z8);
- *q += term;
- k += 1;
- sq += 2;
- T mult = (sq * sq - mu) / (k * z8);
- ok = fabs(mult) < 0.5f;
- term *= mult;
- *p += term;
- k += 1;
- sq += 2;
- }
- while((fabs(term) > tolerance * *p) && ok);
- return ok;
-}
-
-// Calculate Y(v, x) and Y(v+1, x) by Temme's method, see
-// Temme, Journal of Computational Physics, vol 21, 343 (1976)
-template <typename T, typename Policy>
-int temme_jy(T v, T x, T* Y, T* Y1, const Policy& pol)
-{
- T g, h, p, q, f, coef, sum, sum1, tolerance;
- T a, d, e, sigma;
- unsigned long k;
-
- BOOST_MATH_STD_USING
- using namespace boost::math::tools;
- using namespace boost::math::constants;
-
- BOOST_ASSERT(fabs(v) <= 0.5f); // precondition for using this routine
-
- T gp = boost::math::tgamma1pm1(v, pol);
- T gm = boost::math::tgamma1pm1(-v, pol);
- T spv = boost::math::sin_pi(v, pol);
- T spv2 = boost::math::sin_pi(v/2, pol);
- T xp = pow(x/2, v);
-
- a = log(x / 2);
- sigma = -a * v;
- d = abs(sigma) < tools::epsilon<T>() ?
- T(1) : sinh(sigma) / sigma;
- e = abs(v) < tools::epsilon<T>() ? T(v*pi<T>()*pi<T>() / 2)
- : T(2 * spv2 * spv2 / v);
-
- T g1 = (v == 0) ? T(-euler<T>()) : T((gp - gm) / ((1 + gp) * (1 + gm) * 2 * v));
- T g2 = (2 + gp + gm) / ((1 + gp) * (1 + gm) * 2);
- T vspv = (fabs(v) < tools::epsilon<T>()) ? T(1/constants::pi<T>()) : T(v / spv);
- f = (g1 * cosh(sigma) - g2 * a * d) * 2 * vspv;
-
- p = vspv / (xp * (1 + gm));
- q = vspv * xp / (1 + gp);
-
- g = f + e * q;
- h = p;
- coef = 1;
- sum = coef * g;
- sum1 = coef * h;
-
- T v2 = v * v;
- T coef_mult = -x * x / 4;
-
- // series summation
- tolerance = policies::get_epsilon<T, Policy>();
- for (k = 1; k < policies::get_max_series_iterations<Policy>(); k++)
- {
- f = (k * f + p + q) / (k*k - v2);
- p /= k - v;
- q /= k + v;
- g = f + e * q;
- h = p - k * g;
- coef *= coef_mult / k;
- sum += coef * g;
- sum1 += coef * h;
- if (abs(coef * g) < abs(sum) * tolerance)
- {
- break;
- }
- }
- policies::check_series_iterations<T>("boost::math::bessel_jy<%1%>(%1%,%1%) in temme_jy", k, pol);
- *Y = -sum;
- *Y1 = -2 * sum1 / x;
-
- return 0;
-}
-
-// Evaluate continued fraction fv = J_(v+1) / J_v, see
-// Abramowitz and Stegun, Handbook of Mathematical Functions, 1972, 9.1.73
-template <typename T, typename Policy>
-int CF1_jy(T v, T x, T* fv, int* sign, const Policy& pol)
-{
- T C, D, f, a, b, delta, tiny, tolerance;
- unsigned long k;
- int s = 1;
-
- BOOST_MATH_STD_USING
-
- // |x| <= |v|, CF1_jy converges rapidly
- // |x| > |v|, CF1_jy needs O(|x|) iterations to converge
-
- // modified Lentz's method, see
- // Lentz, Applied Optics, vol 15, 668 (1976)
- tolerance = 2 * policies::get_epsilon<T, Policy>();;
- tiny = sqrt(tools::min_value<T>());
- C = f = tiny; // b0 = 0, replace with tiny
- D = 0;
- for (k = 1; k < policies::get_max_series_iterations<Policy>() * 100; k++)
- {
- a = -1;
- b = 2 * (v + k) / x;
- C = b + a / C;
- D = b + a * D;
- if (C == 0) { C = tiny; }
- if (D == 0) { D = tiny; }
- D = 1 / D;
- delta = C * D;
- f *= delta;
- if (D < 0) { s = -s; }
- if (abs(delta - 1) < tolerance)
- { break; }
- }
- policies::check_series_iterations<T>("boost::math::bessel_jy<%1%>(%1%,%1%) in CF1_jy", k / 100, pol);
- *fv = -f;
- *sign = s; // sign of denominator
-
- return 0;
-}
-//
-// This algorithm was originally written by Xiaogang Zhang
-// using std::complex to perform the complex arithmetic.
-// However, that turns out to 10x or more slower than using
-// all real-valued arithmetic, so it's been rewritten using
-// real values only.
-//
-template <typename T, typename Policy>
-int CF2_jy(T v, T x, T* p, T* q, const Policy& pol)
-{
- BOOST_MATH_STD_USING
-
- T Cr, Ci, Dr, Di, fr, fi, a, br, bi, delta_r, delta_i, temp;
- T tiny;
- unsigned long k;
-
- // |x| >= |v|, CF2_jy converges rapidly
- // |x| -> 0, CF2_jy fails to converge
- BOOST_ASSERT(fabs(x) > 1);
-
- // modified Lentz's method, complex numbers involved, see
- // Lentz, Applied Optics, vol 15, 668 (1976)
- T tolerance = 2 * policies::get_epsilon<T, Policy>();
- tiny = sqrt(tools::min_value<T>());
- Cr = fr = -0.5f / x;
- Ci = fi = 1;
- //Dr = Di = 0;
- T v2 = v * v;
- a = (0.25f - v2) / x; // Note complex this one time only!
- br = 2 * x;
- bi = 2;
- temp = Cr * Cr + 1;
- Ci = bi + a * Cr / temp;
- Cr = br + a / temp;
- Dr = br;
- Di = bi;
- if (fabs(Cr) + fabs(Ci) < tiny) { Cr = tiny; }
- if (fabs(Dr) + fabs(Di) < tiny) { Dr = tiny; }
- temp = Dr * Dr + Di * Di;
- Dr = Dr / temp;
- Di = -Di / temp;
- delta_r = Cr * Dr - Ci * Di;
- delta_i = Ci * Dr + Cr * Di;
- temp = fr;
- fr = temp * delta_r - fi * delta_i;
- fi = temp * delta_i + fi * delta_r;
- for (k = 2; k < policies::get_max_series_iterations<Policy>(); k++)
- {
- a = k - 0.5f;
- a *= a;
- a -= v2;
- bi += 2;
- temp = Cr * Cr + Ci * Ci;
- Cr = br + a * Cr / temp;
- Ci = bi - a * Ci / temp;
- Dr = br + a * Dr;
- Di = bi + a * Di;
- if (fabs(Cr) + fabs(Ci) < tiny) { Cr = tiny; }
- if (fabs(Dr) + fabs(Di) < tiny) { Dr = tiny; }
- temp = Dr * Dr + Di * Di;
- Dr = Dr / temp;
- Di = -Di / temp;
- delta_r = Cr * Dr - Ci * Di;
- delta_i = Ci * Dr + Cr * Di;
- temp = fr;
- fr = temp * delta_r - fi * delta_i;
- fi = temp * delta_i + fi * delta_r;
- if (fabs(delta_r - 1) + fabs(delta_i) < tolerance)
- break;
- }
- policies::check_series_iterations<T>("boost::math::bessel_jy<%1%>(%1%,%1%) in CF2_jy", k, pol);
- *p = fr;
- *q = fi;
-
- return 0;
-}
-
-static const int need_j = 1;
-static const int need_y = 2;
-
-// Compute J(v, x) and Y(v, x) simultaneously by Steed's method, see
-// Barnett et al, Computer Physics Communications, vol 8, 377 (1974)
-template <typename T, typename Policy>
-int bessel_jy(T v, T x, T* J, T* Y, int kind, const Policy& pol)
-{
- BOOST_ASSERT(x >= 0);
-
- T u, Jv, Ju, Yv, Yv1, Yu, Yu1(0), fv, fu;
- T W, p, q, gamma, current, prev, next;
- bool reflect = false;
- unsigned n, k;
- int s;
- int org_kind = kind;
- T cp = 0;
- T sp = 0;
-
- static const char* function = "boost::math::bessel_jy<%1%>(%1%,%1%)";
-
- BOOST_MATH_STD_USING
- using namespace boost::math::tools;
- using namespace boost::math::constants;
-
- if (v < 0)
- {
- reflect = true;
- v = -v; // v is non-negative from here
- kind = need_j|need_y; // need both for reflection formula
- }
- n = iround(v, pol);
- u = v - n; // -1/2 <= u < 1/2
-
- if(reflect)
- {
- T z = (u + n % 2);
- cp = boost::math::cos_pi(z, pol);
- sp = boost::math::sin_pi(z, pol);
- }
-
- if (x == 0)
- {
- *J = *Y = policies::raise_overflow_error<T>(
- function, 0, pol);
- return 1;
- }
-
- // x is positive until reflection
- W = T(2) / (x * pi<T>()); // Wronskian
- T Yv_scale = 1;
- if((x > 8) && (x < 1000) && hankel_PQ(v, x, &p, &q, pol))
- {
- //
- // Hankel approximation: note that this method works best when x
- // is large, but in that case we end up calculating sines and cosines
- // of large values, with horrendous resulting accuracy. It is fast though
- // when it works....
- //
- T chi = x - fmod(T(v / 2 + 0.25f), T(2)) * boost::math::constants::pi<T>();
- T sc = sin(chi);
- T cc = cos(chi);
- chi = sqrt(2 / (boost::math::constants::pi<T>() * x));
- Yv = chi * (p * sc + q * cc);
- Jv = chi * (p * cc - q * sc);
- }
- else if((x < 1) && (u != 0) && (log(policies::get_epsilon<T, Policy>() / 2) > v * log((x/2) * (x/2) / v)))
- {
- // Evaluate using series representations.
- // This is particularly important for x << v as in this
- // area temme_jy may be slow to converge, if it converges at all.
- // Requires x is not an integer.
- if(kind&need_j)
- Jv = bessel_j_small_z_series(v, x, pol);
- else
- Jv = std::numeric_limits<T>::quiet_NaN();
- if((org_kind&need_y && (!reflect || (cp != 0)))
- || (org_kind & need_j && (reflect && (sp != 0))))
- {
- // Only calculate if we need it, and if the reflection formula will actually use it:
- Yv = bessel_y_small_z_series(v, x, &Yv_scale, pol);
- }
- else
- Yv = std::numeric_limits<T>::quiet_NaN();
- }
- else if((u == 0) && (x < policies::get_epsilon<T, Policy>()))
- {
- // Truncated series evaluation for small x and v an integer,
- // much quicker in this area than temme_jy below.
- if(kind&need_j)
- Jv = bessel_j_small_z_series(v, x, pol);
- else
- Jv = std::numeric_limits<T>::quiet_NaN();
- if((org_kind&need_y && (!reflect || (cp != 0)))
- || (org_kind & need_j && (reflect && (sp != 0))))
- {
- // Only calculate if we need it, and if the reflection formula will actually use it:
- Yv = bessel_yn_small_z(n, x, &Yv_scale, pol);
- }
- else
- Yv = std::numeric_limits<T>::quiet_NaN();
- }
- else if (x <= 2) // x in (0, 2]
- {
- if(temme_jy(u, x, &Yu, &Yu1, pol)) // Temme series
- {
- // domain error:
- *J = *Y = Yu;
- return 1;
- }
- prev = Yu;
- current = Yu1;
- T scale = 1;
- for (k = 1; k <= n; k++) // forward recurrence for Y
- {
- T fact = 2 * (u + k) / x;
- if((tools::max_value<T>() - fabs(prev)) / fact < fabs(current))
- {
- scale /= current;
- prev /= current;
- current = 1;
- }
- next = fact * current - prev;
- prev = current;
- current = next;
- }
- Yv = prev;
- Yv1 = current;
- if(kind&need_j)
+ //
+ // Simultaneous calculation of A&S 9.2.9 and 9.2.10
+ // for use in A&S 9.2.5 and 9.2.6.
+ // This series is quick to evaluate, but divergent unless
+ // x is very large, in fact it's pretty hard to figure out
+ // with any degree of precision when this series actually
+ // *will* converge!! Consequently, we may just have to
+ // try it and see...
+ //
+ template <class T, class Policy>
+ bool hankel_PQ(T v, T x, T* p, T* q, const Policy& )
+ {
+ BOOST_MATH_STD_USING
+ T tolerance = 2 * policies::get_epsilon<T, Policy>();
+ *p = 1;
+ *q = 0;
+ T k = 1;
+ T z8 = 8 * x;
+ T sq = 1;
+ T mu = 4 * v * v;
+ T term = 1;
+ bool ok = true;
+ do
{
- CF1_jy(v, x, &fv, &s, pol); // continued fraction CF1_jy
- Jv = scale * W / (Yv * fv - Yv1); // Wronskian relation
+ term *= (mu - sq * sq) / (k * z8);
+ *q += term;
+ k += 1;
+ sq += 2;
+ T mult = (sq * sq - mu) / (k * z8);
+ ok = fabs(mult) < 0.5f;
+ term *= mult;
+ *p += term;
+ k += 1;
+ sq += 2;
}
- else
- Jv = std::numeric_limits<T>::quiet_NaN(); // any value will do, we're not using it.
- Yv_scale = scale;
- }
- else // x in (2, \infty)
- {
- // Get Y(u, x):
- // define tag type that will dispatch to right limits:
- typedef typename bessel_asymptotic_tag<T, Policy>::type tag_type;
-
- T lim, ratio;
- switch(kind)
- {
- case need_j:
- lim = asymptotic_bessel_j_limit<T>(v, tag_type());
- break;
- case need_y:
- lim = asymptotic_bessel_y_limit<T>(tag_type());
- break;
- default:
- lim = (std::max)(
- asymptotic_bessel_j_limit<T>(v, tag_type()),
- asymptotic_bessel_y_limit<T>(tag_type()));
- break;
- }
- if(x > lim)
- {
- if(kind&need_y)
- {
- Yu = asymptotic_bessel_y_large_x_2(u, x);
- Yu1 = asymptotic_bessel_y_large_x_2(T(u + 1), x);
- }
- else
- Yu = std::numeric_limits<T>::quiet_NaN(); // any value will do, we're not using it.
- if(kind&need_j)
- {
- Jv = asymptotic_bessel_j_large_x_2(v, x);
- }
- else
- Jv = std::numeric_limits<T>::quiet_NaN(); // any value will do, we're not using it.
- }
- else
- {
- CF1_jy(v, x, &fv, &s, pol);
- // tiny initial value to prevent overflow
- T init = sqrt(tools::min_value<T>());
- prev = fv * s * init;
- current = s * init;
- if(v < max_factorial<T>::value)
- {
- for (k = n; k > 0; k--) // backward recurrence for J
- {
+ while((fabs(term) > tolerance * *p) && ok);
+ return ok;
+ }
+
+ // Calculate Y(v, x) and Y(v+1, x) by Temme's method, see
+ // Temme, Journal of Computational Physics, vol 21, 343 (1976)
+ template <typename T, typename Policy>
+ int temme_jy(T v, T x, T* Y, T* Y1, const Policy& pol)
+ {
+ T g, h, p, q, f, coef, sum, sum1, tolerance;
+ T a, d, e, sigma;
+ unsigned long k;
+
+ BOOST_MATH_STD_USING
+ using namespace boost::math::tools;
+ using namespace boost::math::constants;
+
+ BOOST_ASSERT(fabs(v) <= 0.5f); // precondition for using this routine
+
+ T gp = boost::math::tgamma1pm1(v, pol);
+ T gm = boost::math::tgamma1pm1(-v, pol);
+ T spv = boost::math::sin_pi(v, pol);
+ T spv2 = boost::math::sin_pi(v/2, pol);
+ T xp = pow(x/2, v);
+
+ a = log(x / 2);
+ sigma = -a * v;
+ d = abs(sigma) < tools::epsilon<T>() ?
+ T(1) : sinh(sigma) / sigma;
+ e = abs(v) < tools::epsilon<T>() ? T(v*pi<T>()*pi<T>() / 2)
+ : T(2 * spv2 * spv2 / v);
+
+ T g1 = (v == 0) ? T(-euler<T>()) : T((gp - gm) / ((1 + gp) * (1 + gm) * 2 * v));
+ T g2 = (2 + gp + gm) / ((1 + gp) * (1 + gm) * 2);
+ T vspv = (fabs(v) < tools::epsilon<T>()) ? T(1/constants::pi<T>()) : T(v / spv);
+ f = (g1 * cosh(sigma) - g2 * a * d) * 2 * vspv;
+
+ p = vspv / (xp * (1 + gm));
+ q = vspv * xp / (1 + gp);
+
+ g = f + e * q;
+ h = p;
+ coef = 1;
+ sum = coef * g;
+ sum1 = coef * h;
+
+ T v2 = v * v;
+ T coef_mult = -x * x / 4;
+
+ // series summation
+ tolerance = policies::get_epsilon<T, Policy>();
+ for (k = 1; k < policies::get_max_series_iterations<Policy>(); k++)
+ {
+ f = (k * f + p + q) / (k*k - v2);
+ p /= k - v;
+ q /= k + v;
+ g = f + e * q;
+ h = p - k * g;
+ coef *= coef_mult / k;
+ sum += coef * g;
+ sum1 += coef * h;
+ if (abs(coef * g) < abs(sum) * tolerance)
+ {
+ break;
+ }
+ }
+ policies::check_series_iterations<T>("boost::math::bessel_jy<%1%>(%1%,%1%) in temme_jy", k, pol);
+ *Y = -sum;
+ *Y1 = -2 * sum1 / x;
+
+ return 0;
+ }
+
+ // Evaluate continued fraction fv = J_(v+1) / J_v, see
+ // Abramowitz and Stegun, Handbook of Mathematical Functions, 1972, 9.1.73
+ template <typename T, typename Policy>
+ int CF1_jy(T v, T x, T* fv, int* sign, const Policy& pol)
+ {
+ T C, D, f, a, b, delta, tiny, tolerance;
+ unsigned long k;
+ int s = 1;
+
+ BOOST_MATH_STD_USING
+
+ // |x| <= |v|, CF1_jy converges rapidly
+ // |x| > |v|, CF1_jy needs O(|x|) iterations to converge
+
+ // modified Lentz's method, see
+ // Lentz, Applied Optics, vol 15, 668 (1976)
+ tolerance = 2 * policies::get_epsilon<T, Policy>();;
+ tiny = sqrt(tools::min_value<T>());
+ C = f = tiny; // b0 = 0, replace with tiny
+ D = 0;
+ for (k = 1; k < policies::get_max_series_iterations<Policy>() * 100; k++)
+ {
+ a = -1;
+ b = 2 * (v + k) / x;
+ C = b + a / C;
+ D = b + a * D;
+ if (C == 0) { C = tiny; }
+ if (D == 0) { D = tiny; }
+ D = 1 / D;
+ delta = C * D;
+ f *= delta;
+ if (D < 0) { s = -s; }
+ if (abs(delta - 1) < tolerance)
+ { break; }
+ }
+ policies::check_series_iterations<T>("boost::math::bessel_jy<%1%>(%1%,%1%) in CF1_jy", k / 100, pol);
+ *fv = -f;
+ *sign = s; // sign of denominator
+
+ return 0;
+ }
+ //
+ // This algorithm was originally written by Xiaogang Zhang
+ // using std::complex to perform the complex arithmetic.
+ // However, that turns out to 10x or more slower than using
+ // all real-valued arithmetic, so it's been rewritten using
+ // real values only.
+ //
+ template <typename T, typename Policy>
+ int CF2_jy(T v, T x, T* p, T* q, const Policy& pol)
+ {
+ BOOST_MATH_STD_USING
+
+ T Cr, Ci, Dr, Di, fr, fi, a, br, bi, delta_r, delta_i, temp;
+ T tiny;
+ unsigned long k;
+
+ // |x| >= |v|, CF2_jy converges rapidly
+ // |x| -> 0, CF2_jy fails to converge
+ BOOST_ASSERT(fabs(x) > 1);
+
+ // modified Lentz's method, complex numbers involved, see
+ // Lentz, Applied Optics, vol 15, 668 (1976)
+ T tolerance = 2 * policies::get_epsilon<T, Policy>();
+ tiny = sqrt(tools::min_value<T>());
+ Cr = fr = -0.5f / x;
+ Ci = fi = 1;
+ //Dr = Di = 0;
+ T v2 = v * v;
+ a = (0.25f - v2) / x; // Note complex this one time only!
+ br = 2 * x;
+ bi = 2;
+ temp = Cr * Cr + 1;
+ Ci = bi + a * Cr / temp;
+ Cr = br + a / temp;
+ Dr = br;
+ Di = bi;
+ if (fabs(Cr) + fabs(Ci) < tiny) { Cr = tiny; }
+ if (fabs(Dr) + fabs(Di) < tiny) { Dr = tiny; }
+ temp = Dr * Dr + Di * Di;
+ Dr = Dr / temp;
+ Di = -Di / temp;
+ delta_r = Cr * Dr - Ci * Di;
+ delta_i = Ci * Dr + Cr * Di;
+ temp = fr;
+ fr = temp * delta_r - fi * delta_i;
+ fi = temp * delta_i + fi * delta_r;
+ for (k = 2; k < policies::get_max_series_iterations<Policy>(); k++)
+ {
+ a = k - 0.5f;
+ a *= a;
+ a -= v2;
+ bi += 2;
+ temp = Cr * Cr + Ci * Ci;
+ Cr = br + a * Cr / temp;
+ Ci = bi - a * Ci / temp;
+ Dr = br + a * Dr;
+ Di = bi + a * Di;
+ if (fabs(Cr) + fabs(Ci) < tiny) { Cr = tiny; }
+ if (fabs(Dr) + fabs(Di) < tiny) { Dr = tiny; }
+ temp = Dr * Dr + Di * Di;
+ Dr = Dr / temp;
+ Di = -Di / temp;
+ delta_r = Cr * Dr - Ci * Di;
+ delta_i = Ci * Dr + Cr * Di;
+ temp = fr;
+ fr = temp * delta_r - fi * delta_i;
+ fi = temp * delta_i + fi * delta_r;
+ if (fabs(delta_r - 1) + fabs(delta_i) < tolerance)
+ break;
+ }
+ policies::check_series_iterations<T>("boost::math::bessel_jy<%1%>(%1%,%1%) in CF2_jy", k, pol);
+ *p = fr;
+ *q = fi;
+
+ return 0;
+ }
+
+ static const int need_j = 1;
+ static const int need_y = 2;
+
+ // Compute J(v, x) and Y(v, x) simultaneously by Steed's method, see
+ // Barnett et al, Computer Physics Communications, vol 8, 377 (1974)
+ template <typename T, typename Policy>
+ int bessel_jy(T v, T x, T* J, T* Y, int kind, const Policy& pol)
+ {
+ BOOST_ASSERT(x >= 0);
+
+ T u, Jv, Ju, Yv, Yv1, Yu, Yu1(0), fv, fu;
+ T W, p, q, gamma, current, prev, next;
+ bool reflect = false;
+ unsigned n, k;
+ int s;
+ int org_kind = kind;
+ T cp = 0;
+ T sp = 0;
+
+ static const char* function = "boost::math::bessel_jy<%1%>(%1%,%1%)";
+
+ BOOST_MATH_STD_USING
+ using namespace boost::math::tools;
+ using namespace boost::math::constants;
+
+ if (v < 0)
+ {
+ reflect = true;
+ v = -v; // v is non-negative from here
+ }
+ if(v > static_cast<T>((std::numeric_limits<int>::max)()))
+ policies::raise_evaluation_error<T>(function, "Order of Bessel function is too large to evaluate: got %1%", v, pol);
+ n = iround(v, pol);
+ u = v - n; // -1/2 <= u < 1/2
+
+ if(reflect)
+ {
+ T z = (u + n % 2);
+ cp = boost::math::cos_pi(z, pol);
+ sp = boost::math::sin_pi(z, pol);
+ if(u != 0)
+ kind = need_j|need_y; // need both for reflection formula
+ }
+
+ if(x == 0)
+ {
+ if(v == 0)
+ *J = 1;
+ else if((u == 0) || !reflect)
+ *J = 0;
+ else if(kind & need_j)
+ *J = policies::raise_domain_error<T>(function, "Value of Bessel J_v(x) is complex-infinity at %1%", x, pol); // complex infinity
+ else
+ *J = std::numeric_limits<T>::quiet_NaN(); // any value will do, not using J.
+
+ if((kind & need_y) == 0)
+ *Y = std::numeric_limits<T>::quiet_NaN(); // any value will do, not using Y.
+ else if(v == 0)
+ *Y = -policies::raise_overflow_error<T>(function, 0, pol);
+ else
+ *Y = policies::raise_domain_error<T>(function, "Value of Bessel Y_v(x) is complex-infinity at %1%", x, pol); // complex infinity
+ return 1;
+ }
+
+ // x is positive until reflection
+ W = T(2) / (x * pi<T>()); // Wronskian
+ T Yv_scale = 1;
+ if(((kind & need_y) == 0) && ((x < 1) || (v > x * x / 4) || (x < 5)))
+ {
+ //
+ // This series will actually converge rapidly for all small
+ // x - say up to x < 20 - but the first few terms are large
+ // and divergent which leads to large errors :-(
+ //
+ Jv = bessel_j_small_z_series(v, x, pol);
+ Yv = std::numeric_limits<T>::quiet_NaN();
+ }
+ else if((x < 1) && (u != 0) && (log(policies::get_epsilon<T, Policy>() / 2) > v * log((x/2) * (x/2) / v)))
+ {
+ // Evaluate using series representations.
+ // This is particularly important for x << v as in this
+ // area temme_jy may be slow to converge, if it converges at all.
+ // Requires x is not an integer.
+ if(kind&need_j)
+ Jv = bessel_j_small_z_series(v, x, pol);
+ else
+ Jv = std::numeric_limits<T>::quiet_NaN();
+ if((org_kind&need_y && (!reflect || (cp != 0)))
+ || (org_kind & need_j && (reflect && (sp != 0))))
+ {
+ // Only calculate if we need it, and if the reflection formula will actually use it:
+ Yv = bessel_y_small_z_series(v, x, &Yv_scale, pol);
+ }
+ else
+ Yv = std::numeric_limits<T>::quiet_NaN();
+ }
+ else if((u == 0) && (x < policies::get_epsilon<T, Policy>()))
+ {
+ // Truncated series evaluation for small x and v an integer,
+ // much quicker in this area than temme_jy below.
+ if(kind&need_j)
+ Jv = bessel_j_small_z_series(v, x, pol);
+ else
+ Jv = std::numeric_limits<T>::quiet_NaN();
+ if((org_kind&need_y && (!reflect || (cp != 0)))
+ || (org_kind & need_j && (reflect && (sp != 0))))
+ {
+ // Only calculate if we need it, and if the reflection formula will actually use it:
+ Yv = bessel_yn_small_z(n, x, &Yv_scale, pol);
+ }
+ else
+ Yv = std::numeric_limits<T>::quiet_NaN();
+ }
+ else if(asymptotic_bessel_large_x_limit(v, x))
+ {
+ if(kind&need_y)
+ {
+ Yv = asymptotic_bessel_y_large_x_2(v, x);
+ }
+ else
+ Yv = std::numeric_limits<T>::quiet_NaN(); // any value will do, we're not using it.
+ if(kind&need_j)
+ {
+ Jv = asymptotic_bessel_j_large_x_2(v, x);
+ }
+ else
+ Jv = std::numeric_limits<T>::quiet_NaN(); // any value will do, we're not using it.
+ }
+ else if((x > 8) && hankel_PQ(v, x, &p, &q, pol))
+ {
+ //
+ // Hankel approximation: note that this method works best when x
+ // is large, but in that case we end up calculating sines and cosines
+ // of large values, with horrendous resulting accuracy. It is fast though
+ // when it works....
+ //
+ // Normally we calculate sin/cos(chi) where:
+ //
+ // chi = x - fmod(T(v / 2 + 0.25f), T(2)) * boost::math::constants::pi<T>();
+ //
+ // But this introduces large errors, so use sin/cos addition formulae to
+ // improve accuracy:
+ //
+ T mod_v = fmod(T(v / 2 + 0.25f), T(2));
+ T sx = sin(x);
+ T cx = cos(x);
+ T sv = sin_pi(mod_v);
+ T cv = cos_pi(mod_v);
+
+ T sc = sx * cv - sv * cx; // == sin(chi);
+ T cc = cx * cv + sx * sv; // == cos(chi);
+ T chi = boost::math::constants::root_two<T>() / (boost::math::constants::root_pi<T>() * sqrt(x)); //sqrt(2 / (boost::math::constants::pi<T>() * x));
+ Yv = chi * (p * sc + q * cc);
+ Jv = chi * (p * cc - q * sc);
+ }
+ else if (x <= 2) // x in (0, 2]
+ {
+ if(temme_jy(u, x, &Yu, &Yu1, pol)) // Temme series
+ {
+ // domain error:
+ *J = *Y = Yu;
+ return 1;
+ }
+ prev = Yu;
+ current = Yu1;
+ T scale = 1;
+ policies::check_series_iterations<T>(function, n, pol);
+ for (k = 1; k <= n; k++) // forward recurrence for Y
+ {
+ T fact = 2 * (u + k) / x;
+ if((tools::max_value<T>() - fabs(prev)) / fact < fabs(current))
+ {
+ scale /= current;
+ prev /= current;
+ current = 1;
+ }
+ next = fact * current - prev;
+ prev = current;
+ current = next;
+ }
+ Yv = prev;
+ Yv1 = current;
+ if(kind&need_j)
+ {
+ CF1_jy(v, x, &fv, &s, pol); // continued fraction CF1_jy
+ Jv = scale * W / (Yv * fv - Yv1); // Wronskian relation
+ }
+ else
+ Jv = std::numeric_limits<T>::quiet_NaN(); // any value will do, we're not using it.
+ Yv_scale = scale;
+ }
+ else // x in (2, \infty)
+ {
+ // Get Y(u, x):
+
+ T ratio;
+ CF1_jy(v, x, &fv, &s, pol);
+ // tiny initial value to prevent overflow
+ T init = sqrt(tools::min_value<T>());
+ prev = fv * s * init;
+ current = s * init;
+ if(v < max_factorial<T>::value)
+ {
+ policies::check_series_iterations<T>(function, n, pol);
+ for (k = n; k > 0; k--) // backward recurrence for J
+ {
next = 2 * (u + k) * current / x - prev;
prev = current;
current = next;
- }
- ratio = (s * init) / current; // scaling ratio
- // can also call CF1_jy() to get fu, not much difference in precision
- fu = prev / current;
- }
- else
- {
- //
- // When v is large we may get overflow in this calculation
- // leading to NaN's and other nasty surprises:
- //
- bool over = false;
- for (k = n; k > 0; k--) // backward recurrence for J
- {
+ }
+ ratio = (s * init) / current; // scaling ratio
+ // can also call CF1_jy() to get fu, not much difference in precision
+ fu = prev / current;
+ }
+ else
+ {
+ //
+ // When v is large we may get overflow in this calculation
+ // leading to NaN's and other nasty surprises:
+ //
+ policies::check_series_iterations<T>(function, n, pol);
+ bool over = false;
+ for (k = n; k > 0; k--) // backward recurrence for J
+ {
T t = 2 * (u + k) / x;
- if(tools::max_value<T>() / t < current)
+ if((t > 1) && (tools::max_value<T>() / t < current))
{
over = true;
break;
@@ -467,87 +489,88 @@
next = t * current - prev;
prev = current;
current = next;
- }
- if(!over)
- {
- ratio = (s * init) / current; // scaling ratio
- // can also call CF1_jy() to get fu, not much difference in precision
- fu = prev / current;
- }
- else
- {
- ratio = 0;
- fu = 1;
- }
- }
- CF2_jy(u, x, &p, &q, pol); // continued fraction CF2_jy
- T t = u / x - fu; // t = J'/J
- gamma = (p - t) / q;
- //
- // We can't allow gamma to cancel out to zero competely as it messes up
- // the subsequent logic. So pretend that one bit didn't cancel out
- // and set to a suitably small value. The only test case we've been able to
- // find for this, is when v = 8.5 and x = 4*PI.
- //
- if(gamma == 0)
- {
- gamma = u * tools::epsilon<T>() / x;
- }
- Ju = sign(current) * sqrt(W / (q + gamma * (p - t)));
-
- Jv = Ju * ratio; // normalization
-
- Yu = gamma * Ju;
- Yu1 = Yu * (u/x - p - q/gamma);
- }
- if(kind&need_y)
- {
- // compute Y:
- prev = Yu;
- current = Yu1;
- for (k = 1; k <= n; k++) // forward recurrence for Y
- {
- T fact = 2 * (u + k) / x;
- if((tools::max_value<T>() - fabs(prev)) / fact < fabs(current))
+ }
+ if(!over)
{
- prev /= current;
- Yv_scale /= current;
- current = 1;
+ ratio = (s * init) / current; // scaling ratio
+ // can also call CF1_jy() to get fu, not much difference in precision
+ fu = prev / current;
}
- next = fact * current - prev;
- prev = current;
- current = next;
- }
- Yv = prev;
- }
- else
- Yv = std::numeric_limits<T>::quiet_NaN(); // any value will do, we're not using it.
- }
-
- if (reflect)
- {
- if((sp != 0) && (tools::max_value<T>() * fabs(Yv_scale) < fabs(sp * Yv)))
- *J = org_kind & need_j ? T(-sign(sp) * sign(Yv) * sign(Yv_scale) * policies::raise_overflow_error<T>(function, 0, pol)) : T(0);
- else
- *J = cp * Jv - (sp == 0 ? T(0) : T((sp * Yv) / Yv_scale)); // reflection formula
- if((cp != 0) && (tools::max_value<T>() * fabs(Yv_scale) < fabs(cp * Yv)))
- *Y = org_kind & need_y ? T(-sign(cp) * sign(Yv) * sign(Yv_scale) * policies::raise_overflow_error<T>(function, 0, pol)) : T(0);
- else
- *Y = sp * Jv + (cp == 0 ? T(0) : T((cp * Yv) / Yv_scale));
- }
- else
- {
- *J = Jv;
- if(tools::max_value<T>() * fabs(Yv_scale) < fabs(Yv))
- *Y = org_kind & need_y ? T(sign(Yv) * sign(Yv_scale) * policies::raise_overflow_error<T>(function, 0, pol)) : T(0);
- else
- *Y = Yv / Yv_scale;
- }
+ else
+ {
+ ratio = 0;
+ fu = 1;
+ }
+ }
+ CF2_jy(u, x, &p, &q, pol); // continued fraction CF2_jy
+ T t = u / x - fu; // t = J'/J
+ gamma = (p - t) / q;
+ //
+ // We can't allow gamma to cancel out to zero competely as it messes up
+ // the subsequent logic. So pretend that one bit didn't cancel out
+ // and set to a suitably small value. The only test case we've been able to
+ // find for this, is when v = 8.5 and x = 4*PI.
+ //
+ if(gamma == 0)
+ {
+ gamma = u * tools::epsilon<T>() / x;
+ }
+ Ju = sign(current) * sqrt(W / (q + gamma * (p - t)));
+
+ Jv = Ju * ratio; // normalization
+
+ Yu = gamma * Ju;
+ Yu1 = Yu * (u/x - p - q/gamma);
+
+ if(kind&need_y)
+ {
+ // compute Y:
+ prev = Yu;
+ current = Yu1;
+ policies::check_series_iterations<T>(function, n, pol);
+ for (k = 1; k <= n; k++) // forward recurrence for Y
+ {
+ T fact = 2 * (u + k) / x;
+ if((tools::max_value<T>() - fabs(prev)) / fact < fabs(current))
+ {
+ prev /= current;
+ Yv_scale /= current;
+ current = 1;
+ }
+ next = fact * current - prev;
+ prev = current;
+ current = next;
+ }
+ Yv = prev;
+ }
+ else
+ Yv = std::numeric_limits<T>::quiet_NaN(); // any value will do, we're not using it.
+ }
+
+ if (reflect)
+ {
+ if((sp != 0) && (tools::max_value<T>() * fabs(Yv_scale) < fabs(sp * Yv)))
+ *J = org_kind & need_j ? T(-sign(sp) * sign(Yv) * sign(Yv_scale) * policies::raise_overflow_error<T>(function, 0, pol)) : T(0);
+ else
+ *J = cp * Jv - (sp == 0 ? T(0) : T((sp * Yv) / Yv_scale)); // reflection formula
+ if((cp != 0) && (tools::max_value<T>() * fabs(Yv_scale) < fabs(cp * Yv)))
+ *Y = org_kind & need_y ? T(-sign(cp) * sign(Yv) * sign(Yv_scale) * policies::raise_overflow_error<T>(function, 0, pol)) : T(0);
+ else
+ *Y = (sp != 0 ? sp * Jv : T(0)) + (cp == 0 ? T(0) : T((cp * Yv) / Yv_scale));
+ }
+ else
+ {
+ *J = Jv;
+ if(tools::max_value<T>() * fabs(Yv_scale) < fabs(Yv))
+ *Y = org_kind & need_y ? T(sign(Yv) * sign(Yv_scale) * policies::raise_overflow_error<T>(function, 0, pol)) : T(0);
+ else
+ *Y = Yv / Yv_scale;
+ }
- return 0;
-}
+ return 0;
+ }
-} // namespace detail
+ } // namespace detail
}} // namespaces
Modified: branches/release/boost/math/special_functions/detail/bessel_jy_asym.hpp
==============================================================================
--- branches/release/boost/math/special_functions/detail/bessel_jy_asym.hpp (original)
+++ branches/release/boost/math/special_functions/detail/bessel_jy_asym.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -21,61 +21,6 @@
namespace boost{ namespace math{ namespace detail{
template <class T>
-inline T asymptotic_bessel_j_large_x_P(T v, T x)
-{
- // A&S 9.2.9
- T s = 1;
- T mu = 4 * v * v;
- T ez2 = 8 * x;
- ez2 *= ez2;
- s -= (mu-1) * (mu-9) / (2 * ez2);
- s += (mu-1) * (mu-9) * (mu-25) * (mu - 49) / (24 * ez2 * ez2);
- return s;
-}
-
-template <class T>
-inline T asymptotic_bessel_j_large_x_Q(T v, T x)
-{
- // A&S 9.2.10
- T s = 0;
- T mu = 4 * v * v;
- T ez = 8*x;
- s += (mu-1) / ez;
- s -= (mu-1) * (mu-9) * (mu-25) / (6 * ez*ez*ez);
- return s;
-}
-
-template <class T>
-inline T asymptotic_bessel_j_large_x(T v, T x)
-{
- //
- // See http://functions.wolfram.com/BesselAiryStruveFunctions/BesselJ/06/02/02/0001/
- //
- // Also A&S 9.2.5
- //
- BOOST_MATH_STD_USING // ADL of std names
- T chi = fabs(x) - constants::pi<T>() * (2 * v + 1) / 4;
- return sqrt(2 / (constants::pi<T>() * x))
- * (asymptotic_bessel_j_large_x_P(v, x) * cos(chi)
- - asymptotic_bessel_j_large_x_Q(v, x) * sin(chi));
-}
-
-template <class T>
-inline T asymptotic_bessel_y_large_x(T v, T x)
-{
- //
- // See http://functions.wolfram.com/BesselAiryStruveFunctions/BesselJ/06/02/02/0001/
- //
- // Also A&S 9.2.5
- //
- BOOST_MATH_STD_USING // ADL of std names
- T chi = fabs(x) - constants::pi<T>() * (2 * v + 1) / 4;
- return sqrt(2 / (constants::pi<T>() * x))
- * (asymptotic_bessel_j_large_x_P(v, x) * sin(chi)
- - asymptotic_bessel_j_large_x_Q(v, x) * cos(chi));
-}
-
-template <class T>
inline T asymptotic_bessel_amplitude(T v, T x)
{
// Calculate the amplitude of J(v, x) and Y(v, x) for large
@@ -99,13 +44,14 @@
//
// Calculate the phase of J(v, x) and Y(v, x) for large x.
// See A&S 9.2.29.
- // Note that the result returned is the phase less x.
+ // Note that the result returned is the phase less (x - PI(v/2 + 1/4))
+ // which we'll factor in later when we calculate the sines/cosines of the result:
//
T mu = 4 * v * v;
T denom = 4 * x;
T denom_mult = denom * denom;
- T s = -constants::pi<T>() * (v / 2 + 0.25f);
+ T s = 0;
s += (mu - 1) / (2 * denom);
denom *= denom_mult;
s += (mu - 1) * (mu - 25) / (6 * denom);
@@ -127,10 +73,16 @@
BOOST_MATH_INSTRUMENT_VARIABLE(ampl);
BOOST_MATH_INSTRUMENT_VARIABLE(phase);
//
- // Calculate the sine of the phase, using:
- // sin(x+p) = sin(x)cos(p) + cos(x)sin(p)
- //
- T sin_phase = sin(phase) * cos(x) + cos(phase) * sin(x);
+ // Calculate the sine of the phase, using
+ // sine/cosine addition rules to factor in
+ // the x - PI(v/2 + 1/4) term not added to the
+ // phase when we calculated it.
+ //
+ T cx = cos(x);
+ T sx = sin(x);
+ T ci = cos_pi(v / 2 + 0.25f);
+ T si = sin_pi(v / 2 + 0.25f);
+ T sin_phase = sin(phase) * (cx * ci + sx * si) + cos(phase) * (sx * ci - cx * si);
BOOST_MATH_INSTRUMENT_CODE(sin(phase));
BOOST_MATH_INSTRUMENT_CODE(cos(x));
BOOST_MATH_INSTRUMENT_CODE(cos(phase));
@@ -149,101 +101,39 @@
BOOST_MATH_INSTRUMENT_VARIABLE(ampl);
BOOST_MATH_INSTRUMENT_VARIABLE(phase);
//
- // Calculate the sine of the phase, using:
- // cos(x+p) = cos(x)cos(p) - sin(x)sin(p)
+ // Calculate the sine of the phase, using
+ // sine/cosine addition rules to factor in
+ // the x - PI(v/2 + 1/4) term not added to the
+ // phase when we calculated it.
//
BOOST_MATH_INSTRUMENT_CODE(cos(phase));
BOOST_MATH_INSTRUMENT_CODE(cos(x));
BOOST_MATH_INSTRUMENT_CODE(sin(phase));
BOOST_MATH_INSTRUMENT_CODE(sin(x));
- T sin_phase = cos(phase) * cos(x) - sin(phase) * sin(x);
+ T cx = cos(x);
+ T sx = sin(x);
+ T ci = cos_pi(v / 2 + 0.25f);
+ T si = sin_pi(v / 2 + 0.25f);
+ T sin_phase = cos(phase) * (cx * ci + sx * si) - sin(phase) * (sx * ci - cx * si);
BOOST_MATH_INSTRUMENT_VARIABLE(sin_phase);
return sin_phase * ampl;
}
-//
-// Various limits for the J and Y asymptotics
-// (the asympotic expansions are safe to use if
-// x is less than the limit given).
-// We assume that if we don't use these expansions then the
-// error will likely be >100eps, so the limits given are chosen
-// to lead to < 100eps truncation error.
-//
template <class T>
-inline T asymptotic_bessel_y_limit(const mpl::int_<0>&)
+inline bool asymptotic_bessel_large_x_limit(const T& v, const T& x)
{
- // default case:
BOOST_MATH_STD_USING
- return 2.25 / pow(100 * tools::epsilon<T>() / T(0.001f), T(0.2f));
-}
-template <class T>
-inline T asymptotic_bessel_y_limit(const mpl::int_<53>&)
-{
- // double case:
- return 304 /*780*/;
-}
-template <class T>
-inline T asymptotic_bessel_y_limit(const mpl::int_<64>&)
-{
- // 80-bit extended-double case:
- return 1552 /*3500*/;
-}
-template <class T>
-inline T asymptotic_bessel_y_limit(const mpl::int_<113>&)
-{
- // 128-bit long double case:
- return 1245243 /*3128000*/;
-}
-
-template <class T, class Policy>
-struct bessel_asymptotic_tag
-{
- typedef typename policies::precision<T, Policy>::type precision_type;
- typedef typename mpl::if_<
- mpl::or_<
- mpl::equal_to<precision_type, mpl::int_<0> >,
- mpl::greater<precision_type, mpl::int_<113> > >,
- mpl::int_<0>,
- typename mpl::if_<
- mpl::greater<precision_type, mpl::int_<64> >,
- mpl::int_<113>,
- typename mpl::if_<
- mpl::greater<precision_type, mpl::int_<53> >,
- mpl::int_<64>,
- mpl::int_<53>
- >::type
- >::type
- >::type type;
-};
-
-template <class T>
-inline T asymptotic_bessel_j_limit(const T& v, const mpl::int_<0>&)
-{
- // default case:
- BOOST_MATH_STD_USING
- T v2 = (std::max)(T(3), T(v * v));
- return v2 / pow(100 * tools::epsilon<T>() / T(2e-5f), T(0.17f));
-}
-template <class T>
-inline T asymptotic_bessel_j_limit(const T& v, const mpl::int_<53>&)
-{
- // double case:
- T v2 = (std::max)(T(3), T(v * v));
- return v2 * 33 /*73*/;
-}
-template <class T>
-inline T asymptotic_bessel_j_limit(const T& v, const mpl::int_<64>&)
-{
- // 80-bit extended-double case:
- T v2 = (std::max)(T(3), T(v * v));
- return v2 * 121 /*266*/;
-}
-template <class T>
-inline T asymptotic_bessel_j_limit(const T& v, const mpl::int_<113>&)
-{
- // 128-bit long double case:
- T v2 = (std::max)(T(3), T(v * v));
- return v2 * 39154 /*85700*/;
+ //
+ // Determines if x is large enough compared to v to take the asymptotic
+ // forms above. From A&S 9.2.28 we require:
+ // v < x * eps^1/8
+ // and from A&S 9.2.29 we require:
+ // v^12/10 < 1.5 * x * eps^1/10
+ // using the former seems to work OK in practice with broadly similar
+ // error rates either side of the divide for v < 10000.
+ // At double precision eps^1/8 ~= 0.01.
+ //
+ return (std::max)(T(fabs(v)), T(1)) < x * sqrt(tools::forth_root_epsilon<T>());
}
template <class T, class Policy>
Modified: branches/release/boost/math/special_functions/detail/bessel_y0.hpp
==============================================================================
--- branches/release/boost/math/special_functions/detail/bessel_y0.hpp (original)
+++ branches/release/boost/math/special_functions/detail/bessel_y0.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -199,7 +199,7 @@
T y2 = y * y;
rc = evaluate_rational(PC, QC, y2);
rs = evaluate_rational(PS, QS, y2);
- factor = sqrt(2 / (x * pi<T>()));
+ factor = constants::one_div_root_pi<T>() / sqrt(x);
//
// The following code is really just:
//
@@ -207,12 +207,12 @@
// value = factor * (rc * sin(z) + y * rs * cos(z));
//
// But using the sin/cos addition formulae and constant values for
- // sin/cos of PI/4:
+ // sin/cos of PI/4 which then cancel part of the "factor" term as they're all
+ // 1 / sqrt(2):
//
T sx = sin(x);
T cx = cos(x);
- value = factor * (rc * (sx * constants::one_div_root_two<T>() - cx * constants::half_root_two<T>())
- + y * rs * (cx * constants::one_div_root_two<T>() + sx * constants::half_root_two<T>()));
+ value = factor * (rc * (sx - cx) + y * rs * (cx + sx));
}
return value;
Modified: branches/release/boost/math/special_functions/detail/bessel_y1.hpp
==============================================================================
--- branches/release/boost/math/special_functions/detail/bessel_y1.hpp (original)
+++ branches/release/boost/math/special_functions/detail/bessel_y1.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -172,19 +172,19 @@
T y2 = y * y;
rc = evaluate_rational(PC, QC, y2);
rs = evaluate_rational(PS, QS, y2);
- factor = sqrt(2 / (x * pi<T>()));
+ factor = 1 / (sqrt(x) * root_pi<T>());
//
// This code is really just:
//
// T z = x - 0.75f * pi<T>();
// value = factor * (rc * sin(z) + y * rs * cos(z));
//
- // But using the sin/cos addition rules, plus constants for sin/cos of 3PI/4:
+ // But using the sin/cos addition rules, plus constants for sin/cos of 3PI/4
+ // which then cancel out with corresponding terms in "factor".
//
T sx = sin(x);
T cx = cos(x);
- value = factor * (rc * (sx * -constants::one_div_root_two<T>() - cx * constants::half_root_two<T>())
- + y * rs * (cx * -constants::one_div_root_two<T>() + sx * constants::half_root_two<T>()));
+ value = factor * (y * rs * (sx - cx) - rc * (sx + cx));
}
return value;
Modified: branches/release/boost/math/special_functions/detail/bessel_yn.hpp
==============================================================================
--- branches/release/boost/math/special_functions/detail/bessel_yn.hpp (original)
+++ branches/release/boost/math/special_functions/detail/bessel_yn.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -75,10 +75,11 @@
current = bessel_y1(x, pol);
int k = 1;
BOOST_ASSERT(k < n);
+ policies::check_series_iterations<T>("boost::math::bessel_y_n<%1%>(%1%,%1%)", n, pol);
do
{
T fact = 2 * k / x;
- if((tools::max_value<T>() - fabs(prev)) / fact < fabs(current))
+ if((fact > 1) && ((tools::max_value<T>() - fabs(prev)) / fact < fabs(current)))
{
prev /= current;
factor /= current;
Modified: branches/release/boost/math/special_functions/detail/ibeta_inverse.hpp
==============================================================================
--- branches/release/boost/math/special_functions/detail/ibeta_inverse.hpp (original)
+++ branches/release/boost/math/special_functions/detail/ibeta_inverse.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -866,14 +866,16 @@
inline typename tools::promote_args<T1, T2, T3>::type
ibeta_inv(T1 a, T2 b, T3 p)
{
- return ibeta_inv(a, b, p, static_cast<T1*>(0), policies::policy<>());
+ typedef typename tools::promote_args<T1, T2, T3>::type result_type;
+ return ibeta_inv(a, b, p, static_cast<result_type*>(0), policies::policy<>());
}
template <class T1, class T2, class T3, class Policy>
inline typename tools::promote_args<T1, T2, T3>::type
ibeta_inv(T1 a, T2 b, T3 p, const Policy& pol)
{
- return ibeta_inv(a, b, p, static_cast<T1*>(0), pol);
+ typedef typename tools::promote_args<T1, T2, T3>::type result_type;
+ return ibeta_inv(a, b, p, static_cast<result_type*>(0), pol);
}
template <class T1, class T2, class T3, class T4, class Policy>
@@ -922,16 +924,16 @@
inline typename tools::promote_args<RT1, RT2, RT3>::type
ibetac_inv(RT1 a, RT2 b, RT3 q)
{
- typedef typename remove_cv<RT1>::type dummy;
- return ibetac_inv(a, b, q, static_cast<dummy*>(0), policies::policy<>());
+ typedef typename tools::promote_args<RT1, RT2, RT3>::type result_type;
+ return ibetac_inv(a, b, q, static_cast<result_type*>(0), policies::policy<>());
}
template <class RT1, class RT2, class RT3, class Policy>
inline typename tools::promote_args<RT1, RT2, RT3>::type
ibetac_inv(RT1 a, RT2 b, RT3 q, const Policy& pol)
{
- typedef typename remove_cv<RT1>::type dummy;
- return ibetac_inv(a, b, q, static_cast<dummy*>(0), pol);
+ typedef typename tools::promote_args<RT1, RT2, RT3>::type result_type;
+ return ibetac_inv(a, b, q, static_cast<result_type*>(0), pol);
}
} // namespace math
Modified: branches/release/boost/math/special_functions/detail/igamma_inverse.hpp
==============================================================================
--- branches/release/boost/math/special_functions/detail/igamma_inverse.hpp (original)
+++ branches/release/boost/math/special_functions/detail/igamma_inverse.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -341,7 +341,7 @@
// flag is set, then Q(x) - q and it's derivatives.
//
typedef typename policies::evaluation<T, Policy>::type value_type;
- typedef typename lanczos::lanczos<T, Policy>::type evaluation_type;
+ // typedef typename lanczos::lanczos<T, Policy>::type evaluation_type;
typedef typename policies::normalise<
Policy,
policies::promote_float<false>,
Modified: branches/release/boost/math/special_functions/detail/round_fwd.hpp
==============================================================================
--- branches/release/boost/math/special_functions/detail/round_fwd.hpp (original)
+++ branches/release/boost/math/special_functions/detail/round_fwd.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -9,6 +9,7 @@
#define BOOST_MATH_SPECIAL_ROUND_FWD_HPP
#include <boost/config.hpp>
+#include <boost/math/tools/promotion.hpp>
#ifdef _MSC_VER
#pragma once
@@ -20,9 +21,9 @@
{
template <class T, class Policy>
- T trunc(const T& v, const Policy& pol);
+ typename tools::promote_args<T>::type trunc(const T& v, const Policy& pol);
template <class T>
- T trunc(const T& v);
+ typename tools::promote_args<T>::type trunc(const T& v);
template <class T, class Policy>
int itrunc(const T& v, const Policy& pol);
template <class T>
@@ -38,9 +39,9 @@
boost::long_long_type lltrunc(const T& v);
#endif
template <class T, class Policy>
- T round(const T& v, const Policy& pol);
+ typename tools::promote_args<T>::type round(const T& v, const Policy& pol);
template <class T>
- T round(const T& v);
+ typename tools::promote_args<T>::type round(const T& v);
template <class T, class Policy>
int iround(const T& v, const Policy& pol);
template <class T>
@@ -76,5 +77,17 @@
}
}
+
+#undef BOOST_MATH_STD_USING
+#define BOOST_MATH_STD_USING BOOST_MATH_STD_USING_CORE\
+ using boost::math::round;\
+ using boost::math::iround;\
+ using boost::math::lround;\
+ using boost::math::trunc;\
+ using boost::math::itrunc;\
+ using boost::math::ltrunc;\
+ using boost::math::modf;
+
+
#endif // BOOST_MATH_SPECIAL_ROUND_FWD_HPP
Modified: branches/release/boost/math/special_functions/detail/unchecked_factorial.hpp
==============================================================================
--- branches/release/boost/math/special_functions/detail/unchecked_factorial.hpp (original)
+++ branches/release/boost/math/special_functions/detail/unchecked_factorial.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -15,7 +15,9 @@
#pragma warning(push) // Temporary until lexical cast fixed.
#pragma warning(disable: 4127 4701)
#endif
+#ifndef BOOST_MATH_NO_LEXICAL_CAST
#include <boost/lexical_cast.hpp>
+#endif
#ifdef BOOST_MSVC
#pragma warning(pop)
#endif
@@ -279,6 +281,8 @@
value = ::boost::math::max_factorial<long double>::value);
};
+#ifndef BOOST_MATH_NO_LEXICAL_CAST
+
template <class T>
inline T unchecked_factorial(unsigned i BOOST_MATH_APPEND_EXPLICIT_TEMPLATE_TYPE_SPEC(T))
{
@@ -403,6 +407,22 @@
BOOST_STATIC_CONSTANT(unsigned, value = 100);
};
+#else // BOOST_MATH_NO_LEXICAL_CAST
+
+template <class T>
+inline T unchecked_factorial(unsigned i BOOST_MATH_APPEND_EXPLICIT_TEMPLATE_TYPE_SPEC(T))
+{
+ return 1;
+}
+
+template <class T>
+struct max_factorial
+{
+ BOOST_STATIC_CONSTANT(unsigned, value = 0);
+};
+
+#endif
+
#ifndef BOOST_NO_INCLASS_MEMBER_INITIALIZATION
template <class T>
const unsigned max_factorial<T>::value;
Modified: branches/release/boost/math/special_functions/factorials.hpp
==============================================================================
--- branches/release/boost/math/special_functions/factorials.hpp (original)
+++ branches/release/boost/math/special_functions/factorials.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -18,7 +18,6 @@
#pragma warning(push) // Temporary until lexical cast fixed.
#pragma warning(disable: 4127 4701)
#endif
-#include <boost/lexical_cast.hpp>
#ifdef BOOST_MSVC
#pragma warning(pop)
#endif
Modified: branches/release/boost/math/special_functions/fpclassify.hpp
==============================================================================
--- branches/release/boost/math/special_functions/fpclassify.hpp (original)
+++ branches/release/boost/math/special_functions/fpclassify.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -37,13 +37,13 @@
a floating point type (float, double or long double) can be determined
at compile time, then the following algorithm is used:
- If all exponent bits, the flag bit (if there is one),
+ If all exponent bits, the flag bit (if there is one),
and all significand bits are 0, then the number is zero.
- If all exponent bits and the flag bit (if there is one) are 0,
+ If all exponent bits and the flag bit (if there is one) are 0,
and at least one significand bit is 1, then the number is subnormal.
- If all exponent bits are 1 and all significand bits are 0,
+ If all exponent bits are 1 and all significand bits are 0,
then the number is infinity.
If all exponent bits are 1 and at least one significand bit is 1,
@@ -56,7 +56,7 @@
Most formats have the structure
sign bit + exponent bits + significand bits.
-
+
A few have the structure
sign bit + exponent bits + flag bit + significand bits.
The flag bit is 0 for zero and subnormal numbers,
@@ -85,7 +85,7 @@
namespace std{ using ::abs; using ::fabs; }
#endif
-namespace boost{
+namespace boost{
//
// This must not be located in any namespace under boost::math
@@ -100,6 +100,7 @@
#ifdef isnan
return isnan(t);
#elif defined(BOOST_MATH_DISABLE_STD_FPCLASSIFY) || !defined(BOOST_HAS_FPCLASSIFY)
+ (void)t;
return false;
#else // BOOST_HAS_FPCLASSIFY
return (BOOST_FPCLASSIFY_PREFIX fpclassify(t) == (int)FP_NAN);
@@ -169,7 +170,7 @@
if(std::numeric_limits<T>::is_specialized)
return fpclassify_imp(t, generic_tag<true>());
#endif
- //
+ //
// An unknown type with no numeric_limits support,
// so what are we supposed to do we do here?
//
@@ -178,7 +179,7 @@
return t == 0 ? FP_ZERO : FP_NORMAL;
}
-template<class T>
+template<class T>
int fpclassify_imp BOOST_NO_MACRO_EXPAND(T x, ieee_copy_all_bits_tag)
{
typedef BOOST_DEDUCED_TYPENAME fp_traits<T>::type traits;
@@ -207,7 +208,7 @@
return FP_NAN;
}
-template<class T>
+template<class T>
int fpclassify_imp BOOST_NO_MACRO_EXPAND(T x, ieee_copy_leading_bits_tag)
{
typedef BOOST_DEDUCED_TYPENAME fp_traits<T>::type traits;
@@ -215,7 +216,7 @@
BOOST_MATH_INSTRUMENT_VARIABLE(x);
BOOST_DEDUCED_TYPENAME traits::bits a;
- traits::get_bits(x,a);
+ traits::get_bits(x,a);
a &= traits::exponent | traits::flag | traits::significand;
if(a <= traits::significand) {
@@ -278,21 +279,21 @@
namespace detail {
#ifdef BOOST_MATH_USE_STD_FPCLASSIFY
- template<class T>
+ template<class T>
inline bool isfinite_impl(T x, native_tag const&)
{
return (std::isfinite)(x);
}
#endif
- template<class T>
+ template<class T>
inline bool isfinite_impl(T x, generic_tag<true> const&)
{
return x >= -(std::numeric_limits<T>::max)()
&& x <= (std::numeric_limits<T>::max)();
}
- template<class T>
+ template<class T>
inline bool isfinite_impl(T x, generic_tag<false> const&)
{
#ifdef BOOST_NO_LIMITS_COMPILE_TIME_CONSTANTS
@@ -303,7 +304,7 @@
return true;
}
- template<class T>
+ template<class T>
inline bool isfinite_impl(T x, ieee_tag const&)
{
typedef BOOST_DEDUCED_TYPENAME detail::fp_traits<T>::type traits;
@@ -322,18 +323,18 @@
}
-template<class T>
+template<class T>
inline bool (isfinite)(T x)
{ //!< \brief return true if floating-point type t is finite.
typedef typename detail::fp_traits<T>::type traits;
typedef typename traits::method method;
- typedef typename boost::is_floating_point<T>::type fp_tag;
+ // typedef typename boost::is_floating_point<T>::type fp_tag;
typedef typename tools::promote_args<T>::type value_type;
return detail::isfinite_impl(static_cast<value_type>(x), method());
}
#ifdef BOOST_MATH_NO_LONG_DOUBLE_MATH_FUNCTIONS
-template<>
+template<>
inline bool (isfinite)(long double x)
{ //!< \brief return true if floating-point type t is finite.
typedef detail::fp_traits<long double>::type traits;
@@ -349,14 +350,14 @@
namespace detail {
#ifdef BOOST_MATH_USE_STD_FPCLASSIFY
- template<class T>
+ template<class T>
inline bool isnormal_impl(T x, native_tag const&)
{
return (std::isnormal)(x);
}
#endif
- template<class T>
+ template<class T>
inline bool isnormal_impl(T x, generic_tag<true> const&)
{
if(x < 0) x = -x;
@@ -364,7 +365,7 @@
&& x <= (std::numeric_limits<T>::max)();
}
- template<class T>
+ template<class T>
inline bool isnormal_impl(T x, generic_tag<false> const&)
{
#ifdef BOOST_NO_LIMITS_COMPILE_TIME_CONSTANTS
@@ -374,7 +375,7 @@
return !(x == 0);
}
- template<class T>
+ template<class T>
inline bool isnormal_impl(T x, ieee_tag const&)
{
typedef BOOST_DEDUCED_TYPENAME detail::fp_traits<T>::type traits;
@@ -393,18 +394,18 @@
}
-template<class T>
+template<class T>
inline bool (isnormal)(T x)
{
typedef typename detail::fp_traits<T>::type traits;
typedef typename traits::method method;
- typedef typename boost::is_floating_point<T>::type fp_tag;
+ //typedef typename boost::is_floating_point<T>::type fp_tag;
typedef typename tools::promote_args<T>::type value_type;
return detail::isnormal_impl(static_cast<value_type>(x), method());
}
#ifdef BOOST_MATH_NO_LONG_DOUBLE_MATH_FUNCTIONS
-template<>
+template<>
inline bool (isnormal)(long double x)
{
typedef detail::fp_traits<long double>::type traits;
@@ -420,23 +421,23 @@
namespace detail {
#ifdef BOOST_MATH_USE_STD_FPCLASSIFY
- template<class T>
+ template<class T>
inline bool isinf_impl(T x, native_tag const&)
{
return (std::isinf)(x);
}
#endif
- template<class T>
+ template<class T>
inline bool isinf_impl(T x, generic_tag<true> const&)
{
(void)x; // in case the compiler thinks that x is unused because std::numeric_limits<T>::has_infinity is false
- return std::numeric_limits<T>::has_infinity
+ return std::numeric_limits<T>::has_infinity
&& ( x == std::numeric_limits<T>::infinity()
|| x == -std::numeric_limits<T>::infinity());
}
- template<class T>
+ template<class T>
inline bool isinf_impl(T x, generic_tag<false> const&)
{
#ifdef BOOST_NO_LIMITS_COMPILE_TIME_CONSTANTS
@@ -447,7 +448,7 @@
return false;
}
- template<class T>
+ template<class T>
inline bool isinf_impl(T x, ieee_copy_all_bits_tag const&)
{
typedef BOOST_DEDUCED_TYPENAME fp_traits<T>::type traits;
@@ -458,7 +459,7 @@
return a == traits::exponent;
}
- template<class T>
+ template<class T>
inline bool isinf_impl(T x, ieee_copy_leading_bits_tag const&)
{
typedef BOOST_DEDUCED_TYPENAME fp_traits<T>::type traits;
@@ -482,18 +483,18 @@
} // namespace detail
-template<class T>
+template<class T>
inline bool (isinf)(T x)
{
typedef typename detail::fp_traits<T>::type traits;
typedef typename traits::method method;
- typedef typename boost::is_floating_point<T>::type fp_tag;
+ // typedef typename boost::is_floating_point<T>::type fp_tag;
typedef typename tools::promote_args<T>::type value_type;
return detail::isinf_impl(static_cast<value_type>(x), method());
}
#ifdef BOOST_MATH_NO_LONG_DOUBLE_MATH_FUNCTIONS
-template<>
+template<>
inline bool (isinf)(long double x)
{
typedef detail::fp_traits<long double>::type traits;
@@ -509,14 +510,14 @@
namespace detail {
#ifdef BOOST_MATH_USE_STD_FPCLASSIFY
- template<class T>
+ template<class T>
inline bool isnan_impl(T x, native_tag const&)
{
return (std::isnan)(x);
}
#endif
- template<class T>
+ template<class T>
inline bool isnan_impl(T x, generic_tag<true> const&)
{
return std::numeric_limits<T>::has_infinity
@@ -524,7 +525,7 @@
: x != x;
}
- template<class T>
+ template<class T>
inline bool isnan_impl(T x, generic_tag<false> const&)
{
#ifdef BOOST_NO_LIMITS_COMPILE_TIME_CONSTANTS
@@ -535,7 +536,7 @@
return false;
}
- template<class T>
+ template<class T>
inline bool isnan_impl(T x, ieee_copy_all_bits_tag const&)
{
typedef BOOST_DEDUCED_TYPENAME fp_traits<T>::type traits;
@@ -546,7 +547,7 @@
return a > traits::exponent;
}
- template<class T>
+ template<class T>
inline bool isnan_impl(T x, ieee_copy_leading_bits_tag const&)
{
typedef BOOST_DEDUCED_TYPENAME fp_traits<T>::type traits;
@@ -565,12 +566,12 @@
} // namespace detail
-template<class T>
+template<class T>
inline bool (isnan)(T x)
{ //!< \brief return true if floating-point type t is NaN (Not A Number).
typedef typename detail::fp_traits<T>::type traits;
typedef typename traits::method method;
- typedef typename boost::is_floating_point<T>::type fp_tag;
+ // typedef typename boost::is_floating_point<T>::type fp_tag;
return detail::isnan_impl(x, method());
}
@@ -579,7 +580,7 @@
template <> inline bool isnan BOOST_NO_MACRO_EXPAND<double>(double t){ return ::boost::math_detail::is_nan_helper(t, boost::true_type()); }
template <> inline bool isnan BOOST_NO_MACRO_EXPAND<long double>(long double t){ return ::boost::math_detail::is_nan_helper(t, boost::true_type()); }
#elif defined(BOOST_MATH_NO_LONG_DOUBLE_MATH_FUNCTIONS)
-template<>
+template<>
inline bool (isnan)(long double x)
{ //!< \brief return true if floating-point type t is NaN (Not A Number).
typedef detail::fp_traits<long double>::type traits;
Modified: branches/release/boost/math/special_functions/gamma.hpp
==============================================================================
--- branches/release/boost/math/special_functions/gamma.hpp (original)
+++ branches/release/boost/math/special_functions/gamma.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -14,17 +14,6 @@
#endif
#include <boost/config.hpp>
-#ifdef BOOST_MSVC
-# pragma warning(push)
-# pragma warning(disable: 4127 4701)
-// // For lexical_cast, until fixed in 1.35?
-// // conditional expression is constant &
-// // Potentially uninitialized local variable 'name' used
-#endif
-#include <boost/lexical_cast.hpp>
-#ifdef BOOST_MSVC
-# pragma warning(pop)
-#endif
#include <boost/math/tools/series.hpp>
#include <boost/math/tools/fraction.hpp>
#include <boost/math/tools/precision.hpp>
@@ -50,12 +39,6 @@
#include <boost/config/no_tr1/cmath.hpp>
#include <algorithm>
-#ifdef BOOST_MATH_INSTRUMENT
-#include <iostream>
-#include <iomanip>
-#include <typeinfo>
-#endif
-
#ifdef BOOST_MSVC
# pragma warning(push)
# pragma warning(disable: 4702) // unreachable code (return after domain_error throw).
@@ -179,14 +162,15 @@
else
{
result *= Lanczos::lanczos_sum(z);
+ T zgh = (z + static_cast<T>(Lanczos::g()) - boost::math::constants::half<T>());
+ T lzgh = log(zgh);
BOOST_MATH_INSTRUMENT_VARIABLE(result);
BOOST_MATH_INSTRUMENT_VARIABLE(tools::log_max_value<T>());
- if(z * log(z) > tools::log_max_value<T>())
+ if(z * lzgh > tools::log_max_value<T>())
{
// we're going to overflow unless this is done with care:
- T zgh = (z + static_cast<T>(Lanczos::g()) - boost::math::constants::half<T>());
BOOST_MATH_INSTRUMENT_VARIABLE(zgh);
- if(log(zgh) * z / 2 > tools::log_max_value<T>())
+ if(lzgh * z / 2 > tools::log_max_value<T>())
return policies::raise_overflow_error<T>(function, "Result of tgamma is too large to represent.", pol);
T hp = pow(zgh, (z / 2) - T(0.25));
BOOST_MATH_INSTRUMENT_VARIABLE(hp);
@@ -199,7 +183,6 @@
}
else
{
- T zgh = (z + static_cast<T>(Lanczos::g()) - boost::math::constants::half<T>());
BOOST_MATH_INSTRUMENT_VARIABLE(zgh);
BOOST_MATH_INSTRUMENT_VARIABLE(pow(zgh, z - boost::math::constants::half<T>()));
BOOST_MATH_INSTRUMENT_VARIABLE(exp(zgh));
@@ -1208,6 +1191,68 @@
}
template <class T, class Policy>
+T tgamma_ratio_imp(T x, T y, const Policy& pol)
+{
+ BOOST_MATH_STD_USING
+
+ if((x <= tools::min_value<T>()) || (boost::math::isinf)(x))
+ policies::raise_domain_error<T>("boost::math::tgamma_ratio<%1%>(%1%, %1%)", "Gamma function ratios only implemented for positive arguments (got a=%1%).", x, pol);
+ if((y <= tools::min_value<T>()) || (boost::math::isinf)(y))
+ policies::raise_domain_error<T>("boost::math::tgamma_ratio<%1%>(%1%, %1%)", "Gamma function ratios only implemented for positive arguments (got b=%1%).", y, pol);
+
+ if((x < max_factorial<T>::value) && (y < max_factorial<T>::value))
+ {
+ // Rather than subtracting values, lets just call the gamma functions directly:
+ return boost::math::tgamma(x, pol) / boost::math::tgamma(y, pol);
+ }
+ T prefix = 1;
+ if(x < 1)
+ {
+ if(y < 2 * max_factorial<T>::value)
+ {
+ // We need to sidestep on x as well, otherwise we'll underflow
+ // before we get to factor in the prefix term:
+ prefix /= x;
+ x += 1;
+ while(y >= max_factorial<T>::value)
+ {
+ y -= 1;
+ prefix /= y;
+ }
+ return prefix * boost::math::tgamma(x, pol) / boost::math::tgamma(y, pol);
+ }
+ //
+ // result is almost certainly going to underflow to zero, try logs just in case:
+ //
+ return exp(boost::math::lgamma(x, pol) - boost::math::lgamma(y, pol));
+ }
+ if(y < 1)
+ {
+ if(x < 2 * max_factorial<T>::value)
+ {
+ // We need to sidestep on y as well, otherwise we'll overflow
+ // before we get to factor in the prefix term:
+ prefix *= y;
+ y += 1;
+ while(x >= max_factorial<T>::value)
+ {
+ x -= 1;
+ prefix *= x;
+ }
+ return prefix * boost::math::tgamma(x, pol) / boost::math::tgamma(y, pol);
+ }
+ //
+ // Result will almost certainly overflow, try logs just in case:
+ //
+ return exp(boost::math::lgamma(x, pol) - boost::math::lgamma(y, pol));
+ }
+ //
+ // Regular case, x and y both large and similar in magnitude:
+ //
+ return boost::math::tgamma_delta_ratio(x, y - x, pol);
+}
+
+template <class T, class Policy>
T gamma_p_derivative_imp(T a, T x, const Policy& pol)
{
//
@@ -1360,7 +1405,7 @@
BOOST_FPU_EXCEPTION_GUARD
typedef typename tools::promote_args<T1, T2>::type result_type;
typedef typename policies::evaluation<result_type, Policy>::type value_type;
- typedef typename lanczos::lanczos<value_type, Policy>::type evaluation_type;
+ // typedef typename lanczos::lanczos<value_type, Policy>::type evaluation_type;
typedef typename policies::normalise<
Policy,
policies::promote_float<false>,
@@ -1489,7 +1534,7 @@
BOOST_FPU_EXCEPTION_GUARD
typedef typename tools::promote_args<T1, T2>::type result_type;
typedef typename policies::evaluation<result_type, Policy>::type value_type;
- typedef typename lanczos::lanczos<value_type, Policy>::type evaluation_type;
+ // typedef typename lanczos::lanczos<value_type, Policy>::type evaluation_type;
typedef typename policies::normalise<
Policy,
policies::promote_float<false>,
@@ -1520,7 +1565,7 @@
BOOST_FPU_EXCEPTION_GUARD
typedef typename tools::promote_args<T1, T2>::type result_type;
typedef typename policies::evaluation<result_type, Policy>::type value_type;
- typedef typename lanczos::lanczos<value_type, Policy>::type evaluation_type;
+ // typedef typename lanczos::lanczos<value_type, Policy>::type evaluation_type;
typedef typename policies::normalise<
Policy,
policies::promote_float<false>,
@@ -1551,7 +1596,7 @@
BOOST_FPU_EXCEPTION_GUARD
typedef typename tools::promote_args<T1, T2>::type result_type;
typedef typename policies::evaluation<result_type, Policy>::type value_type;
- typedef typename lanczos::lanczos<value_type, Policy>::type evaluation_type;
+ // typedef typename lanczos::lanczos<value_type, Policy>::type evaluation_type;
typedef typename policies::normalise<
Policy,
policies::promote_float<false>,
@@ -1609,7 +1654,7 @@
policies::discrete_quantile<>,
policies::assert_undefined<> >::type forwarding_policy;
- return policies::checked_narrowing_cast<result_type, forwarding_policy>(detail::tgamma_delta_ratio_imp(static_cast<value_type>(a), static_cast<value_type>(static_cast<value_type>(b) - static_cast<value_type>(a)), forwarding_policy()), "boost::math::tgamma_delta_ratio<%1%>(%1%, %1%)");
+ return policies::checked_narrowing_cast<result_type, forwarding_policy>(detail::tgamma_ratio_imp(static_cast<value_type>(a), static_cast<value_type>(b), forwarding_policy()), "boost::math::tgamma_delta_ratio<%1%>(%1%, %1%)");
}
template <class T1, class T2>
inline typename tools::promote_args<T1, T2>::type
Modified: branches/release/boost/math/special_functions/jacobi_elliptic.hpp
==============================================================================
--- branches/release/boost/math/special_functions/jacobi_elliptic.hpp (original)
+++ branches/release/boost/math/special_functions/jacobi_elliptic.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -115,8 +115,8 @@
} // namespace detail
-template <class T, class Policy>
-inline typename tools::promote_args<T>::type jacobi_elliptic(T k, T theta, T* pcn, T* pdn, const Policy&)
+template <class T, class U, class V, class Policy>
+inline typename tools::promote_args<T, U, V>::type jacobi_elliptic(T k, U theta, V* pcn, V* pdn, const Policy&)
{
BOOST_FPU_EXCEPTION_GUARD
typedef typename tools::promote_args<T>::type result_type;
@@ -139,8 +139,8 @@
return policies::checked_narrowing_cast<result_type, Policy>(sn, function);;
}
-template <class T>
-inline typename tools::promote_args<T>::type jacobi_elliptic(T k, T theta, T* pcn, T* pdn)
+template <class T, class U, class V>
+inline typename tools::promote_args<T, U, V>::type jacobi_elliptic(T k, U theta, V* pcn, V* pdn)
{
return jacobi_elliptic(k, theta, pcn, pdn, policies::policy<>());
}
Modified: branches/release/boost/math/special_functions/math_fwd.hpp
==============================================================================
--- branches/release/boost/math/special_functions/math_fwd.hpp (original)
+++ branches/release/boost/math/special_functions/math_fwd.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -14,7 +14,7 @@
// IT = Integer type.
// RT = Real type (built-in floating-point types, float, double, long double) & User Defined Types
-// AT = Integer or Real type
+// AT = Integer or Real type
#ifndef BOOST_MATH_SPECIAL_MATH_FWD_HPP
#define BOOST_MATH_SPECIAL_MATH_FWD_HPP
@@ -38,111 +38,111 @@
// Beta functions.
template <class RT1, class RT2>
- typename tools::promote_args<RT1, RT2>::type
+ typename tools::promote_args<RT1, RT2>::type
beta(RT1 a, RT2 b); // Beta function (2 arguments).
template <class RT1, class RT2, class A>
- typename tools::promote_args<RT1, RT2, A>::type
+ typename tools::promote_args<RT1, RT2, A>::type
beta(RT1 a, RT2 b, A x); // Beta function (3 arguments).
template <class RT1, class RT2, class RT3, class Policy>
- typename tools::promote_args<RT1, RT2, RT3>::type
+ typename tools::promote_args<RT1, RT2, RT3>::type
beta(RT1 a, RT2 b, RT3 x, const Policy& pol); // Beta function (3 arguments).
template <class RT1, class RT2, class RT3>
- typename tools::promote_args<RT1, RT2, RT3>::type
+ typename tools::promote_args<RT1, RT2, RT3>::type
betac(RT1 a, RT2 b, RT3 x);
template <class RT1, class RT2, class RT3, class Policy>
- typename tools::promote_args<RT1, RT2, RT3>::type
+ typename tools::promote_args<RT1, RT2, RT3>::type
betac(RT1 a, RT2 b, RT3 x, const Policy& pol);
template <class RT1, class RT2, class RT3>
- typename tools::promote_args<RT1, RT2, RT3>::type
+ typename tools::promote_args<RT1, RT2, RT3>::type
ibeta(RT1 a, RT2 b, RT3 x); // Incomplete beta function.
template <class RT1, class RT2, class RT3, class Policy>
- typename tools::promote_args<RT1, RT2, RT3>::type
+ typename tools::promote_args<RT1, RT2, RT3>::type
ibeta(RT1 a, RT2 b, RT3 x, const Policy& pol); // Incomplete beta function.
template <class RT1, class RT2, class RT3>
- typename tools::promote_args<RT1, RT2, RT3>::type
+ typename tools::promote_args<RT1, RT2, RT3>::type
ibetac(RT1 a, RT2 b, RT3 x); // Incomplete beta complement function.
template <class RT1, class RT2, class RT3, class Policy>
- typename tools::promote_args<RT1, RT2, RT3>::type
+ typename tools::promote_args<RT1, RT2, RT3>::type
ibetac(RT1 a, RT2 b, RT3 x, const Policy& pol); // Incomplete beta complement function.
template <class T1, class T2, class T3, class T4>
- typename tools::promote_args<T1, T2, T3, T4>::type
+ typename tools::promote_args<T1, T2, T3, T4>::type
ibeta_inv(T1 a, T2 b, T3 p, T4* py);
template <class T1, class T2, class T3, class T4, class Policy>
- typename tools::promote_args<T1, T2, T3, T4>::type
+ typename tools::promote_args<T1, T2, T3, T4>::type
ibeta_inv(T1 a, T2 b, T3 p, T4* py, const Policy& pol);
template <class RT1, class RT2, class RT3>
- typename tools::promote_args<RT1, RT2, RT3>::type
+ typename tools::promote_args<RT1, RT2, RT3>::type
ibeta_inv(RT1 a, RT2 b, RT3 p); // Incomplete beta inverse function.
template <class RT1, class RT2, class RT3, class Policy>
- typename tools::promote_args<RT1, RT2, RT3>::type
+ typename tools::promote_args<RT1, RT2, RT3>::type
ibeta_inv(RT1 a, RT2 b, RT3 p, const Policy&); // Incomplete beta inverse function.
template <class RT1, class RT2, class RT3>
- typename tools::promote_args<RT1, RT2, RT3>::type
+ typename tools::promote_args<RT1, RT2, RT3>::type
ibeta_inva(RT1 a, RT2 b, RT3 p); // Incomplete beta inverse function.
template <class RT1, class RT2, class RT3, class Policy>
- typename tools::promote_args<RT1, RT2, RT3>::type
+ typename tools::promote_args<RT1, RT2, RT3>::type
ibeta_inva(RT1 a, RT2 b, RT3 p, const Policy&); // Incomplete beta inverse function.
template <class RT1, class RT2, class RT3>
- typename tools::promote_args<RT1, RT2, RT3>::type
+ typename tools::promote_args<RT1, RT2, RT3>::type
ibeta_invb(RT1 a, RT2 b, RT3 p); // Incomplete beta inverse function.
template <class RT1, class RT2, class RT3, class Policy>
- typename tools::promote_args<RT1, RT2, RT3>::type
+ typename tools::promote_args<RT1, RT2, RT3>::type
ibeta_invb(RT1 a, RT2 b, RT3 p, const Policy&); // Incomplete beta inverse function.
template <class T1, class T2, class T3, class T4>
- typename tools::promote_args<T1, T2, T3, T4>::type
+ typename tools::promote_args<T1, T2, T3, T4>::type
ibetac_inv(T1 a, T2 b, T3 q, T4* py);
template <class T1, class T2, class T3, class T4, class Policy>
- typename tools::promote_args<T1, T2, T3, T4>::type
+ typename tools::promote_args<T1, T2, T3, T4>::type
ibetac_inv(T1 a, T2 b, T3 q, T4* py, const Policy& pol);
template <class RT1, class RT2, class RT3>
- typename tools::promote_args<RT1, RT2, RT3>::type
+ typename tools::promote_args<RT1, RT2, RT3>::type
ibetac_inv(RT1 a, RT2 b, RT3 q); // Incomplete beta complement inverse function.
template <class RT1, class RT2, class RT3, class Policy>
- typename tools::promote_args<RT1, RT2, RT3>::type
+ typename tools::promote_args<RT1, RT2, RT3>::type
ibetac_inv(RT1 a, RT2 b, RT3 q, const Policy&); // Incomplete beta complement inverse function.
template <class RT1, class RT2, class RT3>
- typename tools::promote_args<RT1, RT2, RT3>::type
+ typename tools::promote_args<RT1, RT2, RT3>::type
ibetac_inva(RT1 a, RT2 b, RT3 q); // Incomplete beta complement inverse function.
template <class RT1, class RT2, class RT3, class Policy>
- typename tools::promote_args<RT1, RT2, RT3>::type
+ typename tools::promote_args<RT1, RT2, RT3>::type
ibetac_inva(RT1 a, RT2 b, RT3 q, const Policy&); // Incomplete beta complement inverse function.
template <class RT1, class RT2, class RT3>
- typename tools::promote_args<RT1, RT2, RT3>::type
+ typename tools::promote_args<RT1, RT2, RT3>::type
ibetac_invb(RT1 a, RT2 b, RT3 q); // Incomplete beta complement inverse function.
template <class RT1, class RT2, class RT3, class Policy>
- typename tools::promote_args<RT1, RT2, RT3>::type
+ typename tools::promote_args<RT1, RT2, RT3>::type
ibetac_invb(RT1 a, RT2 b, RT3 q, const Policy&); // Incomplete beta complement inverse function.
template <class RT1, class RT2, class RT3>
- typename tools::promote_args<RT1, RT2, RT3>::type
+ typename tools::promote_args<RT1, RT2, RT3>::type
ibeta_derivative(RT1 a, RT2 b, RT3 x); // derivative of incomplete beta
template <class RT1, class RT2, class RT3, class Policy>
- typename tools::promote_args<RT1, RT2, RT3>::type
+ typename tools::promote_args<RT1, RT2, RT3>::type
ibeta_derivative(RT1 a, RT2 b, RT3 x, const Policy& pol); // derivative of incomplete beta
// erf & erfc error functions.
@@ -168,51 +168,51 @@
// Polynomials:
template <class T1, class T2, class T3>
- typename tools::promote_args<T1, T2, T3>::type
+ typename tools::promote_args<T1, T2, T3>::type
legendre_next(unsigned l, T1 x, T2 Pl, T3 Plm1);
template <class T>
- typename tools::promote_args<T>::type
+ typename tools::promote_args<T>::type
legendre_p(int l, T x);
template <class T, class Policy>
- typename tools::promote_args<T>::type
+ typename tools::promote_args<T>::type
legendre_p(int l, T x, const Policy& pol);
template <class T>
- typename tools::promote_args<T>::type
+ typename tools::promote_args<T>::type
legendre_q(unsigned l, T x);
template <class T, class Policy>
- typename tools::promote_args<T>::type
+ typename tools::promote_args<T>::type
legendre_q(unsigned l, T x, const Policy& pol);
template <class T1, class T2, class T3>
- typename tools::promote_args<T1, T2, T3>::type
+ typename tools::promote_args<T1, T2, T3>::type
legendre_next(unsigned l, unsigned m, T1 x, T2 Pl, T3 Plm1);
template <class T>
- typename tools::promote_args<T>::type
+ typename tools::promote_args<T>::type
legendre_p(int l, int m, T x);
template <class T, class Policy>
- typename tools::promote_args<T>::type
+ typename tools::promote_args<T>::type
legendre_p(int l, int m, T x, const Policy& pol);
template <class T1, class T2, class T3>
- typename tools::promote_args<T1, T2, T3>::type
+ typename tools::promote_args<T1, T2, T3>::type
laguerre_next(unsigned n, T1 x, T2 Ln, T3 Lnm1);
template <class T1, class T2, class T3>
- typename tools::promote_args<T1, T2, T3>::type
+ typename tools::promote_args<T1, T2, T3>::type
laguerre_next(unsigned n, unsigned l, T1 x, T2 Pl, T3 Plm1);
template <class T>
- typename tools::promote_args<T>::type
+ typename tools::promote_args<T>::type
laguerre(unsigned n, T x);
template <class T, class Policy>
- typename tools::promote_args<T>::type
+ typename tools::promote_args<T>::type
laguerre(unsigned n, unsigned m, T x, const Policy& pol);
template <class T1, class T2>
@@ -226,76 +226,76 @@
};
template <class T1, class T2>
- typename laguerre_result<T1, T2>::type
+ typename laguerre_result<T1, T2>::type
laguerre(unsigned n, T1 m, T2 x);
template <class T>
- typename tools::promote_args<T>::type
+ typename tools::promote_args<T>::type
hermite(unsigned n, T x);
template <class T, class Policy>
- typename tools::promote_args<T>::type
+ typename tools::promote_args<T>::type
hermite(unsigned n, T x, const Policy& pol);
template <class T1, class T2, class T3>
- typename tools::promote_args<T1, T2, T3>::type
+ typename tools::promote_args<T1, T2, T3>::type
hermite_next(unsigned n, T1 x, T2 Hn, T3 Hnm1);
template <class T1, class T2>
- std::complex<typename tools::promote_args<T1, T2>::type>
+ std::complex<typename tools::promote_args<T1, T2>::type>
spherical_harmonic(unsigned n, int m, T1 theta, T2 phi);
template <class T1, class T2, class Policy>
- std::complex<typename tools::promote_args<T1, T2>::type>
+ std::complex<typename tools::promote_args<T1, T2>::type>
spherical_harmonic(unsigned n, int m, T1 theta, T2 phi, const Policy& pol);
template <class T1, class T2>
- typename tools::promote_args<T1, T2>::type
+ typename tools::promote_args<T1, T2>::type
spherical_harmonic_r(unsigned n, int m, T1 theta, T2 phi);
template <class T1, class T2, class Policy>
- typename tools::promote_args<T1, T2>::type
+ typename tools::promote_args<T1, T2>::type
spherical_harmonic_r(unsigned n, int m, T1 theta, T2 phi, const Policy& pol);
template <class T1, class T2>
- typename tools::promote_args<T1, T2>::type
+ typename tools::promote_args<T1, T2>::type
spherical_harmonic_i(unsigned n, int m, T1 theta, T2 phi);
template <class T1, class T2, class Policy>
- typename tools::promote_args<T1, T2>::type
+ typename tools::promote_args<T1, T2>::type
spherical_harmonic_i(unsigned n, int m, T1 theta, T2 phi, const Policy& pol);
// Elliptic integrals:
template <class T1, class T2, class T3>
- typename tools::promote_args<T1, T2, T3>::type
+ typename tools::promote_args<T1, T2, T3>::type
ellint_rf(T1 x, T2 y, T3 z);
template <class T1, class T2, class T3, class Policy>
- typename tools::promote_args<T1, T2, T3>::type
+ typename tools::promote_args<T1, T2, T3>::type
ellint_rf(T1 x, T2 y, T3 z, const Policy& pol);
template <class T1, class T2, class T3>
- typename tools::promote_args<T1, T2, T3>::type
+ typename tools::promote_args<T1, T2, T3>::type
ellint_rd(T1 x, T2 y, T3 z);
template <class T1, class T2, class T3, class Policy>
- typename tools::promote_args<T1, T2, T3>::type
+ typename tools::promote_args<T1, T2, T3>::type
ellint_rd(T1 x, T2 y, T3 z, const Policy& pol);
template <class T1, class T2>
- typename tools::promote_args<T1, T2>::type
+ typename tools::promote_args<T1, T2>::type
ellint_rc(T1 x, T2 y);
template <class T1, class T2, class Policy>
- typename tools::promote_args<T1, T2>::type
+ typename tools::promote_args<T1, T2>::type
ellint_rc(T1 x, T2 y, const Policy& pol);
template <class T1, class T2, class T3, class T4>
- typename tools::promote_args<T1, T2, T3, T4>::type
+ typename tools::promote_args<T1, T2, T3, T4>::type
ellint_rj(T1 x, T2 y, T3 z, T4 p);
template <class T1, class T2, class T3, class T4, class Policy>
- typename tools::promote_args<T1, T2, T3, T4>::type
+ typename tools::promote_args<T1, T2, T3, T4>::type
ellint_rj(T1 x, T2 y, T3 z, T4 p, const Policy& pol);
template <typename T>
@@ -349,7 +349,7 @@
template <class RT, class Policy>
RT factorial(unsigned int, const Policy& pol);
template <class RT>
- RT unchecked_factorial(unsigned int BOOST_MATH_APPEND_EXPLICIT_TEMPLATE_TYPE(RT));
+ RT unchecked_factorial(unsigned int BOOST_MATH_APPEND_EXPLICIT_TEMPLATE_TYPE(RT));
template <class RT>
RT double_factorial(unsigned i);
template <class RT, class Policy>
@@ -465,11 +465,11 @@
// Hypotenuse function sqrt(x ^ 2 + y ^ 2).
template <class T1, class T2>
- typename tools::promote_args<T1, T2>::type
+ typename tools::promote_args<T1, T2>::type
hypot(T1 x, T2 y);
template <class T1, class T2, class Policy>
- typename tools::promote_args<T1, T2>::type
+ typename tools::promote_args<T1, T2>::type
hypot(T1 x, T2 y, const Policy&);
// cbrt - cube root.
@@ -502,11 +502,11 @@
// Power - 1
template <class T1, class T2>
- typename tools::promote_args<T1, T2>::type
+ typename tools::promote_args<T1, T2>::type
powm1(const T1 a, const T2 z);
template <class T1, class T2, class Policy>
- typename tools::promote_args<T1, T2>::type
+ typename tools::promote_args<T1, T2>::type
powm1(const T1 a, const T2 z, const Policy&);
// sqrt(1+x) - 1
@@ -614,13 +614,51 @@
template <class T>
typename detail::bessel_traits<T, T, policies::policy<> >::result_type sph_neumann(unsigned v, T x);
- template <class T1, class T2, class Policy>
- std::complex<typename detail::bessel_traits<T1, T2, Policy>::result_type> cyl_hankel_1(T1 v, T2 x, const Policy& pol);
+ template <class T, class Policy>
+ typename detail::bessel_traits<T, T, Policy>::result_type cyl_bessel_j_zero(T v, int m, const Policy& pol);
+
+ template <class T>
+ typename detail::bessel_traits<T, T, policies::policy<> >::result_type cyl_bessel_j_zero(T v, int m);
+
+ template <class T, class OutputIterator>
+ OutputIterator cyl_bessel_j_zero(T v,
+ int start_index,
+ unsigned number_of_zeros,
+ OutputIterator out_it);
+
+ template <class T, class OutputIterator, class Policy>
+ OutputIterator cyl_bessel_j_zero(T v,
+ int start_index,
+ unsigned number_of_zeros,
+ OutputIterator out_it,
+ const Policy&);
+
+ template <class T, class Policy>
+ typename detail::bessel_traits<T, T, Policy>::result_type cyl_neumann_zero(T v, int m, const Policy& pol);
+
+ template <class T>
+ typename detail::bessel_traits<T, T, policies::policy<> >::result_type cyl_neumann_zero(T v, int m);
+
+ template <class T, class OutputIterator>
+ OutputIterator cyl_neumann_zero(T v,
+ int start_index,
+ unsigned number_of_zeros,
+ OutputIterator out_it);
+
+ template <class T, class OutputIterator, class Policy>
+ OutputIterator cyl_neumann_zero(T v,
+ int start_index,
+ unsigned number_of_zeros,
+ OutputIterator out_it,
+ const Policy&);
template <class T1, class T2>
std::complex<typename detail::bessel_traits<T1, T2, policies::policy<> >::result_type> cyl_hankel_1(T1 v, T2 x);
template <class T1, class T2, class Policy>
+ std::complex<typename detail::bessel_traits<T1, T2, Policy>::result_type> cyl_hankel_1(T1 v, T2 x, const Policy& pol);
+
+ template <class T1, class T2, class Policy>
std::complex<typename detail::bessel_traits<T1, T2, Policy>::result_type> cyl_hankel_2(T1 v, T2 x, const Policy& pol);
template <class T1, class T2>
@@ -662,6 +700,40 @@
template <class T>
typename tools::promote_args<T>::type airy_bi_prime(T x);
+ template <class T>
+ T airy_ai_zero(unsigned m);
+ template <class T, class Policy>
+ T airy_ai_zero(unsigned m, const Policy&);
+
+ template <class OutputIterator>
+ OutputIterator airy_ai_zero(
+ unsigned start_index,
+ unsigned number_of_zeros,
+ OutputIterator out_it);
+ template <class OutputIterator, class Policy>
+ OutputIterator airy_ai_zero(
+ unsigned start_index,
+ unsigned number_of_zeros,
+ OutputIterator out_it,
+ const Policy&);
+
+ template <class T>
+ T airy_bi_zero(unsigned m);
+ template <class T, class Policy>
+ T airy_bi_zero(unsigned m, const Policy&);
+
+ template <class OutputIterator>
+ OutputIterator airy_bi_zero(
+ unsigned start_index,
+ unsigned number_of_zeros,
+ OutputIterator out_it);
+ template <class OutputIterator, class Policy>
+ OutputIterator airy_bi_zero(
+ unsigned start_index,
+ unsigned number_of_zeros,
+ OutputIterator out_it,
+ const Policy&);
+
template <class T, class Policy>
typename tools::promote_args<T>::type sin_pi(T x, const Policy&);
@@ -689,17 +761,17 @@
template <class T>
bool isnormal BOOST_NO_MACRO_EXPAND(T t);
- template<class T>
+ template<class T>
int signbit BOOST_NO_MACRO_EXPAND(T x);
template <class T>
int sign BOOST_NO_MACRO_EXPAND(const T& z);
- template <class T>
- T copysign BOOST_NO_MACRO_EXPAND(const T& x, const T& y);
+ template <class T, class U>
+ typename tools::promote_args<T, U>::type copysign BOOST_NO_MACRO_EXPAND(const T& x, const U& y);
template <class T>
- T changesign BOOST_NO_MACRO_EXPAND(const T& z);
+ typename tools::promote_args<T>::type changesign BOOST_NO_MACRO_EXPAND(const T& z);
// Exponential integrals:
namespace detail{
@@ -737,11 +809,11 @@
typename tools::promote_args<T1, T2>::type owens_t(T1 h, T2 a);
// Jacobi Functions:
- template <class T, class Policy>
- typename tools::promote_args<T>::type jacobi_elliptic(T k, T theta, T* pcn, T* pdn, const Policy&);
+ template <class T, class U, class V, class Policy>
+ typename tools::promote_args<T, U, V>::type jacobi_elliptic(T k, U theta, V* pcn, V* pdn, const Policy&);
- template <class T>
- typename tools::promote_args<T>::type jacobi_elliptic(T k, T theta, T* pcn = 0, T* pdn = 0);
+ template <class T, class U, class V>
+ typename tools::promote_args<T, U, V>::type jacobi_elliptic(T k, U theta, V* pcn = 0, V* pdn = 0);
template <class U, class T, class Policy>
typename tools::promote_args<T, U>::type jacobi_sn(U k, T theta, const Policy& pol);
@@ -827,22 +899,26 @@
typename tools::promote_args<T>::type pow(T base);
// next:
+ template <class T, class U, class Policy>
+ typename tools::promote_args<T, U>::type nextafter(const T&, const U&, const Policy&);
+ template <class T, class U>
+ typename tools::promote_args<T, U>::type nextafter(const T&, const U&);
template <class T, class Policy>
- T nextafter(const T&, const T&, const Policy&);
- template <class T>
- T nextafter(const T&, const T&);
- template <class T, class Policy>
- T float_next(const T&, const Policy&);
+ typename tools::promote_args<T>::type float_next(const T&, const Policy&);
template <class T>
- T float_next(const T&);
+ typename tools::promote_args<T>::type float_next(const T&);
template <class T, class Policy>
- T float_prior(const T&, const Policy&);
+ typename tools::promote_args<T>::type float_prior(const T&, const Policy&);
template <class T>
- T float_prior(const T&);
+ typename tools::promote_args<T>::type float_prior(const T&);
+ template <class T, class U, class Policy>
+ typename tools::promote_args<T, U>::type float_distance(const T&, const U&, const Policy&);
+ template <class T, class U>
+ typename tools::promote_args<T, U>::type float_distance(const T&, const U&);
template <class T, class Policy>
- T float_distance(const T&, const T&, const Policy&);
+ typename tools::promote_args<T>::type float_advance(T val, int distance, const Policy& pol);
template <class T>
- T float_distance(const T&, const T&);
+ typename tools::promote_args<T>::type float_advance(const T& val, int distance);
} // namespace math
} // namespace boost
@@ -1139,6 +1215,28 @@
sph_neumann(unsigned v, T x){ return boost::math::sph_neumann(v, x, Policy()); }\
\
template <class T>\
+ inline typename boost::math::detail::bessel_traits<T, T, Policy >::result_type cyl_bessel_j_zero(T v, int m)\
+ { return boost::math::cyl_bessel_j_zero(v, m, Policy()); }\
+\
+template <class OutputIterator, class T>\
+ inline void cyl_bessel_j_zero(T v,\
+ int start_index,\
+ unsigned number_of_zeros,\
+ OutputIterator out_it)\
+ { boost::math::cyl_bessel_j_zero(v, start_index, number_of_zeros, out_it, Policy()); }\
+\
+ template <class T>\
+ inline typename boost::math::detail::bessel_traits<T, T, Policy >::result_type cyl_neumann_zero(T v, int m)\
+ { return boost::math::cyl_neumann_zero(v, m, Policy()); }\
+\
+template <class OutputIterator, class T>\
+ inline void cyl_neumann_zero(T v,\
+ int start_index,\
+ unsigned number_of_zeros,\
+ OutputIterator out_it)\
+ { boost::math::cyl_neumann_zero(v, start_index, number_of_zeros, out_it, Policy()); }\
+\
+ template <class T>\
inline typename boost::math::tools::promote_args<T>::type sin_pi(T x){ return boost::math::sin_pi(x); }\
\
template <class T>\
@@ -1286,6 +1384,20 @@
inline typename boost::math::tools::promote_args<T>::type airy_bi_prime(T x)\
{ return boost::math::airy_bi_prime(x, Policy()); }\
\
+ template <class T>\
+ inline T airy_ai_zero(int m)\
+ { return boost::math::airy_ai_zero<T>(m, Policy()); }\
+ template <class T, class OutputIterator>\
+ OutputIterator airy_ai_zero(int start_index, unsigned number_of_zeros, OutputIterator out_it)\
+ { return boost::math::airy_ai_zero<T>(start_index, number_of_zeros, out_it, Policy()); }\
+ \
+ template <class T>\
+ inline T airy_bi_zero(int m)\
+ { return boost::math::airy_bi_zero<T>(m, Policy()); }\
+ template <class T, class OutputIterator>\
+ OutputIterator airy_bi_zero(int start_index, unsigned number_of_zeros, OutputIterator out_it)\
+ { return boost::math::airy_bi_zero<T>(start_index, number_of_zeros, out_it, Policy()); }\
+ \
Modified: branches/release/boost/math/special_functions/next.hpp
==============================================================================
--- branches/release/boost/math/special_functions/next.hpp (original)
+++ branches/release/boost/math/special_functions/next.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -32,7 +32,7 @@
// when using the SSE2 registers in DAZ or FTZ mode.
//
static const T m = std::numeric_limits<T>::denorm_min();
- return (0 == m) ? tools::min_value<T>() : m;
+ return ((tools::min_value<T>() - m) == tools::min_value<T>()) ? tools::min_value<T>() : m;
}
template <class T>
@@ -52,7 +52,7 @@
}
//
-// Returns the smallest value that won't generate denorms when
+// Returns the smallest value that won't generate denorms when
// we calculate the value of the least-significant-bit:
//
template <class T>
@@ -94,10 +94,8 @@
return val;
}
-}
-
template <class T, class Policy>
-T float_next(const T& val, const Policy& pol)
+T float_next_imp(const T& val, const Policy& pol)
{
BOOST_MATH_STD_USING
int expon;
@@ -123,7 +121,7 @@
if((fpclass != FP_SUBNORMAL) && (fpclass != FP_ZERO) && (fabs(val) < detail::get_min_shift_value<T>()) && (val != -tools::min_value<T>()))
{
//
- // Special case: if the value of the least significant bit is a denorm, and the result
+ // Special case: if the value of the least significant bit is a denorm, and the result
// would not be a denorm, then shift the input, increment, and shift back.
// This avoids issues with the Intel SSE2 registers when the FTZ or DAZ flags are set.
//
@@ -138,6 +136,15 @@
return val + diff;
}
+}
+
+template <class T, class Policy>
+inline typename tools::promote_args<T>::type float_next(const T& val, const Policy& pol)
+{
+ typedef typename tools::promote_args<T>::type result_type;
+ return detail::float_next_imp(static_cast<result_type>(val), pol);
+}
+
#if 0 //def BOOST_MSVC
//
// We used to use ::_nextafter here, but doing so fails when using
@@ -162,13 +169,15 @@
#endif
template <class T>
-inline T float_next(const T& val)
+inline typename tools::promote_args<T>::type float_next(const T& val)
{
return float_next(val, policies::policy<>());
}
+namespace detail{
+
template <class T, class Policy>
-T float_prior(const T& val, const Policy& pol)
+T float_prior_imp(const T& val, const Policy& pol)
{
BOOST_MATH_STD_USING
int expon;
@@ -194,7 +203,7 @@
if((fpclass != FP_SUBNORMAL) && (fpclass != FP_ZERO) && (fabs(val) < detail::get_min_shift_value<T>()) && (val != tools::min_value<T>()))
{
//
- // Special case: if the value of the least significant bit is a denorm, and the result
+ // Special case: if the value of the least significant bit is a denorm, and the result
// would not be a denorm, then shift the input, increment, and shift back.
// This avoids issues with the Intel SSE2 registers when the FTZ or DAZ flags are set.
//
@@ -210,6 +219,15 @@
return val - diff;
}
+}
+
+template <class T, class Policy>
+inline typename tools::promote_args<T>::type float_prior(const T& val, const Policy& pol)
+{
+ typedef typename tools::promote_args<T>::type result_type;
+ return detail::float_prior_imp(static_cast<result_type>(val), pol);
+}
+
#if 0 //def BOOST_MSVC
//
// We used to use ::_nextafter here, but doing so fails when using
@@ -234,25 +252,28 @@
#endif
template <class T>
-inline T float_prior(const T& val)
+inline typename tools::promote_args<T>::type float_prior(const T& val)
{
return float_prior(val, policies::policy<>());
}
-template <class T, class Policy>
-inline T nextafter(const T& val, const T& direction, const Policy& pol)
+template <class T, class U, class Policy>
+inline typename tools::promote_args<T, U>::type nextafter(const T& val, const U& direction, const Policy& pol)
{
- return val < direction ? boost::math::float_next(val, pol) : val == direction ? val : boost::math::float_prior(val, pol);
+ typedef typename tools::promote_args<T, U>::type result_type;
+ return val < direction ? boost::math::float_next<result_type>(val, pol) : val == direction ? val : boost::math::float_prior<result_type>(val, pol);
}
-template <class T>
-inline T nextafter(const T& val, const T& direction)
+template <class T, class U>
+inline typename tools::promote_args<T, U>::type nextafter(const T& val, const U& direction)
{
return nextafter(val, direction, policies::policy<>());
}
+namespace detail{
+
template <class T, class Policy>
-T float_distance(const T& a, const T& b, const Policy& pol)
+T float_distance_imp(const T& a, const T& b, const Policy& pol)
{
BOOST_MATH_STD_USING
//
@@ -275,12 +296,12 @@
if(a == b)
return 0;
if(a == 0)
- return 1 + fabs(float_distance(static_cast<T>((b < 0) ? -detail::get_smallest_value<T>() : detail::get_smallest_value<T>()), b, pol));
+ return 1 + fabs(float_distance(static_cast<T>((b < 0) ? T(-detail::get_smallest_value<T>()) : detail::get_smallest_value<T>()), b, pol));
if(b == 0)
- return 1 + fabs(float_distance(static_cast<T>((a < 0) ? -detail::get_smallest_value<T>() : detail::get_smallest_value<T>()), a, pol));
+ return 1 + fabs(float_distance(static_cast<T>((a < 0) ? T(-detail::get_smallest_value<T>()) : detail::get_smallest_value<T>()), a, pol));
if(boost::math::sign(a) != boost::math::sign(b))
- return 2 + fabs(float_distance(static_cast<T>((b < 0) ? -detail::get_smallest_value<T>() : detail::get_smallest_value<T>()), b, pol))
- + fabs(float_distance(static_cast<T>((a < 0) ? -detail::get_smallest_value<T>() : detail::get_smallest_value<T>()), a, pol));
+ return 2 + fabs(float_distance(static_cast<T>((b < 0) ? T(-detail::get_smallest_value<T>()) : detail::get_smallest_value<T>()), b, pol))
+ + fabs(float_distance(static_cast<T>((a < 0) ? T(-detail::get_smallest_value<T>()) : detail::get_smallest_value<T>()), a, pol));
//
// By the time we get here, both a and b must have the same sign, we want
// b > a and both postive for the following logic:
@@ -310,7 +331,7 @@
result = float_distance(upper, b);
}
//
- // Use compensated double-double addition to avoid rounding
+ // Use compensated double-double addition to avoid rounding
// errors in the subtraction:
//
T mb, x, y, z;
@@ -350,14 +371,25 @@
return result;
}
-template <class T>
-T float_distance(const T& a, const T& b)
+}
+
+template <class T, class U, class Policy>
+inline typename tools::promote_args<T, U>::type float_distance(const T& a, const U& b, const Policy& pol)
+{
+ typedef typename tools::promote_args<T, U>::type result_type;
+ return detail::float_distance_imp(static_cast<result_type>(a), static_cast<result_type>(b), pol);
+}
+
+template <class T, class U>
+typename tools::promote_args<T, U>::type float_distance(const T& a, const U& b)
{
return boost::math::float_distance(a, b, policies::policy<>());
}
+namespace detail{
+
template <class T, class Policy>
-T float_advance(T val, int distance, const Policy& pol)
+T float_advance_imp(T val, int distance, const Policy& pol)
{
BOOST_MATH_STD_USING
//
@@ -384,7 +416,7 @@
if(fabs(val) < detail::get_min_shift_value<T>())
{
//
- // Special case: if the value of the least significant bit is a denorm,
+ // Special case: if the value of the least significant bit is a denorm,
// implement in terms of float_next/float_prior.
// This avoids issues with the Intel SSE2 registers when the FTZ or DAZ flags are set.
//
@@ -411,7 +443,7 @@
{
distance -= itrunc(limit_distance);
val = limit;
- if(distance < 0)
+ if(distance < 0)
{
limit /= 2;
expon--;
@@ -437,8 +469,17 @@
return val += diff;
}
+}
+
+template <class T, class Policy>
+inline typename tools::promote_args<T>::type float_advance(T val, int distance, const Policy& pol)
+{
+ typedef typename tools::promote_args<T>::type result_type;
+ return detail::float_advance_imp(static_cast<result_type>(val), distance, pol);
+}
+
template <class T>
-inline T float_advance(const T& val, int distance)
+inline typename tools::promote_args<T>::type float_advance(const T& val, int distance)
{
return boost::math::float_advance(val, distance, policies::policy<>());
}
Modified: branches/release/boost/math/special_functions/round.hpp
==============================================================================
--- branches/release/boost/math/special_functions/round.hpp (original)
+++ branches/release/boost/math/special_functions/round.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -17,15 +17,16 @@
namespace boost{ namespace math{
template <class T, class Policy>
-inline T round(const T& v, const Policy& pol)
+inline typename tools::promote_args<T>::type round(const T& v, const Policy& pol)
{
BOOST_MATH_STD_USING
+ typedef typename tools::promote_args<T>::type result_type;
if(!(boost::math::isfinite)(v))
- return policies::raise_rounding_error("boost::math::round<%1%>(%1%)", 0, v, v, pol);
- return v < 0 ? static_cast<T>(ceil(v - 0.5f)) : static_cast<T>(floor(v + 0.5f));
+ return policies::raise_rounding_error("boost::math::round<%1%>(%1%)", 0, static_cast<result_type>(v), static_cast<result_type>(v), pol);
+ return v < 0 ? static_cast<result_type>(ceil(v - 0.5f)) : static_cast<result_type>(floor(v + 0.5f));
}
template <class T>
-inline T round(const T& v)
+inline typename tools::promote_args<T>::type round(const T& v)
{
return round(v, policies::policy<>());
}
Modified: branches/release/boost/math/special_functions/sign.hpp
==============================================================================
--- branches/release/boost/math/special_functions/sign.hpp (original)
+++ branches/release/boost/math/special_functions/sign.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -110,8 +110,9 @@
{
typedef typename detail::fp_traits<T>::type traits;
typedef typename traits::method method;
- typedef typename boost::is_floating_point<T>::type fp_tag;
- return detail::signbit_impl(x, method());
+ // typedef typename boost::is_floating_point<T>::type fp_tag;
+ typedef typename tools::promote_args<T>::type result_type;
+ return detail::signbit_impl(static_cast<result_type>(x), method());
}
template <class T>
@@ -120,20 +121,24 @@
return (z == 0) ? 0 : (boost::math::signbit)(z) ? -1 : 1;
}
-template<class T> T (changesign)(const T& x)
+template <class T> typename tools::promote_args<T>::type (changesign)(const T& x)
{ //!< \brief return unchanged binary pattern of x, except for change of sign bit.
typedef typename detail::fp_traits<T>::sign_change_type traits;
typedef typename traits::method method;
- typedef typename boost::is_floating_point<T>::type fp_tag;
+ // typedef typename boost::is_floating_point<T>::type fp_tag;
+ typedef typename tools::promote_args<T>::type result_type;
- return detail::changesign_impl(x, method());
+ return detail::changesign_impl(static_cast<result_type>(x), method());
}
-template <class T>
-inline T copysign BOOST_NO_MACRO_EXPAND(const T& x, const T& y)
+template <class T, class U>
+inline typename tools::promote_args<T, U>::type
+ copysign BOOST_NO_MACRO_EXPAND(const T& x, const U& y)
{
BOOST_MATH_STD_USING
- return (boost::math::signbit)(x) != (boost::math::signbit)(y) ? (boost::math::changesign)(x) : x;
+ typedef typename tools::promote_args<T, U>::type result_type;
+ return (boost::math::signbit)(static_cast<result_type>(x)) != (boost::math::signbit)(static_cast<result_type>(y))
+ ? (boost::math::changesign)(static_cast<result_type>(x)) : static_cast<result_type>(x);
}
} // namespace math
Modified: branches/release/boost/math/special_functions/sinc.hpp
==============================================================================
--- branches/release/boost/math/special_functions/sinc.hpp (original)
+++ branches/release/boost/math/special_functions/sinc.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -36,36 +36,16 @@
{
namespace detail
{
-#if defined(__GNUC__) && (__GNUC__ < 3)
- // gcc 2.x ignores function scope using declarations,
- // put them in the scope of the enclosing namespace instead:
-
- using ::std::abs;
- using ::std::sqrt;
- using ::std::sin;
-
- using ::std::numeric_limits;
-#endif /* defined(__GNUC__) && (__GNUC__ < 3) */
-
// This is the "Sinus Cardinal" of index Pi.
template<typename T>
inline T sinc_pi_imp(const T x)
{
-#if defined(BOOST_NO_STDC_NAMESPACE) && !defined(__SUNPRO_CC)
- using ::abs;
- using ::sin;
- using ::sqrt;
-#else /* BOOST_NO_STDC_NAMESPACE */
- using ::std::abs;
- using ::std::sin;
- using ::std::sqrt;
-#endif /* BOOST_NO_STDC_NAMESPACE */
-
- // Note: this code is *not* thread safe!
- static T const taylor_0_bound = tools::epsilon<T>();
- static T const taylor_2_bound = sqrt(taylor_0_bound);
- static T const taylor_n_bound = sqrt(taylor_2_bound);
+ BOOST_MATH_STD_USING
+
+ T const taylor_0_bound = tools::epsilon<T>();
+ T const taylor_2_bound = tools::root_epsilon<T>();
+ T const taylor_n_bound = tools::forth_root_epsilon<T>();
if (abs(x) >= taylor_n_bound)
{
@@ -110,28 +90,16 @@
return detail::sinc_pi_imp(static_cast<result_type>(x));
}
-#ifdef BOOST_NO_TEMPLATE_TEMPLATES
-#else /* BOOST_NO_TEMPLATE_TEMPLATES */
+#ifndef BOOST_NO_TEMPLATE_TEMPLATES
template<typename T, template<typename> class U>
inline U<T> sinc_pi(const U<T> x)
{
-#if defined(BOOST_FUNCTION_SCOPE_USING_DECLARATION_BREAKS_ADL) || defined(__GNUC__)
- using namespace std;
-#elif defined(BOOST_NO_STDC_NAMESPACE) && !defined(__SUNPRO_CC)
- using ::abs;
- using ::sin;
- using ::sqrt;
-#else /* BOOST_NO_STDC_NAMESPACE */
- using ::std::abs;
- using ::std::sin;
- using ::std::sqrt;
-#endif /* BOOST_NO_STDC_NAMESPACE */
-
+ BOOST_MATH_STD_USING
using ::std::numeric_limits;
- static T const taylor_0_bound = tools::epsilon<T>();
- static T const taylor_2_bound = sqrt(taylor_0_bound);
- static T const taylor_n_bound = sqrt(taylor_2_bound);
+ T const taylor_0_bound = tools::epsilon<T>();
+ T const taylor_2_bound = tools::root_epsilon<T>();
+ T const taylor_n_bound = tools::forth_root_epsilon<T>();
if (abs(x) >= taylor_n_bound)
{
Modified: branches/release/boost/math/special_functions/spherical_harmonic.hpp
==============================================================================
--- branches/release/boost/math/special_functions/spherical_harmonic.hpp (original)
+++ branches/release/boost/math/special_functions/spherical_harmonic.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -119,7 +119,7 @@
if(m&1)
{
// Check phase if theta is outside [0, PI]:
- U mod = boost::math::tools::fmod_workaround(theta, 2 * constants::pi<U>());
+ U mod = boost::math::tools::fmod_workaround(theta, U(2 * constants::pi<U>()));
if(mod < 0)
mod += 2 * constants::pi<U>();
if(mod > constants::pi<U>())
Modified: branches/release/boost/math/special_functions/trunc.hpp
==============================================================================
--- branches/release/boost/math/special_functions/trunc.hpp (original)
+++ branches/release/boost/math/special_functions/trunc.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -17,15 +17,16 @@
namespace boost{ namespace math{
template <class T, class Policy>
-inline T trunc(const T& v, const Policy& pol)
+inline typename tools::promote_args<T>::type trunc(const T& v, const Policy& pol)
{
BOOST_MATH_STD_USING
+ typedef typename tools::promote_args<T>::type result_type;
if(!(boost::math::isfinite)(v))
- return policies::raise_rounding_error("boost::math::trunc<%1%>(%1%)", 0, v, v, pol);
- return (v >= 0) ? static_cast<T>(floor(v)) : static_cast<T>(ceil(v));
+ return policies::raise_rounding_error("boost::math::trunc<%1%>(%1%)", 0, static_cast<result_type>(v), static_cast<result_type>(v), pol);
+ return (v >= 0) ? static_cast<result_type>(floor(v)) : static_cast<result_type>(ceil(v));
}
template <class T>
-inline T trunc(const T& v)
+inline typename tools::promote_args<T>::type trunc(const T& v)
{
return trunc(v, policies::policy<>());
}
@@ -42,9 +43,10 @@
inline int itrunc(const T& v, const Policy& pol)
{
BOOST_MATH_STD_USING
- T r = boost::math::trunc(v, pol);
+ typedef typename tools::promote_args<T>::type result_type;
+ result_type r = boost::math::trunc(v, pol);
if((r > (std::numeric_limits<int>::max)()) || (r < (std::numeric_limits<int>::min)()))
- return static_cast<int>(policies::raise_rounding_error("boost::math::itrunc<%1%>(%1%)", 0, v, 0, pol));
+ return static_cast<int>(policies::raise_rounding_error("boost::math::itrunc<%1%>(%1%)", 0, static_cast<result_type>(v), 0, pol));
return static_cast<int>(r);
}
template <class T>
@@ -57,9 +59,10 @@
inline long ltrunc(const T& v, const Policy& pol)
{
BOOST_MATH_STD_USING
- T r = boost::math::trunc(v, pol);
+ typedef typename tools::promote_args<T>::type result_type;
+ result_type r = boost::math::trunc(v, pol);
if((r > (std::numeric_limits<long>::max)()) || (r < (std::numeric_limits<long>::min)()))
- return static_cast<long>(policies::raise_rounding_error("boost::math::ltrunc<%1%>(%1%)", 0, v, 0L, pol));
+ return static_cast<long>(policies::raise_rounding_error("boost::math::ltrunc<%1%>(%1%)", 0, static_cast<result_type>(v), 0L, pol));
return static_cast<long>(r);
}
template <class T>
@@ -74,7 +77,8 @@
inline boost::long_long_type lltrunc(const T& v, const Policy& pol)
{
BOOST_MATH_STD_USING
- T r = boost::math::trunc(v, pol);
+ typedef typename tools::promote_args<T>::type result_type;
+ result_type r = boost::math::trunc(v, pol);
if((r > (std::numeric_limits<boost::long_long_type>::max)()) || (r < (std::numeric_limits<boost::long_long_type>::min)()))
return static_cast<boost::long_long_type>(policies::raise_rounding_error("boost::math::lltrunc<%1%>(%1%)", 0, v, static_cast<boost::long_long_type>(0), pol));
return static_cast<boost::long_long_type>(r);
Modified: branches/release/boost/math/special_functions/zeta.hpp
==============================================================================
--- branches/release/boost/math/special_functions/zeta.hpp (original)
+++ branches/release/boost/math/special_functions/zeta.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -866,15 +866,15 @@
T zeta_imp(T s, T sc, const Policy& pol, const Tag& tag)
{
BOOST_MATH_STD_USING
- if(s == 1)
+ if(sc == 0)
return policies::raise_pole_error<T>(
"boost::math::zeta<%1%>",
"Evaluation of zeta function at pole %1%",
s, pol);
T result;
- if(s == 0)
+ if(fabs(s) < tools::root_epsilon<T>())
{
- result = -0.5;
+ result = -0.5f - constants::log_root_two_pi<T, Policy>() * s;
}
else if(s < 0)
{
Modified: branches/release/boost/math/tools/big_constant.hpp
==============================================================================
--- branches/release/boost/math/tools/big_constant.hpp (original)
+++ branches/release/boost/math/tools/big_constant.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -8,7 +8,9 @@
#define BOOST_MATH_TOOLS_BIG_CONSTANT_HPP
#include <boost/math/tools/config.hpp>
+#ifndef BOOST_MATH_NO_LEXICAL_CAST
#include <boost/lexical_cast.hpp>
+#endif
#include <boost/type_traits/is_convertible.hpp>
namespace boost{ namespace math{
@@ -25,11 +27,13 @@
{
return static_cast<T>(v);
}
+#ifndef BOOST_MATH_NO_LEXICAL_CAST
template <class T>
inline T make_big_value(long double, const char* s, mpl::false_ const&, mpl::false_ const&)
{
return boost::lexical_cast<T>(s);
}
+#endif
template <class T>
inline BOOST_CONSTEXPR const char* make_big_value(long double, const char* s, mpl::false_ const&, mpl::true_ const&)
{
Modified: branches/release/boost/math/tools/config.hpp
==============================================================================
--- branches/release/boost/math/tools/config.hpp (original)
+++ branches/release/boost/math/tools/config.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,6 @@
#endif
#include <boost/math/tools/user.hpp>
-#include <boost/math/special_functions/detail/round_fwd.hpp>
#if (defined(__CYGWIN__) || defined(__FreeBSD__) || defined(__NetBSD__) \
|| (defined(__hppa) && !defined(__OpenBSD__)) || (defined(__NO_LONG_DOUBLE_MATH) && (DBL_MANT_DIG != LDBL_MANT_DIG))) \
@@ -208,6 +207,22 @@
#ifndef BOOST_MATH_INT_VALUE_SUFFIX
# define BOOST_MATH_INT_VALUE_SUFFIX(RV, SUF) RV##SUF
#endif
+//
+// Test whether to support __float128:
+//
+#if defined(_GLIBCXX_USE_FLOAT128) && defined(BOOST_GCC) && !defined(__STRICT_ANSI__)
+//
+// Only enable this when the compiler really is GCC as clang and probably
+// intel too don't support __float128 yet :-(
+//
+# define BOOST_MATH_USE_FLOAT128
+#endif
+//
+// Check for WinCE with no iostream support:
+//
+#if defined(_WIN32_WCE) && !defined(__SGI_STL_PORT)
+# define BOOST_MATH_NO_LEXICAL_CAST
+#endif
//
// Helper macro for controlling the FP behaviour:
@@ -218,7 +233,7 @@
//
// Helper macro for using statements:
//
-#define BOOST_MATH_STD_USING \
+#define BOOST_MATH_STD_USING_CORE \
using std::abs;\
using std::acos;\
using std::cos;\
@@ -241,15 +256,9 @@
using std::ceil;\
using std::floor;\
using std::log10;\
- using std::sqrt;\
- using boost::math::round;\
- using boost::math::iround;\
- using boost::math::lround;\
- using boost::math::trunc;\
- using boost::math::itrunc;\
- using boost::math::ltrunc;\
- using boost::math::modf;
+ using std::sqrt;
+#define BOOST_MATH_STD_USING BOOST_MATH_STD_USING_CORE
namespace boost{ namespace math{
namespace tools
@@ -319,12 +328,20 @@
#endif
#ifdef BOOST_MATH_INSTRUMENT
-#define BOOST_MATH_INSTRUMENT_CODE(x) \
- std::cout << std::setprecision(35) << __FILE__ << ":" << __LINE__ << " " << x << std::endl;
-#define BOOST_MATH_INSTRUMENT_VARIABLE(name) BOOST_MATH_INSTRUMENT_CODE(BOOST_STRINGIZE(name) << " = " << name)
+
+# include <iostream>
+# include <iomanip>
+# include <typeinfo>
+
+# define BOOST_MATH_INSTRUMENT_CODE(x) \
+ std::cout << std::setprecision(35) << __FILE__ << ":" << __LINE__ << " " << x << std::endl;
+# define BOOST_MATH_INSTRUMENT_VARIABLE(name) BOOST_MATH_INSTRUMENT_CODE(BOOST_STRINGIZE(name) << " = " << name)
+
#else
-#define BOOST_MATH_INSTRUMENT_CODE(x)
-#define BOOST_MATH_INSTRUMENT_VARIABLE(name)
+
+# define BOOST_MATH_INSTRUMENT_CODE(x)
+# define BOOST_MATH_INSTRUMENT_VARIABLE(name)
+
#endif
#endif // BOOST_MATH_TOOLS_CONFIG_HPP
Modified: branches/release/boost/math/tools/precision.hpp
==============================================================================
--- branches/release/boost/math/tools/precision.hpp (original)
+++ branches/release/boost/math/tools/precision.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -18,8 +18,6 @@
#include <boost/mpl/if.hpp>
#include <boost/math/policies/policy.hpp>
-#include <iostream>
-#include <iomanip>
// These two are for LDBL_MAN_DIG:
#include <limits.h>
#include <math.h>
Modified: branches/release/boost/math/tools/roots.hpp
==============================================================================
--- branches/release/boost/math/tools/roots.hpp (original)
+++ branches/release/boost/math/tools/roots.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -329,8 +329,18 @@
delta = denom / num;
if(delta * f1 / f0 < 0)
{
- // probably cancellation error, try a Newton step instead:
+ // Oh dear, we have a problem as Newton and Halley steps
+ // disagree about which way we should move. Probably
+ // there is cancelation error in the calculation of the
+ // Halley step, or else the derivatives are so small
+ // that their values are basically trash. We will move
+ // in the direction indicated by a Newton step, but
+ // by no more than twice the current guess value, otherwise
+ // we can jump way out of bounds if we're not careful.
+ // See https://svn.boost.org/trac/boost/ticket/8314.
delta = f0 / f1;
+ if(fabs(delta) > 2 * fabs(guess))
+ delta = (delta < 0 ? -1 : 1) * 2 * fabs(guess);
}
}
else
Modified: branches/release/boost/math/tools/test.hpp
==============================================================================
--- branches/release/boost/math/tools/test.hpp (original)
+++ branches/release/boost/math/tools/test.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -15,6 +15,8 @@
#include <boost/math/special_functions/fpclassify.hpp>
#include <boost/test/test_tools.hpp>
#include <stdexcept>
+#include <iostream>
+#include <iomanip>
namespace boost{ namespace math{ namespace tools{
Modified: branches/release/boost/math/tools/toms748_solve.hpp
==============================================================================
--- branches/release/boost/math/tools/toms748_solve.hpp (original)
+++ branches/release/boost/math/tools/toms748_solve.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -197,7 +197,7 @@
T A = safe_div(T(fd - fb), T(d - b), tools::max_value<T>());
A = safe_div(T(A - B), T(d - a), T(0));
- if(a == 0)
+ if(A == 0)
{
// failure to determine coefficients, try a secant step:
return secant_interpolate(a, b, fa, fb);
Modified: branches/release/libs/math/doc/sf_and_dist/bessel_ik.qbk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/bessel_ik.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/bessel_ik.qbk 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -3,6 +3,8 @@
[h4 Synopsis]
+`#include <boost/math/special_functions/bessel.hpp>`
+
template <class T1, class T2>
``__sf_result`` cyl_bessel_i(T1 v, T2 x);
Modified: branches/release/libs/math/doc/sf_and_dist/bessel_jy.qbk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/bessel_jy.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/bessel_jy.qbk 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -3,6 +3,8 @@
[h4 Synopsis]
+`#include <boost/math/special_functions/bessel.hpp>`
+
template <class T1, class T2>
``__sf_result`` cyl_bessel_j(T1 v, T2 x);
@@ -11,11 +13,11 @@
template <class T1, class T2>
``__sf_result`` cyl_neumann(T1 v, T2 x);
-
+
template <class T1, class T2, class ``__Policy``>
``__sf_result`` cyl_neumann(T1 v, T2 x, const ``__Policy``&);
-
-
+
+
[h4 Description]
The functions __cyl_bessel_j and __cyl_neumann return the result of the
@@ -68,26 +70,26 @@
roots: in general these functions have arbitrarily large /relative/
errors when the arguments are sufficiently close to a root. Of
course the absolute error in such cases is always small.
-Note that only results for the widest floating-point type on the
+Note that only results for the widest floating-point type on the
system are given as narrower types have __zero_error. All values
are relative errors in units of epsilon.
[table Errors Rates in cyl_bessel_j
[[Significand Size] [Platform and Compiler] [J[sub 0][space] and J[sub 1]] [J[sub v]] [J[sub v][space] (large values of x > 1000)] ]
-[[53] [Win32 / Visual C++ 8.0]
- [Peak=2.5 Mean=1.1
+[[53] [Win32 / Visual C++ 8.0]
+ [Peak=2.5 Mean=1.1
-GSL Peak=6.6
+GSL Peak=6.6
-__cephes Peak=2.5 Mean=1.1]
- [Peak=11 Mean=2.2
+__cephes Peak=2.5 Mean=1.1]
+ [Peak=11 Mean=2.2
-GSL Peak=11
+GSL Peak=11
-__cephes Peak=17 Mean=2.5]
- [Peak=413 Mean=110
+__cephes Peak=17 Mean=2.5]
+ [Peak=59 Mean=10
-GSL Peak=6x10[super 11]
+GSL Peak=6x10[super 11]
__cephes Peak=2x10[super 5] ] ]
[[64] [Red Hat Linux IA64 / G++ 3.4] [Peak=7 Mean=3] [Peak=117 Mean=10] [Peak=2x10[super 4][space] Mean=6x10[super 3]] ]
@@ -96,21 +98,21 @@
]
[table Errors Rates in cyl_neumann
-[[Significand Size] [Platform and Compiler] [J[sub 0][space] and J[sub 1]] [J[sub n] (integer orders)] [J[sub v] (fractional orders)] ]
-[[53] [Win32 / Visual C++ 8.0]
- [Peak=330 Mean=54
+[[Significand Size] [Platform and Compiler] [Y[sub 0][space] and Y[sub 1]] [Y[sub n] (integer orders)] [Y[sub v] (fractional orders)] ]
+[[53] [Win32 / Visual C++ 8.0]
+ [Peak=4.7 Mean=1.7
-GSL Peak=34 Mean=9
+GSL Peak=34 Mean=9
-__cephes Peak=330 Mean=54]
- [Peak=923 Mean=83
+__cephes Peak=330 Mean=54]
+ [Peak=117 Mean=10
-GSL Peak=500 Mean=54
+GSL Peak=500 Mean=54
-__cephes Peak=923 Mean=83]
- [Peak=561 Mean=36
+__cephes Peak=923 Mean=83]
+ [Peak=800 Mean=40
-GSL Peak=1.4x10[super 6][space] Mean\=7x10[super 4][space]
+GSL Peak=1.4x10[super 6][space] Mean\=7x10[super 4][space]
__cephes Peak=+INF]]
[[64] [Red Hat Linux IA64 / G++ 3.4] [Peak=470 Mean=56] [Peak=843 Mean=51] [Peak=741 Mean=51] ]
@@ -122,8 +124,8 @@
the accuracy of the `std::sin` and `std::cos` functions.
Comparison to GSL and __cephes is interesting: both __cephes and this library optimise
-the integer order case - leading to identical results - simply using the general
-case is for the most part slightly more accurate though, as noted by the
+the integer order case - leading to identical results - simply using the general
+case is for the most part slightly more accurate though, as noted by the
better accuracy of GSL in the integer argument cases. This implementation tends to
perform much better when the arguments become large, __cephes in particular produces
some remarkably inaccurate results with some of the test data (no significant figures
@@ -157,26 +159,26 @@
both J and Y.
When /x/ is large compared to the order /v/ then the asymptotic expansions
-for large /x/ in M. Abramowitz and I.A. Stegun,
-['Handbook of Mathematical Functions] 9.2.19 are used
+for large /x/ in M. Abramowitz and I.A. Stegun,
+['Handbook of Mathematical Functions] 9.2.19 are used
(these were found to be more reliable
than those in A&S 9.2.5).
When the order /v/ is an integer the method first relates the result
to J[sub 0], J[sub 1], Y[sub 0][space] and Y[sub 1][space] using either
forwards or backwards recurrence (Miller's algorithm) depending upon which is stable.
-The values for J[sub 0], J[sub 1], Y[sub 0][space] and Y[sub 1][space] are
+The values for J[sub 0], J[sub 1], Y[sub 0][space] and Y[sub 1][space] are
calculated using the rational minimax approximations on
root-bracketing intervals for small ['|x|] and Hankel asymptotic
expansion for large ['|x|]. The coefficients are from:
-W.J. Cody, ['ALGORITHM 715: SPECFUN - A Portable FORTRAN Package of
-Special Function Routines and Test Drivers], ACM Transactions on Mathematical
-Software, vol 19, 22 (1993).
+W.J. Cody, ['ALGORITHM 715: SPECFUN - A Portable FORTRAN Package of
+Special Function Routines and Test Drivers], ACM Transactions on Mathematical
+Software, vol 19, 22 (1993).
and
-J.F. Hart et al, ['Computer Approximations], John Wiley & Sons, New York, 1968.
+J.F. Hart et al, ['Computer Approximations], John Wiley & Sons, New York, 1968.
These approximations are accurate to around 19 decimal digits: therefore
these methods are not used when type T has more than 64 binary digits.
@@ -198,7 +200,7 @@
When /x/ is small compared to /v/ and /v/ is not an integer, then the following
series approximation can be used for Y[sub v](x), this is also an area where other
-approximations are often too slow to converge to be used
+approximations are often too slow to converge to be used
(see [@http://functions.wolfram.com/03.03.06.0034.01 http://functions.wolfram.com/03.03.06.0034.01]):
[equation bessel_yv_small_z]
@@ -207,11 +209,11 @@
[equation bessel2]
-In the general case we compute J[sub v][space] and
+In the general case we compute J[sub v][space] and
Y[sub v][space] simultaneously.
To get the initial values, let
-[mu][space] = [nu] - floor([nu] + 1/2), then [mu][space] is the fractional part
+[mu][space] = [nu] - floor([nu] + 1/2), then [mu][space] is the fractional part
of [nu][space] such that
|[mu]| <= 1/2 (we need this for convergence later). The idea is to
calculate J[sub [mu]](x), J[sub [mu]+1](x), Y[sub [mu]](x), Y[sub [mu]+1](x)
@@ -231,7 +233,7 @@
The continued fractions are computed using the modified Lentz's method
(W.J. Lentz, ['Generating Bessel functions in Mie scattering calculations
-using continued fractions], Applied Optics, vol 15, 668 (1976)).
+using continued fractions], Applied Optics, vol 15, 668 (1976)).
Their convergence rates depend on ['x], therefore we need
different strategies for large ['x] and small ['x].
@@ -263,20 +265,318 @@
g[sub k][space] and h[sub k][space]
are also computed by recursions (involving gamma functions), but the
-formulas are a little complicated, readers are refered to
+formulas are a little complicated, readers are refered to
N.M. Temme, ['On the numerical evaluation of the ordinary Bessel function
of the second kind], Journal of Computational Physics, vol 21, 343 (1976).
Note Temme's series converge only for |[mu]| <= 1/2.
As the previous case, Y[sub [nu]][space] is calculated from the forward
recurrence, so is Y[sub [nu]+1]. With these two
-values and f[sub [nu]], the Wronskian yields J[sub [nu]](x) directly
+values and f[sub [nu]], the Wronskian yields J[sub [nu]](x) directly
without backward recurrence.
[endsect]
-[/
- Copyright 2006 John Maddock, Paul A. Bristow and Xiaogang Zhang.
+[section:bessel Finding Zeros of Bessel Functions of the First and Second Kinds]
+
+[h4 Synopsis]
+
+`#include <boost/math/special_functions/bessel.hpp>`
+
+Functions for obtaining both a single zero or root of the Bessel function,
+and placing multiple zeros into a container like `std::vector`
+by providing an output iterator.
+
+The signature of the single value functions are:
+
+ template <class T>
+ T cyl_bessel_j_zero(
+ T v, // Floating-point value for Jv.
+ int m); // 1-based index of zero.
+
+ template <class T>
+ T cyl_neumann_zero(
+ T v, // Floating-point value for Jv.
+ int m); // 1-based index of zero.
+
+and for multiple zeros:
+
+ template <class T, class OutputIterator>
+ OutputIterator cyl_bessel_j_zero(
+ T v, // Floating-point value for Jv.
+ int start_index, // 1-based index of first zero.
+ unsigned number_of_zeros, // How many zeros to generate.
+ OutputIterator out_it); // Destination for zeros.
+
+ template <class T, class OutputIterator>
+ OutputIterator cyl_neumann_zero(
+ T v, // Floating-point value for Jv.
+ int start_index, // 1-based index of zero.
+ unsigned number_of_zeros, // How many zeros to generate
+ OutputIterator out_it); // Destination for zeros.
+
+There are also versions which allow control of the __policy_section for error handling and precision.
+
+ template <class T>
+ T cyl_bessel_j_zero(
+ T v, // Floating-point value for Jv.
+ int m, // 1-based index of zero.
+ const Policy&); // Policy to use.
+
+ template <class T>
+ T cyl_neumann_zero(
+ T v, // Floating-point value for Jv.
+ int m, // 1-based index of zero.
+ const Policy&); // Policy to use.
+
+
+ template <class T, class OutputIterator>
+ OutputIterator cyl_bessel_j_zero(
+ T v, // Floating-point value for Jv.
+ int start_index, // 1-based index of first zero.
+ unsigned number_of_zeros, // How many zeros to generate.
+ OutputIterator out_it, // Destination for zeros.
+ const Policy& pol); // Policy to use.
+
+ template <class T, class OutputIterator>
+ OutputIterator cyl_neumann_zero(
+ T v, // Floating-point value for Jv.
+ int start_index, // 1-based index of zero.
+ unsigned number_of_zeros, // How many zeros to generate.
+ OutputIterator out_it, // Destination for zeros.
+ const Policy& pol); // Policy to use.
+
+[h4 Description]
+
+Every real order [nu] cylindrical Bessel and Neumann functions have an infinite
+number of zeros on the positive real axis. The real zeros on the positive real
+axis can be found by solving for the roots of
+
+[emquad] ['J[sub [nu]](j[sub [nu], m]) = 0]
+
+[emquad] ['Y[sub [nu]](y[sub [nu], m]) = 0]
+
+Here, ['j[sub [nu], m]] represents the ['m[super th]]
+root of the cylindrical Bessel function of order ['[nu]],
+and ['y[sub [nu], m]] represents the ['m[super th]]
+root of the cylindrical Neumann function of order ['[nu]].
+
+The zeros or roots (values of `x` where the function crosses the horizontal `y = 0` axis)
+of the Bessel and Neumann functions are computed by two functions,
+`cyl_bessel_j_zero` and `cyl_neumann_zero`.
+
+In each case the index or rank of the zero
+returned is 1-based, which is to say:
+
+ cyl_bessel_j_zero(v, 1);
+
+returns the first zero of Bessel J.
+
+Passing an `start_index <= 0` results in a `std::domain_error` being raised.
+
+For certain parameters, however, the zero'th root is defined and
+it has a value of zero. For example, the zero'th root
+of `J[sub v](x)` is defined and it has a value of zero for all
+values of `v > 0` and for negative integer values of `v = -n`.
+Similar cases are described in the implementation details below.
+
+The order `v` of `J` can be positive, negative and zero for the `cyl_bessel_j`
+and `cyl_neumann` functions, but not infinite nor NaN.
+
+[graph bessel_j_zeros]
+
+[graph neumann_y_zeros]
+
+[h4 Examples of finding Bessel and Neumann zeros]
+
+[import ../../example/bessel_zeros_example_1.cpp]
+
+[bessel_zeros_example_1]
+[bessel_zeros_example_2]
+
+[import ../../example/bessel_zeros_interator_example.cpp]
+
+[bessel_zeros_iterator_example_1]
+[bessel_zeros_iterator_example_2]
+
+[import ../../example/neumann_zeros_example_1.cpp]
+
+[neumann_zeros_example_1]
+[neumann_zeros_example_2]
+
+[import ../../example/bessel_errors_example.cpp]
+
+[bessel_errors_example_1]
+[bessel_errors_example_2]
+
+The full code (and output) for these examples is at
+[@../../../example/bessel_zeros_example_1.cpp Bessel zeros],
+[@../../../example/bessel_zeros_interator_example.cpp Bessel zeros iterator],
+[@../../../example/neumann_zeros_example_1.cpp Neumann zeros],
+[@../../../example/bessel_errors_example.cpp Bessel error messages].
+
+[h3 Implementation]
+
+Various methods are used to compute initial estimates
+for ['j[sub [nu], m]] and ['y[sub [nu], m]] ; these are described in detail below.
+
+After finding the initial estimate of a given root,
+its precision is subsequently refined to the desired level
+using Newton-Raphson iteration from Boost.Math's __root_finding_with_derivatives
+utilities combined with the functions __cyl_bessel_j and __cyl_neumann.
+
+Newton iteration requires both ['J[sub [nu]](x)] or ['Y[sub [nu]](x)]
+as well as its derivative. The derivatives of ['J[sub [nu]](x)] and ['Y[sub [nu]](x)]
+with respect to ['x] are given by __Abramowitz_Stegun.
+In particular,
+
+[emquad] ['d/[sub dx] ['J[sub [nu]](x)] = ['J[sub [nu]-1](x)] - [nu] J[sub [nu]](x)] / x
+
+[emquad] ['d/[sub dx] ['Y[sub [nu]](x)] = ['Y[sub [nu]-1](x)] - [nu] Y[sub [nu]](x)] / x
+
+Enumeration of the rank of a root (in other words the index of a root)
+begins with one and counts up, in other words
+['m,=1,2,3,[ellipsis]] The value of the first root is always greater than zero.
+
+For certain special parameters, cylindrical Bessel functions
+and cylindrical Neumann functions have a root at the origin. For example,
+['J[sub [nu]](x)] has a root at the origin for every positive order
+['[nu] > 0], and for every negative integer order
+['[nu] = -n] with ['n [isin] [negative] [super +]] and ['n [ne] 0].
+
+In addition, ['Y[sub [nu]](x)] has a root at the origin
+for every negative half-integer order ['[nu] = -n/2], with ['n [isin] [negative] [super +]] and
+and ['n [ne] 0].
+
+For these special parameter values, the origin with
+a value of ['x = 0] is provided as the ['0[super th]]
+root generated by `cyl_bessel_j_zero()`
+and `cyl_neumann_zero()`.
+
+When calculating initial estimates for the roots
+of Bessel functions, a distinction is made between
+positive order and negative order, and different
+methods are used for these. In addition, different algorithms
+are used for the first root ['m = 1] and
+for subsequent roots with higher rank ['m [ge] 2].
+Furthermore, estimates of the roots for Bessel functions
+with order above and below a cutoff at ['[nu] = 2.2]
+are calculated with different methods.
+
+Calculations of the estimates of ['j[sub [nu],1]] and ['y[sub [nu],1]]
+with ['0 [le] [nu] < 2.2] use empirically tabulated values.
+The coefficients for these have been generated by a
+computer algebra system.
+
+Calculations of the estimates of ['j[sub [nu],1]] and ['y[sub [nu],1]]
+with ['[nu][ge] 2.2] use Eqs.9.5.14 and 9.5.15 in __Abramowitz_Stegun.
+
+In particular,
+
+[emquad] ['j[sub [nu],1] [cong] [nu] + 1.85575 [nu][super [frac13]] + 1.033150 [nu][super -[frac13]] - 0.00397 [nu][super -1] - 0.0908 [nu][super -5/3] + 0.043 [nu][super -7/3] + [ellipsis]]
+
+and
+
+[emquad] ['y[sub [nu],1] [cong] [nu] + 0.93157 [nu][super [frac13]] + 0.26035 [nu][super -[frac13]] + 0.01198 [nu][super -1] - 0.0060 [nu][super -5/3] - 0.001 [nu][super -7/3] + [ellipsis]]
+
+Calculations of the estimates of ['j[sub [nu], m]] and ['y[sub [nu], m]]
+with rank ['m > 2] and ['0 [le] [nu] < 2.2] use
+McMahon's approximation, as described in M. Abramowitz and I. A. Stegan, Section 9.5 and 9.5.12.
+In particular,
+
+[emquad] ['j[sub [nu],m], y[sub [nu],m] [cong] [beta] - ([mu]-1) / 8[beta]]
+
+[emquad] [emquad] [emquad] ['- 4([mu]-1)(7[mu] - 31) / 3(8[beta])[super 3]]
+
+[emquad] [emquad] [emquad] ['-32([mu]-1)(83[mu][sup2] - 982[mu] + 3779) / 15(8[beta])[super 5]]
+
+[emquad] [emquad] [emquad] ['-64([mu]-1)(6949[mu][super 3] - 153855[mu][sup2] + 1585743[mu]- 6277237) / 105(8a)[super 7]]
+
+[emquad] [emquad] [emquad] ['- [ellipsis]] [emquad] [emquad] (5)
+
+where ['[mu] = 4[nu][super 2]] and ['[beta] = (m + [frac12][nu] - [frac14])[pi]]
+for ['j[sub [nu],m]] and
+['[beta] = (m + [frac12][nu] -[frac34])[pi] for ['y[sub [nu],m]]].
+
+Calculations of the estimates of ['j[sub [nu], m]] and ['y[sub [nu], m]]
+with ['[nu] [ge] 2.2] use
+one term in the asymptotic expansion given in
+Eq.9.5.22 and top line of Eq.9.5.26 combined with Eq. 9.3.39,
+all in __Abramowitz_Stegun explicit and easy-to-understand treatment
+for asymptotic expansion of zeros.
+The latter two equations are expressed for argument ['(x)] greater than one.
+(Olver also gives the series form of the equations in
+[@http://dlmf.nist.gov/10.21#vi [sect]10.21(vi) McMahon's Asymptotic Expansions for Large Zeros] - using slightly different variable names).
+
+In summary,
+
+[emquad] ['j[sub [nu], m] [sim] [nu]x(-[zeta]) + f[sub 1](-[zeta]/[nu])]
+
+where ['-[zeta] = [nu][super -2/3]a[sub m]] and ['a[sub m]] is
+the absolute value of the ['m[super th]] root of ['Ai(x)] on the negative real axis.
+
+Here ['x = x(-[zeta])] is the inverse of the function
+
+[emquad] ['[frac23](-[zeta])[super 3/2] = [radic](x[sup2] - 1) - cos[supminus][sup1](1/x)] [emquad] [emquad] (7)
+
+Furthermore,
+
+[emquad] ['f[sub 1](-[zeta]) = [frac12]x(-[zeta]) {h(-[zeta])}[sup2] [sdot] b[sub 0](-[zeta])]
+
+where
+
+[emquad] ['h(-[zeta]) = {4(-[zeta]) / (x[sup2] - 1)}[super 4]]
+
+and
+
+[emquad] ['b[sub 0](-[zeta]) = -5/(48[zeta][sup2]) + 1/(-[zeta])[super [frac12]] [sdot] { 5/(24(x[super 2]-1)[super 3/2]) + 1/(8(x[super 2]-1)[super [frac12])]}]
+
+When solving for ['x(-[zeta])] in Eq. 7 above,
+the right-hand-side is expanded to order 2 in
+a Taylor series for large ['x]. This results in
+
+[emquad] ['[frac23](-[zeta])[super 3/2] [approx] x + 1/2x - [pi]/2]
+
+The positive root of the resulting quadratic equation
+is used to find an initial estimate ['x(-[zeta])].
+This initial estimate is subsequently refined with
+several steps of Newton-Raphson iteration
+in Eq. 7.
+
+Estimates of the roots of cylindrical Bessel functions
+of negative order on the positive real axis are found
+using interlacing relations. For example, the ['m[super th]]
+root of the cylindrical Bessel function ['j[sub -[nu],m]]
+is bracketed by the ['m[super th]] root and the
+['(m+1)[super th]] root of the Bessel function of
+corresponding positive integer order. In other words,
+
+[emquad] ['j[sub n[nu],m]] < ['j[sub -[nu],m]] < ['j[sub n[nu],m+1]]
+
+where ['m > 1] and ['n[sub [nu]]] represents the integral
+floor of the absolute value of ['|-[nu]|].
+
+Similar bracketing relations are used to find estimates
+of the roots of Neumann functions of negative order,
+whereby a discontinuity at every negative half-integer
+order needs to be handled.
+
+Bracketing relations do not hold for the first root
+of cylindrical Bessel functions and cylindrical Neumann
+functions with negative order. Therefore, iterative algorithms
+combined with root-finding via bisection are used
+to localize ['j[sub -[nu],1]] and ['y[sub -[nu],1]].
+
+[h3 Testing]
+
+The precision of evaluation of zeros was tested at 50 decimal digits using `cpp_dec_float_50`
+and found identical with spot values computed by __WolframAlpha.
+
+[endsect] [/section:bessel Finding Zeros of Bessel Functions of the First and Second Kinds]
+
+[/
+ Copyright 2006, 2013 John Maddock, Paul A. Bristow, Xiaogang Zhang and Christopher Kormanyos.
+
Distributed under 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).
Modified: branches/release/libs/math/doc/sf_and_dist/bessel_spherical.qbk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/bessel_spherical.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/bessel_spherical.qbk 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -3,6 +3,8 @@
[h4 Synopsis]
+`#include <boost/math/special_functions/bessel.hpp>`
+
template <class T1, class T2>
``__sf_result`` sph_bessel(unsigned v, T2 x);
Modified: branches/release/libs/math/doc/sf_and_dist/common_overviews.qbk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/common_overviews.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/common_overviews.qbk 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -4,16 +4,16 @@
Policies are a powerful fine-grain mechanism that allow you to customise the
behaviour of this library according to your needs. There is more information
-available in the [link math_toolkit.policy.pol_tutorial policy tutorial]
+available in the [link math_toolkit.policy.pol_tutorial policy tutorial]
and the [link math_toolkit.policy.pol_ref policy reference].
-Generally speaking, unless you find that the
+Generally speaking, unless you find that the
[link math_toolkit.policy.pol_tutorial.policy_tut_defaults
default policy behaviour]
when encountering 'bad' argument values does not meet your needs,
you should not need to worry about policies.
-Policies are a compile-time mechanism that allow you to change
+Policies are a compile-time mechanism that allow you to change
error-handling or calculation precision either
program wide, or at the call site.
@@ -33,19 +33,19 @@
* How many iterations a special function is permitted to perform in
a series evaluation or root finding algorithm before it gives up and raises an
__evaluation_error.
-
+
You can control policies:
-* Using [link math_toolkit.policy.pol_ref.policy_defaults macros] to
+* Using [link math_toolkit.policy.pol_ref.policy_defaults macros] to
change any default policy: the is the prefered method for installation
wide policies.
-* At your chosen [link math_toolkit.policy.pol_ref.namespace_pol
-namespace scope] for distributions and/or functions: this is the
+* At your chosen [link math_toolkit.policy.pol_ref.namespace_pol
+namespace scope] for distributions and/or functions: this is the
prefered method for project, namespace, or translation unit scope
policies.
-* In an ad-hoc manner [link math_toolkit.policy.pol_tutorial.ad_hoc_sf_policies
-by passing a specific policy to a special function], or to a
-[link math_toolkit.policy.pol_tutorial.ad_hoc_dist_policies
+* In an ad-hoc manner [link math_toolkit.policy.pol_tutorial.ad_hoc_sf_policies
+by passing a specific policy to a special function], or to a
+[link math_toolkit.policy.pol_tutorial.ad_hoc_dist_policies
statistical distribution].
]
@@ -63,7 +63,7 @@
numeric libraries are implemented in C or FORTRAN. Traditionally
languages such as C or FORTRAN are perceived as easier to optimise
than more complex languages like C++, so in a sense this library
-provides a good test of current compiler technology, and the
+provides a good test of current compiler technology, and the
"abstraction penalty" - if any - of C++ compared to other languages.
The two most important things you can do to ensure the best performance
@@ -72,10 +72,10 @@
# Turn on your compilers optimisations: the difference between "release"
and "debug" builds can easily be a [link math_toolkit.perf.getting_best factor of 20].
# Pick your compiler carefully: [link math_toolkit.perf.comp_compilers
-performance differences of up to
+performance differences of up to
8 fold] have been found between some Windows compilers for example.
-The [link math_toolkit.perf performance section] contains more
+The [link math_toolkit.perf performance section] contains more
information on the performance
of this library, what you can do to fine tune it, and how this library
compares to some other open source alternatives.
@@ -84,111 +84,113 @@
[template compilers_overview[]
-This section contains some information about how various compilers
+This section contains some information about how various compilers
work with this library.
It is not comprehensive and updated experiences are always welcome.
-Some effort has been made to suppress unhelpful warnings but it is
+Some effort has been made to suppress unhelpful warnings but it is
difficult to achieve this on all systems.
[table Supported/Tested Compilers
[[Platform][Compiler][Has long double support][Notes]]
[[Windows][MSVC 7.1 and later][Yes]
[All tests OK.
-
+
We aim to keep our headers warning free at level 4 with
this compiler.]]
[[Windows][Intel 8.1 and later][Yes]
[All tests OK.
-
+
We aim to keep our headers warning free at level 4 with
this compiler. However, The tests cases tend to generate a lot of
- warnings relating to numeric underflow of the test data: these are
+ warnings relating to numeric underflow of the test data: these are
harmless.]]
[[Windows][GNU Mingw32 C++][Yes]
[All tests OK.
-
+
We aim to keep our headers warning free with -Wall with this compiler.]]
[[Windows][GNU Cygwin C++][No]
[All tests OK.
-
+
We aim to keep our headers warning free with -Wall with this compiler.
-
+
Long double support has been disabled because there are no native
long double C std library functions available.]]
[[Windows][Borland C++ 5.8.2 (Developer studio 2006)][No]
- [We have only partial compatability with this compiler:
-
+ [We have only partial compatability with this compiler:
+
Long double support has been disabled because the native
long double C standard library functions really only forward to the
double versions. This can result in unpredictable behaviour when
- using the long double overloads: for example `sqrtl` applied to a
+ using the long double overloads: for example `sqrtl` applied to a
finite value, can result in an infinite result.
-
+
Some functions still fail to compile, there are no known workarounds at present.]]
-
+[[Windows 7/Netbeans 7.2][Clang 3.1][Yes][Spot examples OK. Expect all tests to compile and run OK.]]
+
[[Linux][GNU C++ 3.4 and later][Yes]
[All tests OK.
-
+
We aim to keep our headers warning free with -Wall with this compiler.]]
+[[Linux][Clang 3.2][Yes][All tests OK.]]
[[Linux][Intel C++ 10.0 and later][Yes]
[All tests OK.
-
+
We aim to keep our headers warning free with -Wall with this compiler.
However, The tests cases tend to generate a lot of
- warnings relating to numeric underflow of the test data: these are
+ warnings relating to numeric underflow of the test data: these are
harmless.]]
[[Linux][Intel C++ 8.1 and 9.1][No]
[All tests OK.
-
+
Long double support has been disabled with these compiler releases
because calling the standard library long double math functions
can result in a segfault. The issue is Linux distribution and
glibc version specific and is Intel bug report #409291. Fully up to date
releases of Intel 9.1 (post version l_cc_c_9.1.046)
- shouldn't have this problem. If you need long
+ shouldn't have this problem. If you need long
double support with this compiler, then comment out the define of
- BOOST_MATH_NO_LONG_DOUBLE_MATH_FUNCTIONS at line 55 of
+ BOOST_MATH_NO_LONG_DOUBLE_MATH_FUNCTIONS at line 55 of
[@../../../../../boost/math/tools/config.hpp boost/math/tools/config.hpp].
-
+
We aim to keep our headers warning free with -Wall with this compiler.
However, The tests cases tend to generate a lot of
- warnings relating to numeric underflow of the test data: these are
+ warnings relating to numeric underflow of the test data: these are
harmless.]]
[[Linux][QLogic PathScale 3.0][Yes]
[Some tests involving conceptual checks fail to build, otherwise
there appear to be no issues.]]
[[Linux][Sun Studio 12][Yes]
- [Some tests involving function overload resolution fail to build,
+ [Some tests involving function overload resolution fail to build,
these issues should be rairly encountered in practice.]]
[[Solaris][Sun Studio 12][Yes]
- [Some tests involving function overload resolution fail to build,
+ [Some tests involving function overload resolution fail to build,
these issues should be rairly encountered in practice.]]
[[Solaris][GNU C++ 4.x][Yes]
[All tests OK.
-
+
We aim to keep our headers warning free with -Wall with this compiler.]]
[[HP Tru64][Compaq C++ 7.1][Yes]
[All tests OK.]]
[[HP-UX Itanium][HP aCC 6.x][Yes]
[All tests OK.
-
- Unfortunately this compiler emits quite a few warnings from libraries
+
+ Unfortunately this compiler emits quite a few warnings from libraries
upon which we depend (TR1, Array etc).]]
[[HP-UX PA-RISC][GNU C++ 3.4][No]
[All tests OK.]]
[[Apple Mac OS X, Intel][Darwin/GNU C++ 4.x][Yes][All tests OK.]]
[[Apple Mac OS X, PowerPC][Darwin/GNU C++ 4.x][No]
[All tests OK.
-
+
Long double support has been disabled on this platform due to the
rather strange nature of Darwin's 106-bit long double
implementation. It should be possible to make this work if someone
is prepared to offer assistance.]]
-[[IMB AIX][IBM xlc 5.3][Yes]
- [All tests pass except for our fpclassify tests which fail due to a
+[[Apple Mac OS X,][Clang 3.2][Yes][All tests expected to be OK.]]
+[[IBM AIX][IBM xlc 5.3][Yes]
+ [All tests pass except for our fpclassify tests which fail due to a
bug in `std::numeric_limits`, the bug effects the test code, not
- fpclassify itself. The IBM compiler group
- are aware of the problem.]]
+ fpclassify itself. The IBM compiler group are aware of the problem.]]
]
[table Unsupported Compilers
@@ -202,20 +204,20 @@
bjam mytoolset
-where "mytoolset" is the name of the
+where "mytoolset" is the name of the
[@../../../../../tools/build/index.html Boost.Build] toolset used for your
compiler. The chances are that [*many of the accuracy tests will fail
at this stage] - don't panic - the default acceptable error tolerances
are quite tight, especially for long double types with an extended
exponent range (these cause more extreme test cases to be executed
-for some functions).
+for some functions).
You will need to cast an eye over the output from
-the failing tests and make a judgement as to whether
+the failing tests and make a judgement as to whether
the error rates are acceptable or not.
]
[/ math.qbk
- Copyright 2007 John Maddock and Paul A. Bristow.
+ Copyright 2007, 2012 John Maddock and Paul A. Bristow.
Distributed under 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).
Modified: branches/release/libs/math/doc/sf_and_dist/concepts.qbk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/concepts.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/concepts.qbk 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -1,51 +1,158 @@
-[section:use_ntl Using With NTL - a High-Precision Floating-Point Library]
+[section:high_precision Using Boost.Math with High-Precision Floating-Point Libraries]
-The special functions and tools in this library can be used with
-[@http://shoup.net/ntl/doc/RR.txt NTL::RR (an arbitrary precision number type)],
-via the bindings in [@../../../../../boost/math/bindings/rr.hpp boost/math/bindings/rr.hpp].
-[@http://shoup.net/ntl/ See also NTL: A Library for doing Number Theory by
-Victor Shoup]
+The special functions, distributions, constants and tools in this library
+can be used with a number of high-precision libraries, including:
-Unfortunately `NTL::RR` doesn't quite satisfy our conceptual requirements,
-so there is a very thin wrapper class `boost::math::ntl::RR` defined in
-[@../../../../../boost/math/bindings/rr.hpp boost/math/bindings/rr.hpp] that you
-should use in place of `NTL::RR`. The class is intended to be a drop-in
-replacement for the "real" NTL::RR that adds some syntactic sugar to keep
-this library happy, plus some of the standard library functions not implemented
-in NTL.
+* __multiprecision
+* __e_float
+* __NTL
+* __GMP
+* __MPFR
+* __float128
-For those functions that are based upon the __lanczos, the bindings
-defines a series of approximations with up to 61 terms and accuracy
-up to approximately 3e-113. This therefore sets the upper limit for accuracy
-to the majority of functions defined this library when used with `NTL::RR`.
+The last four have some license restrictions;
+only __multiprecision when using the `cpp_float` backend
+can provide an unrestricted [@http://www.boost.org/LICENSE_1_0.txt Boost] license.
-There is a concept checking test program for NTL support
-[@../../../../../libs/math/test/ntl_concept_check.cpp here].
+At present, the price of a free license is slightly lower speed.
+
+Of course, the main cost of higher precision is very much decreased
+(usually at least hundred-fold) computation speed, and big increases in memory use.
+
+Some libraries offer true
+[@http://en.wikipedia.org/wiki/Arbitrary-precision_arithmetic arbitrary precision arithmetic]
+where the precision is limited only by avilable memory and compute time, but most are used
+at some arbitrarily-fixed precision, say 100 decimal digits.
+
+__multiprecision can operate in both ways, but the most popular choice is likely to be about a hundred
+decimal digits, though examples of computing tens of thousands of digits have been demonstrated.
+
+[section:why_high_precision Why use a high-precision library rather than built-in floating-point types?]
+
+For nearly all applications, the built-in floating-point types, `double`
+(and `long double` if this offers higher precision than `double`)
+offer enough precision, typically a dozen decimal digits.
+
+Some reasons why one would want to use a higher precision:
+
+* A much more precise result (many more digits) is just a requirement.
+* The range of the computed value exceeds the range of the type: factorials are the textbook example.
+* Using double is (or may be) too inaccurate.
+* Using long double (or may be) is too inaccurate.
+* Using an extended precision type implemented in software as
+[@http://en.wikipedia.org/wiki/Double-double_(arithmetic)#Double-double_arithmetic double-double]
+([@http://en.wikipedia.org/wiki/Darwin_(operating_system) Darwin]) is sometimes unpredictably inaccurate.
+* Loss of precision or inaccuracy caused by extreme arguments or cancellation error.
+* An accuracy as good as possible for a chosen built-in floating-point type is required.
+* As a reference value, for example, to determine the inaccuracy
+of a value computed with a built-in floating point type,
+(perhaps even using some quick'n'dirty algorithm).
+The accuracy of many functions and distributions in Boost.Math has been measured in this way
+from tables of very high precision (up to 1000 decimal digits).
+
+Many functions and distributions have differences from exact values
+that are only a few least significant bits - computation noise.
+Others, often those for which analytical solutions are not available,
+require approximations and iteration:
+these may lose several decimal digits of precision.
+
+Much larger loss of precision can occur for [@http://en.wikipedia.org/wiki/Boundary_case boundary]
+or [@http://en.wikipedia.org/wiki/Corner_case corner cases],
+often caused by [@http://en.wikipedia.org/wiki/Loss_of_significance cancellation errors].
+
+(Some of the worst and most common examples of
+[@http://en.wikipedia.org/wiki/Loss_of_significance cancellation error or loss of significance]
+can be avoided by using __complements: see __why_complements).
+
+If you require a value which is as accurate as can be represented in the floating-point type,
+and is thus the closest representable value and has an error less than 1/2 a
+[@http://en.wikipedia.org/wiki/Least_significant_bit least significant bit] or
+[@http://en.wikipedia.org/wiki/Unit_in_the_last_place ulp]
+it may be useful to use a higher-precision type,
+for example, `cpp_dec_float_50`, to generate this value.
+Conversion of this value to a built-in floating-point type ('float', `double` or `long double`)
+will not cause any further loss of precision.
+A decimal digit string will also be 'read' precisely by the compiler
+into a built-in floating-point type to the nearest representable value.
+
+[note In contrast, reading a value from an `std::istream` into a built-in floating-point type
+is [*not guaranteed] by the C++ Standard to give the nearest representable value.]
+
+William Kahan coined the term
+[@http://en.wikipedia.org/wiki/Rounding#The_table-maker.27s_dilemma Table-Maker's Dilemma]
+for the problem of correctly rounding functions.
+Using a much higher precision (50 or 100 decimal digits)
+is a practical way of generating (almost always) correctly rounded values.
+
+[endsect] [/section:why_high_precision Why use a high-precision library rather than built-in floating-point types?]
+
+[section:use_multiprecision Using Boost.Multiprecision]
+
+[*All new projects are recommended to use __multiprecision.]
+
+[import ../../example/big_seventh.cpp]
+
+[big_seventh_example_1]
+
+[import ../../example/fft_sines_table.cpp]
+
+[fft_sines_table_example_1]
+
+The table output is:
+
+[fft_sines_table_example_output]
+
+[fft_sines_table_example_check]
+
+
+[/TODO another example needed here]
+
+[/import ../../example/ibeta_mp_example.cpp]
+
+[/ibeta_mp_example_1]
+
+[/The program output is:]
+
+[/ibeta_mp_output_1]
+
+[endsect] [/section:use_multiprecision Using Boost.Multiprecision]
+
+[section:float128 Using with GCC's __float128 datatype]
+
+At present support for GCC's native `__float128` datatype is extremely limited: the numeric constants
+will all work with that type, and that's about it. If you want to use the distributions or special
+functions then you will need to provide your own wrapper header that:
-[endsect][/section:use_ntl Using With NTL - a High Precision Floating-Point Library]
+* Provides std::numeric_limits<__float128> support.
+* Provides overloads of the standard library math function for type __float128 and which forward to the libquadmath equivalents.
-[section:use_mpfr Using With MPFR / GMP - a High-Precision Floating-Point Library]
+Ultimately these facilities should be provided by GCC and libstdc++.
+
+[endsect]
+
+[section:use_mpfr Using With MPFR or GMP - High-Precision Floating-Point Library]
The special functions and tools in this library can be used with
-[@http://www.mpfr.org MPFR (an arbitrary precision number type based on the GMP library)],
+[@http://www.mpfr.org MPFR] (an arbitrary precision number type based on the __GMP),
either via the bindings in [@../../../../../boost/math/bindings/mpfr.hpp boost/math/bindings/mpfr.hpp],
or via [@../../../../../boost/math/bindings/mpfr.hpp boost/math/bindings/mpreal.hpp].
-In order to use these binings you will need to have installed [@http://www.mpfr.org MPFR]
+[*New projects are recommended to use __multiprecision with GMP/MPFR backend instead.]
+
+In order to use these bindings you will need to have installed [@http://www.mpfr.org MPFR]
plus its dependency the [@http://gmplib.org GMP library]. You will also need one of the
-two supported C++ wrappers for MPFR: [@http://math.berkeley.edu/~wilken/code/gmpfrxx/ gmpfrxx (or mpfr_class)],
+two supported C++ wrappers for MPFR:
+[@http://math.berkeley.edu/~wilken/code/gmpfrxx/ gmpfrxx (or mpfr_class)],
or [@http://www.holoborodko.com/pavel/mpfr/ mpfr-C++ (mpreal)].
Unfortunately neither `mpfr_class` nor `mpreal` quite satisfy our conceptual requirements,
so there is a very thin set of additional interfaces and some helper traits defined in
[@../../../../../boost/math/bindings/mpfr.hpp boost/math/bindings/mpfr.hpp] and
[@../../../../../boost/math/bindings/mpreal.hpp boost/math/bindings/mpreal.hpp]
-that you
-should use in place of including 'gmpfrxx.h' or 'mpreal.h' directly. The classes
-`mpfr_class` or `mpreal` are
-then usable unchanged once this header is included, so for example `mpfr_class`'s
-performance-enhancing
-expression templates are preserved and fully supported by this library:
+that you should use in place of including 'gmpfrxx.h' or 'mpreal.h' directly.
+The classes `mpfr_class` or `mpreal` are
+then usable unchanged once this header is included, so for example `mpfr_class`'s
+performance-enhancing expression templates are preserved and fully supported by this library:
#include <boost/math/bindings/mpfr.hpp>
#include <boost/math/special_functions/gamma.hpp>
@@ -54,15 +161,15 @@
{
mpfr_class::set_dprec(500); // 500 bit precision
//
- // Note that the argument to tgamma is an expression template,
- // that's just fine here:
+ // Note that the argument to tgamma is
+ // an expression template - that's just fine here.
//
mpfr_class v = boost::math::tgamma(sqrt(mpfr_class(2)));
std::cout << std::setprecision(50) << v << std::endl;
}
Alternatively use with `mpreal` would look like:
-
+
#include <boost/math/bindings/mpreal.hpp>
#include <boost/math/special_functions/gamma.hpp>
@@ -78,39 +185,99 @@
up to approximately 3e-113. This therefore sets the upper limit for accuracy
to the majority of functions defined this library when used with either `mpfr_class` or `mpreal`.
-There is a concept checking test program for mpfr support
+There is a concept checking test program for mpfr support
[@../../../../../libs/math/test/mpfr_concept_check.cpp here] and
[@../../../../../libs/math/test/mpreal_concept_check.cpp here].
-[endsect][/section:use_mpfr Using With MPFR / GMP - a High-Precision Floating-Point Library]
+[endsect] [/section:use_mpfr Using With MPFR / GMP - a High-Precision Floating-Point Library]
+
+[section:e_float Using e_float Library]
-[section:e_float e_float Support]
+__multiprecision was a development from the __e_float library by Christopher Kormanyos.
-This library can be used with [@http://calgo.acm.org/910.zip e_float (TOMS Algorithm 910)] via the header:
+e_float can still be used with Boost.Math library via the header:
<boost/math/bindings/e_float.hpp>
-And the type `boost::math::ef::e_float`: this type is a thin wrapper class around ::e_float which provides the necessary
+And the type `boost::math::ef::e_float`:
+this type is a thin wrapper class around ::e_float which provides the necessary
syntactic sugar to make everything "just work".
There is also a concept checking test program for e_float support
[@../../../../../libs/math/test/e_float_concept_check.cpp here].
+[*New projects are recommended to use __multiprecision with `cpp_float` backend instead.]
+
+[endsect] [/section:e_float Using e_float Library]
+
+[section:use_ntl Using NTL Library]
+
+[@http://shoup.net/ntl/doc/RR.txt NTL::RR]
+(an arbitrarily-fixed precision floating-point number type),
+can be used via the bindings in
+[@../../../../../boost/math/bindings/rr.hpp boost/math/bindings/rr.hpp].
+For details, see [@http://shoup.net/ntl/ NTL: A Library for doing Number Theory by
+Victor Shoup].
+
+[*New projects are recommended to use __multiprecision instead.]
+
+Unfortunately `NTL::RR` doesn't quite satisfy our conceptual requirements,
+so there is a very thin wrapper class `boost::math::ntl::RR` defined in
+[@../../../../../boost/math/bindings/rr.hpp boost/math/bindings/rr.hpp] that you
+should use in place of `NTL::RR`. The class is intended to be a drop-in
+replacement for the "real" NTL::RR that adds some syntactic sugar to keep
+this library happy, plus some of the standard library functions not implemented
+in NTL.
+
+For those functions that are based upon the __lanczos, the bindings
+defines a series of approximations with up to 61 terms and accuracy
+up to approximately 3e-113. This therefore sets the upper limit for accuracy
+to the majority of functions defined this library when used with `NTL::RR`.
+
+There is a concept checking test program for NTL support
+[@../../../../../libs/math/test/ntl_concept_check.cpp here].
+
+
+[endsect] [/section:use_ntl Using With NTL - a High-Precision Floating-Point Library]
+
+[section:using_test Using without expression templates for Boost.Test and others]
+
+As noted in the __multiprecision documentation, certain program constructs will not compile
+when using expression templates. One example that many users may encounter
+is Boost.Test (1.54 and earlier) when using macro BOOST_CHECK_CLOSE and BOOST_CHECK_CLOSE_FRACTION.
+
+If, for example, you wish to use any multiprecision type like `cpp_dec_float_50`
+in place of `double` to give more precision,
+you will need to override the default `boost::multiprecision::et_on` with
+`boost::multiprecision::et_off`.
+
+[import ../../example/test_cpp_float_close_fraction.cpp]
+
+[expression_template_1]
+
+A full example code is at [@../../../example/test_cpp_float_close_fraction.cpp test_cpp_float_close_fraction.cpp]
+
+[endsect] [/section:using_test Using without expression templates for Boost.Test and others]
+
+[endsect] [/section:high_precision Using With High-Precision Floating-Point Libraries]
-[endsect]
[section:concepts Conceptual Requirements for Real Number Types]
The functions, and statistical distributions in this library can be used with
any type /RealType/ that meets the conceptual requirements given below. All
-the built in floating point types will meet these requirements.
-User defined types that meet the requirements can also be used. For example,
-with [link math_toolkit.using_udt.use_ntl a thin wrapper class] one of the types
-provided with [@http://shoup.net/ntl/ NTL (RR)] can be used. Submissions
-of binding to other extended precision types would also be most welcome!
+the built-in floating-point types will meet these requirements.
+User-defined types that meet the requirements can also be used.
+
+For example, with [link math_toolkit.using_udt.high_precision.use_ntl a thin wrapper class]
+one of the types provided with [@http://shoup.net/ntl/ NTL (RR)] can be used.
+But now that __multiprecision library is available,
+this has become the reference real number type.
-The guiding principal behind these requirements, is that a /RealType/
-behaves just like a built in floating point type.
+Submissions of binding to other extended precision types would also still be welcome.
+
+The guiding principal behind these requirements is that a /RealType/
+behaves just like a built-in floating-point type.
[h4 Basic Arithmetic Requirements]
@@ -185,11 +352,11 @@
Note that:
-# The functions `log_max_value` and `log_min_value` can be
+# The functions `log_max_value` and `log_min_value` can be
synthesised from the others, and so no explicit specialisation is required.
# The function `epsilon` can be synthesised from the others, so no
explicit specialisation is required provided the precision
-of RealType does not vary at runtime (see the header
+of RealType does not vary at runtime (see the header
[@../../../../../boost/math/bindings/rr.hpp boost/math/bindings/rr.hpp]
for an example where the precision does vary at runtime).
# The functions `digits`, `max_value` and `min_value`, all get synthesised
@@ -197,7 +364,7 @@
is not specialised for type RealType, then you will get a compiler error
when code tries to use these functions, /unless/ you explicitly specialise them.
For example if the precision of RealType varies at runtime, then
-`numeric_limits` support may not be appropriate, see
+`numeric_limits` support may not be appropriate, see
[@../../../../../boost/math/bindings/rr.hpp boost/math/bindings/rr.hpp] for examples.
[warning
@@ -214,7 +381,7 @@
Although it might seem obvious that RealType should require `std::numeric_limits`
to be specialized, this is not sensible for
-`NTL::RR` and similar classes where the number of digits is a runtime
+`NTL::RR` and similar classes where the number of digits is a runtime
parameter (where as for `numeric_limits` it has to be fixed at compile time).
]
@@ -227,7 +394,7 @@
doubt whether a user defined type has enough standard library
support to be useable the best advise is to try it and see!
-In the following table /r/ is an object of type `RealType`,
+In the following table /r/ is an object of type `RealType`,
/cr1/ and /cr2/ are objects of type `const RealType`, and
/i/ is an object of type `int`.
@@ -256,7 +423,7 @@
]
Note that the table above lists only those standard library functions known to
-be used (or likely to be used in the near future) by this library.
+be used (or likely to be used in the near future) by this library.
The following functions: `acos`, `atan2`, `fmod`, `cosh`, `sinh`, `tanh`, `log10`,
`lround`, `llround`, `ltrunc`, `lltrunc` and `modf`
are not currently used, but may be if further special functions are added.
@@ -264,26 +431,26 @@
Note that the `round`, `trunc` and `modf` functions are not part of the
current C++ standard: they are part of the additions added to C99 which will
likely be in the next C++ standard. There are Boost versions of these provided
-as a backup, and the functions are always called unqualified so that
+as a backup, and the functions are always called unqualified so that
argument-dependent-lookup can take place.
In addition, for efficient and accurate results, a __lanczos is highly desirable.
-You may be able to adapt an existing approximation from
+You may be able to adapt an existing approximation from
[@../../../../../boost/math/special_functions/lanczos.hpp
boost/math/special_functions/lanczos.hpp] or
-[@../../../../../boost/math/bindings/detail/big_lanczos.hpp
-boost/math/bindings/detail/big_lanczos.hpp]:
+[@../../../../../boost/math/bindings/detail/big_lanczos.hpp
+boost/math/bindings/detail/big_lanczos.hpp]:
in the former case you will need change
-static_cast's to lexical_cast's, and the constants to /strings/
+static_cast's to lexical_cast's, and the constants to /strings/
(in order to ensure the coefficients aren't truncated to long double)
-and then specialise `lanczos_traits` for type T. Otherwise you may have to hack
-[@../../../tools/lanczos_generator.cpp
+and then specialise `lanczos_traits` for type T. Otherwise you may have to hack
+[@../../../tools/lanczos_generator.cpp
libs/math/tools/lanczos_generator.cpp] to find a suitable
approximation for your RealType. The code will still compile if you don't do
this, but both accuracy and efficiency will be greatly compromised in any
function that makes use of the gamma\/beta\/erf family of functions.
-[endsect]
+[endsect] [/section: ]
[section:dist_concept Conceptual Requirements for Distribution Types]
@@ -291,12 +458,12 @@
requirements, and encapsulates a statistical distribution.
Please note that this documentation should not be used as a substitute
-for the
-[link math_toolkit.dist.dist_ref reference documentation], and
+for the
+[link math_toolkit.dist.dist_ref reference documentation], and
[link math_toolkit.dist.stat_tut tutorial] of the statistical
distributions.
-In the following table, /d/ is an object of type `DistributionType`,
+In the following table, /d/ is an object of type `DistributionType`,
/cd/ is an object of type `const DistributionType` and /cr/ is an
object of a type convertible to `RealType`.
@@ -311,7 +478,7 @@
[[pdf(cd, cr)][RealType][Returns the PDF of the distribution.]]
[[cdf(cd, cr)][RealType][Returns the CDF of the distribution.]]
[[cdf(complement(cd, cr))][RealType]
- [Returns the complement of the CDF of the distribution,
+ [Returns the complement of the CDF of the distribution,
the same as: `1-cdf(cd, cr)`]]
[[quantile(cd, cr)][RealType][Returns the quantile (or percentile) of the distribution.]]
[[quantile(complement(cd, cr))][RealType]
@@ -355,7 +522,7 @@
The main purpose in providing this type is to verify
that standard library functions are found via a using declaration -
-bringing those functions into the current scope -
+bringing those functions into the current scope -
and not just because they happen to be in global scope.
In order to ensure that a call to say `pow` can be found
@@ -366,28 +533,28 @@
to easy to forget the `using` declaration, and call the double version of
the function that happens to be in the global scope by mistake.
-For example if the code calls ::pow rather than std::pow,
+For example if the code calls ::pow rather than std::pow,
the code will cleanly compile, but truncation of long doubles to
double will cause a significant loss of precision.
In contrast a template instantiated with std_real_concept will *only*
-compile if the all the standard library functions used have
+compile if the all the standard library functions used have
been brought into the current scope with a using declaration.
[h6 Testing the real concept]
-There is a test program
+There is a test program
[@../../../test/std_real_concept_check.cpp libs/math/test/std_real_concept_check.cpp]
that instantiates every template in this library with type
`std_real_concept` to verify its usage of standard library functions.
``#include <boost/math/concepts/real_concept.hpp>``
- namespace boost{
- namespace math{
+ namespace boost{
+ namespace math{
namespace concepts{
-
+
class real_concept;
-
+
}}} // namespaces
`real_concept` is an archetype for
@@ -403,7 +570,7 @@
NTL RR is an example of a type meeting the requirements that this type
models, but note that use of a thin wrapper class is required: refer to
-[link math_toolkit.using_udt.use_ntl "Using With NTL - a High-Precision Floating-Point Library"].
+[linkmath_toolkit.using_udt.high_precision.use_ntl "Using With NTL - a High-Precision Floating-Point Library"].
There is no specific test case for type `real_concept`, instead, since this
type is usable at runtime, each individual test case as well as testing
@@ -419,47 +586,47 @@
namespace math{
namespace concepts
{
- template <class RealType>
- class distribution_archetype;
+ template <class RealType>
+ class distribution_archetype;
+
+ template <class Distribution>
+ struct DistributionConcept;
- template <class Distribution>
- struct DistributionConcept;
-
}}} // namespaces
-
+
The class template `distribution_archetype` is a model of the
[link math_toolkit.using_udt.dist_concept Distribution concept].
-The class template `DistributionConcept` is a
-[@../../../../../libs/concept_check/index.html concept checking class]
+The class template `DistributionConcept` is a
+[@../../../../../libs/concept_check/index.html concept checking class]
for distribution types.
[h6 Testing the distribution concept]
-The test program
+The test program
[@../../../test/compile_test/distribution_concept_check.cpp distribution_concept_check.cpp]
is responsible for using `DistributionConcept` to verify that all the
-distributions in this library conform to the
+distributions in this library conform to the
[link math_toolkit.using_udt.dist_concept Distribution concept].
-The class template `DistributionConcept` verifies the existence
+The class template `DistributionConcept` verifies the existence
(but not proper function) of the non-member accessors
required by the [link math_toolkit.using_udt.dist_concept Distribution concept].
These are checked by calls like
v = pdf(dist, x); // (Result v is ignored).
-And in addition, those that accept two arguments do the right thing when the
-arguments are of different types (the result type is always the same as the
-distribution's value_type). (This is implemented by some additional
-forwarding-functions in derived_accessors.hpp, so that there is no need for
-any code changes. Likewise boilerplate versions of the
-hazard\/chf\/coefficient_of_variation functions are implemented in
+And in addition, those that accept two arguments do the right thing when the
+arguments are of different types (the result type is always the same as the
+distribution's value_type). (This is implemented by some additional
+forwarding-functions in derived_accessors.hpp, so that there is no need for
+any code changes. Likewise boilerplate versions of the
+hazard\/chf\/coefficient_of_variation functions are implemented in
there too.)
[endsect] [/section:archetypes Conceptual Archetypes for Reals and Distributions]
-[/
- Copyright 2006, 2010 John Maddock and Paul A. Bristow.
+[/
+ Copyright 2006, 2010, 2012 John Maddock and Paul A. Bristow.
Distributed under 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).
Modified: branches/release/libs/math/doc/sf_and_dist/constants.qbk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/constants.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/constants.qbk 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -12,20 +12,23 @@
* Effortless - avoiding a search of reference sources.
* Usable with both builtin floating point types, and user-defined, possibly extended precision, types such as
NTL, MPFR/GMP, mp_float: in the latter case the constants are computed to the necessary precision and then cached.
-* Accurate - ensuring that the values are as accurate as possible for the
-chosen floating-point type
+* Accurate - ensuring that the values are as accurate as possible for the
+chosen floating-point type
* No loss of accuracy from repeated rounding of intermediate computations.
* Result is computed with higher precision and only rounded once.
* Less risk of inaccurate result from functions pow, trig and log at [@http://en.wikipedia.org/wiki/Corner_case corner cases].
- * Less risk of [@http://docs.oracle.com/cd/E19957-01/806-3568/ncg_goldberg.html cancellation error].
-* Faster - can avoid (re-)calculation at runtime. This can be significant if:
- * Functions pow, trig or log are used.
- * Inside an inner loop.
- * Using a high-precision UDT.
- * Compiler optimizations possible with built-in types, especially `double`, are not available.
+ * Less risk of [@http://docs.oracle.com/cd/E19957-01/806-3568/ncg_goldberg.html cancellation error].
* Portable - as possible between different systems using different floating-point precisions:
see [link math_toolkit.constants.tutorial.templ use in template code].
* Tested - by comparison with other published sources, or separately computed at long double precision.
+* Faster - can avoid (re-)calculation at runtime.
+ * If the value returned is a builtin type then it's returned by value as a `constexpr` (C++11 feature, if available).
+ * If the value is computed and cached (or constructed from a string representation and cached), then it's returned by constant reference.[br]
+This can be significant if:
+ * Functions pow, trig or log are used.
+ * Inside an inner loop.
+ * Using a high-precision UDT like __multiprecision.
+ * Compiler optimizations possible with built-in types, especially `double`, are not available.
[endsect] [/section:intro Introduction]
@@ -66,7 +69,7 @@
Some examples of using constants are at [@../../../example/constants_eg1.cpp constants_eg1].
[endsect]
-
+
[section:templ Use in template code]
When using the constants inside a function template, we need to ensure that
@@ -137,7 +140,9 @@
[endsect] [/section:templ Use in template code]
-[section:user_def Use With User Defined Types]
+[section:user_def Use With User-Defined Types]
+
+The most common example of a high-precision user-defined type will probably be __multiprecision.
The syntax for using the function-call constants with user-defined types is the same
as it is in the template class, which is to say we use:
@@ -146,8 +151,14 @@
boost::math::constants::pi<UserDefinedType>();
+For example:
+
+ boost::math::constants::pi<boost::multiprecision::cpp_dec_float_50>();
+
+giving [pi] with a precision of 50 decimal digits.
+
However, since the precision of the user-defined type may be much greater than that
-of the built-in floating pointer types, how the value returned is created is as follows:
+of the built-in floating point types, how the value returned is created is as follows:
* If the precision of the type is known at compile time:
* If the precision is less than or equal to that of a `float` and the type is constructable from a `float`
@@ -159,9 +170,15 @@
* If the precision is less than or equal to that of a `long double` and the type is constructable from a `long double`
then our code returns a `long double` literal. If the user-defined type is a literal type
then the function call that returns the constant will be a `constexp`.
- * If the precision is less than 100 decimal digits, then the constant will be constructed
+ * If the precision is less than or equal to that of a `__float128` (and the compiler supports such a type)
+ and the type is constructable from a `__float128`
+ then our code returns a `__float128` literal. If the user-defined type is a literal type
+ then the function call that returns the constant will be a `constexp`.
+ * If the precision is less than 100 decimal digits, then the constant will be constructed
(just the once, then cached in a thread-safe manner) from a string representation of the constant.
+ In this case the value is returned as a const reference to the cached value.
* Otherwise the value is computed (just once, then cached in a thread-safe manner).
+ In this case the value is returned as a const reference to the cached value.
* If the precision is unknown at compile time then:
* If the runtime precision (obtained from a call to `boost::math::tools::digits<T>()`) is
less than 100 decimal digits, then the constant is constructed "on the fly" from the string
@@ -322,7 +339,7 @@
[[[*Euler's e and related]] [] [] [] ]
[[e] [e] [2.71828] [[@http://en.wikipedia.org/wiki/E_(mathematical_constant) Euler's constant e]] ]
[[exp_minus_half] [e [super -1/2]] [0.606530] [] ]
-[[e_pow_pi] [e [super [pi]]] [23.14069] [] ]
+[[e_pow_pi] [e [super [pi]]] [23.14069] [] ]
[[root_e] [[radic] e] [1.64872] [] ]
[[log10_e] [log10(e)] [0.434294] [] ]
[[one_div_log10_e] [1/log10(e)] [2.30258] [] ]
@@ -391,7 +408,7 @@
}
}}}} // namespaces
-
+
Then define a placeholder for the constant itself:
namespace boost{ namespace math{ namespace constants{
@@ -404,7 +421,7 @@
For example, to calculate [pi]/2, add to `boost/math/constants/calculate_constants.hpp`
template <class T>
- template<int N>
+ template<int N>
inline T constant_half_pi<T>::compute(BOOST_MATH_EXPLICIT_TEMPLATE_TYPE_SPEC(mpl::int_<N>))
{
BOOST_MATH_STD_USING
@@ -416,12 +433,12 @@
BOOST_DEFINE_MATH_CONSTANT(half_pi, 0.0, "0"); // Actual values are temporary, we'll replace them later.
[note Previously defined constants like pi and e can be used, but by *not simply calling* `pi<T>()`;
-specifying the precision via the policy
+specifying the precision via the policy
`pi<T, policies::policy<policies::digits2<N> > >()`
is essential to ensure full accuracy.]
[warning Newly defined constants can only be used once they are included in
-`boost/math/constants/constants.hpp`. So if you add
+`boost/math/constants/constants.hpp`. So if you add
`template <class T, class N> T constant_my_constant{...}`,
then you cannot define `constant_my_constant`
until you add the temporary `BOOST_DEFINE_MATH_CONSTANT(my_constant, 0.0, "0")`.
@@ -486,7 +503,7 @@
* Expensive to compute.
* Requested by users.
* [@http://en.wikipedia.org/wiki/Mathematical_constant Used in science and mathematics.]
-* No integer values (because so cheap to construct).[br]
+* No integer values (because so cheap to construct).[br]
(You can easily define your own if found convenient, for example: `FPT one =static_cast<FPT>(42);`).
[h4 How are constants named?]
@@ -495,7 +512,7 @@
* No CamelCase.
* Underscore as _ delimiter between words.
* Numbers spelt as words rather than decimal digits (except following pow).
-* Abbreviation conventions:
+* Abbreviation conventions:
* root for square root.
* cbrt for cube root.
* pow for pow function using decimal digits like pow23 for n[super 2/3].
@@ -525,7 +542,7 @@
with at least 35 decimal digits, enough to be accurate for all long double implementations.
The tolerance is usually twice `long double epsilon`.
-# Comparison with calculation at long double precision.
+# Comparison with calculation at long double precision.
This often requires a slightly higher tolerance than two epsilon
because of computational noise from round-off etc,
especially when trig and other functions are called.
@@ -563,11 +580,11 @@
[h4 What is the Internal Format of the constants, and why?]
See [link math_toolkit.constants.tutorial tutorial] above for normal use,
-but this FAQ explains the internal details used for the constants.
+but this FAQ explains the internal details used for the constants.
Constants are stored as 100 decimal digit values.
However, some compilers do not accept decimal digits strings as long as this.
-So the constant is split into two parts, with the first containing at least
+So the constant is split into two parts, with the first containing at least
128-bit long double precision (35 decimal digits),
and for consistency should be in scientific format with a signed exponent.
@@ -603,7 +620,7 @@
This work is based on an earlier work called e-float:
Algorithm 910: A Portable C++ Multiple-Precision System for Special-Function Calculations,
-in ACM TOMS, {VOL 37, ISSUE 4, (February 2011)} (C) ACM, 2011.
+in ACM TOMS, {VOL 37, ISSUE 4, (February 2011)} (C) ACM, 2011.
[@http://doi.acm.org/10.1145/1916461.1916469]
[@https://svn.boost.org/svn/boost/sandbox/e_float/ e_float]
but is now re-factored and available under the Boost license in the Boost-sandbox at
@@ -642,6 +659,8 @@
[note The precision of all `doubledouble` floating-point types is rather odd and values given are only approximate.]
+[*New projects should use __multiprecision.]
+
[h5 NTL class RR]
Arbitrary precision floating point with NTL class RR,
@@ -649,9 +668,11 @@
used here with 300 bit to output 100 decimal digits,
enough for many practical non-'number-theoretic' C++ applications.
-NTL is [*not licenced for commercial use].
+__NTL is [*not licenced for commercial use].
-This class is used in Boost.Math and an option when using big_number projects to calculate new math constants.
+This class is used in Boost.Math and is an option when using big_number projects to calculate new math constants.
+
+[*New projects should use __multiprecision.]
[h5 GMP and MPFR]
@@ -672,6 +693,7 @@
but combined with template struct and functions to allow simultaneous use
with other non-built-in floating-point types.
+
[h4 Why do the constants (internally) have a struct rather than a simple function?]
A function mechanism was provided by in previous versions of Boost.Math.
@@ -688,7 +710,7 @@
D. E. Knuth, Art of Computer Programming, Appendix A, Table 1, Vol 1, ISBN 0 201 89683 4 (1997)
# M. Abrahamovitz & I. E. Stegun, National Bureau of Standards, Handbook of Mathematical Functions,
a reference source for formulae now superceded by
-# Frank W. Olver, Daniel W. Lozier, Ronald F. Boisvert, Charles W. Clark, NIST Handbook of Mathemetical Functions, Cambridge University Press, ISBN 978-0-521-14063-8, 2010.
+# Frank W. Olver, Daniel W. Lozier, Ronald F. Boisvert, Charles W. Clark, NIST Handbook of Mathemetical Functions, Cambridge University Press, ISBN 978-0-521-14063-8, 2010.
# John F Hart, Computer Approximations, Kreiger (1978) ISBN 0 88275 642 7.
# Some values from Cephes Mathematical Library, Stephen L. Moshier
and CALC100 100 decimal digit Complex Variable Calculator Program, a DOS utility.
@@ -698,7 +720,7 @@
Not here in this Boost.Math collection, because physical constants:
-* Are measurements.
+* Are measurements, not truely constants.
* Are not truly constant and keeping changing as mensuration technology improves.
* Have a instrinsic uncertainty.
* Mathematical constants are stored and represented at varying precision, but should never be inaccurate.
@@ -709,7 +731,7 @@
[endsect] [/section:constants Mathematical Constants]
-[/
+[/
Copyright 2012 John Maddock and Paul A. Bristow.
Distributed under the Boost Software License, Version 1.0.
(See accompanying file LICENSE_1_0.txt or copy at
Modified: branches/release/libs/math/doc/sf_and_dist/credits.qbk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/credits.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/credits.qbk 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -81,7 +81,7 @@
Thanks to Mark Coleman and Georgi Boshnakov for spot test values
from __Mathematica, and of course,
-to Eric Weissten for nurturing __Mathworld, an invaluable resource.
+to Eric Weisstein for nurturing __Mathworld, an invaluable resource.
The Skew-normal distribution and Owen's t function were written by Benjamin Sobotta.
@@ -90,10 +90,20 @@
and contributing to some long discussions about how to improve accuracy
for large non-centrality and/or large degrees of freedom.
+Christopher Kormanyos wrote the e_float multiprecision library __TOMS910
+which formed the basis for the Boost.Multiprecision library
+which now can be used to allow most functions and distributions
+to be computed up to a precision of the users' choice,
+no longer restricted to built-in floating-point types like double.
+(And thanks to Topher Cooper for bring Christopher's e_float to our attention).
+
+Christopher Kormanyos wrote some examples for using __multiprecision,
+and added methods for finding zeros of Bessel Functions.
+
[endsect] [/section:credits Credits and Acknowledgements]
[/
- Copyright 2006, 2007, 2008, 2009, 2010, 2012 John Maddock and Paul A. Bristow.
+ Copyright 2006, 2007, 2008, 2009, 2010, 2012, 2013 John Maddock and Paul A. Bristow.
Distributed under 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).
Modified: branches/release/libs/math/doc/sf_and_dist/distributions/distribution_construction.qbk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/distributions/distribution_construction.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/distributions/distribution_construction.qbk 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -1,15 +1,15 @@
-[section:dist_construct_eg Distribution Construction Example]
-
-See [@../../../example/distribution_construction.cpp distribution_construction.cpp] for full source code.
+[section:dist_construct_eg Distribution Construction Examples]
[import ../../../example/distribution_construction.cpp]
-[distribution_construction1]
-[distribution_construction2]
+[distribution_construction_1]
+[distribution_construction_2]
+
+See [@../../../example/distribution_construction.cpp distribution_construction.cpp] for full source code.
-[endsect] [/section:dist_construct_eg Distribution Construction Example]
+[endsect] [/section:dist_construct_eg Distribution Construction Examples]
-[/
- Copyright 2006 John Maddock and Paul A. Bristow.
+[/
+ Copyright 2006, 2012 John Maddock and Paul A. Bristow.
Distributed under 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).
Modified: branches/release/libs/math/doc/sf_and_dist/distributions/negative_binomial.qbk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/distributions/negative_binomial.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/distributions/negative_binomial.qbk 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -2,14 +2,14 @@
``#include <boost/math/distributions/negative_binomial.hpp>``
- namespace boost{ namespace math{
-
- template <class RealType = double,
+ namespace boost{ namespace math{
+
+ template <class RealType = double,
class ``__Policy`` = ``__policy_class`` >
class negative_binomial_distribution;
-
+
typedef negative_binomial_distribution<> negative_binomial;
-
+
template <class RealType, class ``__Policy``>
class negative_binomial_distribution
{
@@ -18,21 +18,21 @@
typedef Policy policy_type;
// Constructor from successes and success_fraction:
negative_binomial_distribution(RealType r, RealType p);
-
+
// Parameter accessors:
RealType success_fraction() const;
RealType successes() const;
-
+
// Bounds on success fraction:
static RealType find_lower_bound_on_p(
- RealType trials,
+ RealType trials,
RealType successes,
RealType probability); // alpha
static RealType find_upper_bound_on_p(
- RealType trials,
+ RealType trials,
RealType successes,
RealType probability); // alpha
-
+
// Estimate min/max number of trials:
static RealType find_minimum_number_of_trials(
RealType k, // Number of failures.
@@ -43,9 +43,9 @@
RealType p, // Success fraction.
RealType probability); // Probability threshold alpha.
};
-
+
}} // namespaces
-
+
The class type `negative_binomial_distribution` represents a
[@http://en.wikipedia.org/wiki/Negative_binomial_distribution negative_binomial distribution]:
it is used when there are exactly two mutually exclusive outcomes of a
@@ -53,9 +53,9 @@
these outcomes are labelled "success" and "failure".
For k + r Bernoulli trials each with success fraction p, the
-negative_binomial distribution gives the probability of observing
-k failures and r successes with success on the last trial.
-The negative_binomial distribution
+negative_binomial distribution gives the probability of observing
+k failures and r successes with success on the last trial.
+The negative_binomial distribution
assumes that success_fraction p is fixed for all (k + r) trials.
[note The random variable for the negative binomial distribution is the number of trials,
@@ -67,7 +67,7 @@
[equation neg_binomial_ref]
-The following graph illustrate how the PDF varies as the success fraction
+The following graph illustrate how the PDF varies as the success fraction
/p/ changes:
[graph negative_binomial_pdf_1]
@@ -91,7 +91,7 @@
The Poisson distribution is a generalization of the Pascal distribution,
where the success parameter r is an integer: to obtain the Pascal
distribution you must ensure that an integer value is provided for r,
-and take integer values (floor or ceiling) from functions that return
+and take integer values (floor or ceiling) from functions that return
a number of successes.
For large values of r (successes), the negative binomial distribution
@@ -107,7 +107,7 @@
poisson([lambda]) = lim [sub r [rarr] [infin]] [space] negative_binomial(r, r / ([lambda] + r)))
[discrete_quantile_warning Negative Binomial]
-
+
[h4 Member Functions]
[h5 Construct]
@@ -122,27 +122,27 @@
[h5 Accessors]
RealType success_fraction() const; // successes / trials (0 <= p <= 1)
-
+
Returns the parameter /p/ from which this distribution was constructed.
-
+
RealType successes() const; // required successes (r > 0)
-
+
Returns the parameter /r/ from which this distribution was constructed.
The best method of calculation for the following functions is disputed:
-see __binomial_distrib for more discussion.
+see __binomial_distrib for more discussion.
[h5 Lower Bound on Parameter p]
static RealType find_lower_bound_on_p(
- RealType failures,
+ RealType failures,
RealType successes,
RealType probability) // (0 <= alpha <= 1), 0.05 equivalent to 95% confidence.
-
+
Returns a *lower bound* on the success fraction:
[variablelist
-[[failures][The total number of failures before the r th success.]]
+[[failures][The total number of failures before the ['r]th success.]]
[[successes][The number of successes required.]]
[[alpha][The largest acceptable probability that the true value of
the success fraction is [*less than] the value returned.]]
@@ -150,16 +150,16 @@
For example, if you observe /k/ failures and /r/ successes from /n/ = k + r trials
the best estimate for the success fraction is simply ['r/n], but if you
-want to be 95% sure that the true value is [*greater than] some value,
+want to be 95% sure that the true value is [*greater than] some value,
['p[sub min]], then:
p``[sub min]`` = negative_binomial_distribution<RealType>::find_lower_bound_on_p(
failures, successes, 0.05);
[link math_toolkit.dist.stat_tut.weg.neg_binom_eg.neg_binom_conf See negative binomial confidence interval example.]
-
+
This function uses the Clopper-Pearson method of computing the lower bound on the
-success fraction, whilst many texts refer to this method as giving an "exact"
+success fraction, whilst many texts refer to this method as giving an "exact"
result in practice it produces an interval that guarantees ['at least] the
coverage required, and may produce pessimistic estimates for some combinations
of /failures/ and /successes/. See:
@@ -171,10 +171,10 @@
[h5 Upper Bound on Parameter p]
static RealType find_upper_bound_on_p(
- RealType trials,
+ RealType trials,
RealType successes,
RealType alpha); // (0 <= alpha <= 1), 0.05 equivalent to 95% confidence.
-
+
Returns an *upper bound* on the success fraction:
[variablelist
@@ -186,7 +186,7 @@
For example, if you observe /k/ successes from /n/ trials the
best estimate for the success fraction is simply ['k/n], but if you
-want to be 95% sure that the true value is [*less than] some value,
+want to be 95% sure that the true value is [*less than] some value,
['p[sub max]], then:
p``[sub max]`` = negative_binomial_distribution<RealType>::find_upper_bound_on_p(
@@ -195,7 +195,7 @@
[link math_toolkit.dist.stat_tut.weg.neg_binom_eg.neg_binom_conf See negative binomial confidence interval example.]
This function uses the Clopper-Pearson method of computing the lower bound on the
-success fraction, whilst many texts refer to this method as giving an "exact"
+success fraction, whilst many texts refer to this method as giving an "exact"
result in practice it produces an interval that guarantees ['at least] the
coverage required, and may produce pessimistic estimates for some combinations
of /failures/ and /successes/. See:
@@ -210,7 +210,7 @@
RealType k, // number of failures.
RealType p, // success fraction.
RealType alpha); // probability threshold (0.05 equivalent to 95%).
-
+
This functions estimates the number of trials required to achieve a certain
probability that [*more than k failures will be observed].
@@ -221,12 +221,12 @@
]
For example:
-
+
negative_binomial_distribution<RealType>::find_minimum_number_of_trials(10, 0.5, 0.05);
-
+
Returns the smallest number of trials we must conduct to be 95% sure
of seeing 10 failures that occur with frequency one half.
-
+
[link math_toolkit.dist.stat_tut.weg.neg_binom_eg.neg_binom_size_eg Worked Example.]
This function uses numeric inversion of the negative binomial distribution
@@ -240,7 +240,7 @@
RealType k, // number of failures.
RealType p, // success fraction.
RealType alpha); // probability threshold (0.05 equivalent to 95%).
-
+
This functions estimates the maximum number of trials we can conduct and achieve
a certain probability that [*k failures or fewer will be observed].
@@ -251,12 +251,12 @@
]
For example:
-
+
negative_binomial_distribution<RealType>::find_maximum_number_of_trials(0, 1.0-1.0/1000000, 0.05);
-
+
Returns the largest number of trials we can conduct and still be 95% sure
of seeing no failures that occur with frequency one in one million.
-
+
This function uses numeric inversion of the negative binomial distribution
to obtain the result: another interpretation of the result, is that it finds
the number of trials (success+failures) that will lead to an /alpha/ probability
@@ -267,7 +267,7 @@
All the [link math_toolkit.dist.dist_ref.nmp usual non-member accessor functions]
that are generic to all distributions are supported: __usual_accessors.
-However it's worth taking a moment to define what these actually mean in
+However it's worth taking a moment to define what these actually mean in
the context of this distribution:
[table Meaning of the non-member accessors.
@@ -285,14 +285,14 @@
[[__ccdf]
[The probability of obtaining [*more than k failures] from k+r trials
with success fraction p and success on the last trial. For example:
-
+
``cdf(complement(negative_binomial(r, p), k))``]]
[[__quantile]
[The [*greatest] number of failures k expected to be observed from k+r trials
with success fraction p, at probability P. Note that the value returned
is a real-number, and not an integer. Depending on the use case you may
want to take either the floor or ceiling of the real result. For example:
-
+
``quantile(negative_binomial(r, p), P)``]]
[[__quantile_c]
[The [*smallest] number of failures k expected to be observed from k+r trials
@@ -304,8 +304,8 @@
[h4 Accuracy]
-This distribution is implemented using the
-incomplete beta functions __ibeta and __ibetac:
+This distribution is implemented using the
+incomplete beta functions __ibeta and __ibetac:
please refer to these functions for information on accuracy.
[h4 Implementation]
@@ -326,7 +326,7 @@
just a thin wrapper around part of the internals of the incomplete
beta function.
]]
-[[cdf][Using the relation:
+[[cdf][Using the relation:
cdf = I[sub p](r, k+1) = ibeta(r, k+1, p)
Modified: branches/release/libs/math/doc/sf_and_dist/distributions/rayleigh.qbk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/distributions/rayleigh.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/distributions/rayleigh.qbk 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -3,14 +3,14 @@
``#include <boost/math/distributions/rayleigh.hpp>``
- namespace boost{ namespace math{
-
- template <class RealType = double,
+ namespace boost{ namespace math{
+
+ template <class RealType = double,
class ``__Policy`` = ``__policy_class`` >
class rayleigh_distribution;
-
+
typedef rayleigh_distribution<> rayleigh;
-
+
template <class RealType, class ``__Policy``>
class rayleigh_distribution
{
@@ -22,11 +22,11 @@
// Accessors:
RealType sigma()const;
};
-
+
}} // namespaces
-
+
The [@http://en.wikipedia.org/wiki/Rayleigh_distribution Rayleigh distribution]
-is a continuous distribution with the
+is a continuous distribution with the
[@http://en.wikipedia.org/wiki/Probability_density_function probability density function]:
f(x; sigma) = x * exp(-x[super 2]/2 [sigma][super 2]) / [sigma][super 2]
@@ -54,22 +54,22 @@
The [@http://en.wikipedia.org/wiki/Chi_distribution Chi],
[@http://en.wikipedia.org/wiki/Rice_distribution Rice]
and [@http://en.wikipedia.org/wiki/Weibull_distribution Weibull] distributions are generalizations of the
-[@http://en.wikipedia.org/wiki/Rayleigh_distribution Rayleigh distribution].
+[@http://en.wikipedia.org/wiki/Rayleigh_distribution Rayleigh distribution].
[h4 Member Functions]
rayleigh_distribution(RealType sigma = 1);
-
-Constructs a [@http://en.wikipedia.org/wiki/Rayleigh_distribution
+
+Constructs a [@http://en.wikipedia.org/wiki/Rayleigh_distribution
Rayleigh distribution] with [sigma] /sigma/.
-Requires that the [sigma] parameter is greater than zero,
+Requires that the [sigma] parameter is greater than zero,
otherwise calls __domain_error.
RealType sigma()const;
-
+
Returns the /sigma/ parameter of this distribution.
-
+
[h4 Non-member Accessors]
All the [link math_toolkit.dist.dist_ref.nmp usual non-member accessor functions] that are generic to all
@@ -79,14 +79,14 @@
[h4 Accuracy]
-The Rayleigh distribution is implemented in terms of the
+The Rayleigh distribution is implemented in terms of the
standard library `sqrt` and `exp` and as such should have very low error rates.
Some constants such as skewness and kurtosis were calculated using
NTL RR type with 150-bit accuracy, about 50 decimal digits.
[h4 Implementation]
-In the following table [sigma][space] is the sigma parameter of the distribution,
+In the following table [sigma][space] is the sigma parameter of the distribution,
/x/ is the random variate, /p/ is the probability and /q = 1-p/.
[table
@@ -108,9 +108,9 @@
* [@http://en.wikipedia.org/wiki/Rayleigh_distribution ]
* [@http://mathworld.wolfram.com/RayleighDistribution.html Weisstein, Eric W. "Rayleigh Distribution." From MathWorld--A Wolfram Web Resource.]
-[endsect][/section:Rayleigh Rayleigh]
+[endsect] [/section:Rayleigh Rayleigh]
-[/
+[/
Copyright 2006 John Maddock and Paul A. Bristow.
Distributed under the Boost Software License, Version 1.0.
(See accompanying file LICENSE_1_0.txt or copy at
Modified: branches/release/libs/math/doc/sf_and_dist/error.qbk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/error.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/error.qbk 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -9,13 +9,13 @@
[equation error1]
-which measures /relative difference/ and happens to be less error
+which measures /relative difference/ and happens to be less error
prone in use since we don't have to worry which value is the "true"
result, and which is the experimental one. It guarantees to return a value
at least as large as the relative error.
Special care needs to be taken when one value is zero: we could either take the
-absolute error in this case (but that's cheating as the absolute error is likely
+absolute error in this case (but that's cheating as the absolute error is likely
to be very small), or we could assign a value of either 1 or infinity to the
relative error in this special case. In the test cases for the special functions
in this library, everything below a threshold is regarded as "effectively zero",
@@ -24,20 +24,20 @@
in other words all denormalised numbers are regarded as a zero.
All the test programs calculate /quantized relative error/, whereas the graphs
-in this manual are produced with the /actual error/. The difference is as
-follows: in the test programs, the test data is rounded to the target real type
+in this manual are produced with the /actual error/. The difference is as
+follows: in the test programs, the test data is rounded to the target real type
under test when the program is compiled,
so the error observed will then be a whole number of /units in the last place/
either rounded up from the actual error, or rounded down (possibly to zero).
In contrast the /true error/ is obtained by extending
-the precision of the calculated value, and then comparing to the actual value:
+the precision of the calculated value, and then comparing to the actual value:
in this case the calculated error may be some fraction of /units in the last place/.
Note that throughout this manual and the test programs the relative error is
usually quoted in units of epsilon. However, remember that /units in the last place/
more accurately reflect the number of contaminated digits, and that relative
error can /"wobble"/ by a factor of 2 compared to /units in the last place/.
-In other words: two implementations of the same function, whose
+In other words: two implementations of the same function, whose
maximum relative errors differ by a factor of 2, can actually be accurate
to the same number of binary digits. You have been warned!
@@ -45,26 +45,28 @@
For many of the functions in this library, it is assumed that the error is
"effectively zero" if the computation can be done with a number of guard
-digits. However it should be remembered that if the result is a
-/transcendental number/
+digits. However it should be remembered that if the result is a
+/transcendental number/
then as a point of principle we can never be sure that the result is accurate
-to more than 1 ulp. This is an example of /the table makers dilemma/: consider what
-happens if the first guard digit is a one, and the remaining guard digits are all zero.
+to more than 1 ulp. This is an example of what
+[@http://en.wikipedia.org/wiki/William_Kahan] called
+[@http://en.wikipedia.org/wiki/Rounding#The_table-maker.27s_dilemma]:
+consider what happens if the first guard digit is a one, and the remaining guard digits are all zero.
Do we have a tie or not? Since the only thing we can tell about a transcendental number
is that its digits have no particular pattern, we can never tell if we have a tie,
-no matter how many guard digits we have. Therefore, we can never be completely sure
+no matter how many guard digits we have. Therefore, we can never be completely sure
that the result has been rounded in the right direction. Of course, transcendental
numbers that just happen to be a tie - for however many guard digits we have - are
extremely rare, and get rarer the more guard digits we have, but even so....
-Refer to the classic text
+Refer to the classic text
[@http://docs.sun.com/source/806-3568/ncg_goldberg.html What Every Computer Scientist Should Know About Floating-Point Arithmetic]
for more information.
[endsect][/section:relative_error Relative Error]
-[/
- Copyright 2006 John Maddock and Paul A. Bristow.
+[/
+ Copyright 2006, 2012 John Maddock and Paul A. Bristow.
Distributed under 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).
Modified: branches/release/libs/math/doc/sf_and_dist/faq.qbk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/faq.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/faq.qbk 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -1,19 +1,19 @@
[section:faq Frequently Asked Questions FAQ]
-# ['I'm a FORTRAN/NAG/SPSS/SAS/Cephes/MathCad/R user
+# ['I'm a FORTRAN/NAG/SPSS/SAS/Cephes/MathCad/R user
and I don't see where the functions like dnorm(mean, sd) are in Boost.Math?] [br]
-Nearly all are provided, and many more like mean, skewness, quantiles, complements ...
-but Boost.Math makes full use of C++, and it looks a bit different.
+Nearly all are provided, and many more like mean, skewness, quantiles, complements ...
+but Boost.Math makes full use of C++, and it looks a bit different.
But do not panic! See section on construction and the many examples.
-Briefly, the distribution is constructed with the parameters (like location and scale)
-(things after the | in representation like P(X=k|n, p) or ; in a common represention of pdf f(x; [mu][sigma][super 2]).
+Briefly, the distribution is constructed with the parameters (like location and scale)
+(things after the | in representation like P(X=k|n, p) or ; in a common represention of pdf f(x; [mu][sigma][super 2]).
Functions like pdf, cdf are called with the name of that distribution and the random variate often called x or k.
For example, `normal my_norm(0, 1); pdf(my_norm, 2.0);` [br]
#I'm a user of [@http://support.sas.com/rnd/app/da/new/probabilityfunctions.html New SAS Functions for Computing Probabilities]. [br]
You will find the interface more familar, but to be able to select a distribution (perhaps using a string)
see the Extras/Future Directions section,
and /boost/libs/math/dot_net_example/boost_math.cpp for an example that is used to create a C# utility
-(that you might also find useful): see [@http://sourceforge.net/projects/distexplorer/ Statistical Distribution Explorer] [br].
+(that you might also find useful): see [@http://sourceforge.net/projects/distexplorer/ Statistical Distribution Explorer] [br].
# ['I'm allegic to reading manuals and prefer to learn from examples.][br]
Fear not - you are not alone! Many examples are available for functions and distributions.
Some are referenced directly from the text. Others can be found at \boost_latest_release\libs\math\example.
@@ -27,26 +27,26 @@
Visual Studio 2010 instead provides property sheets to assist.
You may find it convenient to create a new one adding \boost-latest_release;
to the existing include items in $(IncludePath).
-# ['I'm a FORTRAN/NAG/SPSS/SAS/Cephes/MathCad/R user and
+# ['I'm a FORTRAN/NAG/SPSS/SAS/Cephes/MathCad/R user and
I don't see where the properties like mean, median, mode, variance, skewness of distributions are in Boost.Math?][br]
They are all available (if defined for the parameters with which you constructed the distribution) via __usual_accessors.
# ['I am a C programmer. Can I user Boost.Math with C?][br]
Yes you can, including all the special functions, and TR1 functions like isnan.
They appear as C functions, by being declared as "extern C".
# ['I am a C# (Basic? F# FORTRAN? Other CLI?) programmer. Can I use Boost.Math with C#?] [br]
-Yes you can, including all the special functions, and TR1 functions like isnan.
-But you [*must build the Boost.Math as a dynamic library (.dll) and compile with the /CLI option].
-See the boost/math/dot_net_example folder which contains an example that
+Yes you can, including all the special functions, and TR1 functions like isnan.
+But you [*must build the Boost.Math as a dynamic library (.dll) and compile with the /CLI option].
+See the boost/math/dot_net_example folder which contains an example that
builds a simple statistical distribution app with a GUI.
See [@http://sourceforge.net/projects/distexplorer/ Statistical Distribution Explorer] [br]
# ['What these "policies" things for?] [br]
-Policies are a powerful (if necessarily complex) fine-grain mechanism that
-allow you to customise the behaviour of the Boost.Math library according to your precise needs.
+Policies are a powerful (if necessarily complex) fine-grain mechanism that
+allow you to customise the behaviour of the Boost.Math library according to your precise needs.
See __policy_section. But if, very probably, the default behaviour suits you, you don't need to know more.
# ['I am a C user and expect to see global C-style`::errno` set for overflow/errors etc?] [br]
You can achieve what you want - see __error_policy and __user_error_handling and many examples.
# ['I am a C user and expect to silently return a max value for overflow?] [br]
-You (and C++ users too) can return whatever you want on overflow
+You (and C++ users too) can return whatever you want on overflow
- see __overflow_error and __error_policy and several examples.
# ['I don't want any error message for overflow etc?] [br]
You can control exactly what happens for all the abnormal conditions, including the values returned.
@@ -55,7 +55,7 @@
Yes but you must customise the error handling: see __user_error_handling and __changing_policy_defaults .
# ['The docs are several hundreds of pages long! Can I read the docs off-line or on paper?] [br]
Yes - you can download the Boost current release of most documentation
-as a zip of pdfs (including Boost.Math) from Sourceforge, for example
+as a zip of pdfs (including Boost.Math) from Sourceforge, for example
[@https://sourceforge.net/projects/boost/files/boost-docs/1.45.0/boost_pdf_1_45_0.tar.gz/download].
And you can print any pages you need (or even print all pages - but be warned that there are several hundred!).
Both html and pdf versions are highly hyperlinked.
@@ -63,14 +63,14 @@
This can often find what you seek, a partial substitute for a full index.
# ['I want a compact version for an embedded application. Can I use float precision?] [br]
Yes - by selecting RealType template parameter as float:
-for example normal_distribution<float> your_normal(mean, sd);
+for example normal_distribution<float> your_normal(mean, sd);
(But double may still be used internally, so space saving may be less that you hope for).
You can also change the promotion policy, but accuracy might be much reduced.
# ['I seem to get somewhat different results compared to other programs. Why?]
We hope Boost.Math to be more accurate: our priority is accuracy (over speed).
See the section on accuracy. But for evaluations that require iterations
there are parameters which can change the required accuracy. You might be able to
-squeeze a little more accuracy at the cost of runtime.
+squeeze a little more accuracy at the cost of runtime.
# ['Will my program run more slowly compared to other math functions and statistical libraries?]
Probably, thought not always, and not by too much: our priority is accuracy.
For most functions, making sure you have the latest compiler version with all optimisations switched on is the key to speed.
@@ -79,15 +79,23 @@
# ['How do I handle infinity and NaNs portably?] [br]
See __fp_facets for Facets for Floating-Point Infinities and NaNs.
# ['Where are the pre-built libraries?] [br]
-Good news - you probably don't need any! - just #include <boost/math/distribution_you_want>.
+Good news - you probably don't need any! - just `#include <boost/`['math/distribution_you_want>].
But in the unlikely event that you do, see __building.
# ['I don't see the function or distribution that I want.] [br]
You could try an email to ask the authors - but no promises!
+# ['I need more decimal digits for values/computations.] [br]
+You can use Boost.Math with __multiprecision: typically
+__cpp_dec_float is a useful user-defined type to provide a fixed number of decimal digits, usually 50 or 100.
+# Why can't I write something really simple like `cpp_int one(1); cpp_dec_float_50 two(2); one * two;`
+Because `cpp_int` might be bigger than `cpp_dec_float can hold`, so you must make an [*explicit] conversion.
+See [@http://svn.boost.org/svn/boost/trunk/libs/multiprecision/doc/html/boost_multiprecision/intro.html mixed multiprecision arithmetic]
+and [@http://svn.boost.org/svn/boost/trunk/libs/multiprecision/doc/html/boost_multiprecision/tut/conversions.html conversion].
+
[endsect] [/section:faq Frequently Asked Questions]
-[/
- Copyright 2010 John Maddock and Paul A. Bristow.
+[/
+ Copyright 2010, 2012 John Maddock and Paul A. Bristow.
Distributed under 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).
Modified: branches/release/libs/math/doc/sf_and_dist/html/index.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/index.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/index.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -51,10 +51,13 @@
<div class="author"><h3 class="author">
<span class="firstname">Benjamin</span> <span class="surname">Sobotta</span>
</h3></div>
+<div class="author"><h3 class="author">
+<span class="firstname">Christopher</span> <span class="surname">Kormanyos</span>
+</h3></div>
</div></div>
-<div><p class="copyright">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta</p></div>
+<div><p class="copyright">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos</p></div>
<div><div class="legalnotice">
<a name="math_toolkit.legal"></a><p>
Distributed under the Boost Software License, Version 1.0. (See accompanying
@@ -118,7 +121,7 @@
<dt><span class="section">Worked Examples</span></dt>
<dd><dl>
<dt><span class="section"><a href="math_toolkit/dist/stat_tut/weg/dist_construct_eg.html">Distribution
- Construction Example</a></span></dt>
+ Construction Examples</a></span></dt>
<dt><span class="section"><a href="math_toolkit/dist/stat_tut/weg/st_eg.html">Student's t
Distribution Examples</a></span></dt>
<dt><span class="section"><a href="math_toolkit/dist/stat_tut/weg/cs_eg.html">Chi Squared
@@ -283,6 +286,8 @@
Overview</a></span></dt>
<dt><span class="section"><a href="math_toolkit/special/bessel/bessel.html">Bessel Functions
of the First and Second Kinds</a></span></dt>
+<dt><span class="section"><a href="math_toolkit/special/bessel/bessel0.html">Finding Zeros
+ of Bessel Functions of the First and Second Kinds</a></span></dt>
<dt><span class="section"><a href="math_toolkit/special/bessel/mbessel.html">Modified Bessel
Functions of the First and Second Kinds</a></span></dt>
<dt><span class="section"><a href="math_toolkit/special/bessel/sph_bessel.html">Spherical Bessel
@@ -355,9 +360,10 @@
<dt><span class="section"><a href="math_toolkit/special/expint/expint_i.html">Exponential Integral
Ei</a></span></dt>
</dl></dd>
-<dt><span class="section"><a href="math_toolkit/special/powers.html">Logs, Powers, Roots and
- Exponentials</a></span></dt>
+<dt><span class="section">Basic Functions</span></dt>
<dd><dl>
+<dt><span class="section">sin_pi</span></dt>
+<dt><span class="section">cos_pi</span></dt>
<dt><span class="section">log1p</span></dt>
<dt><span class="section">expm1</span></dt>
<dt><span class="section">cbrt</span></dt>
@@ -441,7 +447,7 @@
<dt><span class="section"><a href="math_toolkit/constants/tutorial/templ.html">Use in template
code</a></span></dt>
<dt><span class="section"><a href="math_toolkit/constants/tutorial/user_def.html">Use With
- User Defined Types</a></span></dt>
+ User-Defined Types</a></span></dt>
</dl></dd>
<dt><span class="section">The Mathematical Constants</span></dt>
<dt><span class="section">Defining New Constants</span></dt>
@@ -480,11 +486,24 @@
<dt><span class="section"><a href="math_toolkit/using_udt.html">Use with User-Defined Floating-Point
Types</a></span></dt>
<dd><dl>
-<dt><span class="section"><a href="math_toolkit/using_udt/use_ntl.html">Using With NTL - a High-Precision
- Floating-Point Library</a></span></dt>
-<dt><span class="section"><a href="math_toolkit/using_udt/use_mpfr.html">Using With MPFR / GMP
- - a High-Precision Floating-Point Library</a></span></dt>
-<dt><span class="section">e_float Support</span></dt>
+<dt><span class="section"><a href="math_toolkit/using_udt/high_precision.html">Using Boost.Math
+ with High-Precision Floating-Point Libraries</a></span></dt>
+<dd><dl>
+<dt><span class="section"><a href="math_toolkit/using_udt/high_precision/why_high_precision.html">Why
+ use a high-precision library rather than built-in floating-point types?</a></span></dt>
+<dt><span class="section"><a href="math_toolkit/using_udt/high_precision/use_multiprecision.html">Using
+ Boost.Multiprecision</a></span></dt>
+<dt><span class="section"><a href="math_toolkit/using_udt/high_precision/float128.html">Using
+ with GCC's __float128 datatype</a></span></dt>
+<dt><span class="section"><a href="math_toolkit/using_udt/high_precision/use_mpfr.html">Using
+ With MPFR or GMP - High-Precision Floating-Point Library</a></span></dt>
+<dt><span class="section"><a href="math_toolkit/using_udt/high_precision/e_float.html">Using
+ e_float Library</a></span></dt>
+<dt><span class="section"><a href="math_toolkit/using_udt/high_precision/use_ntl.html">Using
+ NTL Library</a></span></dt>
+<dt><span class="section"><a href="math_toolkit/using_udt/high_precision/using_test.html">Using
+ without expression templates for Boost.Test and others</a></span></dt>
+</dl></dd>
<dt><span class="section"><a href="math_toolkit/using_udt/concepts.html">Conceptual Requirements
for Real Number Types</a></span></dt>
<dt><span class="section"><a href="math_toolkit/using_udt/dist_concept.html">Conceptual Requirements
@@ -580,7 +599,7 @@
</p>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"><p><small>Last revised: January 21, 2013 at 11:50:21 GMT</small></p></td>
+<td align="left"><p><small>Last revised: March 21, 2013 at 12:24:21 GMT</small></p></td>
<td align="right"><div class="copyright-footer"></div></td>
</tr></table>
<hr>
Modified: branches/release/libs/math/doc/sf_and_dist/html/index/s13.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/index/s13.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/index/s13.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,9 +22,9 @@
<div class="spirit-nav">
<a accesskey="p" href="../math_toolkit/status/credits.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="s14.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section id863386">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="id1341415"></a>Function Index</h2></div></div></div>
+<a name="id863386"></a>Function Index</h2></div></div></div>
<p><a class="link" href="s13.html#idx_id_0">A</a> <a class="link" href="s13.html#idx_id_1">B</a> <a class="link" href="s13.html#idx_id_2">C</a> <a class="link" href="s13.html#idx_id_3">D</a> <a class="link" href="s13.html#idx_id_4">E</a> <a class="link" href="s13.html#idx_id_5">F</a> <a class="link" href="s13.html#idx_id_6">G</a> <a class="link" href="s13.html#idx_id_7">H</a> <a class="link" href="s13.html#idx_id_8">I</a> <a class="link" href="s13.html#idx_id_9">J</a> <a class="link" href="s13.html#idx_id_10">K</a> <a class="link" href="s13.html#idx_id_11">L</a> <a class="link" href="s13.html#idx_id_12">M</a> <a class="link" href="s13.html#idx_id_13">N</a> <a class="link" href="s13.html#idx_id_14">O</a> <a class="link" href="s13.html#idx_id_15">P</a> <a class="link" href="s13.html#idx_id_16">Q</a> <a class="link" href="s13.html#idx_id_17">R</a> <a class="link" href="s13.html#idx_id_18">S</a> <a class="link" href="s13.html#idx_id_19">T</a> <a class="link" href="s13.html#idx_id_20">U</a> <a class="link" href=
"s13.html#idx_id_21">V</a> <a class="link" href="s13.html#idx_id_22">W</a> <a class="link" href="s13.html#idx_id_23">Z</a></p>
<div class="variablelist"><dl class="variablelist">
<dt>
@@ -408,6 +408,7 @@
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/extern_c/c99.html" title="C99 C Functions"><span class="index-entry-level-1">C99 C Functions</span></a></p></li>
</ul></div>
</li>
+<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/special/powers/cos_pi.html" title="cos_pi"><span class="index-entry-level-0">cos_pi</span></a></p></li>
<li class="listitem" style="list-style-type: none">
<p><span class="index-entry-level-0">cyl_bessel_i</span></p>
<div class="index"><ul class="index" style="list-style-type: none; ">
@@ -439,6 +440,7 @@
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/special/bessel/bessel.html" title="Bessel Functions of the First and Second Kinds"><span class="index-entry-level-1">Bessel Functions of the First and Second Kinds</span></a></p></li>
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/main_overview/tr1.html" title="C99 and C++ TR1 C-style Functions"><span class="index-entry-level-1">C99 and C++ TR1 C-style Functions</span></a></p></li>
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/extern_c/tr1.html" title="C99 and TR1 C Functions Overview"><span class="index-entry-level-1">C99 and TR1 C Functions Overview</span></a></p></li>
+<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/status/issues.html" title="Known Issues, and TODO List"><span class="index-entry-level-1">Known Issues, and TODO List</span></a></p></li>
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/extern_c/tr1_ref.html" title="TR1 C Functions Quick Reference"><span class="index-entry-level-1">TR1 C Functions Quick Reference</span></a></p></li>
</ul></div>
</li>
@@ -459,6 +461,10 @@
</ul></div>
</li>
<li class="listitem" style="list-style-type: none">
+<p><span class="index-entry-level-0">cyl_bessel_j_zero</span></p>
+<div class="index"><ul class="index" style="list-style-type: none; "><li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/special/bessel/bessel0.html" title="Finding Zeros of Bessel Functions of the First and Second Kinds"><span class="index-entry-level-1">Finding Zeros of Bessel Functions of the First and Second Kinds</span></a></p></li></ul></div>
+</li>
+<li class="listitem" style="list-style-type: none">
<p><span class="index-entry-level-0">cyl_bessel_k</span></p>
<div class="index"><ul class="index" style="list-style-type: none; ">
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/main_overview/tr1.html" title="C99 and C++ TR1 C-style Functions"><span class="index-entry-level-1">C99 and C++ TR1 C-style Functions</span></a></p></li>
@@ -489,6 +495,7 @@
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/special/bessel/bessel.html" title="Bessel Functions of the First and Second Kinds"><span class="index-entry-level-1">Bessel Functions of the First and Second Kinds</span></a></p></li>
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/main_overview/tr1.html" title="C99 and C++ TR1 C-style Functions"><span class="index-entry-level-1">C99 and C++ TR1 C-style Functions</span></a></p></li>
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/extern_c/tr1.html" title="C99 and TR1 C Functions Overview"><span class="index-entry-level-1">C99 and TR1 C Functions Overview</span></a></p></li>
+<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/status/issues.html" title="Known Issues, and TODO List"><span class="index-entry-level-1">Known Issues, and TODO List</span></a></p></li>
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/extern_c/tr1_ref.html" title="TR1 C Functions Quick Reference"><span class="index-entry-level-1">TR1 C Functions Quick Reference</span></a></p></li>
</ul></div>
</li>
@@ -508,6 +515,10 @@
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/extern_c/tr1_ref.html" title="TR1 C Functions Quick Reference"><span class="index-entry-level-1">TR1 C Functions Quick Reference</span></a></p></li>
</ul></div>
</li>
+<li class="listitem" style="list-style-type: none">
+<p><span class="index-entry-level-0">cyl_neumann_zero</span></p>
+<div class="index"><ul class="index" style="list-style-type: none; "><li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/special/bessel/bessel0.html" title="Finding Zeros of Bessel Functions of the First and Second Kinds"><span class="index-entry-level-1">Finding Zeros of Bessel Functions of the First and Second Kinds</span></a></p></li></ul></div>
+</li>
</ul></div></dd>
<dt>
<a name="idx_id_3"></a><span class="term">D</span>
@@ -771,7 +782,7 @@
</li>
<li class="listitem" style="list-style-type: none">
<p><span class="index-entry-level-0">e_float</span></p>
-<div class="index"><ul class="index" style="list-style-type: none; "><li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/using_udt/e_float.html" title="e_float Support"><span class="index-entry-level-1">e_float Support</span></a></p></li></ul></div>
+<div class="index"><ul class="index" style="list-style-type: none; "><li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/using_udt/high_precision/e_float.html" title="Using e_float Library"><span class="index-entry-level-1">Using e_float Library</span></a></p></li></ul></div>
</li>
</ul></div></dd>
<dt>
@@ -985,7 +996,7 @@
<p><span class="index-entry-level-0">get</span></p>
<div class="index"><ul class="index" style="list-style-type: none; ">
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/constants/new_const.html" title="Defining New Constants"><span class="index-entry-level-1">Defining New Constants</span></a></p></li>
-<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/constants/tutorial/user_def.html" title="Use With User Defined Types"><span class="index-entry-level-1">Use With User Defined Types</span></a></p></li>
+<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/constants/tutorial/user_def.html" title="Use With User-Defined Types"><span class="index-entry-level-1">Use With User-Defined Types</span></a></p></li>
</ul></div>
</li>
<li class="listitem" style="list-style-type: none">
@@ -1610,6 +1621,7 @@
<li class="listitem" style="list-style-type: none">
<p><span class="index-entry-level-0">mean</span></p>
<div class="index"><ul class="index" style="list-style-type: none; ">
+<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/dist/stat_tut/weg/dist_construct_eg.html" title="Distribution Construction Examples"><span class="index-entry-level-1">Distribution Construction Examples</span></a></p></li>
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/dist/stat_tut/weg/find_eg/find_location_eg.html" title="Find Location (Mean) Example"><span class="index-entry-level-1">Find Location (Mean) Example</span></a></p></li>
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/dist/stat_tut/weg/find_eg/find_scale_eg.html" title="Find Scale (Standard Deviation) Example"><span class="index-entry-level-1">Find Scale (Standard Deviation) Example</span></a></p></li>
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/dist/dist_ref/dists/geometric_dist.html" title="Geometric Distribution"><span class="index-entry-level-1">Geometric Distribution</span></a></p></li>
@@ -1922,10 +1934,6 @@
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/extern_c/c99.html" title="C99 C Functions"><span class="index-entry-level-1">C99 C Functions</span></a></p></li>
</ul></div>
</li>
-<li class="listitem" style="list-style-type: none">
-<p><span class="index-entry-level-0">RR</span></p>
-<div class="index"><ul class="index" style="list-style-type: none; "><li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/dist/stat_tut/weg/dist_construct_eg.html" title="Distribution Construction Example"><span class="index-entry-level-1">Distribution Construction Example</span></a></p></li></ul></div>
-</li>
</ul></div></dd>
<dt>
<a name="idx_id_18"></a><span class="term">S</span>
@@ -2021,6 +2029,7 @@
</li>
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/special/sinc/sinc_pi.html" title="sinc_pi"><span class="index-entry-level-0">sinc_pi</span></a></p></li>
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/special/sinc/sinhc_pi.html" title="sinhc_pi"><span class="index-entry-level-0">sinhc_pi</span></a></p></li>
+<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/special/powers/sin_pi.html" title="sin_pi"><span class="index-entry-level-0">sin_pi</span></a></p></li>
<li class="listitem" style="list-style-type: none">
<p><span class="index-entry-level-0">skewness</span></p>
<div class="index"><ul class="index" style="list-style-type: none; ">
@@ -2358,9 +2367,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/index/s14.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/index/s14.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/index/s14.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,9 +22,9 @@
<div class="spirit-nav">
<a accesskey="p" href="s13.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="s15.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section id1364536">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="id1359510"></a>Class Index</h2></div></div></div>
+<a name="id1364536"></a>Class Index</h2></div></div></div>
<p><a class="link" href="s14.html#idx_id_25">B</a> <a class="link" href="s14.html#idx_id_26">C</a> <a class="link" href="s14.html#idx_id_27">D</a> <a class="link" href="s14.html#idx_id_28">E</a> <a class="link" href="s14.html#idx_id_29">F</a> <a class="link" href="s14.html#idx_id_30">G</a> <a class="link" href="s14.html#idx_id_31">H</a> <a class="link" href="s14.html#idx_id_32">I</a> <a class="link" href="s14.html#idx_id_35">L</a> <a class="link" href="s14.html#idx_id_36">M</a> <a class="link" href="s14.html#idx_id_37">N</a> <a class="link" href="s14.html#idx_id_39">P</a> <a class="link" href="s14.html#idx_id_41">R</a> <a class="link" href="s14.html#idx_id_42">S</a> <a class="link" href="s14.html#idx_id_43">T</a> <a class="link" href="s14.html#idx_id_44">U</a> <a class="link" href="s14.html#idx_id_46">W</a></p>
<div class="variablelist"><dl class="variablelist">
<dt>
@@ -46,7 +46,7 @@
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/dist/dist_ref/dists/chi_squared_dist.html" title="Chi Squared Distribution"><span class="index-entry-level-0">chi_squared_distribution</span></a></p></li>
<li class="listitem" style="list-style-type: none">
<p><span class="index-entry-level-0">construction_traits</span></p>
-<div class="index"><ul class="index" style="list-style-type: none; "><li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/constants/tutorial/user_def.html" title="Use With User Defined Types"><span class="index-entry-level-1">Use With User Defined Types</span></a></p></li></ul></div>
+<div class="index"><ul class="index" style="list-style-type: none; "><li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/constants/tutorial/user_def.html" title="Use With User-Defined Types"><span class="index-entry-level-1">Use With User-Defined Types</span></a></p></li></ul></div>
</li>
</ul></div></dd>
<dt>
@@ -230,9 +230,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/index/s15.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/index/s15.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/index/s15.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,9 +22,9 @@
<div class="spirit-nav">
<a accesskey="p" href="s14.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="s16.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section id1368890">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="id1360451"></a>Typedef Index</h2></div></div></div>
+<a name="id1368890"></a>Typedef Index</h2></div></div></div>
<p><a class="link" href="s15.html#idx_id_48">A</a> <a class="link" href="s15.html#idx_id_49">B</a> <a class="link" href="s15.html#idx_id_50">C</a> <a class="link" href="s15.html#idx_id_51">D</a> <a class="link" href="s15.html#idx_id_52">E</a> <a class="link" href="s15.html#idx_id_53">F</a> <a class="link" href="s15.html#idx_id_54">G</a> <a class="link" href="s15.html#idx_id_55">H</a> <a class="link" href="s15.html#idx_id_56">I</a> <a class="link" href="s15.html#idx_id_59">L</a> <a class="link" href="s15.html#idx_id_61">N</a> <a class="link" href="s15.html#idx_id_62">O</a> <a class="link" href="s15.html#idx_id_63">P</a> <a class="link" href="s15.html#idx_id_65">R</a> <a class="link" href="s15.html#idx_id_66">S</a> <a class="link" href="s15.html#idx_id_67">T</a> <a class="link" href="s15.html#idx_id_68">U</a> <a class="link" href="s15.html#idx_id_69">V</a> <a class="link" href="s15.html#idx_id_70">W</a></p>
<div class="variablelist"><dl class="variablelist">
<dt>
@@ -197,7 +197,7 @@
<li class="listitem" style="list-style-type: none">
<p><span class="index-entry-level-0">negative_binomial</span></p>
<div class="index"><ul class="index" style="list-style-type: none; ">
-<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/dist/stat_tut/weg/dist_construct_eg.html" title="Distribution Construction Example"><span class="index-entry-level-1">Distribution Construction Example</span></a></p></li>
+<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/dist/stat_tut/weg/dist_construct_eg.html" title="Distribution Construction Examples"><span class="index-entry-level-1">Distribution Construction Examples</span></a></p></li>
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/dist/dist_ref/dists/negative_binomial_dist.html" title="Negative Binomial Distribution"><span class="index-entry-level-1">Negative Binomial Distribution</span></a></p></li>
</ul></div>
</li>
@@ -390,9 +390,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/index/s16.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/index/s16.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/index/s16.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,9 +22,9 @@
<div class="spirit-nav">
<a accesskey="p" href="s15.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="s17.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section id1370708">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="id1362815"></a>Macro Index</h2></div></div></div>
+<a name="id1370708"></a>Macro Index</h2></div></div></div>
<p><a class="link" href="s16.html#idx_id_73">B</a> <a class="link" href="s16.html#idx_id_77">F</a></p>
<div class="variablelist"><dl class="variablelist">
<dt>
@@ -288,9 +288,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/index/s17.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/index/s17.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/index/s17.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -21,9 +21,9 @@
<div class="spirit-nav">
<a accesskey="p" href="s16.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a>
</div>
-<div class="section">
+<div class="section id1371934">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="id868568"></a>Index</h2></div></div></div>
+<a name="id1371934"></a>Index</h2></div></div></div>
<p><a class="link" href="s17.html#idx_id_96">A</a> <a class="link" href="s17.html#idx_id_97">B</a> <a class="link" href="s17.html#idx_id_98">C</a> <a class="link" href="s17.html#idx_id_99">D</a> <a class="link" href="s17.html#idx_id_100">E</a> <a class="link" href="s17.html#idx_id_101">F</a> <a class="link" href="s17.html#idx_id_102">G</a> <a class="link" href="s17.html#idx_id_103">H</a> <a class="link" href="s17.html#idx_id_104">I</a> <a class="link" href="s17.html#idx_id_105">J</a> <a class="link" href="s17.html#idx_id_106">K</a> <a class="link" href="s17.html#idx_id_107">L</a> <a class="link" href="s17.html#idx_id_108">M</a> <a class="link" href="s17.html#idx_id_109">N</a> <a class="link" href="s17.html#idx_id_110">O</a> <a class="link" href="s17.html#idx_id_111">P</a> <a class="link" href="s17.html#idx_id_112">Q</a> <a class="link" href="s17.html#idx_id_113">R</a> <a class="link" href="s17.html#idx_id_114">S</a> <a class="link" href="s17.html#idx_id_115">T</a> <a class="link" href="s17.html#idx_id_116">
U</a> <a class="link" href="s17.html#idx_id_117">V</a> <a class="link" href="s17.html#idx_id_118">W</a> <a class="link" href="s17.html#idx_id_119">Z</a></p>
<div class="variablelist"><dl class="variablelist">
<dt>
@@ -1321,13 +1321,16 @@
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/dist/dist_ref/dists/uniform_dist.html" title="Uniform Distribution"><span class="index-entry-level-1">Uniform Distribution</span></a></p></li>
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/constants/tutorial/non_templ.html" title="Use in non-template code"><span class="index-entry-level-1">Use in non-template code</span></a></p></li>
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/constants/tutorial/templ.html" title="Use in template code"><span class="index-entry-level-1">Use in template code</span></a></p></li>
-<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/constants/tutorial/user_def.html" title="Use With User Defined Types"><span class="index-entry-level-1">Use With User Defined Types</span></a></p></li>
+<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/constants/tutorial/user_def.html" title="Use With User-Defined Types"><span class="index-entry-level-1">Use With User-Defined Types</span></a></p></li>
+<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/using_udt/high_precision.html" title="Using Boost.Math with High-Precision Floating-Point Libraries"><span class="index-entry-level-1">Using Boost.Math with High-Precision Floating-Point Libraries</span></a></p></li>
+<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/using_udt/high_precision/use_multiprecision.html" title="Using Boost.Multiprecision"><span class="index-entry-level-1">Using Boost.Multiprecision</span></a></p></li>
+<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/using_udt/high_precision/float128.html" title="Using with GCC's __float128 datatype"><span class="index-entry-level-1">Using with GCC's __float128 datatype</span></a></p></li>
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/dist/dist_ref/dists/weibull_dist.html" title="Weibull Distribution"><span class="index-entry-level-1">Weibull Distribution</span></a></p></li>
</ul></div>
</li>
<li class="listitem" style="list-style-type: none">
<p><span class="index-entry-level-0">construction_traits</span></p>
-<div class="index"><ul class="index" style="list-style-type: none; "><li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/constants/tutorial/user_def.html" title="Use With User Defined Types"><span class="index-entry-level-1">Use With User Defined Types</span></a></p></li></ul></div>
+<div class="index"><ul class="index" style="list-style-type: none; "><li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/constants/tutorial/user_def.html" title="Use With User-Defined Types"><span class="index-entry-level-1">Use With User-Defined Types</span></a></p></li></ul></div>
</li>
<li class="listitem" style="list-style-type: none">
<p><span class="index-entry-level-0">Continued Fraction Evaluation</span></p>
@@ -1374,6 +1377,7 @@
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/extern_c/c99.html" title="C99 C Functions"><span class="index-entry-level-1">C99 C Functions</span></a></p></li>
</ul></div>
</li>
+<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/special/powers/cos_pi.html" title="cos_pi"><span class="index-entry-level-0">cos_pi</span></a></p></li>
<li class="listitem" style="list-style-type: none">
<p><span class="index-entry-level-0">Credits and Acknowledgements</span></p>
<div class="index"><ul class="index" style="list-style-type: none; ">
@@ -1412,6 +1416,7 @@
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/special/bessel/bessel.html" title="Bessel Functions of the First and Second Kinds"><span class="index-entry-level-1">Bessel Functions of the First and Second Kinds</span></a></p></li>
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/main_overview/tr1.html" title="C99 and C++ TR1 C-style Functions"><span class="index-entry-level-1">C99 and C++ TR1 C-style Functions</span></a></p></li>
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/extern_c/tr1.html" title="C99 and TR1 C Functions Overview"><span class="index-entry-level-1">C99 and TR1 C Functions Overview</span></a></p></li>
+<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/status/issues.html" title="Known Issues, and TODO List"><span class="index-entry-level-1">Known Issues, and TODO List</span></a></p></li>
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/extern_c/tr1_ref.html" title="TR1 C Functions Quick Reference"><span class="index-entry-level-1">TR1 C Functions Quick Reference</span></a></p></li>
</ul></div>
</li>
@@ -1432,6 +1437,10 @@
</ul></div>
</li>
<li class="listitem" style="list-style-type: none">
+<p><span class="index-entry-level-0">cyl_bessel_j_zero</span></p>
+<div class="index"><ul class="index" style="list-style-type: none; "><li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/special/bessel/bessel0.html" title="Finding Zeros of Bessel Functions of the First and Second Kinds"><span class="index-entry-level-1">Finding Zeros of Bessel Functions of the First and Second Kinds</span></a></p></li></ul></div>
+</li>
+<li class="listitem" style="list-style-type: none">
<p><span class="index-entry-level-0">cyl_bessel_k</span></p>
<div class="index"><ul class="index" style="list-style-type: none; ">
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/main_overview/tr1.html" title="C99 and C++ TR1 C-style Functions"><span class="index-entry-level-1">C99 and C++ TR1 C-style Functions</span></a></p></li>
@@ -1462,6 +1471,7 @@
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/special/bessel/bessel.html" title="Bessel Functions of the First and Second Kinds"><span class="index-entry-level-1">Bessel Functions of the First and Second Kinds</span></a></p></li>
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/main_overview/tr1.html" title="C99 and C++ TR1 C-style Functions"><span class="index-entry-level-1">C99 and C++ TR1 C-style Functions</span></a></p></li>
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/extern_c/tr1.html" title="C99 and TR1 C Functions Overview"><span class="index-entry-level-1">C99 and TR1 C Functions Overview</span></a></p></li>
+<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/status/issues.html" title="Known Issues, and TODO List"><span class="index-entry-level-1">Known Issues, and TODO List</span></a></p></li>
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/extern_c/tr1_ref.html" title="TR1 C Functions Quick Reference"><span class="index-entry-level-1">TR1 C Functions Quick Reference</span></a></p></li>
</ul></div>
</li>
@@ -1481,6 +1491,10 @@
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/extern_c/tr1_ref.html" title="TR1 C Functions Quick Reference"><span class="index-entry-level-1">TR1 C Functions Quick Reference</span></a></p></li>
</ul></div>
</li>
+<li class="listitem" style="list-style-type: none">
+<p><span class="index-entry-level-0">cyl_neumann_zero</span></p>
+<div class="index"><ul class="index" style="list-style-type: none; "><li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/special/bessel/bessel0.html" title="Finding Zeros of Bessel Functions of the First and Second Kinds"><span class="index-entry-level-1">Finding Zeros of Bessel Functions of the First and Second Kinds</span></a></p></li></ul></div>
+</li>
</ul></div></dd>
<dt>
<a name="idx_id_99"></a><span class="term">D</span>
@@ -1886,12 +1900,11 @@
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/dist/stat_tut/weg/geometric_eg.html" title="Geometric Distribution Examples"><span class="index-entry-level-1">expression</span></a></p></li>
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/dist/stat_tut/weg/error_eg.html" title="Error Handling Example"><span class="index-entry-level-1">infinity</span></a></p></li>
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/dist/stat_tut/weg/find_eg/find_location_eg.html" title="Find Location (Mean) Example"><span class="index-entry-level-1">location</span></a></p></li>
-<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/dist/stat_tut/weg/find_eg/find_location_eg.html" title="Find Location (Mean) Example"><span class="index-entry-level-1">mean</span></a></p></li>
-<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/dist/stat_tut/weg/dist_construct_eg.html" title="Distribution Construction Example"><span class="index-entry-level-1">negative_binomial</span></a></p></li>
+<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/dist/stat_tut/weg/dist_construct_eg.html" title="Distribution Construction Examples"><span class="index-entry-level-1">mean</span></a></p></li>
+<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/dist/stat_tut/weg/dist_construct_eg.html" title="Distribution Construction Examples"><span class="index-entry-level-1">negative_binomial</span></a></p></li>
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/dist/stat_tut/weg/geometric_eg.html" title="Geometric Distribution Examples"><span class="index-entry-level-1">normal</span></a></p></li>
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/dist/stat_tut/weg/geometric_eg.html" title="Geometric Distribution Examples"><span class="index-entry-level-1">pdf</span></a></p></li>
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/dist/stat_tut/weg/neg_binom_eg/negative_binomial_example1.html" title="Negative Binomial Sales Quota Example."><span class="index-entry-level-1">quantile</span></a></p></li>
-<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/dist/stat_tut/weg/dist_construct_eg.html" title="Distribution Construction Example"><span class="index-entry-level-1">RR</span></a></p></li>
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/dist/stat_tut/weg/inverse_chi_squared_eg.html" title="Inverse Chi-Squared Distribution Bayes Example"><span class="index-entry-level-1">scale</span></a></p></li>
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/dist/stat_tut/weg/find_eg/find_location_eg.html" title="Find Location (Mean) Example"><span class="index-entry-level-1">standard_deviation</span></a></p></li>
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/dist/stat_tut/weg/normal_example/normal_misc.html" title="Some Miscellaneous Examples of the Normal (Gaussian) Distribution"><span class="index-entry-level-1">test</span></a></p></li>
@@ -2015,6 +2028,7 @@
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/special/factorials/sf_factorial.html" title="Factorial"><span class="index-entry-level-1">Factorial</span></a></p></li>
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/constants/FAQ.html" title="FAQs"><span class="index-entry-level-1">FAQs</span></a></p></li>
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/dist/stat_tut/weg/find_eg/find_scale_eg.html" title="Find Scale (Standard Deviation) Example"><span class="index-entry-level-1">Find Scale (Standard Deviation) Example</span></a></p></li>
+<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/special/bessel/bessel0.html" title="Finding Zeros of Bessel Functions of the First and Second Kinds"><span class="index-entry-level-1">Finding Zeros of Bessel Functions of the First and Second Kinds</span></a></p></li>
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/dist/dist_ref/dists/gamma_dist.html" title="Gamma (and Erlang) Distribution"><span class="index-entry-level-1">Gamma (and Erlang) Distribution</span></a></p></li>
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/dist/stat_tut/weg/geometric_eg.html" title="Geometric Distribution Examples"><span class="index-entry-level-1">Geometric Distribution Examples</span></a></p></li>
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/main_overview/history1.html" title="History and What's New"><span class="index-entry-level-1">History and What's New</span></a></p></li>
@@ -2035,7 +2049,8 @@
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/backgrounders/remez.html" title="The Remez Method"><span class="index-entry-level-1">The Remez Method</span></a></p></li>
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/dist/dist_ref/dists/triangular_dist.html" title="Triangular Distribution"><span class="index-entry-level-1">Triangular Distribution</span></a></p></li>
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/constants/tutorial/templ.html" title="Use in template code"><span class="index-entry-level-1">Use in template code</span></a></p></li>
-<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/using_udt/use_mpfr.html" title="Using With MPFR / GMP - a High-Precision Floating-Point Library"><span class="index-entry-level-1">Using With MPFR / GMP - a High-Precision Floating-Point Library</span></a></p></li>
+<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/using_udt/high_precision/use_mpfr.html" title="Using With MPFR or GMP - High-Precision Floating-Point Library"><span class="index-entry-level-1">Using With MPFR or GMP - High-Precision Floating-Point Library</span></a></p></li>
+<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/using_udt/high_precision/using_test.html" title="Using without expression templates for Boost.Test and others"><span class="index-entry-level-1">Using without expression templates for Boost.Test and others</span></a></p></li>
</ul></div>
</li>
<li class="listitem" style="list-style-type: none">
@@ -2060,11 +2075,7 @@
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/dist/dist_ref/dists/extreme_dist.html" title="Extreme Value Distribution"><span class="index-entry-level-0">extreme_value_distribution</span></a></p></li>
<li class="listitem" style="list-style-type: none">
<p><span class="index-entry-level-0">e_float</span></p>
-<div class="index"><ul class="index" style="list-style-type: none; "><li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/using_udt/e_float.html" title="e_float Support"><span class="index-entry-level-1">e_float Support</span></a></p></li></ul></div>
-</li>
-<li class="listitem" style="list-style-type: none">
-<p><span class="index-entry-level-0">e_float Support</span></p>
-<div class="index"><ul class="index" style="list-style-type: none; "><li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/using_udt/e_float.html" title="e_float Support"><span class="index-entry-level-1">e_float</span></a></p></li></ul></div>
+<div class="index"><ul class="index" style="list-style-type: none; "><li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/using_udt/high_precision/e_float.html" title="Using e_float Library"><span class="index-entry-level-1">Using e_float Library</span></a></p></li></ul></div>
</li>
</ul></div></dd>
<dt>
@@ -2142,6 +2153,14 @@
<div class="index"><ul class="index" style="list-style-type: none; "><li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/utils/next_float/float_prior.html" title="Finding the Next Smaller Representable Value (float_prior)"><span class="index-entry-level-1">float_prior</span></a></p></li></ul></div>
</li>
<li class="listitem" style="list-style-type: none">
+<p><span class="index-entry-level-0">Finding Zeros of Bessel Functions of the First and Second Kinds</span></p>
+<div class="index"><ul class="index" style="list-style-type: none; ">
+<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/special/bessel/bessel0.html" title="Finding Zeros of Bessel Functions of the First and Second Kinds"><span class="index-entry-level-1">cyl_bessel_j_zero</span></a></p></li>
+<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/special/bessel/bessel0.html" title="Finding Zeros of Bessel Functions of the First and Second Kinds"><span class="index-entry-level-1">cyl_neumann_zero</span></a></p></li>
+<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/special/bessel/bessel0.html" title="Finding Zeros of Bessel Functions of the First and Second Kinds"><span class="index-entry-level-1">expression</span></a></p></li>
+</ul></div>
+</li>
+<li class="listitem" style="list-style-type: none">
<p><span class="index-entry-level-0">find_beta</span></p>
<div class="index"><ul class="index" style="list-style-type: none; "><li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/dist/dist_ref/dists/beta_dist.html" title="Beta Distribution"><span class="index-entry-level-1">Beta Distribution</span></a></p></li></ul></div>
</li>
@@ -2441,7 +2460,7 @@
<p><span class="index-entry-level-0">get</span></p>
<div class="index"><ul class="index" style="list-style-type: none; ">
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/constants/new_const.html" title="Defining New Constants"><span class="index-entry-level-1">Defining New Constants</span></a></p></li>
-<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/constants/tutorial/user_def.html" title="Use With User Defined Types"><span class="index-entry-level-1">Use With User Defined Types</span></a></p></li>
+<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/constants/tutorial/user_def.html" title="Use With User-Defined Types"><span class="index-entry-level-1">Use With User-Defined Types</span></a></p></li>
</ul></div>
</li>
<li class="listitem" style="list-style-type: none">
@@ -2982,6 +3001,8 @@
<li class="listitem" style="list-style-type: none">
<p><span class="index-entry-level-0">Known Issues, and TODO List</span></p>
<div class="index"><ul class="index" style="list-style-type: none; ">
+<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/status/issues.html" title="Known Issues, and TODO List"><span class="index-entry-level-1">cyl_bessel_j</span></a></p></li>
+<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/status/issues.html" title="Known Issues, and TODO List"><span class="index-entry-level-1">cyl_neumann</span></a></p></li>
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/status/issues.html" title="Known Issues, and TODO List"><span class="index-entry-level-1">Lanczos approximation</span></a></p></li>
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/status/issues.html" title="Known Issues, and TODO List"><span class="index-entry-level-1">T</span></a></p></li>
</ul></div>
@@ -3057,8 +3078,8 @@
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/perf/tuning.html" title="Performance Tuning Macros"><span class="index-entry-level-1">Performance Tuning Macros</span></a></p></li>
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/backgrounders/refs.html" title="References"><span class="index-entry-level-1">References</span></a></p></li>
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/backgrounders/lanczos.html" title="The Lanczos Approximation"><span class="index-entry-level-1">The Lanczos Approximation</span></a></p></li>
-<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/using_udt/use_mpfr.html" title="Using With MPFR / GMP - a High-Precision Floating-Point Library"><span class="index-entry-level-1">Using With MPFR / GMP - a High-Precision Floating-Point Library</span></a></p></li>
-<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/using_udt/use_ntl.html" title="Using With NTL - a High-Precision Floating-Point Library"><span class="index-entry-level-1">Using With NTL - a High-Precision Floating-Point Library</span></a></p></li>
+<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/using_udt/high_precision/use_ntl.html" title="Using NTL Library"><span class="index-entry-level-1">Using NTL Library</span></a></p></li>
+<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/using_udt/high_precision/use_mpfr.html" title="Using With MPFR or GMP - High-Precision Floating-Point Library"><span class="index-entry-level-1">Using With MPFR or GMP - High-Precision Floating-Point Library</span></a></p></li>
</ul></div>
</li>
<li class="listitem" style="list-style-type: none">
@@ -3431,6 +3452,7 @@
<li class="listitem" style="list-style-type: none">
<p><span class="index-entry-level-0">mean</span></p>
<div class="index"><ul class="index" style="list-style-type: none; ">
+<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/dist/stat_tut/weg/dist_construct_eg.html" title="Distribution Construction Examples"><span class="index-entry-level-1">Distribution Construction Examples</span></a></p></li>
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/dist/stat_tut/weg/find_eg/find_location_eg.html" title="Find Location (Mean) Example"><span class="index-entry-level-1">Find Location (Mean) Example</span></a></p></li>
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/dist/stat_tut/weg/find_eg/find_scale_eg.html" title="Find Scale (Standard Deviation) Example"><span class="index-entry-level-1">Find Scale (Standard Deviation) Example</span></a></p></li>
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/dist/dist_ref/dists/geometric_dist.html" title="Geometric Distribution"><span class="index-entry-level-1">Geometric Distribution</span></a></p></li>
@@ -3548,7 +3570,7 @@
<li class="listitem" style="list-style-type: none">
<p><span class="index-entry-level-0">negative_binomial</span></p>
<div class="index"><ul class="index" style="list-style-type: none; ">
-<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/dist/stat_tut/weg/dist_construct_eg.html" title="Distribution Construction Example"><span class="index-entry-level-1">Distribution Construction Example</span></a></p></li>
+<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/dist/stat_tut/weg/dist_construct_eg.html" title="Distribution Construction Examples"><span class="index-entry-level-1">Distribution Construction Examples</span></a></p></li>
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/dist/dist_ref/dists/negative_binomial_dist.html" title="Negative Binomial Distribution"><span class="index-entry-level-1">Negative Binomial Distribution</span></a></p></li>
</ul></div>
</li>
@@ -4154,10 +4176,6 @@
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/extern_c/c99.html" title="C99 C Functions"><span class="index-entry-level-1">C99 C Functions</span></a></p></li>
</ul></div>
</li>
-<li class="listitem" style="list-style-type: none">
-<p><span class="index-entry-level-0">RR</span></p>
-<div class="index"><ul class="index" style="list-style-type: none; "><li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/dist/stat_tut/weg/dist_construct_eg.html" title="Distribution Construction Example"><span class="index-entry-level-1">Distribution Construction Example</span></a></p></li></ul></div>
-</li>
</ul></div></dd>
<dt>
<a name="idx_id_114"></a><span class="term">S</span>
@@ -4300,6 +4318,7 @@
</li>
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/special/sinc/sinc_pi.html" title="sinc_pi"><span class="index-entry-level-0">sinc_pi</span></a></p></li>
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/special/sinc/sinhc_pi.html" title="sinhc_pi"><span class="index-entry-level-0">sinhc_pi</span></a></p></li>
+<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/special/powers/sin_pi.html" title="sin_pi"><span class="index-entry-level-0">sin_pi</span></a></p></li>
<li class="listitem" style="list-style-type: none">
<p><span class="index-entry-level-0">Skew Normal Distribution</span></p>
<div class="index"><ul class="index" style="list-style-type: none; ">
@@ -4725,11 +4744,11 @@
</ul></div>
</li>
<li class="listitem" style="list-style-type: none">
-<p><span class="index-entry-level-0">Use With User Defined Types</span></p>
+<p><span class="index-entry-level-0">Use With User-Defined Types</span></p>
<div class="index"><ul class="index" style="list-style-type: none; ">
-<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/constants/tutorial/user_def.html" title="Use With User Defined Types"><span class="index-entry-level-1">constants</span></a></p></li>
-<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/constants/tutorial/user_def.html" title="Use With User Defined Types"><span class="index-entry-level-1">construction_traits</span></a></p></li>
-<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/constants/tutorial/user_def.html" title="Use With User Defined Types"><span class="index-entry-level-1">get</span></a></p></li>
+<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/constants/tutorial/user_def.html" title="Use With User-Defined Types"><span class="index-entry-level-1">constants</span></a></p></li>
+<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/constants/tutorial/user_def.html" title="Use With User-Defined Types"><span class="index-entry-level-1">construction_traits</span></a></p></li>
+<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/constants/tutorial/user_def.html" title="Use With User-Defined Types"><span class="index-entry-level-1">get</span></a></p></li>
</ul></div>
</li>
<li class="listitem" style="list-style-type: none">
@@ -4790,6 +4809,18 @@
</ul></div>
</li>
<li class="listitem" style="list-style-type: none">
+<p><span class="index-entry-level-0">Using Boost.Math with High-Precision Floating-Point Libraries</span></p>
+<div class="index"><ul class="index" style="list-style-type: none; "><li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/using_udt/high_precision.html" title="Using Boost.Math with High-Precision Floating-Point Libraries"><span class="index-entry-level-1">constants</span></a></p></li></ul></div>
+</li>
+<li class="listitem" style="list-style-type: none">
+<p><span class="index-entry-level-0">Using Boost.Multiprecision</span></p>
+<div class="index"><ul class="index" style="list-style-type: none; "><li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/using_udt/high_precision/use_multiprecision.html" title="Using Boost.Multiprecision"><span class="index-entry-level-1">constants</span></a></p></li></ul></div>
+</li>
+<li class="listitem" style="list-style-type: none">
+<p><span class="index-entry-level-0">Using e_float Library</span></p>
+<div class="index"><ul class="index" style="list-style-type: none; "><li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/using_udt/high_precision/e_float.html" title="Using e_float Library"><span class="index-entry-level-1">e_float</span></a></p></li></ul></div>
+</li>
+<li class="listitem" style="list-style-type: none">
<p><span class="index-entry-level-0">Using Macros to Change the Policy Defaults</span></p>
<div class="index"><ul class="index" style="list-style-type: none; ">
<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/policy/pol_ref/policy_defaults.html" title="Using Macros to Change the Policy Defaults"><span class="index-entry-level-1">BOOST_MATH_ASSERT_UNDEFINED_POLICY</span></a></p></li>
@@ -4810,15 +4841,23 @@
</ul></div>
</li>
<li class="listitem" style="list-style-type: none">
-<p><span class="index-entry-level-0">Using With MPFR / GMP - a High-Precision Floating-Point Library</span></p>
+<p><span class="index-entry-level-0">Using NTL Library</span></p>
+<div class="index"><ul class="index" style="list-style-type: none; "><li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/using_udt/high_precision/use_ntl.html" title="Using NTL Library"><span class="index-entry-level-1">Lanczos approximation</span></a></p></li></ul></div>
+</li>
+<li class="listitem" style="list-style-type: none">
+<p><span class="index-entry-level-0">Using with GCC's __float128 datatype</span></p>
+<div class="index"><ul class="index" style="list-style-type: none; "><li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/using_udt/high_precision/float128.html" title="Using with GCC's __float128 datatype"><span class="index-entry-level-1">constants</span></a></p></li></ul></div>
+</li>
+<li class="listitem" style="list-style-type: none">
+<p><span class="index-entry-level-0">Using With MPFR or GMP - High-Precision Floating-Point Library</span></p>
<div class="index"><ul class="index" style="list-style-type: none; ">
-<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/using_udt/use_mpfr.html" title="Using With MPFR / GMP - a High-Precision Floating-Point Library"><span class="index-entry-level-1">expression</span></a></p></li>
-<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/using_udt/use_mpfr.html" title="Using With MPFR / GMP - a High-Precision Floating-Point Library"><span class="index-entry-level-1">Lanczos approximation</span></a></p></li>
+<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/using_udt/high_precision/use_mpfr.html" title="Using With MPFR or GMP - High-Precision Floating-Point Library"><span class="index-entry-level-1">expression</span></a></p></li>
+<li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/using_udt/high_precision/use_mpfr.html" title="Using With MPFR or GMP - High-Precision Floating-Point Library"><span class="index-entry-level-1">Lanczos approximation</span></a></p></li>
</ul></div>
</li>
<li class="listitem" style="list-style-type: none">
-<p><span class="index-entry-level-0">Using With NTL - a High-Precision Floating-Point Library</span></p>
-<div class="index"><ul class="index" style="list-style-type: none; "><li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/using_udt/use_ntl.html" title="Using With NTL - a High-Precision Floating-Point Library"><span class="index-entry-level-1">Lanczos approximation</span></a></p></li></ul></div>
+<p><span class="index-entry-level-0">Using without expression templates for Boost.Test and others</span></p>
+<div class="index"><ul class="index" style="list-style-type: none; "><li class="listitem" style="list-style-type: none"><p><a class="link" href="../math_toolkit/using_udt/high_precision/using_test.html" title="Using without expression templates for Boost.Test and others"><span class="index-entry-level-1">expression</span></a></p></li></ul></div>
</li>
</ul></div></dd>
<dt>
@@ -4933,9 +4972,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="perf/perf_test_app.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="backgrounders/implementation.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_backgrounders">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="math_toolkit.backgrounders"></a><a class="link" href="backgrounders.html" title="Backgrounders">Backgrounders</a>
</h2></div></div></div>
@@ -37,9 +37,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/implementation.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/implementation.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/implementation.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="../backgrounders.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../backgrounders.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="relative_error.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_backgrounders_implementation">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.backgrounders.implementation"></a><a class="link" href="implementation.html" title="Additional Implementation Notes">Additional
Implementation Notes</a>
@@ -252,9 +252,10 @@
<th align="left">Warning</th>
</tr>
<tr><td align="left" valign="top"><p>
- If <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">numeric_limits</span><span class="special"><</span><span class="identifier">T</span><span class="special">>::</span><span class="identifier">has_quiet_NaN</span></code> is false (for example T
- is a User-defined type), then an exception will always be thrown when a
- domain error occurs. Catching exceptions is therefore strongly recommended.
+ If <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">numeric_limits</span><span class="special"><</span><span class="identifier">T</span><span class="special">>::</span><span class="identifier">has_quiet_NaN</span></code> is false (for example,
+ if T is a User-defined type without NaN support), then an exception will
+ always be thrown when a domain error occurs. Catching exceptions is therefore
+ strongly recommended.
</p></td></tr>
</table></div>
<h5>
@@ -442,8 +443,9 @@
A macro BOOST_DEFINE_MATH_CONSTANT in constants.hpp is used to provide high
accuracy constants to mathematical functions and distributions, since it
is important to provide values uniformly for both built-in float, double
- and long double types, and for User Defined types like NTL::quad_float and
- NTL::RR.
+ and long double types, and for User Defined types in Boost.Multiprecision
+ like cpp_dec_float.
+ and others like NTL::quad_float and NTL::RR.
</p>
<p>
To permit calculations in this Math ToolKit and its tests, (and elsewhere)
@@ -500,24 +502,26 @@
safety</a>
</h5>
<p>
- Reporting of error by setting errno should be thread safe already (otherwise
- none of the std lib math functions would be thread safe?). If you turn on
- reporting of errors via exceptions, errno gets left unused anyway.
- </p>
-<p>
- Other than that, the code is intended to be thread safe <span class="bold"><strong>for
- built in real-number types</strong></span> : so float, double and long double
- are all thread safe.
- </p>
-<p>
- For non-built-in types - NTL::RR for example - initialisation of the various
- constants used in the implementation is potentially <span class="bold"><strong>not</strong></span>
- thread safe. This most undesiable, but it would be a signficant challenge
- to fix it. Some compilers may offer the option of having static-constants
- initialised in a thread safe manner (Commeau, and maybe others?), if that's
- the case then the problem is solved. This is a topic of hot debate for the
- next C++ std revision, so hopefully all compilers will be required to do
- the right thing here at some point.
+ Reporting of error by setting <code class="computeroutput"><span class="identifier">errno</span></code>
+ should be thread-safe already (otherwise none of the std lib math functions
+ would be thread safe?). If you turn on reporting of errors via exceptions,
+ <code class="computeroutput"><span class="identifier">errno</span></code> gets left unused anyway.
+ </p>
+<p>
+ For normal C++ usage, the Boost.Math <code class="computeroutput"><span class="keyword">static</span>
+ <span class="keyword">const</span></code> constants are now thread-safe
+ so for built-in real-number types: <code class="computeroutput"><span class="keyword">float</span></code>,
+ <code class="computeroutput"><span class="keyword">double</span></code> and <code class="computeroutput"><span class="keyword">long</span>
+ <span class="keyword">double</span></code> are all thread safe.
+ </p>
+<p>
+ For User_defined types, for example, cpp_dec_float,
+ the Boost.Math should also be thread-safe, (thought we are unsure how to
+ rigorously prove this).
+ </p>
+<p>
+ (Thread safety has received attention in the C++11 Standard revision, so
+ hopefully all compilers will do the right thing here at some point.)
</p>
<h5>
<a name="math_toolkit.backgrounders.implementation.h12"></a>
@@ -838,9 +842,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/lanczos.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/lanczos.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/lanczos.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="relative_error.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../backgrounders.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="remez.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_backgrounders_lanczos">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.backgrounders.lanczos"></a><a class="link" href="lanczos.html" title="The Lanczos Approximation">The Lanczos Approximation</a>
</h3></div></div></div>
@@ -559,9 +559,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/refs.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/refs.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/refs.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="remez.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../backgrounders.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../status.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_backgrounders_refs">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.backgrounders.refs"></a><a class="link" href="refs.html" title="References">References</a>
</h3></div></div></div>
@@ -47,14 +47,12 @@
D.C.
</p>
<p>
- NIST Handbook of Mathematical Functions
- </p>
-<p>
- Edited by: Frank W. J. Olver, University of Maryland and National Institute
- of Standards and Technology, Maryland, Daniel W. Lozier, National Institute
- of Standards and Technology, Maryland, Ronald F. Boisvert, National Institute
- of Standards and Technology, Maryland, Charles W. Clark, National Institute
- of Standards and Technology, Maryland and University of Maryland.
+ NIST Handbook of Mathematical Functions Edited by: Frank W. J. Olver, University
+ of Maryland and National Institute of Standards and Technology, Maryland,
+ Daniel W. Lozier, National Institute of Standards and Technology, Maryland,
+ Ronald F. Boisvert, National Institute of Standards and Technology, Maryland,
+ Charles W. Clark, National Institute of Standards and Technology, Maryland
+ and University of Maryland.
</p>
<p>
ISBN: 978-0521140638 (paperback), 9780521192255 (hardback), July 2010, Cambridge
@@ -202,9 +200,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/relative_error.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/relative_error.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/relative_error.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="implementation.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../backgrounders.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="lanczos.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_backgrounders_relative_error">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.backgrounders.relative_error"></a><a class="link" href="relative_error.html" title="Relative Error">Relative Error</a>
</h3></div></div></div>
@@ -88,15 +88,16 @@
of guard digits. However it should be remembered that if the result is a
<span class="emphasis"><em>transcendental number</em></span> then as a point of principle we
can never be sure that the result is accurate to more than 1 ulp. This is
- an example of <span class="emphasis"><em>the table makers dilemma</em></span>: consider what
- happens if the first guard digit is a one, and the remaining guard digits
- are all zero. Do we have a tie or not? Since the only thing we can tell about
- a transcendental number is that its digits have no particular pattern, we
- can never tell if we have a tie, no matter how many guard digits we have.
- Therefore, we can never be completely sure that the result has been rounded
- in the right direction. Of course, transcendental numbers that just happen
- to be a tie - for however many guard digits we have - are extremely rare,
- and get rarer the more guard digits we have, but even so....
+ an example of what http://en.wikipedia.org/wiki/William_Kahan
+ called http://en.wikipedia.org/wiki/Rounding#The_table-maker.27s_dilemma:
+ consider what happens if the first guard digit is a one, and the remaining
+ guard digits are all zero. Do we have a tie or not? Since the only thing
+ we can tell about a transcendental number is that its digits have no particular
+ pattern, we can never tell if we have a tie, no matter how many guard digits
+ we have. Therefore, we can never be completely sure that the result has been
+ rounded in the right direction. Of course, transcendental numbers that just
+ happen to be a tie - for however many guard digits we have - are extremely
+ rare, and get rarer the more guard digits we have, but even so....
</p>
<p>
Refer to the classic text <a href="http://docs.sun.com/source/806-3568/ncg_goldberg.html" target="_top">What
@@ -106,9 +107,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/remez.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/remez.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/remez.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="lanczos.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../backgrounders.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="refs.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_backgrounders_remez">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.backgrounders.remez"></a><a class="link" href="remez.html" title="The Remez Method">The Remez Method</a>
</h3></div></div></div>
@@ -527,9 +527,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/constants.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/constants.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/constants.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="extern_c/tr1_ref.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="constants/intro.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_constants">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="math_toolkit.constants"></a><a class="link" href="constants.html" title="Mathematical Constants">Mathematical Constants</a>
</h2></div></div></div>
@@ -35,7 +35,7 @@
<dt><span class="section"><a href="constants/tutorial/templ.html">Use in template
code</a></span></dt>
<dt><span class="section"><a href="constants/tutorial/user_def.html">Use With
- User Defined Types</a></span></dt>
+ User-Defined Types</a></span></dt>
</dl></dd>
<dt><span class="section">The Mathematical Constants</span></dt>
<dt><span class="section">Defining New Constants</span></dt>
@@ -44,9 +44,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/constants/FAQ.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/constants/FAQ.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/constants/FAQ.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="new_const.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../constants.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../toolkit.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_constants_FAQ">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.constants.FAQ"></a><a class="link" href="FAQ.html" title="FAQs">FAQs</a>
</h3></div></div></div>
@@ -330,6 +330,9 @@
floating-point types is rather odd and values given are only approximate.
</p></td></tr>
</table></div>
+<p>
+ <span class="bold"><strong>New projects should use Boost.Multiprecision.</strong></span>
+ </p>
<h6>
<a name="math_toolkit.constants.FAQ.h11"></a>
<span class="phrase"><a name="math_toolkit.constants.FAQ.ntl_class_rr"></a></span><a class="link" href="FAQ.html#math_toolkit.constants.FAQ.ntl_class_rr">NTL
@@ -341,12 +344,16 @@
enough for many practical non-'number-theoretic' C++ applications.
</p>
<p>
- NTL is <span class="bold"><strong>not licenced for commercial use</strong></span>.
+ NTL A Library for doing Number Theory
+ is <span class="bold"><strong>not licenced for commercial use</strong></span>.
</p>
<p>
- This class is used in Boost.Math and an option when using big_number projects
+ This class is used in Boost.Math and is an option when using big_number projects
to calculate new math constants.
</p>
+<p>
+ <span class="bold"><strong>New projects should use Boost.Multiprecision.</strong></span>
+ </p>
<h6>
<a name="math_toolkit.constants.FAQ.h12"></a>
<span class="phrase"><a name="math_toolkit.constants.FAQ.gmp_and_mpfr"></a></span><a class="link" href="FAQ.html#math_toolkit.constants.FAQ.gmp_and_mpfr">GMP
@@ -445,7 +452,7 @@
</p>
<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
- Are measurements.
+ Are measurements, not truely constants.
</li>
<li class="listitem">
Are not truly constant and keeping changing as mensuration technology
@@ -465,9 +472,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/constants/constants.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/constants/constants.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/constants/constants.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -6,7 +6,7 @@
<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<link rel="home" href="../../index.html" title="Math Toolkit">
<link rel="up" href="../constants.html" title="Mathematical Constants">
-<link rel="prev" href="tutorial/user_def.html" title="Use With User Defined Types">
+<link rel="prev" href="tutorial/user_def.html" title="Use With User-Defined Types">
<link rel="next" href="new_const.html" title="Defining New Constants">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="tutorial/user_def.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../constants.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="new_const.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_constants_constants">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.constants.constants"></a><a class="link" href="constants.html" title="The Mathematical Constants">The Mathematical Constants</a>
</h3></div></div></div>
@@ -1474,9 +1474,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/constants/intro.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/constants/intro.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/constants/intro.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="../constants.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../constants.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="tutorial.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_constants_intro">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.constants.intro"></a><a class="link" href="intro.html" title="Introduction">Introduction</a>
</h3></div></div></div>
@@ -72,17 +72,35 @@
</ul></div>
</li>
<li class="listitem">
- Faster - can avoid (re-)calculation at runtime. This can be significant
- if:
+ Portable - as possible between different systems using different floating-point
+ precisions: see <a class="link" href="tutorial/templ.html" title="Use in template code">use
+ in template code</a>.
+ </li>
+<li class="listitem">
+ Tested - by comparison with other published sources, or separately computed
+ at long double precision.
+ </li>
+<li class="listitem">
+ Faster - can avoid (re-)calculation at runtime.
<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: circle; ">
<li class="listitem">
+ If the value returned is a builtin type then it's returned by value
+ as a <code class="computeroutput"><span class="identifier">constexpr</span></code>
+ (C++11 feature, if available).
+ </li>
+<li class="listitem">
+ If the value is computed and cached (or constructed from a string
+ representation and cached), then it's returned by constant reference.<br>
+ This can be significant if:
+ </li>
+<li class="listitem">
Functions pow, trig or log are used.
</li>
<li class="listitem">
Inside an inner loop.
</li>
<li class="listitem">
- Using a high-precision UDT.
+ Using a high-precision UDT like Boost.Multiprecision.
</li>
<li class="listitem">
Compiler optimizations possible with built-in types, especially
@@ -90,22 +108,13 @@
</li>
</ul></div>
</li>
-<li class="listitem">
- Portable - as possible between different systems using different floating-point
- precisions: see <a class="link" href="tutorial/templ.html" title="Use in template code">use
- in template code</a>.
- </li>
-<li class="listitem">
- Tested - by comparison with other published sources, or separately computed
- at long double precision.
- </li>
</ul></div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/constants/new_const.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/constants/new_const.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/constants/new_const.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="constants.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../constants.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="FAQ.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_constants_new_const">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.constants.new_const"></a><a class="link" href="new_const.html" title="Defining New Constants">Defining New Constants</a>
</h3></div></div></div>
@@ -252,9 +252,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/constants/tutorial.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/constants/tutorial.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/constants/tutorial.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="intro.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../constants.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="tutorial/non_templ.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_constants_tutorial">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.constants.tutorial"></a><a class="link" href="tutorial.html" title="Tutorial">Tutorial</a>
</h3></div></div></div>
@@ -32,14 +32,14 @@
<dt><span class="section"><a href="tutorial/templ.html">Use in template
code</a></span></dt>
<dt><span class="section"><a href="tutorial/user_def.html">Use With
- User Defined Types</a></span></dt>
+ User-Defined Types</a></span></dt>
</dl></div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/constants/tutorial/non_templ.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/constants/tutorial/non_templ.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/constants/tutorial/non_templ.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="../tutorial.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../tutorial.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="templ.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_constants_tutorial_non_templ">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.constants.tutorial.non_templ"></a><a class="link" href="non_templ.html" title="Use in non-template code">Use in non-template
code</a>
@@ -71,9 +71,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/constants/tutorial/templ.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/constants/tutorial/templ.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/constants/tutorial/templ.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -7,7 +7,7 @@
<link rel="home" href="../../../index.html" title="Math Toolkit">
<link rel="up" href="../tutorial.html" title="Tutorial">
<link rel="prev" href="non_templ.html" title="Use in non-template code">
-<link rel="next" href="user_def.html" title="Use With User Defined Types">
+<link rel="next" href="user_def.html" title="Use With User-Defined Types">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="non_templ.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../tutorial.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="user_def.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_constants_tutorial_templ">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.constants.tutorial.templ"></a><a class="link" href="templ.html" title="Use in template code">Use in template
code</a>
@@ -149,9 +149,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/constants/tutorial/user_def.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/constants/tutorial/user_def.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/constants/tutorial/user_def.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -1,7 +1,7 @@
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Use With User Defined Types</title>
+<title>Use With User-Defined Types</title>
<link rel="stylesheet" href="../../../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<link rel="home" href="../../../index.html" title="Math Toolkit">
@@ -22,12 +22,16 @@
<div class="spirit-nav">
<a accesskey="p" href="templ.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../tutorial.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../constants.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_constants_tutorial_user_def">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.constants.tutorial.user_def"></a><a class="link" href="user_def.html" title="Use With User Defined Types">Use With
- User Defined Types</a>
+<a name="math_toolkit.constants.tutorial.user_def"></a><a class="link" href="user_def.html" title="Use With User-Defined Types">Use With
+ User-Defined Types</a>
</h4></div></div></div>
<p>
+ The most common example of a high-precision user-defined type will probably
+ be Boost.Multiprecision.
+ </p>
+<p>
The syntax for using the function-call constants with user-defined types
is the same as it is in the template class, which is to say we use:
</p>
@@ -36,8 +40,16 @@
<span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">constants</span><span class="special">::</span><span class="identifier">pi</span><span class="special"><</span><span class="identifier">UserDefinedType</span><span class="special">>();</span>
</pre>
<p>
+ For example:
+ </p>
+<pre class="programlisting"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">constants</span><span class="special">::</span><span class="identifier">pi</span><span class="special"><</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">multiprecision</span><span class="special">::</span><span class="identifier">cpp_dec_float_50</span><span class="special">>();</span>
+</pre>
+<p>
+ giving π with a precision of 50 decimal digits.
+ </p>
+<p>
However, since the precision of the user-defined type may be much greater
- than that of the built-in floating pointer types, how the value returned
+ than that of the built-in floating point types, how the value returned
is created is as follows:
</p>
<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
@@ -67,13 +79,23 @@
function call that returns the constant will be a <code class="computeroutput"><span class="identifier">constexp</span></code>.
</li>
<li class="listitem">
+ If the precision is less than or equal to that of a <code class="computeroutput"><span class="identifier">__float128</span></code> (and the compiler
+ supports such a type) and the type is constructable from a <code class="computeroutput"><span class="identifier">__float128</span></code> then our code returns
+ a <code class="computeroutput"><span class="identifier">__float128</span></code>
+ literal. If the user-defined type is a literal type then the
+ function call that returns the constant will be a <code class="computeroutput"><span class="identifier">constexp</span></code>.
+ </li>
+<li class="listitem">
If the precision is less than 100 decimal digits, then the constant
will be constructed (just the once, then cached in a thread-safe
- manner) from a string representation of the constant.
+ manner) from a string representation of the constant. In this
+ case the value is returned as a const reference to the cached
+ value.
</li>
<li class="listitem">
Otherwise the value is computed (just once, then cached in a
- thread-safe manner).
+ thread-safe manner). In this case the value is returned as a
+ const reference to the cached value.
</li>
</ul></div>
</li>
@@ -298,9 +320,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="main_overview/contact.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="dist/stat_tut.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="math_toolkit.dist"></a><a class="link" href="dist.html" title="Statistical Distributions and Functions">Statistical Distributions and Functions</a>
</h2></div></div></div>
@@ -47,7 +47,7 @@
<dt><span class="section">Worked Examples</span></dt>
<dd><dl>
<dt><span class="section"><a href="dist/stat_tut/weg/dist_construct_eg.html">Distribution
- Construction Example</a></span></dt>
+ Construction Examples</a></span></dt>
<dt><span class="section"><a href="dist/stat_tut/weg/st_eg.html">Student's t
Distribution Examples</a></span></dt>
<dd><dl>
@@ -209,9 +209,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="stat_tut/dist_params.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dist.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="dist_ref/nmp.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_dist_ref">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.dist.dist_ref"></a><a class="link" href="dist_ref.html" title="Statistical Distributions Reference">Statistical Distributions
Reference</a>
@@ -98,9 +98,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dist_algorithms.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dist_algorithms.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dist_algorithms.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="dists/weibull_dist.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dist_ref.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../future.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_dist_ref_dist_algorithms">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.dist.dist_ref.dist_algorithms"></a><a class="link" href="dist_algorithms.html" title="Distribution Algorithms">Distribution
Algorithms</a>
@@ -128,9 +128,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="nmp.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dist_ref.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="dists/bernoulli_dist.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_dist_ref_dists">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.dist.dist_ref.dists"></a><a class="link" href="dists.html" title="Distributions">Distributions</a>
</h4></div></div></div>
@@ -91,9 +91,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/bernoulli_dist.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/bernoulli_dist.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/bernoulli_dist.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="../dists.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dists.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="beta_dist.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_dist_ref_dists_bernoulli_dist">
<div class="titlepage"><div><div><h5 class="title">
<a name="math_toolkit.dist.dist_ref.dists.bernoulli_dist"></a><a class="link" href="bernoulli_dist.html" title="Bernoulli Distribution">Bernoulli
Distribution</a>
@@ -343,9 +343,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/beta_dist.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/beta_dist.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/beta_dist.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="bernoulli_dist.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dists.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="binomial_dist.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_dist_ref_dists_beta_dist">
<div class="titlepage"><div><div><h5 class="title">
<a name="math_toolkit.dist.dist_ref.dists.beta_dist"></a><a class="link" href="beta_dist.html" title="Beta Distribution">Beta
Distribution</a>
@@ -611,9 +611,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/binomial_dist.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/binomial_dist.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/binomial_dist.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="beta_dist.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dists.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="cauchy_dist.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_dist_ref_dists_binomial_dist">
<div class="titlepage"><div><div><h5 class="title">
<a name="math_toolkit.dist.dist_ref.dists.binomial_dist"></a><a class="link" href="binomial_dist.html" title="Binomial Distribution">Binomial
Distribution</a>
@@ -904,9 +904,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/cauchy_dist.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/cauchy_dist.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/cauchy_dist.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="binomial_dist.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dists.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="chi_squared_dist.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_dist_ref_dists_cauchy_dist">
<div class="titlepage"><div><div><h5 class="title">
<a name="math_toolkit.dist.dist_ref.dists.cauchy_dist"></a><a class="link" href="cauchy_dist.html" title="Cauchy-Lorentz Distribution">Cauchy-Lorentz
Distribution</a>
@@ -293,9 +293,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/chi_squared_dist.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/chi_squared_dist.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/chi_squared_dist.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="cauchy_dist.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dists.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="exp_dist.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_dist_ref_dists_chi_squared_dist">
<div class="titlepage"><div><div><h5 class="title">
<a name="math_toolkit.dist.dist_ref.dists.chi_squared_dist"></a><a class="link" href="chi_squared_dist.html" title="Chi Squared Distribution">Chi
Squared Distribution</a>
@@ -399,9 +399,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/exp_dist.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/exp_dist.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/exp_dist.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="chi_squared_dist.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dists.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="extreme_dist.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_dist_ref_dists_exp_dist">
<div class="titlepage"><div><div><h5 class="title">
<a name="math_toolkit.dist.dist_ref.dists.exp_dist"></a><a class="link" href="exp_dist.html" title="Exponential Distribution">Exponential
Distribution</a>
@@ -317,9 +317,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/extreme_dist.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/extreme_dist.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/extreme_dist.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="exp_dist.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dists.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="f_dist.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_dist_ref_dists_extreme_dist">
<div class="titlepage"><div><div><h5 class="title">
<a name="math_toolkit.dist.dist_ref.dists.extreme_dist"></a><a class="link" href="extreme_dist.html" title="Extreme Value Distribution">Extreme
Value Distribution</a>
@@ -319,9 +319,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/f_dist.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/f_dist.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/f_dist.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="extreme_dist.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dists.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="gamma_dist.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_dist_ref_dists_f_dist">
<div class="titlepage"><div><div><h5 class="title">
<a name="math_toolkit.dist.dist_ref.dists.f_dist"></a><a class="link" href="f_dist.html" title="F Distribution">F Distribution</a>
</h5></div></div></div>
@@ -426,9 +426,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/gamma_dist.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/gamma_dist.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/gamma_dist.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="f_dist.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dists.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="geometric_dist.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_dist_ref_dists_gamma_dist">
<div class="titlepage"><div><div><h5 class="title">
<a name="math_toolkit.dist.dist_ref.dists.gamma_dist"></a><a class="link" href="gamma_dist.html" title="Gamma (and Erlang) Distribution">Gamma
(and Erlang) Distribution</a>
@@ -360,9 +360,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/geometric_dist.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/geometric_dist.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/geometric_dist.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="gamma_dist.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dists.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="hypergeometric_dist.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_dist_ref_dists_geometric_dist">
<div class="titlepage"><div><div><h5 class="title">
<a name="math_toolkit.dist.dist_ref.dists.geometric_dist"></a><a class="link" href="geometric_dist.html" title="Geometric Distribution">Geometric
Distribution</a>
@@ -848,9 +848,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/hypergeometric_dist.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/hypergeometric_dist.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/hypergeometric_dist.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="geometric_dist.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dists.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="inverse_chi_squared_dist.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_dist_ref_dists_hypergeometric_dist">
<div class="titlepage"><div><div><h5 class="title">
<a name="math_toolkit.dist.dist_ref.dists.hypergeometric_dist"></a><a class="link" href="hypergeometric_dist.html" title="Hypergeometric Distribution">Hypergeometric
Distribution</a>
@@ -327,9 +327,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/inverse_chi_squared_dist.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/inverse_chi_squared_dist.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/inverse_chi_squared_dist.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="hypergeometric_dist.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dists.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="inverse_gamma_dist.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_dist_ref_dists_inverse_chi_squared_dist">
<div class="titlepage"><div><div><h5 class="title">
<a name="math_toolkit.dist.dist_ref.dists.inverse_chi_squared_dist"></a><a class="link" href="inverse_chi_squared_dist.html" title="Inverse Chi Squared Distribution">Inverse
Chi Squared Distribution</a>
@@ -466,9 +466,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/inverse_gamma_dist.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/inverse_gamma_dist.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/inverse_gamma_dist.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="inverse_chi_squared_dist.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dists.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="inverse_gaussian_dist.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_dist_ref_dists_inverse_gamma_dist">
<div class="titlepage"><div><div><h5 class="title">
<a name="math_toolkit.dist.dist_ref.dists.inverse_gamma_dist"></a><a class="link" href="inverse_gamma_dist.html" title="Inverse Gamma Distribution">Inverse
Gamma Distribution</a>
@@ -363,9 +363,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/inverse_gaussian_dist.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/inverse_gaussian_dist.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/inverse_gaussian_dist.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="inverse_gamma_dist.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dists.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="laplace_dist.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_dist_ref_dists_inverse_gaussian_dist">
<div class="titlepage"><div><div><h5 class="title">
<a name="math_toolkit.dist.dist_ref.dists.inverse_gaussian_dist"></a><a class="link" href="inverse_gaussian_dist.html" title="Inverse Gaussian (or Inverse Normal) Distribution">Inverse
Gaussian (or Inverse Normal) Distribution</a>
@@ -436,9 +436,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/laplace_dist.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/laplace_dist.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/laplace_dist.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="inverse_gaussian_dist.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dists.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="logistic_dist.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_dist_ref_dists_laplace_dist">
<div class="titlepage"><div><div><h5 class="title">
<a name="math_toolkit.dist.dist_ref.dists.laplace_dist"></a><a class="link" href="laplace_dist.html" title="Laplace Distribution">Laplace
Distribution</a>
@@ -349,9 +349,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/logistic_dist.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/logistic_dist.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/logistic_dist.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="laplace_dist.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dists.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="lognormal_dist.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_dist_ref_dists_logistic_dist">
<div class="titlepage"><div><div><h5 class="title">
<a name="math_toolkit.dist.dist_ref.dists.logistic_dist"></a><a class="link" href="logistic_dist.html" title="Logistic Distribution">Logistic
Distribution</a>
@@ -285,9 +285,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/lognormal_dist.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/lognormal_dist.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/lognormal_dist.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="logistic_dist.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dists.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="negative_binomial_dist.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_dist_ref_dists_lognormal_dist">
<div class="titlepage"><div><div><h5 class="title">
<a name="math_toolkit.dist.dist_ref.dists.lognormal_dist"></a><a class="link" href="lognormal_dist.html" title="Log Normal Distribution">Log
Normal Distribution</a>
@@ -317,9 +317,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/nc_beta_dist.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/nc_beta_dist.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/nc_beta_dist.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="negative_binomial_dist.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dists.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="nc_chi_squared_dist.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_dist_ref_dists_nc_beta_dist">
<div class="titlepage"><div><div><h5 class="title">
<a name="math_toolkit.dist.dist_ref.dists.nc_beta_dist"></a><a class="link" href="nc_beta_dist.html" title="Noncentral Beta Distribution">Noncentral
Beta Distribution</a>
@@ -401,9 +401,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/nc_chi_squared_dist.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/nc_chi_squared_dist.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/nc_chi_squared_dist.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="nc_beta_dist.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dists.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="nc_f_dist.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_dist_ref_dists_nc_chi_squared_dist">
<div class="titlepage"><div><div><h5 class="title">
<a name="math_toolkit.dist.dist_ref.dists.nc_chi_squared_dist"></a><a class="link" href="nc_chi_squared_dist.html" title="Noncentral Chi-Squared Distribution">Noncentral
Chi-Squared Distribution</a>
@@ -499,9 +499,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/nc_f_dist.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/nc_f_dist.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/nc_f_dist.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="nc_chi_squared_dist.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dists.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="nc_t_dist.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_dist_ref_dists_nc_f_dist">
<div class="titlepage"><div><div><h5 class="title">
<a name="math_toolkit.dist.dist_ref.dists.nc_f_dist"></a><a class="link" href="nc_f_dist.html" title="Noncentral F Distribution">Noncentral
F Distribution</a>
@@ -401,9 +401,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/nc_t_dist.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/nc_t_dist.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/nc_t_dist.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="nc_f_dist.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dists.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="normal_dist.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_dist_ref_dists_nc_t_dist">
<div class="titlepage"><div><div><h5 class="title">
<a name="math_toolkit.dist.dist_ref.dists.nc_t_dist"></a><a class="link" href="nc_t_dist.html" title="Noncentral T Distribution">Noncentral
T Distribution</a>
@@ -400,9 +400,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/negative_binomial_dist.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/negative_binomial_dist.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/negative_binomial_dist.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="lognormal_dist.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dists.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="nc_beta_dist.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_dist_ref_dists_negative_binomial_dist">
<div class="titlepage"><div><div><h5 class="title">
<a name="math_toolkit.dist.dist_ref.dists.negative_binomial_dist"></a><a class="link" href="negative_binomial_dist.html" title="Negative Binomial Distribution">Negative
Binomial Distribution</a>
@@ -254,7 +254,8 @@
<dl class="variablelist">
<dt><span class="term">failures</span></dt>
<dd><p>
- The total number of failures before the r th success.
+ The total number of failures before the <span class="emphasis"><em>r</em></span>th
+ success.
</p></dd>
<dt><span class="term">successes</span></dt>
<dd><p>
@@ -893,9 +894,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/normal_dist.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/normal_dist.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/normal_dist.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="nc_t_dist.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dists.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="pareto.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_dist_ref_dists_normal_dist">
<div class="titlepage"><div><div><h5 class="title">
<a name="math_toolkit.dist.dist_ref.dists.normal_dist"></a><a class="link" href="normal_dist.html" title="Normal (Gaussian) Distribution">Normal
(Gaussian) Distribution</a>
@@ -312,9 +312,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/pareto.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/pareto.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/pareto.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="normal_dist.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dists.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="poisson_dist.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_dist_ref_dists_pareto">
<div class="titlepage"><div><div><h5 class="title">
<a name="math_toolkit.dist.dist_ref.dists.pareto"></a><a class="link" href="pareto.html" title="Pareto Distribution">Pareto Distribution</a>
</h5></div></div></div>
@@ -339,9 +339,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/poisson_dist.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/poisson_dist.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/poisson_dist.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="pareto.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dists.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="rayleigh.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_dist_ref_dists_poisson_dist">
<div class="titlepage"><div><div><h5 class="title">
<a name="math_toolkit.dist.dist_ref.dists.poisson_dist"></a><a class="link" href="poisson_dist.html" title="Poisson Distribution">Poisson
Distribution</a>
@@ -319,9 +319,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/rayleigh.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/rayleigh.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/rayleigh.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="poisson_dist.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dists.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="skew_normal_dist.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_dist_ref_dists_rayleigh">
<div class="titlepage"><div><div><h5 class="title">
<a name="math_toolkit.dist.dist_ref.dists.rayleigh"></a><a class="link" href="rayleigh.html" title="Rayleigh Distribution">Rayleigh
Distribution</a>
@@ -335,9 +335,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/skew_normal_dist.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/skew_normal_dist.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/skew_normal_dist.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="rayleigh.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dists.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="students_t_dist.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_dist_ref_dists_skew_normal_dist">
<div class="titlepage"><div><div><h5 class="title">
<a name="math_toolkit.dist.dist_ref.dists.skew_normal_dist"></a><a class="link" href="skew_normal_dist.html" title="Skew Normal Distribution">Skew
Normal Distribution</a>
@@ -489,9 +489,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/students_t_dist.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/students_t_dist.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/students_t_dist.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="skew_normal_dist.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dists.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="triangular_dist.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_dist_ref_dists_students_t_dist">
<div class="titlepage"><div><div><h5 class="title">
<a name="math_toolkit.dist.dist_ref.dists.students_t_dist"></a><a class="link" href="students_t_dist.html" title="Students t Distribution">Students
t Distribution</a>
@@ -418,9 +418,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/triangular_dist.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/triangular_dist.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/triangular_dist.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="students_t_dist.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dists.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="uniform_dist.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_dist_ref_dists_triangular_dist">
<div class="titlepage"><div><div><h5 class="title">
<a name="math_toolkit.dist.dist_ref.dists.triangular_dist"></a><a class="link" href="triangular_dist.html" title="Triangular Distribution">Triangular
Distribution</a>
@@ -413,9 +413,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/uniform_dist.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/uniform_dist.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/uniform_dist.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="triangular_dist.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dists.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="weibull_dist.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_dist_ref_dists_uniform_dist">
<div class="titlepage"><div><div><h5 class="title">
<a name="math_toolkit.dist.dist_ref.dists.uniform_dist"></a><a class="link" href="uniform_dist.html" title="Uniform Distribution">Uniform
Distribution</a>
@@ -356,9 +356,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/weibull_dist.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/weibull_dist.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/weibull_dist.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="uniform_dist.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dists.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../dist_algorithms.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_dist_ref_dists_weibull_dist">
<div class="titlepage"><div><div><h5 class="title">
<a name="math_toolkit.dist.dist_ref.dists.weibull_dist"></a><a class="link" href="weibull_dist.html" title="Weibull Distribution">Weibull
Distribution</a>
@@ -356,9 +356,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/nmp.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/nmp.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/nmp.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="../dist_ref.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dist_ref.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="dists.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_dist_ref_nmp">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.dist.dist_ref.nmp"></a><a class="link" href="nmp.html" title="Non-Member Properties">Non-Member Properties</a>
</h4></div></div></div>
@@ -660,9 +660,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/future.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/future.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/future.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="dist_ref/dist_algorithms.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dist.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../special.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_future">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.dist.future"></a><a class="link" href="future.html" title="Extras/Future Directions">Extras/Future Directions</a>
</h3></div></div></div>
@@ -133,9 +133,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="../dist.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dist.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="stat_tut/overview.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_stat_tut">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.dist.stat_tut"></a><a class="link" href="stat_tut.html" title="Statistical Distributions Tutorial">Statistical Distributions
Tutorial</a>
@@ -45,7 +45,7 @@
<dt><span class="section">Worked Examples</span></dt>
<dd><dl>
<dt><span class="section"><a href="stat_tut/weg/dist_construct_eg.html">Distribution
- Construction Example</a></span></dt>
+ Construction Examples</a></span></dt>
<dt><span class="section"><a href="stat_tut/weg/st_eg.html">Student's t
Distribution Examples</a></span></dt>
<dd><dl>
@@ -140,9 +140,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/dist_params.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/dist_params.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/dist_params.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="variates.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../stat_tut.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../dist_ref.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_stat_tut_dist_params">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.dist.stat_tut.dist_params"></a><a class="link" href="dist_params.html" title="Discrete Probability Distributions">Discrete Probability
Distributions</a>
@@ -84,9 +84,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="../stat_tut.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../stat_tut.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="overview/headers.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_stat_tut_overview">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.dist.stat_tut.overview"></a><a class="link" href="overview.html" title="Overview of Distributions">Overview of Distributions</a>
</h4></div></div></div>
@@ -42,9 +42,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/complements.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/complements.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/complements.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="generic.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../overview.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="parameters.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_stat_tut_overview_complements">
<div class="titlepage"><div><div><h5 class="title">
<a name="math_toolkit.dist.stat_tut.overview.complements"></a><a name="complements"></a><a class="link" href="complements.html" title="Complements are supported too - and when to use them">Complements
are supported too - and when to use them</a>
@@ -185,9 +185,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/generic.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/generic.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/generic.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="objects.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../overview.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="complements.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_stat_tut_overview_generic">
<div class="titlepage"><div><div><h5 class="title">
<a name="math_toolkit.dist.stat_tut.overview.generic"></a><a class="link" href="generic.html" title="Generic operations common to all distributions are non-member functions">Generic
operations common to all distributions are non-member functions</a>
@@ -241,9 +241,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/headers.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/headers.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/headers.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="../overview.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../overview.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="objects.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_stat_tut_overview_headers">
<div class="titlepage"><div><div><h5 class="title">
<a name="math_toolkit.dist.stat_tut.overview.headers"></a><a class="link" href="headers.html" title="Headers and Namespaces">Headers
and Namespaces</a>
@@ -62,9 +62,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/objects.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/objects.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/objects.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="headers.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../overview.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="generic.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_stat_tut_overview_objects">
<div class="titlepage"><div><div><h5 class="title">
<a name="math_toolkit.dist.stat_tut.overview.objects"></a><a class="link" href="objects.html" title="Distributions are Objects">Distributions
are Objects</a>
@@ -119,9 +119,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/parameters.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/parameters.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/parameters.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="complements.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../overview.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="summary.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_stat_tut_overview_parameters">
<div class="titlepage"><div><div><h5 class="title">
<a name="math_toolkit.dist.stat_tut.overview.parameters"></a><a class="link" href="parameters.html" title="Parameters can be calculated">Parameters
can be calculated</a>
@@ -57,9 +57,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/summary.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/summary.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/summary.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="parameters.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../overview.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../weg.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_stat_tut_overview_summary">
<div class="titlepage"><div><div><h5 class="title">
<a name="math_toolkit.dist.stat_tut.overview.summary"></a><a class="link" href="summary.html" title="Summary">Summary</a>
</h5></div></div></div>
@@ -58,9 +58,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/variates.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/variates.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/variates.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="weg/c_sharp.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../stat_tut.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="dist_params.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_stat_tut_variates">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.dist.stat_tut.variates"></a><a class="link" href="variates.html" title="Random Variates and Distribution Parameters">Random Variates
and Distribution Parameters</a>
@@ -61,9 +61,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -7,7 +7,7 @@
<link rel="home" href="../../../index.html" title="Math Toolkit">
<link rel="up" href="../stat_tut.html" title="Statistical Distributions Tutorial">
<link rel="prev" href="overview/summary.html" title="Summary">
-<link rel="next" href="weg/dist_construct_eg.html" title="Distribution Construction Example">
+<link rel="next" href="weg/dist_construct_eg.html" title="Distribution Construction Examples">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
@@ -22,13 +22,13 @@
<div class="spirit-nav">
<a accesskey="p" href="overview/summary.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../stat_tut.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="weg/dist_construct_eg.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_stat_tut_weg">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.dist.stat_tut.weg"></a><a class="link" href="weg.html" title="Worked Examples">Worked Examples</a>
</h4></div></div></div>
<div class="toc"><dl>
<dt><span class="section"><a href="weg/dist_construct_eg.html">Distribution
- Construction Example</a></span></dt>
+ Construction Examples</a></span></dt>
<dt><span class="section"><a href="weg/st_eg.html">Student's t
Distribution Examples</a></span></dt>
<dd><dl>
@@ -113,9 +113,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="f_eg.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../weg.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="binom_eg/binomial_coinflip_example.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_stat_tut_weg_binom_eg">
<div class="titlepage"><div><div><h5 class="title">
<a name="math_toolkit.dist.stat_tut.weg.binom_eg"></a><a class="link" href="binom_eg.html" title="Binomial Distribution Examples">Binomial
Distribution Examples</a>
@@ -44,9 +44,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg/binom_conf.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg/binom_conf.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg/binom_conf.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="binomial_quiz_example.html"><img src="../../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../binom_eg.html"><img src="../../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../../index.html"><img src="../../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="binom_size_eg.html"><img src="../../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_stat_tut_weg_binom_eg_binom_conf">
<div class="titlepage"><div><div><h6 class="title">
<a name="math_toolkit.dist.stat_tut.weg.binom_eg.binom_conf"></a><a class="link" href="binom_conf.html" title="Calculating Confidence Limits on the Frequency of Occurrence for a Binomial Distribution">Calculating
Confidence Limits on the Frequency of Occurrence for a Binomial Distribution</a>
@@ -226,9 +226,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg/binom_size_eg.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg/binom_size_eg.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg/binom_size_eg.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="binom_conf.html"><img src="../../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../binom_eg.html"><img src="../../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../../index.html"><img src="../../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../geometric_eg.html"><img src="../../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_stat_tut_weg_binom_eg_binom_size_eg">
<div class="titlepage"><div><div><h6 class="title">
<a name="math_toolkit.dist.stat_tut.weg.binom_eg.binom_size_eg"></a><a class="link" href="binom_size_eg.html" title="Estimating Sample Sizes for a Binomial Distribution.">Estimating
Sample Sizes for a Binomial Distribution.</a>
@@ -143,9 +143,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg/binomial_coinflip_example.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg/binomial_coinflip_example.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg/binomial_coinflip_example.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="../binom_eg.html"><img src="../../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../binom_eg.html"><img src="../../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../../index.html"><img src="../../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="binomial_quiz_example.html"><img src="../../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_stat_tut_weg_binom_eg_binomial_coinflip_example">
<div class="titlepage"><div><div><h6 class="title">
<a name="math_toolkit.dist.stat_tut.weg.binom_eg.binomial_coinflip_example"></a><a class="link" href="binomial_coinflip_example.html" title="Binomial Coin-Flipping Example">Binomial
Coin-Flipping Example</a>
@@ -313,9 +313,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg/binomial_quiz_example.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg/binomial_quiz_example.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg/binomial_quiz_example.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="binomial_coinflip_example.html"><img src="../../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../binom_eg.html"><img src="../../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../../index.html"><img src="../../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="binom_conf.html"><img src="../../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_stat_tut_weg_binom_eg_binomial_quiz_example">
<div class="titlepage"><div><div><h6 class="title">
<a name="math_toolkit.dist.stat_tut.weg.binom_eg.binomial_quiz_example"></a><a class="link" href="binomial_quiz_example.html" title="Binomial Quiz Example">Binomial
Quiz Example</a>
@@ -544,9 +544,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/c_sharp.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/c_sharp.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/c_sharp.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="nag_library.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../weg.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../variates.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_stat_tut_weg_c_sharp">
<div class="titlepage"><div><div><h5 class="title">
<a name="math_toolkit.dist.stat_tut.weg.c_sharp"></a><a class="link" href="c_sharp.html" title="Using the Distributions from Within C#">Using the
Distributions from Within C#</a>
@@ -42,9 +42,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/cs_eg.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/cs_eg.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/cs_eg.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="st_eg/paired_st.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../weg.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="cs_eg/chi_sq_intervals.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_stat_tut_weg_cs_eg">
<div class="titlepage"><div><div><h5 class="title">
<a name="math_toolkit.dist.stat_tut.weg.cs_eg"></a><a class="link" href="cs_eg.html" title="Chi Squared Distribution Examples">Chi Squared
Distribution Examples</a>
@@ -38,9 +38,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/cs_eg/chi_sq_intervals.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/cs_eg/chi_sq_intervals.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/cs_eg/chi_sq_intervals.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="../cs_eg.html"><img src="../../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../cs_eg.html"><img src="../../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../../index.html"><img src="../../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="chi_sq_test.html"><img src="../../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_stat_tut_weg_cs_eg_chi_sq_intervals">
<div class="titlepage"><div><div><h6 class="title">
<a name="math_toolkit.dist.stat_tut.weg.cs_eg.chi_sq_intervals"></a><a class="link" href="chi_sq_intervals.html" title="Confidence Intervals on the Standard Deviation">Confidence
Intervals on the Standard Deviation</a>
@@ -220,9 +220,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/cs_eg/chi_sq_size.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/cs_eg/chi_sq_size.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/cs_eg/chi_sq_size.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="chi_sq_test.html"><img src="../../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../cs_eg.html"><img src="../../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../../index.html"><img src="../../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../f_eg.html"><img src="../../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_stat_tut_weg_cs_eg_chi_sq_size">
<div class="titlepage"><div><div><h6 class="title">
<a name="math_toolkit.dist.stat_tut.weg.cs_eg.chi_sq_size"></a><a class="link" href="chi_sq_size.html" title="Estimating the Required Sample Sizes for a Chi-Square Test for the Standard Deviation">Estimating
the Required Sample Sizes for a Chi-Square Test for the Standard Deviation</a>
@@ -165,9 +165,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/cs_eg/chi_sq_test.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/cs_eg/chi_sq_test.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/cs_eg/chi_sq_test.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="chi_sq_intervals.html"><img src="../../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../cs_eg.html"><img src="../../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../../index.html"><img src="../../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="chi_sq_size.html"><img src="../../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_stat_tut_weg_cs_eg_chi_sq_test">
<div class="titlepage"><div><div><h6 class="title">
<a name="math_toolkit.dist.stat_tut.weg.cs_eg.chi_sq_test"></a><a class="link" href="chi_sq_test.html" title="Chi-Square Test for the Standard Deviation">Chi-Square
Test for the Standard Deviation</a>
@@ -280,9 +280,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/dist_construct_eg.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/dist_construct_eg.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/dist_construct_eg.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -1,7 +1,7 @@
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Distribution Construction Example</title>
+<title>Distribution Construction Examples</title>
<link rel="stylesheet" href="../../../../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<link rel="home" href="../../../../index.html" title="Math Toolkit">
@@ -22,27 +22,31 @@
<div class="spirit-nav">
<a accesskey="p" href="../weg.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../weg.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="st_eg.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_stat_tut_weg_dist_construct_eg">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.dist_construct_eg"></a><a class="link" href="dist_construct_eg.html" title="Distribution Construction Example">Distribution
- Construction Example</a>
+<a name="math_toolkit.dist.stat_tut.weg.dist_construct_eg"></a><a class="link" href="dist_construct_eg.html" title="Distribution Construction Examples">Distribution
+ Construction Examples</a>
</h5></div></div></div>
<p>
- See distribution_construction.cpp
- for full source code.
+ The structure of distributions is rather different from some other statistical
+ libraries, for example, those written in less object-oriented language
+ like FORTRAN and C: these provide a few arguments to each free function.
</p>
<p>
- The structure of distributions is rather different from some other statistical
- libraries, for example in less object-oriented language like FORTRAN
- and C, that provide a few arguments to each free function. This library
- provides each distribution as a template C++ class. A distribution is
- constructed with a few arguments, and then member and non-member functions
- are used to find values of the distribution, often a function of a random
- variate.
+ Boost.Math library provides each distribution as a template C++ class.
+ A distribution is constructed with a few arguments, and then member and
+ non-member functions are used to find values of the distribution, often
+ a function of a random variate.
</p>
<p>
- First we need some includes to access the negative binomial distribution
- (and the binomial, beta and gamma too).
+ For this demonstration, first we need some includes to access the negative
+ binomial distribution (and the binomial, beta and gamma distributions
+ too).
+ </p>
+<p>
+ To demonstrate the use with a high precision User-defined floating-point
+ type <code class="computeroutput"><span class="identifier">cpp_dec_float</span></code> we
+ also need an include from Boost.Multiprecision.
</p>
<p>
</p>
@@ -53,6 +57,8 @@
<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">distributions</span><span class="special">/</span><span class="identifier">beta</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span> <span class="comment">// for beta_distribution.</span>
<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">distributions</span><span class="special">/</span><span class="identifier">gamma</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span> <span class="comment">// for gamma_distribution.</span>
<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">distributions</span><span class="special">/</span><span class="identifier">normal</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span> <span class="comment">// for normal_distribution.</span>
+
+<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">multiprecision</span><span class="special">/</span><span class="identifier">cpp_dec_float</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span> <span class="comment">// for cpp_dec_float_100</span>
</pre>
<p>
</p>
@@ -79,8 +85,10 @@
<p>
</p>
<p>
- but this might risk ambiguity with names in std random so *much better
- is explicit <code class="computeroutput"><span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span> </code> * ... statements like
+ but this might risk ambiguity with names in <code class="computeroutput"><span class="identifier">std</span>
+ <span class="identifier">random</span></code> so <span class="bold"><strong>much</strong></span>
+ better is explicit <code class="computeroutput"><span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span></code>
+ statements, for example:
</p>
<p>
</p>
@@ -92,19 +100,21 @@
and we can still reduce typing.
</p>
<p>
- Since the vast majority of applications use will be using double precision,
- the template argument to the distribution (RealType) defaults to type
- double, so we can also write:
+ Since the vast majority of applications use will be using <code class="computeroutput"><span class="keyword">double</span></code> precision, the template argument
+ to the distribution (<code class="computeroutput"><span class="identifier">RealType</span></code>)
+ defaults to type <code class="computeroutput"><span class="keyword">double</span></code>,
+ so we can also write:
</p>
<p>
</p>
-<pre class="programlisting"><span class="identifier">negative_binomial_distribution</span><span class="special"><></span> <span class="identifier">mydist9</span><span class="special">(</span><span class="number">8.</span><span class="special">,</span> <span class="number">0.25</span><span class="special">);</span> <span class="comment">// Uses default RealType = double.</span>
+<pre class="programlisting"><span class="identifier">negative_binomial_distribution</span><span class="special"><></span> <span class="identifier">mydist9</span><span class="special">(</span><span class="number">8.</span><span class="special">,</span> <span class="number">0.25</span><span class="special">);</span> <span class="comment">// Uses default `RealType = double`.</span>
</pre>
<p>
</p>
<p>
- But the name "negative_binomial_distribution" is still inconveniently
- long, so for most distributions, a convenience typedef is provided, for
+ But the name <code class="computeroutput"><span class="identifier">negative_binomial_distribution</span></code>
+ is still inconveniently long, so, for most distributions, a convenience
+ <code class="computeroutput"><span class="keyword">typedef</span></code> is provided, for
example:
</p>
<pre class="programlisting"><span class="keyword">typedef</span> <span class="identifier">negative_binomial_distribution</span><span class="special"><</span><span class="keyword">double</span><span class="special">></span> <span class="identifier">negative_binomial</span><span class="special">;</span> <span class="comment">// Reserved name of type double.</span>
@@ -115,9 +125,9 @@
<th align="left">Caution</th>
</tr>
<tr><td align="left" valign="top"><p>
- This convenience typedef is <span class="emphasis"><em>not</em></span> provided if a
- clash would occur with the name of a function: currently only "beta"
- and "gamma" fall into this category.
+ This convenience typedef is <span class="bold"><strong>not provided</strong></span>
+ if a clash would occur with the name of a function: currently only
+ <code class="computeroutput"><span class="identifier">beta</span></code> and <code class="computeroutput"><span class="identifier">gamma</span></code> fall into this category.
</p></td></tr>
</table></div>
<p>
@@ -216,13 +226,13 @@
</p>
<p>
</p>
-<pre class="programlisting"><span class="comment">// Explicit double precision:</span>
+<pre class="programlisting"><span class="comment">// Explicit double precision: both arguments are double:</span>
<span class="identifier">negative_binomial_distribution</span><span class="special"><</span><span class="keyword">double</span><span class="special">></span> <span class="identifier">mydist1</span><span class="special">(</span><span class="number">8.</span><span class="special">,</span> <span class="number">0.25</span><span class="special">);</span>
<span class="comment">// Explicit float precision, double arguments are truncated to float:</span>
<span class="identifier">negative_binomial_distribution</span><span class="special"><</span><span class="keyword">float</span><span class="special">></span> <span class="identifier">mydist2</span><span class="special">(</span><span class="number">8.</span><span class="special">,</span> <span class="number">0.25</span><span class="special">);</span>
-<span class="comment">// Explicit float precision, integer & double arguments converted to float.</span>
+<span class="comment">// Explicit float precision, integer & double arguments converted to float:</span>
<span class="identifier">negative_binomial_distribution</span><span class="special"><</span><span class="keyword">float</span><span class="special">></span> <span class="identifier">mydist3</span><span class="special">(</span><span class="number">8</span><span class="special">,</span> <span class="number">0.25</span><span class="special">);</span>
<span class="comment">// Explicit float precision, float arguments, so no conversion:</span>
@@ -240,30 +250,115 @@
<p>
</p>
<p>
- And if you have your own RealType called MyFPType, for example NTL RR
- (an arbitrary precision type), then we can write:
+ And you can use your own RealType, for example, <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">cpp_dec_float_50</span></code>
+ (an arbitrary 50 decimal digits precision type), then we can write:
+ </p>
+<p>
+</p>
+<pre class="programlisting"> <span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">multiprecision</span><span class="special">;</span>
+
+ <span class="identifier">negative_binomial_distribution</span><span class="special"><</span><span class="identifier">cpp_dec_float_50</span><span class="special">></span> <span class="identifier">mydist8</span><span class="special">(</span><span class="number">8</span><span class="special">,</span> <span class="number">0.25</span><span class="special">);</span>
+ <span class="comment">// `integer` arguments are promoted to your RealType exactly, but</span>
+ <span class="comment">// `double` argument are converted to RealType,</span>
+ <span class="comment">// possibly losing precision, so don't write:</span>
+
+ <span class="identifier">negative_binomial_distribution</span><span class="special"><</span><span class="identifier">cpp_dec_float_50</span><span class="special">></span> <span class="identifier">mydist20</span><span class="special">(</span><span class="number">8</span><span class="special">,</span> <span class="number">0.23456789012345678901234567890</span><span class="special">);</span>
+<span class="comment">// to avoid truncation of second parameter to `0.2345678901234567`.</span>
+
+ <span class="identifier">negative_binomial_distribution</span><span class="special"><</span><span class="identifier">cpp_dec_float_50</span><span class="special">></span> <span class="identifier">mydist21</span><span class="special">(</span><span class="number">8</span><span class="special">,</span> <span class="identifier">cpp_dec_float_50</span><span class="special">(</span><span class="string">"0.23456789012345678901234567890"</span><span class="special">)</span> <span class="special">);</span>
+
+ <span class="comment">// Ensure that all potentially significant digits are shown.</span>
+ <span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span><span class="special">.</span><span class="identifier">precision</span><span class="special">(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">numeric_limits</span><span class="special"><</span><span class="identifier">cpp_dec_float_50</span><span class="special">>::</span><span class="identifier">digits10</span><span class="special">);</span>
+ <span class="identifier">cpp_dec_float_50</span> <span class="identifier">x</span><span class="special">(</span><span class="string">"1.23456789012345678901234567890"</span><span class="special">);</span>
+ <span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special"><<</span> <span class="identifier">pdf</span><span class="special">(</span><span class="identifier">mydist8</span><span class="special">,</span> <span class="identifier">x</span><span class="special">)</span> <span class="special"><<</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">endl</span><span class="special">;</span>
+</pre>
+<p>
+ </p>
+<pre class="programlisting"><span class="identifier">showing</span> <span class="number">0.00012630010495970320103876754721976419438231705359935</span>
+</pre>
+<div class="warning"><table border="0" summary="Warning">
+<tr>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Warning]" src="../../../../../../../../../doc/src/images/warning.png"></td>
+<th align="left">Warning</th>
+</tr>
+<tr><td align="left" valign="top"><p>
+ When using multiprecision, it is all too easy to get accidental truncation!
+ </p></td></tr>
+</table></div>
+<p>
+ For example, if you write
</p>
-<pre class="programlisting"><span class="identifier">negative_binomial_distribution</span><span class="special"><</span><span class="identifier">MyFPType</span><span class="special">></span> <span class="identifier">mydist6</span><span class="special">(</span><span class="number">8</span><span class="special">,</span> <span class="number">1</span><span class="special">);</span> <span class="comment">// Integer arguments -> MyFPType.</span>
+<p>
+</p>
+<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special"><<</span> <span class="identifier">pdf</span><span class="special">(</span><span class="identifier">mydist8</span><span class="special">,</span> <span class="number">1.23456789012345678901234567890</span><span class="special">)</span> <span class="special"><<</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">endl</span><span class="special">;</span>
</pre>
-<h6>
+<p>
+ </p>
+<p>
+ showing 0.00012630010495970318465064569310967179576805651692929, which
+ is wrong at about the 17th decimal digit!
+ </p>
+<p>
+ This is because the value provided is truncated to a <code class="computeroutput"><span class="keyword">double</span></code>,
+ effectively <code class="computeroutput"><span class="keyword">double</span> <span class="identifier">x</span>
+ <span class="special">=</span> <span class="number">1.23456789012345678901234567890</span><span class="special">;</span></code>
+ </p>
+<p>
+ Then the now <code class="computeroutput"><span class="keyword">double</span> <span class="identifier">x</span></code>
+ is passed to function <code class="computeroutput"><span class="identifier">pdf</span></code>,
+ and this truncated <code class="computeroutput"><span class="keyword">double</span></code>
+ value is finally promoted to <code class="computeroutput"><span class="identifier">cpp_dec_float_50</span></code>.
+ </p>
+<p>
+ Another way of quietly getting the wrong answer is to write:
+ </p>
+<p>
+</p>
+<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special"><<</span> <span class="identifier">pdf</span><span class="special">(</span><span class="identifier">mydist8</span><span class="special">,</span> <span class="identifier">cpp_dec_float_50</span><span class="special">(</span><span class="number">1.23456789012345678901234567890</span><span class="special">))</span> <span class="special"><<</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">endl</span><span class="special">;</span>
+</pre>
+<p>
+ </p>
+<p>
+ A correct way from a multi-digit string value is
+ </p>
+<p>
+</p>
+<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special"><<</span> <span class="identifier">pdf</span><span class="special">(</span><span class="identifier">mydist8</span><span class="special">,</span> <span class="identifier">cpp_dec_float_50</span><span class="special">(</span><span class="string">"1.23456789012345678901234567890"</span><span class="special">))</span> <span class="special"><<</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">endl</span><span class="special">;</span>
+</pre>
+<p>
+ </p>
+<div class="tip"><table border="0" summary="Tip">
+<tr>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Tip]" src="../../../../../../../../../doc/src/images/tip.png"></td>
+<th align="left">Tip</th>
+</tr>
+<tr><td align="left" valign="top"><p>
+ Getting about 17 decimal digits followed by many zeros is often a sign
+ of accidental truncation.
+ </p></td></tr>
+</table></div>
+<h5>
<a name="math_toolkit.dist.stat_tut.weg.dist_construct_eg.h0"></a>
<span class="phrase"><a name="math_toolkit.dist.stat_tut.weg.dist_construct_eg.default_arguments_to_distribution_constructors_"></a></span><a class="link" href="dist_construct_eg.html#math_toolkit.dist.stat_tut.weg.dist_construct_eg.default_arguments_to_distribution_constructors_">Default
arguments to distribution constructors.</a>
- </h6>
+ </h5>
<p>
Note that default constructor arguments are only provided for some distributions.
- So if you wrongly assume a default argument you will get an error message,
+ So if you wrongly assume a default argument, you will get an error message,
for example:
</p>
<pre class="programlisting"><span class="identifier">negative_binomial_distribution</span><span class="special"><></span> <span class="identifier">mydist8</span><span class="special">;</span>
</pre>
<pre class="programlisting">error C2512 no appropriate default constructor available.</pre>
<p>
- No default constructors are provided for the negative binomial, because
+ No default constructors are provided for the <code class="computeroutput"><span class="identifier">negative</span>
+ <span class="identifier">binomial</span></code> distribution, because
it is difficult to chose any sensible default values for this distribution.
+ </p>
+<p>
For other distributions, like the normal distribution, it is obviously
- very useful to provide 'standard' defaults for the mean and standard
- deviation thus:
+ very useful to provide 'standard' defaults for the mean (zero) and standard
+ deviation (unity) thus:
</p>
<pre class="programlisting"><span class="identifier">normal_distribution</span><span class="special">(</span><span class="identifier">RealType</span> <span class="identifier">mean</span> <span class="special">=</span> <span class="number">0</span><span class="special">,</span> <span class="identifier">RealType</span> <span class="identifier">sd</span> <span class="special">=</span> <span class="number">1</span><span class="special">);</span>
</pre>
@@ -284,14 +379,18 @@
<p>
</p>
<p>
- There is no useful output from this program, of course.
+ There is no useful output from this demonstration program, of course.
+ </p>
+<p>
+ See distribution_construction.cpp
+ for full source code.
</p>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/error_eg.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/error_eg.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/error_eg.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="nccs_eg/nccs_power_eg.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../weg.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="find_eg.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_stat_tut_weg_error_eg">
<div class="titlepage"><div><div><h5 class="title">
<a name="math_toolkit.dist.stat_tut.weg.error_eg"></a><a class="link" href="error_eg.html" title="Error Handling Example">Error Handling
Example</a>
@@ -200,9 +200,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/f_eg.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/f_eg.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/f_eg.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="cs_eg/chi_sq_size.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../weg.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="binom_eg.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_stat_tut_weg_f_eg">
<div class="titlepage"><div><div><h5 class="title">
<a name="math_toolkit.dist.stat_tut.weg.f_eg"></a><a class="link" href="f_eg.html" title="F Distribution Examples">F Distribution
Examples</a>
@@ -315,9 +315,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/find_eg.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/find_eg.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/find_eg.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="error_eg.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../weg.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="find_eg/find_location_eg.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_stat_tut_weg_find_eg">
<div class="titlepage"><div><div><h5 class="title">
<a name="math_toolkit.dist.stat_tut.weg.find_eg"></a><a class="link" href="find_eg.html" title="Find Location and Scale Examples">Find Location
and Scale Examples</a>
@@ -38,9 +38,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/find_eg/find_location_eg.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/find_eg/find_location_eg.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/find_eg/find_location_eg.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="../find_eg.html"><img src="../../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../find_eg.html"><img src="../../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../../index.html"><img src="../../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="find_scale_eg.html"><img src="../../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_stat_tut_weg_find_eg_find_location_eg">
<div class="titlepage"><div><div><h6 class="title">
<a name="math_toolkit.dist.stat_tut.weg.find_eg.find_location_eg"></a><a class="link" href="find_location_eg.html" title="Find Location (Mean) Example">Find
Location (Mean) Example</a>
@@ -210,9 +210,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/find_eg/find_mean_and_sd_eg.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/find_eg/find_mean_and_sd_eg.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/find_eg/find_mean_and_sd_eg.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="find_scale_eg.html"><img src="../../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../find_eg.html"><img src="../../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../../index.html"><img src="../../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../nag_library.html"><img src="../../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_stat_tut_weg_find_eg_find_mean_and_sd_eg">
<div class="titlepage"><div><div><h6 class="title">
<a name="math_toolkit.dist.stat_tut.weg.find_eg.find_mean_and_sd_eg"></a><a class="link" href="find_mean_and_sd_eg.html" title="Find mean and standard deviation example">Find
mean and standard deviation example</a>
@@ -534,9 +534,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/find_eg/find_scale_eg.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/find_eg/find_scale_eg.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/find_eg/find_scale_eg.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="find_location_eg.html"><img src="../../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../find_eg.html"><img src="../../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../../index.html"><img src="../../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="find_mean_and_sd_eg.html"><img src="../../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_stat_tut_weg_find_eg_find_scale_eg">
<div class="titlepage"><div><div><h6 class="title">
<a name="math_toolkit.dist.stat_tut.weg.find_eg.find_scale_eg"></a><a class="link" href="find_scale_eg.html" title="Find Scale (Standard Deviation) Example">Find
Scale (Standard Deviation) Example</a>
@@ -225,9 +225,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/geometric_eg.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/geometric_eg.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/geometric_eg.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="binom_eg/binom_size_eg.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../weg.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="neg_binom_eg.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_stat_tut_weg_geometric_eg">
<div class="titlepage"><div><div><h5 class="title">
<a name="math_toolkit.dist.stat_tut.weg.geometric_eg"></a><a class="link" href="geometric_eg.html" title="Geometric Distribution Examples">Geometric
Distribution Examples</a>
@@ -497,9 +497,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/inverse_chi_squared_eg.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/inverse_chi_squared_eg.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/inverse_chi_squared_eg.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="normal_example/normal_misc.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../weg.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="nccs_eg.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_stat_tut_weg_inverse_chi_squared_eg">
<div class="titlepage"><div><div><h5 class="title">
<a name="math_toolkit.dist.stat_tut.weg.inverse_chi_squared_eg"></a><a class="link" href="inverse_chi_squared_eg.html" title="Inverse Chi-Squared Distribution Bayes Example">Inverse
Chi-Squared Distribution Bayes Example</a>
@@ -360,9 +360,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/nag_library.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/nag_library.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/nag_library.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="find_eg/find_mean_and_sd_eg.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../weg.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="c_sharp.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_stat_tut_weg_nag_library">
<div class="titlepage"><div><div><h5 class="title">
<a name="math_toolkit.dist.stat_tut.weg.nag_library"></a><a class="link" href="nag_library.html" title="Comparison with C, R, FORTRAN-style Free Functions">Comparison
with C, R, FORTRAN-style Free Functions</a>
@@ -99,9 +99,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/nccs_eg.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/nccs_eg.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/nccs_eg.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="inverse_chi_squared_eg.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../weg.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="nccs_eg/nccs_power_eg.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_stat_tut_weg_nccs_eg">
<div class="titlepage"><div><div><h5 class="title">
<a name="math_toolkit.dist.stat_tut.weg.nccs_eg"></a><a class="link" href="nccs_eg.html" title="Non Central Chi Squared Example">Non Central
Chi Squared Example</a>
@@ -36,9 +36,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/nccs_eg/nccs_power_eg.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/nccs_eg/nccs_power_eg.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/nccs_eg/nccs_power_eg.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="../nccs_eg.html"><img src="../../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../nccs_eg.html"><img src="../../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../../index.html"><img src="../../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../error_eg.html"><img src="../../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_stat_tut_weg_nccs_eg_nccs_power_eg">
<div class="titlepage"><div><div><h6 class="title">
<a name="math_toolkit.dist.stat_tut.weg.nccs_eg.nccs_power_eg"></a><a class="link" href="nccs_power_eg.html" title="Tables of the power function of the chi2 test.">Tables
of the power function of the chi<sup>2</sup> test.</a>
@@ -1294,9 +1294,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="geometric_eg.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../weg.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="neg_binom_eg/neg_binom_conf.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_stat_tut_weg_neg_binom_eg">
<div class="titlepage"><div><div><h5 class="title">
<a name="math_toolkit.dist.stat_tut.weg.neg_binom_eg"></a><a class="link" href="neg_binom_eg.html" title="Negative Binomial Distribution Examples">Negative
Binomial Distribution Examples</a>
@@ -45,9 +45,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg/neg_binom_conf.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg/neg_binom_conf.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg/neg_binom_conf.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="../neg_binom_eg.html"><img src="../../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../neg_binom_eg.html"><img src="../../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../../index.html"><img src="../../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="neg_binom_size_eg.html"><img src="../../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_stat_tut_weg_neg_binom_eg_neg_binom_conf">
<div class="titlepage"><div><div><h6 class="title">
<a name="math_toolkit.dist.stat_tut.weg.neg_binom_eg.neg_binom_conf"></a><a class="link" href="neg_binom_conf.html" title="Calculating Confidence Limits on the Frequency of Occurrence for the Negative Binomial Distribution">Calculating
Confidence Limits on the Frequency of Occurrence for the Negative Binomial
@@ -226,9 +226,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg/neg_binom_size_eg.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg/neg_binom_size_eg.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg/neg_binom_size_eg.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="neg_binom_conf.html"><img src="../../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../neg_binom_eg.html"><img src="../../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../../index.html"><img src="../../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="negative_binomial_example1.html"><img src="../../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_stat_tut_weg_neg_binom_eg_neg_binom_size_eg">
<div class="titlepage"><div><div><h6 class="title">
<a name="math_toolkit.dist.stat_tut.weg.neg_binom_eg.neg_binom_size_eg"></a><a class="link" href="neg_binom_size_eg.html" title="Estimating Sample Sizes for the Negative Binomial.">Estimating
Sample Sizes for the Negative Binomial.</a>
@@ -206,9 +206,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg/negative_binomial_example1.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg/negative_binomial_example1.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg/negative_binomial_example1.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="neg_binom_size_eg.html"><img src="../../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../neg_binom_eg.html"><img src="../../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../../index.html"><img src="../../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="negative_binomial_example2.html"><img src="../../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_stat_tut_weg_neg_binom_eg_negative_binomial_example1">
<div class="titlepage"><div><div><h6 class="title">
<a name="math_toolkit.dist.stat_tut.weg.neg_binom_eg.negative_binomial_example1"></a><a class="link" href="negative_binomial_example1.html" title="Negative Binomial Sales Quota Example.">Negative
Binomial Sales Quota Example.</a>
@@ -596,9 +596,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg/negative_binomial_example2.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg/negative_binomial_example2.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg/negative_binomial_example2.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="negative_binomial_example1.html"><img src="../../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../neg_binom_eg.html"><img src="../../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../../index.html"><img src="../../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../normal_example.html"><img src="../../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_stat_tut_weg_neg_binom_eg_negative_binomial_example2">
<div class="titlepage"><div><div><h6 class="title">
<a name="math_toolkit.dist.stat_tut.weg.neg_binom_eg.negative_binomial_example2"></a><a class="link" href="negative_binomial_example2.html" title="Negative Binomial Table Printing Example.">Negative
Binomial Table Printing Example.</a>
@@ -127,9 +127,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/normal_example.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/normal_example.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/normal_example.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="neg_binom_eg/negative_binomial_example2.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../weg.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="normal_example/normal_misc.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_stat_tut_weg_normal_example">
<div class="titlepage"><div><div><h5 class="title">
<a name="math_toolkit.dist.stat_tut.weg.normal_example"></a><a class="link" href="normal_example.html" title="Normal Distribution Examples">Normal
Distribution Examples</a>
@@ -36,9 +36,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/normal_example/normal_misc.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/normal_example/normal_misc.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/normal_example/normal_misc.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="../normal_example.html"><img src="../../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../normal_example.html"><img src="../../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../../index.html"><img src="../../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../inverse_chi_squared_eg.html"><img src="../../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_stat_tut_weg_normal_example_normal_misc">
<div class="titlepage"><div><div><h6 class="title">
<a name="math_toolkit.dist.stat_tut.weg.normal_example.normal_misc"></a><a class="link" href="normal_misc.html" title="Some Miscellaneous Examples of the Normal (Gaussian) Distribution">Some
Miscellaneous Examples of the Normal (Gaussian) Distribution</a>
@@ -597,9 +597,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -6,7 +6,7 @@
<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<link rel="home" href="../../../../index.html" title="Math Toolkit">
<link rel="up" href="../weg.html" title="Worked Examples">
-<link rel="prev" href="dist_construct_eg.html" title="Distribution Construction Example">
+<link rel="prev" href="dist_construct_eg.html" title="Distribution Construction Examples">
<link rel="next" href="st_eg/tut_mean_intervals.html" title="Calculating confidence intervals on the mean with the Students-t distribution">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="dist_construct_eg.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../weg.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="st_eg/tut_mean_intervals.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_stat_tut_weg_st_eg">
<div class="titlepage"><div><div><h5 class="title">
<a name="math_toolkit.dist.stat_tut.weg.st_eg"></a><a class="link" href="st_eg.html" title="Student's t Distribution Examples">Student's t
Distribution Examples</a>
@@ -43,9 +43,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg/paired_st.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg/paired_st.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg/paired_st.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="two_sample_students_t.html"><img src="../../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../st_eg.html"><img src="../../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../../index.html"><img src="../../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../cs_eg.html"><img src="../../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_stat_tut_weg_st_eg_paired_st">
<div class="titlepage"><div><div><h6 class="title">
<a name="math_toolkit.dist.stat_tut.weg.st_eg.paired_st"></a><a class="link" href="paired_st.html" title="Comparing two paired samples with the Student's t distribution">Comparing
two paired samples with the Student's t distribution</a>
@@ -64,9 +64,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg/tut_mean_intervals.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg/tut_mean_intervals.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg/tut_mean_intervals.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="../st_eg.html"><img src="../../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../st_eg.html"><img src="../../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../../index.html"><img src="../../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="tut_mean_test.html"><img src="../../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_stat_tut_weg_st_eg_tut_mean_intervals">
<div class="titlepage"><div><div><h6 class="title">
<a name="math_toolkit.dist.stat_tut.weg.st_eg.tut_mean_intervals"></a><a class="link" href="tut_mean_intervals.html" title="Calculating confidence intervals on the mean with the Students-t distribution">Calculating
confidence intervals on the mean with the Students-t distribution</a>
@@ -253,9 +253,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg/tut_mean_size.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg/tut_mean_size.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg/tut_mean_size.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="tut_mean_test.html"><img src="../../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../st_eg.html"><img src="../../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../../index.html"><img src="../../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="two_sample_students_t.html"><img src="../../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_stat_tut_weg_st_eg_tut_mean_size">
<div class="titlepage"><div><div><h6 class="title">
<a name="math_toolkit.dist.stat_tut.weg.st_eg.tut_mean_size"></a><a class="link" href="tut_mean_size.html" title="Estimating how large a sample size would have to become in order to give a significant Students-t test result with a single sample test">Estimating
how large a sample size would have to become in order to give a significant
@@ -164,9 +164,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg/tut_mean_test.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg/tut_mean_test.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg/tut_mean_test.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="tut_mean_intervals.html"><img src="../../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../st_eg.html"><img src="../../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../../index.html"><img src="../../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="tut_mean_size.html"><img src="../../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_stat_tut_weg_st_eg_tut_mean_test">
<div class="titlepage"><div><div><h6 class="title">
<a name="math_toolkit.dist.stat_tut.weg.st_eg.tut_mean_test"></a><a class="link" href="tut_mean_test.html" title='Testing a sample mean for difference from a "true" mean'>Testing
a sample mean for difference from a "true" mean</a>
@@ -319,9 +319,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg/two_sample_students_t.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg/two_sample_students_t.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg/two_sample_students_t.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="tut_mean_size.html"><img src="../../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../st_eg.html"><img src="../../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../../index.html"><img src="../../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="paired_st.html"><img src="../../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_dist_stat_tut_weg_st_eg_two_sample_students_t">
<div class="titlepage"><div><div><h6 class="title">
<a name="math_toolkit.dist.stat_tut.weg.st_eg.two_sample_students_t"></a><a class="link" href="two_sample_students_t.html" title="Comparing the means of two samples with the Students-t test">Comparing
the means of two samples with the Students-t test</a>
@@ -343,9 +343,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/extern_c.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/extern_c.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/extern_c.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="utils/next_float/float_advance.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="extern_c/tr1.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_extern_c">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="math_toolkit.extern_c"></a><a class="link" href="extern_c.html" title='TR1 and C99 external "C" Functions'>TR1 and C99 external "C"
Functions</a>
@@ -36,9 +36,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/extern_c/c99.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/extern_c/c99.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/extern_c/c99.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="tr1.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../extern_c.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="tr1_ref.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_extern_c_c99">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.extern_c.c99"></a><a class="link" href="c99.html" title="C99 C Functions">C99 C Functions</a>
</h3></div></div></div>
@@ -462,9 +462,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/extern_c/tr1.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/extern_c/tr1.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/extern_c/tr1.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="../extern_c.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../extern_c.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="c99.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_extern_c_tr1">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.extern_c.tr1"></a><a class="link" href="tr1.html" title="C99 and TR1 C Functions Overview">C99 and TR1 C Functions Overview</a>
</h3></div></div></div>
@@ -604,9 +604,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/extern_c/tr1_ref.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/extern_c/tr1_ref.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/extern_c/tr1_ref.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="c99.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../extern_c.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../constants.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_extern_c_tr1_ref">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.extern_c.tr1_ref"></a><a class="link" href="tr1_ref.html" title="TR1 C Functions Quick Reference">TR1 C Functions Quick
Reference</a>
@@ -523,9 +523,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="../index.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="main_overview/intro.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_main_overview">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="math_toolkit.main_overview"></a><a class="link" href="main_overview.html" title="Overview">Overview</a>
</h2></div></div></div>
@@ -57,9 +57,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/building.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/building.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/building.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="perf_over.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../main_overview.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="history1.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_main_overview_building">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.main_overview.building"></a><a class="link" href="building.html" title="If and How to Build a Boost.Math Library, and its Examples and Tests">If and How to Build
a Boost.Math Library, and its Examples and Tests</a>
@@ -147,9 +147,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/compilers_overview.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/compilers_overview.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/compilers_overview.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="error_handling.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../main_overview.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="config_macros.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_main_overview_compilers_overview">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.main_overview.compilers_overview"></a><a class="link" href="compilers_overview.html" title="Compilers">Compilers</a>
</h3></div></div></div>
@@ -206,6 +206,28 @@
<tr>
<td>
<p>
+ Windows 7/Netbeans 7.2
+ </p>
+ </td>
+<td>
+ <p>
+ Clang 3.1
+ </p>
+ </td>
+<td>
+ <p>
+ Yes
+ </p>
+ </td>
+<td>
+ <p>
+ Spot examples OK. Expect all tests to compile and run OK.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
Linux
</p>
</td>
@@ -236,6 +258,28 @@
</td>
<td>
<p>
+ Clang 3.2
+ </p>
+ </td>
+<td>
+ <p>
+ Yes
+ </p>
+ </td>
+<td>
+ <p>
+ All tests OK.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Linux
+ </p>
+ </td>
+<td>
+ <p>
Intel C++ 10.0 and later
</p>
</td>
@@ -509,7 +553,29 @@
<tr>
<td>
<p>
- IMB AIX
+ Apple Mac OS X,
+ </p>
+ </td>
+<td>
+ <p>
+ Clang 3.2
+ </p>
+ </td>
+<td>
+ <p>
+ Yes
+ </p>
+ </td>
+<td>
+ <p>
+ All tests expected to be OK.
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ IBM AIX
</p>
</td>
<td>
@@ -600,9 +666,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/config_macros.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/config_macros.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/config_macros.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="compilers_overview.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../main_overview.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="pol_overview.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_main_overview_config_macros">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.main_overview.config_macros"></a><a class="link" href="config_macros.html" title="Configuration Macros">Configuration
Macros</a>
@@ -398,9 +398,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/contact.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/contact.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/contact.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="faq.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../main_overview.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../dist.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_main_overview_contact">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.main_overview.contact"></a><a class="link" href="contact.html" title="Contact Info and Support">Contact Info and
Support</a>
@@ -48,9 +48,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/conventions.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/conventions.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/conventions.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,12 +22,12 @@
<div class="spirit-nav">
<a accesskey="p" href="navigation.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../main_overview.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="hints.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_main_overview_conventions">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.main_overview.conventions"></a><a class="link" href="conventions.html" title="Document Conventions">Document Conventions</a>
</h3></div></div></div>
<p>
- <a class="indexterm" name="id862570"></a>
+ <a class="indexterm" name="id855190"></a>
</p>
<p>
This documentation aims to use of the following naming and formatting conventions.
@@ -69,9 +69,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/directories.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/directories.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/directories.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="hints.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../main_overview.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="namespaces.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_main_overview_directories">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.main_overview.directories"></a><a class="link" href="directories.html" title="Directory and File Structure">Directory and
File Structure</a>
@@ -44,8 +44,8 @@
will use <code class="computeroutput"><span class="keyword">float</span></code> or <code class="computeroutput"><span class="keyword">long</span> <span class="keyword">double</span></code>,
but it is also possible to use higher precision types like NTL::RR,
<a href="http://gmplib.org/" target="_top">GNU Multiple Precision Arithmetic Library</a>,
- MPFR that conform to the
- requirements specified by real_concept.
+ GNU MPFR library that conform
+ to the requirements specified by real_concept.
</p></dd>
<dt><span class="term">/constants/</span></dt>
<dd><p>
@@ -111,9 +111,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/error_handling.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/error_handling.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/error_handling.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="result_type.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../main_overview.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="compilers_overview.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_main_overview_error_handling">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.main_overview.error_handling"></a><a class="link" href="error_handling.html" title="Error Handling">Error Handling</a>
</h3></div></div></div>
@@ -1105,9 +1105,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/faq.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/faq.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/faq.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="tr1.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../main_overview.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="contact.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_main_overview_faq">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.main_overview.faq"></a><a class="link" href="faq.html" title="Frequently Asked Questions FAQ">Frequently Asked Questions
FAQ</a>
@@ -181,7 +181,8 @@
</li>
<li class="listitem">
<span class="emphasis"><em>Where are the pre-built libraries?</em></span> <br> Good news
- - you probably don't need any! - just #include <boost/math/distribution_you_want>.
+ - you probably don't need any! - just <code class="computeroutput"><span class="preprocessor">#include</span>
+ <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span></code><span class="emphasis"><em>math/distribution_you_want></em></span>.
But in the unlikely event that you do, see <a class="link" href="building.html" title="If and How to Build a Boost.Math Library, and its Examples and Tests">building
libraries</a>.
</li>
@@ -189,13 +190,31 @@
<span class="emphasis"><em>I don't see the function or distribution that I want.</em></span>
<br> You could try an email to ask the authors - but no promises!
</li>
+<li class="listitem">
+ <span class="emphasis"><em>I need more decimal digits for values/computations.</em></span>
+ <br> You can use Boost.Math with Boost.Multiprecision:
+ typically cpp_dec_float
+ is a useful user-defined type to provide a fixed number of decimal digits,
+ usually 50 or 100.
+ </li>
+<li class="listitem">
+ Why can't I write something really simple like <code class="computeroutput"><span class="identifier">cpp_int</span>
+ <span class="identifier">one</span><span class="special">(</span><span class="number">1</span><span class="special">);</span> <span class="identifier">cpp_dec_float_50</span>
+ <span class="identifier">two</span><span class="special">(</span><span class="number">2</span><span class="special">);</span> <span class="identifier">one</span>
+ <span class="special">*</span> <span class="identifier">two</span><span class="special">;</span></code> Because <code class="computeroutput"><span class="identifier">cpp_int</span></code>
+ might be bigger than <code class="computeroutput"><span class="identifier">cpp_dec_float</span>
+ <span class="identifier">can</span> <span class="identifier">hold</span></code>,
+ so you must make an <span class="bold"><strong>explicit</strong></span> conversion.
+ See <a href="http://svn.boost.org/svn/boost/trunk/libs/multiprecision/doc/html/boost_multiprecision/intro.html" target="_top">mixed
+ multiprecision arithmetic</a> and conversion.
+ </li>
</ol></div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/hints.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/hints.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/hints.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="conventions.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../main_overview.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="directories.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_main_overview_hints">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.main_overview.hints"></a><a class="link" href="hints.html" title="Other Hints and tips">Other Hints and tips</a>
</h3></div></div></div>
@@ -96,9 +96,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/history1.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/history1.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/history1.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="building.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../main_overview.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="tr1.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_main_overview_history1">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.main_overview.history1"></a><a class="link" href="history1.html" title="History and What's New">History and What's
New</a>
@@ -35,6 +35,56 @@
</p>
<h5>
<a name="math_toolkit.main_overview.history1.h0"></a>
+ <span class="phrase"><a name="math_toolkit.main_overview.history1.boost_1_54"></a></span><a class="link" href="history1.html#math_toolkit.main_overview.history1.boost_1_54">Boost-1.54</a>
+ </h5>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem">
+ Added many references to Boost.Multiprecision and <code class="computeroutput"><span class="identifier">cpp_dec_float_50</span></code>
+ as an example of a User-defined Type (UDT).
+ </li>
+<li class="listitem">
+ Added Clang to list of supported compilers.
+ </li>
+<li class="listitem">
+ Fixed constants to use a thread-safe cache of computed values when used
+ at arbitrary precision.
+ </li>
+<li class="listitem">
+ Added finding zeros of Bessel functions <code class="computeroutput"><span class="identifier">cyl_bessel_j_zero</span></code>,
+ <code class="computeroutput"><span class="identifier">cyl_neumann_zero</span></code>, <code class="computeroutput"><span class="identifier">air_ai_zeros</span></code> and <code class="computeroutput"><span class="identifier">air_bi_zeros</span></code>(by
+ Christopher Kormanyos).
+ </li>
+<li class="listitem">
+ More accuracy improvements to the Bessel J and Y functions from Rocco
+ Romeo.
+ </li>
+<li class="listitem">
+ Fixed nasty cyclic dependency bug that caused some headers to not compile
+ #7999.
+ </li>
+<li class="listitem">
+ Fixed bug in <a class="link" href="../special/sf_gamma/tgamma.html" title="Gamma">tgamma</a>
+ that caused spurious overflow for arguments between 142.5 and 143.
+ </li>
+<li class="listitem">
+ Fixed bug in raise_rounding_error that caused it to return an incorrect
+ result when throwing an exception is turned off #7905.
+ </li>
+<li class="listitem">
+ Added minimal __float128 support.
+ </li>
+<li class="listitem">
+ Fixed bug in edge-cases of poisson quantile #8308.
+ </li>
+<li class="listitem">
+ Adjusted heuristics used in Halley iteration to cope with inverting the
+ incomplete beta in tricky regions where the derivative is flatlining.
+ Example is computing the quantile of the Fisher F distribution for probabilities
+ smaller than machine epsilon. See ticket #8314.
+ </li>
+</ul></div>
+<h5>
+<a name="math_toolkit.main_overview.history1.h1"></a>
<span class="phrase"><a name="math_toolkit.main_overview.history1.boost_1_53"></a></span><a class="link" href="history1.html#math_toolkit.main_overview.history1.boost_1_53">Boost-1.53</a>
</h5>
<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
@@ -63,9 +113,13 @@
and <a class="link" href="../special/sf_gamma/igamma.html" title="Incomplete Gamma Functions">gamma_p</a>/<a class="link" href="../special/sf_gamma/igamma.html" title="Incomplete Gamma Functions">gamma_q</a> thanks
to suggestions from Rocco Romeo.
</li>
+<li class="listitem">
+ Improve accuracy of Bessel J and Y for integer orders thanks to suggestions
+ from Rocco Romeo.
+ </li>
</ul></div>
<h5>
-<a name="math_toolkit.main_overview.history1.h1"></a>
+<a name="math_toolkit.main_overview.history1.h2"></a>
<span class="phrase"><a name="math_toolkit.main_overview.history1.boost_1_52"></a></span><a class="link" href="history1.html#math_toolkit.main_overview.history1.boost_1_52">Boost-1.52</a>
</h5>
<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
@@ -114,14 +168,14 @@
</li>
</ul></div>
<h5>
-<a name="math_toolkit.main_overview.history1.h2"></a>
+<a name="math_toolkit.main_overview.history1.h3"></a>
<span class="phrase"><a name="math_toolkit.main_overview.history1.boost_1_51"></a></span><a class="link" href="history1.html#math_toolkit.main_overview.history1.boost_1_51">Boost-1.51</a>
</h5>
<p>
See Boost-1.52 - some items were added but not listed in time for the release.
</p>
<h5>
-<a name="math_toolkit.main_overview.history1.h3"></a>
+<a name="math_toolkit.main_overview.history1.h4"></a>
<span class="phrase"><a name="math_toolkit.main_overview.history1.boost_1_50"></a></span><a class="link" href="history1.html#math_toolkit.main_overview.history1.boost_1_50">Boost-1.50</a>
</h5>
<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
@@ -160,7 +214,7 @@
</li>
</ul></div>
<h5>
-<a name="math_toolkit.main_overview.history1.h4"></a>
+<a name="math_toolkit.main_overview.history1.h5"></a>
<span class="phrase"><a name="math_toolkit.main_overview.history1.boost_1_49"></a></span><a class="link" href="history1.html#math_toolkit.main_overview.history1.boost_1_49">Boost-1.49</a>
</h5>
<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
@@ -204,7 +258,7 @@
</li>
</ul></div>
<h5>
-<a name="math_toolkit.main_overview.history1.h5"></a>
+<a name="math_toolkit.main_overview.history1.h6"></a>
<span class="phrase"><a name="math_toolkit.main_overview.history1.boost_1_48"></a></span><a class="link" href="history1.html#math_toolkit.main_overview.history1.boost_1_48">Boost-1.48</a>
</h5>
<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
@@ -255,7 +309,7 @@
</li>
</ul></div>
<h5>
-<a name="math_toolkit.main_overview.history1.h6"></a>
+<a name="math_toolkit.main_overview.history1.h7"></a>
<span class="phrase"><a name="math_toolkit.main_overview.history1.boost_1_47"></a></span><a class="link" href="history1.html#math_toolkit.main_overview.history1.boost_1_47">Boost-1.47</a>
</h5>
<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
@@ -272,7 +326,7 @@
</li>
</ul></div>
<h5>
-<a name="math_toolkit.main_overview.history1.h7"></a>
+<a name="math_toolkit.main_overview.history1.h8"></a>
<span class="phrase"><a name="math_toolkit.main_overview.history1.boost_1_46_1"></a></span><a class="link" href="history1.html#math_toolkit.main_overview.history1.boost_1_46_1">Boost-1.46.1</a>
</h5>
<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "><li class="listitem">
@@ -280,7 +334,7 @@
<a href="https://svn.boost.org/trac/boost/ticket/5095" target="_top">#5113</a>.
</li></ul></div>
<h5>
-<a name="math_toolkit.main_overview.history1.h8"></a>
+<a name="math_toolkit.main_overview.history1.h9"></a>
<span class="phrase"><a name="math_toolkit.main_overview.history1.boost_1_46_0"></a></span><a class="link" href="history1.html#math_toolkit.main_overview.history1.boost_1_46_0">Boost-1.46.0</a>
</h5>
<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
@@ -295,7 +349,7 @@
</li>
</ul></div>
<h5>
-<a name="math_toolkit.main_overview.history1.h9"></a>
+<a name="math_toolkit.main_overview.history1.h10"></a>
<span class="phrase"><a name="math_toolkit.main_overview.history1.boost_1_45_0"></a></span><a class="link" href="history1.html#math_toolkit.main_overview.history1.boost_1_45_0">Boost-1.45.0</a>
</h5>
<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
@@ -312,7 +366,7 @@
</li>
</ul></div>
<h5>
-<a name="math_toolkit.main_overview.history1.h10"></a>
+<a name="math_toolkit.main_overview.history1.h11"></a>
<span class="phrase"><a name="math_toolkit.main_overview.history1.boost_1_44_0"></a></span><a class="link" href="history1.html#math_toolkit.main_overview.history1.boost_1_44_0">Boost-1.44.0</a>
</h5>
<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
@@ -326,7 +380,7 @@
</li>
</ul></div>
<h5>
-<a name="math_toolkit.main_overview.history1.h11"></a>
+<a name="math_toolkit.main_overview.history1.h12"></a>
<span class="phrase"><a name="math_toolkit.main_overview.history1.boost_1_41_0"></a></span><a class="link" href="history1.html#math_toolkit.main_overview.history1.boost_1_41_0">Boost-1.41.0</a>
</h5>
<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "><li class="listitem">
@@ -334,7 +388,7 @@
and its inverse.
</li></ul></div>
<h5>
-<a name="math_toolkit.main_overview.history1.h12"></a>
+<a name="math_toolkit.main_overview.history1.h13"></a>
<span class="phrase"><a name="math_toolkit.main_overview.history1.boost_1_40_0"></a></span><a class="link" href="history1.html#math_toolkit.main_overview.history1.boost_1_40_0">Boost-1.40.0</a>
</h5>
<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
@@ -371,7 +425,7 @@
</li>
</ul></div>
<h5>
-<a name="math_toolkit.main_overview.history1.h13"></a>
+<a name="math_toolkit.main_overview.history1.h14"></a>
<span class="phrase"><a name="math_toolkit.main_overview.history1.boost_1_38_0"></a></span><a class="link" href="history1.html#math_toolkit.main_overview.history1.boost_1_38_0">Boost-1.38.0</a>
</h5>
<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
@@ -383,14 +437,14 @@
</li>
</ul></div>
<h5>
-<a name="math_toolkit.main_overview.history1.h14"></a>
+<a name="math_toolkit.main_overview.history1.h15"></a>
<span class="phrase"><a name="math_toolkit.main_overview.history1.boost_1_37_0"></a></span><a class="link" href="history1.html#math_toolkit.main_overview.history1.boost_1_37_0">Boost-1.37.0</a>
</h5>
<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "><li class="listitem">
Improved accuracy and testing of the inverse hypergeometric functions.
</li></ul></div>
<h5>
-<a name="math_toolkit.main_overview.history1.h15"></a>
+<a name="math_toolkit.main_overview.history1.h16"></a>
<span class="phrase"><a name="math_toolkit.main_overview.history1.boost_1_36_0"></a></span><a class="link" href="history1.html#math_toolkit.main_overview.history1.boost_1_36_0">Boost-1.36.0</a>
</h5>
<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
@@ -423,7 +477,7 @@
</li>
</ul></div>
<h5>
-<a name="math_toolkit.main_overview.history1.h16"></a>
+<a name="math_toolkit.main_overview.history1.h17"></a>
<span class="phrase"><a name="math_toolkit.main_overview.history1.boost_1_35_0__post_review_first_official_release"></a></span><a class="link" href="history1.html#math_toolkit.main_overview.history1.boost_1_35_0__post_review_first_official_release">Boost-1.35.0:
Post Review First Official Release</a>
</h5>
@@ -455,7 +509,7 @@
</li>
</ul></div>
<h5>
-<a name="math_toolkit.main_overview.history1.h17"></a>
+<a name="math_toolkit.main_overview.history1.h18"></a>
<span class="phrase"><a name="math_toolkit.main_overview.history1.milestone_4__second_review_candidate__1st_march_2007_"></a></span><a class="link" href="history1.html#math_toolkit.main_overview.history1.milestone_4__second_review_candidate__1st_march_2007_">Milestone
4: Second Review Candidate (1st March 2007)</a>
</h5>
@@ -469,7 +523,7 @@
</li>
</ul></div>
<h5>
-<a name="math_toolkit.main_overview.history1.h18"></a>
+<a name="math_toolkit.main_overview.history1.h19"></a>
<span class="phrase"><a name="math_toolkit.main_overview.history1.milestone_3__first_review_candidate__31st_dec_2006_"></a></span><a class="link" href="history1.html#math_toolkit.main_overview.history1.milestone_3__first_review_candidate__31st_dec_2006_">Milestone
3: First Review Candidate (31st Dec 2006)</a>
</h5>
@@ -497,7 +551,7 @@
</li>
</ul></div>
<h5>
-<a name="math_toolkit.main_overview.history1.h19"></a>
+<a name="math_toolkit.main_overview.history1.h20"></a>
<span class="phrase"><a name="math_toolkit.main_overview.history1.milestone_2__released_september_10th_2006"></a></span><a class="link" href="history1.html#math_toolkit.main_overview.history1.milestone_2__released_september_10th_2006">Milestone
2: Released September 10th 2006</a>
</h5>
@@ -533,7 +587,7 @@
</li>
</ul></div>
<h5>
-<a name="math_toolkit.main_overview.history1.h20"></a>
+<a name="math_toolkit.main_overview.history1.h21"></a>
<span class="phrase"><a name="math_toolkit.main_overview.history1.milestone_1__released_march_31st_2006"></a></span><a class="link" href="history1.html#math_toolkit.main_overview.history1.milestone_1__released_march_31st_2006">Milestone
1: Released March 31st 2006</a>
</h5>
@@ -567,9 +621,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/intro.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/intro.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/intro.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="../main_overview.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../main_overview.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="navigation.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_main_overview_intro">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.main_overview.intro"></a><a class="link" href="intro.html" title="About the Math Toolkit">About the Math Toolkit</a>
</h3></div></div></div>
@@ -76,8 +76,8 @@
</p>
<p>
All the implementations are fully generic and support the use of arbitrary
- "real-number" types, although they are optimised for use with types
- with known-about <a href="http://en.wikipedia.org/wiki/Significand" target="_top">significand
+ "real-number" types, including Boost.Multiprecision,
+ although they are optimised for use with types with known-about <a href="http://en.wikipedia.org/wiki/Significand" target="_top">significand
(or mantissa)</a> sizes: typically <code class="computeroutput"><span class="keyword">float</span></code>,
<code class="computeroutput"><span class="keyword">double</span></code> or <code class="computeroutput"><span class="keyword">long</span>
<span class="keyword">double</span></code>.
@@ -119,9 +119,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/namespaces.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/namespaces.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/namespaces.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="directories.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../main_overview.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="result_type.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_main_overview_namespaces">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.main_overview.namespaces"></a><a class="link" href="namespaces.html" title="Namespaces">Namespaces</a>
</h3></div></div></div>
@@ -80,9 +80,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/navigation.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/navigation.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/navigation.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,12 +22,12 @@
<div class="spirit-nav">
<a accesskey="p" href="intro.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../main_overview.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="conventions.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_main_overview_navigation">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.main_overview.navigation"></a><a class="link" href="navigation.html" title="Navigation">Navigation</a>
</h3></div></div></div>
<p>
- <a class="indexterm" name="id862440"></a>
+ <a class="indexterm" name="id855061"></a>
</p>
<p>
Boost.Math documentation is provided in both HTML and PDF formats.
@@ -87,9 +87,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/perf_over.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/perf_over.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/perf_over.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="threads.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../main_overview.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="building.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_main_overview_perf_over">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.main_overview.perf_over"></a><a class="link" href="perf_over.html" title="Performance">Performance</a>
</h3></div></div></div>
@@ -66,9 +66,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/pol_overview.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/pol_overview.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/pol_overview.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="config_macros.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../main_overview.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="threads.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_main_overview_pol_overview">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.main_overview.pol_overview"></a><a class="link" href="pol_overview.html" title="Policies">Policies</a>
</h3></div></div></div>
@@ -102,9 +102,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/result_type.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/result_type.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/result_type.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="namespaces.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../main_overview.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="error_handling.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_main_overview_result_type">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.main_overview.result_type"></a><a class="link" href="result_type.html" title="Calculation of the Type of the Result">Calculation of
the Type of the Result</a>
@@ -111,7 +111,8 @@
<code class="computeroutput"><span class="keyword">float</span></code>.
</p>
<p>
- And for user defined types, all of the following return an NTL::RR result:
+ And for user-defined types, all of the following return an <code class="computeroutput"><span class="identifier">NTL</span><span class="special">::</span><span class="identifier">RR</span></code>
+ result:
</p>
<pre class="programlisting"><span class="identifier">cyl_bessel_j</span><span class="special">(</span><span class="number">0</span><span class="special">,</span> <span class="identifier">NTL</span><span class="special">::</span><span class="identifier">RR</span><span class="special">(</span><span class="number">2</span><span class="special">));</span>
@@ -120,9 +121,11 @@
<span class="identifier">cyl_bessel_j</span><span class="special">(</span><span class="identifier">NTL</span><span class="special">::</span><span class="identifier">quad_float</span><span class="special">(</span><span class="number">2</span><span class="special">),</span> <span class="identifier">NTL</span><span class="special">::</span><span class="identifier">RR</span><span class="special">(</span><span class="number">3</span><span class="special">));</span>
</pre>
<p>
- In the last case, quad_float is convertible to RR, but not vice-versa, so
- the result will be an NTL::RR. Note that this assumes that you are using
- a <a class="link" href="../using_udt/use_ntl.html" title="Using With NTL - a High-Precision Floating-Point Library">patched NTL library</a>.
+ In the last case, <code class="computeroutput"><span class="identifier">quad_float</span></code>
+ is convertible to <code class="computeroutput"><span class="identifier">RR</span></code>, but
+ not vice-versa, so the result will be an <code class="computeroutput"><span class="identifier">NTL</span><span class="special">::</span><span class="identifier">RR</span></code>. Note
+ that this assumes that you are using a <a class="link" href="../using_udt/high_precision/use_ntl.html" title="Using NTL Library">patched
+ NTL library</a>.
</p>
<p>
These rules are chosen to be compatible with the behaviour of <span class="emphasis"><em>ISO/IEC
@@ -133,9 +136,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/threads.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/threads.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/threads.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="pol_overview.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../main_overview.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="perf_over.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_main_overview_threads">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.main_overview.threads"></a><a class="link" href="threads.html" title="Thread Safety">Thread Safety</a>
</h3></div></div></div>
@@ -35,9 +35,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/tr1.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/tr1.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/tr1.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="history1.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../main_overview.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="faq.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_main_overview_tr1">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.main_overview.tr1"></a><a class="link" href="tr1.html" title="C99 and C++ TR1 C-style Functions">C99 and C++ TR1 C-style
Functions</a>
@@ -605,9 +605,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="policy/pol_ref/pol_ref_ref.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="perf/perf_over.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_perf">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="math_toolkit.perf"></a><a class="link" href="perf.html" title="Performance">Performance</a>
</h2></div></div></div>
@@ -41,9 +41,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf/comp_compilers.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf/comp_compilers.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf/comp_compilers.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="getting_best.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../perf.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="tuning.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_perf_comp_compilers">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.perf.comp_compilers"></a><a class="link" href="comp_compilers.html" title="Comparing Compilers">Comparing Compilers</a>
</h3></div></div></div>
@@ -362,9 +362,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf/comparisons.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf/comparisons.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf/comparisons.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="tuning.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../perf.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="perf_test_app.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_perf_comparisons">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.perf.comparisons"></a><a class="link" href="comparisons.html" title="Comparisons to Other Open Source Libraries">Comparisons to Other Open
Source Libraries</a>
@@ -3121,9 +3121,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf/getting_best.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf/getting_best.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf/getting_best.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="interp.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../perf.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="comp_compilers.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_perf_getting_best">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.perf.getting_best"></a><a class="link" href="getting_best.html" title="Getting the Best Performance from this Library">Getting the Best Performance
from this Library</a>
@@ -279,9 +279,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf/interp.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf/interp.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf/interp.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="perf_over.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../perf.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="getting_best.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_perf_interp">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.perf.interp"></a><a class="link" href="interp.html" title="Interpreting these Results">Interpreting these Results</a>
</h3></div></div></div>
@@ -66,9 +66,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf/perf_over.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf/perf_over.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf/perf_over.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="../perf.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../perf.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="interp.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_perf_perf_over">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.perf.perf_over"></a><a class="link" href="perf_over.html" title="Performance Overview">Performance Overview</a>
</h3></div></div></div>
@@ -66,9 +66,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf/perf_test_app.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf/perf_test_app.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf/perf_test_app.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="comparisons.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../perf.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../backgrounders.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_perf_perf_test_app">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.perf.perf_test_app"></a><a class="link" href="perf_test_app.html" title="The Performance Test Application">The Performance Test
Application</a>
@@ -48,9 +48,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf/tuning.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf/tuning.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf/tuning.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="comp_compilers.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../perf.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="comparisons.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_perf_tuning">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.perf.tuning"></a><a class="link" href="tuning.html" title="Performance Tuning Macros">Performance Tuning Macros</a>
</h3></div></div></div>
@@ -886,9 +886,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="using_udt/archetypes.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="policy/pol_overview.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_policy">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="math_toolkit.policy"></a><a class="link" href="policy.html" title="Policies">Policies</a>
</h2></div></div></div>
@@ -74,9 +74,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_overview.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_overview.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_overview.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="../policy.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../policy.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="pol_tutorial.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_policy_pol_overview">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.policy.pol_overview"></a><a class="link" href="pol_overview.html" title="Policy Overview">Policy Overview</a>
</h3></div></div></div>
@@ -102,9 +102,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="pol_tutorial/understand_dis_quant.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../policy.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="pol_ref/error_handling_policies.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_policy_pol_ref">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.policy.pol_ref"></a><a class="link" href="pol_ref.html" title="Policy Reference">Policy Reference</a>
</h3></div></div></div>
@@ -49,9 +49,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/assert_undefined.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/assert_undefined.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/assert_undefined.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="internal_promotion.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../pol_ref.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="discrete_quant_ref.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_policy_pol_ref_assert_undefined">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.policy.pol_ref.assert_undefined"></a><a class="link" href="assert_undefined.html" title="Mathematically Undefined Function Policies">Mathematically
Undefined Function Policies</a>
@@ -85,9 +85,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/discrete_quant_ref.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/discrete_quant_ref.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/discrete_quant_ref.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="assert_undefined.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../pol_ref.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="precision_pol.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_policy_pol_ref_discrete_quant_ref">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.policy.pol_ref.discrete_quant_ref"></a><a class="link" href="discrete_quant_ref.html" title="Discrete Quantile Policies">Discrete
Quantile Policies</a>
@@ -251,9 +251,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/error_handling_policies.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/error_handling_policies.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/error_handling_policies.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="../pol_ref.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../pol_ref.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="internal_promotion.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_policy_pol_ref_error_handling_policies">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.policy.pol_ref.error_handling_policies"></a><a class="link" href="error_handling_policies.html" title="Error Handling Policies">Error
Handling Policies</a>
@@ -766,9 +766,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/internal_promotion.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/internal_promotion.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/internal_promotion.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="error_handling_policies.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../pol_ref.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="assert_undefined.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_policy_pol_ref_internal_promotion">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.policy.pol_ref.internal_promotion"></a><a class="link" href="internal_promotion.html" title="Internal Floating-point Promotion Policies">Internal
Floating-point Promotion Policies</a>
@@ -141,9 +141,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/iteration_pol.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/iteration_pol.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/iteration_pol.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="precision_pol.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../pol_ref.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="policy_defaults.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_policy_pol_ref_iteration_pol">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.policy.pol_ref.iteration_pol"></a><a class="link" href="iteration_pol.html" title="Iteration Limits Policies">Iteration
Limits Policies</a>
@@ -51,9 +51,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/namespace_pol.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/namespace_pol.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/namespace_pol.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="policy_defaults.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../pol_ref.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="pol_ref_ref.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_policy_pol_ref_namespace_pol">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.policy.pol_ref.namespace_pol"></a><a class="link" href="namespace_pol.html" title="Setting Polices at Namespace Scope">Setting
Polices at Namespace Scope</a>
@@ -149,9 +149,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/pol_ref_ref.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/pol_ref_ref.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/pol_ref_ref.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="namespace_pol.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../pol_ref.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../perf.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_policy_pol_ref_pol_ref_ref">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.policy.pol_ref.pol_ref_ref"></a><a class="link" href="pol_ref_ref.html" title="Policy Class Reference">Policy Class
Reference</a>
@@ -244,9 +244,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/policy_defaults.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/policy_defaults.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/policy_defaults.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="iteration_pol.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../pol_ref.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="namespace_pol.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_policy_pol_ref_policy_defaults">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.policy.pol_ref.policy_defaults"></a><a class="link" href="policy_defaults.html" title="Using Macros to Change the Policy Defaults">Using
Macros to Change the Policy Defaults</a>
@@ -244,9 +244,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/precision_pol.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/precision_pol.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/precision_pol.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="discrete_quant_ref.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../pol_ref.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="iteration_pol.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_policy_pol_ref_precision_pol">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.policy.pol_ref.precision_pol"></a><a class="link" href="precision_pol.html" title="Precision Policies">Precision
Policies</a>
@@ -106,9 +106,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="pol_overview.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../policy.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="pol_tutorial/what_is_a_policy.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_policy_pol_tutorial">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.policy.pol_tutorial"></a><a class="link" href="pol_tutorial.html" title="Policy Tutorial">Policy Tutorial</a>
</h3></div></div></div>
@@ -49,9 +49,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/ad_hoc_dist_policies.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/ad_hoc_dist_policies.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/ad_hoc_dist_policies.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="changing_policy_defaults.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../pol_tutorial.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="ad_hoc_sf_policies.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_policy_pol_tutorial_ad_hoc_dist_policies">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.policy.pol_tutorial.ad_hoc_dist_policies"></a><a class="link" href="ad_hoc_dist_policies.html" title="Setting Policies for Distributions on an Ad Hoc Basis">Setting
Policies for Distributions on an Ad Hoc Basis</a>
@@ -93,9 +93,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/ad_hoc_sf_policies.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/ad_hoc_sf_policies.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/ad_hoc_sf_policies.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="ad_hoc_dist_policies.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../pol_tutorial.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="namespace_policies.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_policy_pol_tutorial_ad_hoc_sf_policies">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.policy.pol_tutorial.ad_hoc_sf_policies"></a><a class="link" href="ad_hoc_sf_policies.html" title="Changing the Policy on an Ad Hoc Basis for the Special Functions">Changing
the Policy on an Ad Hoc Basis for the Special Functions</a>
@@ -165,9 +165,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/changing_policy_defaults.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/changing_policy_defaults.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/changing_policy_defaults.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="policy_usage.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../pol_tutorial.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="ad_hoc_dist_policies.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_policy_pol_tutorial_changing_policy_defaults">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.policy.pol_tutorial.changing_policy_defaults"></a><a class="link" href="changing_policy_defaults.html" title="Changing the Policy Defaults">Changing
the Policy Defaults</a>
@@ -263,9 +263,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/namespace_policies.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/namespace_policies.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/namespace_policies.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="ad_hoc_sf_policies.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../pol_tutorial.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="user_def_err_pol.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_policy_pol_tutorial_namespace_policies">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.policy.pol_tutorial.namespace_policies"></a><a class="link" href="namespace_policies.html" title="Setting Policies at Namespace or Translation Unit Scope">Setting
Policies at Namespace or Translation Unit Scope</a>
@@ -401,9 +401,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/policy_tut_defaults.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/policy_tut_defaults.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/policy_tut_defaults.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="what_is_a_policy.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../pol_tutorial.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="policy_usage.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_policy_pol_tutorial_policy_tut_defaults">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.policy.pol_tutorial.policy_tut_defaults"></a><a class="link" href="policy_tut_defaults.html" title="Policies Have Sensible Defaults">Policies
Have Sensible Defaults</a>
@@ -125,9 +125,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/policy_usage.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/policy_usage.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/policy_usage.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="policy_tut_defaults.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../pol_tutorial.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="changing_policy_defaults.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_policy_pol_tutorial_policy_usage">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.policy.pol_tutorial.policy_usage"></a><a class="link" href="policy_usage.html" title="So How are Policies Used Anyway?">So How
are Policies Used Anyway?</a>
@@ -56,9 +56,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/understand_dis_quant.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/understand_dis_quant.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/understand_dis_quant.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="user_def_err_pol.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../pol_tutorial.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../pol_ref.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_policy_pol_tutorial_understand_dis_quant">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.policy.pol_tutorial.understand_dis_quant"></a><a class="link" href="understand_dis_quant.html" title="Understanding Quantiles of Discrete Distributions">Understanding
Quantiles of Discrete Distributions</a>
@@ -415,9 +415,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/user_def_err_pol.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/user_def_err_pol.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/user_def_err_pol.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="namespace_policies.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../pol_tutorial.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="understand_dis_quant.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_policy_pol_tutorial_user_def_err_pol">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.policy.pol_tutorial.user_def_err_pol"></a><a class="link" href="user_def_err_pol.html" title="Calling User Defined Error Handlers">Calling
User Defined Error Handlers</a>
@@ -516,9 +516,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/what_is_a_policy.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/what_is_a_policy.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/what_is_a_policy.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="../pol_tutorial.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../pol_tutorial.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="policy_tut_defaults.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_policy_pol_tutorial_what_is_a_policy">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.policy.pol_tutorial.what_is_a_policy"></a><a class="link" href="what_is_a_policy.html" title="So Just What is a Policy Anyway?">So
Just What is a Policy Anyway?</a>
@@ -72,9 +72,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="dist/future.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="special/sf_gamma.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="math_toolkit.special"></a><a class="link" href="special.html" title="Special Functions">Special Functions</a>
</h2></div></div></div>
@@ -85,6 +85,8 @@
Overview</a></span></dt>
<dt><span class="section"><a href="special/bessel/bessel.html">Bessel Functions
of the First and Second Kinds</a></span></dt>
+<dt><span class="section"><a href="special/bessel/bessel0.html">Finding Zeros
+ of Bessel Functions of the First and Second Kinds</a></span></dt>
<dt><span class="section"><a href="special/bessel/mbessel.html">Modified Bessel
Functions of the First and Second Kinds</a></span></dt>
<dt><span class="section"><a href="special/bessel/sph_bessel.html">Spherical Bessel
@@ -157,9 +159,10 @@
<dt><span class="section"><a href="special/expint/expint_i.html">Exponential Integral
Ei</a></span></dt>
</dl></dd>
-<dt><span class="section"><a href="special/powers.html">Logs, Powers, Roots and
- Exponentials</a></span></dt>
+<dt><span class="section">Basic Functions</span></dt>
<dd><dl>
+<dt><span class="section">sin_pi</span></dt>
+<dt><span class="section">cos_pi</span></dt>
<dt><span class="section">log1p</span></dt>
<dt><span class="section">expm1</span></dt>
<dt><span class="section">cbrt</span></dt>
@@ -190,9 +193,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/airy.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/airy.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/airy.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="hankel/sph_hankel.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../special.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="airy/ai.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_airy">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.special.airy"></a><a class="link" href="airy.html" title="Airy Functions">Airy Functions</a>
</h3></div></div></div>
@@ -35,9 +35,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/airy/ai.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/airy/ai.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/airy/ai.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="../airy.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../airy.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="bi.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_airy_ai">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.airy.ai"></a><a class="link" href="ai.html" title="Airy Ai Function">Airy Ai Function</a>
</h4></div></div></div>
@@ -112,9 +112,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/airy/aip.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/airy/aip.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/airy/aip.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="bi.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../airy.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="bip.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_airy_aip">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.airy.aip"></a><a class="link" href="aip.html" title="Airy Ai' Function">Airy Ai' Function</a>
</h4></div></div></div>
@@ -108,9 +108,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/airy/bi.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/airy/bi.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/airy/bi.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="ai.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../airy.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="aip.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_airy_bi">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.airy.bi"></a><a class="link" href="bi.html" title="Airy Bi Function">Airy Bi Function</a>
</h4></div></div></div>
@@ -108,9 +108,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/airy/bip.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/airy/bip.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/airy/bip.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="aip.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../airy.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../ellint.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_airy_bip">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.airy.bip"></a><a class="link" href="bip.html" title="Airy Bi' Function">Airy Bi' Function</a>
</h4></div></div></div>
@@ -108,9 +108,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="sf_poly/sph_harm.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../special.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="bessel/bessel_over.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_bessel">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.special.bessel"></a><a class="link" href="bessel.html" title="Bessel Functions">Bessel Functions</a>
</h3></div></div></div>
@@ -31,6 +31,8 @@
Overview</a></span></dt>
<dt><span class="section"><a href="bessel/bessel.html">Bessel Functions
of the First and Second Kinds</a></span></dt>
+<dt><span class="section"><a href="bessel/bessel0.html">Finding Zeros
+ of Bessel Functions of the First and Second Kinds</a></span></dt>
<dt><span class="section"><a href="bessel/mbessel.html">Modified Bessel
Functions of the First and Second Kinds</a></span></dt>
<dt><span class="section"><a href="bessel/sph_bessel.html">Spherical Bessel
@@ -39,9 +41,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel/bessel.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel/bessel.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel/bessel.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -7,7 +7,7 @@
<link rel="home" href="../../../index.html" title="Math Toolkit">
<link rel="up" href="../bessel.html" title="Bessel Functions">
<link rel="prev" href="bessel_over.html" title="Bessel Function Overview">
-<link rel="next" href="mbessel.html" title="Modified Bessel Functions of the First and Second Kinds">
+<link rel="next" href="bessel0.html" title="Finding Zeros of Bessel Functions of the First and Second Kinds">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
@@ -20,9 +20,9 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="bessel_over.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../bessel.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="mbessel.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="bessel_over.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../bessel.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="bessel0.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_bessel_bessel">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.bessel.bessel"></a><a class="link" href="bessel.html" title="Bessel Functions of the First and Second Kinds">Bessel Functions
of the First and Second Kinds</a>
@@ -31,6 +31,9 @@
<a name="math_toolkit.special.bessel.bessel.h0"></a>
<span class="phrase"><a name="math_toolkit.special.bessel.bessel.synopsis"></a></span><a class="link" href="bessel.html#math_toolkit.special.bessel.bessel.synopsis">Synopsis</a>
</h5>
+<p>
+ <code class="computeroutput"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">special_functions</span><span class="special">/</span><span class="identifier">bessel</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></code>
+ </p>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">T1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T2</span><span class="special">></span>
<a class="link" href="../../main_overview/result_type.html" title="Calculation of the Type of the Result"><span class="emphasis"><em>calculated-result-type</em></span></a> <span class="identifier">cyl_bessel_j</span><span class="special">(</span><span class="identifier">T1</span> <span class="identifier">v</span><span class="special">,</span> <span class="identifier">T2</span> <span class="identifier">x</span><span class="special">);</span>
@@ -204,7 +207,7 @@
</td>
<td>
<p>
- Peak=413 Mean=110
+ Peak=59 Mean=10
</p>
<p>
GSL Peak=6x10<sup>11</sup>
@@ -321,17 +324,17 @@
</th>
<th>
<p>
- J<sub>0</sub>   and J<sub>1</sub>
+ Y<sub>0</sub>   and Y<sub>1</sub>
</p>
</th>
<th>
<p>
- J<sub>n</sub> (integer orders)
+ Y<sub>n</sub> (integer orders)
</p>
</th>
<th>
<p>
- J<sub>v</sub> (fractional orders)
+ Y<sub>v</sub> (fractional orders)
</p>
</th>
</tr></thead>
@@ -349,7 +352,7 @@
</td>
<td>
<p>
- Peak=330 Mean=54
+ Peak=4.7 Mean=1.7
</p>
<p>
GSL Peak=34 Mean=9
@@ -361,7 +364,7 @@
</td>
<td>
<p>
- Peak=923 Mean=83
+ Peak=117 Mean=10
</p>
<p>
GSL Peak=500 Mean=54
@@ -373,7 +376,7 @@
</td>
<td>
<p>
- Peak=561 Mean=36
+ Peak=800 Mean=40
</p>
<p>
GSL Peak=1.4x10<sup>6</sup>   Mean=7x10<sup>4</sup>  
@@ -680,9 +683,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
@@ -690,7 +693,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="bessel_over.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../bessel.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="mbessel.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="bessel_over.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../bessel.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="bessel0.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel/bessel_over.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel/bessel_over.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel/bessel_over.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="../bessel.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../bessel.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="bessel.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_bessel_bessel_over">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.bessel.bessel_over"></a><a class="link" href="bessel_over.html" title="Bessel Function Overview">Bessel Function
Overview</a>
@@ -198,9 +198,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel/mbessel.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel/mbessel.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel/mbessel.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -6,7 +6,7 @@
<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<link rel="home" href="../../../index.html" title="Math Toolkit">
<link rel="up" href="../bessel.html" title="Bessel Functions">
-<link rel="prev" href="bessel.html" title="Bessel Functions of the First and Second Kinds">
+<link rel="prev" href="bessel0.html" title="Finding Zeros of Bessel Functions of the First and Second Kinds">
<link rel="next" href="sph_bessel.html" title="Spherical Bessel Functions of the First and Second Kinds">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
@@ -20,9 +20,9 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="bessel.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../bessel.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="sph_bessel.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="bessel0.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../bessel.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="sph_bessel.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_bessel_mbessel">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.bessel.mbessel"></a><a class="link" href="mbessel.html" title="Modified Bessel Functions of the First and Second Kinds">Modified Bessel
Functions of the First and Second Kinds</a>
@@ -31,6 +31,9 @@
<a name="math_toolkit.special.bessel.mbessel.h0"></a>
<span class="phrase"><a name="math_toolkit.special.bessel.mbessel.synopsis"></a></span><a class="link" href="mbessel.html#math_toolkit.special.bessel.mbessel.synopsis">Synopsis</a>
</h5>
+<p>
+ <code class="computeroutput"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">special_functions</span><span class="special">/</span><span class="identifier">bessel</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></code>
+ </p>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">T1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T2</span><span class="special">></span>
<a class="link" href="../../main_overview/result_type.html" title="Calculation of the Type of the Result"><span class="emphasis"><em>calculated-result-type</em></span></a> <span class="identifier">cyl_bessel_i</span><span class="special">(</span><span class="identifier">T1</span> <span class="identifier">v</span><span class="special">,</span> <span class="identifier">T2</span> <span class="identifier">x</span><span class="special">);</span>
@@ -471,9 +474,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
@@ -481,7 +484,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="bessel.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../bessel.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="sph_bessel.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="bessel0.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../bessel.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="sph_bessel.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel/sph_bessel.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel/sph_bessel.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel/sph_bessel.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="mbessel.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../bessel.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../hankel.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_bessel_sph_bessel">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.bessel.sph_bessel"></a><a class="link" href="sph_bessel.html" title="Spherical Bessel Functions of the First and Second Kinds">Spherical Bessel
Functions of the First and Second Kinds</a>
@@ -31,6 +31,9 @@
<a name="math_toolkit.special.bessel.sph_bessel.h0"></a>
<span class="phrase"><a name="math_toolkit.special.bessel.sph_bessel.synopsis"></a></span><a class="link" href="sph_bessel.html#math_toolkit.special.bessel.sph_bessel.synopsis">Synopsis</a>
</h5>
+<p>
+ <code class="computeroutput"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">special_functions</span><span class="special">/</span><span class="identifier">bessel</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></code>
+ </p>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">T1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T2</span><span class="special">></span>
<a class="link" href="../../main_overview/result_type.html" title="Calculation of the Type of the Result"><span class="emphasis"><em>calculated-result-type</em></span></a> <span class="identifier">sph_bessel</span><span class="special">(</span><span class="keyword">unsigned</span> <span class="identifier">v</span><span class="special">,</span> <span class="identifier">T2</span> <span class="identifier">x</span><span class="special">);</span>
@@ -141,9 +144,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="airy/bip.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../special.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="ellint/ellint_intro.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_ellint">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.special.ellint"></a><a class="link" href="ellint.html" title="Elliptic Integrals">Elliptic Integrals</a>
</h3></div></div></div>
@@ -41,9 +41,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_1.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_1.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_1.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="ellint_carlson.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../ellint.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="ellint_2.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_ellint_ellint_1">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.ellint.ellint_1"></a><a class="link" href="ellint_1.html" title="Elliptic Integrals of the First Kind - Legendre Form">Elliptic Integrals
of the First Kind - Legendre Form</a>
@@ -253,9 +253,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_2.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_2.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_2.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="ellint_1.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../ellint.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="ellint_3.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_ellint_ellint_2">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.ellint.ellint_2"></a><a class="link" href="ellint_2.html" title="Elliptic Integrals of the Second Kind - Legendre Form">Elliptic Integrals
of the Second Kind - Legendre Form</a>
@@ -253,9 +253,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_3.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_3.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_3.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="ellint_2.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../ellint.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../jacobi.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_ellint_ellint_3">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.ellint.ellint_3"></a><a class="link" href="ellint_3.html" title="Elliptic Integrals of the Third Kind - Legendre Form">Elliptic Integrals
of the Third Kind - Legendre Form</a>
@@ -307,9 +307,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_carlson.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_carlson.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_carlson.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="ellint_intro.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../ellint.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="ellint_1.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_ellint_ellint_carlson">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.ellint.ellint_carlson"></a><a class="link" href="ellint_carlson.html" title="Elliptic Integrals - Carlson Form">Elliptic
Integrals - Carlson Form</a>
@@ -427,9 +427,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_intro.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_intro.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_intro.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="../ellint.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../ellint.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="ellint_carlson.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_ellint_ellint_intro">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.ellint.ellint_intro"></a><a class="link" href="ellint_intro.html" title="Elliptic Integral Overview">Elliptic
Integral Overview</a>
@@ -393,9 +393,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/expint.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/expint.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/expint.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="zetas/zeta.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../special.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="expint/expint_n.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_expint">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.special.expint"></a><a class="link" href="expint.html" title="Exponential Integrals">Exponential Integrals</a>
</h3></div></div></div>
@@ -35,9 +35,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/expint/expint_i.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/expint/expint_i.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/expint/expint_i.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -7,7 +7,7 @@
<link rel="home" href="../../../index.html" title="Math Toolkit">
<link rel="up" href="../expint.html" title="Exponential Integrals">
<link rel="prev" href="expint_n.html" title="Exponential Integral En">
-<link rel="next" href="../powers.html" title="Logs, Powers, Roots and Exponentials">
+<link rel="next" href="../powers.html" title="Basic Functions">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="expint_n.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../expint.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../powers.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_expint_expint_i">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.expint.expint_i"></a><a class="link" href="expint_i.html" title="Exponential Integral Ei">Exponential Integral
Ei</a>
@@ -286,9 +286,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/expint/expint_n.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/expint/expint_n.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/expint/expint_n.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="../expint.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../expint.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="expint_i.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_expint_expint_n">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.expint.expint_n"></a><a class="link" href="expint_n.html" title="Exponential Integral En">Exponential Integral
En</a>
@@ -281,9 +281,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="sf_gamma/gamma_derivatives.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../special.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="factorials/sf_factorial.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_factorials">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.special.factorials"></a><a class="link" href="factorials.html" title="Factorials and Binomial Coefficients">Factorials and Binomial
Coefficients</a>
@@ -41,9 +41,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_binomial.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_binomial.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_binomial.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="sf_falling_factorial.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../factorials.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../sf_beta.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_factorials_sf_binomial">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.factorials.sf_binomial"></a><a class="link" href="sf_binomial.html" title="Binomial Coefficients">Binomial
Coefficients</a>
@@ -132,9 +132,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_double_factorial.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_double_factorial.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_double_factorial.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="sf_factorial.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../factorials.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="sf_rising_factorial.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_factorials_sf_double_factorial">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.factorials.sf_double_factorial"></a><a class="link" href="sf_double_factorial.html" title="Double Factorial">Double
Factorial</a>
@@ -152,9 +152,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_factorial.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_factorial.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_factorial.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="../factorials.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../factorials.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="sf_double_factorial.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_factorials_sf_factorial">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.factorials.sf_factorial"></a><a class="link" href="sf_factorial.html" title="Factorial">Factorial</a>
</h4></div></div></div>
@@ -184,9 +184,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_falling_factorial.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_falling_factorial.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_falling_factorial.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="sf_rising_factorial.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../factorials.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="sf_binomial.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_factorials_sf_falling_factorial">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.factorials.sf_falling_factorial"></a><a class="link" href="sf_falling_factorial.html" title="Falling Factorial">Falling
Factorial</a>
@@ -97,9 +97,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_rising_factorial.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_rising_factorial.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_rising_factorial.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="sf_double_factorial.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../factorials.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="sf_falling_factorial.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_factorials_sf_rising_factorial">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.factorials.sf_rising_factorial"></a><a class="link" href="sf_rising_factorial.html" title="Rising Factorial">Rising
Factorial</a>
@@ -101,9 +101,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/hankel.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/hankel.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/hankel.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="bessel/sph_bessel.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../special.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="hankel/cyl_hankel.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_hankel">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.special.hankel"></a><a class="link" href="hankel.html" title="Hankel Functions">Hankel Functions</a>
</h3></div></div></div>
@@ -35,9 +35,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/hankel/cyl_hankel.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/hankel/cyl_hankel.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/hankel/cyl_hankel.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="../hankel.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../hankel.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="sph_hankel.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_hankel_cyl_hankel">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.hankel.cyl_hankel"></a><a class="link" href="cyl_hankel.html" title="Cyclic Hankel Functions">Cyclic Hankel
Functions</a>
@@ -146,9 +146,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/hankel/sph_hankel.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/hankel/sph_hankel.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/hankel/sph_hankel.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="cyl_hankel.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../hankel.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../airy.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_hankel_sph_hankel">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.hankel.sph_hankel"></a><a class="link" href="sph_hankel.html" title="Spherical Hankel Functions">Spherical Hankel
Functions</a>
@@ -107,9 +107,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="sinc/sinhc_pi.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../special.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="inv_hyper/inv_hyper_over.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_inv_hyper">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.special.inv_hyper"></a><a class="link" href="inv_hyper.html" title="Inverse Hyperbolic Functions">Inverse Hyperbolic Functions</a>
</h3></div></div></div>
@@ -36,9 +36,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper/acosh.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper/acosh.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper/acosh.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="inv_hyper_over.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../inv_hyper.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="asinh.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_inv_hyper_acosh">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.inv_hyper.acosh"></a><a class="link" href="acosh.html" title="acosh">acosh</a>
</h4></div></div></div>
@@ -116,9 +116,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper/asinh.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper/asinh.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper/asinh.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="acosh.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../inv_hyper.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="atanh.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_inv_hyper_asinh">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.inv_hyper.asinh"></a><a class="link" href="asinh.html" title="asinh">asinh</a>
</h4></div></div></div>
@@ -111,9 +111,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper/atanh.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper/atanh.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper/atanh.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="asinh.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../inv_hyper.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../owens_t.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_inv_hyper_atanh">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.inv_hyper.atanh"></a><a class="link" href="atanh.html" title="atanh">atanh</a>
</h4></div></div></div>
@@ -121,9 +121,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper/inv_hyper_over.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper/inv_hyper_over.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper/inv_hyper_over.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="../inv_hyper.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../inv_hyper.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="acosh.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_inv_hyper_inv_hyper_over">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.inv_hyper.inv_hyper_over"></a><a class="link" href="inv_hyper_over.html" title="Inverse Hyperbolic Functions Overview">Inverse
Hyperbolic Functions Overview</a>
@@ -99,9 +99,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/jacobi.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/jacobi.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/jacobi.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="ellint/ellint_3.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../special.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="jacobi/jac_over.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_jacobi">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.special.jacobi"></a><a class="link" href="jacobi.html" title="Jacobi Elliptic Functions">Jacobi Elliptic Functions</a>
</h3></div></div></div>
@@ -59,9 +59,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/jacobi/jac_over.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/jacobi/jac_over.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/jacobi/jac_over.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="../jacobi.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../jacobi.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="jacobi_elliptic.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_jacobi_jac_over">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.jacobi.jac_over"></a><a class="link" href="jac_over.html" title="Overvew of the Jacobi Elliptic Functions">Overvew of the
Jacobi Elliptic Functions</a>
@@ -111,9 +111,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/jacobi/jacobi_cd.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/jacobi/jacobi_cd.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/jacobi/jacobi_cd.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="jacobi_elliptic.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../jacobi.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="jacobi_cn.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_jacobi_jacobi_cd">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.jacobi.jacobi_cd"></a><a class="link" href="jacobi_cd.html" title="Jacobi Elliptic Function cd">Jacobi Elliptic
Function cd</a>
@@ -72,9 +72,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/jacobi/jacobi_cn.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/jacobi/jacobi_cn.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/jacobi/jacobi_cn.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="jacobi_cd.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../jacobi.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="jacobi_cs.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_jacobi_jacobi_cn">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.jacobi.jacobi_cn"></a><a class="link" href="jacobi_cn.html" title="Jacobi Elliptic Function cn">Jacobi Elliptic
Function cn</a>
@@ -68,9 +68,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/jacobi/jacobi_cs.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/jacobi/jacobi_cs.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/jacobi/jacobi_cs.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="jacobi_cn.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../jacobi.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="jacobi_dc.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_jacobi_jacobi_cs">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.jacobi.jacobi_cs"></a><a class="link" href="jacobi_cs.html" title="Jacobi Elliptic Function cs">Jacobi Elliptic
Function cs</a>
@@ -72,9 +72,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/jacobi/jacobi_dc.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/jacobi/jacobi_dc.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/jacobi/jacobi_dc.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="jacobi_cs.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../jacobi.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="jacobi_dn.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_jacobi_jacobi_dc">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.jacobi.jacobi_dc"></a><a class="link" href="jacobi_dc.html" title="Jacobi Elliptic Function dc">Jacobi Elliptic
Function dc</a>
@@ -72,9 +72,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/jacobi/jacobi_dn.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/jacobi/jacobi_dn.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/jacobi/jacobi_dn.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="jacobi_dc.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../jacobi.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="jacobi_ds.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_jacobi_jacobi_dn">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.jacobi.jacobi_dn"></a><a class="link" href="jacobi_dn.html" title="Jacobi Elliptic Function dn">Jacobi Elliptic
Function dn</a>
@@ -68,9 +68,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/jacobi/jacobi_ds.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/jacobi/jacobi_ds.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/jacobi/jacobi_ds.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="jacobi_dn.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../jacobi.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="jacobi_nc.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_jacobi_jacobi_ds">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.jacobi.jacobi_ds"></a><a class="link" href="jacobi_ds.html" title="Jacobi Elliptic Function ds">Jacobi Elliptic
Function ds</a>
@@ -72,9 +72,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/jacobi/jacobi_elliptic.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/jacobi/jacobi_elliptic.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/jacobi/jacobi_elliptic.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="jac_over.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../jacobi.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="jacobi_cd.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_jacobi_jacobi_elliptic">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.jacobi.jacobi_elliptic"></a><a class="link" href="jacobi_elliptic.html" title="Jacobi Elliptic SN, CN and DN">Jacobi
Elliptic SN, CN and DN</a>
@@ -39,11 +39,11 @@
</p>
<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">boost</span> <span class="special">{</span> <span class="keyword">namespace</span> <span class="identifier">math</span> <span class="special">{</span>
- <span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">T</span><span class="special">></span>
- <a class="link" href="../../main_overview/result_type.html" title="Calculation of the Type of the Result"><span class="emphasis"><em>calculated-result-type</em></span></a> <span class="identifier">jacobi_elliptic</span><span class="special">(</span><span class="identifier">T</span> <span class="identifier">k</span><span class="special">,</span> <span class="identifier">T</span> <span class="identifier">u</span><span class="special">,</span> <span class="identifier">T</span><span class="special">*</span> <span class="identifier">pcn</span><span class="special">,</span> <span class="identifier">T</span><span class="special">*</span> <span class="identifier">pdn</span><span class="special">);</span>
+ <span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">T</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">U</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">V</span><span class="special">></span>
+ <a class="link" href="../../main_overview/result_type.html" title="Calculation of the Type of the Result"><span class="emphasis"><em>calculated-result-type</em></span></a> <span class="identifier">jacobi_elliptic</span><span class="special">(</span><span class="identifier">T</span> <span class="identifier">k</span><span class="special">,</span> <span class="identifier">U</span> <span class="identifier">u</span><span class="special">,</span> <span class="identifier">V</span><span class="special">*</span> <span class="identifier">pcn</span><span class="special">,</span> <span class="identifier">V</span><span class="special">*</span> <span class="identifier">pdn</span><span class="special">);</span>
- <span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">T</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Policy</span><span class="special">></span>
- <a class="link" href="../../main_overview/result_type.html" title="Calculation of the Type of the Result"><span class="emphasis"><em>calculated-result-type</em></span></a> <span class="identifier">jacobi_elliptic</span><span class="special">(</span><span class="identifier">T</span> <span class="identifier">k</span><span class="special">,</span> <span class="identifier">T</span> <span class="identifier">u</span><span class="special">,</span> <span class="identifier">T</span><span class="special">*</span> <span class="identifier">pcn</span><span class="special">,</span> <span class="identifier">T</span><span class="special">*</span> <span class="identifier">pdn</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Policy</span><span class="special">&);</span>
+ <span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">T</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">U</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">V</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Policy</span><span class="special">></span>
+ <a class="link" href="../../main_overview/result_type.html" title="Calculation of the Type of the Result"><span class="emphasis"><em>calculated-result-type</em></span></a> <span class="identifier">jacobi_elliptic</span><span class="special">(</span><span class="identifier">T</span> <span class="identifier">k</span><span class="special">,</span> <span class="identifier">U</span> <span class="identifier">u</span><span class="special">,</span> <span class="identifier">V</span><span class="special">*</span> <span class="identifier">pcn</span><span class="special">,</span> <span class="identifier">V</span><span class="special">*</span> <span class="identifier">pdn</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Policy</span><span class="special">&);</span>
<span class="special">}}</span> <span class="comment">// namespaces</span>
</pre>
@@ -288,9 +288,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/jacobi/jacobi_nc.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/jacobi/jacobi_nc.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/jacobi/jacobi_nc.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="jacobi_ds.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../jacobi.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="jacobi_nd.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_jacobi_jacobi_nc">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.jacobi.jacobi_nc"></a><a class="link" href="jacobi_nc.html" title="Jacobi Elliptic Function nc">Jacobi Elliptic
Function nc</a>
@@ -72,9 +72,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/jacobi/jacobi_nd.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/jacobi/jacobi_nd.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/jacobi/jacobi_nd.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="jacobi_nc.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../jacobi.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="jacobi_ns.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_jacobi_jacobi_nd">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.jacobi.jacobi_nd"></a><a class="link" href="jacobi_nd.html" title="Jacobi Elliptic Function nd">Jacobi Elliptic
Function nd</a>
@@ -72,9 +72,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/jacobi/jacobi_ns.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/jacobi/jacobi_ns.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/jacobi/jacobi_ns.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="jacobi_nd.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../jacobi.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="jacobi_sc.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_jacobi_jacobi_ns">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.jacobi.jacobi_ns"></a><a class="link" href="jacobi_ns.html" title="Jacobi Elliptic Function ns">Jacobi Elliptic
Function ns</a>
@@ -72,9 +72,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/jacobi/jacobi_sc.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/jacobi/jacobi_sc.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/jacobi/jacobi_sc.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="jacobi_ns.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../jacobi.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="jacobi_sd.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_jacobi_jacobi_sc">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.jacobi.jacobi_sc"></a><a class="link" href="jacobi_sc.html" title="Jacobi Elliptic Function sc">Jacobi Elliptic
Function sc</a>
@@ -72,9 +72,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/jacobi/jacobi_sd.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/jacobi/jacobi_sd.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/jacobi/jacobi_sd.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="jacobi_sc.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../jacobi.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="jacobi_sn.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_jacobi_jacobi_sd">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.jacobi.jacobi_sd"></a><a class="link" href="jacobi_sd.html" title="Jacobi Elliptic Function sd">Jacobi Elliptic
Function sd</a>
@@ -72,9 +72,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/jacobi/jacobi_sn.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/jacobi/jacobi_sn.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/jacobi/jacobi_sn.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="jacobi_sd.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../jacobi.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../zetas.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_jacobi_jacobi_sn">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.jacobi.jacobi_sn"></a><a class="link" href="jacobi_sn.html" title="Jacobi Elliptic Function sn">Jacobi Elliptic
Function sn</a>
@@ -68,9 +68,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/owens_t.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/owens_t.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/owens_t.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="inv_hyper/atanh.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../special.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../utils.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_owens_t">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.special.owens_t"></a><a class="link" href="owens_t.html" title="Owen's T function">Owen's T function</a>
</h3></div></div></div>
@@ -215,9 +215,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -1,13 +1,13 @@
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Logs, Powers, Roots and Exponentials</title>
+<title>Basic Functions</title>
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<link rel="home" href="../../index.html" title="Math Toolkit">
<link rel="up" href="../special.html" title="Special Functions">
<link rel="prev" href="expint/expint_i.html" title="Exponential Integral Ei">
-<link rel="next" href="powers/log1p.html" title="log1p">
+<link rel="next" href="powers/sin_pi.html" title="sin_pi">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
@@ -20,14 +20,15 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="expint/expint_i.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../special.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="powers/log1p.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="expint/expint_i.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../special.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="powers/sin_pi.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_powers">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.special.powers"></a><a class="link" href="powers.html" title="Logs, Powers, Roots and Exponentials">Logs, Powers, Roots and
- Exponentials</a>
+<a name="math_toolkit.special.powers"></a><a class="link" href="powers.html" title="Basic Functions">Basic Functions</a>
</h3></div></div></div>
<div class="toc"><dl>
+<dt><span class="section">sin_pi</span></dt>
+<dt><span class="section">cos_pi</span></dt>
<dt><span class="section">log1p</span></dt>
<dt><span class="section">expm1</span></dt>
<dt><span class="section">cbrt</span></dt>
@@ -40,9 +41,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
@@ -50,7 +51,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="expint/expint_i.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../special.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="powers/log1p.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="expint/expint_i.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../special.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="powers/sin_pi.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/cbrt.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/cbrt.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/cbrt.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -5,7 +5,7 @@
<link rel="stylesheet" href="../../../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<link rel="home" href="../../../index.html" title="Math Toolkit">
-<link rel="up" href="../powers.html" title="Logs, Powers, Roots and Exponentials">
+<link rel="up" href="../powers.html" title="Basic Functions">
<link rel="prev" href="expm1.html" title="expm1">
<link rel="next" href="sqrt1pm1.html" title="sqrt1pm1">
</head>
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="expm1.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../powers.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="sqrt1pm1.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_powers_cbrt">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.powers.cbrt"></a><a class="link" href="cbrt.html" title="cbrt">cbrt</a>
</h4></div></div></div>
@@ -83,9 +83,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/ct_pow.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/ct_pow.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/ct_pow.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -5,7 +5,7 @@
<link rel="stylesheet" href="../../../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<link rel="home" href="../../../index.html" title="Math Toolkit">
-<link rel="up" href="../powers.html" title="Logs, Powers, Roots and Exponentials">
+<link rel="up" href="../powers.html" title="Basic Functions">
<link rel="prev" href="hypot.html" title="hypot">
<link rel="next" href="../sinc.html" title="Sinus Cardinal and Hyperbolic Sinus Cardinal Functions">
</head>
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="hypot.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../powers.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../sinc.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_powers_ct_pow">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.powers.ct_pow"></a><a class="link" href="ct_pow.html" title="Compile Time Power of a Runtime Base">Compile Time Power
of a Runtime Base</a>
@@ -249,9 +249,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/expm1.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/expm1.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/expm1.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -5,7 +5,7 @@
<link rel="stylesheet" href="../../../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<link rel="home" href="../../../index.html" title="Math Toolkit">
-<link rel="up" href="../powers.html" title="Logs, Powers, Roots and Exponentials">
+<link rel="up" href="../powers.html" title="Basic Functions">
<link rel="prev" href="log1p.html" title="log1p">
<link rel="next" href="cbrt.html" title="cbrt">
</head>
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="log1p.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../powers.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="cbrt.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_powers_expm1">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.powers.expm1"></a><a class="link" href="expm1.html" title="expm1">expm1</a>
</h4></div></div></div>
@@ -92,9 +92,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/hypot.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/hypot.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/hypot.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -5,7 +5,7 @@
<link rel="stylesheet" href="../../../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<link rel="home" href="../../../index.html" title="Math Toolkit">
-<link rel="up" href="../powers.html" title="Logs, Powers, Roots and Exponentials">
+<link rel="up" href="../powers.html" title="Basic Functions">
<link rel="prev" href="powm1.html" title="powm1">
<link rel="next" href="ct_pow.html" title="Compile Time Power of a Runtime Base">
</head>
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="powm1.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../powers.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="ct_pow.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_powers_hypot">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.powers.hypot"></a><a class="link" href="hypot.html" title="hypot">hypot</a>
</h4></div></div></div>
@@ -73,9 +73,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/log1p.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/log1p.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/log1p.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -5,8 +5,8 @@
<link rel="stylesheet" href="../../../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<link rel="home" href="../../../index.html" title="Math Toolkit">
-<link rel="up" href="../powers.html" title="Logs, Powers, Roots and Exponentials">
-<link rel="prev" href="../powers.html" title="Logs, Powers, Roots and Exponentials">
+<link rel="up" href="../powers.html" title="Basic Functions">
+<link rel="prev" href="cos_pi.html" title="cos_pi">
<link rel="next" href="expm1.html" title="expm1">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
@@ -20,9 +20,9 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="../powers.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../powers.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="expm1.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="cos_pi.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../powers.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="expm1.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_powers_log1p">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.powers.log1p"></a><a class="link" href="log1p.html" title="log1p">log1p</a>
</h4></div></div></div>
@@ -105,9 +105,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
@@ -115,7 +115,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="../powers.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../powers.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="expm1.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="cos_pi.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../powers.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="expm1.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/powm1.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/powm1.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/powm1.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -5,7 +5,7 @@
<link rel="stylesheet" href="../../../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<link rel="home" href="../../../index.html" title="Math Toolkit">
-<link rel="up" href="../powers.html" title="Logs, Powers, Roots and Exponentials">
+<link rel="up" href="../powers.html" title="Basic Functions">
<link rel="prev" href="sqrt1pm1.html" title="sqrt1pm1">
<link rel="next" href="hypot.html" title="hypot">
</head>
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="sqrt1pm1.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../powers.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="hypot.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_powers_powm1">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.powers.powm1"></a><a class="link" href="powm1.html" title="powm1">powm1</a>
</h4></div></div></div>
@@ -85,9 +85,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/sqrt1pm1.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/sqrt1pm1.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/sqrt1pm1.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -5,7 +5,7 @@
<link rel="stylesheet" href="../../../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<link rel="home" href="../../../index.html" title="Math Toolkit">
-<link rel="up" href="../powers.html" title="Logs, Powers, Roots and Exponentials">
+<link rel="up" href="../powers.html" title="Basic Functions">
<link rel="prev" href="cbrt.html" title="cbrt">
<link rel="next" href="powm1.html" title="powm1">
</head>
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="cbrt.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../powers.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="powm1.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_powers_sqrt1pm1">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.powers.sqrt1pm1"></a><a class="link" href="sqrt1pm1.html" title="sqrt1pm1">sqrt1pm1</a>
</h4></div></div></div>
@@ -88,9 +88,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="factorials/sf_binomial.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../special.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="sf_beta/beta_function.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_sf_beta">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.special.sf_beta"></a><a class="link" href="sf_beta.html" title="Beta Functions">Beta Functions</a>
</h3></div></div></div>
@@ -38,9 +38,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta/beta_derivative.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta/beta_derivative.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta/beta_derivative.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="ibeta_inv_function.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../sf_beta.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../sf_erf.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_sf_beta_beta_derivative">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.sf_beta.beta_derivative"></a><a class="link" href="beta_derivative.html" title="Derivative of the Incomplete Beta Function">Derivative
of the Incomplete Beta Function</a>
@@ -88,9 +88,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta/beta_function.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta/beta_function.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta/beta_function.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="../sf_beta.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../sf_beta.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="ibeta_function.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_sf_beta_beta_function">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.sf_beta.beta_function"></a><a class="link" href="beta_function.html" title="Beta">Beta</a>
</h4></div></div></div>
@@ -313,9 +313,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta/ibeta_function.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta/ibeta_function.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta/ibeta_function.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="beta_function.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../sf_beta.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="ibeta_inv_function.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_sf_beta_ibeta_function">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.sf_beta.ibeta_function"></a><a class="link" href="ibeta_function.html" title="Incomplete Beta Functions">Incomplete
Beta Functions</a>
@@ -966,9 +966,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta/ibeta_inv_function.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta/ibeta_inv_function.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta/ibeta_inv_function.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="ibeta_function.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../sf_beta.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="beta_derivative.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_sf_beta_ibeta_inv_function">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.sf_beta.ibeta_inv_function"></a><a class="link" href="ibeta_inv_function.html" title="The Incomplete Beta Function Inverses">The
Incomplete Beta Function Inverses</a>
@@ -518,9 +518,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_erf.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_erf.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_erf.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="sf_beta/beta_derivative.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../special.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="sf_erf/error_function.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_sf_erf">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.special.sf_erf"></a><a class="link" href="sf_erf.html" title="Error Functions">Error Functions</a>
</h3></div></div></div>
@@ -34,9 +34,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_erf/error_function.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_erf/error_function.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_erf/error_function.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="../sf_erf.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../sf_erf.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="error_inv.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_sf_erf_error_function">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.sf_erf.error_function"></a><a class="link" href="error_function.html" title="Error Functions">Error Functions</a>
</h4></div></div></div>
@@ -616,9 +616,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_erf/error_inv.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_erf/error_inv.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_erf/error_inv.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="error_function.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../sf_erf.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../sf_poly.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_sf_erf_error_inv">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.sf_erf.error_inv"></a><a class="link" href="error_inv.html" title="Error Function Inverses">Error Function
Inverses</a>
@@ -190,9 +190,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="../special.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../special.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="sf_gamma/tgamma.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_sf_gamma">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.special.sf_gamma"></a><a class="link" href="sf_gamma.html" title="Gamma Functions">Gamma Functions</a>
</h3></div></div></div>
@@ -42,9 +42,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/digamma.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/digamma.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/digamma.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="lgamma.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../sf_gamma.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="gamma_ratios.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_sf_gamma_digamma">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.sf_gamma.digamma"></a><a class="link" href="digamma.html" title="Digamma">Digamma</a>
</h4></div></div></div>
@@ -373,9 +373,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/gamma_derivatives.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/gamma_derivatives.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/gamma_derivatives.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="igamma_inv.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../sf_gamma.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../factorials.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_sf_gamma_gamma_derivatives">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.sf_gamma.gamma_derivatives"></a><a class="link" href="gamma_derivatives.html" title="Derivative of the Incomplete Gamma Function">Derivative
of the Incomplete Gamma Function</a>
@@ -93,9 +93,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/gamma_ratios.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/gamma_ratios.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/gamma_ratios.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="digamma.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../sf_gamma.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="igamma.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_sf_gamma_gamma_ratios">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.sf_gamma.gamma_ratios"></a><a class="link" href="gamma_ratios.html" title="Ratios of Gamma Functions">Ratios
of Gamma Functions</a>
@@ -342,9 +342,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/igamma.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/igamma.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/igamma.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="gamma_ratios.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../sf_gamma.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="igamma_inv.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_sf_gamma_igamma">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.sf_gamma.igamma"></a><a class="link" href="igamma.html" title="Incomplete Gamma Functions">Incomplete Gamma
Functions</a>
@@ -1034,9 +1034,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/igamma_inv.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/igamma_inv.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/igamma_inv.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="igamma.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../sf_gamma.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="gamma_derivatives.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_sf_gamma_igamma_inv">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.sf_gamma.igamma_inv"></a><a class="link" href="igamma_inv.html" title="Incomplete Gamma Function Inverses">Incomplete
Gamma Function Inverses</a>
@@ -244,9 +244,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/lgamma.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/lgamma.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/lgamma.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="tgamma.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../sf_gamma.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="digamma.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_sf_gamma_lgamma">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.sf_gamma.lgamma"></a><a class="link" href="lgamma.html" title="Log Gamma">Log Gamma</a>
</h4></div></div></div>
@@ -466,9 +466,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/tgamma.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/tgamma.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/tgamma.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="../sf_gamma.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../sf_gamma.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="lgamma.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_sf_gamma_tgamma">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.sf_gamma.tgamma"></a><a class="link" href="tgamma.html" title="Gamma">Gamma</a>
</h4></div></div></div>
@@ -453,9 +453,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="sf_erf/error_inv.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../special.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="sf_poly/legendre.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_sf_poly">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.special.sf_poly"></a><a class="link" href="sf_poly.html" title="Polynomials">Polynomials</a>
</h3></div></div></div>
@@ -37,9 +37,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly/hermite.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly/hermite.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly/hermite.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="laguerre.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../sf_poly.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="sph_harm.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_sf_poly_hermite">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.sf_poly.hermite"></a><a class="link" href="hermite.html" title="Hermite Polynomials">Hermite Polynomials</a>
</h4></div></div></div>
@@ -268,9 +268,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly/laguerre.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly/laguerre.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly/laguerre.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="legendre.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../sf_poly.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="hermite.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_sf_poly_laguerre">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.sf_poly.laguerre"></a><a class="link" href="laguerre.html" title="Laguerre (and Associated) Polynomials">Laguerre (and
Associated) Polynomials</a>
@@ -442,9 +442,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly/legendre.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly/legendre.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly/legendre.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="../sf_poly.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../sf_poly.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="laguerre.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_sf_poly_legendre">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.sf_poly.legendre"></a><a class="link" href="legendre.html" title="Legendre (and Associated) Polynomials">Legendre (and
Associated) Polynomials</a>
@@ -696,9 +696,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly/sph_harm.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly/sph_harm.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly/sph_harm.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="hermite.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../sf_poly.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../bessel.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_sf_poly_sph_harm">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.sf_poly.sph_harm"></a><a class="link" href="sph_harm.html" title="Spherical Harmonics">Spherical Harmonics</a>
</h4></div></div></div>
@@ -32,7 +32,7 @@
</h5>
<p>
</p>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">special_functions</span><span class="special">/</span><span class="identifier">spheric_harmonic</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
+<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">special_functions</span><span class="special">/</span><span class="identifier">spherical_harmonic</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
</pre>
<p>
</p>
@@ -295,9 +295,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sinc.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sinc.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sinc.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="powers/ct_pow.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../special.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="sinc/sinc_overview.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_sinc">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.special.sinc"></a><a class="link" href="sinc.html" title="Sinus Cardinal and Hyperbolic Sinus Cardinal Functions">Sinus Cardinal and Hyperbolic
Sinus Cardinal Functions</a>
@@ -36,9 +36,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sinc/sinc_overview.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sinc/sinc_overview.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sinc/sinc_overview.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="../sinc.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../sinc.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="sinc_pi.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_sinc_sinc_overview">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.sinc.sinc_overview"></a><a class="link" href="sinc_overview.html" title="Sinus Cardinal and Hyperbolic Sinus Cardinal Functions Overview">Sinus Cardinal
and Hyperbolic Sinus Cardinal Functions Overview</a>
@@ -66,9 +66,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sinc/sinc_pi.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sinc/sinc_pi.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sinc/sinc_pi.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="sinc_overview.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../sinc.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="sinhc_pi.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_sinc_sinc_pi">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.sinc.sinc_pi"></a><a class="link" href="sinc_pi.html" title="sinc_pi">sinc_pi</a>
</h4></div></div></div>
@@ -65,9 +65,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sinc/sinhc_pi.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sinc/sinhc_pi.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sinc/sinhc_pi.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="sinc_pi.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../sinc.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../inv_hyper.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_sinc_sinhc_pi">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.sinc.sinhc_pi"></a><a class="link" href="sinhc_pi.html" title="sinhc_pi">sinhc_pi</a>
</h4></div></div></div>
@@ -69,9 +69,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/zetas.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/zetas.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/zetas.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="jacobi/jacobi_sn.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../special.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="zetas/zeta.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_zetas">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.special.zetas"></a><a class="link" href="zetas.html" title="Zeta Functions">Zeta Functions</a>
</h3></div></div></div>
@@ -30,9 +30,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/zetas/zeta.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/zetas/zeta.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/zetas/zeta.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="../zetas.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../zetas.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../expint.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_special_zetas_zeta">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.special.zetas.zeta"></a><a class="link" href="zeta.html" title="Riemann Zeta Function">Riemann Zeta Function</a>
</h4></div></div></div>
@@ -298,9 +298,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/status.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/status.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/status.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="backgrounders/refs.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="status/history1.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_status">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="math_toolkit.status"></a><a class="link" href="status.html" title="Library Status">Library Status</a>
</h2></div></div></div>
@@ -34,9 +34,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/status/credits.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/status/credits.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/status/credits.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="issues.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../status.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../index/s13.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_status_credits">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.status.credits"></a><a class="link" href="credits.html" title="Credits and Acknowledgements">Credits and Acknowledgements</a>
</h3></div></div></div>
@@ -115,7 +115,7 @@
</p>
<p>
Thanks to Mark Coleman and Georgi Boshnakov for spot test values from Wolfram Mathematica,
- and of course, to Eric Weissten for nurturing <a href="http://mathworld.wolfram.com" target="_top">Wolfram
+ and of course, to Eric Weisstein for nurturing <a href="http://mathworld.wolfram.com" target="_top">Wolfram
MathWorld</a>, an invaluable resource.
</p>
<p>
@@ -127,12 +127,25 @@
degrees of freedom and contributing to some long discussions about how to
improve accuracy for large non-centrality and/or large degrees of freedom.
</p>
+<p>
+ Christopher Kormanyos wrote the e_float multiprecision library <a href="http://portal.acm.org/citation.cfm?id=1916469" target="_top">TOMS
+ Algorithm 910: A Portable C++ Multiple-Precision System for Special-Function
+ Calculations</a> which formed the basis for the Boost.Multiprecision
+ library which now can be used to allow most functions and distributions to
+ be computed up to a precision of the users' choice, no longer restricted
+ to built-in floating-point types like double. (And thanks to Topher Cooper
+ for bring Christopher's e_float to our attention).
+ </p>
+<p>
+ Christopher Kormanyos wrote some examples for using Boost.Multiprecision,
+ and added methods for finding zeros of Bessel Functions.
+ </p>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/status/history1.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/status/history1.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/status/history1.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="../status.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../status.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="issues.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_status_history1">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.status.history1"></a><a class="link" href="history1.html" title="History and What's New">History and What's New</a>
</h3></div></div></div>
@@ -34,6 +34,56 @@
</p>
<h5>
<a name="math_toolkit.status.history1.h0"></a>
+ <span class="phrase"><a name="math_toolkit.status.history1.boost_1_54"></a></span><a class="link" href="history1.html#math_toolkit.status.history1.boost_1_54">Boost-1.54</a>
+ </h5>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem">
+ Added many references to Boost.Multiprecision and <code class="computeroutput"><span class="identifier">cpp_dec_float_50</span></code>
+ as an example of a User-defined Type (UDT).
+ </li>
+<li class="listitem">
+ Added Clang to list of supported compilers.
+ </li>
+<li class="listitem">
+ Fixed constants to use a thread-safe cache of computed values when used
+ at arbitrary precision.
+ </li>
+<li class="listitem">
+ Added finding zeros of Bessel functions <code class="computeroutput"><span class="identifier">cyl_bessel_j_zero</span></code>,
+ <code class="computeroutput"><span class="identifier">cyl_neumann_zero</span></code>, <code class="computeroutput"><span class="identifier">air_ai_zeros</span></code> and <code class="computeroutput"><span class="identifier">air_bi_zeros</span></code>(by
+ Christopher Kormanyos).
+ </li>
+<li class="listitem">
+ More accuracy improvements to the Bessel J and Y functions from Rocco
+ Romeo.
+ </li>
+<li class="listitem">
+ Fixed nasty cyclic dependency bug that caused some headers to not compile
+ #7999.
+ </li>
+<li class="listitem">
+ Fixed bug in <a class="link" href="../special/sf_gamma/tgamma.html" title="Gamma">tgamma</a>
+ that caused spurious overflow for arguments between 142.5 and 143.
+ </li>
+<li class="listitem">
+ Fixed bug in raise_rounding_error that caused it to return an incorrect
+ result when throwing an exception is turned off #7905.
+ </li>
+<li class="listitem">
+ Added minimal __float128 support.
+ </li>
+<li class="listitem">
+ Fixed bug in edge-cases of poisson quantile #8308.
+ </li>
+<li class="listitem">
+ Adjusted heuristics used in Halley iteration to cope with inverting the
+ incomplete beta in tricky regions where the derivative is flatlining.
+ Example is computing the quantile of the Fisher F distribution for probabilities
+ smaller than machine epsilon. See ticket #8314.
+ </li>
+</ul></div>
+<h5>
+<a name="math_toolkit.status.history1.h1"></a>
<span class="phrase"><a name="math_toolkit.status.history1.boost_1_53"></a></span><a class="link" href="history1.html#math_toolkit.status.history1.boost_1_53">Boost-1.53</a>
</h5>
<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
@@ -62,9 +112,13 @@
and <a class="link" href="../special/sf_gamma/igamma.html" title="Incomplete Gamma Functions">gamma_p</a>/<a class="link" href="../special/sf_gamma/igamma.html" title="Incomplete Gamma Functions">gamma_q</a> thanks
to suggestions from Rocco Romeo.
</li>
+<li class="listitem">
+ Improve accuracy of Bessel J and Y for integer orders thanks to suggestions
+ from Rocco Romeo.
+ </li>
</ul></div>
<h5>
-<a name="math_toolkit.status.history1.h1"></a>
+<a name="math_toolkit.status.history1.h2"></a>
<span class="phrase"><a name="math_toolkit.status.history1.boost_1_52"></a></span><a class="link" href="history1.html#math_toolkit.status.history1.boost_1_52">Boost-1.52</a>
</h5>
<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
@@ -113,14 +167,14 @@
</li>
</ul></div>
<h5>
-<a name="math_toolkit.status.history1.h2"></a>
+<a name="math_toolkit.status.history1.h3"></a>
<span class="phrase"><a name="math_toolkit.status.history1.boost_1_51"></a></span><a class="link" href="history1.html#math_toolkit.status.history1.boost_1_51">Boost-1.51</a>
</h5>
<p>
See Boost-1.52 - some items were added but not listed in time for the release.
</p>
<h5>
-<a name="math_toolkit.status.history1.h3"></a>
+<a name="math_toolkit.status.history1.h4"></a>
<span class="phrase"><a name="math_toolkit.status.history1.boost_1_50"></a></span><a class="link" href="history1.html#math_toolkit.status.history1.boost_1_50">Boost-1.50</a>
</h5>
<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
@@ -159,7 +213,7 @@
</li>
</ul></div>
<h5>
-<a name="math_toolkit.status.history1.h4"></a>
+<a name="math_toolkit.status.history1.h5"></a>
<span class="phrase"><a name="math_toolkit.status.history1.boost_1_49"></a></span><a class="link" href="history1.html#math_toolkit.status.history1.boost_1_49">Boost-1.49</a>
</h5>
<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
@@ -203,7 +257,7 @@
</li>
</ul></div>
<h5>
-<a name="math_toolkit.status.history1.h5"></a>
+<a name="math_toolkit.status.history1.h6"></a>
<span class="phrase"><a name="math_toolkit.status.history1.boost_1_48"></a></span><a class="link" href="history1.html#math_toolkit.status.history1.boost_1_48">Boost-1.48</a>
</h5>
<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
@@ -254,7 +308,7 @@
</li>
</ul></div>
<h5>
-<a name="math_toolkit.status.history1.h6"></a>
+<a name="math_toolkit.status.history1.h7"></a>
<span class="phrase"><a name="math_toolkit.status.history1.boost_1_47"></a></span><a class="link" href="history1.html#math_toolkit.status.history1.boost_1_47">Boost-1.47</a>
</h5>
<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
@@ -271,7 +325,7 @@
</li>
</ul></div>
<h5>
-<a name="math_toolkit.status.history1.h7"></a>
+<a name="math_toolkit.status.history1.h8"></a>
<span class="phrase"><a name="math_toolkit.status.history1.boost_1_46_1"></a></span><a class="link" href="history1.html#math_toolkit.status.history1.boost_1_46_1">Boost-1.46.1</a>
</h5>
<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "><li class="listitem">
@@ -279,7 +333,7 @@
<a href="https://svn.boost.org/trac/boost/ticket/5095" target="_top">#5113</a>.
</li></ul></div>
<h5>
-<a name="math_toolkit.status.history1.h8"></a>
+<a name="math_toolkit.status.history1.h9"></a>
<span class="phrase"><a name="math_toolkit.status.history1.boost_1_46_0"></a></span><a class="link" href="history1.html#math_toolkit.status.history1.boost_1_46_0">Boost-1.46.0</a>
</h5>
<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
@@ -294,7 +348,7 @@
</li>
</ul></div>
<h5>
-<a name="math_toolkit.status.history1.h9"></a>
+<a name="math_toolkit.status.history1.h10"></a>
<span class="phrase"><a name="math_toolkit.status.history1.boost_1_45_0"></a></span><a class="link" href="history1.html#math_toolkit.status.history1.boost_1_45_0">Boost-1.45.0</a>
</h5>
<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
@@ -311,7 +365,7 @@
</li>
</ul></div>
<h5>
-<a name="math_toolkit.status.history1.h10"></a>
+<a name="math_toolkit.status.history1.h11"></a>
<span class="phrase"><a name="math_toolkit.status.history1.boost_1_44_0"></a></span><a class="link" href="history1.html#math_toolkit.status.history1.boost_1_44_0">Boost-1.44.0</a>
</h5>
<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
@@ -325,7 +379,7 @@
</li>
</ul></div>
<h5>
-<a name="math_toolkit.status.history1.h11"></a>
+<a name="math_toolkit.status.history1.h12"></a>
<span class="phrase"><a name="math_toolkit.status.history1.boost_1_41_0"></a></span><a class="link" href="history1.html#math_toolkit.status.history1.boost_1_41_0">Boost-1.41.0</a>
</h5>
<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "><li class="listitem">
@@ -333,7 +387,7 @@
and its inverse.
</li></ul></div>
<h5>
-<a name="math_toolkit.status.history1.h12"></a>
+<a name="math_toolkit.status.history1.h13"></a>
<span class="phrase"><a name="math_toolkit.status.history1.boost_1_40_0"></a></span><a class="link" href="history1.html#math_toolkit.status.history1.boost_1_40_0">Boost-1.40.0</a>
</h5>
<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
@@ -370,7 +424,7 @@
</li>
</ul></div>
<h5>
-<a name="math_toolkit.status.history1.h13"></a>
+<a name="math_toolkit.status.history1.h14"></a>
<span class="phrase"><a name="math_toolkit.status.history1.boost_1_38_0"></a></span><a class="link" href="history1.html#math_toolkit.status.history1.boost_1_38_0">Boost-1.38.0</a>
</h5>
<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
@@ -382,14 +436,14 @@
</li>
</ul></div>
<h5>
-<a name="math_toolkit.status.history1.h14"></a>
+<a name="math_toolkit.status.history1.h15"></a>
<span class="phrase"><a name="math_toolkit.status.history1.boost_1_37_0"></a></span><a class="link" href="history1.html#math_toolkit.status.history1.boost_1_37_0">Boost-1.37.0</a>
</h5>
<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "><li class="listitem">
Improved accuracy and testing of the inverse hypergeometric functions.
</li></ul></div>
<h5>
-<a name="math_toolkit.status.history1.h15"></a>
+<a name="math_toolkit.status.history1.h16"></a>
<span class="phrase"><a name="math_toolkit.status.history1.boost_1_36_0"></a></span><a class="link" href="history1.html#math_toolkit.status.history1.boost_1_36_0">Boost-1.36.0</a>
</h5>
<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
@@ -422,7 +476,7 @@
</li>
</ul></div>
<h5>
-<a name="math_toolkit.status.history1.h16"></a>
+<a name="math_toolkit.status.history1.h17"></a>
<span class="phrase"><a name="math_toolkit.status.history1.boost_1_35_0__post_review_first_official_release"></a></span><a class="link" href="history1.html#math_toolkit.status.history1.boost_1_35_0__post_review_first_official_release">Boost-1.35.0:
Post Review First Official Release</a>
</h5>
@@ -454,7 +508,7 @@
</li>
</ul></div>
<h5>
-<a name="math_toolkit.status.history1.h17"></a>
+<a name="math_toolkit.status.history1.h18"></a>
<span class="phrase"><a name="math_toolkit.status.history1.milestone_4__second_review_candidate__1st_march_2007_"></a></span><a class="link" href="history1.html#math_toolkit.status.history1.milestone_4__second_review_candidate__1st_march_2007_">Milestone
4: Second Review Candidate (1st March 2007)</a>
</h5>
@@ -468,7 +522,7 @@
</li>
</ul></div>
<h5>
-<a name="math_toolkit.status.history1.h18"></a>
+<a name="math_toolkit.status.history1.h19"></a>
<span class="phrase"><a name="math_toolkit.status.history1.milestone_3__first_review_candidate__31st_dec_2006_"></a></span><a class="link" href="history1.html#math_toolkit.status.history1.milestone_3__first_review_candidate__31st_dec_2006_">Milestone
3: First Review Candidate (31st Dec 2006)</a>
</h5>
@@ -496,7 +550,7 @@
</li>
</ul></div>
<h5>
-<a name="math_toolkit.status.history1.h19"></a>
+<a name="math_toolkit.status.history1.h20"></a>
<span class="phrase"><a name="math_toolkit.status.history1.milestone_2__released_september_10th_2006"></a></span><a class="link" href="history1.html#math_toolkit.status.history1.milestone_2__released_september_10th_2006">Milestone
2: Released September 10th 2006</a>
</h5>
@@ -532,7 +586,7 @@
</li>
</ul></div>
<h5>
-<a name="math_toolkit.status.history1.h20"></a>
+<a name="math_toolkit.status.history1.h21"></a>
<span class="phrase"><a name="math_toolkit.status.history1.milestone_1__released_march_31st_2006"></a></span><a class="link" href="history1.html#math_toolkit.status.history1.milestone_1__released_march_31st_2006">Milestone
1: Released March 31st 2006</a>
</h5>
@@ -566,9 +620,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/status/issues.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/status/issues.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/status/issues.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="history1.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../status.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="credits.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_status_issues">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.status.issues"></a><a class="link" href="issues.html" title="Known Issues, and TODO List">Known Issues, and TODO List</a>
</h3></div></div></div>
@@ -41,6 +41,21 @@
</p>
<h5>
<a name="math_toolkit.status.issues.h0"></a>
+ <span class="phrase"><a name="math_toolkit.status.issues.derivatives_of_bessel_functions__and_their_zeros_"></a></span><a class="link" href="issues.html#math_toolkit.status.issues.derivatives_of_bessel_functions__and_their_zeros_">Derivatives
+ of Bessel functions (and their zeros)</a>
+ </h5>
+<p>
+ Potentially, there could be native support for <code class="computeroutput"><span class="identifier">cyl_bessel_j_prime</span><span class="special">()</span></code> and <code class="computeroutput"><span class="identifier">cyl_neumann_prime</span><span class="special">()</span></code>. One could also imagine supporting the
+ zeros thereof, but they might be slower to calculate since root bracketing
+ might be needed instead of Newton iteration (for the lack of 2nd derivatives).
+ </p>
+<p>
+ Since Boost.Math's Bessel functions are so excellent, the quick way to <code class="computeroutput"><span class="identifier">cyl_bessel_j_prime</span><span class="special">()</span></code>
+ and <code class="computeroutput"><span class="identifier">cyl_neumann_prime</span><span class="special">()</span></code>
+ would be via relationship with <code class="computeroutput"><span class="identifier">cyl_bessel_j</span><span class="special">()</span></code> and <code class="computeroutput"><span class="identifier">cyl_neumann</span><span class="special">()</span></code>.
+ </p>
+<h5>
+<a name="math_toolkit.status.issues.h1"></a>
<span class="phrase"><a name="math_toolkit.status.issues.tgamma"></a></span><a class="link" href="issues.html#math_toolkit.status.issues.tgamma">tgamma</a>
</h5>
<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "><li class="listitem">
@@ -48,7 +63,7 @@
be optimized any further? (low priority)
</li></ul></div>
<h5>
-<a name="math_toolkit.status.issues.h1"></a>
+<a name="math_toolkit.status.issues.h2"></a>
<span class="phrase"><a name="math_toolkit.status.issues.incomplete_beta"></a></span><a class="link" href="issues.html#math_toolkit.status.issues.incomplete_beta">Incomplete
Beta</a>
</h5>
@@ -57,7 +72,7 @@
b (medium priority).
</li></ul></div>
<h5>
-<a name="math_toolkit.status.issues.h2"></a>
+<a name="math_toolkit.status.issues.h3"></a>
<span class="phrase"><a name="math_toolkit.status.issues.inverse_gamma"></a></span><a class="link" href="issues.html#math_toolkit.status.issues.inverse_gamma">Inverse
Gamma</a>
</h5>
@@ -66,7 +81,7 @@
is good enough (Medium Priority).
</li></ul></div>
<h5>
-<a name="math_toolkit.status.issues.h3"></a>
+<a name="math_toolkit.status.issues.h4"></a>
<span class="phrase"><a name="math_toolkit.status.issues.polynomials"></a></span><a class="link" href="issues.html#math_toolkit.status.issues.polynomials">Polynomials</a>
</h5>
<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "><li class="listitem">
@@ -76,7 +91,7 @@
not (Low Priority).
</li></ul></div>
<h5>
-<a name="math_toolkit.status.issues.h4"></a>
+<a name="math_toolkit.status.issues.h5"></a>
<span class="phrase"><a name="math_toolkit.status.issues.elliptic_integrals"></a></span><a class="link" href="issues.html#math_toolkit.status.issues.elliptic_integrals">Elliptic
Integrals</a>
</h5>
@@ -129,7 +144,7 @@
</li>
</ul></div>
<h5>
-<a name="math_toolkit.status.issues.h5"></a>
+<a name="math_toolkit.status.issues.h6"></a>
<span class="phrase"><a name="math_toolkit.status.issues.owen_s_t_function"></a></span><a class="link" href="issues.html#math_toolkit.status.issues.owen_s_t_function">Owen's
T Function</a>
</h5>
@@ -145,7 +160,7 @@
but it remains elusive at present.
</p>
<h5>
-<a name="math_toolkit.status.issues.h6"></a>
+<a name="math_toolkit.status.issues.h7"></a>
<span class="phrase"><a name="math_toolkit.status.issues.jocobi_elliptic_functions"></a></span><a class="link" href="issues.html#math_toolkit.status.issues.jocobi_elliptic_functions">Jocobi elliptic
functions</a>
</h5>
@@ -154,7 +169,7 @@
these.
</p>
<h5>
-<a name="math_toolkit.status.issues.h7"></a>
+<a name="math_toolkit.status.issues.h8"></a>
<span class="phrase"><a name="math_toolkit.status.issues.statistical_distributions"></a></span><a class="link" href="issues.html#math_toolkit.status.issues.statistical_distributions">Statistical
distributions</a>
</h5>
@@ -163,7 +178,7 @@
for very large degrees of freedom?
</li></ul></div>
<h5>
-<a name="math_toolkit.status.issues.h8"></a>
+<a name="math_toolkit.status.issues.h9"></a>
<span class="phrase"><a name="math_toolkit.status.issues.feature_requests"></a></span><a class="link" href="issues.html#math_toolkit.status.issues.feature_requests">Feature
Requests</a>
</h5>
@@ -1229,9 +1244,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="constants/FAQ.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="toolkit/internals_overview.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_toolkit">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="math_toolkit.toolkit"></a><a class="link" href="toolkit.html" title="Tools and Internal Details">Tools and Internal Details</a>
</h2></div></div></div>
@@ -58,9 +58,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="internals_overview.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../toolkit.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="internals1/series_evaluation.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_toolkit_internals1">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.toolkit.internals1"></a><a class="link" href="internals1.html" title="Utilities & Tools">Utilities & Tools</a>
</h3></div></div></div>
@@ -44,9 +44,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/cf.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/cf.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/cf.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="series_evaluation.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../internals1.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="rational.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_toolkit_internals1_cf">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.toolkit.internals1.cf"></a><a class="link" href="cf.html" title="Continued Fraction Evaluation">Continued Fraction
Evaluation</a>
@@ -270,9 +270,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/minima.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/minima.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/minima.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="roots2.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../internals1.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="tuples.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_toolkit_internals1_minima">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.toolkit.internals1.minima"></a><a class="link" href="minima.html" title="Locating Function Minima: Brent's algorithm">Locating Function
Minima: Brent's algorithm</a>
@@ -112,9 +112,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/rational.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/rational.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/rational.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="cf.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../internals1.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="roots.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_toolkit_internals1_rational">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.toolkit.internals1.rational"></a><a class="link" href="rational.html" title="Polynomial and Rational Function Evaluation">Polynomial
and Rational Function Evaluation</a>
@@ -221,9 +221,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/roots.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/roots.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/roots.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="rational.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../internals1.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="roots2.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_toolkit_internals1_roots">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.toolkit.internals1.roots"></a><a class="link" href="roots.html" title="Root Finding With Derivatives: Newton-Raphson, Halley & Schroeder">Root Finding
With Derivatives: Newton-Raphson, Halley & Schroeder</a>
@@ -69,8 +69,8 @@
</p>
<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
- <code class="computeroutput"><span class="identifier">newton_raphson_iterate</span></code>performs
- second order <a class="link" href="roots.html#newton">Newton-Raphson iteration</a>,
+ <code class="computeroutput"><span class="identifier">newton_raphson_iterate</span></code>
+ performs second order <a class="link" href="roots.html#newton">Newton-Raphson iteration</a>,
</li>
<li class="listitem">
<code class="computeroutput"><span class="identifier">halley_iterate</span></code> and<code class="computeroutput"><span class="identifier">schroeder_iterate</span></code> perform third order
@@ -321,13 +321,13 @@
<span class="special">}</span>
</pre>
<p>
- Using the test data in libs/math/test/cbrt_test.cpp this found the cube
- root exact to the last digit in every case, and in no more than 6 iterations
- at double precision. However, you will note that a high precision was used
- in this example, exactly what was warned against earlier on in these docs!
- In this particular case it is possible to compute f(x) exactly and without
- undue cancellation error, so a high limit is not too much of an issue.
- However, reducing the limit to <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">numeric_limits</span><span class="special"><</span><span class="identifier">T</span><span class="special">>::</span><span class="identifier">digits</span>
+ Using the test data in <code class="computeroutput"><span class="identifier">libs</span><span class="special">/</span><span class="identifier">math</span><span class="special">/</span><span class="identifier">test</span><span class="special">/</span><span class="identifier">cbrt_test</span><span class="special">.</span><span class="identifier">cpp</span></code>
+ this found the cube root exact to the last digit in every case, and in
+ no more than 6 iterations at double precision. However, you will note that
+ a high precision was used in this example, exactly what was warned against
+ earlier on in these docs! In this particular case it is possible to compute
+ f(x) exactly and without undue cancellation error, so a high limit is not
+ too much of an issue. However, reducing the limit to <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">numeric_limits</span><span class="special"><</span><span class="identifier">T</span><span class="special">>::</span><span class="identifier">digits</span>
<span class="special">*</span> <span class="number">2</span> <span class="special">/</span> <span class="number">3</span></code> gave
full precision in all but one of the test cases (and that one was out by
just one bit). The maximum number of iterations remained 6, but in most
@@ -339,7 +339,8 @@
of z correctly. (These are left as an exercise for the reader!)
</p>
<p>
- The boost::math::cbrt function also includes these and other improvements.
+ The <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">math</span><span class="special">::</span><span class="identifier">cbrt</span></code> function also includes these and
+ other improvements.
</p>
<p>
Now let's adapt the functor slightly to return the second derivative as
@@ -394,13 +395,13 @@
and see".
</p>
<p>
- Finally, had we called cbrt with NTL::RR
- set to 1000 bit precision, then full precision can be obtained with just
- 7 iterations. To put that in perspective, an increase in precision by a
- factor of 20, has less than doubled the number of iterations. That just
- goes to emphasise that most of the iterations are used up getting the first
- few digits correct: after that these methods can churn out further digits
- with remarkable efficiency.
+ Finally, had we called <code class="computeroutput"><span class="identifier">cbrt</span></code>
+ with NTL::RR set to
+ 1000 bit precision, then full precision can be obtained with just 7 iterations.
+ To put that in perspective, an increase in precision by a factor of 20,
+ has less than doubled the number of iterations. That just goes to emphasise
+ that most of the iterations are used up getting the first few digits correct:
+ after that these methods can churn out further digits with remarkable efficiency.
</p>
<p>
Or to put it another way: <span class="emphasis"><em>nothing beats a really good initial
@@ -409,9 +410,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/roots2.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/roots2.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/roots2.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="roots.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../internals1.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="minima.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_toolkit_internals1_roots2">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.toolkit.internals1.roots2"></a><a class="link" href="roots2.html" title="Root Finding Without Derivatives: Bisection, Bracket and TOMS748">Root Finding
Without Derivatives: Bisection, Bracket and TOMS748</a>
@@ -573,9 +573,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/series_evaluation.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/series_evaluation.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/series_evaluation.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="../internals1.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../internals1.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="cf.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_toolkit_internals1_series_evaluation">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.toolkit.internals1.series_evaluation"></a><a class="link" href="series_evaluation.html" title="Series Evaluation">Series
Evaluation</a>
@@ -185,9 +185,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/tuples.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/tuples.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/tuples.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="minima.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../internals1.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../internals2.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_toolkit_internals1_tuples">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.toolkit.internals1.tuples"></a><a class="link" href="tuples.html" title="Tuples">Tuples</a>
</h4></div></div></div>
@@ -71,9 +71,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="internals1/tuples.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../toolkit.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="internals2/polynomials.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_toolkit_internals2">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.toolkit.internals2"></a><a class="link" href="internals2.html" title="Testing and Development">Testing and Development</a>
</h3></div></div></div>
@@ -38,9 +38,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2/error_test.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2/error_test.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2/error_test.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="minimax.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../internals2.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="test_data.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_toolkit_internals2_error_test">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.toolkit.internals2.error_test"></a><a class="link" href="error_test.html" title="Relative Error and Testing">Relative
Error and Testing</a>
@@ -211,9 +211,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2/minimax.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2/minimax.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2/minimax.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="polynomials.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../internals2.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="error_test.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_toolkit_internals2_minimax">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.toolkit.internals2.minimax"></a><a class="link" href="minimax.html" title="Minimax Approximations and the Remez Algorithm">Minimax Approximations
and the Remez Algorithm</a>
@@ -77,7 +77,8 @@
approximate as a new variant after the existing examples.
</p>
<p>
- In addition to those two files, the program needs to be linked to a <a class="link" href="../../using_udt/use_ntl.html" title="Using With NTL - a High-Precision Floating-Point Library">patched NTL library to compile</a>.
+ In addition to those two files, the program needs to be linked to a <a class="link" href="../../using_udt/high_precision/use_ntl.html" title="Using NTL Library">patched NTL library
+ to compile</a>.
</p>
<p>
Note that the function <span class="emphasis"><em>f</em></span> must return the rational
@@ -270,9 +271,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2/polynomials.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2/polynomials.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2/polynomials.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="../internals2.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../internals2.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="minimax.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_toolkit_internals2_polynomials">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.toolkit.internals2.polynomials"></a><a class="link" href="polynomials.html" title="Polynomials">Polynomials</a>
</h4></div></div></div>
@@ -121,9 +121,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2/test_data.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2/test_data.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2/test_data.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="error_test.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../internals2.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../using_udt.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_toolkit_internals2_test_data">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.toolkit.internals2.test_data"></a><a class="link" href="test_data.html" title="Graphing, Profiling, and Generating Test Data for Special Functions">Graphing,
Profiling, and Generating Test Data for Special Functions</a>
@@ -534,9 +534,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals_overview.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals_overview.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals_overview.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="../toolkit.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../toolkit.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="internals1.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_toolkit_internals_overview">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.toolkit.internals_overview"></a><a class="link" href="internals_overview.html" title="Overview">Overview</a>
</h3></div></div></div>
@@ -43,9 +43,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -7,7 +7,7 @@
<link rel="home" href="../index.html" title="Math Toolkit">
<link rel="up" href="../index.html" title="Math Toolkit">
<link rel="prev" href="toolkit/internals2/test_data.html" title="Graphing, Profiling, and Generating Test Data for Special Functions">
-<link rel="next" href="using_udt/use_ntl.html" title="Using With NTL - a High-Precision Floating-Point Library">
+<link rel="next" href="using_udt/high_precision.html" title="Using Boost.Math with High-Precision Floating-Point Libraries">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
@@ -20,19 +20,32 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="toolkit/internals2/test_data.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="using_udt/use_ntl.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="toolkit/internals2/test_data.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="using_udt/high_precision.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_using_udt">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="math_toolkit.using_udt"></a><a class="link" href="using_udt.html" title="Use with User-Defined Floating-Point Types">Use with User-Defined Floating-Point
Types</a>
</h2></div></div></div>
<div class="toc"><dl>
-<dt><span class="section"><a href="using_udt/use_ntl.html">Using With NTL - a High-Precision
- Floating-Point Library</a></span></dt>
-<dt><span class="section"><a href="using_udt/use_mpfr.html">Using With MPFR / GMP
- - a High-Precision Floating-Point Library</a></span></dt>
-<dt><span class="section">e_float Support</span></dt>
+<dt><span class="section"><a href="using_udt/high_precision.html">Using Boost.Math
+ with High-Precision Floating-Point Libraries</a></span></dt>
+<dd><dl>
+<dt><span class="section"><a href="using_udt/high_precision/why_high_precision.html">Why
+ use a high-precision library rather than built-in floating-point types?</a></span></dt>
+<dt><span class="section"><a href="using_udt/high_precision/use_multiprecision.html">Using
+ Boost.Multiprecision</a></span></dt>
+<dt><span class="section"><a href="using_udt/high_precision/float128.html">Using
+ with GCC's __float128 datatype</a></span></dt>
+<dt><span class="section"><a href="using_udt/high_precision/use_mpfr.html">Using
+ With MPFR or GMP - High-Precision Floating-Point Library</a></span></dt>
+<dt><span class="section"><a href="using_udt/high_precision/e_float.html">Using
+ e_float Library</a></span></dt>
+<dt><span class="section"><a href="using_udt/high_precision/use_ntl.html">Using
+ NTL Library</a></span></dt>
+<dt><span class="section"><a href="using_udt/high_precision/using_test.html">Using
+ without expression templates for Boost.Test and others</a></span></dt>
+</dl></dd>
<dt><span class="section"><a href="using_udt/concepts.html">Conceptual Requirements
for Real Number Types</a></span></dt>
<dt><span class="section"><a href="using_udt/dist_concept.html">Conceptual Requirements
@@ -43,9 +56,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
@@ -53,7 +66,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="toolkit/internals2/test_data.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="using_udt/use_ntl.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="toolkit/internals2/test_data.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="using_udt/high_precision.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/archetypes.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/archetypes.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/archetypes.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="dist_concept.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../using_udt.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../policy.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_using_udt_archetypes">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.using_udt.archetypes"></a><a class="link" href="archetypes.html" title="Conceptual Archetypes for Reals and Distributions">Conceptual Archetypes
for Reals and Distributions</a>
@@ -119,8 +119,8 @@
</p>
<p>
NTL RR is an example of a type meeting the requirements that this type models,
- but note that use of a thin wrapper class is required: refer to <a class="link" href="use_ntl.html" title="Using With NTL - a High-Precision Floating-Point Library">"Using
- With NTL - a High-Precision Floating-Point Library"</a>.
+ but note that use of a thin wrapper class is required: refer to [linkmath_toolkit.using_udt.high_precision.use_ntl
+ "Using With NTL - a High-Precision Floating-Point Library"].
</p>
<p>
There is no specific test case for type <code class="computeroutput"><span class="identifier">real_concept</span></code>,
@@ -145,11 +145,11 @@
<span class="keyword">namespace</span> <span class="identifier">math</span><span class="special">{</span>
<span class="keyword">namespace</span> <span class="identifier">concepts</span>
<span class="special">{</span>
-<span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">RealType</span><span class="special">></span>
-<span class="keyword">class</span> <span class="identifier">distribution_archetype</span><span class="special">;</span>
+ <span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">RealType</span><span class="special">></span>
+ <span class="keyword">class</span> <span class="identifier">distribution_archetype</span><span class="special">;</span>
-<span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">Distribution</span><span class="special">></span>
-<span class="keyword">struct</span> <span class="identifier">DistributionConcept</span><span class="special">;</span>
+ <span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">Distribution</span><span class="special">></span>
+ <span class="keyword">struct</span> <span class="identifier">DistributionConcept</span><span class="special">;</span>
<span class="special">}}}</span> <span class="comment">// namespaces</span>
</pre>
@@ -193,9 +193,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/concepts.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/concepts.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/concepts.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -6,7 +6,7 @@
<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<link rel="home" href="../../index.html" title="Math Toolkit">
<link rel="up" href="../using_udt.html" title="Use with User-Defined Floating-Point Types">
-<link rel="prev" href="e_float.html" title="e_float Support">
+<link rel="prev" href="high_precision/using_test.html" title="Using without expression templates for Boost.Test and others">
<link rel="next" href="dist_concept.html" title="Conceptual Requirements for Distribution Types">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
@@ -20,9 +20,9 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="e_float.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../using_udt.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="dist_concept.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="high_precision/using_test.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../using_udt.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="dist_concept.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_using_udt_concepts">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.using_udt.concepts"></a><a class="link" href="concepts.html" title="Conceptual Requirements for Real Number Types">Conceptual Requirements
for Real Number Types</a>
@@ -30,16 +30,22 @@
<p>
The functions, and statistical distributions in this library can be used
with any type <span class="emphasis"><em>RealType</em></span> that meets the conceptual requirements
- given below. All the built in floating point types will meet these requirements.
- User defined types that meet the requirements can also be used. For example,
- with <a class="link" href="use_ntl.html" title="Using With NTL - a High-Precision Floating-Point Library">a thin wrapper class</a>
- one of the types provided with NTL (RR)
- can be used. Submissions of binding to other extended precision types would
- also be most welcome!
+ given below. All the built-in floating-point types will meet these requirements.
+ User-defined types that meet the requirements can also be used.
</p>
<p>
- The guiding principal behind these requirements, is that a <span class="emphasis"><em>RealType</em></span>
- behaves just like a built in floating point type.
+ For example, with <a class="link" href="high_precision/use_ntl.html" title="Using NTL Library">a
+ thin wrapper class</a> one of the types provided with <a href="http://shoup.net/ntl/" target="_top">NTL
+ (RR)</a> can be used. But now that Boost.Multiprecision
+ library is available, this has become the reference real number type.
+ </p>
+<p>
+ Submissions of binding to other extended precision types would also still
+ be welcome.
+ </p>
+<p>
+ The guiding principal behind these requirements is that a <span class="emphasis"><em>RealType</em></span>
+ behaves just like a built-in floating-point type.
</p>
<h5>
<a name="math_toolkit.using_udt.concepts.h0"></a>
@@ -1351,9 +1357,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
@@ -1361,7 +1367,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="e_float.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../using_udt.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="dist_concept.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="high_precision/using_test.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../using_udt.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="dist_concept.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/dist_concept.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/dist_concept.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/dist_concept.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="concepts.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../using_udt.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="archetypes.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_using_udt_dist_concept">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.using_udt.dist_concept"></a><a class="link" href="dist_concept.html" title="Conceptual Requirements for Distribution Types">Conceptual Requirements
for Distribution Types</a>
@@ -383,9 +383,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/e_float.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/e_float.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/e_float.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="use_mpfr.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../using_udt.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="concepts.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_using_udt_e_float">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.using_udt.e_float"></a><a class="link" href="e_float.html" title="e_float Support">e_float Support</a>
</h3></div></div></div>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/use_mpfr.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/use_mpfr.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/use_mpfr.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="use_ntl.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../using_udt.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="e_float.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_using_udt_use_mpfr">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.using_udt.use_mpfr"></a><a class="link" href="use_mpfr.html" title="Using With MPFR / GMP - a High-Precision Floating-Point Library">Using With MPFR / GMP
- a High-Precision Floating-Point Library</a>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/use_ntl.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/use_ntl.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/use_ntl.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="../using_udt.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../using_udt.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="use_mpfr.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_using_udt_use_ntl">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.using_udt.use_ntl"></a><a class="link" href="use_ntl.html" title="Using With NTL - a High-Precision Floating-Point Library">Using With NTL - a High-Precision
Floating-Point Library</a>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="special/owens_t.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="utils/rounding.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_utils">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="math_toolkit.utils"></a><a class="link" href="utils.html" title="Floating Point Utilities">Floating Point Utilities</a>
</h2></div></div></div>
@@ -66,9 +66,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/fp_facets.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/fp_facets.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/fp_facets.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="sign_functions.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../utils.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="fp_facets/intro.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_utils_fp_facets">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.utils.fp_facets"></a><a class="link" href="fp_facets.html" title="Facets for Floating-Point Infinities and NaNs">Facets for Floating-Point
Infinities and NaNs</a>
@@ -75,9 +75,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/fp_facets/examples.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/fp_facets/examples.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/fp_facets/examples.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="reference.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../fp_facets.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="portability.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_utils_fp_facets_examples">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.utils.fp_facets.examples"></a><a class="link" href="examples.html" title="Examples">Examples</a>
</h4></div></div></div>
@@ -254,9 +254,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/fp_facets/intro.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/fp_facets/intro.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/fp_facets/intro.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="../fp_facets.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../fp_facets.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="reference.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_utils_fp_facets_intro">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.utils.fp_facets.intro"></a><a class="link" href="intro.html" title="Introduction">Introduction</a>
</h4></div></div></div>
@@ -375,9 +375,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/fp_facets/portability.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/fp_facets/portability.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/fp_facets/portability.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="examples.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../fp_facets.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="rationale.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_utils_fp_facets_portability">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.utils.fp_facets.portability"></a><a class="link" href="portability.html" title="Portability">Portability</a>
</h4></div></div></div>
@@ -34,9 +34,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/fp_facets/rationale.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/fp_facets/rationale.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/fp_facets/rationale.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="portability.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../fp_facets.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../next_float.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_utils_fp_facets_rationale">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.utils.fp_facets.rationale"></a><a class="link" href="rationale.html" title="Design Rationale">Design Rationale</a>
</h4></div></div></div>
@@ -51,9 +51,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/fp_facets/reference.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/fp_facets/reference.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/fp_facets/reference.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="intro.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../fp_facets.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="examples.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_utils_fp_facets_reference">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.utils.fp_facets.reference"></a><a class="link" href="reference.html" title="Reference">Reference</a>
</h4></div></div></div>
@@ -475,9 +475,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/fpclass.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/fpclass.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/fpclass.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="rounding/modf.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../utils.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="sign_functions.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_utils_fpclass">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.utils.fpclass"></a><a class="link" href="fpclass.html" title="Floating-Point Classification: Infinities and NaNs">Floating-Point Classification:
Infinities and NaNs</a>
@@ -236,9 +236,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="fp_facets/rationale.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../utils.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="next_float/nextafter.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_utils_next_float">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.utils.next_float"></a><a class="link" href="next_float.html" title="Floating-Point Representation Distance (ULP), and Finding Adjacent Floating-Point Values">Floating-Point Representation
Distance (ULP), and Finding Adjacent Floating-Point Values</a>
@@ -67,9 +67,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/float_advance.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/float_advance.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/float_advance.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="float_distance.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../next_float.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../extern_c.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_utils_next_float_float_advance">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.utils.next_float.float_advance"></a><a class="link" href="float_advance.html" title="Advancing a Floating Point Value by a Specific Representation Distance (ULP) float_advance">Advancing
a Floating Point Value by a Specific Representation Distance (ULP) float_advance</a>
@@ -60,9 +60,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/float_distance.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/float_distance.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/float_distance.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="float_prior.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../next_float.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="float_advance.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_utils_next_float_float_distance">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.utils.next_float.float_distance"></a><a class="link" href="float_distance.html" title="Calculating the Representation Distance Between Two Floating Point Values (ULP) float_distance">Calculating
the Representation Distance Between Two Floating Point Values (ULP) float_distance</a>
@@ -94,9 +94,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/float_next.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/float_next.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/float_next.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="nextafter.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../next_float.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="float_prior.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_utils_next_float_float_next">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.utils.next_float.float_next"></a><a class="link" href="float_next.html" title="Finding the Next Greater Representable Value (float_next)">Finding the
Next Greater Representable Value (float_next)</a>
@@ -62,9 +62,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/float_prior.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/float_prior.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/float_prior.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="float_next.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../next_float.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="float_distance.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_utils_next_float_float_prior">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.utils.next_float.float_prior"></a><a class="link" href="float_prior.html" title="Finding the Next Smaller Representable Value (float_prior)">Finding
the Next Smaller Representable Value (float_prior)</a>
@@ -62,9 +62,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/nextafter.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/nextafter.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/nextafter.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="../next_float.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../next_float.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="float_next.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_utils_next_float_nextafter">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.utils.next_float.nextafter"></a><a class="link" href="nextafter.html" title="Finding the Next Representable Value in a Specific Direction (nextafter)">Finding the
Next Representable Value in a Specific Direction (nextafter)</a>
@@ -116,9 +116,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/rounding.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/rounding.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/rounding.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="../utils.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../utils.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="rounding/round.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_utils_rounding">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.utils.rounding"></a><a class="link" href="rounding.html" title="Rounding Truncation and Integer Conversion">Rounding Truncation and
Integer Conversion</a>
@@ -36,9 +36,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/rounding/modf.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/rounding/modf.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/rounding/modf.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="trunc.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../rounding.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../fpclass.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_utils_rounding_modf">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.utils.rounding.modf"></a><a class="link" href="modf.html" title="Integer and Fractional Part Splitting (modf)">Integer and Fractional
Part Splitting (modf)</a>
@@ -70,9 +70,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/rounding/round.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/rounding/round.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/rounding/round.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="../rounding.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../rounding.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="trunc.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_utils_rounding_round">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.utils.rounding.round"></a><a class="link" href="round.html" title="Rounding Functions">Rounding Functions</a>
</h4></div></div></div>
@@ -70,9 +70,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/rounding/trunc.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/rounding/trunc.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/rounding/trunc.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="round.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../rounding.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="modf.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_utils_rounding_trunc">
<div class="titlepage"><div><div><h4 class="title">
<a name="math_toolkit.utils.rounding.trunc"></a><a class="link" href="trunc.html" title="Truncation Functions">Truncation Functions</a>
</h4></div></div></div>
@@ -72,9 +72,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/sign_functions.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/sign_functions.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/sign_functions.html 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="fpclass.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../utils.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="fp_facets.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section math_toolkit_utils_sign_functions">
<div class="titlepage"><div><div><h3 class="title">
<a name="math_toolkit.utils.sign_functions"></a><a class="link" href="sign_functions.html" title="Sign Manipulation Functions">Sign Manipulation
Functions</a>
@@ -43,13 +43,13 @@
<span class="keyword">int</span> <span class="identifier">signbit</span><span class="special">(</span><span class="identifier">T</span> <span class="identifier">x</span><span class="special">);</span>
<span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">T</span><span class="special">></span>
-<span class="keyword">inline</span> <span class="keyword">int</span> <span class="identifier">sign</span> <span class="special">(</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">z</span><span class="special">);</span>
+<span class="keyword">int</span> <span class="identifier">sign</span> <span class="special">(</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">z</span><span class="special">);</span>
-<span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">T</span><span class="special">></span>
-<span class="keyword">inline</span> <span class="identifier">T</span> <span class="identifier">copysign</span> <span class="special">(</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">x</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">y</span><span class="special">);</span>
+<span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">T</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">U</span><span class="special">></span>
+<span class="identifier">T</span> <span class="identifier">copysign</span> <span class="special">(</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">x</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">U</span><span class="special">&</span> <span class="identifier">y</span><span class="special">);</span>
<span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">T</span><span class="special">></span>
-<span class="keyword">inline</span> <span class="identifier">T</span> <span class="identifier">changesign</span> <span class="special">(</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">z</span><span class="special">);</span>
+<a class="link" href="../main_overview/result_type.html" title="Calculation of the Type of the Result"><span class="emphasis"><em>calculated-result-type</em></span></a> <span class="identifier">changesign</span> <span class="special">(</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">z</span><span class="special">);</span>
<span class="special">}}</span> <span class="comment">// namespaces</span>
</pre>
@@ -75,7 +75,7 @@
</p></td></tr>
</table></div>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">T</span><span class="special">></span>
-<span class="keyword">inline</span> <span class="keyword">int</span> <span class="identifier">sign</span> <span class="special">(</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">z</span><span class="special">);</span>
+<span class="keyword">int</span> <span class="identifier">sign</span> <span class="special">(</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">z</span><span class="special">);</span>
</pre>
<p>
Returns <code class="computeroutput"><span class="number">1</span></code> if <span class="emphasis"><em>x</em></span>
@@ -84,8 +84,8 @@
if <span class="emphasis"><em>x</em></span> <code class="computeroutput"><span class="special"><</span> <span class="number">0</span></code>, and <code class="computeroutput"><span class="number">0</span></code>
if <span class="emphasis"><em>x</em></span> is zero.
</p>
-<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">T</span><span class="special">></span>
-<span class="keyword">inline</span> <span class="identifier">T</span> <span class="identifier">copysign</span> <span class="special">(</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">x</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">y</span><span class="special">);</span>
+<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">T</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">U</span><span class="special">></span>
+<a class="link" href="../main_overview/result_type.html" title="Calculation of the Type of the Result"><span class="emphasis"><em>calculated-result-type</em></span></a> <span class="identifier">copysign</span> <span class="special">(</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">x</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">U</span><span class="special">&</span> <span class="identifier">y</span><span class="special">);</span>
</pre>
<p>
Sets the sign of <span class="emphasis"><em>x</em></span> to be the same as the sign of <span class="emphasis"><em>y</em></span>.
@@ -95,7 +95,7 @@
7.12.11.1 The copysign functions</a> for more detail.
</p>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">T</span><span class="special">></span>
-<span class="keyword">inline</span> <span class="identifier">T</span> <span class="identifier">changesign</span> <span class="special">(</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">z</span><span class="special">);</span>
+<span class="identifier">T</span> <span class="identifier">changesign</span> <span class="special">(</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">z</span><span class="special">);</span>
</pre>
<p>
Returns a floating point number with a binary representation where the signbit
@@ -239,9 +239,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang
- Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg and Benjamin
- Sobotta<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006-2010, 2012, 2013 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs
+ van den Berg, Benjamin Sobotta and Christopher Kormanyos<p>
Distributed under 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)
</p>
Modified: branches/release/libs/math/doc/sf_and_dist/html4_symbols.qbk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html4_symbols.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/html4_symbols.qbk 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -78,7 +78,8 @@
[template frasl[]'''⁄'''] [/ / fraction slash]
[template weierp[]'''℘'''] [/ P script capital P = power set = Weierstrass p]
[template image[]'''ℑ'''] [/ I blackletter capital I = imaginary part]
-[template real[]'''ℜ'''] [/ R blackletter capital R = real part symbol]
+[template real[]'''ℜ'''] [/ R blackletter capital R = real part math symbol]
+[template negative[]'''ℕ'''] [/ N blackletter capital N = Negative number math symbol]
[template trade[]'''™'''] [/ ™ trade mark sign]
[template alefsym[]'''ℵ'''] [/ ? alef symbol = first transfinite cardinal]
[template larr[]'''←'''] [/ ? leftwards arrow]
@@ -116,6 +117,7 @@
[template there4[]'''∴'''] [/ ? therefore]
[template sim[]'''∼'''] [/ ~ tilde operator = varies with = similar to]
[template cong[]'''≅'''] [/ ? approximately equal to]
+[template approx[]'''≈'''] [/ ? ~~ very approximately equal to]
[template asymp[]'''≈'''] [/ ˜ almost equal to = asymptotic to]
[template ne[]'''≠'''] [/ ? not equal to]
[template equiv[]'''≡'''] [/ = identical to]
@@ -157,6 +159,7 @@
[template dot[]'''․'''] [/ dot leader]
[template dot2[]'''‥'''] [/ ? dots leader]
[template ellipsis[]'''…'''] [/ horizontal ellipsis]
+[template sect[]'''§'''] [/ ? section or paragraph sign]
[template dotover[]'''̇'''] [/ dot over symbol]
[template recur[]''' ̇'''] [/ math recurring symbol, eg after 0.333]
@@ -193,10 +196,15 @@
[template pow4[]'''⁴'''] [/ superscript 4 character]
[template pown[]'''ⁿ'''] [/ superscript n character]
[template frac12[]'''½'''] [/ fraction half]
+[template frac13[]'''⅓'''] [/ fraction third]
[template frac14[]'''¼'''] [/ fraction quarter]
[template frac34[]'''¾'''] [/ fraction three quarter]
+[template frac23[]'''⅔'''] [/ fraction two third]
[template sup1[]'''¹'''] [/ superscript one = superscript digit one ]
[template sup2[]'''²'''] [/ superscript two = superscript digit two = squared ]
+[template supminus[]'''⁻'''] [/ superscript minus]
+[template supplus[]'''⁺'''] [/ superscript plus]
+
[template cubed[]'''³'''] [/ superscript three = superscript digit three = cubed ]
[template macron[]'''¯'''] [/ macron = spacing macron = overline = APL overbar ]
[template deg[]'''°'''] [/ degree sign ]
@@ -208,7 +216,7 @@
[template laquo[]'''«'''] [/ left-pointing double angle quotation mark = left pointing guillemet ]
[template raquo[]'''»'''] [/ right-pointing double angle quotation mark = right pointing guillemet ]
-[/
+[/
Copyright 2007, 2010, 2012 Paul A. Bristow.
Distributed under the Boost Software License, Version 1.0.
(See accompanying file LICENSE_1_0.txt or copy at
Modified: branches/release/libs/math/doc/sf_and_dist/implementation.qbk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/implementation.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/implementation.qbk 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -36,7 +36,7 @@
then a user may substitute his custom specialization.
For example, there are approximations dating back from times
-when computation was a *lot* more expensive:
+when computation was a [*lot] more expensive:
H Goldberg and H Levine, Approximate formulas for
percentage points and normalisation of t and chi squared,
@@ -160,14 +160,14 @@
mean(cauchy<>()) will return std::numeric_limits<T>::quiet_NaN().
[warning If `std::numeric_limits<T>::has_quiet_NaN` is false
-(for example T is a User-defined type),
+(for example, if T is a User-defined type without NaN support),
then an exception will always be thrown when a domain error occurs.
Catching exceptions is therefore strongly recommended.]
[h4 Median of distributions]
There are many distributions for which we have been unable to find an analytic formula,
-and this has deterred us from implementing
+and this has deterred us from implementing
[@http://en.wikipedia.org/wiki/Median median functions], the mid-point in a list of values.
However a useful numerical approximation for distribution `dist`
@@ -211,13 +211,13 @@
and it is supported and tested by the distribution.
The range for these distributions is set to infinity if supported by the platform,
-(by testing `std::numeric_limits<RealType>::has_infinity`)
+(by testing `std::numeric_limits<RealType>::has_infinity`)
else the maximum value provided for the `RealType` by Boost.Math.
Testing for has_infinity is obviously important for arbitrary precision types
where infinity makes much less sense than for IEEE754 floating-point.
-So far we have not set `support()` function (only range)
+So far we have not set `support()` function (only range)
on the grounds that the PDF is uninteresting/zero for infinities.
Users who require special handling of infinity (or other specific value) can,
@@ -307,7 +307,8 @@
to provide high accuracy constants to mathematical functions and distributions,
since it is important to provide values uniformly for both built-in
float, double and long double types,
-and for User Defined types like NTL::quad_float and NTL::RR.
+and for User Defined types in __multiprecision like __cpp_dec_float.
+and others like NTL::quad_float and NTL::RR.
To permit calculations in this Math ToolKit and its tests, (and elsewhere)
at about 100 decimal digits with NTL::RR type,
@@ -353,21 +354,19 @@
[h4 Thread safety]
-Reporting of error by setting errno should be thread safe already
+Reporting of error by setting `errno` should be thread-safe already
(otherwise none of the std lib math functions would be thread safe?).
-If you turn on reporting of errors via exceptions, errno gets left unused anyway.
+If you turn on reporting of errors via exceptions, `errno` gets left unused anyway.
-Other than that, the code is intended to be thread safe *for built in
-real-number types* : so float, double and long double are all thread safe.
+For normal C++ usage, the Boost.Math `static const` constants are now thread-safe so
+for built-in real-number types: `float`, `double` and `long double` are all thread safe.
-For non-built-in types - NTL::RR for example - initialisation of the various
-constants used in the implementation is potentially *not* thread safe.
-This most undesiable, but it would be a signficant challenge to fix it.
-Some compilers may offer the option of having
-static-constants initialised in a thread safe manner (Commeau, and maybe
-others?), if that's the case then the problem is solved. This is a topic of
-hot debate for the next C++ std revision, so hopefully all compilers
-will be required to do the right thing here at some point.
+For User_defined types, for example, __cpp_dec_float,
+the Boost.Math should also be thread-safe,
+(thought we are unsure how to rigorously prove this).
+
+(Thread safety has received attention in the C++11 Standard revision,
+so hopefully all compilers will do the right thing here at some point.)
[h4 Sources of Test Data]
@@ -381,7 +380,7 @@
provided a higher accuracy than
C++ double (64-bit floating-point) and was regarded as
the most-trusted source by far.
-The __R provided the widest range of distributions,
+The __R provided the widest range of distributions,
but the usual Intel X86 distribution uses 64-but doubles,
so our use was limited to the 15 to 17 decimal digit accuracy.
@@ -418,7 +417,7 @@
Usage is `check_out_of_range< DistributionType >(list-of-params);`
Where list-of-params is a list of *valid* parameters from which the distribution can be constructed
- ie the same number of args are passed to the function,
-as are passed to the distribution constructor.
+as are passed to the distribution constructor.
The values of the parameters are not important, but must be *valid* to pass the contructor checks;
the default values are suitable, but must be explicitly provided, for example:
@@ -628,12 +627,12 @@
[h4 Producing Graphs]
Graphs were produced in SVG format and then converted to PNG's using the same
-process as the equations.
+process as the equations.
-The programs
+The programs
`/libs/math/doc/sf_and_dist/graphs/dist_graphs.cpp`
and `/libs/math/doc/sf_and_dist/graphs/sf_graphs.cpp`
-generate the SVG's directly using the
+generate the SVG's directly using the
[@http://code.google.com/soc/2007/boost/about.html Google Summer of Code 2007]
project of Jacob Voytko (whose work so far,
considerably enhanced and now reasonably mature and usable, by Paul A. Bristow,
Modified: branches/release/libs/math/doc/sf_and_dist/issues.qbk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/issues.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/issues.qbk 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -9,16 +9,30 @@
Items labled "Low Priority" should probably be investigated at
some point. Such classifications are obviously highly subjective.
-If you don't see a component listed here, then we don't have any known
+If you don't see a component listed here, then we don't have any known
issues with it.
+[h4 Derivatives of Bessel functions (and their zeros)]
+
+Potentially, there could be native support
+for `cyl_bessel_j_prime()` and `cyl_neumann_prime()`.
+One could also imagine supporting the zeros
+thereof, but they might be slower to calculate
+since root bracketing might be needed instead
+of Newton iteration (for the lack of 2nd derivatives).
+
+Since Boost.Math's Bessel functions are so excellent,
+the quick way to `cyl_bessel_j_prime()` and
+`cyl_neumann_prime()` would be via relationship with
+`cyl_bessel_j()` and `cyl_neumann()`.
+
[h4 tgamma]
* Can the __lanczos be optimized any further? (low priority)
[h4 Incomplete Beta]
-* Investigate Didonato and Morris' asymptotic expansion for large a and b
+* Investigate Didonato and Morris' asymptotic expansion for large a and b
(medium priority).
[h4 Inverse Gamma]
@@ -53,13 +67,13 @@
would it be more efficient evaluated this way, rather than by Carlson's
algorithms? (Low Priority).
* Should we add an implementation of Carlson's R[sub G]? It's not
-required for the Legendre form integrals, but some people may find it
+required for the Legendre form integrals, but some people may find it
useful (Low Priority).
-* There are a several other integrals: D([phi], k), Z([beta], k),
+* There are a several other integrals: D([phi], k), Z([beta], k),
[Lambda][sub 0]([beta], k) and Bulirsch's ['el] functions that could
be implemented using Carlson's integrals (Low Priority).
* The integrals K(k) and E(k) could be implemented using rational
-approximations (both for efficiency and accuracy),
+approximations (both for efficiency and accuracy),
assuming we can find them. (Medium Priority).
* There is a sub-domain of __ellint_3 that is unimplemented (see the docs
for details), currently
@@ -82,7 +96,7 @@
[h4 Statistical distributions]
-* Student's t Perhaps switch to normal distribution
+* Student's t Perhaps switch to normal distribution
as a better approximation for very large degrees of freedom?
[h4 Feature Requests]
@@ -136,7 +150,7 @@
Also asked for more than once:
-* Add support for interpolated distributions, possibly combine with numeric
+* Add support for interpolated distributions, possibly combine with numeric
integration and differentiation.
* Add support for bivariate and multivariate distributions: most especially the normal.
* Add support for the log of the cdf and pdf:
@@ -146,7 +160,7 @@
[endsect] [/section:issues Known Issues, and Todo List]
-[/
+[/
Copyright 2006, 2010 John Maddock and Paul A. Bristow.
Distributed under the Boost Software License, Version 1.0.
(See accompanying file LICENSE_1_0.txt or copy at
Modified: branches/release/libs/math/doc/sf_and_dist/jacobi_elliptic.qbk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/jacobi_elliptic.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/jacobi_elliptic.qbk 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -53,11 +53,11 @@
namespace boost { namespace math {
- template <class T>
- ``__sf_result`` jacobi_elliptic(T k, T u, T* pcn, T* pdn);
+ template <class T, class U, class V>
+ ``__sf_result`` jacobi_elliptic(T k, U u, V* pcn, V* pdn);
- template <class T, class Policy>
- ``__sf_result`` jacobi_elliptic(T k, T u, T* pcn, T* pdn, const Policy&);
+ template <class T, class U, class V, class Policy>
+ ``__sf_result`` jacobi_elliptic(T k, U u, V* pcn, V* pdn, const Policy&);
}} // namespaces
Modified: branches/release/libs/math/doc/sf_and_dist/math.qbk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/math.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/math.qbk 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -1,13 +1,13 @@
[article Math Toolkit
[quickbook 1.5]
- [copyright 2006, 2007, 2008, 2009, 2010, 2012 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan RÃ¥de, Gautam Sewani, Thijs van den Berg and Benjamin Sobotta]
+ [copyright 2006, 2007, 2008, 2009, 2010, 2012, 2013 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan RÃ¥de, Gautam Sewani, Thijs van den Berg, Benjamin Sobotta and Christopher Kormanyos]
[/purpose ISBN 0-9504833-2-X 978-0-9504833-2-0, Classification 519.2-dc22]
[license
Distributed under 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])
]
- [authors [Maddock, John], [Bristow, Paul A.], [Holin, Hubert], [Zhang, Xiaogang], [Lalande, Bruno], [RÃ¥de, Johan], [Sewani, Gautam], [van den Berg, Thijs], [Sobotta, Benjamin]]
+ [authors [Maddock, John], [Bristow, Paul A.], [Holin, Hubert], [Zhang, Xiaogang], [Lalande, Bruno], [RÃ¥de, Johan], [Sewani, Gautam], [van den Berg, Thijs], [Sobotta, Benjamin], [Kormanyos, Christopher] ]
[/last-revision $Date$]
]
@@ -89,6 +89,7 @@
[def __lanczos [link math_toolkit.backgrounders.lanczos Lanczos approximation]]
[def __zero_error [link zero_error effectively zero error]]
[def __relative_error [link math_toolkit.backgrounders.relative_error relative zero error]]
+[def __root_finding_with_derivatives [link math_toolkit.toolkit.internals1.roots root-finding with derivatives]]
[/gammas]
[def __lgamma [link math_toolkit.special.sf_gamma.lgamma lgamma]]
@@ -310,8 +311,10 @@
[def __NTL [@http://www.shoup.net/ntl/ NTL A Library for doing Number Theory]]
[def __NTL_RR [@http://shoup.net/ntl/doc/RR.txt NTL::RR]]
[def __NTL_quad_float [@http://shoup.net/ntl/doc/quad_float.txt NTL::quad_float]]
-[def __MPFR [@http://www.mpfr.org/ MPFR]]
+[def __MPFR [@http://www.mpfr.org/ GNU MPFR library]]
[def __GMP [@http://gmplib.org/ GNU Multiple Precision Arithmetic Library]]
+[def __multiprecision [@http://www.boost.org/doc/libs/1_53_0_beta1/libs/multiprecision/doc/html/index.html Boost.Multiprecision]]
+[def __cpp_dec_float [@http://www.boost.org/doc/libs/1_53_0_beta1/libs/multiprecision/doc/html/boost_multiprecision/tut/floats/cpp_dec_float.html cpp_dec_float]]
[def __R [@http://www.r-project.org/ The R Project for Statistical Computing]]
[def __godfrey [link godfrey Godfrey]]
[def __pugh [link pugh Pugh]]
@@ -319,11 +322,16 @@
[def __errno [@http://en.wikipedia.org/wiki/Errno `::errno`]]
[def __Mathworld [@http://mathworld.wolfram.com Wolfram MathWorld]]
[def __Mathematica [@http://www.wolfram.com/products/mathematica/index.html Wolfram Mathematica]]
+[def __WolframAlpha [@http://www.wolframalpha.com/ Wolfram Alpha]]
[def __TOMS748 [@http://portal.acm.org/citation.cfm?id=210111 TOMS Algorithm 748: enclosing zeros of continuous functions]]
+[def __TOMS910 [@http://portal.acm.org/citation.cfm?id=1916469 TOMS Algorithm 910: A Portable C++ Multiple-Precision System for Special-Function Calculations]]
[def __why_complements [link why_complements why complements?]]
[def __complements [link complements complements]]
[def __performance [link math_toolkit.perf performance]]
[def __building [link math_toolkit.main_overview.building building libraries]]
+[def __e_float [@http://calgo.acm.org/910.zip e_float (TOMS Algorithm 910)]]
+[def __Abramowitz_Stegun M. Abramowitz and I. A. Stegun, Handbook of Mathematical Functions, NBS (1964)]
+[def _DMLF [@http://dlmf.nist.gov/ NIST Digital Library of Mathematical Functions]]
[/ Some composite templates]
[template super[x]'''<superscript>'''[x]'''</superscript>''']
Modified: branches/release/libs/math/doc/sf_and_dist/minimax.qbk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/minimax.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/minimax.qbk 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -13,8 +13,8 @@
algorithm is, and the general form of the approximation you want to achieve.
Unless you already familar with the Remez method,
-you should first read the [link math_toolkit.backgrounders.remez
-brief background article explaining the principles behind the
+you should first read the [link math_toolkit.backgrounders.remez
+brief background article explaining the principles behind the
Remez algorithm].
The program consists of two parts:
@@ -29,18 +29,18 @@
the same compiled program: each as a separate variant:
NTL::RR f(const NTL::RR& x, int variant);
-
+
Returns the value of the function /variant/ at point /x/. So if you
wish you can just add the function to approximate as a new variant
after the existing examples.
In addition to those two files, the program needs to be linked to
-a [link math_toolkit.using_udt.use_ntl patched NTL library to compile].
+a [link math_toolkit.using_udt.high_precision.use_ntl patched NTL library to compile].
Note that the function /f/ must return the rational part of the
approximation: for example if you are approximating a function
/f(x)/ then it is quite common to use:
-
+
f(x) = g(x)(Y + R(x))
where /g(x)/ is the dominant part of /f(x)/, /Y/ is some constant, and
@@ -50,7 +50,7 @@
In this case you would define /f/ to return ['f(x)/g(x)] and then set the
y-offset of the approximation to /Y/ (see command line options below).
-Many other forms are possible, but in all cases the objective is to
+Many other forms are possible, but in all cases the objective is to
split /f(x)/ into a dominant part that you can evaluate easily using
standard math functions, and a smooth and slowly changing rational approximation
part. Refer to your favourite textbook for more examples.
@@ -62,7 +62,7 @@
that are to be approximated to be compiled into the same executable.
Defaults to 0.]]
[[range a b][Sets the domain for the approximation to the range \[a,b\], defaults
- to \[0,1\].]]
+ to \[0,1\].]]
[[relative][Sets the Remez code to optimise for relative error. This is the default
at program startup. Note that relative error can only be used
if f(x) has no roots over the range being optimised.]]
@@ -70,7 +70,7 @@
[[pin \[true|false\]]["Pins" the code so that the rational approximation
passes through the origin. Obviously only set this to
/true/ if R(0) must be zero. This is typically used when
- trying to preserve a root at \[0,0\] while also optimising
+ trying to preserve a root at \[0,0\] while also optimising
for relative error.]]
[[order N D][Sets the order of the approximation to /N/ in the numerator and /D/
in the denominator. If /D/ is zero then the result will be a polynomial
@@ -78,7 +78,7 @@
coefficient of the numerator is zero if /pin/ was set to true, and the
first coefficient of the denominator is always one.]]
[[working-precision N][Sets the working precision of NTL::RR to /N/ binary digits. Defaults to 250.]]
-[[target-precision N][Sets the precision of printed output to /N/ binary digits:
+[[target-precision N][Sets the precision of printed output to /N/ binary digits:
set to the same number of digits as the type that will be used to
evaluate the approximation. Defaults to 53 (for double precision).]]
[[skew val]["Skews" the initial interpolated control points towards one
@@ -89,32 +89,32 @@
try adjusting the skew parameter until the first step yields
the smallest possible error. /val/ should be in the range
\[-100,+100\], the default is zero.]]
-[[brake val][Sets a brake on each step so that the change in the
+[[brake val][Sets a brake on each step so that the change in the
control points is braked by /val%/. Defaults to 50,
try a higher value if an approximation won't converge,
or a lower value to get speedier convergence.]]
[[x-offset val][Sets the x-offset to /val/: the approximation will
- be generated for `f(S * (x + X)) + Y` where /X/ is the
+ be generated for `f(S * (x + X)) + Y` where /X/ is the
x-offset, /S/ is the x-scale
and /Y/ is the y-offset. Defaults to zero. To avoid
rounding errors, take care to specify a value that can
be exactly represented as a floating point number.]]
[[x-scale val][Sets the x-scale to /val/: the approximation will
- be generated for `f(S * (x + X)) + Y` where /S/ is the
+ be generated for `f(S * (x + X)) + Y` where /S/ is the
x-scale, /X/ is the x-offset
and /Y/ is the y-offset. Defaults to one. To avoid
rounding errors, take care to specify a value that can
be exactly represented as a floating point number.]]
[[y-offset val][Sets the y-offset to /val/: the approximation will
- be generated for `f(S * (x + X)) + Y` where /X/
+ be generated for `f(S * (x + X)) + Y` where /X/
is the x-offset, /S/ is the x-scale
and /Y/ is the y-offset. Defaults to zero. To avoid
rounding errors, take care to specify a value that can
be exactly represented as a floating point number.]]
[[y-offset auto][Sets the y-offset to the average value of f(x)
evaluated at the two endpoints of the range plus the midpoint
- of the range. The calculated value is deliberately truncated
- to /float/ precision (and should be stored as a /float/
+ of the range. The calculated value is deliberately truncated
+ to /float/ precision (and should be stored as a /float/
in your code). The approximation will
be generated for `f(x + X) + Y` where /X/ is the x-offset
and /Y/ is the y-offset. Defaults to zero.]]
@@ -124,7 +124,7 @@
of interest.]]
[[step N][Performs /N/ steps, or one step if /N/ is unspecified.
After each step prints: the peek error at the extrema of
- the error function of the approximation,
+ the error function of the approximation,
the theoretical error term solved for on the last step,
and the maximum relative change in the location of the
Chebyshev control points. The approximation is converged on the
@@ -154,12 +154,12 @@
[[info][Prints out the current approximation: the location of the zeros of the
error function, the location of the Chebyshev control points, the
x and y offsets, and of course the coefficients of the polynomials.]]
-]
+]
[endsect][/section:minimax Minimax Approximations and the Remez Algorithm]
-[/
+[/
Copyright 2006 John Maddock and Paul A. Bristow.
Distributed under the Boost Software License, Version 1.0.
(See accompanying file LICENSE_1_0.txt or copy at
Modified: branches/release/libs/math/doc/sf_and_dist/overview.qbk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/overview.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/overview.qbk 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -16,73 +16,74 @@
& [link math_toolkit.dist.dist_ref.dists.f_dist Fisher])
and [@http://mathworld.wolfram.com/DiscreteDistribution.html discrete]
(like [link math_toolkit.dist.dist_ref.dists.binomial_dist binomial]
-& [link math_toolkit.dist.dist_ref.dists.poisson_dist Poisson])
+& [link math_toolkit.dist.dist_ref.dists.poisson_dist Poisson])
distributions are provided.
-A [link math_toolkit.dist.stat_tut comprehensive tutorial is provided],
-along with a series of
+A [link math_toolkit.dist.stat_tut comprehensive tutorial is provided],
+along with a series of
[link math_toolkit.dist.stat_tut.weg worked examples] illustrating
how the library is used to conduct statistical tests.
[h4 Mathematical Special Functions]
-Provides a small number of high quality
+Provides a small number of high quality
[link math_toolkit.special special functions],
initially these were concentrated on functions used in statistical applications
along with those in the [tr1].
The function families currently implemented are the gamma, beta & erf functions
along with the incomplete gamma and beta functions (four variants
-of each) and all the possible inverses of these, plus digamma,
+of each) and all the possible inverses of these, plus digamma,
various factorial functions,
-Bessel functions, elliptic integrals, sinus cardinals (along with their
+Bessel functions, elliptic integrals, sinus cardinals (along with their
hyperbolic variants), inverse hyperbolic functions, Legrendre/Laguerre/Hermite
-polynomials and various
+polynomials and various
special power and logarithmic functions.
All the implementations
are fully generic and support the use of arbitrary "real-number" types,
+including __multiprecision,
although they are optimised for use with types with known-about
[@http://en.wikipedia.org/wiki/Significand significand (or mantissa)]
sizes: typically `float`, `double` or `long double`.
[h4 Implementation Toolkit]
-Provides [link math_toolkit.toolkit many of the tools] required to implement
-mathematical special functions: hopefully the presence of
+Provides [link math_toolkit.toolkit many of the tools] required to implement
+mathematical special functions: hopefully the presence of
these will encourage other authors to contribute more special
function implementations in the future. These tools are currently
considered experimental: they are "exposed implementation details"
whose interfaces and\/or implementations may change.
-There are helpers for the
-[link math_toolkit.toolkit.internals1.series_evaluation
-evaluation of infinite series],
+There are helpers for the
+[link math_toolkit.toolkit.internals1.series_evaluation
+evaluation of infinite series],
[link math_toolkit.toolkit.internals1.cf continued
fractions] and [link math_toolkit.toolkit.internals1.rational
rational approximations].
-There is a fairly comprehensive set of root finding and
-[link math_toolkit.toolkit.internals1.minima function minimisation
-algorithms]: the root finding algorithms are both
-[link math_toolkit.toolkit.internals1.roots with] and
+There is a fairly comprehensive set of root finding and
+[link math_toolkit.toolkit.internals1.minima function minimisation
+algorithms]: the root finding algorithms are both
+[link math_toolkit.toolkit.internals1.roots with] and
[link math_toolkit.toolkit.internals1.roots2 without] derivative support.
-A [link math_toolkit.toolkit.internals2.minimax
+A [link math_toolkit.toolkit.internals2.minimax
Remez algorithm implementation] allows for the locating of minimax rational
approximations.
-There are also (experimental) classes for the
-[link math_toolkit.toolkit.internals2.polynomials manipulation of polynomials], for
-[link math_toolkit.toolkit.internals2.error_test
-testing a special function against tabulated test data], and for
+There are also (experimental) classes for the
+[link math_toolkit.toolkit.internals2.polynomials manipulation of polynomials], for
+[link math_toolkit.toolkit.internals2.error_test
+testing a special function against tabulated test data], and for
the [link math_toolkit.toolkit.internals2.test_data
-rapid generation of test data] and/or data for output to an
+rapid generation of test data] and/or data for output to an
external graphing application.
[endsect] [/section:intro Introduction]
-[/
+[/
Copyright 2006, 2012 John Maddock and Paul A. Bristow.
Distributed under the Boost Software License, Version 1.0.
(See accompanying file LICENSE_1_0.txt or copy at
Modified: branches/release/libs/math/doc/sf_and_dist/performance.qbk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/performance.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/performance.qbk 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -11,16 +11,15 @@
In all of the following tables, the best performing
result in each row, is assigned a relative value of "1" and shown
-in bold, so a score of "2" means ['"twice as slow as the best
+in bold, so a score of "2" means ['"twice as slow as the best
performing result".] Actual timings in seconds per function call
-are also shown in parenthesis.
+are also shown in parenthesis.
Result were obtained on a system
with an Intel 2.8GHz Pentium 4 processor with 2Gb of RAM and running
-either Windows XP or Mandriva Linux.
+either Windows XP or Mandriva Linux.
-[caution As usual
-with performance results these should be taken with a large pinch
+[caution As usual with performance results these should be taken with a large pinch
of salt: relative performance is known to shift quite a bit depending
upon the architecture of the particular test system used. Further
more, our performance results were obtained using our own test data:
@@ -37,18 +36,18 @@
[section:getting_best Getting the Best Performance from this Library]
By far the most important thing you can do when using this library
-is turn on your compiler's optimisation options. As the following
-table shows the penalty for using the library in debug mode can be
-quite large.
+is turn on your compiler's optimisation options. As the following
+table shows the penalty for using the library in debug mode can be
+quite large.
[table Performance Comparison of Release and Debug Settings
[[Function]
[Microsoft Visual C++ 8.0
-
+
Debug Settings: /Od /ZI
]
[Microsoft Visual C++ 8.0
-
+
Release settings: /Ox /arch:SSE2
]]
@@ -66,25 +65,25 @@
[section:comp_compilers Comparing Compilers]
-After a good choice of build settings the next most important thing
+After a good choice of build settings the next most important thing
you can do, is choose your compiler
- and the standard C library it sits on top of - very carefully. GCC-3.x
-in particular has been found to be particularly bad at inlining code,
+in particular has been found to be particularly bad at inlining code,
and performing the kinds of high level transformations that good C++ performance
demands (thankfully GCC-4.x is somewhat better in this respect).
[table Performance Comparison of Various Windows Compilers
[[Function]
[Intel C++ 10.0
-
+
( /Ox /Qipo /QxN )
]
[Microsoft Visual C++ 8.0
-
+
( /Ox /arch:SSE2 )
]
[Cygwin G++ 3.4
-
+
( /O3 )
]]
[[__erf][[perf intel-erf..[para *1.00*][para (4.118e-008s)]]][[perf msvc-erf..[para *1.00*][para (1.483e-007s)]]][[perf gcc-erf..[para 3.24][para (1.336e-007s)]]]]
@@ -105,7 +104,7 @@
that are determined by configuration macros. These should be set
in boost/math/tools/user.hpp; or else reported to the Boost-development
mailing list so that the appropriate option for a given compiler and
-OS platform can be set automatically in our configuration setup.
+OS platform can be set automatically in our configuration setup.
[table
[[Macro][Meaning]]
@@ -127,16 +126,16 @@
[Many of the coefficients to the polynomials and rational functions
used by this library are integers. Normally these are stored as tables
as integers, but if mixed integer / floating point arithmetic is much
- slower than regular floating point arithmetic then they can be stored
+ slower than regular floating point arithmetic then they can be stored
as tables of floating point values instead. If mixed arithmetic is slow
then add:
-
+
#define BOOST_MATH_INT_TABLE_TYPE(RT, IT) RT
-
+
to boost/math/tools/user.hpp, otherwise the default of:
-
+
#define BOOST_MATH_INT_TABLE_TYPE(RT, IT) IT
-
+
Set in boost/math/config.hpp is fine, and may well result in smaller
code.
]]
@@ -148,8 +147,8 @@
[table
[[Value][Effect]]
[[0][The polynomial or rational function is evaluated using Horner's
- method, and a simple for-loop.
-
+ method, and a simple for-loop.
+
Note that if the order of the polynomial
or rational function is a runtime parameter, or the order is
greater than the value of `BOOST_MATH_MAX_POLY_ORDER`, then
@@ -179,13 +178,13 @@
than or equal to `BOOST_MATH_MAX_POLY_ORDER`.]]
]
-To determine which
+To determine which
of these options is best for your particular compiler/platform build
the performance test application with your usual release settings,
and run the program with the --tune command line option.
In practice the difference between methods is rather small at present,
-as the following table shows. However, parallelisation /vectorisation
+as the following table shows. However, parallelisation /vectorisation
is likely to become more important in the future: quite likely the methods
currently supported will need to be supplemented or replaced by ones more
suited to highly vectorisable processors in the future.
@@ -205,25 +204,25 @@
There is one final performance tuning option that is available as a compile time
[link math_toolkit.policy policy]. Normally when evaluating functions at `double`
precision, these are actually evaluated at `long double` precision internally:
-this helps to ensure that as close to full `double` precision as possible is
+this helps to ensure that as close to full `double` precision as possible is
achieved, but may slow down execution in some environments. The defaults for
-this policy can be changed by
-[link math_toolkit.policy.pol_ref.policy_defaults
+this policy can be changed by
+[link math_toolkit.policy.pol_ref.policy_defaults
defining the macro `BOOST_MATH_PROMOTE_DOUBLE_POLICY`]
-to `false`, or
-[link math_toolkit.policy.pol_ref.internal_promotion
+to `false`, or
+[link math_toolkit.policy.pol_ref.internal_promotion
by specifying a specific policy] when calling the special
-functions or distributions. See also the
+functions or distributions. See also the
[link math_toolkit.policy.pol_tutorial policy tutorial].
[table Performance Comparison with and Without Internal Promotion to long double
[[Function]
[GCC 4.2 , Linux
-
+
(with internal promotion of double to long double).
]
[GCC 4.2, Linux
-
+
(without promotion of double).
]
]
@@ -241,15 +240,15 @@
[section:comparisons Comparisons to Other Open Source Libraries]
We've run our performance tests both for our own code, and against other
-open source implementations of the same functions. The results are
+open source implementations of the same functions. The results are
presented below to give you a rough idea of how they all compare.
[caution
You should exercise extreme caution when interpreting
these results, relative performance may vary by platform, the tests use
-data that gives good code coverage of /our/ code, but which may skew the
-results towards the corner cases. Finally, remember that different
-libraries make different choices with regard to performance verses
+data that gives good code coverage of /our/ code, but which may skew the
+results towards the corner cases. Finally, remember that different
+libraries make different choices with regard to performance verses
numerical stability.
]
@@ -325,7 +324,7 @@
All the results were measured on a 2.0GHz Intel T5800 Core 2 Duo, 4Gb RAM, Windows Vista
machine, with the test program compiled with Microsoft Visual C++ 2009, and
-R-2.9.2 compiled in "standalone mode" with MinGW-4.3
+R-2.9.2 compiled in "standalone mode" with MinGW-4.3
(R-2.9.2 appears not to be buildable with Visual C++).
[table A Comparison to the R Statistical Library on Windows XP
@@ -343,12 +342,12 @@
[[__F_distrib CDF][[perf msvc-dist-fisher_f-cdf..[para *1.00*][para (9.556e-007s)]]][[perf msvc-dist-f-R-cdf..[para 1.34][para (1.283e-006s)]]][[perf msvc-dist-f-dcd-cdf..[para 1.24][para (1.183e-006s)]]]]
[[__F_distrib Quantile][[perf msvc-dist-fisher_f-quantile..[para *1.00*][para (6.987e-006s)]]][[perf msvc-dist-f-R-quantile..[para 1.33][para (9.325e-006s)]]][[perf msvc-dist-f-dcd-quantile..[para 3.16][para (2.205e-005s)]]]]
[[__gamma_distrib CDF][[perf msvc-dist-gamma-cdf..[para 1.52][para (6.240e-007s)]]][[perf msvc-dist-gamma-R-cdf..[para 3.11][para (1.279e-006s)]]][[perf msvc-dist-gam-dcd-cdf..[para *1.00*][para (4.111e-007s)]]]]
-[[__gamma_distrib Quantile][[perf msvc-dist-gamma-quantile..[para 1.24][para (2.179e-006s)]]][[perf msvc-dist-gamma-R-quantile..[para 6.25][para (1.102e-005s)]]][[perf msvc-dist-gam-dcd-quantile..[para *1.00*][para (1.764e-006s)]]]]
+[[__gamma_distrib Quantile][[perf msvc-dist-gamma-quantile..[para 1.24][para (2.179e-006s)]]][[perf msvc-dist-gamma-R-quantile..[para 6.25][para (1.102e-005s)]]][[perf msvc-dist-gam-dcd-quantile..[para *1.00*][para (1.764e-006s)]]]]
[[__hypergeometric_distrib CDF][[perf msvc-dist-hypergeometric-cdf..[para 3.60[footnote This result is somewhat misleading: for small values of the parameters there is virtually no difference between the two libraries, but for large values the Boost implementation is /much/ slower, albeit with much improved precision.]][para (5.987e-007s)]]][[perf msvc-dist-hypergeo-R-cdf..[para *1.00*][para (1.665e-007s)]]][NA]]
-[[__hypergeometric_distrib Quantile][[perf msvc-dist-hypergeometric-quantile..[para *1.00*][para (5.684e-007s)]]][[perf msvc-dist-hypergeo-R-quantile..[para 3.53][para (2.004e-006s)]]][NA]]
+[[__hypergeometric_distrib Quantile][[perf msvc-dist-hypergeometric-quantile..[para *1.00*][para (5.684e-007s)]]][[perf msvc-dist-hypergeo-R-quantile..[para 3.53][para (2.004e-006s)]]][NA]]
[[__logistic_distrib CDF][[perf msvc-dist-logistic-cdf..[para *1.00*][para (1.714e-007s)]]][[perf msvc-dist-logis-R-cdf..[para 5.24][para (8.984e-007s)]]][NA]]
-[[__logistic_distrib Quantile][[perf msvc-dist-logistic-quantile..[para 1.02][para (2.084e-007s)]]][[perf msvc-dist-logis-R-quantile..[para *1.00*][para (2.043e-007s)]]][NA]]
+[[__logistic_distrib Quantile][[perf msvc-dist-logistic-quantile..[para 1.02][para (2.084e-007s)]]][[perf msvc-dist-logis-R-quantile..[para *1.00*][para (2.043e-007s)]]][NA]]
[[__lognormal_distrib CDF][[perf msvc-dist-lognormal-cdf..[para *1.00*][para (3.579e-007s)]]][[perf msvc-dist-lnorm-R-cdf..[para 1.49][para (5.332e-007s)]]][NA]]
[[__lognormal_distrib Quantile][[perf msvc-dist-lognormal-quantile..[para *1.00*][para (9.622e-007s)]]][[perf msvc-dist-lnorm-R-quantile..[para 1.57][para (1.507e-006s)]]][NA]]
@@ -392,12 +391,12 @@
[[__F_distrib CDF][[perf gcc-4_3_2-dist-fisher_f-cdf..[para 1.62][para (2.324e-006s)]]][[perf gcc-4_3_2-dist-f-R-cdf..[para 1.19][para (1.711e-006s)]]][[perf gcc-4_3_2-dist-f-dcd-cdf..[para *1.00*][para (1.437e-006s)]]]]
[[__F_distrib Quantile][[perf gcc-4_3_2-dist-fisher_f-quantile..[para 1.53][para (1.577e-005s)]]][[perf gcc-4_3_2-dist-f-R-quantile..[para *1.00*][para (1.033e-005s)]]][[perf gcc-4_3_2-dist-f-dcd-quantile..[para 2.63][para (2.719e-005s)]]]]
[[__gamma_distrib CDF][[perf gcc-4_3_2-dist-gamma-cdf..[para 3.18][para (1.582e-006s)]]][[perf gcc-4_3_2-dist-gamma-R-cdf..[para 2.63][para (1.309e-006s)]]][[perf gcc-4_3_2-dist-gam-dcd-cdf..[para *1.00*][para (4.980e-007s)]]]]
-[[__gamma_distrib Quantile][[perf gcc-4_3_2-dist-gamma-quantile..[para 2.19][para (4.770e-006s)]]][[perf gcc-4_3_2-dist-gamma-R-quantile..[para 6.94][para (1.513e-005s)]]][[perf gcc-4_3_2-dist-gam-dcd-quantile..[para *1.00*][para (2.179e-006s)]]]]
+[[__gamma_distrib Quantile][[perf gcc-4_3_2-dist-gamma-quantile..[para 2.19][para (4.770e-006s)]]][[perf gcc-4_3_2-dist-gamma-R-quantile..[para 6.94][para (1.513e-005s)]]][[perf gcc-4_3_2-dist-gam-dcd-quantile..[para *1.00*][para (2.179e-006s)]]]]
[[__hypergeometric_distrib CDF][[perf gcc-4_3_2-dist-hypergeometric-cdf..[para 2.20[footnote This result is somewhat misleading: for small values of the parameters there is virtually no difference between the two libraries, but for large values the Boost implementation is /much/ slower, albeit with much improved precision.]][para (3.522e-007s)]]][[perf gcc-4_3_2-dist-hypergeo-R-cdf..[para *1.00*][para (1.601e-007s)]]][NA]]
-[[__hypergeometric_distrib Quantile][[perf gcc-4_3_2-dist-hypergeometric-quantile..[para *1.00*][para (8.279e-007s)]]][[perf gcc-4_3_2-dist-hypergeo-R-quantile..[para 2.57][para (2.125e-006s)]]][NA]]
+[[__hypergeometric_distrib Quantile][[perf gcc-4_3_2-dist-hypergeometric-quantile..[para *1.00*][para (8.279e-007s)]]][[perf gcc-4_3_2-dist-hypergeo-R-quantile..[para 2.57][para (2.125e-006s)]]][NA]]
[[__logistic_distrib CDF][[perf gcc-4_3_2-dist-logistic-cdf..[para *1.00*][para (9.398e-008s)]]][[perf gcc-4_3_2-dist-logis-R-cdf..[para 2.75][para (2.588e-007s)]]][NA]]
-[[__logistic_distrib Quantile][[perf gcc-4_3_2-dist-logistic-quantile..[para *1.00*][para (9.893e-008s)]]][[perf gcc-4_3_2-dist-logis-R-quantile..[para 1.30][para (1.285e-007s)]]][NA]]
+[[__logistic_distrib Quantile][[perf gcc-4_3_2-dist-logistic-quantile..[para *1.00*][para (9.893e-008s)]]][[perf gcc-4_3_2-dist-logis-R-quantile..[para 1.30][para (1.285e-007s)]]][NA]]
[[__lognormal_distrib CDF][[perf gcc-4_3_2-dist-lognormal-cdf..[para *1.00*][para (1.831e-007s)]]][[perf gcc-4_3_2-dist-lnorm-R-cdf..[para 1.39][para (2.539e-007s)]]][NA]]
[[__lognormal_distrib Quantile][[perf gcc-4_3_2-dist-lognormal-quantile..[para 1.10][para (5.551e-007s)]]][[perf gcc-4_3_2-dist-lnorm-R-quantile..[para *1.00*][para (5.037e-007s)]]][NA]]
@@ -425,26 +424,26 @@
[section:perf_test_app The Performance Test Application]
-Under ['boost-path]\/libs\/math\/performance you will find a
+Under ['boost-path]\/libs\/math\/performance you will find a
(fairly rudimentary) performance test application for this library.
To run this application yourself, build the all the .cpp files in
['boost-path]\/libs\/math\/performance into an application using
your usual release-build settings. Run the application with --help
-to see a full list of options, or with --all to test everything
-(which takes quite a while), or with --tune to test the
+to see a full list of options, or with --all to test everything
+(which takes quite a while), or with --tune to test the
[link math_toolkit.perf.tuning available performance tuning options].
If you want to use this application to test the effect of changing
-any of the __policy_section, then you will need to build and run it twice:
-once with the default __policy_section, and then a second time with the
+any of the __policy_section, then you will need to build and run it twice:
+once with the default __policy_section, and then a second time with the
__policy_section you want to test set as the default.
[endsect]
[endsect]
-[/
+[/
Copyright 2006 John Maddock and Paul A. Bristow.
Distributed under the Boost Software License, Version 1.0.
(See accompanying file LICENSE_1_0.txt or copy at
Modified: branches/release/libs/math/doc/sf_and_dist/powers.qbk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/powers.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/powers.qbk 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -1,4 +1,58 @@
-[section:powers Logs, Powers, Roots and Exponentials]
+[section:powers Basic Functions]
+
+[section:sin_pi sin_pi]
+
+``
+#include <boost/math/special_functions/sin_pi.hpp>
+``
+
+ namespace boost{ namespace math{
+
+ template <class T>
+ ``__sf_result`` sin_pi(T x);
+
+ template <class T, class ``__Policy``>
+ ``__sf_result`` sin_pi(T x, const ``__Policy``&);
+
+ }} // namespaces
+
+Returns the sine of ['[pi]x].
+
+The return type of this function is computed using the __arg_pomotion_rules:
+the return is `double` when /x/ is an integer type and T otherwise.
+
+[optional_policy]
+
+This function performs exact all-integer arithmetic argument reduction before computing the sine of ['[pi]x].
+
+[endsect]
+
+[section:cos_pi cos_pi]
+
+``
+#include <boost/math/special_functions/cos_pi.hpp>
+``
+
+ namespace boost{ namespace math{
+
+ template <class T>
+ ``__sf_result`` cos_pi(T x);
+
+ template <class T, class ``__Policy``>
+ ``__sf_result`` cos_pi(T x, const ``__Policy``&);
+
+ }} // namespaces
+
+Returns the cosine of ['[pi]x].
+
+The return type of this function is computed using the __arg_pomotion_rules:
+the return is `double` when /x/ is an integer type and T otherwise.
+
+[optional_policy]
+
+This function performs exact all-integer arithmetic argument reduction before computing the cosine of ['[pi]x].
+
+[endsect]
[section:log1p log1p]
Modified: branches/release/libs/math/doc/sf_and_dist/references.qbk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/references.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/references.qbk 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -10,12 +10,12 @@
Abramowitz and Stegun's Handbook of Mathematical Functions (often called simply A&S),
M. Abramowitz and I. A. Stegun (Eds.) (1964)
-Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables,
+Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables,
National Bureau of Standards Applied Mathematics Series,
U.S. Government Printing Office, Washington, D.C.
+[/ __Abramowitz_Stegun]
NIST Handbook of Mathematical Functions
-
Edited by: Frank W. J. Olver, University of Maryland and National Institute of Standards and Technology, Maryland,
Daniel W. Lozier, National Institute of Standards and Technology, Maryland,
Ronald F. Boisvert, National Institute of Standards and Technology, Maryland,
@@ -48,8 +48,8 @@
We found (and used to create cross-check spot values - as far as their accuracy allowed).
[@http://functions.wolfram.com/ The Wolfram Functions Site]
-The Wolfram Functions Site - Providing
-the mathematical and scientific community with the world's largest
+The Wolfram Functions Site - Providing
+the mathematical and scientific community with the world's largest
(and most authorititive) collection of formulas and graphics about mathematical functions.
[@http://www.moshier.net/cephes28.zip 100-decimal digit calculator] provided some spot values.
@@ -95,7 +95,7 @@
Jim Albert, Bayesian Computation with R, ISBN 978-0-387-71384-7.
-[@http://www.quantnet.com/cplusplus-statistical-distributions-boost
+[@http://www.quantnet.com/cplusplus-statistical-distributions-boost
C++ Statistical Distributions in Boost - QuantNetwork forum]
discusses using Boost.Math in finance.
@@ -106,7 +106,7 @@
discusses application of Boost.Math, especially in finance.]
[endsect] [/section:references References]
-[/
+[/
Copyright 2006 John Maddock and Paul A. Bristow.
Distributed under the Boost Software License, Version 1.0.
(See accompanying file LICENSE_1_0.txt or copy at
Modified: branches/release/libs/math/doc/sf_and_dist/result_type_calc.qbk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/result_type_calc.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/result_type_calc.qbk 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -9,19 +9,19 @@
foo(1.0f, 2);
foo(1.0, 2L);
-etc, are all valid calls, as long as "foo" is a function taking two
+etc, are all valid calls, as long as "foo" is a function taking two
floating-point arguments. But that leaves the question:
[blurb ['"Given a special function with N arguments of
types T1, T2, T3 ... TN, then what type is the result?"]]
-[*If all the arguments are of the same (floating point) type then the
+[*If all the arguments are of the same (floating point) type then the
result is the same type as the arguments.]
Otherwise, the type of the result
is computed using the following logic:
-# Any arguments that are not template arguments are disregarded from
+# Any arguments that are not template arguments are disregarded from
further analysis.
# For each type in the argument list, if that type is an integer type
then it is treated as if it were of type double for the purposes of
@@ -36,49 +36,49 @@
# Otherwise the result is of type `float`.
For example:
-
+
cyl_bessel(2, 3.0);
-
+
Returns a `double` result, as does:
cyl_bessel(2, 3.0f);
-
+
as in this case the integer first argument is treated as a `double` and takes
precedence over the `float` second argument. To get a `float` result we would need
all the arguments to be of type float:
cyl_bessel_j(2.0f, 3.0f);
-
+
When one or more of the arguments is not a template argument then it
doesn't effect the return type at all, for example:
sph_bessel(2, 3.0f);
-
+
returns a `float`, since the first argument is not a template argument and
so doesn't effect the result: without this rule functions that take
explicitly integer arguments could never return `float`.
-And for user defined types, all of the following return an NTL::RR result:
+And for user-defined types, all of the following return an `NTL::RR` result:
cyl_bessel_j(0, NTL::RR(2));
-
+
cyl_bessel_j(NTL::RR(2), 3);
-
+
cyl_bessel_j(NTL::quad_float(2), NTL::RR(3));
-
-In the last case, quad_float is convertible to RR, but not vice-versa, so
-the result will be an NTL::RR. Note that this assumes that you are using
-a [link math_toolkit.using_udt.use_ntl patched NTL library].
-These rules are chosen to be compatible with the behaviour of
+In the last case, `quad_float` is convertible to `RR`, but not vice-versa, so
+the result will be an `NTL::RR`. Note that this assumes that you are using
+a [link math_toolkit.using_udt.high_precision.use_ntl patched NTL library].
+
+These rules are chosen to be compatible with the behaviour of
['ISO/IEC 9899:1999 Programming languages - C]
and with the
[@http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2005/n1836.pdf Draft Technical Report on C++ Library Extensions, 2005-06-24, section 5.2.1, paragraph 5].
[endsect]
-[/
- Copyright 2006 John Maddock and Paul A. Bristow.
+[/
+ Copyright 2006, 2012 John Maddock and Paul A. Bristow.
Distributed under 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).
Modified: branches/release/libs/math/doc/sf_and_dist/roadmap.qbk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/roadmap.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/roadmap.qbk 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -6,6 +6,22 @@
All bug reports including closed ones can be viewed
[@https://svn.boost.org/trac/boost/query?status=assigned&status=closed&status=new&status=reopened&component=math&col=id&col=summary&col=status&col=type&col=milestone&col=component&order=priority here].
+[h4 Boost-1.54]
+
+* Added many references to Boost.Multiprecision and `cpp_dec_float_50` as an example of a User-defined Type (UDT).
+* Added Clang to list of supported compilers.
+* Fixed constants to use a thread-safe cache of computed values when used at arbitrary precision.
+* Added finding zeros of Bessel functions `cyl_bessel_j_zero`, `cyl_neumann_zero`, `air_ai_zeros` and `air_bi_zeros`(by Christopher Kormanyos).
+* More accuracy improvements to the Bessel J and Y functions from Rocco Romeo.
+* Fixed nasty cyclic dependency bug that caused some headers to not compile [@https://svn.boost.org/trac/boost/ticket/7999 #7999].
+* Fixed bug in __tgamma that caused spurious overflow for arguments between 142.5 and 143.
+* Fixed bug in raise_rounding_error that caused it to return an incorrect result when throwing an exception is turned off [@https://svn.boost.org/trac/boost/ticket/7905 #7905].
+* Added minimal __float128 support.
+* Fixed bug in edge-cases of poisson quantile [@https://svn.boost.org/trac/boost/ticket/8308 #8308].
+* Adjusted heuristics used in Halley iteration to cope with inverting the incomplete beta in tricky regions
+where the derivative is flatlining. Example is computing the quantile of the Fisher F distribution for probabilities
+smaller than machine epsilon. See ticket [@https://svn.boost.org/trac/boost/ticket/8314 #8314].
+
[h4 Boost-1.53]
* Fixed issues [@https://svn.boost.org/trac/boost/ticket/7325 #7325], [@https://svn.boost.org/trac/boost/ticket/7415 #7415]
@@ -15,9 +31,10 @@
[@https://svn.boost.org/trac/boost/ticket/7891 #7891], [@https://svn.boost.org/trac/boost/ticket/7429 #7429].
* Fixed mistake in calculating pooled standard deviation in two-sample students t example
[@https://svn.boost.org/trac/boost/ticket/7402 #7402].
-* Improve complex acos/asin/atan, see [@https://svn.boost.org/trac/boost/ticket/7290 #7290],
+* Improve complex acos/asin/atan, see [@https://svn.boost.org/trac/boost/ticket/7290 #7290],
[@https://svn.boost.org/trac/boost/ticket/7291 #7291].
* Improve accuracy in some corner cases of __cyl_bessel_j and __gamma_p/__gamma_q thanks to suggestions from Rocco Romeo.
+* Improve accuracy of Bessel J and Y for integer orders thanks to suggestions from Rocco Romeo.
[h4 Boost-1.52]
@@ -243,7 +260,7 @@
]
[/
- Copyright 2006 - 2010 John Maddock and Paul A. Bristow.
+ Copyright 2006 - 2013 John Maddock and Paul A. Bristow.
Distributed under 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).
Modified: branches/release/libs/math/doc/sf_and_dist/roots.qbk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/roots.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/roots.qbk 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -1,4 +1,4 @@
-[section:roots Root Finding With Derivatives: Newton-Raphson, Halley & Schroeder]
+ [section:roots Root Finding With Derivatives: Newton-Raphson, Halley & Schroeder]
[h4 Synopsis]
@@ -6,35 +6,35 @@
#include <boost/math/tools/roots.hpp>
``
- namespace boost{ namespace math{
+ namespace boost{ namespace math{
namespace tools{
-
+
template <class F, class T>
T newton_raphson_iterate(F f, T guess, T min, T max, int digits);
-
+
template <class F, class T>
T newton_raphson_iterate(F f, T guess, T min, T max, int digits, boost::uintmax_t& max_iter);
-
+
template <class F, class T>
T halley_iterate(F f, T guess, T min, T max, int digits);
-
+
template <class F, class T>
T halley_iterate(F f, T guess, T min, T max, int digits, boost::uintmax_t& max_iter);
-
+
template <class F, class T>
T schroeder_iterate(F f, T guess, T min, T max, int digits);
-
+
template <class F, class T>
T schroeder_iterate(F f, T guess, T min, T max, int digits, boost::uintmax_t& max_iter);
-
+
}}} // namespaces
[h4 Description]
These functions all perform iterative root finding using derivatives:
-* `newton_raphson_iterate`performs second order
-[link newton Newton-Raphson iteration],
+* `newton_raphson_iterate` performs second order
+[link newton Newton-Raphson iteration],
* `halley_iterate` and`schroeder_iterate` perform third order
[link halley Halley] and [link schroeder Schroeder] iteration.
@@ -42,15 +42,15 @@
The functions all take the same parameters:
[variablelist Parameters of the root finding functions
-[[F f] [Type F must be a callable function object that accepts one parameter and
+[[F f] [Type F must be a callable function object that accepts one parameter and
returns a __tuple:
-
+
For the second order iterative methods ([@http://en.wikipedia.org/wiki/Newton_Raphson Newton Raphson])
the __tuple should have *two* elements containing the evaluation
of the function and its first derivative.
-
+
For the third order methods
-([@http://en.wikipedia.org/wiki/Halley%27s_method Halley] and
+([@http://en.wikipedia.org/wiki/Halley%27s_method Halley] and
Schroeder)
the __tuple should have *three* elements containing the evaluation of
the function and its first and second derivatives.]]
@@ -78,22 +78,22 @@
A large first derivative leads to a very small next step, triggering the termination
condition. Derivative based iteration may not be appropriate in such cases.
* If the function is 'Really Well Behaved' (monotonic and has only one root)
-the bracket bounds min and max may as well be set to the widest limits
-like zero and `numeric_limits<T>::max()`.
+the bracket bounds min and max may as well be set to the widest limits
+like zero and `numeric_limits<T>::max()`.
*But if the function more complex and may have more than one root or a pole,
the choice of bounds is protection against jumping out to seek the 'wrong' root.
* These functions fall back to bisection if the next computed step would take the
next value out of bounds. The bounds are updated after each step to ensure this leads
to convergence. However, a good initial guess backed up by asymptotically-tight
bounds will improve performance no end - rather than relying on bisection.
-* The value of /digits/ is crucial to good performance of these functions,
+* The value of /digits/ is crucial to good performance of these functions,
if it is set too high then at best you will get one extra (unnecessary)
iteration, and at worst the last few steps will proceed by bisection.
Remember that the returned value can never be more accurate than f(x) can be
evaluated, and that if f(x) suffers from cancellation errors as it
tends to zero then the computed steps will be effectively random. The
value of /digits/ should be set so that iteration terminates before this point:
-remember that for second and third order methods the number of correct
+remember that for second and third order methods the number of correct
digits in the result is increasing quite
substantially with each iteration, /digits/ should be set by experiment so that the final
iteration just takes the next value into the zone where f(x) becomes inaccurate.
@@ -196,11 +196,11 @@
return newton_raphson_iterate(detail::cbrt_functor<T>(z), guess, min, max, digits);
}
-Using the test data in libs/math/test/cbrt_test.cpp this found the cube root
+Using the test data in `libs/math/test/cbrt_test.cpp` this found the cube root
exact to the last digit in every case, and in no more than 6 iterations at double
-precision. However, you will note that a high precision was used in this
+precision. However, you will note that a high precision was used in this
example, exactly what was warned against earlier on in these docs! In this
-particular case it is possible to compute f(x) exactly and without undue
+particular case it is possible to compute f(x) exactly and without undue
cancellation error, so a high limit is not too much of an issue. However,
reducing the limit to `std::numeric_limits<T>::digits * 2 / 3` gave full
precision in all but one of the test cases (and that one was out by just one bit).
@@ -210,7 +210,7 @@
and reusing it, omits error handling, and does not handle
negative values of z correctly. (These are left as an exercise for the reader!)
-The boost::math::cbrt function also includes these and other improvements.
+The `boost::math::cbrt` function also includes these and other improvements.
Now let's adapt the functor slightly to return the second derivative as well:
@@ -221,7 +221,7 @@
``__tuple``<T, T, T> operator()(T const& z)
{
return boost::math::make_tuple(
- z*z*z - a,
+ z*z*z - a,
3 * z*z,
6 * z);
}
@@ -247,7 +247,7 @@
}
Note that the iterations are set to stop at just one-half of full precision,
-and yet, even so, not one of the test cases had a single bit wrong.
+and yet, even so, not one of the test cases had a single bit wrong.
What's more, the maximum number of iterations was now just 4.
Just to complete the picture, we could have called `schroeder_iterate` in the last
@@ -257,10 +257,10 @@
guess can be computed. There appear to be no generalisations that can be made
except "try them and see".
-Finally, had we called cbrt with [@http://shoup.net/ntl/doc/RR.txt NTL::RR]
+Finally, had we called `cbrt` with [@http://shoup.net/ntl/doc/RR.txt NTL::RR]
set to 1000 bit precision, then full precision can be obtained with just 7 iterations.
To put that in perspective,
-an increase in precision by a factor of 20, has less than doubled the number of
+an increase in precision by a factor of 20, has less than doubled the number of
iterations. That just goes to emphasise that most of the iterations are used
up getting the first few digits correct: after that these methods can churn out
further digits with remarkable efficiency.
@@ -269,8 +269,8 @@
[endsect] [/section:roots Root Finding With Derivatives]
-[/
- Copyright 2006, 2010 John Maddock and Paul A. Bristow.
+[/
+ Copyright 2006, 2010, 2012 John Maddock and Paul A. Bristow.
Distributed under 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).
Modified: branches/release/libs/math/doc/sf_and_dist/sign.qbk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/sign.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/sign.qbk 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -12,13 +12,13 @@
int signbit(T x);
template <class T>
- inline int sign (const T& z);
+ int sign (const T& z);
- template <class T>
- inline T copysign (const T& x, const T& y);
+ template <class T, class U>
+ T copysign (const T& x, const U& y);
template <class T>
- inline T changesign (const T& z);
+ ``__sf_result`` changesign (const T& z);
}} // namespaces
@@ -32,12 +32,12 @@
[important The return value from this function is zero or /not-zero/ and [*not] zero or one.]
template <class T>
- inline int sign (const T& z);
+ int sign (const T& z);
Returns `1` if /x/ `> 0`, `-1` if /x/ `< 0`, and `0` if /x/ is zero.
- template <class T>
- inline T copysign (const T& x, const T& y);
+ template <class T, class U>
+ ``__sf_result`` copysign (const T& x, const U& y);
Sets the sign of /x/ to be the same as the sign of /y/.
@@ -45,7 +45,7 @@
for more detail.
template <class T>
- inline T changesign (const T& z);
+ T changesign (const T& z);
Returns a floating point number with a binary representation
where the signbit is the opposite of the sign bit in /x/,
Modified: branches/release/libs/math/doc/sf_and_dist/spherical_harmonic.qbk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/spherical_harmonic.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/spherical_harmonic.qbk 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -3,7 +3,7 @@
[h4 Synopsis]
``
-#include <boost/math/special_functions/spheric_harmonic.hpp>
+#include <boost/math/special_functions/spherical_harmonic.hpp>
``
namespace boost{ namespace math{
Modified: branches/release/libs/math/example/Jamfile.v2
==============================================================================
--- branches/release/libs/math/example/Jamfile.v2 (original)
+++ branches/release/libs/math/example/Jamfile.v2 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -32,7 +32,13 @@
# because serialization library is built with MS extensions enabled (default).
<include>../../..
;
+
+# run bessel_zeros_example.cpp ; # Now split into four examples.
+run bessel_zeros_example_1.cpp ;
+run bessel_zeros_interator_example.cpp ;
+run neumann_zeros_example_1.cpp ;
+run test_cpp_float_close_fraction.cpp ../../test/build//boost_unit_test_framework/<link>static ;
run binomial_coinflip_example.cpp ;
run binomial_confidence_limits.cpp ;
run binomial_example_nag.cpp ;
Modified: branches/release/libs/math/example/constants_eg1.cpp
==============================================================================
--- branches/release/libs/math/example/constants_eg1.cpp (original)
+++ branches/release/libs/math/example/constants_eg1.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -1,4 +1,4 @@
-// Copyright Paul Bristow 2012.
+// Copyright Paul Bristow 2013.
// Copyright John Maddock 2010.
// Use, modification and distribution are subject to the
@@ -42,14 +42,20 @@
int main()
{
-
+
{ // Boost.Math constants using function calls like pi().
// using namespace boost::math::constants;
-
+
using boost::math::constants::pi;
using boost::math::constants::one_div_two_pi;
- cout.precision(numeric_limits<double>::max_digits10);
+#ifdef BOOST_NO_CXX11_NUMERIC_LIMITS
+ std::size_t max_digits10 = 2 + std::numeric_limits<double>::digits * 3010/10000;
+#else
+ std::size_t max_digits10 = std::numeric_limits<double>::max_digits10;
+#endif
+
+ std::cout.precision(max_digits10);
cout << "double pi = boost::math::double_constants::pi = " << pi<double>() << endl;
// double pi = boost::math::double_constants::pi = 3.1415926535897931
double r = 1.234567890123456789;
@@ -63,7 +69,7 @@
cout << "pidf = boost::math::constants::pi() = " << pif << endl;
// pidf = boost::math::float_constants::pi = 3.1415927410125732
- //float df = pi * rf * rf; // conversion from 'const double' to 'float', possible loss of data
+ //float df = pi * rf * rf; // conversion from 'const double' to 'float', possible loss of data.
float df = pif * rf * rf;
cout << "df = " << df << ", rf = " << rf << endl;
@@ -83,7 +89,7 @@
double my2pi = two_pi; // Uses boost::math::double_constants::two_pi;
cout << "double my2pi = " << my2pi << endl;
-
+
using boost::math::float_constants::e;
float my_e = e;
cout << "float my_e " << my_e << endl;
@@ -94,7 +100,7 @@
// If you try to use two namespaces, this may, of course, create ambiguity:
// it is not too difficult to do this inadvertently.
using namespace boost::math::float_constants;
- //cout << pi << endl; // error C2872: 'pi' : ambiguous symbol
+ //cout << pi << endl; // error C2872: 'pi' : ambiguous symbol.
}
{
@@ -138,7 +144,7 @@
// For example, naively providing an @b integer instead of a floating-point type can be disastrous.
// cout << "Area = " << area(2) << endl; // warning : 'return' : conversion from 'double' to 'int', possible loss of data
// Failure to heed this warning can lead to very wrong answers!
- // Area = 12 !! = 3 * 2 * 2
+ // Area = 12 !! = 3 * 2 * 2
//[math_constants_template_integer_type
//cout << "Area = " << area(2) << endl; // Area = 12!
cout << "Area = " << area(2.) << endl; // Area = 12.566371
@@ -150,13 +156,15 @@
}
- {
+/*
+{
using boost::math::constants::pi;
- double my_pi3 = pi<double>();
+ //double my_pi3 = pi<double>(); // OK
//double my_pi4 = pi<>(); cannot find template type.
- //double my_pi4 = pi();
+ //double my_pi4 = pi(); // Can't find a function.
}
+*/
} // int main()
Modified: branches/release/libs/math/example/distribution_construction.cpp
==============================================================================
--- branches/release/libs/math/example/distribution_construction.cpp (original)
+++ branches/release/libs/math/example/distribution_construction.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -1,6 +1,6 @@
// distribution_construction.cpp
-// Copyright Paul A. Bristow 2007, 2010.
+// Copyright Paul A. Bristow 2007, 2010, 2012.
// Use, modification and distribution are subject to the
// Boost Software License, Version 1.0.
@@ -10,21 +10,30 @@
// Caution: this file contains Quickbook markup as well as code
// and comments, don't change any of the special comment markups!
-//[distribution_construction1
+#ifdef _MSC_VER
+# pragma warning (disable : 4996) // disable -D_SCL_SECURE_NO_WARNINGS C++ 'Checked Iterators'
+#endif
-/*`
+#include <iostream>
+#include <exception>
+
+//[distribution_construction_1
+/*`
The structure of distributions is rather different from some other statistical libraries,
-for example in less object-oriented language like FORTRAN and C,
-that provide a few arguments to each free function.
-This library provides each distribution as a template C++ class.
+for example, those written in less object-oriented language like FORTRAN and C:
+these provide a few arguments to each free function.
+
+Boost.Math library provides each distribution as a template C++ class.
A distribution is constructed with a few arguments, and then
member and non-member functions are used to find values of the
distribution, often a function of a random variate.
-First we need some includes to access the negative binomial distribution
-(and the binomial, beta and gamma too).
+For this demonstration, first we need some includes to access the
+negative binomial distribution (and the binomial, beta and gamma distributions too).
+To demonstrate the use with a high precision User-defined floating-point type
+`cpp_dec_float` we also need an include from Boost.Multiprecision.
*/
#include <boost/math/distributions/negative_binomial.hpp> // for negative_binomial_distribution
@@ -34,14 +43,18 @@
#include <boost/math/distributions/beta.hpp> // for beta_distribution.
#include <boost/math/distributions/gamma.hpp> // for gamma_distribution.
#include <boost/math/distributions/normal.hpp> // for normal_distribution.
+
+#include <boost/multiprecision/cpp_dec_float.hpp> // for cpp_dec_float_100
/*`
Several examples of constructing distributions follow:
*/
-//] [/distribution_construction1 end of Quickbook in C++ markup]
+//] [/distribution_construction_1 end of Quickbook in C++ markup]
int main()
{
-//[distribution_construction2
+ try
+ {
+//[distribution_construction_2
/*`
First, a negative binomial distribution with 8 successes
and a success fraction 0.25, 25% or 1 in 4, is constructed like this:
@@ -52,29 +65,29 @@
*/
using namespace boost::math;
/*`
- but this might risk ambiguity with names in std random so
- *much better is explicit `using boost::math:: ` * ... statements like
+ but this might risk ambiguity with names in `std random` so
+ [*much] better is explicit `using boost::math::` statements, for example:
*/
using boost::math::negative_binomial_distribution;
/*`
and we can still reduce typing.
- Since the vast majority of applications use will be using double precision,
- the template argument to the distribution (RealType) defaults
- to type double, so we can also write:
+ Since the vast majority of applications use will be using `double` precision,
+ the template argument to the distribution (`RealType`) defaults
+ to type `double`, so we can also write:
*/
- negative_binomial_distribution<> mydist9(8., 0.25); // Uses default RealType = double.
+ negative_binomial_distribution<> mydist9(8., 0.25); // Uses default `RealType = double`.
/*`
- But the name "negative_binomial_distribution" is still inconveniently long,
- so for most distributions, a convenience typedef is provided, for example:
+ But the name `negative_binomial_distribution` is still inconveniently long,
+ so, for most distributions, a convenience `typedef` is provided, for example:
typedef negative_binomial_distribution<double> negative_binomial; // Reserved name of type double.
[caution
- This convenience typedef is /not/ provided if a clash would occur
- with the name of a function: currently only "beta" and "gamma"
+ This convenience typedef is [*not provided] if a clash would occur
+ with the name of a function: currently only `beta` and `gamma`
fall into this category.
]
@@ -138,13 +151,13 @@
We can, of course, still provide the type explicitly thus:
*/
- // Explicit double precision:
+ // Explicit double precision: both arguments are double:
negative_binomial_distribution<double> mydist1(8., 0.25);
// Explicit float precision, double arguments are truncated to float:
negative_binomial_distribution<float> mydist2(8., 0.25);
- // Explicit float precision, integer & double arguments converted to float.
+ // Explicit float precision, integer & double arguments converted to float:
negative_binomial_distribution<float> mydist3(8, 0.25);
// Explicit float precision, float arguments, so no conversion:
@@ -160,40 +173,106 @@
negative_binomial_distribution<long double> mydist7(8., 0.25);
/*`
- And if you have your own RealType called MyFPType,
- for example NTL RR (an arbitrary precision type), then we can write:
+ And you can use your own RealType,
+ for example, `boost::math::cpp_dec_float_50` (an arbitrary 50 decimal digits precision type),
+ then we can write:
+ */
+ using namespace boost::multiprecision;
+
+ negative_binomial_distribution<cpp_dec_float_50> mydist8(8, 0.25);
+ // `integer` arguments are promoted to your RealType exactly, but
+ // `double` argument are converted to RealType,
+ // possibly losing precision, so don't write:
+
+ negative_binomial_distribution<cpp_dec_float_50> mydist20(8, 0.23456789012345678901234567890);
+ // to avoid truncation of second parameter to `0.2345678901234567`.
- negative_binomial_distribution<MyFPType> mydist6(8, 1); // Integer arguments -> MyFPType.
+ negative_binomial_distribution<cpp_dec_float_50> mydist21(8, cpp_dec_float_50("0.23456789012345678901234567890") );
- [heading Default arguments to distribution constructors.]
+ // Ensure that all potentially significant digits are shown.
+ std::cout.precision(std::numeric_limits<cpp_dec_float_50>::digits10);
+ cpp_dec_float_50 x("1.23456789012345678901234567890");
+ std::cout << pdf(mydist8, x) << std::endl;
+/*` showing 0.00012630010495970320103876754721976419438231705359935
- Note that default constructor arguments are only provided for some distributions.
- So if you wrongly assume a default argument you will get an error message, for example:
+[warning When using multiprecision, it is all too easy to get accidental truncation!]
- negative_binomial_distribution<> mydist8;
+For example, if you write
+*/
+ std::cout << pdf(mydist8, 1.23456789012345678901234567890) << std::endl;
+/*`
+showing 0.00012630010495970318465064569310967179576805651692929,
+which is wrong at about the 17th decimal digit!
- [pre error C2512 no appropriate default constructor available.]
+This is because the value provided is truncated to a `double`, effectively
+ `double x = 1.23456789012345678901234567890;`
- No default constructors are provided for the negative binomial,
- because it is difficult to chose any sensible default values for this distribution.
- For other distributions, like the normal distribution,
- it is obviously very useful to provide 'standard'
- defaults for the mean and standard deviation thus:
+Then the now `double x` is passed to function `pdf`,
+and this truncated `double` value is finally promoted to `cpp_dec_float_50`.
- normal_distribution(RealType mean = 0, RealType sd = 1);
+Another way of quietly getting the wrong answer is to write:
+*/
+ std::cout << pdf(mydist8, cpp_dec_float_50(1.23456789012345678901234567890)) << std::endl;
+/*`
+A correct way from a multi-digit string value is
+*/
+ std::cout << pdf(mydist8, cpp_dec_float_50("1.23456789012345678901234567890")) << std::endl;
+/*`
- So in this case we can write:
- */
+[tip Getting about 17 decimal digits followed by many zeros is often a sign of accidental truncation.]
+*/
+
+/*`
+[h4 Default arguments to distribution constructors.]
+
+Note that default constructor arguments are only provided for some distributions.
+So if you wrongly assume a default argument, you will get an error message, for example:
+
+ negative_binomial_distribution<> mydist8;
+
+[pre error C2512 no appropriate default constructor available.]
+
+No default constructors are provided for the `negative binomial` distribution,
+because it is difficult to chose any sensible default values for this distribution.
+
+For other distributions, like the normal distribution,
+it is obviously very useful to provide 'standard'
+defaults for the mean (zero) and standard deviation (unity) thus:
+
+ normal_distribution(RealType mean = 0, RealType sd = 1);
+
+So in this case we can write:
+*/
using boost::math::normal;
normal norm1; // Standard normal distribution.
normal norm2(2); // Mean = 2, std deviation = 1.
normal norm3(2, 3); // Mean = 2, std deviation = 3.
+ }
+ catch(std::exception &ex)
+ {
+ std::cout << ex.what() << std::endl;
+ }
+
return 0;
} // int main()
-/*`There is no useful output from this program, of course. */
+/*`There is no useful output from this demonstration program, of course. */
+
+//] [/end of distribution_construction_2]
+
+/*
+//[distribution_construction_output
+
+ 0.00012630010495970320103876754721976419438231705359935
+ 0.00012630010495970318465064569310967179576805651692929
+ 0.00012630010495970318465064569310967179576805651692929
+ 0.00012630010495970320103876754721976419438231705359935
+
+//] [/distribution_construction_output]
+
+*/
+
-//] [/end of distribution_construction2]
Modified: branches/release/libs/math/minimax/main.cpp
==============================================================================
--- branches/release/libs/math/minimax/main.cpp (original)
+++ branches/release/libs/math/minimax/main.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -20,7 +20,7 @@
#include <iostream>
#include <iomanip>
#include <string>
-#include <boost/test/included/test_exec_monitor.hpp> // for test_main
+#include <boost/test/included/unit_test.hpp> // for test_main
extern boost::math::ntl::RR f(const boost::math::ntl::RR& x, int variant);
extern void show_extra(
@@ -497,7 +497,7 @@
}
}
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
std::string line;
real_parser<long double/*boost::math::ntl::RR*/ > const rr_p;
@@ -604,5 +604,4 @@
std::cout << std::endl;
}
}
- return 0;
}
Modified: branches/release/libs/math/test/Jamfile.v2
==============================================================================
--- branches/release/libs/math/test/Jamfile.v2 (original)
+++ branches/release/libs/math/test/Jamfile.v2 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -66,551 +66,552 @@
explicit ntl ;
-cpp-pch pch : pch.hpp : <use>../../test/build//boost_test_exec_monitor ;
-cpp-pch pch_light : pch_light.hpp : <use>../../test/build//boost_test_exec_monitor ;
+cpp-pch pch : pch.hpp : <use>../../test/build//boost_unit_test_framework ;
+cpp-pch pch_light : pch_light.hpp : <use>../../test/build//boost_unit_test_framework ;
-lib test_instances : float_test_instances.cpp double_test_instances.cpp ldouble_test_instances.cpp real_concept_test_instances.cpp pch
- : <link>static ;
+#lib test_instances : float_test_instances.cpp double_test_instances.cpp ldouble_test_instances.cpp real_concept_test_instances.cpp pch
+# : <link>static ;
-run hypot_test.cpp test_instances pch_light ../../test/build//boost_test_exec_monitor ;
-run pow_test.cpp ../../test/build//boost_test_exec_monitor ;
-run log1p_expm1_test.cpp test_instances pch_light ../../test/build//boost_test_exec_monitor ;
-run powm1_sqrtp1m1_test.cpp test_instances pch_light ../../test/build//boost_test_exec_monitor ;
+run hypot_test.cpp test_instances//test_instances pch_light ../../test/build//boost_unit_test_framework ;
+run pow_test.cpp ../../test/build//boost_unit_test_framework ;
+run log1p_expm1_test.cpp test_instances//test_instances pch_light ../../test/build//boost_unit_test_framework ;
+run powm1_sqrtp1m1_test.cpp test_instances//test_instances pch_light ../../test/build//boost_unit_test_framework ;
run special_functions_test.cpp ../../test/build//boost_unit_test_framework ;
-run test_airy.cpp test_instances pch_light ../../test/build//boost_test_exec_monitor ;
-run test_bernoulli.cpp ../../test/build//boost_test_exec_monitor ;
-run test_constants.cpp ../../test/build//boost_test_exec_monitor ;
+run test_airy.cpp test_instances//test_instances pch_light ../../test/build//boost_unit_test_framework ;
+run test_bernoulli.cpp ../../test/build//boost_unit_test_framework ;
+run test_constants.cpp ../../test/build//boost_unit_test_framework ;
run test_print_info_on_type.cpp ;
-run test_constant_generate.cpp ntl : : : [ check-target-builds ../config//has_ntl_rr : : <build>no ] : test_constant_generate_ntl ;
-run test_bessel_j.cpp test_instances pch_light ../../test/build//boost_test_exec_monitor ;
-run test_bessel_y.cpp test_instances pch_light ../../test/build//boost_test_exec_monitor ;
-run test_bessel_i.cpp test_instances pch_light ../../test/build//boost_test_exec_monitor ;
-run test_bessel_k.cpp test_instances pch_light ../../test/build//boost_test_exec_monitor ;
-run test_beta.cpp test_instances pch_light ../../test/build//boost_test_exec_monitor ;
-run test_beta_dist.cpp ../../test/build//boost_test_exec_monitor ;
-run test_binomial.cpp ../../test/build//boost_test_exec_monitor
+run test_constant_generate.cpp : : : release <define>USE_CPP_FLOAT=1 ;
+run test_bessel_j.cpp test_instances//test_instances pch_light ../../test/build//boost_unit_test_framework ;
+run test_bessel_y.cpp test_instances//test_instances pch_light ../../test/build//boost_unit_test_framework ;
+run test_bessel_i.cpp test_instances//test_instances pch_light ../../test/build//boost_unit_test_framework ;
+run test_bessel_k.cpp test_instances//test_instances pch_light ../../test/build//boost_unit_test_framework ;
+run test_beta.cpp test_instances//test_instances pch_light ../../test/build//boost_unit_test_framework ;
+run test_bessel_airy_zeros.cpp ../../test/build//boost_unit_test_framework ;
+run test_beta_dist.cpp ../../test/build//boost_unit_test_framework ;
+run test_binomial.cpp ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_FLOAT
- <toolset>intel:<pch>off
+ <define>TEST_FLOAT
+ <toolset>intel:<pch>off
: test_binomial_float ;
-run test_binomial.cpp ../../test/build//boost_test_exec_monitor
+run test_binomial.cpp ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_DOUBLE
- <toolset>intel:<pch>off
+ <define>TEST_DOUBLE
+ <toolset>intel:<pch>off
: test_binomial_double ;
-run test_binomial.cpp ../../test/build//boost_test_exec_monitor
+run test_binomial.cpp ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_LDOUBLE
- <toolset>intel:<pch>off
+ <define>TEST_LDOUBLE
+ <toolset>intel:<pch>off
: test_binomial_long_double ;
-run test_binomial.cpp ../../test/build//boost_test_exec_monitor
+run test_binomial.cpp ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_REAL_CONCEPT
- <define>TEST_ROUNDING=0
- <toolset>intel:<pch>off
+ <define>TEST_REAL_CONCEPT
+ <define>TEST_ROUNDING=0
+ <toolset>intel:<pch>off
: test_binomial_real_concept0 ;
-run test_binomial.cpp ../../test/build//boost_test_exec_monitor
+run test_binomial.cpp ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_REAL_CONCEPT
- <define>TEST_ROUNDING=1
- <toolset>intel:<pch>off
+ <define>TEST_REAL_CONCEPT
+ <define>TEST_ROUNDING=1
+ <toolset>intel:<pch>off
: test_binomial_real_concept1 ;
-run test_binomial.cpp ../../test/build//boost_test_exec_monitor
+run test_binomial.cpp ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_REAL_CONCEPT
- <define>TEST_ROUNDING=2
- <toolset>intel:<pch>off
+ <define>TEST_REAL_CONCEPT
+ <define>TEST_ROUNDING=2
+ <toolset>intel:<pch>off
: test_binomial_real_concept2 ;
-run test_binomial.cpp ../../test/build//boost_test_exec_monitor
+run test_binomial.cpp ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_REAL_CONCEPT
- <define>TEST_ROUNDING=3
- <toolset>intel:<pch>off
+ <define>TEST_REAL_CONCEPT
+ <define>TEST_ROUNDING=3
+ <toolset>intel:<pch>off
: test_binomial_real_concept3 ;
-run test_binomial.cpp ../../test/build//boost_test_exec_monitor
+run test_binomial.cpp ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_REAL_CONCEPT
- <define>TEST_ROUNDING=4
- <toolset>intel:<pch>off
+ <define>TEST_REAL_CONCEPT
+ <define>TEST_ROUNDING=4
+ <toolset>intel:<pch>off
: test_binomial_real_concept4 ;
-run test_binomial.cpp ../../test/build//boost_test_exec_monitor
+run test_binomial.cpp ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_REAL_CONCEPT
- <define>TEST_ROUNDING=5
- <toolset>intel:<pch>off
+ <define>TEST_REAL_CONCEPT
+ <define>TEST_ROUNDING=5
+ <toolset>intel:<pch>off
: test_binomial_real_concept5 ;
-run test_binomial.cpp ../../test/build//boost_test_exec_monitor
+run test_binomial.cpp ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_REAL_CONCEPT
- <define>TEST_ROUNDING=6
- <toolset>intel:<pch>off
+ <define>TEST_REAL_CONCEPT
+ <define>TEST_ROUNDING=6
+ <toolset>intel:<pch>off
: test_binomial_real_concept6 ;
-run test_binomial_coeff.cpp pch ../../test/build//boost_test_exec_monitor ;
-run test_carlson.cpp test_instances pch_light ../../test/build//boost_test_exec_monitor ;
-run test_cauchy.cpp ../../test/build//boost_test_exec_monitor ;
-run test_cbrt.cpp test_instances pch_light ../../test/build//boost_test_exec_monitor ;
-run test_chi_squared.cpp ../../test/build//boost_test_exec_monitor ;
-run test_classify.cpp pch ../../test/build//boost_test_exec_monitor ;
-run test_digamma.cpp test_instances pch_light ../../test/build//boost_test_exec_monitor ;
-run test_dist_overloads.cpp ../../test/build//boost_test_exec_monitor ;
-run test_ellint_1.cpp test_instances pch_light ../../test/build//boost_test_exec_monitor ;
-run test_ellint_2.cpp test_instances pch_light ../../test/build//boost_test_exec_monitor ;
-run test_ellint_3.cpp test_instances pch_light ../../test/build//boost_test_exec_monitor ;
-run test_erf.cpp test_instances pch_light ../../test/build//boost_test_exec_monitor ;
-run test_error_handling.cpp ../../test/build//boost_test_exec_monitor ;
-run test_expint.cpp test_instances pch_light ../../test/build//boost_test_exec_monitor ;
-run test_exponential_dist.cpp ../../test/build//boost_test_exec_monitor ;
-run test_extreme_value.cpp ../../test/build//boost_test_exec_monitor ;
-run test_factorials.cpp pch ../../test/build//boost_test_exec_monitor ;
-run test_find_location.cpp pch ../../test/build//boost_test_exec_monitor ;
-run test_find_scale.cpp pch ../../test/build//boost_test_exec_monitor ;
-run test_fisher_f.cpp ../../test/build//boost_test_exec_monitor ;
-run test_gamma.cpp test_instances pch_light ../../test/build//boost_test_exec_monitor ;
-run test_gamma_dist.cpp pch ../../test/build//boost_test_exec_monitor ;
-run test_geometric.cpp ../../test/build//boost_test_exec_monitor ;
-run test_hankel.cpp ../../test/build//boost_test_exec_monitor ;
-run test_hermite.cpp test_instances pch_light ../../test/build//boost_test_exec_monitor ;
-run test_hypergeometric_dist.cpp ../../test/build//boost_test_exec_monitor
+run test_binomial_coeff.cpp pch ../../test/build//boost_unit_test_framework ;
+run test_carlson.cpp test_instances//test_instances pch_light ../../test/build//boost_unit_test_framework ;
+run test_cauchy.cpp ../../test/build//boost_unit_test_framework ;
+run test_cbrt.cpp test_instances//test_instances pch_light ../../test/build//boost_unit_test_framework ;
+run test_chi_squared.cpp ../../test/build//boost_unit_test_framework ;
+run test_classify.cpp pch ../../test/build//boost_unit_test_framework ;
+run test_digamma.cpp test_instances//test_instances pch_light ../../test/build//boost_unit_test_framework ;
+run test_dist_overloads.cpp ../../test/build//boost_unit_test_framework ;
+run test_ellint_1.cpp test_instances//test_instances pch_light ../../test/build//boost_unit_test_framework ;
+run test_ellint_2.cpp test_instances//test_instances pch_light ../../test/build//boost_unit_test_framework ;
+run test_ellint_3.cpp test_instances//test_instances pch_light ../../test/build//boost_unit_test_framework ;
+run test_erf.cpp test_instances//test_instances pch_light ../../test/build//boost_unit_test_framework ;
+run test_error_handling.cpp ../../test/build//boost_unit_test_framework ;
+run test_expint.cpp test_instances//test_instances pch_light ../../test/build//boost_unit_test_framework ;
+run test_exponential_dist.cpp ../../test/build//boost_unit_test_framework ;
+run test_extreme_value.cpp ../../test/build//boost_unit_test_framework ;
+run test_factorials.cpp pch ../../test/build//boost_unit_test_framework ;
+run test_find_location.cpp pch ../../test/build//boost_unit_test_framework ;
+run test_find_scale.cpp pch ../../test/build//boost_unit_test_framework ;
+run test_fisher_f.cpp ../../test/build//boost_unit_test_framework ;
+run test_gamma.cpp test_instances//test_instances pch_light ../../test/build//boost_unit_test_framework ;
+run test_gamma_dist.cpp pch ../../test/build//boost_unit_test_framework ;
+run test_geometric.cpp ../../test/build//boost_unit_test_framework ;
+run test_hankel.cpp ../../test/build//boost_unit_test_framework ;
+run test_hermite.cpp test_instances//test_instances pch_light ../../test/build//boost_unit_test_framework ;
+run test_hypergeometric_dist.cpp ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_QUANT=0
- <toolset>intel:<pch>off
+ <define>TEST_QUANT=0
+ <toolset>intel:<pch>off
: test_hypergeometric_dist0 ;
-run test_hypergeometric_dist.cpp ../../test/build//boost_test_exec_monitor
+run test_hypergeometric_dist.cpp ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_QUANT=1
- <toolset>intel:<pch>off
+ <define>TEST_QUANT=1
+ <toolset>intel:<pch>off
: test_hypergeometric_dist1 ;
-run test_hypergeometric_dist.cpp ../../test/build//boost_test_exec_monitor
+run test_hypergeometric_dist.cpp ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_QUANT=2
- <toolset>intel:<pch>off
+ <define>TEST_QUANT=2
+ <toolset>intel:<pch>off
: test_hypergeometric_dist2 ;
-run test_hypergeometric_dist.cpp ../../test/build//boost_test_exec_monitor
+run test_hypergeometric_dist.cpp ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_QUANT=3
- <toolset>intel:<pch>off
+ <define>TEST_QUANT=3
+ <toolset>intel:<pch>off
: test_hypergeometric_dist3 ;
-run test_hypergeometric_dist.cpp ../../test/build//boost_test_exec_monitor
+run test_hypergeometric_dist.cpp ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_QUANT=4
- <toolset>intel:<pch>off
+ <define>TEST_QUANT=4
+ <toolset>intel:<pch>off
: test_hypergeometric_dist4 ;
-run test_hypergeometric_dist.cpp ../../test/build//boost_test_exec_monitor
+run test_hypergeometric_dist.cpp ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_QUANT=5
- <toolset>intel:<pch>off
+ <define>TEST_QUANT=5
+ <toolset>intel:<pch>off
: test_hypergeometric_dist5 ;
-run test_ibeta.cpp test_instances pch_light ../../test/build//boost_test_exec_monitor
+run test_ibeta.cpp test_instances//test_instances pch_light ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_FLOAT
- <toolset>intel:<pch>off
+ <define>TEST_FLOAT
+ <toolset>intel:<pch>off
: test_ibeta_float ;
-run test_ibeta.cpp test_instances pch_light ../../test/build//boost_test_exec_monitor
+run test_ibeta.cpp test_instances//test_instances pch_light ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_DOUBLE
- <toolset>intel:<pch>off
+ <define>TEST_DOUBLE
+ <toolset>intel:<pch>off
: test_ibeta_double ;
-run test_ibeta.cpp test_instances pch_light ../../test/build//boost_test_exec_monitor
+run test_ibeta.cpp test_instances//test_instances pch_light ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_LDOUBLE
- <toolset>intel:<pch>off
+ <define>TEST_LDOUBLE
+ <toolset>intel:<pch>off
: test_ibeta_long_double ;
-run test_ibeta.cpp test_instances pch_light ../../test/build//boost_test_exec_monitor
+run test_ibeta.cpp test_instances//test_instances pch_light ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_REAL_CONCEPT
- <define>TEST_DATA=1
- <toolset>intel:<pch>off
+ <define>TEST_REAL_CONCEPT
+ <define>TEST_DATA=1
+ <toolset>intel:<pch>off
: test_ibeta_real_concept1 ;
-run test_ibeta.cpp test_instances pch_light ../../test/build//boost_test_exec_monitor
+run test_ibeta.cpp test_instances//test_instances pch_light ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_REAL_CONCEPT
- <define>TEST_DATA=2
- <toolset>intel:<pch>off
+ <define>TEST_REAL_CONCEPT
+ <define>TEST_DATA=2
+ <toolset>intel:<pch>off
: test_ibeta_real_concept2 ;
-run test_ibeta.cpp test_instances pch_light ../../test/build//boost_test_exec_monitor
+run test_ibeta.cpp test_instances//test_instances pch_light ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_REAL_CONCEPT
- <define>TEST_DATA=3
- <toolset>intel:<pch>off
+ <define>TEST_REAL_CONCEPT
+ <define>TEST_DATA=3
+ <toolset>intel:<pch>off
: test_ibeta_real_concept3 ;
-run test_ibeta.cpp test_instances pch_light ../../test/build//boost_test_exec_monitor
+run test_ibeta.cpp test_instances//test_instances pch_light ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_REAL_CONCEPT
- <define>TEST_DATA=4
- <toolset>intel:<pch>off
+ <define>TEST_REAL_CONCEPT
+ <define>TEST_DATA=4
+ <toolset>intel:<pch>off
: test_ibeta_real_concept4 ;
-run test_ibeta_inv.cpp test_instances pch_light ../../test/build//boost_test_exec_monitor
+run test_ibeta_inv.cpp test_instances//test_instances pch_light ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_FLOAT
- <toolset>intel:<pch>off
+ <define>TEST_FLOAT
+ <toolset>intel:<pch>off
: test_ibeta_inv_float ;
-run test_ibeta_inv.cpp test_instances pch_light ../../test/build//boost_test_exec_monitor
+run test_ibeta_inv.cpp test_instances//test_instances pch_light ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_DOUBLE
- <toolset>intel:<pch>off
+ <define>TEST_DOUBLE
+ <toolset>intel:<pch>off
: test_ibeta_inv_double ;
-run test_ibeta_inv.cpp test_instances pch_light ../../test/build//boost_test_exec_monitor
+run test_ibeta_inv.cpp test_instances//test_instances pch_light ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_LDOUBLE
- <toolset>intel:<pch>off
+ <define>TEST_LDOUBLE
+ <toolset>intel:<pch>off
: test_ibeta_inv_long_double ;
-run test_ibeta_inv.cpp test_instances pch_light ../../test/build//boost_test_exec_monitor
+run test_ibeta_inv.cpp test_instances//test_instances pch_light ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_REAL_CONCEPT
- <define>TEST_DATA=1
- <toolset>intel:<pch>off
+ <define>TEST_REAL_CONCEPT
+ <define>TEST_DATA=1
+ <toolset>intel:<pch>off
: test_ibeta_inv_real_concept1 ;
-run test_ibeta_inv.cpp test_instances pch_light ../../test/build//boost_test_exec_monitor
+run test_ibeta_inv.cpp test_instances//test_instances pch_light ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_REAL_CONCEPT
- <define>TEST_DATA=2
- <toolset>intel:<pch>off
+ <define>TEST_REAL_CONCEPT
+ <define>TEST_DATA=2
+ <toolset>intel:<pch>off
: test_ibeta_inv_real_concept2 ;
-run test_ibeta_inv.cpp test_instances pch_light ../../test/build//boost_test_exec_monitor
+run test_ibeta_inv.cpp test_instances//test_instances pch_light ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_REAL_CONCEPT
- <define>TEST_DATA=3
- <toolset>intel:<pch>off
+ <define>TEST_REAL_CONCEPT
+ <define>TEST_DATA=3
+ <toolset>intel:<pch>off
: test_ibeta_inv_real_concept3 ;
-run test_ibeta_inv.cpp test_instances pch_light ../../test/build//boost_test_exec_monitor
+run test_ibeta_inv.cpp test_instances//test_instances pch_light ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_REAL_CONCEPT
- <define>TEST_DATA=4
- <toolset>intel:<pch>off
+ <define>TEST_REAL_CONCEPT
+ <define>TEST_DATA=4
+ <toolset>intel:<pch>off
: test_ibeta_inv_real_concept4 ;
-run test_ibeta_inv_ab.cpp test_instances pch_light ../../test/build//boost_test_exec_monitor
+run test_ibeta_inv_ab.cpp test_instances//test_instances pch_light ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_FLOAT
- <toolset>intel:<pch>off
+ <define>TEST_FLOAT
+ <toolset>intel:<pch>off
: test_ibeta_inv_ab_float ;
-run test_ibeta_inv_ab.cpp test_instances pch_light ../../test/build//boost_test_exec_monitor
+run test_ibeta_inv_ab.cpp test_instances//test_instances pch_light ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_DOUBLE
- <toolset>intel:<pch>off
+ <define>TEST_DOUBLE
+ <toolset>intel:<pch>off
: test_ibeta_inv_ab_double ;
-run test_ibeta_inv_ab.cpp test_instances pch_light ../../test/build//boost_test_exec_monitor
+run test_ibeta_inv_ab.cpp test_instances//test_instances pch_light ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_LDOUBLE
- <toolset>intel:<pch>off
+ <define>TEST_LDOUBLE
+ <toolset>intel:<pch>off
: test_ibeta_inv_ab_long_double ;
-run test_ibeta_inv_ab.cpp test_instances pch_light ../../test/build//boost_test_exec_monitor
+run test_ibeta_inv_ab.cpp test_instances//test_instances pch_light ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_REAL_CONCEPT
- <define>TEST_DATA=1
- <toolset>intel:<pch>off
+ <define>TEST_REAL_CONCEPT
+ <define>TEST_DATA=1
+ <toolset>intel:<pch>off
: test_ibeta_inv_ab_real_concept1 ;
-run test_ibeta_inv_ab.cpp test_instances pch_light ../../test/build//boost_test_exec_monitor
+run test_ibeta_inv_ab.cpp test_instances//test_instances pch_light ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_REAL_CONCEPT
- <define>TEST_DATA=2
- <toolset>intel:<pch>off
+ <define>TEST_REAL_CONCEPT
+ <define>TEST_DATA=2
+ <toolset>intel:<pch>off
: test_ibeta_inv_ab_real_concept2 ;
-run test_ibeta_inv_ab.cpp test_instances pch_light ../../test/build//boost_test_exec_monitor
+run test_ibeta_inv_ab.cpp test_instances//test_instances pch_light ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_REAL_CONCEPT
- <define>TEST_DATA=3
- <toolset>intel:<pch>off
+ <define>TEST_REAL_CONCEPT
+ <define>TEST_DATA=3
+ <toolset>intel:<pch>off
: test_ibeta_inv_ab_real_concept3 ;
-run test_igamma.cpp test_instances pch_light ../../test/build//boost_test_exec_monitor ;
-run test_igamma_inv.cpp test_instances pch_light ../../test/build//boost_test_exec_monitor
+run test_igamma.cpp test_instances//test_instances pch_light ../../test/build//boost_unit_test_framework ;
+run test_igamma_inv.cpp test_instances//test_instances pch_light ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_FLOAT
- <toolset>intel:<pch>off
+ <define>TEST_FLOAT
+ <toolset>intel:<pch>off
: test_igamma_inv_float ;
-run test_igamma_inv.cpp test_instances pch_light ../../test/build//boost_test_exec_monitor
+run test_igamma_inv.cpp test_instances//test_instances pch_light ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_DOUBLE
- <toolset>intel:<pch>off
+ <define>TEST_DOUBLE
+ <toolset>intel:<pch>off
: test_igamma_inv_double ;
-run test_igamma_inv.cpp test_instances pch_light ../../test/build//boost_test_exec_monitor
+run test_igamma_inv.cpp test_instances//test_instances pch_light ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_LDOUBLE
- <toolset>intel:<pch>off
+ <define>TEST_LDOUBLE
+ <toolset>intel:<pch>off
: test_igamma_inv_long_double ;
-run test_igamma_inv.cpp test_instances pch_light ../../test/build//boost_test_exec_monitor
+run test_igamma_inv.cpp test_instances//test_instances pch_light ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_REAL_CONCEPT
- <toolset>intel:<pch>off
+ <define>TEST_REAL_CONCEPT
+ <toolset>intel:<pch>off
: test_igamma_inv_real_concept ;
-run test_igamma_inva.cpp test_instances pch_light ../../test/build//boost_test_exec_monitor
+run test_igamma_inva.cpp test_instances//test_instances pch_light ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_FLOAT
- <toolset>intel:<pch>off
+ <define>TEST_FLOAT
+ <toolset>intel:<pch>off
: test_igamma_inva_float ;
-run test_igamma_inva.cpp test_instances pch_light ../../test/build//boost_test_exec_monitor
+run test_igamma_inva.cpp test_instances//test_instances pch_light ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_DOUBLE
- <toolset>intel:<pch>off
+ <define>TEST_DOUBLE
+ <toolset>intel:<pch>off
: test_igamma_inva_double ;
-run test_igamma_inva.cpp test_instances pch_light ../../test/build//boost_test_exec_monitor
+run test_igamma_inva.cpp test_instances//test_instances pch_light ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_LDOUBLE
- <toolset>intel:<pch>off
+ <define>TEST_LDOUBLE
+ <toolset>intel:<pch>off
: test_igamma_inva_long_double ;
-run test_igamma_inva.cpp test_instances pch_light ../../test/build//boost_test_exec_monitor
+run test_igamma_inva.cpp test_instances//test_instances pch_light ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_REAL_CONCEPT
- <toolset>intel:<pch>off
+ <define>TEST_REAL_CONCEPT
+ <toolset>intel:<pch>off
: test_igamma_inva_real_concept ;
run test_instantiate1.cpp test_instantiate2.cpp ;
-run test_inverse_chi_squared_distribution.cpp ../../test/build//boost_test_exec_monitor ;
-run test_inverse_gamma_distribution.cpp ../../test/build//boost_test_exec_monitor ;
+run test_inverse_chi_squared_distribution.cpp ../../test/build//boost_unit_test_framework ;
+run test_inverse_gamma_distribution.cpp ../../test/build//boost_unit_test_framework ;
-run test_inverse_gaussian.cpp ../../test/build//boost_test_exec_monitor ;
+run test_inverse_gaussian.cpp ../../test/build//boost_unit_test_framework ;
-run test_jacobi.cpp pch_light ../../test/build//boost_test_exec_monitor ;
+run test_jacobi.cpp pch_light ../../test/build//boost_unit_test_framework ;
run test_laplace.cpp ../../test/build//boost_unit_test_framework ;
-run test_inv_hyp.cpp pch ../../test/build//boost_test_exec_monitor ;
-run test_laguerre.cpp test_instances pch_light ../../test/build//boost_test_exec_monitor ;
-run test_legendre.cpp test_instances pch_light ../../test/build//boost_test_exec_monitor ;
-run test_logistic_dist.cpp ../../test/build//boost_test_exec_monitor ;
-run test_lognormal.cpp ../../test/build//boost_test_exec_monitor ;
-run test_minima.cpp pch ../../test/build//boost_test_exec_monitor ;
-run test_negative_binomial.cpp ../../test/build//boost_test_exec_monitor
+run test_inv_hyp.cpp pch ../../test/build//boost_unit_test_framework ;
+run test_laguerre.cpp test_instances//test_instances pch_light ../../test/build//boost_unit_test_framework ;
+run test_legendre.cpp test_instances//test_instances pch_light ../../test/build//boost_unit_test_framework ;
+run test_logistic_dist.cpp ../../test/build//boost_unit_test_framework ;
+run test_lognormal.cpp ../../test/build//boost_unit_test_framework ;
+run test_minima.cpp pch ../../test/build//boost_unit_test_framework ;
+run test_negative_binomial.cpp ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_FLOAT
- <toolset>intel:<pch>off
+ <define>TEST_FLOAT
+ <toolset>intel:<pch>off
: test_negative_binomial_float ;
-run test_negative_binomial.cpp ../../test/build//boost_test_exec_monitor
+run test_negative_binomial.cpp ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_DOUBLE
- <toolset>intel:<pch>off
+ <define>TEST_DOUBLE
+ <toolset>intel:<pch>off
: test_negative_binomial_double ;
-run test_negative_binomial.cpp ../../test/build//boost_test_exec_monitor
+run test_negative_binomial.cpp ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_LDOUBLE
- <toolset>intel:<pch>off
+ <define>TEST_LDOUBLE
+ <toolset>intel:<pch>off
: test_negative_binomial_long_double ;
-run test_negative_binomial.cpp ../../test/build//boost_test_exec_monitor
+run test_negative_binomial.cpp ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_REAL_CONCEPT
- <toolset>intel:<pch>off
+ <define>TEST_REAL_CONCEPT
+ <toolset>intel:<pch>off
: test_negative_binomial_real_concept ;
-run test_next.cpp pch pch ../../test/build//boost_test_exec_monitor ;
-run test_nc_chi_squared.cpp pch ../../test/build//boost_test_exec_monitor
+run test_next.cpp pch pch ../../test/build//boost_unit_test_framework ;
+run test_nc_chi_squared.cpp pch ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_FLOAT
- <toolset>intel:<pch>off
+ <define>TEST_FLOAT
+ <toolset>intel:<pch>off
: test_nc_chi_squared_float ;
-run test_nc_chi_squared.cpp pch ../../test/build//boost_test_exec_monitor
+run test_nc_chi_squared.cpp pch ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_DOUBLE
- <toolset>intel:<pch>off
+ <define>TEST_DOUBLE
+ <toolset>intel:<pch>off
: test_nc_chi_squared_double ;
-run test_nc_chi_squared.cpp pch ../../test/build//boost_test_exec_monitor
+run test_nc_chi_squared.cpp pch ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_LDOUBLE
- <toolset>intel:<pch>off
+ <define>TEST_LDOUBLE
+ <toolset>intel:<pch>off
: test_nc_chi_squared_long_double ;
-run test_nc_chi_squared.cpp pch ../../test/build//boost_test_exec_monitor
+run test_nc_chi_squared.cpp pch ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_REAL_CONCEPT
- <toolset>intel:<pch>off
+ <define>TEST_REAL_CONCEPT
+ <toolset>intel:<pch>off
: test_nc_chi_squared_real_concept ;
-run test_nc_beta.cpp ../../test/build//boost_test_exec_monitor
+run test_nc_beta.cpp ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_FLOAT
- <toolset>intel:<pch>off
+ <define>TEST_FLOAT
+ <toolset>intel:<pch>off
: test_nc_beta_float ;
-run test_nc_beta.cpp ../../test/build//boost_test_exec_monitor
+run test_nc_beta.cpp ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_DOUBLE
- <toolset>intel:<pch>off
+ <define>TEST_DOUBLE
+ <toolset>intel:<pch>off
: test_nc_beta_double ;
-run test_nc_beta.cpp ../../test/build//boost_test_exec_monitor
+run test_nc_beta.cpp ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_LDOUBLE
- <toolset>intel:<pch>off
+ <define>TEST_LDOUBLE
+ <toolset>intel:<pch>off
: test_nc_beta_long_double ;
-run test_nc_beta.cpp ../../test/build//boost_test_exec_monitor
+run test_nc_beta.cpp ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_REAL_CONCEPT
- <define>TEST_DATA=1
- <toolset>intel:<pch>off
+ <define>TEST_REAL_CONCEPT
+ <define>TEST_DATA=1
+ <toolset>intel:<pch>off
: test_nc_beta_real_concept1 ;
-run test_nc_beta.cpp ../../test/build//boost_test_exec_monitor
+run test_nc_beta.cpp ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_REAL_CONCEPT
- <define>TEST_DATA=2
- <toolset>intel:<pch>off
+ <define>TEST_REAL_CONCEPT
+ <define>TEST_DATA=2
+ <toolset>intel:<pch>off
: test_nc_beta_real_concept2 ;
-run test_nc_f.cpp pch ../../test/build//boost_test_exec_monitor ;
-run test_nc_t.cpp pch ../../test/build//boost_test_exec_monitor
+run test_nc_f.cpp pch ../../test/build//boost_unit_test_framework ;
+run test_nc_t.cpp pch ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_FLOAT
- <toolset>intel:<pch>off
+ <define>TEST_FLOAT
+ <toolset>intel:<pch>off
: test_nc_t_float ;
-run test_nc_t.cpp pch ../../test/build//boost_test_exec_monitor
+run test_nc_t.cpp pch ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_DOUBLE
- <toolset>intel:<pch>off
+ <define>TEST_DOUBLE
+ <toolset>intel:<pch>off
: test_nc_t_double ;
-run test_nc_t.cpp pch ../../test/build//boost_test_exec_monitor
+run test_nc_t.cpp pch ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_LDOUBLE
- <toolset>intel:<pch>off
+ <define>TEST_LDOUBLE
+ <toolset>intel:<pch>off
: test_nc_t_long_double ;
-run test_nc_t.cpp pch ../../test/build//boost_test_exec_monitor
+run test_nc_t.cpp pch ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_REAL_CONCEPT
- <toolset>intel:<pch>off
+ <define>TEST_REAL_CONCEPT
+ <toolset>intel:<pch>off
: test_nc_t_real_concept ;
-run test_normal.cpp pch ../../test/build//boost_test_exec_monitor ;
-run test_owens_t.cpp ../../test/build//boost_test_exec_monitor ;
-run test_pareto.cpp ../../test/build//boost_test_exec_monitor ;
-run test_poisson.cpp ../../test/build//boost_test_exec_monitor
+run test_normal.cpp pch ../../test/build//boost_unit_test_framework ;
+run test_owens_t.cpp ../../test/build//boost_unit_test_framework ;
+run test_pareto.cpp ../../test/build//boost_unit_test_framework ;
+run test_poisson.cpp ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_FLOAT
- <toolset>intel:<pch>off
+ <define>TEST_FLOAT
+ <toolset>intel:<pch>off
: test_poisson_float ;
-run test_poisson.cpp ../../test/build//boost_test_exec_monitor
+run test_poisson.cpp ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_DOUBLE
- <toolset>intel:<pch>off
+ <define>TEST_DOUBLE
+ <toolset>intel:<pch>off
: test_poisson_double ;
-run test_poisson.cpp ../../test/build//boost_test_exec_monitor
+run test_poisson.cpp ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_LDOUBLE
- <toolset>intel:<pch>off
+ <define>TEST_LDOUBLE
+ <toolset>intel:<pch>off
: test_poisson_long_double ;
-run test_poisson.cpp ../../test/build//boost_test_exec_monitor
+run test_poisson.cpp ../../test/build//boost_unit_test_framework
: # command line
: # input files
: # requirements
- <define>TEST_REAL_CONCEPT
- <toolset>intel:<pch>off
+ <define>TEST_REAL_CONCEPT
+ <toolset>intel:<pch>off
: test_poisson_real_concept ;
-run test_rayleigh.cpp ../../test/build//boost_test_exec_monitor ;
+run test_rayleigh.cpp ../../test/build//boost_unit_test_framework ;
-run test_rationals.cpp ../../test/build//boost_test_exec_monitor
+run test_rationals.cpp ../../test/build//boost_unit_test_framework
test_rational_instances/test_rational_double1.cpp
test_rational_instances/test_rational_double2.cpp
test_rational_instances/test_rational_double3.cpp
@@ -632,46 +633,46 @@
test_rational_instances/test_rational_real_concept5.cpp
;
-run test_real_concept.cpp ../../test/build//boost_test_exec_monitor ;
-run test_remez.cpp pch ../../test/build//boost_test_exec_monitor ;
-run test_roots.cpp pch ../../test/build//boost_test_exec_monitor ;
-run test_round.cpp pch ../../test/build//boost_test_exec_monitor ;
-run test_spherical_harmonic.cpp test_instances pch_light ../../test/build//boost_test_exec_monitor ;
-run test_students_t.cpp ../../test/build//boost_test_exec_monitor ;
-run test_sign.cpp ../../test/build//boost_test_exec_monitor ;
-run test_skew_normal.cpp ../../test/build//boost_test_exec_monitor ;
-run test_tgamma_ratio.cpp pch ../../test/build//boost_test_exec_monitor ;
-run test_toms748_solve.cpp pch ../../test/build//boost_test_exec_monitor ;
-run test_triangular.cpp pch ../../test/build//boost_test_exec_monitor ;
-run test_uniform.cpp pch ../../test/build//boost_test_exec_monitor ;
-run test_weibull.cpp ../../test/build//boost_test_exec_monitor ;
-run test_zeta.cpp test_instances ../../test/build//boost_test_exec_monitor pch_light ;
-
-run test_policy.cpp ../../test/build//boost_test_exec_monitor ;
-run test_policy_2.cpp ../../test/build//boost_test_exec_monitor ;
-run test_policy_3.cpp ../../test/build//boost_test_exec_monitor ;
-run test_policy_4.cpp ../../test/build//boost_test_exec_monitor ;
-run test_policy_5.cpp ../../test/build//boost_test_exec_monitor ;
-run test_policy_6.cpp ../../test/build//boost_test_exec_monitor ;
-run test_policy_7.cpp ../../test/build//boost_test_exec_monitor ;
-run test_policy_8.cpp ../../test/build//boost_test_exec_monitor ;
-run test_policy_sf.cpp ../../test/build//boost_test_exec_monitor ;
+run test_real_concept.cpp ../../test/build//boost_unit_test_framework ;
+run test_remez.cpp pch ../../test/build//boost_unit_test_framework ;
+run test_roots.cpp pch ../../test/build//boost_unit_test_framework ;
+run test_round.cpp pch ../../test/build//boost_unit_test_framework ;
+run test_spherical_harmonic.cpp test_instances//test_instances pch_light ../../test/build//boost_unit_test_framework ;
+run test_students_t.cpp ../../test/build//boost_unit_test_framework ;
+run test_sign.cpp ../../test/build//boost_unit_test_framework ;
+run test_skew_normal.cpp ../../test/build//boost_unit_test_framework ;
+run test_tgamma_ratio.cpp pch ../../test/build//boost_unit_test_framework ;
+run test_toms748_solve.cpp pch ../../test/build//boost_unit_test_framework ;
+run test_triangular.cpp pch ../../test/build//boost_unit_test_framework ;
+run test_uniform.cpp pch ../../test/build//boost_unit_test_framework ;
+run test_weibull.cpp ../../test/build//boost_unit_test_framework ;
+run test_zeta.cpp test_instances//test_instances ../../test/build//boost_unit_test_framework pch_light ;
+
+run test_policy.cpp ../../test/build//boost_unit_test_framework ;
+run test_policy_2.cpp ../../test/build//boost_unit_test_framework ;
+run test_policy_3.cpp ../../test/build//boost_unit_test_framework ;
+run test_policy_4.cpp ../../test/build//boost_unit_test_framework ;
+run test_policy_5.cpp ../../test/build//boost_unit_test_framework ;
+run test_policy_6.cpp ../../test/build//boost_unit_test_framework ;
+run test_policy_7.cpp ../../test/build//boost_unit_test_framework ;
+run test_policy_8.cpp ../../test/build//boost_unit_test_framework ;
+run test_policy_sf.cpp ../../test/build//boost_unit_test_framework ;
run test_tr1.cpp
../build//boost_math_tr1
../build//boost_math_tr1f
../build//boost_math_c99
../build//boost_math_c99f
- ../../test/build//boost_test_exec_monitor
+ ../../test/build//boost_unit_test_framework
;
run test_tr1.cpp
../build//boost_math_tr1l
../build//boost_math_c99l
- ../../test/build//boost_test_exec_monitor
+ ../../test/build//boost_unit_test_framework
: : :
<define>TEST_LD=1
- [ check-target-builds ../config//has_long_double_support : : <build>no ]
+ [ check-target-builds ../config//has_long_double_support "long double support" : : <build>no ]
:
test_tr1_long_double
;
@@ -681,7 +682,7 @@
../build//boost_math_tr1f
../build//boost_math_c99
../build//boost_math_c99f
- ../../test/build//boost_test_exec_monitor
+ ../../test/build//boost_unit_test_framework
: : : #requirements
:
test_tr1_c
@@ -690,16 +691,16 @@
run test_tr1.c
../build//boost_math_tr1l
../build//boost_math_c99l
- ../../test/build//boost_test_exec_monitor
+ ../../test/build//boost_unit_test_framework
: : :
<define>TEST_LD=1
- [ check-target-builds ../config//has_long_double_support : : <build>no ]
+ [ check-target-builds ../config//has_long_double_support "long double support" : : <build>no ]
:
test_tr1_c_long_double
;
-run test_long_double_support.cpp ../../test/build//boost_test_exec_monitor
-: : : [ check-target-builds ../config//has_long_double_support : : <build>no ] ;
+run test_long_double_support.cpp ../../test/build//boost_unit_test_framework
+: : : [ check-target-builds ../config//has_long_double_support "long double support" : : <build>no ] ;
run compile_test/compl_abs_incl_test.cpp compile_test/main.cpp ;
run compile_test/compl_acos_incl_test.cpp compile_test/main.cpp ;
@@ -815,21 +816,26 @@
../../test/build//boost_unit_test_framework ;
-run test_legacy_nonfinite.cpp ../../test/build//boost_test_exec_monitor ;
-run test_basic_nonfinite.cpp ../../test/build//boost_test_exec_monitor ;
-run test_lexical_cast.cpp ../../test/build//boost_test_exec_monitor ;
-run test_nonfinite_trap.cpp ../../test/build//boost_test_exec_monitor ;
-run test_signed_zero.cpp ../../test/build//boost_test_exec_monitor ;
+run test_legacy_nonfinite.cpp ../../test/build//boost_unit_test_framework ;
+run test_basic_nonfinite.cpp ../../test/build//boost_unit_test_framework ;
+run test_lexical_cast.cpp ../../test/build//boost_unit_test_framework ;
+run test_nonfinite_trap.cpp ../../test/build//boost_unit_test_framework ;
+run test_signed_zero.cpp ../../test/build//boost_unit_test_framework ;
-run complex_test.cpp ../../test/build//boost_test_exec_monitor ;
+run complex_test.cpp ../../test/build//boost_unit_test_framework ;
-compile ntl_concept_check.cpp : [ check-target-builds ../config//has_ntl_rr : : <build>no ] ;
-compile mpfr_concept_check.cpp : [ check-target-builds ../config//has_mpfr_class : : <build>no ] ;
-compile mpreal_concept_check.cpp : [ check-target-builds ../config//has_mpreal : : <build>no ] ;
-compile e_float_concept_check.cpp : [ check-target-builds ../config//has_e_float : : <build>no ] ;
-compile test_common_factor_gmpxx.cpp : [ check-target-builds ../config//has_gmpxx : : <build>no ] ;
+compile multiprc_concept_check_1.cpp : <debug-symbols>off ;
+compile multiprc_concept_check_2.cpp : <debug-symbols>off ;
+compile multiprc_concept_check_3.cpp : <debug-symbols>off ;
+compile multiprc_concept_check_4.cpp : <debug-symbols>off ;
+compile ntl_concept_check.cpp : [ check-target-builds ../config//has_ntl_rr : : <build>no ] <debug-symbols>off ;
+compile mpfr_concept_check.cpp : [ check-target-builds ../config//has_mpfr_class : : <build>no ] <debug-symbols>off ;
+compile mpreal_concept_check.cpp : [ check-target-builds ../config//has_mpreal : : <build>no ] <debug-symbols>off ;
+compile e_float_concept_check.cpp : [ check-target-builds ../config//has_e_float : : <build>no ] <debug-symbols>off ;
+compile test_common_factor_gmpxx.cpp : [ check-target-builds ../config//has_gmpxx : : <build>no ] <debug-symbols>off ;
-run ztest_max_digits10.cpp ;
+# Temporary tests for support of max_digits10
+# run ztest_max_digits10.cpp ;
run zztest_max_digits10.cpp ;
build-project ../example ;
Modified: branches/release/libs/math/test/acosh_test.hpp
==============================================================================
--- branches/release/libs/math/test/acosh_test.hpp (original)
+++ branches/release/libs/math/test/acosh_test.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -10,7 +10,7 @@
#include <iomanip>
#include <iostream>
-
+#define BOOST_TEST_MAiN
#include <boost/math/special_functions/acosh.hpp>
Modified: branches/release/libs/math/test/asinh_test.hpp
==============================================================================
--- branches/release/libs/math/test/asinh_test.hpp (original)
+++ branches/release/libs/math/test/asinh_test.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -10,7 +10,7 @@
#include <iomanip>
#include <iostream>
-
+#define BOOST_TEST_MAiN
#include <boost/math/special_functions/asinh.hpp>
Modified: branches/release/libs/math/test/atanh_test.hpp
==============================================================================
--- branches/release/libs/math/test/atanh_test.hpp (original)
+++ branches/release/libs/math/test/atanh_test.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -10,7 +10,7 @@
#include <iomanip>
//#include <iostream>
-
+#define BOOST_TEST_MAiN
#include <boost/math/special_functions/atanh.hpp>
Modified: branches/release/libs/math/test/compile_test/instantiate.hpp
==============================================================================
--- branches/release/libs/math/test/compile_test/instantiate.hpp (original)
+++ branches/release/libs/math/test/compile_test/instantiate.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -15,6 +15,7 @@
#include <boost/math/special_functions.hpp>
#include <boost/math/concepts/distributions.hpp>
+#include <boost/concept_archetype.hpp>
#ifndef BOOST_MATH_INSTANTIATE_MINIMUM
@@ -33,13 +34,27 @@
}
#endif
+#if !defined(TEST_GROUP_1) && !defined(TEST_GROUP_2) && !defined(TEST_GROUP_3) \
+ && !defined(TEST_GROUP_4) && !defined(TEST_GROUP_5) && !defined(TEST_GROUP_6) \
+ && !defined(TEST_GROUP_7) && !defined(TEST_GROUP_8) && !defined(TEST_GROUP_9)
+# define TEST_GROUP_1
+# define TEST_GROUP_2
+# define TEST_GROUP_3
+# define TEST_GROUP_4
+# define TEST_GROUP_5
+# define TEST_GROUP_6
+# define TEST_GROUP_7
+# define TEST_GROUP_8
+# define TEST_GROUP_9
+#endif
+
template <class RealType>
void instantiate(RealType)
{
using namespace boost;
using namespace boost::math;
using namespace boost::math::concepts;
-
+#ifdef TEST_GROUP_1
function_requires<DistributionConcept<bernoulli_distribution<RealType> > >();
function_requires<DistributionConcept<beta_distribution<RealType> > >();
function_requires<DistributionConcept<binomial_distribution<RealType> > >();
@@ -71,7 +86,9 @@
function_requires<DistributionConcept<triangular_distribution<RealType> > >();
function_requires<DistributionConcept<uniform_distribution<RealType> > >();
function_requires<DistributionConcept<weibull_distribution<RealType> > >();
+#endif
#ifndef BOOST_MATH_INSTANTIATE_MINIMUM
+#ifdef TEST_GROUP_2
function_requires<DistributionConcept<bernoulli_distribution<RealType, test_policy> > >();
function_requires<DistributionConcept<beta_distribution<RealType, test_policy> > >();
function_requires<DistributionConcept<binomial_distribution<RealType, test_policy> > >();
@@ -103,7 +120,8 @@
function_requires<DistributionConcept<triangular_distribution<RealType, test_policy> > >();
function_requires<DistributionConcept<uniform_distribution<RealType, test_policy> > >();
function_requires<DistributionConcept<weibull_distribution<RealType, test_policy> > >();
-
+#endif
+#ifdef TEST_GROUP_3
function_requires<DistributionConcept<dist_test::bernoulli > >();
function_requires<DistributionConcept<dist_test::beta > >();
function_requires<DistributionConcept<dist_test::binomial > >();
@@ -136,8 +154,12 @@
function_requires<DistributionConcept<dist_test::weibull > >();
function_requires<DistributionConcept<dist_test::hypergeometric > >();
#endif
+#endif
int i;
RealType v1(0.5), v2(0.5), v3(0.5);
+ boost::detail::dummy_constructor dc;
+ boost::output_iterator_archetype<RealType> oi(dc);
+#ifdef TEST_GROUP_4
boost::math::tgamma(v1);
boost::math::tgamma1pm1(v1);
boost::math::lgamma(v1);
@@ -247,6 +269,10 @@
boost::math::sph_bessel(i, 1);
boost::math::sph_neumann(i, v2);
boost::math::sph_neumann(i, i);
+ boost::math::cyl_bessel_j_zero(v1, i);
+ boost::math::cyl_bessel_j_zero(v1, i, i, oi);
+ boost::math::cyl_neumann_zero(v1, i);
+ boost::math::cyl_neumann_zero(v1, i, i, oi);
#ifdef TEST_COMPLEX
boost::math::cyl_hankel_1(v1, v2);
boost::math::cyl_hankel_1(i, v2);
@@ -261,6 +287,12 @@
boost::math::airy_bi(v1);
boost::math::airy_ai_prime(v1);
boost::math::airy_bi_prime(v1);
+
+ boost::math::airy_ai_zero<RealType>(i);
+ boost::math::airy_bi_zero<RealType>(i);
+ boost::math::airy_ai_zero<RealType>(i, i, oi);
+ boost::math::airy_bi_zero<RealType>(i, i, oi);
+
boost::math::expint(v1);
boost::math::expint(i);
boost::math::expint(i, v2);
@@ -289,7 +321,169 @@
boost::math::float_next(v1);
boost::math::float_prior(v1);
boost::math::float_distance(v1, v1);
+#endif
+#ifdef TEST_GROUP_9
+ //
+ // Over again, but arguments may be expression templates:
+ //
+ boost::math::tgamma(v1 + 0);
+ boost::math::tgamma1pm1(v1 + 0);
+ boost::math::lgamma(v1 * 1);
+ boost::math::lgamma(v1 * 1, &i);
+ boost::math::digamma(v1 * 1);
+ boost::math::tgamma_ratio(v1 * 1, v2 + 0);
+ boost::math::tgamma_delta_ratio(v1 * 1, v2 + 0);
+ boost::math::factorial<RealType>(i);
+ boost::math::unchecked_factorial<RealType>(i);
+ i = boost::math::max_factorial<RealType>::value;
+ boost::math::double_factorial<RealType>(i);
+ boost::math::rising_factorial(v1 * 1, i);
+ boost::math::falling_factorial(v1 * 1, i);
+ boost::math::tgamma(v1 * 1, v2 + 0);
+ boost::math::tgamma_lower(v1 * 1, v2 - 0);
+ boost::math::gamma_p(v1 * 1, v2 + 0);
+ boost::math::gamma_q(v1 * 1, v2 + 0);
+ boost::math::gamma_p_inv(v1 * 1, v2 + 0);
+ boost::math::gamma_q_inv(v1 * 1, v2 + 0);
+ boost::math::gamma_p_inva(v1 * 1, v2 + 0);
+ boost::math::gamma_q_inva(v1 * 1, v2 + 0);
+ boost::math::erf(v1 * 1);
+ boost::math::erfc(v1 * 1);
+ boost::math::erf_inv(v1 * 1);
+ boost::math::erfc_inv(v1 * 1);
+ boost::math::beta(v1 * 1, v2 + 0);
+ boost::math::beta(v1 * 1, v2 + 0, v3 / 1);
+ boost::math::betac(v1 * 1, v2 + 0, v3 / 1);
+ boost::math::ibeta(v1 * 1, v2 + 0, v3 / 1);
+ boost::math::ibetac(v1 * 1, v2 + 0, v3 / 1);
+ boost::math::ibeta_inv(v1 * 1, v2 + 0, v3 / 1);
+ boost::math::ibetac_inv(v1 * 1, v2 + 0, v3 / 1);
+ boost::math::ibeta_inva(v1 * 1, v2 + 0, v3 / 1);
+ boost::math::ibetac_inva(v1 * 1, v2 + 0, v3 / 1);
+ boost::math::ibeta_invb(v1 * 1, v2 + 0, v3 / 1);
+ boost::math::ibetac_invb(v1 * 1, v2 + 0, v3 / 1);
+ boost::math::gamma_p_derivative(v2 * 1, v3 + 0);
+ boost::math::ibeta_derivative(v1 * 1, v2 + 0, v3 / 1);
+ (boost::math::fpclassify)(v1 * 1);
+ (boost::math::isfinite)(v1 * 1);
+ (boost::math::isnormal)(v1 * 1);
+ (boost::math::isnan)(v1 * 1);
+ (boost::math::isinf)(v1 * 1);
+ (boost::math::signbit)(v1 * 1);
+ (boost::math::copysign)(v1 * 1, v2 + 0);
+ (boost::math::changesign)(v1 * 1);
+ (boost::math::sign)(v1 * 1);
+ boost::math::log1p(v1 * 1);
+ boost::math::expm1(v1 * 1);
+ boost::math::cbrt(v1 * 1);
+ boost::math::sqrt1pm1(v1 * 1);
+ boost::math::powm1(v1 * 1, v2 + 0);
+ boost::math::legendre_p(1, v1 * 1);
+ boost::math::legendre_p(1, 0, v1 * 1);
+ boost::math::legendre_q(1, v1 * 1);
+ boost::math::legendre_next(2, v1 * 1, v2 + 0, v3 / 1);
+ boost::math::legendre_next(2, 2, v1 * 1, v2 + 0, v3 / 1);
+ boost::math::laguerre(1, v1 * 1);
+ boost::math::laguerre(2, 1, v1 * 1);
+ boost::math::laguerre(2u, 1u, v1 * 1);
+ boost::math::laguerre_next(2, v1 * 1, v2 + 0, v3 / 1);
+ boost::math::laguerre_next(2, 1, v1 * 1, v2 + 0, v3 / 1);
+ boost::math::hermite(1, v1 * 1);
+ boost::math::hermite_next(2, v1 * 1, v2 + 0, v3 / 1);
+ boost::math::spherical_harmonic_r(2, 1, v1 * 1, v2 + 0);
+ boost::math::spherical_harmonic_i(2, 1, v1 * 1, v2 + 0);
+ boost::math::ellint_1(v1 * 1);
+ boost::math::ellint_1(v1 * 1, v2 + 0);
+ boost::math::ellint_2(v1 * 1);
+ boost::math::ellint_2(v1 * 1, v2 + 0);
+ boost::math::ellint_3(v1 * 1, v2 + 0);
+ boost::math::ellint_3(v1 * 1, v2 + 0, v3 / 1);
+ boost::math::ellint_rc(v1 * 1, v2 + 0);
+ boost::math::ellint_rd(v1 * 1, v2 + 0, v3 / 1);
+ boost::math::ellint_rf(v1 * 1, v2 + 0, v3 / 1);
+ boost::math::ellint_rj(v1 * 1, v2 + 0, v3 / 1, v1 * 1);
+ boost::math::jacobi_elliptic(v1 * 1, v2 + 0, &v1, &v2);
+ boost::math::jacobi_cd(v1 * 1, v2 + 0);
+ boost::math::jacobi_cn(v1 * 1, v2 + 0);
+ boost::math::jacobi_cs(v1 * 1, v2 + 0);
+ boost::math::jacobi_dc(v1 * 1, v2 + 0);
+ boost::math::jacobi_dn(v1 * 1, v2 + 0);
+ boost::math::jacobi_ds(v1 * 1, v2 + 0);
+ boost::math::jacobi_nc(v1 * 1, v2 + 0);
+ boost::math::jacobi_nd(v1 * 1, v2 + 0);
+ boost::math::jacobi_ns(v1 * 1, v2 + 0);
+ boost::math::jacobi_sc(v1 * 1, v2 + 0);
+ boost::math::jacobi_sd(v1 * 1, v2 + 0);
+ boost::math::jacobi_sn(v1 * 1, v2 + 0);
+ boost::math::hypot(v1 * 1, v2 + 0);
+ boost::math::sinc_pi(v1 * 1);
+ boost::math::sinhc_pi(v1 * 1);
+ boost::math::asinh(v1 * 1);
+ boost::math::acosh(v1 * 1);
+ boost::math::atanh(v1 * 1);
+ boost::math::sin_pi(v1 * 1);
+ boost::math::cos_pi(v1 * 1);
+ boost::math::cyl_neumann(v1 * 1, v2 + 0);
+ boost::math::cyl_neumann(i, v2 * 1);
+ boost::math::cyl_bessel_j(v1 * 1, v2 + 0);
+ boost::math::cyl_bessel_j(i, v2 * 1);
+ boost::math::cyl_bessel_i(v1 * 1, v2 + 0);
+ boost::math::cyl_bessel_i(i, v2 * 1);
+ boost::math::cyl_bessel_k(v1 * 1, v2 + 0);
+ boost::math::cyl_bessel_k(i, v2 * 1);
+ boost::math::sph_bessel(i, v2 * 1);
+ boost::math::sph_bessel(i, 1);
+ boost::math::sph_neumann(i, v2 * 1);
+ boost::math::sph_neumann(i, i);
+ boost::math::cyl_bessel_j_zero(v1 * 1, i);
+ boost::math::cyl_bessel_j_zero(v1 * 1, i, i, oi);
+ boost::math::cyl_neumann_zero(v1 * 1, i);
+ boost::math::cyl_neumann_zero(v1 * 1, i, i, oi);
+#ifdef TEST_COMPLEX
+ boost::math::cyl_hankel_1(v1, v2);
+ boost::math::cyl_hankel_1(i, v2);
+ boost::math::cyl_hankel_2(v1, v2);
+ boost::math::cyl_hankel_2(i, v2);
+ boost::math::sph_hankel_1(v1, v2);
+ boost::math::sph_hankel_1(i, v2);
+ boost::math::sph_hankel_2(v1, v2);
+ boost::math::sph_hankel_2(i, v2);
+#endif
+ boost::math::airy_ai(v1 * 1);
+ boost::math::airy_bi(v1 * 1);
+ boost::math::airy_ai_prime(v1 * 1);
+ boost::math::airy_bi_prime(v1 * 1);
+ boost::math::expint(v1 * 1);
+ boost::math::expint(i);
+ boost::math::expint(i, v2 * 1);
+ boost::math::expint(i, i);
+ boost::math::zeta(v1 * 1);
+ boost::math::zeta(i);
+ boost::math::owens_t(v1 * 1, v2 + 0);
+ boost::math::trunc(v1 * 1);
+ boost::math::itrunc(v1 * 1);
+ boost::math::ltrunc(v1 * 1);
+ boost::math::round(v1 * 1);
+ boost::math::iround(v1 * 1);
+ boost::math::lround(v1 * 1);
+ //boost::math::modf(v1 * 1, &v1);
+ //boost::math::modf(v1 * 1, &i);
+ //long l;
+ //boost::math::modf(v1 * 1, &l);
+#ifdef BOOST_HAS_LONG_LONG
+ boost::math::lltrunc(v1 * 1);
+ boost::math::llround(v1 * 1);
+ //boost::long_long_type ll;
+ //boost::math::modf(v1 * 1, &ll);
+#endif
+ boost::math::pow<2>(v1 * 1);
+ boost::math::nextafter(v1 * 1, v1 + 0);
+ boost::math::float_next(v1 * 1);
+ boost::math::float_prior(v1 * 1);
+ boost::math::float_distance(v1 * 1, v1 * 1);
+#endif
#ifndef BOOST_MATH_INSTANTIATE_MINIMUM
+#ifdef TEST_GROUP_5
//
// All over again, with a policy this time:
//
@@ -393,6 +587,10 @@
boost::math::sph_bessel(i, 1, pol);
boost::math::sph_neumann(i, v2, pol);
boost::math::sph_neumann(i, i, pol);
+ boost::math::cyl_bessel_j_zero(v1, i, pol);
+ boost::math::cyl_bessel_j_zero(v1, i, i, oi, pol);
+ boost::math::cyl_neumann_zero(v1, i, pol);
+ boost::math::cyl_neumann_zero(v1, i, i, oi, pol);
#ifdef TEST_COMPLEX
boost::math::cyl_hankel_1(v1, v2, pol);
boost::math::cyl_hankel_1(i, v2, pol);
@@ -407,6 +605,12 @@
boost::math::airy_bi(v1, pol);
boost::math::airy_ai_prime(v1, pol);
boost::math::airy_bi_prime(v1, pol);
+
+ boost::math::airy_ai_zero<RealType>(i, pol);
+ boost::math::airy_bi_zero<RealType>(i, pol);
+ boost::math::airy_ai_zero<RealType>(i, i, oi, pol);
+ boost::math::airy_bi_zero<RealType>(i, i, oi, pol);
+
boost::math::expint(v1, pol);
boost::math::expint(i, pol);
boost::math::expint(i, v2, pol);
@@ -439,6 +643,8 @@
boost::math::float_next(v1, pol);
boost::math::float_prior(v1, pol);
boost::math::float_distance(v1, v1, pol);
+#endif
+#ifdef TEST_GROUP_6
//
// All over again with the versions in test::
//
@@ -550,6 +756,10 @@
test::sph_bessel(i, 1);
test::sph_neumann(i, v2);
test::sph_neumann(i, i);
+ test::cyl_bessel_j_zero(v1, i);
+ test::cyl_bessel_j_zero(v1, i, i, oi);
+ test::cyl_neumann_zero(v1, i);
+ test::cyl_neumann_zero(v1, i, i, oi);
#ifdef TEST_COMPLEX
test::cyl_hankel_1(v1, v2);
test::cyl_hankel_1(i, v2);
@@ -560,10 +770,16 @@
test::sph_hankel_2(v1, v2);
test::sph_hankel_2(i, v2);
#endif
- boost::math::airy_ai(i);
- boost::math::airy_bi(i);
- boost::math::airy_ai_prime(i);
- boost::math::airy_bi_prime(i);
+ test::airy_ai(i);
+ test::airy_bi(i);
+ test::airy_ai_prime(i);
+ test::airy_bi_prime(i);
+
+ test::airy_ai_zero<RealType>(i);
+ test::airy_bi_zero<RealType>(i);
+ test::airy_ai_zero<RealType>(i, i, oi);
+ test::airy_bi_zero<RealType>(i, i, oi);
+
test::expint(v1);
test::expint(i);
test::expint(i, v2);
@@ -591,6 +807,7 @@
test::float_prior(v1);
test::float_distance(v1, v1);
#endif
+#endif
}
template <class RealType>
@@ -609,7 +826,7 @@
#else
double lr = 0.5L;
#endif
-
+#ifdef TEST_GROUP_7
boost::math::tgamma(i);
boost::math::tgamma1pm1(i);
boost::math::lgamma(i);
@@ -861,8 +1078,8 @@
boost::math::sph_neumann(i, i, pol);
boost::math::owens_t(fr, dr, pol);
boost::math::owens_t(i, s, pol);
-
-
+#endif
+#ifdef TEST_GROUP_8
test::tgamma(i);
test::tgamma1pm1(i);
test::lgamma(i);
@@ -982,6 +1199,7 @@
test::owens_t(fr, dr);
test::owens_t(i, s);
#endif
+#endif
}
Modified: branches/release/libs/math/test/complex_test.cpp
==============================================================================
--- branches/release/libs/math/test/complex_test.cpp (original)
+++ branches/release/libs/math/test/complex_test.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -3,8 +3,8 @@
// 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 <boost/test/test_tools.hpp>
-#include <boost/test/test_exec_monitor.hpp>
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp>
#include <boost/test/floating_point_comparison.hpp>
#include <boost/type_traits/is_same.hpp>
#include <boost/type_traits/is_floating_point.hpp>
@@ -896,7 +896,7 @@
}
-int test_main(int, char*[])
+BOOST_AUTO_TEST_CASE( test_main )
{
std::cout << "Running complex trig sanity checks for type float." << std::endl;
test_inverse_trig(float(0));
@@ -915,7 +915,6 @@
std::cout << "Running complex trig boundary and accuracy tests." << std::endl;
test_boundaries();
- return 0;
}
Deleted: branches/release/libs/math/test/double_test_instances.cpp
==============================================================================
--- branches/release/libs/math/test/double_test_instances.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
+++ (empty file)
@@ -1,15 +0,0 @@
-// Copyright John Maddock 2011.
-// 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 "pch.hpp"
-
-#ifndef BOOST_BUILD_PCH_ENABLED
-#define BOOST_MATH_OVERFLOW_ERROR_POLICY ignore_error
-#include <boost/math/special_functions.hpp>
-#endif
-
-#define BOOST_MATH_TEST_TYPE double
-#include "test_instances.hpp"
-
Deleted: branches/release/libs/math/test/float_test_instances.cpp
==============================================================================
--- branches/release/libs/math/test/float_test_instances.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
+++ (empty file)
@@ -1,15 +0,0 @@
-// Copyright John Maddock 2011.
-// 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 "pch.hpp"
-
-#ifndef BOOST_BUILD_PCH_ENABLED
-#define BOOST_MATH_OVERFLOW_ERROR_POLICY ignore_error
-#include <boost/math/special_functions.hpp>
-#endif
-
-#define BOOST_MATH_TEST_TYPE float
-#include "test_instances.hpp"
-
Modified: branches/release/libs/math/test/hypot_test.cpp
==============================================================================
--- branches/release/libs/math/test/hypot_test.cpp (original)
+++ branches/release/libs/math/test/hypot_test.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -6,7 +6,8 @@
#include <pch_light.hpp>
#define BOOST_MATH_OVERFLOW_ERROR_POLICY ignore_error
-#include <boost/test/test_exec_monitor.hpp>
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp>
#include <boost/test/floating_point_comparison.hpp>
#include <boost/math/special_functions/math_fwd.hpp>
@@ -121,10 +122,9 @@
}
}
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
BOOST_MATH_CONTROL_FP;
test_boundaries();
test_spots();
- return 0;
}
Deleted: branches/release/libs/math/test/ldouble_test_instances.cpp
==============================================================================
--- branches/release/libs/math/test/ldouble_test_instances.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
+++ (empty file)
@@ -1,20 +0,0 @@
-// Copyright John Maddock 2011.
-// 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 "pch.hpp"
-
-#ifndef BOOST_BUILD_PCH_ENABLED
-#define BOOST_MATH_OVERFLOW_ERROR_POLICY ignore_error
-#include <boost/math/special_functions.hpp>
-#endif
-
-#include <boost/math/tools/config.hpp>
-
-#ifndef BOOST_MATH_NO_LONG_DOUBLE_MATH_FUNCTIONS
-
-#define BOOST_MATH_TEST_TYPE long double
-#include "test_instances.hpp"
-
-#endif
Modified: branches/release/libs/math/test/log1p_expm1_test.cpp
==============================================================================
--- branches/release/libs/math/test/log1p_expm1_test.cpp (original)
+++ branches/release/libs/math/test/log1p_expm1_test.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -12,7 +12,8 @@
#define BOOST_MATH_OVERFLOW_ERROR_POLICY ignore_error
#include <boost/math/concepts/real_concept.hpp>
-#include <boost/test/test_exec_monitor.hpp>
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp>
#include <boost/test/floating_point_comparison.hpp>
#include <boost/math/special_functions/math_fwd.hpp>
#include "log1p_expm1_test.hpp"
@@ -66,7 +67,7 @@
}
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
expected_results();
BOOST_MATH_CONTROL_FP;
@@ -88,6 +89,5 @@
"not available at all, or because they are too inaccurate for these tests "
"to pass.</note>" << std::cout;
#endif
- return 0;
}
Modified: branches/release/libs/math/test/log1p_expm1_test.hpp
==============================================================================
--- branches/release/libs/math/test/log1p_expm1_test.hpp (original)
+++ branches/release/libs/math/test/log1p_expm1_test.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -69,12 +69,12 @@
static const T zero = 0;
static const T m_one = -1;
BOOST_CHECK_EQUAL(boost::math::log1p(zero), zero);
- BOOST_CHECK_EQUAL(boost::math::log1p(-zero), zero);
+ BOOST_CHECK_EQUAL(boost::math::log1p(T(-zero)), zero);
BOOST_CHECK_EQUAL(boost::math::expm1(zero), zero);
if(std::numeric_limits<T>::has_infinity)
{
BOOST_CHECK_EQUAL(boost::math::log1p(m_one), -std::numeric_limits<T>::infinity());
- BOOST_CHECK_EQUAL(boost::math::expm1(-std::numeric_limits<T>::infinity()), m_one);
+ BOOST_CHECK_EQUAL(boost::math::expm1(T(-std::numeric_limits<T>::infinity())), m_one);
BOOST_CHECK_EQUAL(boost::math::expm1(std::numeric_limits<T>::infinity()), std::numeric_limits<T>::infinity());
#ifndef __BORLANDC__
// When building with Borland's compiler, simply the *presence*
Modified: branches/release/libs/math/test/pch.hpp
==============================================================================
--- branches/release/libs/math/test/pch.hpp (original)
+++ branches/release/libs/math/test/pch.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -6,8 +6,6 @@
#ifdef BOOST_BUILD_PCH_ENABLED
#define BOOST_MATH_OVERFLOW_ERROR_POLICY ignore_error
-#include <boost/test/test_exec_monitor.hpp>
-#include <boost/test/floating_point_comparison.hpp>
#include <boost/math/special_functions.hpp>
#include <boost/math/distributions.hpp>
#include <boost/math/tools/test.hpp>
Modified: branches/release/libs/math/test/pch_light.hpp
==============================================================================
--- branches/release/libs/math/test/pch_light.hpp (original)
+++ branches/release/libs/math/test/pch_light.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -6,8 +6,6 @@
#ifdef BOOST_BUILD_PCH_ENABLED
#define BOOST_MATH_OVERFLOW_ERROR_POLICY ignore_error
-#include <boost/test/test_exec_monitor.hpp>
-#include <boost/test/floating_point_comparison.hpp>
#include <boost/math/special_functions/math_fwd.hpp>
#include <boost/math/tools/test.hpp>
#include <boost/math/tools/stats.hpp>
Modified: branches/release/libs/math/test/pow_test.cpp
==============================================================================
--- branches/release/libs/math/test/pow_test.cpp (original)
+++ branches/release/libs/math/test/pow_test.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -11,7 +11,8 @@
#include <iostream>
#include <boost/math/concepts/real_concept.hpp>
-#include <boost/test/test_exec_monitor.hpp>
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp>
#include <boost/test/floating_point_comparison.hpp>
#include <boost/typeof/typeof.hpp>
@@ -141,7 +142,7 @@
== 456.78);
}
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
using namespace std;
@@ -195,8 +196,6 @@
test_return_types();
test_error_policy();
-
- return 0;
}
/*
Modified: branches/release/libs/math/test/powm1_sqrtp1m1_test.cpp
==============================================================================
--- branches/release/libs/math/test/powm1_sqrtp1m1_test.cpp (original)
+++ branches/release/libs/math/test/powm1_sqrtp1m1_test.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -6,7 +6,8 @@
#include <pch_light.hpp>
#include <boost/math/concepts/real_concept.hpp>
-#include <boost/test/test_exec_monitor.hpp>
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp>
#include <boost/test/floating_point_comparison.hpp>
#include <boost/math/special_functions/math_fwd.hpp>
#include <boost/math/tools/test.hpp>
@@ -55,7 +56,7 @@
<< BOOST_STDLIB << ", " << BOOST_PLATFORM << std::endl;
}
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
expected_results();
BOOST_MATH_CONTROL_FP;
@@ -72,7 +73,6 @@
"not available at all, or because they are too inaccurate for these tests "
"to pass.</note>" << std::cout;
#endif
- return 0;
}
Deleted: branches/release/libs/math/test/real_concept_test_instances.cpp
==============================================================================
--- branches/release/libs/math/test/real_concept_test_instances.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
+++ (empty file)
@@ -1,21 +0,0 @@
-// Copyright John Maddock 2011.
-// 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 "pch.hpp"
-
-#ifndef BOOST_BUILD_PCH_ENABLED
-#define BOOST_MATH_OVERFLOW_ERROR_POLICY ignore_error
-#include <boost/math/special_functions.hpp>
-#endif
-
-#include <boost/math/tools/config.hpp>
-#include <boost/math/concepts/real_concept.hpp>
-
-#ifndef BOOST_MATH_NO_LONG_DOUBLE_MATH_FUNCTIONS
-
-#define BOOST_MATH_TEST_TYPE boost::math::concepts::real_concept
-#include "test_instances.hpp"
-
-#endif
Modified: branches/release/libs/math/test/sinc_test.hpp
==============================================================================
--- branches/release/libs/math/test/sinc_test.hpp (original)
+++ branches/release/libs/math/test/sinc_test.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -14,7 +14,7 @@
#include <boost/math/special_functions/sinc.hpp>
-
+#define BOOST_TEST_MAIN
#include <boost/test/unit_test.hpp>
Modified: branches/release/libs/math/test/sinhc_test.hpp
==============================================================================
--- branches/release/libs/math/test/sinhc_test.hpp (original)
+++ branches/release/libs/math/test/sinhc_test.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -14,7 +14,7 @@
#include <boost/math/special_functions/sinhc.hpp>
-
+#define BOOST_TEST_MAIN
#include <boost/test/unit_test.hpp>
Modified: branches/release/libs/math/test/test_airy.cpp
==============================================================================
--- branches/release/libs/math/test/test_airy.cpp (original)
+++ branches/release/libs/math/test/test_airy.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -6,7 +6,8 @@
#include <pch_light.hpp>
#define BOOST_MATH_OVERFLOW_ERROR_POLICY ignore_error
-#include <boost/test/test_exec_monitor.hpp>
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp>
#include <boost/test/floating_point_comparison.hpp>
#include <boost/math/special_functions/math_fwd.hpp>
#include <boost/math/concepts/real_concept.hpp>
@@ -57,7 +58,7 @@
}
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
#ifdef TEST_GSL
gsl_set_error_handler_off();
@@ -77,7 +78,6 @@
"not available at all, or because they are too inaccurate for these tests "
"to pass.</note>" << std::cout;
#endif
- return 0;
}
Modified: branches/release/libs/math/test/test_bernoulli.cpp
==============================================================================
--- branches/release/libs/math/test/test_bernoulli.cpp (original)
+++ branches/release/libs/math/test/test_bernoulli.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -26,7 +26,8 @@
#include <boost/math/distributions/bernoulli.hpp> // for bernoulli_distribution
using boost::math::bernoulli_distribution;
-#include <boost/test/test_exec_monitor.hpp> // for test_main
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp> // for test_main
#include <boost/test/floating_point_comparison.hpp> // for BOOST_CHECK_CLOSE_FRACTION, BOOST_CHECK_EQUAL...
#include <iostream>
@@ -260,7 +261,7 @@
} // template <class RealType>void test_spots(RealType)
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
BOOST_MATH_CONTROL_FP;
// Check that can generate bernoulli distribution using both convenience methods:
@@ -295,8 +296,7 @@
test_spots(boost::math::concepts::real_concept(0.)); // Test real concept.
#endif
- return 0;
-} // int test_main(int, char* [])
+} // BOOST_AUTO_TEST_CASE( test_main )
/*
Modified: branches/release/libs/math/test/test_bessel_i.cpp
==============================================================================
--- branches/release/libs/math/test/test_bessel_i.cpp (original)
+++ branches/release/libs/math/test/test_bessel_i.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -87,7 +87,7 @@
".*", // platform
largest_type, // test type(s)
".*", // test data group
- ".*", 15, 10); // test function
+ ".*", 20, 10); // test function
//
// Set error rates a little higher for real_concept -
// now that we use a series approximation for small z
@@ -110,7 +110,7 @@
<< BOOST_STDLIB << ", " << BOOST_PLATFORM << std::endl;
}
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
#ifdef TEST_GSL
gsl_set_error_handler_off();
@@ -133,7 +133,6 @@
"not available at all, or because they are too inaccurate for these tests "
"to pass.</note>" << std::cout;
#endif
- return 0;
}
Modified: branches/release/libs/math/test/test_bessel_i.hpp
==============================================================================
--- branches/release/libs/math/test/test_bessel_i.hpp (original)
+++ branches/release/libs/math/test/test_bessel_i.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -5,7 +5,8 @@
#define BOOST_MATH_OVERFLOW_ERROR_POLICY ignore_error
#include <boost/math/concepts/real_concept.hpp>
-#include <boost/test/test_exec_monitor.hpp>
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp>
#include <boost/test/floating_point_comparison.hpp>
#include <boost/math/special_functions/math_fwd.hpp>
#include <boost/type_traits/is_floating_point.hpp>
Modified: branches/release/libs/math/test/test_bessel_j.cpp
==============================================================================
--- branches/release/libs/math/test/test_bessel_j.cpp (original)
+++ branches/release/libs/math/test/test_bessel_j.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -254,14 +254,7 @@
".*", // stdlib
".*", // platform
largest_type, // test type(s)
- ".*JN.*Integer.*", // test data group
- ".*", 30000, 10000); // test function
- add_expected_result(
- ".*", // compiler
- ".*", // stdlib
- ".*", // platform
- largest_type, // test type(s)
- ".*(JN|j).*|.*Tricky.*", // test data group
+ "Bessel j:.*|Bessel JN: Mathworld.*|.*Tricky.*", // test data group
".*", 1500, 700); // test function
add_expected_result(
".*", // compiler
@@ -288,7 +281,7 @@
<< BOOST_STDLIB << ", " << BOOST_PLATFORM << std::endl;
}
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
#ifdef TEST_GSL
gsl_set_error_handler_off();
@@ -309,7 +302,6 @@
"not available at all, or because they are too inaccurate for these tests "
"to pass.</note>" << std::cout;
#endif
- return 0;
}
Modified: branches/release/libs/math/test/test_bessel_j.hpp
==============================================================================
--- branches/release/libs/math/test/test_bessel_j.hpp (original)
+++ branches/release/libs/math/test/test_bessel_j.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -5,7 +5,8 @@
#define BOOST_MATH_OVERFLOW_ERROR_POLICY ignore_error
#include <boost/math/concepts/real_concept.hpp>
-#include <boost/test/test_exec_monitor.hpp>
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp>
#include <boost/test/floating_point_comparison.hpp>
#include <boost/math/special_functions/math_fwd.hpp>
#include <boost/math/constants/constants.hpp>
@@ -185,10 +186,11 @@
{{ SC_(1), T(10667654)/(1024*1024), SC_(1.24591331097191900488116495350277530373473085499043086981229e-7) }},
}};
- static const boost::array<boost::array<typename table_type<T>::type, 3>, 16> jn_data = {{
+ static const boost::array<boost::array<typename table_type<T>::type, 3>, 17> jn_data = {{
// This first one is a modified test case from https://svn.boost.org/trac/boost/ticket/2733
{{ SC_(-1), SC_(1.25), SC_(-0.510623260319880467069474837274910375352924050139633057168856) }},
{{ SC_(2), SC_(0), SC_(0) }},
+ {{ SC_(-2), SC_(0), SC_(0) }},
{{ SC_(2), SC_(1e-02), SC_(1.249989583365885362413250958437642113452e-05) }},
{{ SC_(5), SC_(10), SC_(-0.2340615281867936404436949416457777864635) }},
{{ SC_(5), SC_(-10), SC_(0.2340615281867936404436949416457777864635) }},
@@ -216,8 +218,9 @@
do_test_cyl_bessel_j_int<T>(j1_tricky, name, "Bessel J1: Mathworld Data (tricky cases) (Integer Version)");
do_test_cyl_bessel_j_int<T>(jn_data, name, "Bessel JN: Mathworld Data (Integer Version)");
- static const boost::array<boost::array<T, 3>, 20> jv_data = {{
+ static const boost::array<boost::array<T, 3>, 21> jv_data = {{
//SC_(-2.4), {{ SC_(0), std::numeric_limits<T>::infinity() }},
+ {{ T(22.5), T(0), SC_(0) }},
{{ T(2457)/1024, T(1)/1024, SC_(3.80739920118603335646474073457326714709615200130620574875292e-9) }},
{{ SC_(5.5), T(3217)/1024, SC_(0.0281933076257506091621579544064767140470089107926550720453038) }},
{{ SC_(-5.5), T(3217)/1024, SC_(-2.55820064470647911823175836997490971806135336759164272675969) }},
@@ -262,5 +265,12 @@
#include "sph_bessel_data.ipp"
do_test_sph_bessel_j<T>(sph_bessel_data, name, "Bessel j: Random Data");
+
+ //
+ // Special cases that are errors:
+ //
+ BOOST_CHECK_THROW(boost::math::cyl_bessel_j(T(-2.5), T(0)), std::domain_error);
+ BOOST_CHECK_THROW(boost::math::cyl_bessel_j(T(-2.5), T(-2)), std::domain_error);
+ BOOST_CHECK_THROW(boost::math::cyl_bessel_j(T(2.5), T(-2)), std::domain_error);
}
Modified: branches/release/libs/math/test/test_bessel_k.cpp
==============================================================================
--- branches/release/libs/math/test/test_bessel_k.cpp (original)
+++ branches/release/libs/math/test/test_bessel_k.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -85,7 +85,7 @@
".*", // platform
largest_type, // test type(s)
".*large.*", // test data group
- ".*", 80, 50); // test function
+ ".*", 100, 50); // test function
add_expected_result(
".*", // compiler
".*", // stdlib
@@ -101,7 +101,7 @@
<< BOOST_STDLIB << ", " << BOOST_PLATFORM << std::endl;
}
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
#ifdef TEST_GSL
gsl_set_error_handler_off();
@@ -124,7 +124,6 @@
"not available at all, or because they are too inaccurate for these tests "
"to pass.</note>" << std::cout;
#endif
- return 0;
}
Modified: branches/release/libs/math/test/test_bessel_k.hpp
==============================================================================
--- branches/release/libs/math/test/test_bessel_k.hpp (original)
+++ branches/release/libs/math/test/test_bessel_k.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -5,7 +5,8 @@
#define BOOST_MATH_OVERFLOW_ERROR_POLICY ignore_error
#include <boost/math/concepts/real_concept.hpp>
-#include <boost/test/test_exec_monitor.hpp>
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp>
#include <boost/test/floating_point_comparison.hpp>
#include <boost/math/special_functions/math_fwd.hpp>
#include <boost/type_traits/is_floating_point.hpp>
Modified: branches/release/libs/math/test/test_bessel_y.cpp
==============================================================================
--- branches/release/libs/math/test/test_bessel_y.cpp (original)
+++ branches/release/libs/math/test/test_bessel_y.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -191,13 +191,6 @@
".*", // compiler
".*", // stdlib
".*", // platform
- largest_type, // test type(s)
- ".*Y0.*Random.*", // test data group
- ".*", 600, 400); // test function
- add_expected_result(
- ".*", // compiler
- ".*", // stdlib
- ".*", // platform
"real_concept", // test type(s)
".*(Y[nv]|y).*Random.*", // test data group
".*", 2000, 2000); // test function
@@ -246,7 +239,7 @@
<< BOOST_STDLIB << ", " << BOOST_PLATFORM << std::endl;
}
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
#ifdef TEST_GSL
gsl_set_error_handler_off();
@@ -269,7 +262,6 @@
"not available at all, or because they are too inaccurate for these tests "
"to pass.</note>" << std::cout;
#endif
- return 0;
}
Modified: branches/release/libs/math/test/test_bessel_y.hpp
==============================================================================
--- branches/release/libs/math/test/test_bessel_y.hpp (original)
+++ branches/release/libs/math/test/test_bessel_y.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -5,7 +5,8 @@
#define BOOST_MATH_OVERFLOW_ERROR_POLICY ignore_error
#include <boost/math/concepts/real_concept.hpp>
-#include <boost/test/test_exec_monitor.hpp>
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp>
#include <boost/test/floating_point_comparison.hpp>
#include <boost/math/special_functions/math_fwd.hpp>
#include <boost/math/constants/constants.hpp>
Modified: branches/release/libs/math/test/test_beta.cpp
==============================================================================
--- branches/release/libs/math/test/test_beta.cpp (original)
+++ branches/release/libs/math/test/test_beta.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -100,7 +100,7 @@
<< BOOST_STDLIB << ", " << BOOST_PLATFORM << std::endl;
}
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
expected_results();
BOOST_MATH_CONTROL_FP;
@@ -133,7 +133,6 @@
"not available at all, or because they are too inaccurate for these tests "
"to pass.</note>" << std::cout;
#endif
- return 0;
}
Modified: branches/release/libs/math/test/test_beta.hpp
==============================================================================
--- branches/release/libs/math/test/test_beta.hpp (original)
+++ branches/release/libs/math/test/test_beta.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -11,7 +11,8 @@
#endif
#include <boost/math/concepts/real_concept.hpp>
-#include <boost/test/test_exec_monitor.hpp>
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp>
#include <boost/test/floating_point_comparison.hpp>
#include <boost/math/special_functions/math_fwd.hpp>
#include <boost/math/tools/stats.hpp>
Modified: branches/release/libs/math/test/test_beta_dist.cpp
==============================================================================
--- branches/release/libs/math/test/test_beta_dist.cpp (original)
+++ branches/release/libs/math/test/test_beta_dist.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -39,7 +39,8 @@
using boost::math::beta_distribution;
using boost::math::beta;
-#include <boost/test/test_exec_monitor.hpp> // for test_main
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp> // for test_main
#include <boost/test/floating_point_comparison.hpp> // for BOOST_CHECK_CLOSE_FRACTION
#include "test_out_of_range.hpp"
@@ -523,7 +524,7 @@
} // template <class RealType>void test_spots(RealType)
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
BOOST_MATH_CONTROL_FP;
// Check that can generate beta distribution using one convenience methods:
@@ -615,8 +616,7 @@
test_spots(boost::math::concepts::real_concept(0.)); // Test real concept.
#endif
#endif
- return 0;
-} // int test_main(int, char* [])
+} // BOOST_AUTO_TEST_CASE( test_main )
/*
Modified: branches/release/libs/math/test/test_binomial.cpp
==============================================================================
--- branches/release/libs/math/test/test_binomial.cpp (original)
+++ branches/release/libs/math/test/test_binomial.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -33,7 +33,8 @@
#include <boost/math/distributions/binomial.hpp> // for binomial_distribution
using boost::math::binomial_distribution;
-#include <boost/test/test_exec_monitor.hpp> // for test_main
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp> // for test_main
#include <boost/test/floating_point_comparison.hpp> // for BOOST_CHECK_CLOSE
#include "table_type.hpp"
@@ -717,7 +718,7 @@
} // template <class RealType>void test_spots(RealType)
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
BOOST_MATH_CONTROL_FP;
// Check that can generate binomial distribution using one convenience methods:
@@ -751,8 +752,7 @@
"to pass.</note>" << std::cout;
#endif
- return 0;
-} // int test_main(int, char* [])
+} // BOOST_AUTO_TEST_CASE( test_main )
/*
Modified: branches/release/libs/math/test/test_binomial_coeff.cpp
==============================================================================
--- branches/release/libs/math/test/test_binomial_coeff.cpp (original)
+++ branches/release/libs/math/test/test_binomial_coeff.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -111,7 +111,7 @@
BOOST_CHECK_CLOSE(boost::math::binomial_coefficient<T>(300, 275), static_cast<T>(1.953265141442868389822364184842211512000000e36L), tolerance);
}
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
expected_results();
BOOST_MATH_CONTROL_FP;
@@ -136,7 +136,6 @@
"not available at all, or because they are too inaccurate for these tests "
"to pass.</note>" << std::cout;
#endif
- return 0;
}
Modified: branches/release/libs/math/test/test_binomial_coeff.hpp
==============================================================================
--- branches/release/libs/math/test/test_binomial_coeff.hpp (original)
+++ branches/release/libs/math/test/test_binomial_coeff.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -5,7 +5,8 @@
// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
#include <boost/math/concepts/real_concept.hpp>
-#include <boost/test/test_exec_monitor.hpp>
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp>
#include <boost/test/floating_point_comparison.hpp>
#include <boost/math/special_functions/binomial.hpp>
#include <boost/math/special_functions/trunc.hpp>
Modified: branches/release/libs/math/test/test_carlson.cpp
==============================================================================
--- branches/release/libs/math/test/test_carlson.cpp (original)
+++ branches/release/libs/math/test/test_carlson.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -112,7 +112,7 @@
}
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
expected_results();
BOOST_MATH_CONTROL_FP;
@@ -132,8 +132,6 @@
"not available at all, or because they are too inaccurate for these tests "
"to pass.</note>" << std::cout;
#endif
-
- return 0;
}
/*
Modified: branches/release/libs/math/test/test_carlson.hpp
==============================================================================
--- branches/release/libs/math/test/test_carlson.hpp (original)
+++ branches/release/libs/math/test/test_carlson.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -5,7 +5,8 @@
// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
#include <boost/math/concepts/real_concept.hpp>
-#include <boost/test/test_exec_monitor.hpp>
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp>
#include <boost/test/floating_point_comparison.hpp>
#include <boost/math/special_functions/math_fwd.hpp>
#include <boost/math/constants/constants.hpp>
Modified: branches/release/libs/math/test/test_cauchy.cpp
==============================================================================
--- branches/release/libs/math/test/test_cauchy.cpp (original)
+++ branches/release/libs/math/test/test_cauchy.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -25,7 +25,8 @@
#include "test_out_of_range.hpp"
-#include <boost/test/test_exec_monitor.hpp> // Boost.Test
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp> // Boost.Test
#include <boost/test/floating_point_comparison.hpp>
#include <iostream>
@@ -695,7 +696,7 @@
} // template <class RealType>void test_spots(RealType)
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
BOOST_MATH_CONTROL_FP;
// Check that can generate cauchy distribution using the two convenience methods:
@@ -721,8 +722,7 @@
"to pass.</note>" << std::cout;
#endif
- return 0;
-} // int test_main(int, char* [])
+} // BOOST_AUTO_TEST_CASE( test_main )
/*
Output:
Modified: branches/release/libs/math/test/test_cbrt.cpp
==============================================================================
--- branches/release/libs/math/test/test_cbrt.cpp (original)
+++ branches/release/libs/math/test/test_cbrt.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -73,7 +73,7 @@
<< BOOST_STDLIB << ", " << BOOST_PLATFORM << std::endl;
}
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
expected_results();
BOOST_MATH_CONTROL_FP;
@@ -85,6 +85,5 @@
test_cbrt(boost::math::concepts::real_concept(0.1), "real_concept");
#endif
#endif
- return 0;
}
Modified: branches/release/libs/math/test/test_cbrt.hpp
==============================================================================
--- branches/release/libs/math/test/test_cbrt.hpp (original)
+++ branches/release/libs/math/test/test_cbrt.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -5,7 +5,8 @@
// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
#include <boost/math/concepts/real_concept.hpp>
-#include <boost/test/test_exec_monitor.hpp>
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp>
#include <boost/test/floating_point_comparison.hpp>
#include <boost/math/tools/stats.hpp>
#include <boost/math/tools/test.hpp>
@@ -29,7 +30,7 @@
template <class S>
Real operator()(const S& row)
{
- return boost::math::cbrt(-Real(row[1]));
+ return boost::math::cbrt(Real(-Real(row[1])));
}
};
Modified: branches/release/libs/math/test/test_chi_squared.cpp
==============================================================================
--- branches/release/libs/math/test/test_chi_squared.cpp (original)
+++ branches/release/libs/math/test/test_chi_squared.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -23,7 +23,8 @@
using boost::math::chi_squared_distribution;
using boost::math::chi_squared;
-#include <boost/test/test_exec_monitor.hpp> // for test_main
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp> // for test_main
#include <boost/test/floating_point_comparison.hpp> // for BOOST_CHECK_CLOSE
#include "test_out_of_range.hpp"
@@ -534,7 +535,7 @@
} // template <class RealType>void test_spots(RealType)
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
BOOST_MATH_CONTROL_FP;
// Check that can generate chi_squared distribution using the two convenience methods:
@@ -552,8 +553,7 @@
test_spots(boost::math::concepts::real_concept(0.)); // Test real concept.
#endif
#endif
- return 0;
-} // int test_main(int, char* [])
+} // BOOST_AUTO_TEST_CASE( test_main )
/*
Modified: branches/release/libs/math/test/test_classify.cpp
==============================================================================
--- branches/release/libs/math/test/test_classify.cpp (original)
+++ branches/release/libs/math/test/test_classify.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -11,7 +11,8 @@
#include <boost/limits.hpp>
#include <boost/math/concepts/real_concept.hpp>
#include <boost/math/special_functions/fpclassify.hpp>
-#include <boost/test/test_exec_monitor.hpp>
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp>
#ifdef _MSC_VER
#pragma warning(disable: 4127 4146) // conditional expression is constant
@@ -250,7 +251,7 @@
#endif
}
-int test_main(int, char* [] )
+BOOST_AUTO_TEST_CASE( test_main )
{
BOOST_MATH_CONTROL_FP;
// start by printing some information:
@@ -279,7 +280,6 @@
// We should test with integer types as well:
test_classify(int(0), "int");
test_classify(unsigned(0), "unsigned");
- return 0;
}
/*
Modified: branches/release/libs/math/test/test_constant_generate.cpp
==============================================================================
--- branches/release/libs/math/test/test_constant_generate.cpp (original)
+++ branches/release/libs/math/test/test_constant_generate.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -50,6 +50,7 @@
BOOST_CONSTANTS_GENERATE(root_pi);
BOOST_CONSTANTS_GENERATE(root_half_pi);
BOOST_CONSTANTS_GENERATE(root_two_pi);
+ BOOST_CONSTANTS_GENERATE(log_root_two_pi);
BOOST_CONSTANTS_GENERATE(two_div_pi);
BOOST_CONSTANTS_GENERATE(root_two_div_pi);
Modified: branches/release/libs/math/test/test_constants.cpp
==============================================================================
--- branches/release/libs/math/test/test_constants.cpp (original)
+++ branches/release/libs/math/test/test_constants.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -20,7 +20,8 @@
#endif
#include <boost/math/concepts/real_concept.hpp> // for real_concept
-#include <boost/test/test_exec_monitor.hpp> // Boost.Test
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp> // Boost.Test
#include <boost/test/floating_point_comparison.hpp>
#include <boost/math/constants/constants.hpp>
@@ -39,10 +40,25 @@
// Policy with precision +2 (could be any reasonable value),
// forces the precision of the policy to be greater than
// that of a long double, and therefore triggers different code (construct from string).
+#ifdef BOOST_MATH_USE_FLOAT128
+typedef boost::math::policies::policy<boost::math::policies::digits2<115> > real_concept_policy_2;
+#else
typedef boost::math::policies::policy<boost::math::policies::digits2<std::numeric_limits<long double>::digits + 2> > real_concept_policy_2;
+#endif
+// Policy with precision greater than the string representations, forces computation of values (i.e. different code path):
+typedef boost::math::policies::policy<boost::math::policies::digits2<400> > real_concept_policy_3;
BOOST_STATIC_ASSERT((boost::is_same<boost::math::constants::construction_traits<boost::math::concepts::real_concept, real_concept_policy_1 >::type, boost::mpl::int_<(sizeof(double) == sizeof(long double) ? boost::math::constants::construct_from_double : boost::math::constants::construct_from_long_double) > >::value));
BOOST_STATIC_ASSERT((boost::is_same<boost::math::constants::construction_traits<boost::math::concepts::real_concept, real_concept_policy_2 >::type, boost::mpl::int_<boost::math::constants::construct_from_string> >::value));
+BOOST_STATIC_ASSERT((boost::math::constants::construction_traits<boost::math::concepts::real_concept, real_concept_policy_3>::type::value >= 5));
+
+#ifndef BOOST_NO_CXX11_CONSTEXPR
+
+constexpr float fval = boost::math::constants::pi<float>();
+constexpr double dval = boost::math::constants::pi<double>();
+constexpr long double ldval = boost::math::constants::pi<long double>();
+
+#endif
// We need to declare a conceptual type whose precision is unknown at
// compile time, and is so enormous when checked at runtime,
@@ -605,6 +621,8 @@
using boost::math::concepts::real_concept;
boost::math::concepts::real_concept tolerance = boost::math::tools::epsilon<real_concept>() * 2; // double
+ if(Policy::precision_type::value > 200)
+ tolerance *= 50;
std::cout << "Tolerance for type " << typeid(real_concept).name() << " is " << tolerance << "." << std::endl;
//typedef typename boost::math::policies::precision<boost::math::concepts::real_concept, boost::math::policies::policy<> >::type t1;
@@ -738,16 +756,51 @@
} // template <class boost::math::concepts::real_concept>void test_spots(boost::math::concepts::real_concept)
-int test_main(int, char* [])
+#ifdef BOOST_MATH_USE_FLOAT128
+void test_float128()
+{
+ static const __float128 eps = 1.92592994438723585305597794258492732e-34Q;
+
+ __float128 p = boost::math::constants::pi<__float128>();
+ __float128 r = 3.14159265358979323846264338327950288419716939937510582097494459230781640628620899862803482534211706798214808651Q;
+ __float128 err = (p - r) / r;
+ if(err < 0)
+ err = -err;
+ BOOST_CHECK(err < 2 * eps);
+}
+#endif
+
+void test_constexpr()
+{
+#ifndef BOOST_NO_CXX11_CONSTEXPR
+ constexpr float f1 = boost::math::constants::pi<float>();
+ constexpr double f2 = boost::math::constants::pi<double>();
+ constexpr long double f3 = boost::math::constants::pi<long double>();
+ (void)f1;
+ (void)f2;
+ (void)f3;
+#ifdef BOOST_MATH_USE_FLOAT128
+ constexpr __float128 f4 = boost::math::constants::pi<__float128>();
+ (void)f4;
+#endif
+#endif
+}
+
+BOOST_AUTO_TEST_CASE( test_main )
{
// Basic sanity-check spot values.
test_float_spots(); // Test float_constants, like boost::math::float_constants::pi;
test_double_spots(); // Test double_constants.
test_long_double_spots(); // Test long_double_constants.
+#ifdef BOOST_MATH_USE_FLOAT128
+ test_float128();
+#endif
+ test_constexpr();
test_real_concept_policy(real_concept_policy_1());
test_real_concept_policy(real_concept_policy_2()); // Increased precision forcing construction from string.
+ test_real_concept_policy(real_concept_policy_3()); // Increased precision forcing caching of computed values.
test_real_concept_policy(boost::math::policies::policy<>()); // Default.
// (Parameter value, arbitrarily zero, only communicates the floating-point type).
@@ -766,8 +819,7 @@
"to pass.</note>" << std::cout;
#endif
- return 0;
-} // int test_main(int, char* [])
+} // BOOST_AUTO_TEST_CASE( test_main )
/*
Modified: branches/release/libs/math/test/test_digamma.cpp
==============================================================================
--- branches/release/libs/math/test/test_digamma.cpp (original)
+++ branches/release/libs/math/test/test_digamma.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -89,7 +89,7 @@
BOOST_CHECK_CLOSE(::boost::math::digamma(static_cast<T>(-1.5)), static_cast<T>(0.70315664064524318722569033366791109947350706200623L), tolerance);
}
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
BOOST_MATH_CONTROL_FP;
test_spots(0.0F, "float");
@@ -114,7 +114,6 @@
"not available at all, or because they are too inaccurate for these tests "
"to pass.</note>" << std::cout;
#endif
- return 0;
}
Modified: branches/release/libs/math/test/test_digamma.hpp
==============================================================================
--- branches/release/libs/math/test/test_digamma.hpp (original)
+++ branches/release/libs/math/test/test_digamma.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -5,7 +5,8 @@
// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
#include <boost/math/concepts/real_concept.hpp>
-#include <boost/test/test_exec_monitor.hpp>
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp>
#include <boost/test/floating_point_comparison.hpp>
#include <boost/math/special_functions/math_fwd.hpp>
#include <boost/array.hpp>
Modified: branches/release/libs/math/test/test_dist_overloads.cpp
==============================================================================
--- branches/release/libs/math/test/test_dist_overloads.cpp (original)
+++ branches/release/libs/math/test/test_dist_overloads.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -12,7 +12,8 @@
#include <boost/math/distributions/normal.hpp>
using boost::math::normal_distribution;
-#include <boost/test/test_exec_monitor.hpp> // Boost.Test
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp> // Boost.Test
#include <boost/test/floating_point_comparison.hpp>
#include <iostream>
@@ -65,7 +66,7 @@
}
} // template <class RealType>void test_spots(RealType)
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
// Basic sanity-check spot values.
// (Parameter value, arbitrarily zero, only communicates the floating point type).
@@ -83,8 +84,7 @@
"to pass.</note>" << std::cout;
#endif
- return 0;
-} // int test_main(int, char* [])
+} // BOOST_AUTO_TEST_CASE( test_main )
/*
Modified: branches/release/libs/math/test/test_ellint_1.cpp
==============================================================================
--- branches/release/libs/math/test/test_ellint_1.cpp (original)
+++ branches/release/libs/math/test/test_ellint_1.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -79,7 +79,7 @@
}
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
expected_results();
BOOST_MATH_CONTROL_FP;
@@ -98,5 +98,4 @@
"to pass.</note>" << std::cout;
#endif
- return 0;
}
Modified: branches/release/libs/math/test/test_ellint_1.hpp
==============================================================================
--- branches/release/libs/math/test/test_ellint_1.hpp (original)
+++ branches/release/libs/math/test/test_ellint_1.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -10,7 +10,8 @@
#endif
#include <boost/math/concepts/real_concept.hpp>
-#include <boost/test/test_exec_monitor.hpp>
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp>
#include <boost/test/floating_point_comparison.hpp>
#include <boost/math/special_functions/math_fwd.hpp>
#include <boost/array.hpp>
Modified: branches/release/libs/math/test/test_ellint_2.cpp
==============================================================================
--- branches/release/libs/math/test/test_ellint_2.cpp (original)
+++ branches/release/libs/math/test/test_ellint_2.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -79,7 +79,7 @@
}
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
expected_results();
BOOST_MATH_CONTROL_FP;
@@ -99,5 +99,4 @@
"to pass.</note>" << std::cout;
#endif
- return 0;
}
Modified: branches/release/libs/math/test/test_ellint_2.hpp
==============================================================================
--- branches/release/libs/math/test/test_ellint_2.hpp (original)
+++ branches/release/libs/math/test/test_ellint_2.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -10,7 +10,8 @@
#endif
#include <boost/math/concepts/real_concept.hpp>
-#include <boost/test/test_exec_monitor.hpp>
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp>
#include <boost/test/floating_point_comparison.hpp>
#include <boost/math/special_functions/math_fwd.hpp>
#include <boost/array.hpp>
Modified: branches/release/libs/math/test/test_ellint_3.cpp
==============================================================================
--- branches/release/libs/math/test/test_ellint_3.cpp (original)
+++ branches/release/libs/math/test/test_ellint_3.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -92,7 +92,7 @@
<< BOOST_STDLIB << ", " << BOOST_PLATFORM << std::endl;
}
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
expected_results();
BOOST_MATH_CONTROL_FP;
@@ -110,5 +110,4 @@
"to pass.</note>" << std::cout;
#endif
- return 0;
}
Modified: branches/release/libs/math/test/test_ellint_3.hpp
==============================================================================
--- branches/release/libs/math/test/test_ellint_3.hpp (original)
+++ branches/release/libs/math/test/test_ellint_3.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -10,7 +10,8 @@
#endif
#include <boost/math/concepts/real_concept.hpp>
-#include <boost/test/test_exec_monitor.hpp>
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp>
#include <boost/test/floating_point_comparison.hpp>
#include <boost/math/special_functions/math_fwd.hpp>
#include <boost/array.hpp>
Modified: branches/release/libs/math/test/test_erf.cpp
==============================================================================
--- branches/release/libs/math/test/test_erf.cpp (original)
+++ branches/release/libs/math/test/test_erf.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -122,7 +122,7 @@
<< BOOST_STDLIB << ", " << BOOST_PLATFORM << std::endl;
}
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
BOOST_MATH_CONTROL_FP;
test_spots(0.0F, "float");
@@ -151,7 +151,6 @@
"not available at all, or because they are too inaccurate for these tests "
"to pass.</note>" << std::cout;
#endif
- return 0;
}
/*
Modified: branches/release/libs/math/test/test_erf.hpp
==============================================================================
--- branches/release/libs/math/test/test_erf.hpp (original)
+++ branches/release/libs/math/test/test_erf.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -5,7 +5,8 @@
// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
#include <boost/math/concepts/real_concept.hpp>
-#include <boost/test/test_exec_monitor.hpp>
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp>
#include <boost/test/floating_point_comparison.hpp>
#include <boost/math/special_functions/math_fwd.hpp>
#include <boost/math/constants/constants.hpp>
Modified: branches/release/libs/math/test/test_error_handling.cpp
==============================================================================
--- branches/release/libs/math/test/test_error_handling.cpp (original)
+++ branches/release/libs/math/test/test_error_handling.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -64,7 +64,8 @@
#include <boost/math/concepts/real_concept.hpp>
#include <boost/math/policies/policy.hpp>
#include <boost/math/policies/error_handling.hpp>
-#include <boost/test/test_exec_monitor.hpp> // for test_main
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp> // for test_main
#include <cerrno> // for errno
//
// Define some policies:
@@ -176,7 +177,7 @@
BOOST_CHECK_EQUAL(errno, EDOM);
}
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
// Test error handling.
// (Parameter value, arbitrarily zero, only communicates the floating point type FPT).
@@ -184,8 +185,7 @@
test_error(0.0); // Test double.
test_error(0.0L); // Test long double.
test_error(boost::math::concepts::real_concept(0.0L)); // Test concepts.
- return 0;
-} // int test_main(int, char* [])
+} // BOOST_AUTO_TEST_CASE( test_main )
/*
Modified: branches/release/libs/math/test/test_expint.cpp
==============================================================================
--- branches/release/libs/math/test/test_expint.cpp (original)
+++ branches/release/libs/math/test/test_expint.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -121,7 +121,7 @@
<< BOOST_STDLIB << ", " << BOOST_PLATFORM << std::endl;
}
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
expected_results();
BOOST_MATH_CONTROL_FP;
@@ -155,7 +155,6 @@
"not available at all, or because they are too inaccurate for these tests "
"to pass.</note>" << std::cout;
#endif
- return 0;
}
Modified: branches/release/libs/math/test/test_expint.hpp
==============================================================================
--- branches/release/libs/math/test/test_expint.hpp (original)
+++ branches/release/libs/math/test/test_expint.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -6,7 +6,8 @@
#include <boost/math/concepts/real_concept.hpp>
#include <boost/math/special_functions/math_fwd.hpp>
-#include <boost/test/test_exec_monitor.hpp>
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp>
#include <boost/test/floating_point_comparison.hpp>
#include <boost/math/tools/stats.hpp>
#include <boost/math/tools/test.hpp>
Modified: branches/release/libs/math/test/test_exponential_dist.cpp
==============================================================================
--- branches/release/libs/math/test/test_exponential_dist.cpp (original)
+++ branches/release/libs/math/test/test_exponential_dist.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -12,7 +12,8 @@
#include <boost/math/distributions/exponential.hpp>
using boost::math::exponential_distribution;
-#include <boost/test/test_exec_monitor.hpp> // Boost.Test
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp> // Boost.Test
#include <boost/test/floating_point_comparison.hpp>
#include "test_out_of_range.hpp"
@@ -263,7 +264,7 @@
}
} // template <class RealType>void test_spots(RealType)
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
// Check that can generate exponential distribution using the two convenience methods:
boost::math::exponential mycexp1(1.); // Using typedef
@@ -285,8 +286,7 @@
"to pass.</note>" << std::cout;
#endif
- return 0;
-} // int test_main(int, char* [])
+} // BOOST_AUTO_TEST_CASE( test_main )
/*
Modified: branches/release/libs/math/test/test_extreme_value.cpp
==============================================================================
--- branches/release/libs/math/test/test_extreme_value.cpp (original)
+++ branches/release/libs/math/test/test_extreme_value.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -11,7 +11,8 @@
#include <boost/math/distributions/extreme_value.hpp>
using boost::math::extreme_value_distribution;
-#include <boost/test/test_exec_monitor.hpp> // Boost.Test
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp> // Boost.Test
#include <boost/test/floating_point_comparison.hpp>
#include "test_out_of_range.hpp"
@@ -193,7 +194,7 @@
}
} // template <class RealType>void test_spots(RealType)
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
// Check that can generate extreme_value distribution using the two convenience methods:
@@ -216,8 +217,8 @@
"to pass.</note>" << std::cout;
#endif
- return 0;
-} // int test_main(int, char* [])
+
+} // BOOST_AUTO_TEST_CASE( test_main )
/*
Modified: branches/release/libs/math/test/test_factorials.cpp
==============================================================================
--- branches/release/libs/math/test/test_factorials.cpp (original)
+++ branches/release/libs/math/test/test_factorials.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -14,7 +14,8 @@
#define BOOST_MATH_OVERFLOW_ERROR_POLICY ignore_error
#include <boost/math/concepts/real_concept.hpp>
-#include <boost/test/test_exec_monitor.hpp>
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp>
#include <boost/test/floating_point_comparison.hpp>
#include <boost/math/special_functions/factorials.hpp>
#include <boost/math/special_functions/gamma.hpp>
@@ -286,7 +287,7 @@
}
} // template <class T> void test_spots(T)
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
BOOST_MATH_CONTROL_FP;
test_spots(0.0F);
@@ -321,7 +322,7 @@
- return 0;
+
}
/*
Modified: branches/release/libs/math/test/test_find_location.cpp
==============================================================================
--- branches/release/libs/math/test/test_find_location.cpp (original)
+++ branches/release/libs/math/test/test_find_location.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -29,7 +29,8 @@
#include <boost/math/policies/policy.hpp>
using boost::math::policies::policy;
-#include <boost/test/test_exec_monitor.hpp> // for test_main
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp> // for test_main
#include <boost/test/floating_point_comparison.hpp> // for BOOST_CHECK_CLOSE_FRACTION, BOOST_CHECK_EQUAL...
#include <iostream>
@@ -136,7 +137,7 @@
} // template <class RealType>void test_spots(RealType)
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
// Basic sanity-check spot values.
@@ -154,8 +155,8 @@
"not available at all, or because they are too inaccurate for these tests "
"to pass.</note>" << std::cout;
#endif
- return 0;
-} // int test_main(int, char* [])
+
+} // BOOST_AUTO_TEST_CASE( test_main )
/*
Modified: branches/release/libs/math/test/test_find_scale.cpp
==============================================================================
--- branches/release/libs/math/test/test_find_scale.cpp (original)
+++ branches/release/libs/math/test/test_find_scale.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -29,7 +29,8 @@
#include <boost/math/policies/policy.hpp>
using boost::math::policies::policy;
-#include <boost/test/test_exec_monitor.hpp> // for test_main
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp> // for test_main
#include <boost/test/floating_point_comparison.hpp> // for BOOST_CHECK_CLOSE_FRACTION, BOOST_CHECK_EQUAL...
#include <iostream>
@@ -170,7 +171,7 @@
} // template <class RealType>void test_spots(RealType)
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
// Basic sanity-check spot values.
@@ -188,8 +189,8 @@
"not available at all, or because they are too inaccurate for these tests "
"to pass.</note>" << std::cout;
#endif
- return 0;
-} // int test_main(int, char* [])
+
+} // BOOST_AUTO_TEST_CASE( test_main )
/*
Modified: branches/release/libs/math/test/test_fisher_f.cpp
==============================================================================
--- branches/release/libs/math/test/test_fisher_f.cpp (original)
+++ branches/release/libs/math/test/test_fisher_f.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -14,7 +14,8 @@
#include <boost/math/distributions/fisher_f.hpp> // for fisher_f_distribution
using boost::math::fisher_f_distribution;
-#include <boost/test/test_exec_monitor.hpp> // for test_main
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp> // for test_main
#include <boost/test/floating_point_comparison.hpp> // for BOOST_CHECK_CLOSE
#include "test_out_of_range.hpp"
@@ -502,7 +503,7 @@
check_out_of_range<fisher_f_distribution<RealType> >(2, 3);
} // template <class RealType>void test_spots(RealType)
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
// Check that can generate fisher distribution using the two convenience methods:
@@ -521,8 +522,8 @@
test_spots(boost::math::concepts::real_concept(0.)); // Test real concept.
#endif
#endif
- return 0;
-} // int test_main(int, char* [])
+
+} // BOOST_AUTO_TEST_CASE( test_main )
/*
Modified: branches/release/libs/math/test/test_gamma.cpp
==============================================================================
--- branches/release/libs/math/test/test_gamma.cpp (original)
+++ branches/release/libs/math/test/test_gamma.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -302,7 +302,7 @@
<< BOOST_STDLIB << ", " << BOOST_PLATFORM << std::endl;
}
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
expected_results();
BOOST_MATH_CONTROL_FP;
@@ -333,7 +333,7 @@
"not available at all, or because they are too inaccurate for these tests "
"to pass.</note>" << std::cout;
#endif
- return 0;
+
}
Modified: branches/release/libs/math/test/test_gamma.hpp
==============================================================================
--- branches/release/libs/math/test/test_gamma.hpp (original)
+++ branches/release/libs/math/test/test_gamma.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -8,7 +8,8 @@
#include <boost/math/concepts/real_concept.hpp>
#include <boost/math/special_functions/math_fwd.hpp>
-#include <boost/test/test_exec_monitor.hpp>
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp>
#include <boost/test/floating_point_comparison.hpp>
#include <boost/math/tools/stats.hpp>
#include <boost/math/tools/test.hpp>
@@ -179,6 +180,19 @@
// Lower tolerance on this one, is only really needed on Linux x86 systems, result is mostly down to std lib accuracy:
BOOST_CHECK_CLOSE(::boost::math::tgamma(static_cast<T>(-53249.0/1024)), static_cast<T>(-1.2646559519067605488251406578743995122462767733517e-65L), tolerance * 3);
+#ifdef BOOST_MSVC
+#pragma warning(push)
+#pragma warning(disable:4127)
+#endif
+ // Test bug fixes in tgamma:
+ if(std::numeric_limits<T>::max_exponent10 > 244)
+ {
+ BOOST_CHECK_CLOSE(::boost::math::tgamma(static_cast<T>(142.75)), static_cast<T>(7.8029496083318133344429227511387928576820621466e244L), tolerance * 4);
+ }
+#ifdef BOOST_MSVC
+#pragma warning(pop)
+#endif
+
int sign = 1;
BOOST_CHECK_CLOSE(::boost::math::lgamma(static_cast<T>(3.5), &sign), static_cast<T>(1.2009736023470742248160218814507129957702389154682L), tolerance);
BOOST_CHECK(sign == 1);
Modified: branches/release/libs/math/test/test_gamma_dist.cpp
==============================================================================
--- branches/release/libs/math/test/test_gamma_dist.cpp (original)
+++ branches/release/libs/math/test/test_gamma_dist.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -18,7 +18,8 @@
#include <pch.hpp> // include directory libs/math/src/tr1/ is needed.
#include <boost/math/concepts/real_concept.hpp> // for real_concept
-#include <boost/test/test_exec_monitor.hpp> // Boost.Test
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp> // Boost.Test
#include <boost/test/floating_point_comparison.hpp>
#include <boost/math/distributions/gamma.hpp>
@@ -215,15 +216,15 @@
// Rely on default definition in derived accessors.
// error tests
- check_out_of_range<gamma_distribution<RealType> >(1, 1);
- BOOST_CHECK_THROW(gamma_distribution<RealType>(0, 1), std::domain_error);
- BOOST_CHECK_THROW(gamma_distribution<RealType>(-1, 1), std::domain_error);
- BOOST_CHECK_THROW(gamma_distribution<RealType>(1, 0), std::domain_error);
- BOOST_CHECK_THROW(gamma_distribution<RealType>(1, -1), std::domain_error);
+ check_out_of_range<boost::math::gamma_distribution<RealType> >(1, 1);
+ BOOST_CHECK_THROW(boost::math::gamma_distribution<RealType>(0, 1), std::domain_error);
+ BOOST_CHECK_THROW(boost::math::gamma_distribution<RealType>(-1, 1), std::domain_error);
+ BOOST_CHECK_THROW(boost::math::gamma_distribution<RealType>(1, 0), std::domain_error);
+ BOOST_CHECK_THROW(boost::math::gamma_distribution<RealType>(1, -1), std::domain_error);
} // template <class RealType>void test_spots(RealType)
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
// Basic sanity-check spot values.
// (Parameter value, arbitrarily zero, only communicates the floating point type).
@@ -241,8 +242,8 @@
"to pass.</note>" << std::cout;
#endif
- return 0;
-} // int test_main(int, char* [])
+
+} // BOOST_AUTO_TEST_CASE( test_main )
/*
Modified: branches/release/libs/math/test/test_geometric.cpp
==============================================================================
--- branches/release/libs/math/test/test_geometric.cpp (original)
+++ branches/release/libs/math/test/test_geometric.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -35,7 +35,8 @@
#include <boost/math/distributions/negative_binomial.hpp> // for some comparisons.
-#include <boost/test/test_exec_monitor.hpp> // for test_main
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp> // for test_main
#include <boost/test/floating_point_comparison.hpp> // for BOOST_CHECK_CLOSE_FRACTION
#include "test_out_of_range.hpp"
@@ -748,7 +749,7 @@
return;
} // template <class RealType> void test_spots(RealType) // Any floating-point type RealType.
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
// Check that can generate geometric distribution using the two convenience methods:
using namespace boost::math;
@@ -790,8 +791,8 @@
"to pass.</note>" << std::cout;
#endif
- return 0;
-} // int test_main(int, char* [])
+
+} // BOOST_AUTO_TEST_CASE( test_main )
/*
Modified: branches/release/libs/math/test/test_hankel.cpp
==============================================================================
--- branches/release/libs/math/test/test_hankel.cpp (original)
+++ branches/release/libs/math/test/test_hankel.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -6,7 +6,8 @@
#include <pch_light.hpp>
#define BOOST_MATH_OVERFLOW_ERROR_POLICY ignore_error
-#include <boost/test/test_exec_monitor.hpp>
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp>
#include <boost/test/floating_point_comparison.hpp>
#include <boost/math/special_functions/math_fwd.hpp>
#include <boost/math/concepts/real_concept.hpp>
@@ -119,7 +120,7 @@
template std::complex<double> boost::math::cyl_hankel_1<double, double, pol3>(double, double, const pol3&);
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
#ifdef TEST_GSL
gsl_set_error_handler_off();
@@ -138,7 +139,7 @@
"not available at all, or because they are too inaccurate for these tests "
"to pass.</note>" << std::cout;
#endif
- return 0;
+
}
Modified: branches/release/libs/math/test/test_hermite.cpp
==============================================================================
--- branches/release/libs/math/test/test_hermite.cpp (original)
+++ branches/release/libs/math/test/test_hermite.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -77,7 +77,7 @@
<< BOOST_STDLIB << ", " << BOOST_PLATFORM << std::endl;
}
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
BOOST_MATH_CONTROL_FP;
@@ -109,7 +109,7 @@
"not available at all, or because they are too inaccurate for these tests "
"to pass.</note>" << std::cout;
#endif
- return 0;
+
}
Modified: branches/release/libs/math/test/test_hermite.hpp
==============================================================================
--- branches/release/libs/math/test/test_hermite.hpp (original)
+++ branches/release/libs/math/test/test_hermite.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -12,7 +12,8 @@
#endif
#include <boost/math/concepts/real_concept.hpp>
-#include <boost/test/test_exec_monitor.hpp>
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp>
#include <boost/test/floating_point_comparison.hpp>
#include <boost/math/special_functions/math_fwd.hpp>
#include <boost/math/constants/constants.hpp>
Modified: branches/release/libs/math/test/test_hypergeometric_dist.cpp
==============================================================================
--- branches/release/libs/math/test/test_hypergeometric_dist.cpp (original)
+++ branches/release/libs/math/test/test_hypergeometric_dist.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -11,7 +11,8 @@
#include <boost/math/concepts/real_concept.hpp> // for real_concept
#include <boost/math/distributions/hypergeometric.hpp>
-#include <boost/test/test_exec_monitor.hpp> // Boost.Test
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp> // Boost.Test
#include <boost/test/results_collector.hpp>
#include <boost/test/unit_test.hpp>
#include <boost/test/floating_point_comparison.hpp>
@@ -478,7 +479,7 @@
}
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
expected_results();
// Basic sanity-check spot values.
@@ -497,6 +498,6 @@
"to pass.</note>" << std::cout;
#endif
- return 0;
-} // int test_main(int, char* [])
+
+} // BOOST_AUTO_TEST_CASE( test_main )
Modified: branches/release/libs/math/test/test_ibeta.cpp
==============================================================================
--- branches/release/libs/math/test/test_ibeta.cpp (original)
+++ branches/release/libs/math/test/test_ibeta.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -278,7 +278,7 @@
<< BOOST_STDLIB << ", " << BOOST_PLATFORM << std::endl;
}
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
expected_results();
BOOST_MATH_CONTROL_FP;
@@ -323,7 +323,7 @@
"not available at all, or because they are too inaccurate for these tests "
"to pass.</note>" << std::cout;
#endif
- return 0;
+
}
Modified: branches/release/libs/math/test/test_ibeta.hpp
==============================================================================
--- branches/release/libs/math/test/test_ibeta.hpp (original)
+++ branches/release/libs/math/test/test_ibeta.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -5,7 +5,8 @@
// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
#include <boost/math/concepts/real_concept.hpp>
-#include <boost/test/test_exec_monitor.hpp>
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp>
#include <boost/test/floating_point_comparison.hpp>
#include <boost/math/special_functions/math_fwd.hpp>
#include <boost/math/tools/stats.hpp>
@@ -134,7 +135,8 @@
{
//
// basic sanity checks, tolerance is 30 epsilon expressed as a percentage:
- //
+ // Spot values are from http://functions.wolfram.com/webMathematica/FunctionEvaluation.jsp?name=BetaRegularized
+ // using precision of 50 decimal digits.
T tolerance = boost::math::tools::epsilon<T>() * 3000;
BOOST_CHECK_CLOSE(
::boost::math::ibeta(
@@ -239,7 +241,7 @@
static_cast<T>(1),
static_cast<T>(32)/100),
static_cast<T>(0.94856839398626914764591440181367780660208493234722L), tolerance);
-
+
// try with some integer arguments:
BOOST_CHECK_CLOSE(
::boost::math::ibeta(
Modified: branches/release/libs/math/test/test_ibeta_inv.cpp
==============================================================================
--- branches/release/libs/math/test/test_ibeta_inv.cpp (original)
+++ branches/release/libs/math/test/test_ibeta_inv.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -171,7 +171,7 @@
<< BOOST_STDLIB << ", " << BOOST_PLATFORM << std::endl;
}
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
BOOST_MATH_CONTROL_FP;
expected_results();
@@ -214,7 +214,7 @@
"not available at all, or because they are too inaccurate for these tests "
"to pass.</note>" << std::cout;
#endif
- return 0;
+
}
Modified: branches/release/libs/math/test/test_ibeta_inv.hpp
==============================================================================
--- branches/release/libs/math/test/test_ibeta_inv.hpp (original)
+++ branches/release/libs/math/test/test_ibeta_inv.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -5,7 +5,8 @@
// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
#include <boost/math/concepts/real_concept.hpp>
-#include <boost/test/test_exec_monitor.hpp>
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp>
#include <boost/test/floating_point_comparison.hpp>
#include <boost/math/special_functions/math_fwd.hpp>
#include <boost/math/tools/stats.hpp>
Modified: branches/release/libs/math/test/test_ibeta_inv_ab.cpp
==============================================================================
--- branches/release/libs/math/test/test_ibeta_inv_ab.cpp (original)
+++ branches/release/libs/math/test/test_ibeta_inv_ab.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -98,7 +98,7 @@
<< BOOST_STDLIB << ", " << BOOST_PLATFORM << std::endl;
}
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
expected_results();
#ifdef TEST_GSL
@@ -126,6 +126,6 @@
"not available at all, or because they are too inaccurate for these tests "
"to pass.</note>" << std::cout;
#endif
- return 0;
+
}
Modified: branches/release/libs/math/test/test_ibeta_inv_ab.hpp
==============================================================================
--- branches/release/libs/math/test/test_ibeta_inv_ab.hpp (original)
+++ branches/release/libs/math/test/test_ibeta_inv_ab.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -7,7 +7,8 @@
#define BOOST_MATH_OVERFLOW_ERROR_POLICY ignore_error
#include <boost/math/concepts/real_concept.hpp>
-#include <boost/test/test_exec_monitor.hpp>
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp>
#include <boost/test/floating_point_comparison.hpp>
#include <boost/math/special_functions/math_fwd.hpp>
#include <boost/math/tools/stats.hpp>
Modified: branches/release/libs/math/test/test_igamma.cpp
==============================================================================
--- branches/release/libs/math/test/test_igamma.cpp (original)
+++ branches/release/libs/math/test/test_igamma.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -323,7 +323,7 @@
<< BOOST_STDLIB << ", " << BOOST_PLATFORM << std::endl;
}
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
expected_results();
BOOST_MATH_CONTROL_FP;
@@ -356,7 +356,7 @@
"not available at all, or because they are too inaccurate for these tests "
"to pass.</note>" << std::cout;
#endif
- return 0;
+
}
Modified: branches/release/libs/math/test/test_igamma.hpp
==============================================================================
--- branches/release/libs/math/test/test_igamma.hpp (original)
+++ branches/release/libs/math/test/test_igamma.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -8,7 +8,8 @@
#include <boost/math/concepts/real_concept.hpp>
#include <boost/math/special_functions/math_fwd.hpp>
-#include <boost/test/test_exec_monitor.hpp>
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp>
#include <boost/test/floating_point_comparison.hpp>
#include <boost/math/tools/stats.hpp>
#include <boost/math/tools/test.hpp>
Modified: branches/release/libs/math/test/test_igamma_inv.cpp
==============================================================================
--- branches/release/libs/math/test/test_igamma_inv.cpp (original)
+++ branches/release/libs/math/test/test_igamma_inv.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -174,7 +174,7 @@
<< BOOST_STDLIB << ", " << BOOST_PLATFORM << std::endl;
}
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
expected_results();
BOOST_MATH_CONTROL_FP;
@@ -223,7 +223,7 @@
"not available at all, or because they are too inaccurate for these tests "
"to pass.</note>" << std::cout;
#endif
- return 0;
+
}
Modified: branches/release/libs/math/test/test_igamma_inv.hpp
==============================================================================
--- branches/release/libs/math/test/test_igamma_inv.hpp (original)
+++ branches/release/libs/math/test/test_igamma_inv.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -6,7 +6,8 @@
#include <boost/math/concepts/real_concept.hpp>
#include <boost/math/special_functions/math_fwd.hpp>
-#include <boost/test/test_exec_monitor.hpp>
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp>
#include <boost/test/results_collector.hpp>
#include <boost/test/unit_test.hpp>
#include <boost/test/floating_point_comparison.hpp>
Modified: branches/release/libs/math/test/test_igamma_inva.cpp
==============================================================================
--- branches/release/libs/math/test/test_igamma_inva.cpp (original)
+++ branches/release/libs/math/test/test_igamma_inva.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -101,7 +101,7 @@
<< BOOST_STDLIB << ", " << BOOST_PLATFORM << std::endl;
}
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
expected_results();
BOOST_MATH_CONTROL_FP;
@@ -131,7 +131,7 @@
"not available at all, or because they are too inaccurate for these tests "
"to pass.</note>" << std::cout;
#endif
- return 0;
+
}
Modified: branches/release/libs/math/test/test_igamma_inva.hpp
==============================================================================
--- branches/release/libs/math/test/test_igamma_inva.hpp (original)
+++ branches/release/libs/math/test/test_igamma_inva.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -8,7 +8,8 @@
#include <boost/math/concepts/real_concept.hpp>
#include <boost/math/special_functions/math_fwd.hpp>
-#include <boost/test/test_exec_monitor.hpp>
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp>
#include <boost/test/results_collector.hpp>
#include <boost/test/unit_test.hpp>
#include <boost/test/floating_point_comparison.hpp>
Deleted: branches/release/libs/math/test/test_instances.hpp
==============================================================================
--- branches/release/libs/math/test/test_instances.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
+++ (empty file)
@@ -1,407 +0,0 @@
-// Copyright John Maddock 2011.
-// 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)
-
-
-namespace boost{ namespace math{
-
- typedef policies::policy<policies::overflow_error<policies::throw_on_error> > overflow_policy;
-
- // Beta functions.
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type
- beta(BOOST_MATH_TEST_TYPE a, BOOST_MATH_TEST_TYPE b); // Beta function (2 arguments).
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type
- beta(BOOST_MATH_TEST_TYPE a, BOOST_MATH_TEST_TYPE b, policies::policy<>); // Beta function (3 arguments).
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type
- beta(BOOST_MATH_TEST_TYPE a, BOOST_MATH_TEST_TYPE b, BOOST_MATH_TEST_TYPE); // Beta function (3 arguments).
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type
- beta(BOOST_MATH_TEST_TYPE a, BOOST_MATH_TEST_TYPE b, BOOST_MATH_TEST_TYPE x, const policies::policy<>& pol); // Beta function (3 arguments).
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type
- betac(BOOST_MATH_TEST_TYPE a, BOOST_MATH_TEST_TYPE b, BOOST_MATH_TEST_TYPE x);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type
- betac(BOOST_MATH_TEST_TYPE a, BOOST_MATH_TEST_TYPE b, BOOST_MATH_TEST_TYPE x, const policies::policy<>& pol);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type
- ibeta(BOOST_MATH_TEST_TYPE a, BOOST_MATH_TEST_TYPE b, BOOST_MATH_TEST_TYPE x); // Incomplete beta function.
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type
- ibeta(BOOST_MATH_TEST_TYPE a, BOOST_MATH_TEST_TYPE b, BOOST_MATH_TEST_TYPE x, const policies::policy<>& pol); // Incomplete beta function.
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type
- ibetac(BOOST_MATH_TEST_TYPE a, BOOST_MATH_TEST_TYPE b, BOOST_MATH_TEST_TYPE x); // Incomplete beta complement function.
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type
- ibetac(BOOST_MATH_TEST_TYPE a, BOOST_MATH_TEST_TYPE b, BOOST_MATH_TEST_TYPE x, const policies::policy<>& pol); // Incomplete beta complement function.
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type
- ibeta_inv(BOOST_MATH_TEST_TYPE a, BOOST_MATH_TEST_TYPE b, BOOST_MATH_TEST_TYPE p, BOOST_MATH_TEST_TYPE* py);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type
- ibeta_inv(BOOST_MATH_TEST_TYPE a, BOOST_MATH_TEST_TYPE b, BOOST_MATH_TEST_TYPE p, BOOST_MATH_TEST_TYPE* py, const policies::policy<>& pol);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type
- ibeta_inv(BOOST_MATH_TEST_TYPE a, BOOST_MATH_TEST_TYPE b, BOOST_MATH_TEST_TYPE p); // Incomplete beta inverse function.
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type
- ibeta_inv(BOOST_MATH_TEST_TYPE a, BOOST_MATH_TEST_TYPE b, BOOST_MATH_TEST_TYPE p, const policies::policy<>&); // Incomplete beta inverse function.
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type
- ibeta_inva(BOOST_MATH_TEST_TYPE a, BOOST_MATH_TEST_TYPE b, BOOST_MATH_TEST_TYPE p); // Incomplete beta inverse function.
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type
- ibeta_inva(BOOST_MATH_TEST_TYPE a, BOOST_MATH_TEST_TYPE b, BOOST_MATH_TEST_TYPE p, const policies::policy<>&); // Incomplete beta inverse function.
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type
- ibeta_invb(BOOST_MATH_TEST_TYPE a, BOOST_MATH_TEST_TYPE b, BOOST_MATH_TEST_TYPE p); // Incomplete beta inverse function.
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type
- ibeta_invb(BOOST_MATH_TEST_TYPE a, BOOST_MATH_TEST_TYPE b, BOOST_MATH_TEST_TYPE p, const policies::policy<>&); // Incomplete beta inverse function.
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type
- ibetac_inv(BOOST_MATH_TEST_TYPE a, BOOST_MATH_TEST_TYPE b, BOOST_MATH_TEST_TYPE q, BOOST_MATH_TEST_TYPE* py);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type
- ibetac_inv(BOOST_MATH_TEST_TYPE a, BOOST_MATH_TEST_TYPE b, BOOST_MATH_TEST_TYPE q, BOOST_MATH_TEST_TYPE* py, const policies::policy<>& pol);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type
- ibetac_inv(BOOST_MATH_TEST_TYPE a, BOOST_MATH_TEST_TYPE b, BOOST_MATH_TEST_TYPE q); // Incomplete beta complement inverse function.
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type
- ibetac_inv(BOOST_MATH_TEST_TYPE a, BOOST_MATH_TEST_TYPE b, BOOST_MATH_TEST_TYPE q, const policies::policy<>&); // Incomplete beta complement inverse function.
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type
- ibetac_inva(BOOST_MATH_TEST_TYPE a, BOOST_MATH_TEST_TYPE b, BOOST_MATH_TEST_TYPE q); // Incomplete beta complement inverse function.
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type
- ibetac_inva(BOOST_MATH_TEST_TYPE a, BOOST_MATH_TEST_TYPE b, BOOST_MATH_TEST_TYPE q, const policies::policy<>&); // Incomplete beta complement inverse function.
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type
- ibetac_invb(BOOST_MATH_TEST_TYPE a, BOOST_MATH_TEST_TYPE b, BOOST_MATH_TEST_TYPE q); // Incomplete beta complement inverse function.
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type
- ibetac_invb(BOOST_MATH_TEST_TYPE a, BOOST_MATH_TEST_TYPE b, BOOST_MATH_TEST_TYPE q, const policies::policy<>&); // Incomplete beta complement inverse function.
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type
- ibeta_derivative(BOOST_MATH_TEST_TYPE a, BOOST_MATH_TEST_TYPE b, BOOST_MATH_TEST_TYPE x); // derivative of incomplete beta
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type
- ibeta_derivative(BOOST_MATH_TEST_TYPE a, BOOST_MATH_TEST_TYPE b, BOOST_MATH_TEST_TYPE x, const policies::policy<>& pol); // derivative of incomplete beta
-
- // erf & erfc error functions.
- template tools::promote_args<BOOST_MATH_TEST_TYPE>::type erf(BOOST_MATH_TEST_TYPE z);
- template tools::promote_args<BOOST_MATH_TEST_TYPE>::type erf(BOOST_MATH_TEST_TYPE z, const policies::policy<>&);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE>::type erfc(BOOST_MATH_TEST_TYPE z);
- template tools::promote_args<BOOST_MATH_TEST_TYPE>::type erfc(BOOST_MATH_TEST_TYPE z, const policies::policy<>&);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE>::type erf_inv(BOOST_MATH_TEST_TYPE z);
- template tools::promote_args<BOOST_MATH_TEST_TYPE>::type erf_inv(BOOST_MATH_TEST_TYPE z, const policies::policy<>& pol);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE>::type erfc_inv(BOOST_MATH_TEST_TYPE z);
- template tools::promote_args<BOOST_MATH_TEST_TYPE>::type erfc_inv(BOOST_MATH_TEST_TYPE z, const policies::policy<>& pol);
-
- // Polynomials:
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type
- legendre_next(unsigned l, BOOST_MATH_TEST_TYPE x, BOOST_MATH_TEST_TYPE Pl, BOOST_MATH_TEST_TYPE Plm1);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE>::type
- legendre_p(int l, BOOST_MATH_TEST_TYPE x);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE>::type
- legendre_p(int l, BOOST_MATH_TEST_TYPE x, const policies::policy<>& pol);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE>::type
- legendre_q(unsigned l, BOOST_MATH_TEST_TYPE x);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE>::type
- legendre_q(unsigned l, BOOST_MATH_TEST_TYPE x, const policies::policy<>& pol);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type
- legendre_next(unsigned l, unsigned m, BOOST_MATH_TEST_TYPE x, BOOST_MATH_TEST_TYPE Pl, BOOST_MATH_TEST_TYPE Plm1);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE>::type
- legendre_p(int l, int m, BOOST_MATH_TEST_TYPE x);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE>::type
- legendre_p(int l, int m, BOOST_MATH_TEST_TYPE x, const policies::policy<>& pol);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type
- laguerre_next(unsigned n, BOOST_MATH_TEST_TYPE x, BOOST_MATH_TEST_TYPE Ln, BOOST_MATH_TEST_TYPE Lnm1);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type
- laguerre_next(unsigned n, unsigned l, BOOST_MATH_TEST_TYPE x, BOOST_MATH_TEST_TYPE Pl, BOOST_MATH_TEST_TYPE Plm1);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE>::type
- laguerre(unsigned n, BOOST_MATH_TEST_TYPE x);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE>::type
- laguerre(unsigned n, unsigned m, BOOST_MATH_TEST_TYPE x, const policies::policy<>& pol);
-
- template laguerre_result<int, BOOST_MATH_TEST_TYPE>::type
- laguerre(unsigned n, int m, BOOST_MATH_TEST_TYPE x);
-
- template laguerre_result<unsigned, BOOST_MATH_TEST_TYPE>::type
- laguerre(unsigned n, unsigned m, BOOST_MATH_TEST_TYPE x);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE>::type
- hermite(unsigned n, BOOST_MATH_TEST_TYPE x);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE>::type
- hermite(unsigned n, BOOST_MATH_TEST_TYPE x, const policies::policy<>& pol);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type
- hermite_next(unsigned n, BOOST_MATH_TEST_TYPE x, BOOST_MATH_TEST_TYPE Hn, BOOST_MATH_TEST_TYPE Hnm1);
-
- template std::complex<BOOST_MATH_TEST_TYPE>
- spherical_harmonic(unsigned n, int m, BOOST_MATH_TEST_TYPE theta, BOOST_MATH_TEST_TYPE phi);
-
- template std::complex<BOOST_MATH_TEST_TYPE>
- spherical_harmonic(unsigned n, int m, BOOST_MATH_TEST_TYPE theta, BOOST_MATH_TEST_TYPE phi, const policies::policy<>& pol);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type
- spherical_harmonic_r(unsigned n, int m, BOOST_MATH_TEST_TYPE theta, BOOST_MATH_TEST_TYPE phi);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type
- spherical_harmonic_r(unsigned n, int m, BOOST_MATH_TEST_TYPE theta, BOOST_MATH_TEST_TYPE phi, const policies::policy<>& pol);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type
- spherical_harmonic_i(unsigned n, int m, BOOST_MATH_TEST_TYPE theta, BOOST_MATH_TEST_TYPE phi);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type
- spherical_harmonic_i(unsigned n, int m, BOOST_MATH_TEST_TYPE theta, BOOST_MATH_TEST_TYPE phi, const policies::policy<>& pol);
-
- // Elliptic integrals:
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type
- ellint_rf(BOOST_MATH_TEST_TYPE x, BOOST_MATH_TEST_TYPE y, BOOST_MATH_TEST_TYPE z);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type
- ellint_rf(BOOST_MATH_TEST_TYPE x, BOOST_MATH_TEST_TYPE y, BOOST_MATH_TEST_TYPE z, const policies::policy<>& pol);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type
- ellint_rd(BOOST_MATH_TEST_TYPE x, BOOST_MATH_TEST_TYPE y, BOOST_MATH_TEST_TYPE z);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type
- ellint_rd(BOOST_MATH_TEST_TYPE x, BOOST_MATH_TEST_TYPE y, BOOST_MATH_TEST_TYPE z, const policies::policy<>& pol);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type
- ellint_rc(BOOST_MATH_TEST_TYPE x, BOOST_MATH_TEST_TYPE y);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type
- ellint_rc(BOOST_MATH_TEST_TYPE x, BOOST_MATH_TEST_TYPE y, const policies::policy<>& pol);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type
- ellint_rj(BOOST_MATH_TEST_TYPE x, BOOST_MATH_TEST_TYPE y, BOOST_MATH_TEST_TYPE z, BOOST_MATH_TEST_TYPE p);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type
- ellint_rj(BOOST_MATH_TEST_TYPE x, BOOST_MATH_TEST_TYPE y, BOOST_MATH_TEST_TYPE z, BOOST_MATH_TEST_TYPE p, const policies::policy<>& pol);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE>::type ellint_2(BOOST_MATH_TEST_TYPE k);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type ellint_2(BOOST_MATH_TEST_TYPE k, BOOST_MATH_TEST_TYPE phi);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type ellint_2(BOOST_MATH_TEST_TYPE k, BOOST_MATH_TEST_TYPE phi, const policies::policy<>& pol);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE>::type ellint_1(BOOST_MATH_TEST_TYPE k);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type ellint_1(BOOST_MATH_TEST_TYPE k, BOOST_MATH_TEST_TYPE phi);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type ellint_1(BOOST_MATH_TEST_TYPE k, BOOST_MATH_TEST_TYPE phi, const policies::policy<>& pol);
-
- template detail::ellint_3_result<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type ellint_3(BOOST_MATH_TEST_TYPE k, BOOST_MATH_TEST_TYPE v, BOOST_MATH_TEST_TYPE phi);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type ellint_3(BOOST_MATH_TEST_TYPE k, BOOST_MATH_TEST_TYPE v, BOOST_MATH_TEST_TYPE phi, const policies::policy<>& pol);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type ellint_3(BOOST_MATH_TEST_TYPE k, BOOST_MATH_TEST_TYPE v);
-
- // Gamma functions.
- template tools::promote_args<BOOST_MATH_TEST_TYPE>::type tgamma(BOOST_MATH_TEST_TYPE z);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE>::type tgamma1pm1(BOOST_MATH_TEST_TYPE z);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE>::type tgamma1pm1(BOOST_MATH_TEST_TYPE z, const policies::policy<>& pol);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type tgamma(BOOST_MATH_TEST_TYPE a, BOOST_MATH_TEST_TYPE z);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type tgamma(BOOST_MATH_TEST_TYPE a, BOOST_MATH_TEST_TYPE z, const policies::policy<>& pol);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE>::type lgamma(BOOST_MATH_TEST_TYPE z, int* sign);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE>::type lgamma(BOOST_MATH_TEST_TYPE z, int* sign, const policies::policy<>& pol);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE>::type lgamma(BOOST_MATH_TEST_TYPE x);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE>::type lgamma(BOOST_MATH_TEST_TYPE x, const policies::policy<>& pol);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type tgamma_lower(BOOST_MATH_TEST_TYPE a, BOOST_MATH_TEST_TYPE z);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type tgamma_lower(BOOST_MATH_TEST_TYPE a, BOOST_MATH_TEST_TYPE z, const policies::policy<>&);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type gamma_q(BOOST_MATH_TEST_TYPE a, BOOST_MATH_TEST_TYPE z);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type gamma_q(BOOST_MATH_TEST_TYPE a, BOOST_MATH_TEST_TYPE z, const policies::policy<>&);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type gamma_p(BOOST_MATH_TEST_TYPE a, BOOST_MATH_TEST_TYPE z);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type gamma_p(BOOST_MATH_TEST_TYPE a, BOOST_MATH_TEST_TYPE z, const policies::policy<>&);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type tgamma_delta_ratio(BOOST_MATH_TEST_TYPE z, BOOST_MATH_TEST_TYPE delta);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type tgamma_delta_ratio(BOOST_MATH_TEST_TYPE z, BOOST_MATH_TEST_TYPE delta, const policies::policy<>&);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type tgamma_ratio(BOOST_MATH_TEST_TYPE a, BOOST_MATH_TEST_TYPE b);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type tgamma_ratio(BOOST_MATH_TEST_TYPE a, BOOST_MATH_TEST_TYPE b, const policies::policy<>&);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type gamma_p_derivative(BOOST_MATH_TEST_TYPE a, BOOST_MATH_TEST_TYPE x);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type gamma_p_derivative(BOOST_MATH_TEST_TYPE a, BOOST_MATH_TEST_TYPE x, const policies::policy<>&);
-
- // gamma inverse.
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type gamma_p_inv(BOOST_MATH_TEST_TYPE a, BOOST_MATH_TEST_TYPE p);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type gamma_p_inva(BOOST_MATH_TEST_TYPE a, BOOST_MATH_TEST_TYPE p, const policies::policy<>&);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type gamma_p_inva(BOOST_MATH_TEST_TYPE a, BOOST_MATH_TEST_TYPE p);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type gamma_p_inv(BOOST_MATH_TEST_TYPE a, BOOST_MATH_TEST_TYPE p, const policies::policy<>&);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type gamma_q_inv(BOOST_MATH_TEST_TYPE a, BOOST_MATH_TEST_TYPE q);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type gamma_q_inv(BOOST_MATH_TEST_TYPE a, BOOST_MATH_TEST_TYPE q, const policies::policy<>&);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type gamma_q_inva(BOOST_MATH_TEST_TYPE a, BOOST_MATH_TEST_TYPE q);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type gamma_q_inva(BOOST_MATH_TEST_TYPE a, BOOST_MATH_TEST_TYPE q, const policies::policy<>&);
-
- // digamma:
- template tools::promote_args<BOOST_MATH_TEST_TYPE>::type digamma(BOOST_MATH_TEST_TYPE x);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE>::type digamma(BOOST_MATH_TEST_TYPE x, const policies::policy<>&);
-
- // Hypotenuse function sqrt(x ^ 2 + y ^ 2).
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type
- hypot(BOOST_MATH_TEST_TYPE x, BOOST_MATH_TEST_TYPE y);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type
- hypot(BOOST_MATH_TEST_TYPE x, BOOST_MATH_TEST_TYPE y, const policies::policy<>&);
-
- // cbrt - cube root.
- template tools::promote_args<BOOST_MATH_TEST_TYPE>::type cbrt(BOOST_MATH_TEST_TYPE z);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE>::type cbrt(BOOST_MATH_TEST_TYPE z, const policies::policy<>&);
-
- // log1p is log(x + 1)
- template tools::promote_args<BOOST_MATH_TEST_TYPE>::type log1p(BOOST_MATH_TEST_TYPE);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE>::type log1p(BOOST_MATH_TEST_TYPE, const policies::policy<>&);
- template tools::promote_args<BOOST_MATH_TEST_TYPE>::type log1p<BOOST_MATH_TEST_TYPE, overflow_policy>(BOOST_MATH_TEST_TYPE, const overflow_policy&);
-
- // log1pmx is log(x + 1) - x
- template tools::promote_args<BOOST_MATH_TEST_TYPE>::type log1pmx(BOOST_MATH_TEST_TYPE);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE>::type log1pmx(BOOST_MATH_TEST_TYPE, const policies::policy<>&);
- template tools::promote_args<BOOST_MATH_TEST_TYPE>::type log1pmx(BOOST_MATH_TEST_TYPE, const overflow_policy&);
-
- // Exp (x) minus 1 functions.
- template tools::promote_args<BOOST_MATH_TEST_TYPE>::type expm1(BOOST_MATH_TEST_TYPE);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE>::type expm1(BOOST_MATH_TEST_TYPE, const policies::policy<>&);
- template tools::promote_args<BOOST_MATH_TEST_TYPE>::type expm1(BOOST_MATH_TEST_TYPE, const overflow_policy&);
-
- // Power - 1
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type
- powm1(const BOOST_MATH_TEST_TYPE a, const BOOST_MATH_TEST_TYPE z);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type
- powm1(const BOOST_MATH_TEST_TYPE a, const BOOST_MATH_TEST_TYPE z, const policies::policy<>&);
-
- // sqrt(1+x) - 1
- template tools::promote_args<BOOST_MATH_TEST_TYPE>::type sqrt1pm1(const BOOST_MATH_TEST_TYPE& val);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE>::type sqrt1pm1(const BOOST_MATH_TEST_TYPE& val, const policies::policy<>&);
-
- // Bessel functions:
- template detail::bessel_traits<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE, policies::policy<> >::result_type cyl_bessel_j(BOOST_MATH_TEST_TYPE v, BOOST_MATH_TEST_TYPE x, const policies::policy<> & pol);
-
- template detail::bessel_traits<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE, policies::policy<> >::result_type cyl_bessel_j(BOOST_MATH_TEST_TYPE v, BOOST_MATH_TEST_TYPE x);
- template detail::bessel_traits<int, BOOST_MATH_TEST_TYPE, policies::policy<> >::result_type cyl_bessel_j(int v, BOOST_MATH_TEST_TYPE x);
-
- template detail::bessel_traits<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE, policies::policy<> >::result_type sph_bessel(unsigned v, BOOST_MATH_TEST_TYPE x, const policies::policy<> & pol);
-
- template detail::bessel_traits<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE, policies::policy<> >::result_type sph_bessel(unsigned v, BOOST_MATH_TEST_TYPE x);
-
- template detail::bessel_traits<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE, policies::policy<> >::result_type cyl_bessel_i(BOOST_MATH_TEST_TYPE v, BOOST_MATH_TEST_TYPE x, const policies::policy<> & pol);
-
- template detail::bessel_traits<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE, policies::policy<> >::result_type cyl_bessel_i(BOOST_MATH_TEST_TYPE v, BOOST_MATH_TEST_TYPE x);
- template detail::bessel_traits<int, BOOST_MATH_TEST_TYPE, policies::policy<> >::result_type cyl_bessel_i(int v, BOOST_MATH_TEST_TYPE x);
-
- template detail::bessel_traits<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE, policies::policy<> >::result_type cyl_bessel_k(BOOST_MATH_TEST_TYPE v, BOOST_MATH_TEST_TYPE x, const policies::policy<> & pol);
-
- template detail::bessel_traits<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE, policies::policy<> >::result_type cyl_bessel_k(BOOST_MATH_TEST_TYPE v, BOOST_MATH_TEST_TYPE x);
- template detail::bessel_traits<int, BOOST_MATH_TEST_TYPE, policies::policy<> >::result_type cyl_bessel_k(int v, BOOST_MATH_TEST_TYPE x);
-
- template detail::bessel_traits<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE, policies::policy<> >::result_type cyl_neumann(BOOST_MATH_TEST_TYPE v, BOOST_MATH_TEST_TYPE x, const policies::policy<> & pol);
-
- template detail::bessel_traits<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE, policies::policy<> >::result_type cyl_neumann(BOOST_MATH_TEST_TYPE v, BOOST_MATH_TEST_TYPE x);
- template detail::bessel_traits<int, BOOST_MATH_TEST_TYPE, policies::policy<> >::result_type cyl_neumann(int v, BOOST_MATH_TEST_TYPE x);
-
- template detail::bessel_traits<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE, policies::policy<> >::result_type sph_neumann(unsigned v, BOOST_MATH_TEST_TYPE x, const policies::policy<> & pol);
-
- template detail::bessel_traits<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE, policies::policy<> >::result_type sph_neumann(unsigned v, BOOST_MATH_TEST_TYPE x);
-
- // Airy Functions:
- template tools::promote_args<BOOST_MATH_TEST_TYPE>::type airy_ai(BOOST_MATH_TEST_TYPE x, const policies::policy<>&);
- template tools::promote_args<BOOST_MATH_TEST_TYPE>::type airy_ai(BOOST_MATH_TEST_TYPE x);
- template tools::promote_args<BOOST_MATH_TEST_TYPE>::type airy_bi(BOOST_MATH_TEST_TYPE x, const policies::policy<>&);
- template tools::promote_args<BOOST_MATH_TEST_TYPE>::type airy_bi(BOOST_MATH_TEST_TYPE x);
- template tools::promote_args<BOOST_MATH_TEST_TYPE>::type airy_ai_prime(BOOST_MATH_TEST_TYPE x, const policies::policy<>&);
- template tools::promote_args<BOOST_MATH_TEST_TYPE>::type airy_ai_prime(BOOST_MATH_TEST_TYPE x);
- template tools::promote_args<BOOST_MATH_TEST_TYPE>::type airy_bi_prime(BOOST_MATH_TEST_TYPE x, const policies::policy<>&);
- template tools::promote_args<BOOST_MATH_TEST_TYPE>::type airy_bi_prime(BOOST_MATH_TEST_TYPE x);
-
- // Exponential Integral
- template tools::promote_args<BOOST_MATH_TEST_TYPE>::type expint(unsigned n, BOOST_MATH_TEST_TYPE z, const policies::policy<> &);
-
- template detail::expint_result<int, BOOST_MATH_TEST_TYPE>::type expint(int const z, BOOST_MATH_TEST_TYPE const u);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE>::type expint(BOOST_MATH_TEST_TYPE z);
-
- // Zeta:
- template tools::promote_args<BOOST_MATH_TEST_TYPE>::type zeta(BOOST_MATH_TEST_TYPE s, const policies::policy<>&);
-
- template tools::promote_args<BOOST_MATH_TEST_TYPE>::type zeta(BOOST_MATH_TEST_TYPE s);
-
- // Jacobi Functions:
- template tools::promote_args<BOOST_MATH_TEST_TYPE>::type jacobi_elliptic(BOOST_MATH_TEST_TYPE k, BOOST_MATH_TEST_TYPE theta, BOOST_MATH_TEST_TYPE* pcn, BOOST_MATH_TEST_TYPE* pdn, const policies::policy<>&);
- template tools::promote_args<BOOST_MATH_TEST_TYPE>::type jacobi_elliptic(BOOST_MATH_TEST_TYPE k, BOOST_MATH_TEST_TYPE theta, BOOST_MATH_TEST_TYPE* pcn, BOOST_MATH_TEST_TYPE* pdn);
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type jacobi_sn(BOOST_MATH_TEST_TYPE k, BOOST_MATH_TEST_TYPE theta, const policies::policy<>& pol);
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type jacobi_sn(BOOST_MATH_TEST_TYPE k, BOOST_MATH_TEST_TYPE theta);
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type jacobi_cn(BOOST_MATH_TEST_TYPE k, BOOST_MATH_TEST_TYPE theta, const policies::policy<>& pol);
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type jacobi_cn(BOOST_MATH_TEST_TYPE k, BOOST_MATH_TEST_TYPE theta);
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type jacobi_dn(BOOST_MATH_TEST_TYPE k, BOOST_MATH_TEST_TYPE theta, const policies::policy<>& pol);
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type jacobi_dn(BOOST_MATH_TEST_TYPE k, BOOST_MATH_TEST_TYPE theta);
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type jacobi_cd(BOOST_MATH_TEST_TYPE k, BOOST_MATH_TEST_TYPE theta, const policies::policy<>& pol);
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type jacobi_cd(BOOST_MATH_TEST_TYPE k, BOOST_MATH_TEST_TYPE theta);
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type jacobi_dc(BOOST_MATH_TEST_TYPE k, BOOST_MATH_TEST_TYPE theta, const policies::policy<>& pol);
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type jacobi_dc(BOOST_MATH_TEST_TYPE k, BOOST_MATH_TEST_TYPE theta);
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type jacobi_ns(BOOST_MATH_TEST_TYPE k, BOOST_MATH_TEST_TYPE theta, const policies::policy<>& pol);
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type jacobi_ns(BOOST_MATH_TEST_TYPE k, BOOST_MATH_TEST_TYPE theta);
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type jacobi_sd(BOOST_MATH_TEST_TYPE k, BOOST_MATH_TEST_TYPE theta, const policies::policy<>& pol);
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type jacobi_sd(BOOST_MATH_TEST_TYPE k, BOOST_MATH_TEST_TYPE theta);
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type jacobi_ds(BOOST_MATH_TEST_TYPE k, BOOST_MATH_TEST_TYPE theta, const policies::policy<>& pol);
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type jacobi_ds(BOOST_MATH_TEST_TYPE k, BOOST_MATH_TEST_TYPE theta);
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type jacobi_nc(BOOST_MATH_TEST_TYPE k, BOOST_MATH_TEST_TYPE theta, const policies::policy<>& pol);
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type jacobi_nc(BOOST_MATH_TEST_TYPE k, BOOST_MATH_TEST_TYPE theta);
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type jacobi_nd(BOOST_MATH_TEST_TYPE k, BOOST_MATH_TEST_TYPE theta, const policies::policy<>& pol);
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type jacobi_nd(BOOST_MATH_TEST_TYPE k, BOOST_MATH_TEST_TYPE theta);
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type jacobi_sc(BOOST_MATH_TEST_TYPE k, BOOST_MATH_TEST_TYPE theta, const policies::policy<>& pol);
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type jacobi_sc(BOOST_MATH_TEST_TYPE k, BOOST_MATH_TEST_TYPE theta);
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type jacobi_cs(BOOST_MATH_TEST_TYPE k, BOOST_MATH_TEST_TYPE theta, const policies::policy<>& pol);
- template tools::promote_args<BOOST_MATH_TEST_TYPE, BOOST_MATH_TEST_TYPE>::type jacobi_cs(BOOST_MATH_TEST_TYPE k, BOOST_MATH_TEST_TYPE theta);
-
-}} // namespaces
Modified: branches/release/libs/math/test/test_inv_hyp.cpp
==============================================================================
--- branches/release/libs/math/test/test_inv_hyp.cpp (original)
+++ branches/release/libs/math/test/test_inv_hyp.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -9,7 +9,8 @@
#include <boost/math/special_functions/acosh.hpp>
#include <boost/math/special_functions/asinh.hpp>
#include <boost/math/special_functions/atanh.hpp>
-#include <boost/test/test_exec_monitor.hpp>
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp>
#include <boost/test/floating_point_comparison.hpp>
#include <boost/math/tools/stats.hpp>
#include <boost/math/tools/test.hpp>
@@ -250,7 +251,7 @@
BOOST_CHECK_CLOSE(::boost::math::atanh(static_cast<T>(-0.5)), static_cast<T>(-0.549306144334054845697622618461262852323745278911374725867347L), tolerance);
}
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
expected_results();
BOOST_MATH_CONTROL_FP;
@@ -282,7 +283,7 @@
"not available at all, or because they are too inaccurate for these tests "
"to pass.</note>" << std::cout;
#endif
- return 0;
+
}
Modified: branches/release/libs/math/test/test_inverse_chi_squared.cpp
==============================================================================
--- branches/release/libs/math/test/test_inverse_chi_squared.cpp (original)
+++ branches/release/libs/math/test/test_inverse_chi_squared.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -20,7 +20,8 @@
using ::boost::math::concepts::real_concept;
//#include <boost/math/tools/test.hpp>
-#include <boost/test/test_exec_monitor.hpp> // for test_main
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp> // for test_main
#include <boost/test/floating_point_comparison.hpp> // for BOOST_CHECK_CLOSE_FRACTION
#include <boost/math/distributions/inverse_chi_squared.hpp> // for inverse_chisquared_distribution
@@ -305,7 +306,7 @@
} // template <class RealType>void test_spots(RealType)
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
BOOST_MATH_CONTROL_FP;
@@ -497,8 +498,8 @@
#endif
/* */
- return 0;
-} // int test_main(int, char* [])
+
+} // BOOST_AUTO_TEST_CASE( test_main )
/*
Modified: branches/release/libs/math/test/test_inverse_chi_squared_distribution.cpp
==============================================================================
--- branches/release/libs/math/test/test_inverse_chi_squared_distribution.cpp (original)
+++ branches/release/libs/math/test/test_inverse_chi_squared_distribution.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -18,7 +18,8 @@
using ::boost::math::concepts::real_concept;
//#include <boost/math/tools/test.hpp>
-#include <boost/test/test_exec_monitor.hpp> // for test_main
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp> // for test_main
#include <boost/test/floating_point_comparison.hpp> // for BOOST_CHECK_CLOSE_FRACTION
#include "test_out_of_range.hpp"
@@ -304,7 +305,7 @@
} // template <class RealType>void test_spots(RealType)
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
BOOST_MATH_CONTROL_FP;
@@ -496,8 +497,8 @@
#endif
/* */
- return 0;
-} // int test_main(int, char* [])
+
+} // BOOST_AUTO_TEST_CASE( test_main )
/*
Modified: branches/release/libs/math/test/test_inverse_gamma_distribution.cpp
==============================================================================
--- branches/release/libs/math/test/test_inverse_gamma_distribution.cpp (original)
+++ branches/release/libs/math/test/test_inverse_gamma_distribution.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -18,7 +18,8 @@
using ::boost::math::concepts::real_concept;
//#include <boost/math/tools/test.hpp>
-#include <boost/test/test_exec_monitor.hpp> // for test_main
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp> // for test_main
#include <boost/test/floating_point_comparison.hpp> // for BOOST_CHECK_CLOSE_FRACTION
#include "test_out_of_range.hpp"
@@ -327,7 +328,7 @@
check_out_of_range<inverse_gamma_distribution<RealType> >(1, 1);
} // template <class RealType>void test_spots(RealType)
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
BOOST_MATH_CONTROL_FP;
@@ -412,8 +413,8 @@
"not available at all, or because they are too inaccurate for these tests "
"to pass.</note>" << std::cout;
#endif
- return 0;
-} // int test_main(int, char* [])
+
+} // BOOST_AUTO_TEST_CASE( test_main )
/*
Modified: branches/release/libs/math/test/test_inverse_gaussian.cpp
==============================================================================
--- branches/release/libs/math/test/test_inverse_gaussian.cpp (original)
+++ branches/release/libs/math/test/test_inverse_gaussian.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -17,7 +17,8 @@
//#include <pch.hpp> // include directory libs/math/src/tr1/ is needed.
#include <boost/math/concepts/real_concept.hpp> // for real_concept
-#include <boost/test/test_exec_monitor.hpp> // Boost.Test
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp> // Boost.Test
#include <boost/test/floating_point_comparison.hpp>
#include <boost/math/distributions/inverse_gaussian.hpp>
@@ -161,7 +162,7 @@
static_cast<RealType>(10), tolerance);
} // template <class RealType>void test_spots(RealType)
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
using boost::math::inverse_gaussian;
using boost::math::inverse_gaussian_distribution;
@@ -334,8 +335,8 @@
"to pass.</note>" << std::cout;
#endif
/* */
- return 0;
-} // int test_main(int, char* [])
+
+} // BOOST_AUTO_TEST_CASE( test_main )
/*
Modified: branches/release/libs/math/test/test_jacobi.cpp
==============================================================================
--- branches/release/libs/math/test/test_jacobi.cpp (original)
+++ branches/release/libs/math/test/test_jacobi.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -112,7 +112,7 @@
}
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
expected_results();
BOOST_MATH_CONTROL_FP;
@@ -131,5 +131,5 @@
"to pass.</note>" << std::cout;
#endif
- return 0;
+
}
Modified: branches/release/libs/math/test/test_jacobi.hpp
==============================================================================
--- branches/release/libs/math/test/test_jacobi.hpp (original)
+++ branches/release/libs/math/test/test_jacobi.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -10,7 +10,8 @@
#endif
#include <boost/math/concepts/real_concept.hpp>
-#include <boost/test/test_exec_monitor.hpp>
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp>
#include <boost/test/floating_point_comparison.hpp>
#include <boost/math/special_functions/math_fwd.hpp>
#include <boost/array.hpp>
@@ -78,6 +79,7 @@
template <typename T>
void test_spots(T, const char* type_name)
{
+ BOOST_MATH_STD_USING
// Function values calculated on http://functions.wolfram.com/
// Note that Mathematica's Sn/Cn/Dn accepts k^2 as the second parameter.
// Arguments here are theta, k, sn, cn, dn
@@ -137,7 +139,7 @@
//
// Sanity checks for all the various derived functions - these are all
// trivial wrappers around the main three that are tested above - so just
- // use a simple sanity check for each one.
+ // use a simple sanity check for each one.
// Test values are from functions.wolfram.com:
//
T tol = boost::math::tools::epsilon<T>() * 100;
Modified: branches/release/libs/math/test/test_laguerre.cpp
==============================================================================
--- branches/release/libs/math/test/test_laguerre.cpp (original)
+++ branches/release/libs/math/test/test_laguerre.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -136,7 +136,7 @@
<< BOOST_STDLIB << ", " << BOOST_PLATFORM << std::endl;
}
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
BOOST_MATH_CONTROL_FP;
@@ -166,7 +166,7 @@
"not available at all, or because they are too inaccurate for these tests "
"to pass.</note>" << std::cout;
#endif
- return 0;
+
}
Modified: branches/release/libs/math/test/test_laguerre.hpp
==============================================================================
--- branches/release/libs/math/test/test_laguerre.hpp (original)
+++ branches/release/libs/math/test/test_laguerre.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -5,7 +5,8 @@
// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
#include <boost/math/concepts/real_concept.hpp>
-#include <boost/test/test_exec_monitor.hpp>
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp>
#include <boost/test/floating_point_comparison.hpp>
#include <boost/math/special_functions/math_fwd.hpp>
#include <boost/math/constants/constants.hpp>
Modified: branches/release/libs/math/test/test_legendre.cpp
==============================================================================
--- branches/release/libs/math/test/test_legendre.cpp (original)
+++ branches/release/libs/math/test/test_legendre.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -178,7 +178,7 @@
<< BOOST_STDLIB << ", " << BOOST_PLATFORM << std::endl;
}
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
BOOST_MATH_CONTROL_FP;
test_spots(0.0F, "float");
@@ -203,7 +203,7 @@
"not available at all, or because they are too inaccurate for these tests "
"to pass.</note>" << std::cout;
#endif
- return 0;
+
}
Modified: branches/release/libs/math/test/test_legendre.hpp
==============================================================================
--- branches/release/libs/math/test/test_legendre.hpp (original)
+++ branches/release/libs/math/test/test_legendre.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -9,7 +9,8 @@
#endif
#include <boost/math/concepts/real_concept.hpp>
-#include <boost/test/test_exec_monitor.hpp>
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp>
#include <boost/test/floating_point_comparison.hpp>
#include <boost/math/special_functions/math_fwd.hpp>
#include <boost/math/constants/constants.hpp>
Modified: branches/release/libs/math/test/test_logistic_dist.cpp
==============================================================================
--- branches/release/libs/math/test/test_logistic_dist.cpp (original)
+++ branches/release/libs/math/test/test_logistic_dist.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -11,7 +11,8 @@
#include <boost/math/distributions/logistic.hpp>
using boost::math::logistic_distribution;
-#include <boost/test/test_exec_monitor.hpp> // Boost.Test
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp> // Boost.Test
#include <boost/test/floating_point_comparison.hpp>
#include "test_out_of_range.hpp"
@@ -315,7 +316,7 @@
} // template <class RealType>void test_spots(RealType)
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
// Check that can generate logistic distribution using the two convenience methods:
boost::math::logistic mycexp1(1.); // Using typedef
@@ -337,6 +338,6 @@
"to pass.</note>" << std::cout;
#endif
- return 0;
-} // int test_main(int, char* [])
+
+} // BOOST_AUTO_TEST_CASE( test_main )
Modified: branches/release/libs/math/test/test_lognormal.cpp
==============================================================================
--- branches/release/libs/math/test/test_lognormal.cpp (original)
+++ branches/release/libs/math/test/test_lognormal.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -9,7 +9,8 @@
// test_lognormal.cpp
#include <boost/math/concepts/real_concept.hpp> // for real_concept
-#include <boost/test/test_exec_monitor.hpp> // Boost.Test
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp> // Boost.Test
#include <boost/test/floating_point_comparison.hpp>
#include <boost/math/distributions/lognormal.hpp>
@@ -260,7 +261,7 @@
} // template <class RealType>void test_spots(RealType)
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
// Check that can generate lognormal distribution using the two convenience methods:
@@ -290,8 +291,8 @@
"to pass.</note>" << std::cout;
#endif
- return 0;
-} // int test_main(int, char* [])
+
+} // BOOST_AUTO_TEST_CASE( test_main )
/*
Running 1 test case...
Modified: branches/release/libs/math/test/test_long_double_support.cpp
==============================================================================
--- branches/release/libs/math/test/test_long_double_support.cpp (original)
+++ branches/release/libs/math/test/test_long_double_support.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -9,7 +9,8 @@
#include <math.h>
#include <limits.h>
-#include <boost/test/test_exec_monitor.hpp> // Boost.Test
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp> // Boost.Test
#include <boost/test/results_collector.hpp>
#include <boost/test/unit_test.hpp>
#include <boost/test/floating_point_comparison.hpp>
@@ -61,15 +62,15 @@
// test against data:
//
result = boost::math::tools::test(
- data,
- bind_func<value_type>(proc, 0),
+ data,
+ bind_func<value_type>(proc, 0),
extract_result<value_type>(1));
handle_test_result(result, data[result.worst()], result.worst(), type_name, function_name, test_name);
if(inv_proc)
{
result = boost::math::tools::test(
- data,
- bind_func<value_type>(inv_proc, 1),
+ data,
+ bind_func<value_type>(inv_proc, 1),
extract_result<value_type>(0));
handle_test_result(result, data[result.worst()], result.worst(), type_name, inv_function_name, test_name);
}
@@ -86,10 +87,10 @@
// COS:
//
boost::array<boost::array<long double, 2>, 4> cos_test_data = {{
- 0, 1,
- 0.125L, 0.992197667229329053149096907788250869543327304736601263468910L,
- 1.125L, 0.431176516798666176551969042921689826840697850225767471037314L,
- 1.75L, -0.178246055649492090382676943942631358969920851291548272886063L,
+ {{ 0, 1, }},
+ {{ 0.125L, 0.992197667229329053149096907788250869543327304736601263468910L, }},
+ {{ 1.125L, 0.431176516798666176551969042921689826840697850225767471037314L, }},
+ {{ 1.75L, -0.178246055649492090382676943942631358969920851291548272886063L, }},
}};
unary_proc = std::cos;
inv_unary_proc = std::acos;
@@ -101,16 +102,16 @@
// SIN:
//
boost::array<boost::array<long double, 2>, 6> sin_test_data = {{
- 0, 0,
- 0.125L, 0.124674733385227689957442708712108467587834905641679257885515L,
- -0.125L, -0.124674733385227689957442708712108467587834905641679257885515L,
- 1.125L, 0.902267594099095162918416128654829100758989018716070814389152L,
+ {{ 0, 0, }},
+ {{ 0.125L, 0.124674733385227689957442708712108467587834905641679257885515L, }},
+ {{ -0.125L, -0.124674733385227689957442708712108467587834905641679257885515L, }},
+ {{ 1.125L, 0.902267594099095162918416128654829100758989018716070814389152L, }},
#if LDBL_MAX_EXP > DBL_MAX_EXP
- 1e-500L, 1e-500L,
- 1e-1500L, 1e-1500L,
+ {{ 1e-500L, 1e-500L, }},
+ {{ 1e-1500L, 1e-1500L, }},
#else
- 0, 0,
- 0, 0,
+ {{ 0, 0, }},
+ {{ 0, 0, }},
#endif
}};
unary_proc = std::sin;
@@ -123,16 +124,16 @@
// TAN:
//
boost::array<boost::array<long double, 2>, 6> tan_test_data = {{
- 0, 0,
- 0.125L, 0.125655136575130967792678218629774000758665763892225542668867L,
- -0.125L, -0.125655136575130967792678218629774000758665763892225542668867L,
- 1.125L, 2.09257127637217900442373398123488678225994171614872057291399L,
+ {{ 0, 0, }},
+ {{ 0.125L, 0.125655136575130967792678218629774000758665763892225542668867L, }},
+ {{ -0.125L, -0.125655136575130967792678218629774000758665763892225542668867L, }},
+ {{ 1.125L, 2.09257127637217900442373398123488678225994171614872057291399L, }},
#if LDBL_MAX_EXP > DBL_MAX_EXP
- 1e-500L, 1e-500L,
- 1e-1500L, 1e-1500L,
+ {{ 1e-500L, 1e-500L, }},
+ {{ 1e-1500L, 1e-1500L, }},
#else
- 0, 0,
- 0, 0,
+ {{ 0, 0, }},
+ {{ 0, 0, }},
#endif
}};
unary_proc = std::tan;
@@ -145,30 +146,30 @@
// EXP:
//
boost::array<boost::array<long double, 2>, 16> exp_test_data = {{
- 0, 1,
- 0.125L, 1.13314845306682631682900722781179387256550313174518162591282L,
- -0.125L, 0.882496902584595402864892143229050736222004824990650741770309L,
- 1.125L, 3.08021684891803124500466787877703957705899375982613074033239L,
- 4.60517018598809136803598290936872841520220297725754595206666L, 100L,
- 23.0258509299404568401799145468436420760110148862877297603333L, 1e10L,
- 230.258509299404568401799145468436420760110148862877297603333L, 1e100L,
- -230.258509299404568401799145468436420760110148862877297603333L, 1e-100L,
- -23.0258509299404568401799145468436420760110148862877297603333L, 1e-10L,
- -4.60517018598809136803598290936872841520220297725754595206666L, 0.01L,
+ {{ 0, 1, }},
+ {{ 0.125L, 1.13314845306682631682900722781179387256550313174518162591282L, }},
+ {{ -0.125L, 0.882496902584595402864892143229050736222004824990650741770309L, }},
+ {{ 1.125L, 3.08021684891803124500466787877703957705899375982613074033239L, }},
+ {{ 4.60517018598809136803598290936872841520220297725754595206666L, 100L, }},
+ {{ 23.0258509299404568401799145468436420760110148862877297603333L, 1e10L, }},
+ {{ 230.258509299404568401799145468436420760110148862877297603333L, 1e100L, }},
+ {{ -230.258509299404568401799145468436420760110148862877297603333L, 1e-100L, }},
+ {{ -23.0258509299404568401799145468436420760110148862877297603333L, 1e-10L, }},
+ {{ -4.60517018598809136803598290936872841520220297725754595206666L, 0.01L, }},
#if LDBL_MAX_EXP > DBL_MAX_EXP
- 1151.29254649702284200899572734218210380055074431438648801666L, 1e500L,
- 2302.58509299404568401799145468436420760110148862877297603333L, 1e1000L,
- 11351.7445084606452222086978715939155434734303389398507718443L, 1e4930L,
- -11351.7445084606452222086978715939155434734303389398507718443L, 1e-4930L,
- -2302.58509299404568401799145468436420760110148862877297603333L, 1e-1000L,
- -1151.29254649702284200899572734218210380055074431438648801666L, 1e-500L,
+ {{ 1151.5L, 1.23054049904018215810329849694e+500L, }},
+ {{ 2302.5, 9.1842687219959504902800771504e+999L, }},
+ {{ 11351.5, 7.83089362896060182981072520459e+4929L, }},
+ {{ -11351.5, 1.27699346636729947157842192471e-4930L, }},
+ {{ -2302.5, 1.0888183156107362404277325218e-1000L, }},
+ {{ -1151.5, 8.12651026747999724274336150307e-501L, }},
#else
- 0, 1,
- 0, 1,
- 0, 1,
- 0, 1,
- 0, 1,
- 0, 1,
+ {{ 0, 1, }},
+ {{ 0, 1, }},
+ {{ 0, 1, }},
+ {{ 0, 1, }},
+ {{ 0, 1, }},
+ {{ 0, 1, }},
#endif
}};
unary_proc = std::exp;
@@ -181,19 +182,19 @@
// SQRT:
//
boost::array<boost::array<long double, 2>, 8> sqrt_test_data = {{
- 1, 1,
- 0.125L, 0.353553390593273762200422181052424519642417968844237018294170L,
- 1.125L, 1.06066017177982128660126654315727355892725390653271105488251L,
- 1e10L, 1e5L,
- 1e100L, 1e50L,
+ {{ 1, 1, }},
+ {{ 0.125L, 0.353553390593273762200422181052424519642417968844237018294170L, }},
+ {{ 1.125L, 1.06066017177982128660126654315727355892725390653271105488251L, }},
+ {{ 1e10L, 1e5L, }},
+ {{ 1e100L, 1e50L, }},
#if LDBL_MAX_EXP > DBL_MAX_EXP
- 1e500L, 1e250L,
- 1e1000L, 1e500L,
- 1e4930L, 1e2465L
+ {{ 1e500L, 1e250L, }},
+ {{ 1e1000L, 1e500L, }},
+ {{ 1e4930L, 1e2465L }},
#else
- 1, 1,
- 1, 1,
- 1, 1,
+ {{ 1, 1, }},
+ {{ 1, 1, }},
+ {{ 1, 1, }},
#endif
}};
unary_proc = std::sqrt;
@@ -204,7 +205,7 @@
}
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
expected_results();
std::cout << "Running tests with BOOST_MATH_NO_LONG_DOUBLE_MATH_FUNCTIONS "
@@ -218,6 +219,6 @@
// (Parameter value, arbitrarily zero, only communicates the floating point type).
test_spots(); // Test long double.
- return 0;
-} // int test_main(int, char* [])
+
+} // BOOST_AUTO_TEST_CASE( test_main )
Modified: branches/release/libs/math/test/test_minima.cpp
==============================================================================
--- branches/release/libs/math/test/test_minima.cpp (original)
+++ branches/release/libs/math/test/test_minima.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -8,7 +8,8 @@
#include <pch.hpp>
#include <boost/math/tools/minima.hpp>
-#include <boost/test/test_exec_monitor.hpp>
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp>
#include <boost/test/floating_point_comparison.hpp>
#include <boost/math/special_functions/gamma.hpp>
@@ -48,14 +49,14 @@
BOOST_CHECK_CLOSE(m.first, T(1.461632), T(0.1));
}
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
test_minima(0.1f, "float");
test_minima(0.1, "double");
#ifndef BOOST_MATH_NO_LONG_DOUBLE_MATH_FUNCTIONS
test_minima(0.1L, "long double");
#endif
- return 0;
+
}
Modified: branches/release/libs/math/test/test_nc_beta.cpp
==============================================================================
--- branches/release/libs/math/test/test_nc_beta.cpp (original)
+++ branches/release/libs/math/test/test_nc_beta.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -26,7 +26,8 @@
#include <boost/math/concepts/real_concept.hpp> // for real_concept
#include <boost/math/distributions/non_central_beta.hpp> // for chi_squared_distribution
#include <boost/math/distributions/poisson.hpp> // for poisson_distribution
-#include <boost/test/test_exec_monitor.hpp> // for test_main
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp> // for test_main
#include <boost/test/results_collector.hpp>
#include <boost/test/unit_test.hpp>
#include <boost/test/floating_point_comparison.hpp> // for BOOST_CHECK_CLOSE
@@ -427,7 +428,7 @@
#endif
}
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
BOOST_MATH_CONTROL_FP;
// Basic sanity-check spot values.
@@ -466,6 +467,6 @@
#endif
#endif
#endif
- return 0;
-} // int test_main(int, char* [])
+
+} // BOOST_AUTO_TEST_CASE( test_main )
Modified: branches/release/libs/math/test/test_nc_chi_squared.cpp
==============================================================================
--- branches/release/libs/math/test/test_nc_chi_squared.cpp (original)
+++ branches/release/libs/math/test/test_nc_chi_squared.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -23,7 +23,8 @@
#include <boost/math/concepts/real_concept.hpp> // for real_concept
#include <boost/math/distributions/non_central_chi_squared.hpp> // for chi_squared_distribution
#include <boost/math/special_functions/cbrt.hpp> // for chi_squared_distribution
-#include <boost/test/test_exec_monitor.hpp> // for test_main
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp> // for test_main
#include <boost/test/results_collector.hpp>
#include <boost/test/unit_test.hpp>
#include <boost/test/floating_point_comparison.hpp> // for BOOST_CHECK_CLOSE
@@ -518,7 +519,7 @@
quantile_sanity_check<T>(nccs_big, type_name, "Non Central Chi Squared, large parameters");
}
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
BOOST_MATH_CONTROL_FP;
// Basic sanity-check spot values.
@@ -557,7 +558,7 @@
#endif
#endif
#endif
- return 0;
-} // int test_main(int, char* [])
+
+} // BOOST_AUTO_TEST_CASE( test_main )
Modified: branches/release/libs/math/test/test_nc_f.cpp
==============================================================================
--- branches/release/libs/math/test/test_nc_f.cpp (original)
+++ branches/release/libs/math/test/test_nc_f.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -22,7 +22,8 @@
#include <boost/math/concepts/real_concept.hpp> // for real_concept
#include <boost/math/distributions/non_central_f.hpp> // for chi_squared_distribution
-#include <boost/test/test_exec_monitor.hpp> // for test_main
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp> // for test_main
#include <boost/test/results_collector.hpp>
#include <boost/test/unit_test.hpp>
#include <boost/test/floating_point_comparison.hpp> // for BOOST_CHECK_CLOSE
@@ -294,7 +295,7 @@
BOOST_CHECK_THROW(quantile(boost::math::non_central_f_distribution<RealType>(1, 1, 1), 2), std::domain_error);
} // template <class RealType>void test_spots(RealType)
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
BOOST_MATH_CONTROL_FP;
// Basic sanity-check spot values.
@@ -309,6 +310,6 @@
#endif
#endif
- return 0;
-} // int test_main(int, char* [])
+
+} // BOOST_AUTO_TEST_CASE( test_main )
Modified: branches/release/libs/math/test/test_nc_t.cpp
==============================================================================
--- branches/release/libs/math/test/test_nc_t.cpp (original)
+++ branches/release/libs/math/test/test_nc_t.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -25,7 +25,8 @@
#include <boost/math/distributions/non_central_t.hpp> // for chi_squared_distribution.
#include <boost/math/distributions/normal.hpp> // for normal distribution (for comparison).
-#include <boost/test/test_exec_monitor.hpp> // for test_main
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp> // for test_main
#include <boost/test/results_collector.hpp>
#include <boost/test/unit_test.hpp>
#include <boost/test/floating_point_comparison.hpp> // for BOOST_CHECK_CLOSE
@@ -798,7 +799,7 @@
} // template <class RealType> void test_ignore_policy(RealType)
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
BOOST_MATH_CONTROL_FP;
// Basic sanity-check spot values.
@@ -843,8 +844,8 @@
test_big_df(0.F); // float
test_big_df(0.); // double
- return 0;
-} // int test_main(int, char* [])
+
+} // BOOST_AUTO_TEST_CASE( test_main )
/*
Modified: branches/release/libs/math/test/test_negative_binomial.cpp
==============================================================================
--- branches/release/libs/math/test/test_negative_binomial.cpp (original)
+++ branches/release/libs/math/test/test_negative_binomial.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -35,7 +35,8 @@
#include <boost/math/special_functions/gamma.hpp>
using boost::math::lgamma; // log gamma
-#include <boost/test/test_exec_monitor.hpp> // for test_main
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp> // for test_main
#include <boost/test/floating_point_comparison.hpp> // for BOOST_CHECK_CLOSE
#include "table_type.hpp"
#include "test_out_of_range.hpp"
@@ -798,7 +799,7 @@
return;
} // template <class RealType> void test_spots(RealType) // Any floating-point type RealType.
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
// Check that can generate negative_binomial distribution using the two convenience methods:
using namespace boost::math;
@@ -839,8 +840,8 @@
"to pass.</note>" << std::cout;
#endif
- return 0;
-} // int test_main(int, char* [])
+
+} // BOOST_AUTO_TEST_CASE( test_main )
/*
Modified: branches/release/libs/math/test/test_next.cpp
==============================================================================
--- branches/release/libs/math/test/test_next.cpp (original)
+++ branches/release/libs/math/test/test_next.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -6,7 +6,8 @@
#include <pch.hpp>
#include <boost/math/concepts/real_concept.hpp>
-#include <boost/test/test_exec_monitor.hpp>
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp>
#include <boost/test/floating_point_comparison.hpp>
#include <boost/math/special_functions/next.hpp>
@@ -148,7 +149,7 @@
}
}
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
test_values(1.0f, "float");
test_values(1.0, "double");
@@ -181,7 +182,7 @@
test_values(1.0f, "float");
test_values(1.0, "double");
#endif
- return 0;
+
}
Modified: branches/release/libs/math/test/test_normal.cpp
==============================================================================
--- branches/release/libs/math/test/test_normal.cpp (original)
+++ branches/release/libs/math/test/test_normal.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -24,7 +24,8 @@
#endif
#include <boost/math/concepts/real_concept.hpp> // for real_concept
-#include <boost/test/test_exec_monitor.hpp> // Boost.Test
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp> // Boost.Test
#include <boost/test/floating_point_comparison.hpp>
#include <boost/math/distributions/normal.hpp>
@@ -292,7 +293,7 @@
BOOST_CHECK_THROW(quantile(normal_distribution<RealType>(0, 1), 2), std::domain_error);
} // template <class RealType>void test_spots(RealType)
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
// Check that can generate normal distribution using the two convenience methods:
boost::math::normal myf1(1., 2); // Using typedef
@@ -320,8 +321,8 @@
"to pass.</note>" << std::cout;
#endif
- return 0;
-} // int test_main(int, char* [])
+
+} // BOOST_AUTO_TEST_CASE( test_main )
/*
Modified: branches/release/libs/math/test/test_owens_t.cpp
==============================================================================
--- branches/release/libs/math/test/test_owens_t.cpp (original)
+++ branches/release/libs/math/test/test_owens_t.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -33,7 +33,8 @@
using boost::math::owens_t;
#include <boost/math/distributions/normal.hpp>
-#include <boost/test/test_exec_monitor.hpp>
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp>
#include <boost/test/floating_point_comparison.hpp>
#include <boost/array.hpp>
@@ -267,7 +268,7 @@
}
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
BOOST_MATH_CONTROL_FP;
@@ -308,8 +309,8 @@
test_owens_t(boost::multiprecision::cpp_dec_float_50(0), "cpp_dec_float_50"); // Test real concept.
test_owens_t(boost::multiprecision::cpp_dec_float_100(0), "cpp_dec_float_100"); // Test real concept.
#endif
- return 0;
-} // int test_main(int, char* [])
+
+} // BOOST_AUTO_TEST_CASE( test_main )
/*
Modified: branches/release/libs/math/test/test_pareto.cpp
==============================================================================
--- branches/release/libs/math/test/test_pareto.cpp (original)
+++ branches/release/libs/math/test/test_pareto.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -24,7 +24,8 @@
#endif
#include <boost/math/concepts/real_concept.hpp> // for real_concept
-#include <boost/test/test_exec_monitor.hpp> // Boost.Test
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp> // Boost.Test
#include <boost/test/floating_point_comparison.hpp>
#include <boost/math/distributions/pareto.hpp>
@@ -247,7 +248,7 @@
BOOST_CHECK_THROW(quantile(pareto_distribution<RealType>(1, 1), 2), std::domain_error);
} // template <class RealType>void test_spots(RealType)
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
// Check that can generate pareto distribution using the two convenience methods:
boost::math::pareto myp1(1., 1); // Using typedef
@@ -328,8 +329,8 @@
"to pass.</note>" << std::cout;
#endif
- return 0;
-} // int test_main(int, char* [])
+
+} // BOOST_AUTO_TEST_CASE( test_main )
/*
Modified: branches/release/libs/math/test/test_poisson.cpp
==============================================================================
--- branches/release/libs/math/test/test_poisson.cpp (original)
+++ branches/release/libs/math/test/test_poisson.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -23,7 +23,8 @@
# pragma warning(disable: 4127) // conditional expression is constant.
#endif
-#include <boost/test/test_exec_monitor.hpp> // Boost.Test
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp> // Boost.Test
#include <boost/test/floating_point_comparison.hpp>
#include <boost/math/concepts/real_concept.hpp> // for real_concept
@@ -145,6 +146,26 @@
static_cast<RealType>(-1)), // bad probability.
std::domain_error);
+ BOOST_CHECK_THROW(
+ quantile(poisson_distribution<RealType>(static_cast<RealType>(1)),
+ static_cast<RealType>(1)), // bad probability.
+ std::overflow_error);
+
+ BOOST_CHECK_THROW(
+ quantile(complement(poisson_distribution<RealType>(static_cast<RealType>(1)),
+ static_cast<RealType>(0))), // bad probability.
+ std::overflow_error);
+
+ BOOST_CHECK_EQUAL(
+ quantile(poisson_distribution<RealType>(static_cast<RealType>(1)),
+ static_cast<RealType>(0)), // bad probability.
+ 0);
+
+ BOOST_CHECK_EQUAL(
+ quantile(complement(poisson_distribution<RealType>(static_cast<RealType>(1)),
+ static_cast<RealType>(1))), // bad probability.
+ 0);
+
// Check some test values.
BOOST_CHECK_CLOSE( // mode
@@ -491,7 +512,7 @@
//
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
// Check that can construct normal distribution using the two convenience methods:
using namespace boost::math;
@@ -607,8 +628,8 @@
#endif
#endif
#endif
- return 0;
-} // int test_main(int, char* [])
+
+} // BOOST_AUTO_TEST_CASE( test_main )
/*
Modified: branches/release/libs/math/test/test_policy.cpp
==============================================================================
--- branches/release/libs/math/test/test_policy.cpp (original)
+++ branches/release/libs/math/test/test_policy.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -8,7 +8,8 @@
#include <boost/math/policies/policy.hpp>
#include <boost/type_traits/is_same.hpp>
-#include <boost/test/test_exec_monitor.hpp> // for test_main
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp> // for test_main
#include <iostream>
template <class P1, class P2>
@@ -23,7 +24,7 @@
}
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
using namespace boost::math::policies;
using namespace boost;
@@ -169,8 +170,8 @@
BOOST_CHECK((is_same<policy<discrete_quantile<integer_round_up> >::promote_double_type, policy<>::promote_double_type>::value));
BOOST_CHECK((is_same<policy<discrete_quantile<integer_round_up> >::discrete_quantile_type, discrete_quantile<integer_round_up> >::value));
- return 0;
-} // int test_main(int, char* [])
+
+} // BOOST_AUTO_TEST_CASE( test_main )
Modified: branches/release/libs/math/test/test_policy_2.cpp
==============================================================================
--- branches/release/libs/math/test/test_policy_2.cpp (original)
+++ branches/release/libs/math/test/test_policy_2.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -1,4 +1,4 @@
-
+#define BOOST_TEST_MAIN
// Copyright John Maddock 2007.
// Use, modification and distribution are subject to the
@@ -8,7 +8,7 @@
#include <boost/math/policies/policy.hpp>
#include <boost/type_traits/is_same.hpp>
-#include <boost/test/test_exec_monitor.hpp> // for test_main
+#include <boost/test/unit_test.hpp> // for test_main
#include <iostream>
template <class P1, class P2>
@@ -23,7 +23,7 @@
}
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
using namespace boost::math::policies;
using namespace boost;
@@ -40,8 +40,8 @@
BOOST_CHECK((is_same<policy<domain_error<ignore_error>, overflow_error<ignore_error> >::promote_double_type, policy<>::promote_double_type>::value));
BOOST_CHECK((is_same<policy<domain_error<ignore_error>, overflow_error<ignore_error> >::discrete_quantile_type, policy<>::discrete_quantile_type>::value));
- return 0;
-} // int test_main(int, char* [])
+
+} // BOOST_AUTO_TEST_CASE( test_main )
Modified: branches/release/libs/math/test/test_policy_3.cpp
==============================================================================
--- branches/release/libs/math/test/test_policy_3.cpp (original)
+++ branches/release/libs/math/test/test_policy_3.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -8,7 +8,8 @@
#include <boost/math/policies/policy.hpp>
#include <boost/type_traits/is_same.hpp>
-#include <boost/test/test_exec_monitor.hpp> // for test_main
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp> // for test_main
#include <iostream>
template <class P1, class P2>
@@ -23,7 +24,7 @@
}
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
using namespace boost::math::policies;
using namespace boost;
@@ -40,8 +41,8 @@
BOOST_CHECK((is_same<policy<denorm_error<throw_on_error>, domain_error<ignore_error> >::promote_double_type, policy<>::promote_double_type>::value));
BOOST_CHECK((is_same<policy<denorm_error<throw_on_error>, domain_error<ignore_error> >::discrete_quantile_type, policy<>::discrete_quantile_type>::value));
- return 0;
-} // int test_main(int, char* [])
+
+} // BOOST_AUTO_TEST_CASE( test_main )
Modified: branches/release/libs/math/test/test_policy_4.cpp
==============================================================================
--- branches/release/libs/math/test/test_policy_4.cpp (original)
+++ branches/release/libs/math/test/test_policy_4.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -1,4 +1,4 @@
-
+#define BOOST_TEST_MAIN
// Copyright John Maddock 2007.
// Use, modification and distribution are subject to the
@@ -8,7 +8,7 @@
#include <boost/math/policies/policy.hpp>
#include <boost/type_traits/is_same.hpp>
-#include <boost/test/test_exec_monitor.hpp> // for test_main
+#include <boost/test/unit_test.hpp> // for test_main
#include <iostream>
template <class P1, class P2>
@@ -23,7 +23,7 @@
}
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
using namespace boost::math::policies;
using namespace boost;
@@ -40,8 +40,8 @@
BOOST_CHECK((is_same<policy<digits2<20>, promote_float<false>, discrete_quantile<integer_round_down>, denorm_error<throw_on_error>, domain_error<ignore_error> >::promote_double_type, policy<>::promote_double_type>::value));
BOOST_CHECK((is_same<policy<digits2<20>, promote_float<false>, discrete_quantile<integer_round_down>, denorm_error<throw_on_error>, domain_error<ignore_error> >::discrete_quantile_type, discrete_quantile<integer_round_down> >::value));
- return 0;
-} // int test_main(int, char* [])
+
+} // BOOST_AUTO_TEST_CASE( test_main )
Modified: branches/release/libs/math/test/test_policy_5.cpp
==============================================================================
--- branches/release/libs/math/test/test_policy_5.cpp (original)
+++ branches/release/libs/math/test/test_policy_5.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -8,7 +8,8 @@
#include <boost/math/policies/policy.hpp>
#include <boost/type_traits/is_same.hpp>
-#include <boost/test/test_exec_monitor.hpp> // for test_main
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp> // for test_main
#include <iostream>
template <class P1, class P2>
@@ -23,7 +24,7 @@
}
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
using namespace boost::math::policies;
using namespace boost;
@@ -40,8 +41,8 @@
BOOST_CHECK((is_same<normalise<policy<digits2<20>, promote_float<false>, discrete_quantile<integer_round_down>, denorm_error<throw_on_error>, domain_error<ignore_error> > >::type::promote_double_type, policy<>::promote_double_type>::value));
BOOST_CHECK((is_same<normalise<policy<digits2<20>, promote_float<false>, discrete_quantile<integer_round_down>, denorm_error<throw_on_error>, domain_error<ignore_error> > >::type::discrete_quantile_type, discrete_quantile<integer_round_down> >::value));
- return 0;
-} // int test_main(int, char* [])
+
+} // BOOST_AUTO_TEST_CASE( test_main )
Modified: branches/release/libs/math/test/test_policy_6.cpp
==============================================================================
--- branches/release/libs/math/test/test_policy_6.cpp (original)
+++ branches/release/libs/math/test/test_policy_6.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -1,4 +1,4 @@
-
+#define BOOST_TEST_MAIN
// Copyright John Maddock 2007.
// Use, modification and distribution are subject to the
@@ -8,7 +8,7 @@
#include <boost/math/policies/policy.hpp>
#include <boost/type_traits/is_same.hpp>
-#include <boost/test/test_exec_monitor.hpp> // for test_main
+#include <boost/test/unit_test.hpp> // for test_main
#include <iostream>
template <class P1, class P2>
@@ -23,7 +23,7 @@
}
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
using namespace boost::math::policies;
using namespace boost;
@@ -40,8 +40,8 @@
BOOST_CHECK((is_same<normalise<policy<>, digits2<20>, promote_float<false>, discrete_quantile<integer_round_down>, denorm_error<throw_on_error>, domain_error<ignore_error> >::type::promote_double_type, policy<>::promote_double_type>::value));
BOOST_CHECK((is_same<normalise<policy<>, digits2<20>, promote_float<false>, discrete_quantile<integer_round_down>, denorm_error<throw_on_error>, domain_error<ignore_error> >::type::discrete_quantile_type, discrete_quantile<integer_round_down> >::value));
- return 0;
-} // int test_main(int, char* [])
+
+} // BOOST_AUTO_TEST_CASE( test_main )
Modified: branches/release/libs/math/test/test_policy_7.cpp
==============================================================================
--- branches/release/libs/math/test/test_policy_7.cpp (original)
+++ branches/release/libs/math/test/test_policy_7.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -8,7 +8,8 @@
#include <boost/math/policies/policy.hpp>
#include <boost/type_traits/is_same.hpp>
-#include <boost/test/test_exec_monitor.hpp> // for test_main
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp> // for test_main
#include <iostream>
template <class P1, class P2>
@@ -23,7 +24,7 @@
}
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
using namespace boost::math::policies;
using namespace boost;
@@ -36,8 +37,8 @@
BOOST_CHECK(check_same(make_policy(pole_error<ignore_error>()), normalise<policy<pole_error<ignore_error> > >::type()));
BOOST_CHECK(check_same(make_policy(indeterminate_result_error<ignore_error>()), normalise<policy<indeterminate_result_error<ignore_error> > >::type()));
- return 0;
-} // int test_main(int, char* [])
+
+} // BOOST_AUTO_TEST_CASE( test_main )
Modified: branches/release/libs/math/test/test_policy_8.cpp
==============================================================================
--- branches/release/libs/math/test/test_policy_8.cpp (original)
+++ branches/release/libs/math/test/test_policy_8.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -1,4 +1,4 @@
-
+#define BOOST_TEST_MAIN
// Copyright John Maddock 2007.
// Use, modification and distribution are subject to the
@@ -8,7 +8,7 @@
#include <boost/math/policies/policy.hpp>
#include <boost/type_traits/is_same.hpp>
-#include <boost/test/test_exec_monitor.hpp> // for test_main
+#include <boost/test/unit_test.hpp> // for test_main
#include <iostream>
template <class P1, class P2>
@@ -23,7 +23,7 @@
}
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
using namespace boost::math::policies;
using namespace boost;
@@ -43,8 +43,8 @@
BOOST_CHECK(check_same(make_policy(domain_error<ignore_error>(), pole_error<ignore_error>(), overflow_error<ignore_error>(), underflow_error<throw_on_error>(), denorm_error<throw_on_error>(), evaluation_error<ignore_error>(), indeterminate_result_error<throw_on_error>(), digits2<10>(), promote_float<false>(), promote_double<false>(), discrete_quantile<integer_round_down>()), policy<domain_error<ignore_error>, pole_error<ignore_error>, overflow_error<ignore_error>, underflow_error<throw_on_error>, denorm_error<throw_on_error>, evaluation_error<ignore_error>, indeterminate_result_error<throw_on_error>, digits2<10>, promote_float<false>, promote_double<false>, discrete_quantile<integer_round_down> >()));
#endif
- return 0;
-} // int test_main(int, char* [])
+
+} // BOOST_AUTO_TEST_CASE( test_main )
Modified: branches/release/libs/math/test/test_policy_sf.cpp
==============================================================================
--- branches/release/libs/math/test/test_policy_sf.cpp (original)
+++ branches/release/libs/math/test/test_policy_sf.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -3,7 +3,8 @@
// 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 <boost/test/test_exec_monitor.hpp>
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp>
#include <boost/test/floating_point_comparison.hpp>
#include <boost/math/special_functions.hpp>
@@ -37,7 +38,7 @@
#undef isfinite
#undef isnan
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
int i;
TEST_POLICY_SF(tgamma(3.0));
@@ -130,7 +131,7 @@
TEST_POLICY_SF(sph_bessel(3, 5));
TEST_POLICY_SF(sph_neumann(3, 5.0));
TEST_POLICY_SF(sph_neumann(3, 5));
- return 0;
+
}
Modified: branches/release/libs/math/test/test_rational_instances/test_rational.hpp
==============================================================================
--- branches/release/libs/math/test/test_rational_instances/test_rational.hpp (original)
+++ branches/release/libs/math/test/test_rational_instances/test_rational.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -8,7 +8,7 @@
#define BOOST_MATH_TEST_RATIONAL_HPP
#include <boost/test/floating_point_comparison.hpp>
-#include <boost/test/test_exec_monitor.hpp>
+#include <boost/test/unit_test.hpp>
#include <boost/array.hpp>
#include <boost/math/tools/rational.hpp>
#include <boost/math/tools/precision.hpp>
@@ -30,7 +30,7 @@
// Polynomials of order 0
//
static const U n1c[1] = { 2 };
- static const boost::array<U, 1> n1a = { 2 };
+ static const boost::array<U, 1> n1a = {{ 2 }};
BOOST_CHECK_CLOSE(
boost::math::tools::evaluate_polynomial(n1c, static_cast<T>(0.125), 1),
static_cast<T>(0.2e1L),
@@ -185,7 +185,7 @@
// Rational functions of order 0
//
static const U d1c[1] = { 3 };
- static const boost::array<U, 1> d1a = { 3 };
+ static const boost::array<U, 1> d1a = {{ 3 }};
BOOST_CHECK_CLOSE(
boost::math::tools::evaluate_rational(n1c, d1c, static_cast<T>(0.125), 1),
static_cast<T>(0.6666666666666666666666666666666666666667e0L),
@@ -265,7 +265,7 @@
// Polynomials of order 1
//
static const U n2c[2] = { 3, 1 };
- static const boost::array<U, 2> n2a = { 3, 1 };
+ static const boost::array<U, 2> n2a = {{ 3, 1 }};
BOOST_CHECK_CLOSE(
boost::math::tools::evaluate_polynomial(n2c, static_cast<T>(0.125), 2),
static_cast<T>(0.3125e1L),
@@ -495,7 +495,7 @@
// Rational functions of order 1
//
static const U d2c[2] = { 5, 9 };
- static const boost::array<U, 2> d2a = { 5, 9 };
+ static const boost::array<U, 2> d2a = {{ 5, 9 }};
BOOST_CHECK_CLOSE(
boost::math::tools::evaluate_rational(n2c, d2c, static_cast<T>(0.125), 2),
static_cast<T>(0.5102040816326530612244897959183673469388e0L),
@@ -584,7 +584,7 @@
// Polynomials of order 2
//
static const U n3c[3] = { 10, 6, 11 };
- static const boost::array<U, 3> n3a = { 10, 6, 11 };
+ static const boost::array<U, 3> n3a = {{ 10, 6, 11 }};
BOOST_CHECK_CLOSE(
boost::math::tools::evaluate_polynomial(n3c, static_cast<T>(0.125), 3),
static_cast<T>(0.10921875e2L),
Modified: branches/release/libs/math/test/test_rationals.cpp
==============================================================================
--- branches/release/libs/math/test/test_rationals.cpp (original)
+++ branches/release/libs/math/test/test_rationals.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -4,7 +4,8 @@
// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
#include <boost/math/concepts/real_concept.hpp>
-#include <boost/test/test_exec_monitor.hpp>
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp>
#include <boost/test/floating_point_comparison.hpp>
#include <boost/array.hpp>
#include <boost/math/tools/rational.hpp>
@@ -26,7 +27,7 @@
do_test_spots(t, T(0));
}
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
test_spots(0.0F, "float");
test_spots(0.0, "double");
@@ -41,7 +42,7 @@
"not available at all, or because they are too inaccurate for these tests "
"to pass.</note>" << std::cout;
#endif
- return 0;
+
}
Modified: branches/release/libs/math/test/test_rayleigh.cpp
==============================================================================
--- branches/release/libs/math/test/test_rayleigh.cpp (original)
+++ branches/release/libs/math/test/test_rayleigh.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -16,7 +16,8 @@
#include <boost/math/distributions/rayleigh.hpp>
using boost::math::rayleigh_distribution;
-#include <boost/test/test_exec_monitor.hpp> // Boost.Test
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp> // Boost.Test
#include <boost/test/floating_point_comparison.hpp>
#include "test_out_of_range.hpp"
@@ -213,7 +214,7 @@
} // template <class RealType>void test_spots(RealType)
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
// Check that can generate rayleigh distribution using the two convenience methods:
boost::math::rayleigh ray1(1.); // Using typedef
@@ -308,8 +309,8 @@
"to pass.</note>" << std::cout;
#endif
- return 0;
-} // int test_main(int, char* [])
+
+} // BOOST_AUTO_TEST_CASE( test_main )
/*
Modified: branches/release/libs/math/test/test_real_concept.cpp
==============================================================================
--- branches/release/libs/math/test/test_real_concept.cpp (original)
+++ branches/release/libs/math/test/test_real_concept.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -7,14 +7,15 @@
#include <boost/math/concepts/real_concept.hpp> // for real_concept
#include <boost/math/constants/constants.hpp>
-#include <boost/test/test_exec_monitor.hpp> // Boost.Test
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp> // Boost.Test
#include <boost/test/results_collector.hpp>
#include <boost/test/unit_test.hpp>
#include <boost/test/floating_point_comparison.hpp>
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
#ifndef BOOST_MATH_NO_LONG_DOUBLE_MATH_FUNCTIONS
@@ -567,6 +568,6 @@
"to pass.</note>" << std::cout;
#endif
- return 0;
-} // int test_main(int, char* [])
+
+} // BOOST_AUTO_TEST_CASE( test_main )
Modified: branches/release/libs/math/test/test_remez.cpp
==============================================================================
--- branches/release/libs/math/test/test_remez.cpp (original)
+++ branches/release/libs/math/test/test_remez.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -14,7 +14,8 @@
#endif
#include <boost/math/tools/remez.hpp>
-#include <boost/test/test_exec_monitor.hpp>
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp>
#include <boost/test/floating_point_comparison.hpp>
#include <boost/math/special_functions/expm1.hpp>
@@ -174,11 +175,11 @@
std::cout << "~~~~~~~~~~~~~~~~~~~~~~~~~" << std::endl;
}
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
test_polynomial();
test_rational();
- return 0;
+
}
Modified: branches/release/libs/math/test/test_roots.cpp
==============================================================================
--- branches/release/libs/math/test/test_roots.cpp (original)
+++ branches/release/libs/math/test/test_roots.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -5,7 +5,8 @@
#include <pch.hpp>
-#include <boost/test/test_exec_monitor.hpp>
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp>
#include <boost/test/floating_point_comparison.hpp>
#include <boost/test/results_collector.hpp>
#include <boost/math/special_functions/beta.hpp>
@@ -314,10 +315,10 @@
test_inverses<T>(ibeta_large_data);
}
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
test_beta(0.1, "double");
- return 0;
+
}
Modified: branches/release/libs/math/test/test_round.cpp
==============================================================================
--- branches/release/libs/math/test/test_round.cpp (original)
+++ branches/release/libs/math/test/test_round.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -6,7 +6,8 @@
#include <pch.hpp>
#include <boost/math/concepts/real_concept.hpp>
-#include <boost/test/test_exec_monitor.hpp>
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp>
#include <boost/test/floating_point_comparison.hpp>
#include <boost/math/special_functions/round.hpp>
#include <boost/math/special_functions/trunc.hpp>
@@ -123,79 +124,82 @@
void test_round(T, const char* name )
{
BOOST_MATH_STD_USING
+#ifdef BOOST_HAS_LONG_LONG
+ using boost::math::llround; using boost::math::lltrunc;
+#endif
std::cout << "Testing rounding with type " << name << std::endl;
for(int i = 0; i < 1000; ++i)
{
T arg = get_random<T>();
- T r = boost::math::round(arg);
+ T r = round(arg);
check_within_half(arg, r);
- r = boost::math::trunc(arg);
+ r = trunc(arg);
check_trunc_result(arg, r);
- T frac = boost::math::modf(arg, &r);
+ T frac = modf(arg, &r);
check_modf_result(arg, frac, r);
if(abs(r) < (std::numeric_limits<int>::max)())
{
- int i = boost::math::iround(arg);
+ int i = iround(arg);
check_within_half(arg, i);
- i = boost::math::itrunc(arg);
+ i = itrunc(arg);
check_trunc_result(arg, i);
- r = boost::math::modf(arg, &i);
+ r = modf(arg, &i);
check_modf_result(arg, r, i);
}
if(std::numeric_limits<T>::digits >= std::numeric_limits<int>::digits)
{
- int si = boost::math::iround(static_cast<T>((std::numeric_limits<int>::max)()));
+ int si = iround(static_cast<T>((std::numeric_limits<int>::max)()));
check_within_half(static_cast<T>((std::numeric_limits<int>::max)()), si);
- si = boost::math::iround(static_cast<T>((std::numeric_limits<int>::min)()));
+ si = iround(static_cast<T>((std::numeric_limits<int>::min)()));
check_within_half(static_cast<T>((std::numeric_limits<int>::min)()), si);
- si = boost::math::itrunc(static_cast<T>((std::numeric_limits<int>::max)()));
+ si = itrunc(static_cast<T>((std::numeric_limits<int>::max)()));
check_trunc_result(static_cast<T>((std::numeric_limits<int>::max)()), si);
- si = boost::math::itrunc(static_cast<T>((std::numeric_limits<int>::min)()));
+ si = itrunc(static_cast<T>((std::numeric_limits<int>::min)()));
check_trunc_result(static_cast<T>((std::numeric_limits<int>::min)()), si);
}
if(abs(r) < (std::numeric_limits<long>::max)())
{
- long l = boost::math::lround(arg);
+ long l = lround(arg);
check_within_half(arg, l);
- l = boost::math::ltrunc(arg);
+ l = ltrunc(arg);
check_trunc_result(arg, l);
- r = boost::math::modf(arg, &l);
+ r = modf(arg, &l);
check_modf_result(arg, r, l);
}
if(std::numeric_limits<T>::digits >= std::numeric_limits<long>::digits)
{
- long k = boost::math::lround(static_cast<T>((std::numeric_limits<long>::max)()));
+ long k = lround(static_cast<T>((std::numeric_limits<long>::max)()));
check_within_half(static_cast<T>((std::numeric_limits<long>::max)()), k);
- k = boost::math::lround(static_cast<T>((std::numeric_limits<long>::min)()));
+ k = lround(static_cast<T>((std::numeric_limits<long>::min)()));
check_within_half(static_cast<T>((std::numeric_limits<long>::min)()), k);
- k = boost::math::ltrunc(static_cast<T>((std::numeric_limits<long>::max)()));
+ k = ltrunc(static_cast<T>((std::numeric_limits<long>::max)()));
check_trunc_result(static_cast<T>((std::numeric_limits<long>::max)()), k);
- k = boost::math::ltrunc(static_cast<T>((std::numeric_limits<long>::min)()));
+ k = ltrunc(static_cast<T>((std::numeric_limits<long>::min)()));
check_trunc_result(static_cast<T>((std::numeric_limits<long>::min)()), k);
}
#ifdef BOOST_HAS_LONG_LONG
if(abs(r) < (std::numeric_limits<boost::long_long_type>::max)())
{
- boost::long_long_type ll = boost::math::llround(arg);
+ boost::long_long_type ll = llround(arg);
check_within_half(arg, ll);
- ll = boost::math::lltrunc(arg);
+ ll = lltrunc(arg);
check_trunc_result(arg, ll);
- r = boost::math::modf(arg, &ll);
+ r = modf(arg, &ll);
check_modf_result(arg, r, ll);
}
if(std::numeric_limits<T>::digits >= std::numeric_limits<boost::long_long_type>::digits)
{
- boost::long_long_type j = boost::math::llround(static_cast<T>((std::numeric_limits<boost::long_long_type>::max)()));
+ boost::long_long_type j = llround(static_cast<T>((std::numeric_limits<boost::long_long_type>::max)()));
check_within_half(static_cast<T>((std::numeric_limits<boost::long_long_type>::max)()), j);
- j = boost::math::llround(static_cast<T>((std::numeric_limits<boost::long_long_type>::min)()));
+ j = llround(static_cast<T>((std::numeric_limits<boost::long_long_type>::min)()));
check_within_half(static_cast<T>((std::numeric_limits<boost::long_long_type>::min)()), j);
- j = boost::math::lltrunc(static_cast<T>((std::numeric_limits<boost::long_long_type>::max)()));
+ j = lltrunc(static_cast<T>((std::numeric_limits<boost::long_long_type>::max)()));
check_trunc_result(static_cast<T>((std::numeric_limits<boost::long_long_type>::max)()), j);
- j = boost::math::lltrunc(static_cast<T>((std::numeric_limits<boost::long_long_type>::min)()));
+ j = lltrunc(static_cast<T>((std::numeric_limits<boost::long_long_type>::min)()));
check_trunc_result(static_cast<T>((std::numeric_limits<boost::long_long_type>::min)()), j);
}
#endif
@@ -203,101 +207,145 @@
//
// Finish off by testing the error handlers:
//
- BOOST_CHECK_THROW(boost::math::iround(static_cast<T>(1e20)), boost::math::rounding_error);
- BOOST_CHECK_THROW(boost::math::iround(static_cast<T>(-1e20)), boost::math::rounding_error);
- BOOST_CHECK_THROW(boost::math::lround(static_cast<T>(1e20)), boost::math::rounding_error);
- BOOST_CHECK_THROW(boost::math::lround(static_cast<T>(-1e20)), boost::math::rounding_error);
+ BOOST_CHECK_THROW(iround(static_cast<T>(1e20)), boost::math::rounding_error);
+ BOOST_CHECK_THROW(iround(static_cast<T>(-1e20)), boost::math::rounding_error);
+ BOOST_CHECK_THROW(lround(static_cast<T>(1e20)), boost::math::rounding_error);
+ BOOST_CHECK_THROW(lround(static_cast<T>(-1e20)), boost::math::rounding_error);
#ifdef BOOST_HAS_LONG_LONG
- BOOST_CHECK_THROW(boost::math::llround(static_cast<T>(1e20)), boost::math::rounding_error);
- BOOST_CHECK_THROW(boost::math::llround(static_cast<T>(-1e20)), boost::math::rounding_error);
+ BOOST_CHECK_THROW(llround(static_cast<T>(1e20)), boost::math::rounding_error);
+ BOOST_CHECK_THROW(llround(static_cast<T>(-1e20)), boost::math::rounding_error);
#endif
if(std::numeric_limits<T>::has_infinity)
{
- BOOST_CHECK_THROW(boost::math::round(std::numeric_limits<T>::infinity()), boost::math::rounding_error);
- BOOST_CHECK_THROW(boost::math::iround(std::numeric_limits<T>::infinity()), boost::math::rounding_error);
- BOOST_CHECK_THROW(boost::math::iround(-std::numeric_limits<T>::infinity()), boost::math::rounding_error);
- BOOST_CHECK_THROW(boost::math::lround(std::numeric_limits<T>::infinity()), boost::math::rounding_error);
- BOOST_CHECK_THROW(boost::math::lround(-std::numeric_limits<T>::infinity()), boost::math::rounding_error);
+ BOOST_CHECK_THROW(round(std::numeric_limits<T>::infinity()), boost::math::rounding_error);
+ BOOST_CHECK_THROW(iround(std::numeric_limits<T>::infinity()), boost::math::rounding_error);
+ BOOST_CHECK_THROW(iround(-std::numeric_limits<T>::infinity()), boost::math::rounding_error);
+ BOOST_CHECK_THROW(lround(std::numeric_limits<T>::infinity()), boost::math::rounding_error);
+ BOOST_CHECK_THROW(lround(-std::numeric_limits<T>::infinity()), boost::math::rounding_error);
#ifdef BOOST_HAS_LONG_LONG
- BOOST_CHECK_THROW(boost::math::llround(std::numeric_limits<T>::infinity()), boost::math::rounding_error);
- BOOST_CHECK_THROW(boost::math::llround(-std::numeric_limits<T>::infinity()), boost::math::rounding_error);
+ BOOST_CHECK_THROW(llround(std::numeric_limits<T>::infinity()), boost::math::rounding_error);
+ BOOST_CHECK_THROW(llround(-std::numeric_limits<T>::infinity()), boost::math::rounding_error);
#endif
}
if(std::numeric_limits<T>::has_quiet_NaN)
{
- BOOST_CHECK_THROW(boost::math::round(std::numeric_limits<T>::quiet_NaN()), boost::math::rounding_error);
- BOOST_CHECK_THROW(boost::math::iround(std::numeric_limits<T>::quiet_NaN()), boost::math::rounding_error);
- BOOST_CHECK_THROW(boost::math::lround(std::numeric_limits<T>::quiet_NaN()), boost::math::rounding_error);
+ BOOST_CHECK_THROW(round(std::numeric_limits<T>::quiet_NaN()), boost::math::rounding_error);
+ BOOST_CHECK_THROW(iround(std::numeric_limits<T>::quiet_NaN()), boost::math::rounding_error);
+ BOOST_CHECK_THROW(lround(std::numeric_limits<T>::quiet_NaN()), boost::math::rounding_error);
#ifdef BOOST_HAS_LONG_LONG
- BOOST_CHECK_THROW(boost::math::llround(std::numeric_limits<T>::quiet_NaN()), boost::math::rounding_error);
+ BOOST_CHECK_THROW(llround(std::numeric_limits<T>::quiet_NaN()), boost::math::rounding_error);
#endif
}
- BOOST_CHECK_THROW(boost::math::itrunc(static_cast<T>(1e20)), boost::math::rounding_error);
- BOOST_CHECK_THROW(boost::math::itrunc(static_cast<T>(-1e20)), boost::math::rounding_error);
- BOOST_CHECK_THROW(boost::math::ltrunc(static_cast<T>(1e20)), boost::math::rounding_error);
- BOOST_CHECK_THROW(boost::math::ltrunc(static_cast<T>(-1e20)), boost::math::rounding_error);
+ BOOST_CHECK_THROW(itrunc(static_cast<T>(1e20)), boost::math::rounding_error);
+ BOOST_CHECK_THROW(itrunc(static_cast<T>(-1e20)), boost::math::rounding_error);
+ BOOST_CHECK_THROW(ltrunc(static_cast<T>(1e20)), boost::math::rounding_error);
+ BOOST_CHECK_THROW(ltrunc(static_cast<T>(-1e20)), boost::math::rounding_error);
#ifdef BOOST_HAS_LONG_LONG
- BOOST_CHECK_THROW(boost::math::lltrunc(static_cast<T>(1e20)), boost::math::rounding_error);
- BOOST_CHECK_THROW(boost::math::lltrunc(static_cast<T>(-1e20)), boost::math::rounding_error);
+ BOOST_CHECK_THROW(lltrunc(static_cast<T>(1e20)), boost::math::rounding_error);
+ BOOST_CHECK_THROW(lltrunc(static_cast<T>(-1e20)), boost::math::rounding_error);
#endif
if(std::numeric_limits<T>::has_infinity)
{
- BOOST_CHECK_THROW(boost::math::trunc(std::numeric_limits<T>::infinity()), boost::math::rounding_error);
- BOOST_CHECK_THROW(boost::math::itrunc(std::numeric_limits<T>::infinity()), boost::math::rounding_error);
- BOOST_CHECK_THROW(boost::math::itrunc(-std::numeric_limits<T>::infinity()), boost::math::rounding_error);
- BOOST_CHECK_THROW(boost::math::ltrunc(std::numeric_limits<T>::infinity()), boost::math::rounding_error);
- BOOST_CHECK_THROW(boost::math::ltrunc(-std::numeric_limits<T>::infinity()), boost::math::rounding_error);
+ BOOST_CHECK_THROW(trunc(std::numeric_limits<T>::infinity()), boost::math::rounding_error);
+ BOOST_CHECK_THROW(itrunc(std::numeric_limits<T>::infinity()), boost::math::rounding_error);
+ BOOST_CHECK_THROW(itrunc(-std::numeric_limits<T>::infinity()), boost::math::rounding_error);
+ BOOST_CHECK_THROW(ltrunc(std::numeric_limits<T>::infinity()), boost::math::rounding_error);
+ BOOST_CHECK_THROW(ltrunc(-std::numeric_limits<T>::infinity()), boost::math::rounding_error);
#ifdef BOOST_HAS_LONG_LONG
- BOOST_CHECK_THROW(boost::math::lltrunc(std::numeric_limits<T>::infinity()), boost::math::rounding_error);
- BOOST_CHECK_THROW(boost::math::lltrunc(-std::numeric_limits<T>::infinity()), boost::math::rounding_error);
+ BOOST_CHECK_THROW(lltrunc(std::numeric_limits<T>::infinity()), boost::math::rounding_error);
+ BOOST_CHECK_THROW(lltrunc(-std::numeric_limits<T>::infinity()), boost::math::rounding_error);
#endif
}
if(std::numeric_limits<T>::has_quiet_NaN)
{
- BOOST_CHECK_THROW(boost::math::trunc(std::numeric_limits<T>::quiet_NaN()), boost::math::rounding_error);
- BOOST_CHECK_THROW(boost::math::itrunc(std::numeric_limits<T>::quiet_NaN()), boost::math::rounding_error);
- BOOST_CHECK_THROW(boost::math::ltrunc(std::numeric_limits<T>::quiet_NaN()), boost::math::rounding_error);
+ BOOST_CHECK_THROW(trunc(std::numeric_limits<T>::quiet_NaN()), boost::math::rounding_error);
+ BOOST_CHECK_THROW(itrunc(std::numeric_limits<T>::quiet_NaN()), boost::math::rounding_error);
+ BOOST_CHECK_THROW(ltrunc(std::numeric_limits<T>::quiet_NaN()), boost::math::rounding_error);
#ifdef BOOST_HAS_LONG_LONG
- BOOST_CHECK_THROW(boost::math::lltrunc(std::numeric_limits<T>::quiet_NaN()), boost::math::rounding_error);
+ BOOST_CHECK_THROW(lltrunc(std::numeric_limits<T>::quiet_NaN()), boost::math::rounding_error);
#endif
}
if(std::numeric_limits<T>::digits >= std::numeric_limits<int>::digits)
{
- BOOST_CHECK_THROW(boost::math::itrunc(static_cast<T>((std::numeric_limits<int>::max)()) + 1), boost::math::rounding_error);
- BOOST_CHECK_THROW(boost::math::itrunc(static_cast<T>((std::numeric_limits<int>::min)()) - 1), boost::math::rounding_error);
+ BOOST_CHECK_THROW(itrunc(static_cast<T>((std::numeric_limits<int>::max)()) + 1), boost::math::rounding_error);
+ BOOST_CHECK_THROW(itrunc(static_cast<T>((std::numeric_limits<int>::min)()) - 1), boost::math::rounding_error);
}
if(std::numeric_limits<T>::digits >= std::numeric_limits<long>::digits)
{
- BOOST_CHECK_THROW(boost::math::ltrunc(static_cast<T>((std::numeric_limits<long>::max)()) + 1), boost::math::rounding_error);
- BOOST_CHECK_THROW(boost::math::ltrunc(static_cast<T>((std::numeric_limits<long>::min)()) - 1), boost::math::rounding_error);
+ BOOST_CHECK_THROW(ltrunc(static_cast<T>((std::numeric_limits<long>::max)()) + 1), boost::math::rounding_error);
+ BOOST_CHECK_THROW(ltrunc(static_cast<T>((std::numeric_limits<long>::min)()) - 1), boost::math::rounding_error);
}
#ifndef BOOST_NO_LONG_LONG
if(std::numeric_limits<T>::digits >= std::numeric_limits<boost::long_long_type>::digits)
{
- BOOST_CHECK_THROW(boost::math::lltrunc(static_cast<T>((std::numeric_limits<boost::long_long_type>::max)()) + 1), boost::math::rounding_error);
- BOOST_CHECK_THROW(boost::math::lltrunc(static_cast<T>((std::numeric_limits<boost::long_long_type>::min)()) - 1), boost::math::rounding_error);
+ BOOST_CHECK_THROW(lltrunc(static_cast<T>((std::numeric_limits<boost::long_long_type>::max)()) + 1), boost::math::rounding_error);
+ BOOST_CHECK_THROW(lltrunc(static_cast<T>((std::numeric_limits<boost::long_long_type>::min)()) - 1), boost::math::rounding_error);
}
#endif
if(std::numeric_limits<T>::digits >= std::numeric_limits<int>::digits)
{
- BOOST_CHECK_THROW(boost::math::iround(static_cast<T>((std::numeric_limits<int>::max)()) + 1), boost::math::rounding_error);
- BOOST_CHECK_THROW(boost::math::iround(static_cast<T>((std::numeric_limits<int>::min)()) - 1), boost::math::rounding_error);
+ BOOST_CHECK_THROW(iround(static_cast<T>((std::numeric_limits<int>::max)()) + 1), boost::math::rounding_error);
+ BOOST_CHECK_THROW(iround(static_cast<T>((std::numeric_limits<int>::min)()) - 1), boost::math::rounding_error);
}
if(std::numeric_limits<T>::digits >= std::numeric_limits<long>::digits)
{
- BOOST_CHECK_THROW(boost::math::lround(static_cast<T>((std::numeric_limits<long>::max)()) + 1), boost::math::rounding_error);
- BOOST_CHECK_THROW(boost::math::lround(static_cast<T>((std::numeric_limits<long>::min)()) - 1), boost::math::rounding_error);
+ BOOST_CHECK_THROW(lround(static_cast<T>((std::numeric_limits<long>::max)()) + 1), boost::math::rounding_error);
+ BOOST_CHECK_THROW(lround(static_cast<T>((std::numeric_limits<long>::min)()) - 1), boost::math::rounding_error);
}
#ifndef BOOST_NO_LONG_LONG
if(std::numeric_limits<T>::digits >= std::numeric_limits<boost::long_long_type>::digits)
{
- BOOST_CHECK_THROW(boost::math::llround(static_cast<T>((std::numeric_limits<boost::long_long_type>::max)()) + 1), boost::math::rounding_error);
- BOOST_CHECK_THROW(boost::math::llround(static_cast<T>((std::numeric_limits<boost::long_long_type>::min)()) - 1), boost::math::rounding_error);
+ BOOST_CHECK_THROW(llround(static_cast<T>((std::numeric_limits<boost::long_long_type>::max)()) + 1), boost::math::rounding_error);
+ BOOST_CHECK_THROW(llround(static_cast<T>((std::numeric_limits<boost::long_long_type>::min)()) - 1), boost::math::rounding_error);
+ }
+#endif
+ //
+ // try non-throwing error handlers:
+ //
+ boost::math::policies::policy<boost::math::policies::rounding_error<boost::math::policies::ignore_error> > pol;
+
+ if(std::numeric_limits<T>::digits >= std::numeric_limits<int>::digits)
+ {
+ BOOST_CHECK_EQUAL(iround((std::numeric_limits<int>::max)() + T(1.0), pol), (std::numeric_limits<int>::max)());
+ BOOST_CHECK_EQUAL(iround((std::numeric_limits<int>::min)() - T(1.0), pol), (std::numeric_limits<int>::min)());
+ BOOST_CHECK_EQUAL(itrunc((std::numeric_limits<int>::max)() + T(1.0), pol), (std::numeric_limits<int>::max)());
+ BOOST_CHECK_EQUAL(itrunc((std::numeric_limits<int>::min)() - T(1.0), pol), (std::numeric_limits<int>::min)());
}
+ if(std::numeric_limits<T>::digits >= std::numeric_limits<long>::digits)
+ {
+ BOOST_CHECK_EQUAL(lround((std::numeric_limits<long>::max)() + T(1.0), pol), (std::numeric_limits<long>::max)());
+ BOOST_CHECK_EQUAL(lround((std::numeric_limits<long>::min)() - T(1.0), pol), (std::numeric_limits<long>::min)());
+ BOOST_CHECK_EQUAL(ltrunc((std::numeric_limits<long>::max)() + T(1.0), pol), (std::numeric_limits<long>::max)());
+ BOOST_CHECK_EQUAL(ltrunc((std::numeric_limits<long>::min)() - T(1.0), pol), (std::numeric_limits<long>::min)());
+ }
+#ifndef BOOST_NO_LONG_LONG
+ if(std::numeric_limits<T>::digits >= std::numeric_limits<long long>::digits)
+ {
+ BOOST_CHECK_EQUAL(llround((std::numeric_limits<long long>::max)() + T(1.0), pol), (std::numeric_limits<long long>::max)());
+ BOOST_CHECK_EQUAL(llround((std::numeric_limits<long long>::min)() - T(1.0), pol), (std::numeric_limits<long long>::min)());
+ BOOST_CHECK_EQUAL(lltrunc((std::numeric_limits<long long>::max)() + T(1.0), pol), (std::numeric_limits<long long>::max)());
+ BOOST_CHECK_EQUAL(lltrunc((std::numeric_limits<long long>::min)() - T(1.0), pol), (std::numeric_limits<long long>::min)());
+ }
+#endif
+ // Again with bigger value:
+ T big = 1e20f;
+ BOOST_CHECK_EQUAL(iround(big, pol), (std::numeric_limits<int>::max)());
+ BOOST_CHECK_EQUAL(lround(big, pol), (std::numeric_limits<long>::max)());
+ BOOST_CHECK_EQUAL(iround(-big, pol), (std::numeric_limits<int>::min)());
+ BOOST_CHECK_EQUAL(lround(-big, pol), (std::numeric_limits<long>::min)());
+ BOOST_CHECK_EQUAL(itrunc(big, pol), (std::numeric_limits<int>::max)());
+ BOOST_CHECK_EQUAL(ltrunc(big, pol), (std::numeric_limits<long>::max)());
+ BOOST_CHECK_EQUAL(itrunc(-big, pol), (std::numeric_limits<int>::min)());
+ BOOST_CHECK_EQUAL(ltrunc(-big, pol), (std::numeric_limits<long>::min)());
+#ifndef BOOST_NO_LONG_LONG
+ BOOST_CHECK_EQUAL(llround(big, pol), (std::numeric_limits<long long>::max)());
+ BOOST_CHECK_EQUAL(llround(-big, pol), (std::numeric_limits<long long>::min)());
+ BOOST_CHECK_EQUAL(lltrunc(big, pol), (std::numeric_limits<long long>::max)());
+ BOOST_CHECK_EQUAL(lltrunc(-big, pol), (std::numeric_limits<long long>::min)());
#endif
}
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
test_round(0.1F, "float");
test_round(0.1, "double");
@@ -310,7 +358,7 @@
"not available at all, or because they are too inaccurate for these tests "
"to pass.</note>" << std::cout;
#endif
- return 0;
+
}
Modified: branches/release/libs/math/test/test_sign.cpp
==============================================================================
--- branches/release/libs/math/test/test_sign.cpp (original)
+++ branches/release/libs/math/test/test_sign.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -1,4 +1,4 @@
-// Copyright John Maddock 2008
+#define BOOST_TEST_MAIN// Copyright John Maddock 2008
// (C) Copyright Paul A. Bristow 2011 (added tests for changesign)
// Use, modification and distribution are subject to the
// Boost Software License, Version 1.0.
@@ -8,7 +8,8 @@
#include <boost/math/concepts/real_concept.hpp> // for real_concept
#include <boost/math/special_functions/sign.hpp>
-#include <boost/test/test_exec_monitor.hpp> // Boost.Test
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp> // Boost.Test
#include <boost/test/results_collector.hpp>
#include <boost/test/unit_test.hpp>
#include <boost/test/floating_point_comparison.hpp>
@@ -138,7 +139,7 @@
}
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
// Basic sanity-check spot values.
// (Parameter value, arbitrarily zero, only communicates the floating point type).
@@ -156,6 +157,6 @@
"to pass.</note>" << std::cout;
#endif
- return 0;
-} // int test_main(int, char* [])
+
+} // BOOST_AUTO_TEST_CASE( test_main )
Modified: branches/release/libs/math/test/test_skew_normal.cpp
==============================================================================
--- branches/release/libs/math/test/test_skew_normal.cpp (original)
+++ branches/release/libs/math/test/test_skew_normal.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -17,7 +17,8 @@
//#include <pch.hpp> // include directory libs/math/src/tr1/ is needed.
#include <boost/math/concepts/real_concept.hpp> // for real_concept
-#include <boost/test/test_exec_monitor.hpp> // Boost.Test
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp> // Boost.Test
#include <boost/test/floating_point_comparison.hpp>
#include <boost/math/distributions/skew_normal.hpp>
@@ -447,7 +448,7 @@
} // template <class RealType>void test_spots(RealType)
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
@@ -496,8 +497,8 @@
"to pass.</note>" << std::cout;
#endif
/* */
- return 0;
-} // int test_main(int, char* [])
+
+} // BOOST_AUTO_TEST_CASE( test_main )
/*
Modified: branches/release/libs/math/test/test_spherical_harmonic.cpp
==============================================================================
--- branches/release/libs/math/test/test_spherical_harmonic.cpp (original)
+++ branches/release/libs/math/test/test_spherical_harmonic.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -6,7 +6,8 @@
#include <pch_light.hpp>
#include <boost/math/concepts/real_concept.hpp>
-#include <boost/test/test_exec_monitor.hpp>
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp>
#include <boost/test/floating_point_comparison.hpp>
#include <boost/math/special_functions/math_fwd.hpp>
#include <boost/math/constants/constants.hpp>
@@ -285,7 +286,7 @@
BOOST_CHECK_CLOSE_FRACTION(::boost::math::spherical_harmonic_i(53, 42, static_cast<T>(-8.75), static_cast<T>(-2.25)), static_cast<T>(0.0002099802242493057018193798824353982612756L), tolerance);
}
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
BOOST_MATH_CONTROL_FP;
test_spots(0.0F, "float");
@@ -310,7 +311,7 @@
"not available at all, or because they are too inaccurate for these tests "
"to pass.</note>" << std::cout;
#endif
- return 0;
+
}
Modified: branches/release/libs/math/test/test_students_t.cpp
==============================================================================
--- branches/release/libs/math/test/test_students_t.cpp (original)
+++ branches/release/libs/math/test/test_students_t.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -18,7 +18,8 @@
# pragma warning (disable :4127) // conditional expression is constant.
#endif
-#include <boost/test/test_exec_monitor.hpp> // Boost.Test
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp> // Boost.Test
#include <boost/test/floating_point_comparison.hpp>
#include <boost/math/concepts/real_concept.hpp> // for real_concept
@@ -690,7 +691,7 @@
} // template <class RealType>void test_spots(RealType)
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
// Check that can construct students_t distribution using the two convenience methods:
using namespace boost::math;
@@ -715,8 +716,8 @@
#endif
- return 0;
-} // int test_main(int, char* [])
+
+} // BOOST_AUTO_TEST_CASE( test_main )
/*
Modified: branches/release/libs/math/test/test_tgamma_ratio.cpp
==============================================================================
--- branches/release/libs/math/test/test_tgamma_ratio.cpp (original)
+++ branches/release/libs/math/test/test_tgamma_ratio.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -117,7 +117,7 @@
<< BOOST_STDLIB << ", " << BOOST_PLATFORM << std::endl;
}
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
BOOST_MATH_CONTROL_FP;
expected_results();
@@ -139,7 +139,24 @@
"not available at all, or because they are too inaccurate for these tests "
"to pass.</note>" << std::cout;
#endif
- return 0;
+
+#ifndef BOOST_MATH_BUGGY_LARGE_FLOAT_CONSTANTS
+ test_spots(0.1F, "float");
+#endif
+ test_spots(0.1, "double");
+#ifndef BOOST_MATH_NO_LONG_DOUBLE_MATH_FUNCTIONS
+ test_spots(0.1L, "long double");
+#ifndef BOOST_MATH_NO_REAL_CONCEPT_TESTS
+#if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x582))
+ test_spots(boost::math::concepts::real_concept(0.1), "real_concept");
+#endif
+#endif
+#else
+ std::cout << "<note>The long double tests have been disabled on this platform "
+ "either because the long double overloads of the usual math functions are "
+ "not available at all, or because they are too inaccurate for these tests "
+ "to pass.</note>" << std::cout;
+#endif
}
Modified: branches/release/libs/math/test/test_tgamma_ratio.hpp
==============================================================================
--- branches/release/libs/math/test/test_tgamma_ratio.hpp (original)
+++ branches/release/libs/math/test/test_tgamma_ratio.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -7,7 +7,8 @@
#define BOOST_MATH_OVERFLOW_ERROR_POLICY ignore_error
#include <boost/math/concepts/real_concept.hpp>
-#include <boost/test/test_exec_monitor.hpp>
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp>
#include <boost/test/floating_point_comparison.hpp>
#include <boost/math/special_functions/gamma.hpp>
#include <boost/math/tools/stats.hpp>
@@ -54,13 +55,13 @@
// test tgamma_delta_ratio against data:
//
result = boost::math::tools::test_hetero<Real>(
- data,
- bind_func<Real>(funcp, 0, 1),
+ data,
+ bind_func<Real>(funcp, 0, 1),
extract_result<Real>(2));
handle_test_result(result, data[result.worst()], result.worst(), type_name, "boost::math::tgamma_delta_ratio(a, delta)", test_name);
result = boost::math::tools::test_hetero<Real>(
- data,
- negative_tgamma_ratio<Real>(),
+ data,
+ negative_tgamma_ratio<Real>(),
extract_result<Real>(3));
handle_test_result(result, data[result.worst()], result.worst(), type_name, "boost::math::tgamma_delta_ratio(a -delta)", test_name);
}
@@ -87,8 +88,8 @@
// test tgamma_ratio against data:
//
result = boost::math::tools::test_hetero<Real>(
- data,
- bind_func<Real>(funcp, 0, 1),
+ data,
+ bind_func<Real>(funcp, 0, 1),
extract_result<Real>(2));
handle_test_result(result, data[result.worst()], result.worst(), type_name, "boost::math::tgamma_ratio(a, b)", test_name);
}
@@ -117,3 +118,42 @@
}
+template <class T>
+void test_spots(T, const char*)
+{
+#ifdef _MSC_VER
+# pragma warning(push)
+# pragma warning(disable:4127 4756)
+#endif
+ //
+ // A few special spot tests:
+ //
+ BOOST_MATH_STD_USING
+ T tol = boost::math::tools::epsilon<T>() * 20;
+ if(std::numeric_limits<T>::max_exponent > 200)
+ {
+ BOOST_CHECK_CLOSE_FRACTION(boost::math::tgamma_ratio(ldexp(T(1), -500), T(180.25)), T(8.0113754557649679470816892372669519037339812035512e-178L), 3 * tol);
+ BOOST_CHECK_CLOSE_FRACTION(boost::math::tgamma_ratio(ldexp(T(1), -525), T(192.25)), T(1.5966560279353205461166489184101261541784867035063e-197L), 3 * tol);
+ BOOST_CHECK_CLOSE_FRACTION(boost::math::tgamma_ratio(T(182.25), ldexp(T(1), -500)), T(4.077990437521002194346763299159975185747917450788e+181L), 3 * tol);
+ BOOST_CHECK_CLOSE_FRACTION(boost::math::tgamma_ratio(T(193.25), ldexp(T(1), -525)), T(1.2040790040958522422697601672703926839178050326148e+199L), 3 * tol);
+ BOOST_CHECK_CLOSE_FRACTION(boost::math::tgamma_ratio(T(193.25), T(194.75)), T(0.00037151765099653237632823607820104961270831942138159L), 3 * tol);
+ }
+ BOOST_CHECK_THROW(boost::math::tgamma_ratio(0, 2), std::domain_error);
+ BOOST_CHECK_THROW(boost::math::tgamma_ratio(2, 0), std::domain_error);
+ BOOST_CHECK_THROW(boost::math::tgamma_ratio(-1, 2), std::domain_error);
+ BOOST_CHECK_THROW(boost::math::tgamma_ratio(2, -1), std::domain_error);
+ if(std::numeric_limits<T>::has_denorm && (std::numeric_limits<T>::max_exponent == std::numeric_limits<long double>::max_exponent))
+ {
+ BOOST_CHECK_THROW(boost::math::tgamma_ratio(std::numeric_limits<T>::denorm_min(), 2), std::domain_error);
+ BOOST_CHECK_THROW(boost::math::tgamma_ratio(2, std::numeric_limits<T>::denorm_min()), std::domain_error);
+ }
+ if(std::numeric_limits<T>::has_infinity)
+ {
+ BOOST_CHECK_THROW(boost::math::tgamma_ratio(std::numeric_limits<T>::infinity(), 2), std::domain_error);
+ BOOST_CHECK_THROW(boost::math::tgamma_ratio(2, std::numeric_limits<T>::infinity()), std::domain_error);
+ }
+#ifdef _MSC_VER
+# pragma warning(pop)
+#endif
+}
+
Modified: branches/release/libs/math/test/test_toms748_solve.cpp
==============================================================================
--- branches/release/libs/math/test/test_toms748_solve.cpp (original)
+++ branches/release/libs/math/test/test_toms748_solve.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -5,7 +5,8 @@
#include <pch.hpp>
-#include <boost/test/test_exec_monitor.hpp>
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp>
#include <boost/test/floating_point_comparison.hpp>
#include <boost/math/tools/toms748_solve.hpp>
@@ -161,7 +162,7 @@
toms748tester<double>::reset();
}
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
std::cout << std::setprecision(18);
run_test(3.14/2, 3.14, 1);
@@ -266,7 +267,5 @@
toms748tester<double>::reset();
BOOST_CHECK(c < 20);
}
-
- return 0;
}
Modified: branches/release/libs/math/test/test_tr1.cpp
==============================================================================
--- branches/release/libs/math/test/test_tr1.cpp (original)
+++ branches/release/libs/math/test/test_tr1.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -3,7 +3,8 @@
// 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 <boost/test/test_exec_monitor.hpp>
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp>
#include <boost/test/floating_point_comparison.hpp>
#include <boost/math/tools/precision.hpp>
#include <math.h> // ldexpf
@@ -1609,7 +1610,7 @@
#endif
}
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
#ifndef TEST_LD
test_values(1.0f, "float");
@@ -1619,6 +1620,6 @@
test_values(1.0L, "long double");
#endif
#endif
- return 0;
+
}
Modified: branches/release/libs/math/test/test_triangular.cpp
==============================================================================
--- branches/release/libs/math/test/test_triangular.cpp (original)
+++ branches/release/libs/math/test/test_triangular.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -16,7 +16,8 @@
#endif
#include <boost/math/concepts/real_concept.hpp> // for real_concept
-#include <boost/test/test_exec_monitor.hpp> // Boost.Test
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp> // Boost.Test
#include <boost/test/floating_point_comparison.hpp>
#include <boost/math/distributions/triangular.hpp>
@@ -528,7 +529,7 @@
check_out_of_range<triangular_distribution<RealType> >(-1, 0, 1);
} // template <class RealType>void test_spots(RealType)
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
// double toleps = std::numeric_limits<double>::epsilon(); // 5 eps as a fraction.
double tol5eps = std::numeric_limits<double>::epsilon() * 5; // 5 eps as a fraction.
@@ -680,8 +681,8 @@
"to pass.</note>" << std::cout;
#endif
- return 0;
-} // int test_main(int, char* [])
+
+} // BOOST_AUTO_TEST_CASE( test_main )
/*
Modified: branches/release/libs/math/test/test_uniform.cpp
==============================================================================
--- branches/release/libs/math/test/test_uniform.cpp (original)
+++ branches/release/libs/math/test/test_uniform.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -16,7 +16,8 @@
#endif
#include <boost/math/concepts/real_concept.hpp> // for real_concept
-#include <boost/test/test_exec_monitor.hpp> // Boost.Test
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp> // Boost.Test
#include <boost/test/floating_point_comparison.hpp>
#include <boost/math/distributions/uniform.hpp>
@@ -371,7 +372,7 @@
check_out_of_range<uniform_distribution<RealType> >(1, 5);
} // template <class RealType>void test_spots(RealType)
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
// Check that can construct uniform distribution using the two convenience methods:
using namespace boost::math;
@@ -429,8 +430,8 @@
"to pass.</note>" << std::cout;
#endif
- return 0;
-} // int test_main(int, char* [])
+
+} // BOOST_AUTO_TEST_CASE( test_main )
/*
Modified: branches/release/libs/math/test/test_weibull.cpp
==============================================================================
--- branches/release/libs/math/test/test_weibull.cpp (original)
+++ branches/release/libs/math/test/test_weibull.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -14,7 +14,8 @@
#include <boost/math/concepts/real_concept.hpp> // for real_concept
-#include <boost/test/test_exec_monitor.hpp> // Boost.Test
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp> // Boost.Test
#include <boost/test/floating_point_comparison.hpp>
#include <boost/math/distributions/weibull.hpp>
@@ -346,7 +347,7 @@
check_out_of_range<weibull_distribution<RealType> >(1, 1);
} // template <class RealType>void test_spots(RealType)
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
// Check that can construct weibull distribution using the two convenience methods:
@@ -370,8 +371,8 @@
"to pass.</note>" << std::cout;
#endif
- return 0;
-} // int test_main(int, char* [])
+
+} // BOOST_AUTO_TEST_CASE( test_main )
/*
Modified: branches/release/libs/math/test/test_zeta.cpp
==============================================================================
--- branches/release/libs/math/test/test_zeta.cpp (original)
+++ branches/release/libs/math/test/test_zeta.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -81,7 +81,7 @@
<< BOOST_STDLIB << ", " << BOOST_PLATFORM << std::endl;
}
-int test_main(int, char* [])
+BOOST_AUTO_TEST_CASE( test_main )
{
expected_results();
BOOST_MATH_CONTROL_FP;
@@ -109,7 +109,7 @@
"not available at all, or because they are too inaccurate for these tests "
"to pass.</note>" << std::cout;
#endif
- return 0;
+
}
Modified: branches/release/libs/math/test/test_zeta.hpp
==============================================================================
--- branches/release/libs/math/test/test_zeta.hpp (original)
+++ branches/release/libs/math/test/test_zeta.hpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -6,7 +6,8 @@
#include <boost/math/concepts/real_concept.hpp>
#include <boost/math/special_functions/math_fwd.hpp>
-#include <boost/test/test_exec_monitor.hpp>
+#define BOOST_TEST_MAIN
+#include <boost/test/unit_test.hpp>
#include <boost/test/floating_point_comparison.hpp>
#include <boost/math/tools/stats.hpp>
#include <boost/math/tools/test.hpp>
@@ -91,6 +92,7 @@
// Basic sanity checks, tolerance is either 5 or 10 epsilon
// expressed as a percentage:
//
+ BOOST_MATH_STD_USING
T tolerance = boost::math::tools::epsilon<T>() * 100 *
(boost::is_floating_point<T>::value ? 5 : 10);
BOOST_CHECK_CLOSE(::boost::math::zeta(static_cast<T>(0.125)), static_cast<T>(-0.63277562349869525529352526763564627152686379131122L), tolerance);
@@ -117,5 +119,37 @@
BOOST_CHECK_CLOSE(::boost::math::zeta(static_cast<T>(-20)), static_cast<T>(0), tolerance * 100);
BOOST_CHECK_CLOSE(::boost::math::zeta(static_cast<T>(-21)), static_cast<T>(-281.46014492753623188405797101449275362318840579710L), tolerance * 100);
BOOST_CHECK_CLOSE(::boost::math::zeta(static_cast<T>(-30.125)), static_cast<T>(2.2762941726834511267740045451463455513839970804578e7L), tolerance * 100);
+ // Very small values:
+ BOOST_CHECK_CLOSE(::boost::math::zeta(ldexp(static_cast<T>(1), -20)), static_cast<T>(-0.500000876368989859479646132126454890645615288202492097957612L), tolerance);
+ BOOST_CHECK_CLOSE(::boost::math::zeta(ldexp(static_cast<T>(1), -21)), static_cast<T>(-0.500000438184266833093492063649184012943132422189989164545507L), tolerance);
+ BOOST_CHECK_CLOSE(::boost::math::zeta(ldexp(static_cast<T>(1), -22)), static_cast<T>(-0.500000219092076392425852854644256723571669269957526445270374L), tolerance);
+ BOOST_CHECK_CLOSE(::boost::math::zeta(ldexp(static_cast<T>(1), -23)), static_cast<T>(-0.500000109546023940187789325464529558825433290921168958481804L), tolerance);
+ BOOST_CHECK_CLOSE(::boost::math::zeta(ldexp(static_cast<T>(1), -24)), static_cast<T>(-0.500000054773008406088246161057525197302821575823476487961574L), tolerance);
+ BOOST_CHECK_CLOSE(::boost::math::zeta(ldexp(static_cast<T>(1), -25)), static_cast<T>(-0.500000027386503312042790426817221131071450407798601059264341L), tolerance);
+ BOOST_CHECK_CLOSE(::boost::math::zeta(ldexp(static_cast<T>(1), -26)), static_cast<T>(-0.500000013693251433271071983943082871935521396740331377486886L), tolerance);
+ BOOST_CHECK_CLOSE(::boost::math::zeta(ldexp(static_cast<T>(1), -27)), static_cast<T>(-0.500000006846625660947956426350389518286874288247134329498289L), tolerance);
+ BOOST_CHECK_CLOSE(::boost::math::zeta(ldexp(static_cast<T>(1), -28)), static_cast<T>(-0.500000003423312816552083476988056486473169377162409806781384L), tolerance);
+ BOOST_CHECK_CLOSE(::boost::math::zeta(ldexp(static_cast<T>(1), -29)), static_cast<T>(-0.500000001711656404795568073849512135664960180586820144333542L), tolerance);
+ BOOST_CHECK_CLOSE(::boost::math::zeta(ldexp(static_cast<T>(1), -30)), static_cast<T>(-0.500000000855828201527665623188910582717329375986726355164261L), tolerance);
+ BOOST_CHECK_CLOSE(::boost::math::zeta(ldexp(static_cast<T>(1), -31)), static_cast<T>(-0.500000000427914100546303208463654361814800355929815322493143L), tolerance);
+ BOOST_CHECK_CLOSE(::boost::math::zeta(ldexp(static_cast<T>(1), -32)), static_cast<T>(-0.500000000213957050218769203487022003676593508474107873788445L), tolerance);
+ BOOST_CHECK_CLOSE(::boost::math::zeta(ldexp(static_cast<T>(1), -33)), static_cast<T>(-0.500000000106978525095789001562046589421133388262409441738089L), tolerance);
+ BOOST_CHECK_CLOSE(::boost::math::zeta(ldexp(static_cast<T>(1), -34)), static_cast<T>(-0.500000000053489262544495600736249301842352101231724731340202L), tolerance);
+
+ BOOST_CHECK_CLOSE(::boost::math::zeta(-ldexp(static_cast<T>(1), -20)), static_cast<T>(-0.499999123632834911086872289657767335473025908373776645822722L), tolerance);
+ BOOST_CHECK_CLOSE(::boost::math::zeta(-ldexp(static_cast<T>(1), -21)), static_cast<T>(-0.499999561816189359548137231641582253243376087534976981434190L), tolerance);
+ BOOST_CHECK_CLOSE(::boost::math::zeta(-ldexp(static_cast<T>(1), -22)), static_cast<T>(-0.499999780908037655734554449793729262345041281451929584703788L), tolerance);
+ BOOST_CHECK_CLOSE(::boost::math::zeta(-ldexp(static_cast<T>(1), -23)), static_cast<T>(-0.499999890454004571852312499433422838864632848598847415933664L), tolerance);
+ BOOST_CHECK_CLOSE(::boost::math::zeta(-ldexp(static_cast<T>(1), -24)), static_cast<T>(-0.499999945226998721921779295091241395945379526155584220813497L), tolerance);
+ BOOST_CHECK_CLOSE(::boost::math::zeta(-ldexp(static_cast<T>(1), -25)), static_cast<T>(-0.499999972613498469959715937215237923104705216198368099221577L), tolerance);
+ BOOST_CHECK_CLOSE(::boost::math::zeta(-ldexp(static_cast<T>(1), -26)), static_cast<T>(-0.499999986306749012229554607064736104475024094525587925697276L), tolerance);
+ BOOST_CHECK_CLOSE(::boost::math::zeta(-ldexp(static_cast<T>(1), -27)), static_cast<T>(-0.499999993153374450427200221401546739119918746163907954406855L), tolerance);
+ BOOST_CHECK_CLOSE(::boost::math::zeta(-ldexp(static_cast<T>(1), -28)), static_cast<T>(-0.499999996576687211291705684949926422460038672790251466963619L), tolerance);
+ BOOST_CHECK_CLOSE(::boost::math::zeta(-ldexp(static_cast<T>(1), -29)), static_cast<T>(-0.499999998288343602165379216634983519354686193860717726606017L), tolerance);
+ BOOST_CHECK_CLOSE(::boost::math::zeta(-ldexp(static_cast<T>(1), -30)), static_cast<T>(-0.499999999144171800212571199432213326524228740247618955829902L), tolerance);
+ BOOST_CHECK_CLOSE(::boost::math::zeta(-ldexp(static_cast<T>(1), -31)), static_cast<T>(-0.499999999572085899888755997191626615213504580792674808876724L), tolerance);
+ BOOST_CHECK_CLOSE(::boost::math::zeta(-ldexp(static_cast<T>(1), -32)), static_cast<T>(-0.499999999786042949889995597926798240562852438685508646794693L), tolerance);
+ BOOST_CHECK_CLOSE(::boost::math::zeta(-ldexp(static_cast<T>(1), -33)), static_cast<T>(-0.499999999893021474931402198791408471637626205588681812641711L), tolerance);
+ BOOST_CHECK_CLOSE(::boost::math::zeta(-ldexp(static_cast<T>(1), -34)), static_cast<T>(-0.499999999946510737462302199352114463422268928922372277519378L), tolerance);
}
Modified: branches/release/libs/math/test/zztest_max_digits10.cpp
==============================================================================
--- branches/release/libs/math/test/zztest_max_digits10.cpp (original)
+++ branches/release/libs/math/test/zztest_max_digits10.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -46,13 +46,18 @@
int digits10 = std::numeric_limits<double>::digits10;
std::cout << "std::numeric_limits<double>::digits10 = " << digits10 << std::endl;
-//#ifndef BOOST_NO_NUMERIC_LIMITS_LOWEST
-
#ifndef BOOST_NO_CXX11_NUMERIC_LIMITS
+ // OK to use C++11 max_digits10;
int max_digits10 = std::numeric_limits<double>::max_digits10;
std::cout << "std::numeric_limits<double>::max_digits10 = " << max_digits10 << std::endl;
+#else
+ // No support for max_digits10; so use Kahan formula instead.
+ int max_digits10 = 2 + std::numeric_limits<double>::digits * 3010/10000;
+ std::cout << "2 + std::numeric_limits<double>::digits * 3010/10000; = " <<
+ 2 + std::numeric_limits<double>::digits * 3010/10000;
#endif
+
} // int main()
/*
Modified: branches/release/libs/math/tools/carlson_ellint_data.cpp
==============================================================================
--- branches/release/libs/math/tools/carlson_ellint_data.cpp (original)
+++ branches/release/libs/math/tools/carlson_ellint_data.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -7,7 +7,7 @@
#include <boost/math/bindings/rr.hpp>
//#include <boost/math/tools/dual_precision.hpp>
#include <boost/math/tools/test_data.hpp>
-#include <boost/test/included/test_exec_monitor.hpp>
+#include <boost/test/included/prg_exec_monitor.hpp>
#include <boost/math/special_functions/ellint_3.hpp>
#include <fstream>
#include <boost/math/tools/test_data.hpp>
@@ -100,7 +100,7 @@
return boost::math::make_tuple(xr, yr, zr, result);
}
-int test_main(int argc, char*argv [])
+int cpp_main(int argc, char*argv [])
{
using namespace boost::math::tools;
Modified: branches/release/libs/math/tools/digamma_data.cpp
==============================================================================
--- branches/release/libs/math/tools/digamma_data.cpp (original)
+++ branches/release/libs/math/tools/digamma_data.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -5,7 +5,7 @@
#include <boost/math/bindings/rr.hpp>
#include <boost/math/special_functions/digamma.hpp>
-#include <boost/test/included/test_exec_monitor.hpp>
+#include <boost/test/included/prg_exec_monitor.hpp>
#include <fstream>
#include <boost/math/tools/test_data.hpp>
@@ -26,7 +26,7 @@
return force_truncate(&f);
}
-int test_main(int argc, char*argv [])
+int cpp_main(int argc, char*argv [])
{
boost::math::ntl::RR::SetPrecision(1000);
boost::math::ntl::RR::SetOutputPrecision(40);
Modified: branches/release/libs/math/tools/ellint_e_data.cpp
==============================================================================
--- branches/release/libs/math/tools/ellint_e_data.cpp (original)
+++ branches/release/libs/math/tools/ellint_e_data.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -5,7 +5,7 @@
#include <boost/math/bindings/rr.hpp>
#include <boost/math/tools/test_data.hpp>
-#include <boost/test/included/test_exec_monitor.hpp>
+#include <boost/test/included/prg_exec_monitor.hpp>
#include <boost/math/special_functions/ellint_2.hpp>
#include <fstream>
#include <boost/math/tools/test_data.hpp>
@@ -21,7 +21,7 @@
return ellint_2(k);
}
-int test_main(int argc, char*argv [])
+int cpp_main(int argc, char*argv [])
{
using namespace boost::math::tools;
Modified: branches/release/libs/math/tools/ellint_f_data.cpp
==============================================================================
--- branches/release/libs/math/tools/ellint_f_data.cpp (original)
+++ branches/release/libs/math/tools/ellint_f_data.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -5,7 +5,7 @@
#include <boost/math/bindings/rr.hpp>
#include <boost/math/tools/test_data.hpp>
-#include <boost/test/included/test_exec_monitor.hpp>
+#include <boost/test/included/prg_exec_monitor.hpp>
#include <boost/math/special_functions/ellint_1.hpp>
#include <fstream>
#include <boost/math/tools/test_data.hpp>
@@ -31,7 +31,7 @@
return ellint_1(k, phi);
}
-int test_main(int argc, char*argv [])
+int cpp_main(int argc, char*argv [])
{
using namespace boost::math::tools;
Modified: branches/release/libs/math/tools/ellint_k_data.cpp
==============================================================================
--- branches/release/libs/math/tools/ellint_k_data.cpp (original)
+++ branches/release/libs/math/tools/ellint_k_data.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -5,7 +5,7 @@
#include <boost/math/bindings/rr.hpp>
#include <boost/math/tools/test_data.hpp>
-#include <boost/test/included/test_exec_monitor.hpp>
+#include <boost/test/included/prg_exec_monitor.hpp>
#include <boost/math/special_functions/ellint_1.hpp>
#include <fstream>
#include <boost/math/tools/test_data.hpp>
@@ -21,7 +21,7 @@
return ellint_1(k);
}
-int test_main(int argc, char*argv [])
+int cpp_main(int argc, char*argv [])
{
using namespace boost::math::tools;
Modified: branches/release/libs/math/tools/ellint_pi2_data.cpp
==============================================================================
--- branches/release/libs/math/tools/ellint_pi2_data.cpp (original)
+++ branches/release/libs/math/tools/ellint_pi2_data.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -6,7 +6,7 @@
#include <boost/math/bindings/rr.hpp>
//#include <boost/math/tools/dual_precision.hpp>
#include <boost/math/tools/test_data.hpp>
-#include <boost/test/included/test_exec_monitor.hpp>
+#include <boost/test/included/prg_exec_monitor.hpp>
#include <boost/math/special_functions/ellint_2.hpp>
#include <boost/math/special_functions/ellint_3.hpp>
#include <fstream>
@@ -17,7 +17,7 @@
using namespace boost::math;
using namespace std;
-int test_main(int argc, char*argv [])
+int cpp_main(int argc, char*argv [])
{
using namespace boost::math::tools;
Modified: branches/release/libs/math/tools/ellint_pi3_data.cpp
==============================================================================
--- branches/release/libs/math/tools/ellint_pi3_data.cpp (original)
+++ branches/release/libs/math/tools/ellint_pi3_data.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -9,7 +9,7 @@
#include <boost/math/bindings/rr.hpp>
//#include <boost/math/tools/dual_precision.hpp>
#include <boost/math/tools/test_data.hpp>
-#include <boost/test/included/test_exec_monitor.hpp>
+#include <boost/test/included/prg_exec_monitor.hpp>
#include <boost/math/special_functions/ellint_3.hpp>
#include <fstream>
#include <boost/math/tools/test_data.hpp>
@@ -33,7 +33,7 @@
return boost::math::make_tuple(kr, result);
}
-int test_main(int argc, char*argv [])
+int cpp_main(int argc, char*argv [])
{
using namespace boost::math::tools;
Modified: branches/release/libs/math/tools/erf_data.cpp
==============================================================================
--- branches/release/libs/math/tools/erf_data.cpp (original)
+++ branches/release/libs/math/tools/erf_data.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -4,7 +4,7 @@
// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
#include <boost/math/bindings/rr.hpp>
-#include <boost/test/included/test_exec_monitor.hpp>
+#include <boost/test/included/prg_exec_monitor.hpp>
#include <boost/math/special_functions/gamma.hpp>
#include <boost/math/special_functions/erf.hpp> // for inverses
#include <boost/math/constants/constants.hpp>
@@ -128,7 +128,7 @@
}
-int test_main(int argc, char*argv [])
+int cpp_main(int argc, char*argv [])
{
boost::math::ntl::RR::SetPrecision(1000);
boost::math::ntl::RR::SetOutputPrecision(40);
Modified: branches/release/libs/math/tools/gamma_P_inva_data.cpp
==============================================================================
--- branches/release/libs/math/tools/gamma_P_inva_data.cpp (original)
+++ branches/release/libs/math/tools/gamma_P_inva_data.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -4,7 +4,7 @@
// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
#include <boost/math/bindings/rr.hpp>
-#include <boost/test/included/test_exec_monitor.hpp>
+#include <boost/test/included/prg_exec_monitor.hpp>
#include <boost/math/special_functions/gamma.hpp>
#include <boost/math/constants/constants.hpp>
#include <boost/math/tools/test.hpp>
@@ -46,7 +46,7 @@
};
-int test_main(int argc, char*argv [])
+int cpp_main(int argc, char*argv [])
{
boost::math::ntl::RR::SetPrecision(1000);
boost::math::ntl::RR::SetOutputPrecision(100);
Modified: branches/release/libs/math/tools/hermite_data.cpp
==============================================================================
--- branches/release/libs/math/tools/hermite_data.cpp (original)
+++ branches/release/libs/math/tools/hermite_data.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -5,7 +5,7 @@
#include <boost/math/bindings/rr.hpp>
#include <boost/math/tools/test_data.hpp>
-#include <boost/test/included/test_exec_monitor.hpp>
+#include <boost/test/included/prg_exec_monitor.hpp>
#include <boost/math/special_functions/hermite.hpp>
#include <fstream>
#include <boost/math/tools/test_data.hpp>
@@ -24,7 +24,7 @@
return boost::math::make_tuple(n, x, r1);
}
-int test_main(int argc, char*argv [])
+int cpp_main(int argc, char*argv [])
{
using namespace boost::math::tools;
Modified: branches/release/libs/math/tools/hypergeometric_dist_data.cpp
==============================================================================
--- branches/release/libs/math/tools/hypergeometric_dist_data.cpp (original)
+++ branches/release/libs/math/tools/hypergeometric_dist_data.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -6,7 +6,7 @@
//#define BOOST_MATH_INSTRUMENT
#include <boost/math/bindings/rr.hpp>
-#include <boost/test/included/test_exec_monitor.hpp>
+#include <boost/test/included/prg_exec_monitor.hpp>
#include <boost/math/distributions/hypergeometric.hpp>
#include <boost/math/special_functions/trunc.hpp>
#include <boost/math/constants/constants.hpp>
@@ -69,7 +69,7 @@
}
};
-int test_main(int argc, char*argv [])
+int cpp_main(int argc, char*argv [])
{
boost::math::ntl::RR::SetPrecision(1000);
boost::math::ntl::RR::SetOutputPrecision(100);
Modified: branches/release/libs/math/tools/ibeta_data.cpp
==============================================================================
--- branches/release/libs/math/tools/ibeta_data.cpp (original)
+++ branches/release/libs/math/tools/ibeta_data.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -4,7 +4,7 @@
// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
#include <boost/math/bindings/rr.hpp>
-#include <boost/test/included/test_exec_monitor.hpp>
+#include <boost/test/included/prg_exec_monitor.hpp>
#include <boost/math/special_functions/gamma.hpp>
#include <boost/math/special_functions/beta.hpp>
#include <boost/math/constants/constants.hpp>
@@ -239,7 +239,7 @@
}
};
-int test_main(int, char* [])
+int cpp_main(int, char* [])
{
boost::math::ntl::RR::SetPrecision(1000);
boost::math::ntl::RR::SetOutputPrecision(40);
Modified: branches/release/libs/math/tools/ibeta_inv_data.cpp
==============================================================================
--- branches/release/libs/math/tools/ibeta_inv_data.cpp (original)
+++ branches/release/libs/math/tools/ibeta_inv_data.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -5,7 +5,7 @@
#if 1
#include <boost/math/bindings/rr.hpp>
-#include <boost/test/included/test_exec_monitor.hpp>
+#include <boost/test/included/prg_exec_monitor.hpp>
#include <boost/math/special_functions/beta.hpp>
#include <boost/math/constants/constants.hpp>
#include <boost/math/tools/test.hpp>
@@ -57,7 +57,7 @@
}
};
-int test_main(int argc, char*argv [])
+int cpp_main(int argc, char*argv [])
{
boost::math::ntl::RR::SetPrecision(1000);
boost::math::ntl::RR::SetOutputPrecision(100);
Modified: branches/release/libs/math/tools/ibeta_invab_data.cpp
==============================================================================
--- branches/release/libs/math/tools/ibeta_invab_data.cpp (original)
+++ branches/release/libs/math/tools/ibeta_invab_data.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -4,7 +4,7 @@
// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
#include <boost/math/bindings/rr.hpp>
-#include <boost/test/included/test_exec_monitor.hpp>
+#include <boost/test/included/prg_exec_monitor.hpp>
#include <boost/math/special_functions/beta.hpp>
#include <boost/math/constants/constants.hpp>
#include <boost/math/tools/test.hpp>
@@ -61,7 +61,7 @@
}
};
-int test_main(int argc, char*argv [])
+int cpp_main(int argc, char*argv [])
{
boost::math::ntl::RR::SetPrecision(1000);
boost::math::ntl::RR::SetOutputPrecision(100);
Modified: branches/release/libs/math/tools/igamma_data.cpp
==============================================================================
--- branches/release/libs/math/tools/igamma_data.cpp (original)
+++ branches/release/libs/math/tools/igamma_data.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -4,7 +4,7 @@
// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
#include <boost/math/bindings/rr.hpp>
-#include <boost/test/included/test_exec_monitor.hpp>
+#include <boost/test/included/prg_exec_monitor.hpp>
#include <boost/math/special_functions/gamma.hpp>
#include <boost/math/constants/constants.hpp>
#include <boost/math/tools/test.hpp>
@@ -106,7 +106,7 @@
};
-int test_main(int argc, char*argv [])
+int cpp_main(int argc, char*argv [])
{
boost::math::ntl::RR::SetPrecision(1000);
boost::math::ntl::RR::SetOutputPrecision(100);
Modified: branches/release/libs/math/tools/inv_hyp_data.cpp
==============================================================================
--- branches/release/libs/math/tools/inv_hyp_data.cpp (original)
+++ branches/release/libs/math/tools/inv_hyp_data.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -4,7 +4,7 @@
// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
#include <boost/math/bindings/rr.hpp>
-#include <boost/test/included/test_exec_monitor.hpp>
+#include <boost/test/included/prg_exec_monitor.hpp>
#include <boost/math/constants/constants.hpp>
#include <boost/math/tools/test.hpp>
#include <fstream>
@@ -47,7 +47,7 @@
}
};
-int test_main(int argc, char*argv [])
+int cpp_main(int argc, char*argv [])
{
boost::math::ntl::RR::SetPrecision(500);
boost::math::ntl::RR::SetOutputPrecision(40);
Modified: branches/release/libs/math/tools/laguerre_data.cpp
==============================================================================
--- branches/release/libs/math/tools/laguerre_data.cpp (original)
+++ branches/release/libs/math/tools/laguerre_data.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -5,7 +5,7 @@
#include <boost/math/bindings/rr.hpp>
#include <boost/math/tools/test_data.hpp>
-#include <boost/test/included/test_exec_monitor.hpp>
+#include <boost/test/included/prg_exec_monitor.hpp>
#include <boost/math/special_functions/laguerre.hpp>
#include <boost/math/special_functions/gamma.hpp>
#include <fstream>
@@ -34,7 +34,7 @@
return boost::math::make_tuple(n, m, x, r1);
}
-int test_main(int argc, char*argv [])
+int cpp_main(int argc, char*argv [])
{
using namespace boost::math::tools;
Modified: branches/release/libs/math/tools/lanczos_generator.cpp
==============================================================================
--- branches/release/libs/math/tools/lanczos_generator.cpp (original)
+++ branches/release/libs/math/tools/lanczos_generator.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -16,7 +16,7 @@
#include <boost/math/special_functions/log1p.hpp>
#include <boost/lexical_cast.hpp>
#include <boost/array.hpp>
-#include <boost/test/included/test_exec_monitor.hpp>
+#include <boost/test/included/prg_exec_monitor.hpp>
//
// this is a sort of recursive include, since this file
@@ -4278,7 +4278,7 @@
print_code(best, name);
}
-int test_main(int argc, char*argv [])
+int cpp_main(int argc, char*argv [])
{
bool test_double(false), test_long(false), test_float(false), test_quad(false), spots(false), test_data(false);
Modified: branches/release/libs/math/tools/legendre_data.cpp
==============================================================================
--- branches/release/libs/math/tools/legendre_data.cpp (original)
+++ branches/release/libs/math/tools/legendre_data.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -5,7 +5,7 @@
#include <boost/math/bindings/rr.hpp>
#include <boost/math/tools/test_data.hpp>
-#include <boost/test/included/test_exec_monitor.hpp>
+#include <boost/test/included/prg_exec_monitor.hpp>
#include <boost/math/special_functions/legendre.hpp>
#include <boost/math/special_functions/gamma.hpp>
#include <fstream>
@@ -37,7 +37,7 @@
return boost::math::make_tuple(n, m, x, r1);
}
-int test_main(int argc, char*argv [])
+int cpp_main(int argc, char*argv [])
{
using namespace boost::math::tools;
Modified: branches/release/libs/math/tools/spherical_harmonic_data.cpp
==============================================================================
--- branches/release/libs/math/tools/spherical_harmonic_data.cpp (original)
+++ branches/release/libs/math/tools/spherical_harmonic_data.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -5,7 +5,7 @@
#include <boost/math/bindings/rr.hpp>
#include <boost/math/tools/test_data.hpp>
-#include <boost/test/included/test_exec_monitor.hpp>
+#include <boost/test/included/prg_exec_monitor.hpp>
#include <boost/math/special_functions/spherical_harmonic.hpp>
#include <fstream>
#include <boost/math/tools/test_data.hpp>
@@ -45,7 +45,7 @@
return boost::math::make_tuple(n, m, theta, phi, r1, r2);
}
-int test_main(int argc, char*argv [])
+int cpp_main(int argc, char*argv [])
{
using namespace boost::math::tools;
Modified: branches/release/libs/math/tools/tgamma_ratio_data.cpp
==============================================================================
--- branches/release/libs/math/tools/tgamma_ratio_data.cpp (original)
+++ branches/release/libs/math/tools/tgamma_ratio_data.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -4,7 +4,7 @@
// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
#include <boost/math/bindings/rr.hpp>
-#include <boost/test/included/test_exec_monitor.hpp>
+#include <boost/test/included/prg_exec_monitor.hpp>
#include <boost/math/special_functions/gamma.hpp>
#include <boost/math/tools/test.hpp>
#include <fstream>
@@ -34,7 +34,7 @@
}
-int test_main(int argc, char*argv [])
+int cpp_main(int argc, char*argv [])
{
boost::math::ntl::RR::SetPrecision(1000);
boost::math::ntl::RR::SetOutputPrecision(40);
Modified: branches/release/libs/math/tools/zeta_data.cpp
==============================================================================
--- branches/release/libs/math/tools/zeta_data.cpp (original)
+++ branches/release/libs/math/tools/zeta_data.cpp 2013-04-15 04:47:08 EDT (Mon, 15 Apr 2013)
@@ -4,7 +4,7 @@
// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
#include <boost/math/bindings/rr.hpp>
-#include <boost/test/included/test_exec_monitor.hpp>
+#include <boost/test/included/prg_exec_monitor.hpp>
#include <boost/math/special_functions/zeta.hpp>
#include <boost/math/constants/constants.hpp>
#include <boost/math/tools/test.hpp>
@@ -38,7 +38,7 @@
};
-int test_main(int argc, char*argv [])
+int cpp_main(int argc, char*argv [])
{
boost::math::ntl::RR::SetPrecision(500);
boost::math::ntl::RR::SetOutputPrecision(40);
Boost-Commit list run by bdawes at acm.org, david.abrahams at rcn.com, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk