Boost-Commit :

Date view	Thread view	Subject view	Author view

Subject: [Boost-commit] svn:boost r65749 - in branches/release: boost/math boost/math/bindings boost/math/distributions boost/math/distributions/detail boost/math/special_functions boost/math/special_functions/detail boost/math/tools libs/math libs/math/build libs/math/config libs/math/doc libs/math/doc/html 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/math_toolkit libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders 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/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/inv_hyper 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/utils 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/performance libs/math/test libs/math/test/compile_test libs/math/tools
From: john_at_[hidden]
Date: 2010-10-04 11:19:08

Next message: lucanus.j.simonson_at_[hidden]: "[Boost-commit] svn:boost r65750 - trunk/boost/polygon"
Previous message: bdawes_at_[hidden]: "[Boost-commit] svn:boost r65748 - in trunk/libs/filesystem: v2/test v3/src v3/test"

Author: johnmaddock
Date: 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
New Revision: 65749
URL: http://svn.boost.org/trac/boost/changeset/65749

Log:
Lots of minor fixes: mostly configuration issues.
Change to use std::tuple when available.
Add two new distributions: inverse gamma and inverse chi squared.

Added:
   branches/release/boost/math/distributions/inverse_chi_squared.hpp
      - copied unchanged from r65747, /trunk/boost/math/distributions/inverse_chi_squared.hpp
   branches/release/boost/math/distributions/inverse_gamma.hpp
      - copied unchanged from r65747, /trunk/boost/math/distributions/inverse_gamma.hpp
   branches/release/boost/math/tools/tuple.hpp
      - copied unchanged from r65747, /trunk/boost/math/tools/tuple.hpp
   branches/release/libs/math/config/has_gcc_visibility.cpp
      - copied unchanged from r65744, /trunk/libs/math/config/has_gcc_visibility.cpp
   branches/release/libs/math/doc/sf_and_dist/FAQ.qbk
      - copied unchanged from r65744, /trunk/libs/math/doc/sf_and_dist/FAQ.qbk
   branches/release/libs/math/doc/sf_and_dist/distributions/inverse_chi_squared.qbk
      - copied unchanged from r65744, /trunk/libs/math/doc/sf_and_dist/distributions/inverse_chi_squared.qbk
   branches/release/libs/math/doc/sf_and_dist/distributions/inverse_gamma.qbk
      - copied unchanged from r65744, /trunk/libs/math/doc/sf_and_dist/distributions/inverse_gamma.qbk
   branches/release/libs/math/doc/sf_and_dist/distributions/inverse_gamma_example.qbk
      - copied unchanged from r65744, /trunk/libs/math/doc/sf_and_dist/distributions/inverse_gamma_example.qbk
   branches/release/libs/math/doc/sf_and_dist/graphs/inverse_chi_squared_cdf.png
      - copied unchanged from r65744, /trunk/libs/math/doc/sf_and_dist/graphs/inverse_chi_squared_cdf.png
   branches/release/libs/math/doc/sf_and_dist/graphs/inverse_chi_squared_cdf.svg
      - copied unchanged from r65744, /trunk/libs/math/doc/sf_and_dist/graphs/inverse_chi_squared_cdf.svg
   branches/release/libs/math/doc/sf_and_dist/graphs/inverse_chi_squared_pdf.png
      - copied unchanged from r65744, /trunk/libs/math/doc/sf_and_dist/graphs/inverse_chi_squared_pdf.png
   branches/release/libs/math/doc/sf_and_dist/graphs/inverse_chi_squared_pdf.svg
      - copied unchanged from r65744, /trunk/libs/math/doc/sf_and_dist/graphs/inverse_chi_squared_pdf.svg
   branches/release/libs/math/doc/sf_and_dist/graphs/inverse_gamma_cdf.png
      - copied unchanged from r65744, /trunk/libs/math/doc/sf_and_dist/graphs/inverse_gamma_cdf.png
   branches/release/libs/math/doc/sf_and_dist/graphs/inverse_gamma_cdf.svg
      - copied unchanged from r65744, /trunk/libs/math/doc/sf_and_dist/graphs/inverse_gamma_cdf.svg
   branches/release/libs/math/doc/sf_and_dist/graphs/inverse_gamma_pdf.png
      - copied unchanged from r65744, /trunk/libs/math/doc/sf_and_dist/graphs/inverse_gamma_pdf.png
   branches/release/libs/math/doc/sf_and_dist/graphs/inverse_gamma_pdf.svg
      - copied unchanged from r65744, /trunk/libs/math/doc/sf_and_dist/graphs/inverse_gamma_pdf.svg
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/inverse_chi_squared_dist.html
      - copied unchanged from r65744, /trunk/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_gamma_dist.html
      - copied unchanged from r65744, /trunk/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/stat_tut/weg/inverse_gamma_eg.html
      - copied unchanged from r65744, /trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/inverse_gamma_eg.html
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/FAQ.html
      - copied unchanged from r65744, /trunk/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/FAQ.html
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/tuples.html
      - copied unchanged from r65744, /trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/tuples.html
   branches/release/libs/math/doc/sf_and_dist/tuple.qbk
      - copied unchanged from r65744, /trunk/libs/math/doc/sf_and_dist/tuple.qbk
   branches/release/libs/math/test/compile_test/dist_inv_chi_sq_incl_test.cpp (contents, props changed)
   branches/release/libs/math/test/compile_test/dist_inv_gamma_incl_test.cpp (contents, props changed)
   branches/release/libs/math/test/test_inverse_chi_squared_distribution.cpp
      - copied unchanged from r65744, /trunk/libs/math/test/test_inverse_chi_squared_distribution.cpp
   branches/release/libs/math/test/test_inverse_gamma_distribution.cpp
      - copied unchanged from r65744, /trunk/libs/math/test/test_inverse_gamma_distribution.cpp
   branches/release/libs/math/tools/Jamfile.v2
      - copied unchanged from r65744, /trunk/libs/math/tools/Jamfile.v2
Removed:
   branches/release/libs/math/example/binomial_example3.cpp
Properties modified:
   branches/release/boost/math/ (props changed)
   branches/release/libs/math/ (props changed)
Text files modified:
   branches/release/boost/math/bindings/rr.hpp | 12
   branches/release/boost/math/distributions.hpp | 6
   branches/release/boost/math/distributions/bernoulli.hpp | 4
   branches/release/boost/math/distributions/beta.hpp | 4
   branches/release/boost/math/distributions/binomial.hpp | 2
   branches/release/boost/math/distributions/chi_squared.hpp | 29 ++-
   branches/release/boost/math/distributions/complement.hpp | 2
   branches/release/boost/math/distributions/detail/inv_discrete_quantile.hpp | 2
   branches/release/boost/math/distributions/fisher_f.hpp | 6
   branches/release/boost/math/distributions/fwd.hpp | 10 +
   branches/release/boost/math/distributions/gamma.hpp | 2
   branches/release/boost/math/distributions/lognormal.hpp | 4
   branches/release/boost/math/distributions/negative_binomial.hpp | 4
   branches/release/boost/math/distributions/non_central_beta.hpp | 116 ++++++------
   branches/release/boost/math/distributions/non_central_chi_squared.hpp | 148 ++++++++--------
   branches/release/boost/math/distributions/non_central_f.hpp | 58 +++---
   branches/release/boost/math/distributions/pareto.hpp | 2
   branches/release/boost/math/distributions/poisson.hpp | 16
   branches/release/boost/math/distributions/rayleigh.hpp | 4
   branches/release/boost/math/distributions/weibull.hpp | 4
   branches/release/boost/math/special_functions/cbrt.hpp | 2
   branches/release/boost/math/special_functions/detail/erf_inv.hpp | 4
   branches/release/boost/math/special_functions/detail/fp_traits.hpp | 3
   branches/release/boost/math/special_functions/detail/ibeta_inverse.hpp | 12
   branches/release/boost/math/special_functions/detail/igamma_inverse.hpp | 14
   branches/release/boost/math/special_functions/detail/igamma_large.hpp | 4
   branches/release/boost/math/special_functions/detail/t_distribution_inv.hpp | 4
   branches/release/boost/math/special_functions/fpclassify.hpp | 4
   branches/release/boost/math/special_functions/gamma.hpp | 2
   branches/release/boost/math/special_functions/lanczos.hpp | 2
   branches/release/boost/math/special_functions/pow.hpp | 26 +-
   branches/release/boost/math/tools/roots.hpp | 12
   branches/release/boost/math/tools/test_data.hpp | 8
   branches/release/libs/math/build/Jamfile.v2 | 3
   branches/release/libs/math/config/Jamfile.v2 | 3
   branches/release/libs/math/doc/html/index.html | 10
   branches/release/libs/math/doc/math.qbk | 5
   branches/release/libs/math/doc/sf_and_dist/background.qbk | 13
   branches/release/libs/math/doc/sf_and_dist/building.qbk | 15 +
   branches/release/libs/math/doc/sf_and_dist/common_overviews.qbk | 6
   branches/release/libs/math/doc/sf_and_dist/credits.qbk | 9
   branches/release/libs/math/doc/sf_and_dist/dist_reference.qbk | 4
   branches/release/libs/math/doc/sf_and_dist/dist_tutorial.qbk | 52 ++++-
   branches/release/libs/math/doc/sf_and_dist/distributions/binomial.qbk | 2
   branches/release/libs/math/doc/sf_and_dist/distributions/gamma.qbk | 5
   branches/release/libs/math/doc/sf_and_dist/distributions/non_members.qbk | 10
   branches/release/libs/math/doc/sf_and_dist/error_handling.qbk | 22 +-
   branches/release/libs/math/doc/sf_and_dist/fpclassify.qbk | 4
   branches/release/libs/math/doc/sf_and_dist/html/index.html | 27 ++-
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders.html | 6
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/implementation.html | 78 +++++---
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/lanczos.html | 20 +-
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/refs.html | 43 +++-
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/relative_error.html | 8
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/remez.html | 28 +-
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist.html | 12 +
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref.html | 10
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dist_algorithms.html | 12
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists.html | 10
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/bernoulli_dist.html | 16
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/beta_dist.html | 72 ++++----
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/binomial_dist.html | 34 +-
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/cauchy_dist.html | 26 +-
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/chi_squared_dist.html | 24 +-
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/exp_dist.html | 16
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/extreme_dist.html | 14
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/f_dist.html | 20 +-
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/gamma_dist.html | 34 +-
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/hypergeometric_dist.html | 22 +-
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/laplace_dist.html | 20 +-
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/logistic_dist.html | 14
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/lognormal_dist.html | 14
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/nc_beta_dist.html | 18 +-
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/nc_chi_squared_dist.html | 20 +-
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/nc_f_dist.html | 16
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/nc_t_dist.html | 18 +-
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/negative_binomial_dist.html | 32 +-
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/normal_dist.html | 16
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/pareto.html | 28 +-
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/poisson_dist.html | 18 +-
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/rayleigh.html | 24 +-
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/students_t_dist.html | 16
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/triangular_dist.html | 16
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/uniform_dist.html | 16
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/weibull.html | 32 +-
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/nmp.html | 86 ++++----
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/future.html | 14
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut.html | 8
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/dist_params.html | 19 +-
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview.html | 6
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/complements.html | 6
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/generic.html | 78 +++++---
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/headers.html | 28 ++
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/objects.html | 13 +
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/parameters.html | 6
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/summary.html | 6
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/variates.html | 24 +-
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg.html | 10
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg.html | 6
   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 | 6
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg/binomial_coinflip_example.html | 6
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg/binomial_quiz_example.html | 14 +
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/c_sharp.html | 6
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/cs_eg.html | 6
   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 | 6
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/cs_eg/chi_sq_test.html | 6
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/dist_construct_eg.html | 27 +-
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/error_eg.html | 23 +-
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/f_eg.html | 6
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/find_eg.html | 6
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/find_eg/find_location_eg.html | 9
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/find_eg/find_mean_and_sd_eg.html | 14
   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/nag_library.html | 6
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/nccs_eg.html | 12
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/nccs_eg/nccs_power_eg.html | 29 +-
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg.html | 6
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg/neg_binom_conf.html | 6
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg/neg_binom_size_eg.html | 6
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg/negative_binomial_example1.html | 6
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg/negative_binomial_example2.html | 6
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/normal_example.html | 6
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/normal_example/normal_misc.html | 26 +-
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg.html | 6
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg/paired_st.html | 6
   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 | 6
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg/tut_mean_test.html | 6
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg/two_sample_students_t.html | 6
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/extern_c.html | 6
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/extern_c/c99.html | 10
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/extern_c/tr1.html | 16
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/extern_c/tr1_ref.html | 12
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview.html | 10
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/building.html | 39 ++-
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/compilers_overview.html | 10
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/contact.html | 12
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/directories.html | 10
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/error_handling.html | 69 ++++---
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/history1.html | 56 ++++-
   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 | 17 +
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/navigation.html | 8
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/perf_over.html | 12
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/pol_overview.html | 10
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/result_type.html | 6
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/threads.html | 6
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/tr1.html | 22 +-
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf.html | 6
   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 | 64 +++---
   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 | 17 +
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf/perf_over.html | 10
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf/perf_test_app.html | 6
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/perf/tuning.html | 12
   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 | 10
   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 | 11
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/discrete_quant_ref.html | 60 +++---
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/error_handling_policies.html | 91 +++++----
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/internal_promotion.html | 32 +-
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/iteration_pol.html | 6
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/namespace_pol.html | 78 ++++---
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/pol_ref_ref.html | 6
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/policy_defaults.html | 38 ++--
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/precision_pol.html | 41 ++--
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial.html | 6
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/ad_hoc_dist_policies.html | 46 ++--
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/ad_hoc_sf_policies.html | 48 +++--
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/changing_policy_defaults.html | 29 +-
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/namespace_policies.html | 274 +++++++++++++++++-------------
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/policy_tut_defaults.html | 14
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/policy_usage.html | 6
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/understand_dis_quant.html | 134 ++++++++------
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/user_def_err_pol.html | 146 ++++++++-------
   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 | 6
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel.html | 6
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel/bessel.html | 56 +++---
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel/bessel_over.html | 26 +-
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel/mbessel.html | 40 ++--
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel/sph_bessel.html | 22 +-
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint.html | 6
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_1.html | 18 +-
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_2.html | 18 +-
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_3.html | 24 +-
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_carlson.html | 18 +-
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_intro.html | 18 +-
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/expint.html | 6
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/expint/expint_i.html | 22 +-
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/expint/expint_n.html | 18 +-
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials.html | 6
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_binomial.html | 12
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_double_factorial.html | 12
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_factorial.html | 16
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_falling_factorial.html | 12
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_rising_factorial.html | 12
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper.html | 6
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper/acosh.html | 12
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper/asinh.html | 12
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper/atanh.html | 16
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper/inv_hyper_over.html | 6
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers.html | 6
   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 | 20 +-
   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 | 10
   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 | 6
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta/beta_derivative.html | 14
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta/beta_function.html | 18 +-
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta/ibeta_function.html | 58 +++---
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta/ibeta_inv_function.html | 16
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_erf.html | 6
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_erf/error_function.html | 20 +-
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_erf/error_inv.html | 16
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma.html | 6
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/digamma.html | 16
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/gamma_derivatives.html | 14
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/gamma_ratios.html | 18 +-
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/igamma.html | 26 +-
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/igamma_inv.html | 16
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/lgamma.html | 20 +-
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/tgamma.html | 18 +-
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly.html | 6
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly/hermite.html | 18 +-
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly/laguerre.html | 20 +-
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly/legendre.html | 22 +-
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly/sph_harm.html | 28 +-
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sinc.html | 6
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sinc/sinc_overview.html | 6
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sinc/sinc_pi.html | 6
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/sinc/sinhc_pi.html | 6
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/zetas.html | 6
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/special/zetas/zeta.html | 18 +-
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/status.html | 6
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/status/compilers.html | 10
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/status/credits.html | 15 +
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/status/history1.html | 54 ++++-
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/status/issues.html | 54 +----
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit.html | 7
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1.html | 7
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/cf.html | 14
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/constants.html | 10
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/minima.html | 18 +-
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/rational.html | 12
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/roots.html | 32 +-
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/roots2.html | 12
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/series_evaluation.html | 12
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2.html | 12
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2/error_test.html | 12
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2/minimax.html | 10
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2/polynomials.html | 10
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2/test_data.html | 31 +-
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals_overview.html | 6
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt.html | 6
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/archetypes.html | 6
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/concepts.html | 10
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/dist_concept.html | 6
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/use_mpfr.html | 6
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/use_ntl.html | 6
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils.html | 6
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/fpclass.html | 14
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float.html | 6
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/float_advance.html | 10
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/float_distance.html | 10
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/float_next.html | 10
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/float_prior.html | 10
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/nextafter.html | 12
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/rounding.html | 6
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/rounding/modf.html | 6
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/rounding/round.html | 6
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/rounding/trunc.html | 6
   branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/utils/sign_functions.html | 10
   branches/release/libs/math/doc/sf_and_dist/html4_symbols.qbk | 26 ++
   branches/release/libs/math/doc/sf_and_dist/implementation.qbk | 35 ++-
   branches/release/libs/math/doc/sf_and_dist/issues.qbk | 1
   branches/release/libs/math/doc/sf_and_dist/latin1_symbols.qbk | 10
   branches/release/libs/math/doc/sf_and_dist/license.qbk | 2
   branches/release/libs/math/doc/sf_and_dist/math.qbk | 67 +++++--
   branches/release/libs/math/doc/sf_and_dist/minimax.qbk | 4
   branches/release/libs/math/doc/sf_and_dist/performance.qbk | 3
   branches/release/libs/math/doc/sf_and_dist/policy.qbk | 22 +-
   branches/release/libs/math/doc/sf_and_dist/policy_tutorial.qbk | 31 +-
   branches/release/libs/math/doc/sf_and_dist/references.qbk | 23 ++
   branches/release/libs/math/doc/sf_and_dist/roadmap.qbk | 12 +
   branches/release/libs/math/doc/sf_and_dist/roots.qbk | 10
   branches/release/libs/math/doc/sf_and_dist/structure.qbk | 4
   branches/release/libs/math/doc/sf_and_dist/test_data.qbk | 10
   branches/release/libs/math/example/Jamfile.v2 | 6
   branches/release/libs/math/example/binomial_coinflip_example.cpp | 2
   branches/release/libs/math/example/binomial_confidence_limits.cpp | 14 +
   branches/release/libs/math/example/binomial_example_nag.cpp | 2
   branches/release/libs/math/example/binomial_quiz_example.cpp | 8
   branches/release/libs/math/example/binomial_sample_sizes.cpp | 106 +++++++++++
   branches/release/libs/math/example/c_error_policy_example.cpp | 19 +
   branches/release/libs/math/example/chi_square_std_dev_test.cpp | 22 +-
   branches/release/libs/math/example/distribution_construction.cpp | 48 ++--
   branches/release/libs/math/example/error_handling_example.cpp | 30 +-
   branches/release/libs/math/example/error_policies_example.cpp | 28 +-
   branches/release/libs/math/example/error_policy_example.cpp | 39 ++-
   branches/release/libs/math/example/f_test.cpp | 181 +++++++++++++------
   branches/release/libs/math/example/find_location_example.cpp | 11
   branches/release/libs/math/example/find_mean_and_sd_normal.cpp | 10
   branches/release/libs/math/example/find_root_example.cpp | 9
   branches/release/libs/math/example/find_scale_example.cpp | 2
   branches/release/libs/math/example/laplace_example.cpp | 4
   branches/release/libs/math/example/nc_chi_sq_example.cpp | 24 +-
   branches/release/libs/math/example/neg_binom_confidence_limits.cpp | 2
   branches/release/libs/math/example/neg_binomial_sample_sizes.cpp | 3
   branches/release/libs/math/example/negative_binomial_example1.cpp | 2
   branches/release/libs/math/example/negative_binomial_example2.cpp | 2
   branches/release/libs/math/example/normal_misc_examples.cpp | 5
   branches/release/libs/math/example/policy_eg_1.cpp | 43 +++-
   branches/release/libs/math/example/policy_eg_10.cpp | 132 ++++++++------
   branches/release/libs/math/example/policy_eg_2.cpp | 25 ++
   branches/release/libs/math/example/policy_eg_3.cpp | 41 +++-
   branches/release/libs/math/example/policy_eg_4.cpp | 71 ++++---
   branches/release/libs/math/example/policy_eg_5.cpp | 43 +++-
   branches/release/libs/math/example/policy_eg_6.cpp | 80 ++++----
   branches/release/libs/math/example/policy_eg_7.cpp | 78 +++++---
   branches/release/libs/math/example/policy_eg_8.cpp | 78 ++++----
   branches/release/libs/math/example/policy_eg_9.cpp | 92 ++++-----
   branches/release/libs/math/example/policy_ref_snip1.cpp | 75 +++++--
   branches/release/libs/math/example/policy_ref_snip10.cpp | 24 ++
   branches/release/libs/math/example/policy_ref_snip11.cpp | 31 ++
   branches/release/libs/math/example/policy_ref_snip12.cpp | 43 +++-
   branches/release/libs/math/example/policy_ref_snip13.cpp | 51 ++++-
   branches/release/libs/math/example/policy_ref_snip2.cpp | 31 ++-
   branches/release/libs/math/example/policy_ref_snip3.cpp | 18 +
   branches/release/libs/math/example/policy_ref_snip4.cpp | 9
   branches/release/libs/math/example/policy_ref_snip5.cpp | 24 ++
   branches/release/libs/math/example/policy_ref_snip6.cpp | 23 +
   branches/release/libs/math/example/policy_ref_snip7.cpp | 25 ++
   branches/release/libs/math/example/policy_ref_snip8.cpp | 24 ++
   branches/release/libs/math/example/policy_ref_snip9.cpp | 29 ++-
   branches/release/libs/math/example/students_t_single_sample.cpp | 355 +++++++++++++++++++--------------------
   branches/release/libs/math/example/students_t_two_samples.cpp | 170 +++++++++----------
   branches/release/libs/math/performance/distributions.cpp | 6
   branches/release/libs/math/test/Jamfile.v2 | 16 +
   branches/release/libs/math/test/compile_test/instantiate.hpp | 4
   branches/release/libs/math/test/compile_test/tools_roots_inc_test.cpp | 3
   branches/release/libs/math/test/log1p_expm1_test.cpp | 8
   branches/release/libs/math/test/pow_test.cpp | 26 ++
   branches/release/libs/math/test/test_cbrt.cpp | 12 +
   branches/release/libs/math/test/test_error_handling.cpp | 69 +++++++
   branches/release/libs/math/test/test_gamma_dist.cpp | 12
   branches/release/libs/math/test/test_normal.cpp | 41 ++++
   branches/release/libs/math/test/test_roots.cpp | 8
   branches/release/libs/math/tools/bessel_data.cpp | 2
   branches/release/libs/math/tools/beta_data.cpp | 4
   branches/release/libs/math/tools/carlson_ellint_data.cpp | 16
   branches/release/libs/math/tools/digamma_data.cpp | 6
   branches/release/libs/math/tools/ellint_pi3_data.cpp | 4
   branches/release/libs/math/tools/erf_data.cpp | 12
   branches/release/libs/math/tools/expint_data.cpp | 1
   branches/release/libs/math/tools/expint_i_data.cpp | 1
   branches/release/libs/math/tools/gamma_P_inva_data.cpp | 5
   branches/release/libs/math/tools/generate_test_values.cpp | 2
   branches/release/libs/math/tools/hermite_data.cpp | 4
   branches/release/libs/math/tools/hypergeometric_dist_data.cpp | 6
   branches/release/libs/math/tools/ibeta_data.cpp | 21 +-
   branches/release/libs/math/tools/ibeta_inv_data.cpp | 5
   branches/release/libs/math/tools/ibeta_invab_data.cpp | 5
   branches/release/libs/math/tools/igamma_data.cpp | 13
   branches/release/libs/math/tools/laguerre_data.cpp | 8
   branches/release/libs/math/tools/legendre_data.cpp | 8
   branches/release/libs/math/tools/log1p_expm1_data.cpp | 4
   branches/release/libs/math/tools/process_perf_results.cpp | 3
   branches/release/libs/math/tools/spherical_harmonic_data.cpp | 6
   branches/release/libs/math/tools/tgamma_ratio_data.cpp | 6
   branches/release/libs/math/tools/zeta_data.cpp | 4
   378 files changed, 4532 insertions(+), 3446 deletions(-)

Modified: branches/release/boost/math/bindings/rr.hpp
==============================================================================
--- branches/release/boost/math/bindings/rr.hpp (original)
+++ branches/release/boost/math/bindings/rr.hpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -682,13 +682,13 @@
 {
 asin_root(RR const& target) : t(target){}

- std::tr1::tuple<RR, RR, RR> operator()(RR const& p)
+ boost::math::tuple<RR, RR, RR> operator()(RR const& p)
 {
 RR f0 = sin(p);
 RR f1 = cos(p);
 RR f2 = -f0;
 f0 -= t;
- return std::tr1::make_tuple(f0, f1, f2);
+ return boost::math::make_tuple(f0, f1, f2);
 }
 private:
 RR t;
@@ -710,13 +710,13 @@
 {
 acos_root(RR const& target) : t(target){}

- std::tr1::tuple<RR, RR, RR> operator()(RR const& p)
+ boost::math::tuple<RR, RR, RR> operator()(RR const& p)
 {
 RR f0 = cos(p);
 RR f1 = -sin(p);
 RR f2 = -f0;
 f0 -= t;
- return std::tr1::make_tuple(f0, f1, f2);
+ return boost::math::make_tuple(f0, f1, f2);
 }
 private:
 RR t;
@@ -738,14 +738,14 @@
 {
 atan_root(RR const& target) : t(target){}

- std::tr1::tuple<RR, RR, RR> operator()(RR const& p)
+ boost::math::tuple<RR, RR, RR> operator()(RR const& p)
 {
 RR c = cos(p);
 RR ta = tan(p);
 RR f0 = ta - t;
 RR f1 = 1 / (c * c);
 RR f2 = 2 * ta / (c * c);
- return std::tr1::make_tuple(f0, f1, f2);
+ return boost::math::make_tuple(f0, f1, f2);
 }
 private:
 RR t;

Modified: branches/release/boost/math/distributions.hpp
==============================================================================
--- branches/release/boost/math/distributions.hpp (original)
+++ branches/release/boost/math/distributions.hpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,12 +1,12 @@
// Copyright John Maddock 2006, 2007.
-// Copyright Paul A. Bristow 2006, 2007, 2009.
+// Copyright Paul A. Bristow 2006, 2007, 2009, 2010.

// 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)

// This file includes *all* the distributions.
-// this may be useful if many are used
+// this *may* be convenient if many are used
// - to avoid including each distribution individually.

#ifndef BOOST_MATH_DISTRIBUTIONS_HPP
@@ -23,6 +23,8 @@
#include <boost/math/distributions/fisher_f.hpp>
#include <boost/math/distributions/gamma.hpp>
#include <boost/math/distributions/hypergeometric.hpp>
+#include <boost/math/distributions/inverse_chi_squared.hpp>
+#include <boost/math/distributions/inverse_gamma.hpp>
#include <boost/math/distributions/laplace.hpp>
#include <boost/math/distributions/logistic.hpp>
#include <boost/math/distributions/lognormal.hpp>

Modified: branches/release/boost/math/distributions/bernoulli.hpp
==============================================================================
--- branches/release/boost/math/distributions/bernoulli.hpp (original)
+++ branches/release/boost/math/distributions/bernoulli.hpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -119,14 +119,14 @@
 inline const std::pair<RealType, RealType> range(const bernoulli_distribution<RealType, Policy>& /* dist */)
 { // Range of permissible values for random variable k = {0, 1}.
 using boost::math::tools::max_value;
- return std::pair<RealType, RealType>(0, 1);
+ return std::pair<RealType, RealType>(static_cast<RealType>(0), static_cast<RealType>(1));
 }

 template <class RealType, class Policy>
 inline const std::pair<RealType, RealType> support(const bernoulli_distribution<RealType, Policy>& /* dist */)
 { // Range of supported values for random variable k = {0, 1}.
 // This is range where cdf rises from 0 to 1, and outside it, the pdf is zero.
- return std::pair<RealType, RealType>(0, 1);
+ return std::pair<RealType, RealType>(static_cast<RealType>(0), static_cast<RealType>(1));
 }

 template <class RealType, class Policy>

Modified: branches/release/boost/math/distributions/beta.hpp
==============================================================================
--- branches/release/boost/math/distributions/beta.hpp (original)
+++ branches/release/boost/math/distributions/beta.hpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -279,14 +279,14 @@
 inline const std::pair<RealType, RealType> range(const beta_distribution<RealType, Policy>& /* dist */)
 { // Range of permissible values for random variable x.
 using boost::math::tools::max_value;
- return std::pair<RealType, RealType>(0, 1);
+ return std::pair<RealType, RealType>(static_cast<RealType>(0), static_cast<RealType>(1));
 }

 template <class RealType, class Policy>
 inline const std::pair<RealType, RealType> support(const beta_distribution<RealType, Policy>& /* dist */)
 { // Range of supported values for random variable x.
 // This is range where cdf rises from 0 to 1, and outside it, the pdf is zero.
- return std::pair<RealType, RealType>(0, 1);
+ return std::pair<RealType, RealType>(static_cast<RealType>(0), static_cast<RealType>(1));
 }

 template <class RealType, class Policy>

Modified: branches/release/boost/math/distributions/binomial.hpp
==============================================================================
--- branches/release/boost/math/distributions/binomial.hpp (original)
+++ branches/release/boost/math/distributions/binomial.hpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -421,7 +421,7 @@
 const std::pair<RealType, RealType> support(const binomial_distribution<RealType, Policy>& dist)
 { // Range of supported values for random variable k.
 // This is range where cdf rises from 0 to 1, and outside it, the pdf is zero.
- return std::pair<RealType, RealType>(0, dist.trials());
+ return std::pair<RealType, RealType>(static_cast<RealType>(0), dist.trials());
 }

 template <class RealType, class Policy>

Modified: branches/release/boost/math/distributions/chi_squared.hpp
==============================================================================
--- branches/release/boost/math/distributions/chi_squared.hpp (original)
+++ branches/release/boost/math/distributions/chi_squared.hpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,5 +1,5 @@
// Copyright John Maddock 2006, 2007.
-// Copyright Paul A. Bristow 2008.
+// Copyright Paul A. Bristow 2008, 2010.

// Use, modification and distribution are subject to the
// Boost Software License, Version 1.0.
@@ -59,14 +59,14 @@
inline const std::pair<RealType, RealType> range(const chi_squared_distribution<RealType, Policy>& /*dist*/)
{ // Range of permissible values for random variable x.
 using boost::math::tools::max_value;
- return std::pair<RealType, RealType>(0, max_value<RealType>()); // 0 to + infinity.
+ return std::pair<RealType, RealType>(static_cast<RealType>(0), max_value<RealType>()); // 0 to + infinity.
}

template <class RealType, class Policy>
inline const std::pair<RealType, RealType> support(const chi_squared_distribution<RealType, Policy>& /*dist*/)
{ // Range of supported values for random variable x.
 // This is range where cdf rises from 0 to 1, and outside it, the pdf is zero.
- return std::pair<RealType, RealType>(0, tools::max_value<RealType>()); // 0 to + infinity.
+ return std::pair<RealType, RealType>(static_cast<RealType>(0), tools::max_value<RealType>()); // 0 to + infinity.
}

template <class RealType, class Policy>
@@ -267,7 +267,9 @@
struct df_estimator
{
 df_estimator(RealType a, RealType b, RealType variance, RealType delta)
- : alpha(a), beta(b), ratio(delta/variance) {}
+ : alpha(a), beta(b), ratio(delta/variance)
+ { // Constructor
+ }

 RealType operator()(const RealType& df)
 {
@@ -282,14 +284,16 @@
 result = cdf(cs, quantile(complement(cs, alpha)) / r) - beta;
 }
 else
- {
+ { // ratio <= 0
 RealType r = 1 + ratio;
 result = cdf(complement(cs, quantile(cs, alpha) / r)) - beta;
 }
 return result;
 }
private:
- RealType alpha, beta, ratio;
+ RealType alpha;
+ RealType beta;
+ RealType ratio; // Difference from variance / variance, so fractional.
};

} // namespace detail
@@ -305,18 +309,23 @@
 static const char* function = "boost::math::chi_squared_distribution<%1%>::find_degrees_of_freedom(%1%,%1%,%1%,%1%,%1%)";
 // Check for domain errors:
 RealType error_result;
- if(false == detail::check_probability(
- function, alpha, &error_result, Policy())
- && detail::check_probability(function, beta, &error_result, Policy()))
+ if(false ==
+ detail::check_probability(function, alpha, &error_result, Policy())
+ && detail::check_probability(function, beta, &error_result, Policy()))
+ { // Either probability is outside 0 to 1.
 return error_result;
+ }

 if(hint <= 0)
+ { // No hint given, so guess df = 1.
 hint = 1;
+ }

 detail::df_estimator<RealType, Policy> f(alpha, beta, variance, difference_from_variance);
 tools::eps_tolerance<RealType> tol(policies::digits<RealType, Policy>());
 boost::uintmax_t max_iter = policies::get_max_root_iterations<Policy>();
- std::pair<RealType, RealType> r = tools::bracket_and_solve_root(f, hint, RealType(2), false, tol, max_iter, Policy());
+ std::pair<RealType, RealType> r =
+ tools::bracket_and_solve_root(f, hint, RealType(2), false, tol, max_iter, Policy());
 RealType result = r.first + (r.second - r.first) / 2;
 if(max_iter >= policies::get_max_root_iterations<Policy>())
 {

Modified: branches/release/boost/math/distributions/complement.hpp
==============================================================================
--- branches/release/boost/math/distributions/complement.hpp (original)
+++ branches/release/boost/math/distributions/complement.hpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -9,7 +9,7 @@

//
// This code really defines our own tuple type.
-// It would be nice to reuse std::tr1::tuple
+// It would be nice to reuse boost::math::tuple
// while retaining our own type safety, but it's
// not clear if that's possible. In any case this
// code is *very* lightweight.

Modified: branches/release/boost/math/distributions/detail/inv_discrete_quantile.hpp
==============================================================================
--- branches/release/boost/math/distributions/detail/inv_discrete_quantile.hpp (original)
+++ branches/release/boost/math/distributions/detail/inv_discrete_quantile.hpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -92,7 +92,7 @@
    // Max bounds of the distribution:
    //
    value_type min_bound, max_bound;
- std::tr1::tie(min_bound, max_bound) = support(dist);
+ boost::math::tie(min_bound, max_bound) = support(dist);

    if(guess > max_bound)
       guess = max_bound;

Modified: branches/release/boost/math/distributions/fisher_f.hpp
==============================================================================
--- branches/release/boost/math/distributions/fisher_f.hpp (original)
+++ branches/release/boost/math/distributions/fisher_f.hpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -58,7 +58,7 @@
inline const std::pair<RealType, RealType> range(const fisher_f_distribution<RealType, Policy>& /*dist*/)
{ // Range of permissible values for random variable x.
 using boost::math::tools::max_value;
- return std::pair<RealType, RealType>(0, max_value<RealType>());
+ return std::pair<RealType, RealType>(static_cast<RealType>(0), max_value<RealType>());
}

template <class RealType, class Policy>
@@ -66,7 +66,7 @@
{ // Range of supported values for random variable x.
 // This is range where cdf rises from 0 to 1, and outside it, the pdf is zero.
 using boost::math::tools::max_value;
- return std::pair<RealType, RealType>(0, max_value<RealType>());
+ return std::pair<RealType, RealType>(static_cast<RealType>(0), max_value<RealType>());
}

template <class RealType, class Policy>
@@ -177,7 +177,7 @@
 function, p, &error_result, Policy()))
 return error_result;

- // With optimizations turned on, gcc wrongly warns about y being used
+ // With optimizations turned on, gcc wrongly warns about y being used
 // uninitializated unless we initialize it to something:
 RealType x, y(0);

Modified: branches/release/boost/math/distributions/fwd.hpp
==============================================================================
--- branches/release/boost/math/distributions/fwd.hpp (original)
+++ branches/release/boost/math/distributions/fwd.hpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,4 +1,6 @@
-// Copyright Paul A. Bristow 2007.
+// fwd.hpp Forward declarations of Boost.Math distributions.
+
+// Copyright Paul A. Bristow 2007, 2010.
// Copyright John Maddock 2007.

// Use, modification and distribution are subject to the
@@ -42,6 +44,12 @@
class hypergeometric_distribution;

template <class RealType, class Policy>
+class inverse_chi_squared_distribution;
+
+template <class RealType, class Policy>
+class inverse_gamma_distribution;
+
+template <class RealType, class Policy>
class laplace_distribution;

template <class RealType, class Policy>

Modified: branches/release/boost/math/distributions/gamma.hpp
==============================================================================
--- branches/release/boost/math/distributions/gamma.hpp (original)
+++ branches/release/boost/math/distributions/gamma.hpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -103,7 +103,7 @@
inline const std::pair<RealType, RealType> range(const gamma_distribution<RealType, Policy>& /* dist */)
{ // Range of permissible values for random variable x.
using boost::math::tools::max_value;
- return std::pair<RealType, RealType>(0, max_value<RealType>());
+ return std::pair<RealType, RealType>(static_cast<RealType>(0), max_value<RealType>());
}

template <class RealType, class Policy>

Modified: branches/release/boost/math/distributions/lognormal.hpp
==============================================================================
--- branches/release/boost/math/distributions/lognormal.hpp (original)
+++ branches/release/boost/math/distributions/lognormal.hpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -78,7 +78,7 @@
inline const std::pair<RealType, RealType> range(const lognormal_distribution<RealType, Policy>& /*dist*/)
{ // Range of permissible values for random variable x is >0 to +infinity.
 using boost::math::tools::max_value;
- return std::pair<RealType, RealType>(0, max_value<RealType>());
+ return std::pair<RealType, RealType>(static_cast<RealType>(0), max_value<RealType>());
}

template <class RealType, class Policy>
@@ -86,7 +86,7 @@
{ // Range of supported values for random variable x.
 // This is range where cdf rises from 0 to 1, and outside it, the pdf is zero.
 using boost::math::tools::max_value;
- return std::pair<RealType, RealType>(0, max_value<RealType>());
+ return std::pair<RealType, RealType>(static_cast<RealType>(0), max_value<RealType>());
}

template <class RealType, class Policy>

Modified: branches/release/boost/math/distributions/negative_binomial.hpp
==============================================================================
--- branches/release/boost/math/distributions/negative_binomial.hpp (original)
+++ branches/release/boost/math/distributions/negative_binomial.hpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -260,7 +260,7 @@
 inline const std::pair<RealType, RealType> range(const negative_binomial_distribution<RealType, Policy>& /* dist */)
 { // Range of permissible values for random variable k.
 using boost::math::tools::max_value;
- return std::pair<RealType, RealType>(0, max_value<RealType>()); // max_integer?
+ return std::pair<RealType, RealType>(static_cast<RealType>(0), max_value<RealType>()); // max_integer?
 }

 template <class RealType, class Policy>
@@ -268,7 +268,7 @@
 { // Range of supported values for random variable k.
 // This is range where cdf rises from 0 to 1, and outside it, the pdf is zero.
 using boost::math::tools::max_value;
- return std::pair<RealType, RealType>(0, max_value<RealType>()); // max_integer?
+ return std::pair<RealType, RealType>(static_cast<RealType>(0), max_value<RealType>()); // max_integer?
 }

 template <class RealType, class Policy>

Modified: branches/release/boost/math/distributions/non_central_beta.hpp
==============================================================================
--- branches/release/boost/math/distributions/non_central_beta.hpp (original)
+++ branches/release/boost/math/distributions/non_central_beta.hpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -54,7 +54,7 @@
 // recurance term:
 T xterm;
 // Starting beta term:
- T beta = x < y
+ T beta = x < y
 ? detail::ibeta_imp(T(a + k), b, x, pol, false, true, &xterm)
 : detail::ibeta_imp(b, T(a + k), y, pol, true, true, &xterm);

@@ -100,7 +100,7 @@
 if(static_cast<boost::uintmax_t>(count + i - k) > max_iter)
 {
 return policies::raise_evaluation_error(
- "cdf(non_central_beta_distribution<%1%>, %1%)",
+ "cdf(non_central_beta_distribution<%1%>, %1%)",
 "Series did not converge, closest value was %1%", sum, pol);
 }
 }
@@ -164,7 +164,7 @@
 if(static_cast<boost::uintmax_t>(i - k) > max_iter)
 {
 return policies::raise_evaluation_error(
- "cdf(non_central_beta_distribution<%1%>, %1%)",
+ "cdf(non_central_beta_distribution<%1%>, %1%)",
 "Series did not converge, closest value was %1%", sum, pol);
 }
 last_term = term;
@@ -180,7 +180,7 @@
 if(static_cast<boost::uintmax_t>(count + k - i) > max_iter)
 {
 return policies::raise_evaluation_error(
- "cdf(non_central_beta_distribution<%1%>, %1%)",
+ "cdf(non_central_beta_distribution<%1%>, %1%)",
 "Series did not converge, closest value was %1%", sum, pol);
 }
 pois *= i / l2;
@@ -195,9 +195,9 @@
 {
 typedef typename policies::evaluation<RealType, Policy>::type value_type;
 typedef typename policies::normalise<
- Policy,
- policies::promote_float<false>,
- policies::promote_double<false>,
+ Policy,
+ policies::promote_float<false>,
+ policies::promote_double<false>,
 policies::discrete_quantile<>,
 policies::assert_undefined<> >::type forwarding_policy;

@@ -216,30 +216,30 @@
 {
 // Complement is the smaller of the two:
 result = detail::non_central_beta_q(
- static_cast<value_type>(a),
- static_cast<value_type>(b),
- static_cast<value_type>(l),
- static_cast<value_type>(x),
- static_cast<value_type>(y),
- forwarding_policy(),
+ static_cast<value_type>(a),
+ static_cast<value_type>(b),
+ static_cast<value_type>(l),
+ static_cast<value_type>(x),
+ static_cast<value_type>(y),
+ forwarding_policy(),
 static_cast<value_type>(invert ? 0 : -1));
 invert = !invert;
 }
 else
 {
 result = detail::non_central_beta_p(
- static_cast<value_type>(a),
- static_cast<value_type>(b),
- static_cast<value_type>(l),
- static_cast<value_type>(x),
- static_cast<value_type>(y),
+ static_cast<value_type>(a),
+ static_cast<value_type>(b),
+ static_cast<value_type>(l),
+ static_cast<value_type>(x),
+ static_cast<value_type>(y),
 forwarding_policy(),
 static_cast<value_type>(invert ? -1 : 0));
 }
 if(invert)
 result = -result;
 return policies::checked_narrowing_cast<RealType, forwarding_policy>(
- result,
+ result,
 "boost::math::non_central_beta_cdf<%1%>(%1%, %1%, %1%)");
 }

@@ -328,7 +328,7 @@
 // Escape route just in case the answer is zero!
 max_iter -= count;
 max_iter += 1;
- return a > 0 ? std::make_pair(T(0), T(a)) : std::make_pair(T(a), T(0));
+ return a > 0 ? std::make_pair(T(0), T(a)) : std::make_pair(T(a), T(0));
 }
 if(count == 0)
 {
@@ -355,13 +355,13 @@
 max_iter -= count;
 max_iter += 1;
 std::pair<T, T> r = toms748_solve(
- f,
- (a < 0 ? b : a),
- (a < 0 ? a : b),
- (a < 0 ? fb : fa),
- (a < 0 ? fa : fb),
- tol,
- count,
+ f,
+ (a < 0 ? b : a),
+ (a < 0 ? a : b),
+ (a < 0 ? fb : fa),
+ (a < 0 ? fa : fb),
+ tol,
+ count,
 pol);
 max_iter += count;
 BOOST_MATH_INSTRUMENT_CODE("max_iter = " << max_iter << " count = " << count);
@@ -374,9 +374,9 @@
 static const char* function = "quantile(non_central_beta_distribution<%1%>, %1%)";
 typedef typename policies::evaluation<RealType, Policy>::type value_type;
 typedef typename policies::normalise<
- Policy,
- policies::promote_float<false>,
- policies::promote_double<false>,
+ Policy,
+ policies::promote_float<false>,
+ policies::promote_double<false>,
 policies::discrete_quantile<>,
 policies::assert_undefined<> >::type forwarding_policy;

@@ -391,7 +391,7 @@
 !beta_detail::check_beta(
 function,
 b, &r, Policy())
- ||
+ ||
 !detail::check_non_centrality(
 function,
 l,
@@ -420,9 +420,9 @@
 value_type mean = 1 - (b / c) * (1 + l / (2 * c * c));
 /*
 //
- // Calculate a normal approximation to the quantile,
+ // Calculate a normal approximation to the quantile,
 // uses mean and variance approximations from:
- // Algorithm AS 310:
+ // Algorithm AS 310:
 // Computing the Non-Central Beta Distribution Function
 // R. Chattamvelli; R. Shanmugam
 // Applied Statistics, Vol. 46, No. 1. (1997), pp. 146-156.
@@ -442,20 +442,20 @@
 value_type alpha2 = alpha * alpha;
 value_type eta = (2 * alpha + 1) * (2 * alpha + 1) + 1;
 value_type H = 3 * alpha2 + 5 * alpha + 2;
- value_type F = alpha2 * (alpha + 1) + H * delta
+ value_type F = alpha2 * (alpha + 1) + H * delta
 + (2 * alpha + 4) * delta2 + delta3;
 value_type P = (3 * alpha + 1) * (9 * alpha + 17)
 + 2 * alpha * (3 * alpha + 2) * (3 * alpha + 4) + 15;
 value_type Q = 54 * alpha2 + 162 * alpha + 130;
 value_type R = 6 * (6 * alpha + 11);
- value_type D = delta
+ value_type D = delta
 * (H * H + 2 * P * delta + Q * delta2 + R * delta3 + 9 * delta4);
 value_type variance = (b / G)
 * (1 + delta * (l * l + 3 * l + eta) / (G * G))
 - (b * b / F) * (1 + D / (F * F));
 value_type sd = sqrt(variance);

- value_type guess = comp
+ value_type guess = comp
 ? quantile(complement(normal_distribution<RealType, Policy>(static_cast<RealType>(mean), static_cast<RealType>(sd)), p))
 : quantile(normal_distribution<RealType, Policy>(static_cast<RealType>(mean), static_cast<RealType>(sd)), p);

@@ -470,9 +470,9 @@
 tools::eps_tolerance<value_type> tol(policies::digits<RealType, Policy>());
 boost::uintmax_t max_iter = policies::get_max_root_iterations<Policy>();

- std::pair<value_type, value_type> ir
+ std::pair<value_type, value_type> ir
 = bracket_and_solve_root_01(
- f, guess, value_type(2.5), true, tol,
+ f, guess, value_type(2.5), true, tol,
 max_iter, Policy());
 value_type result = ir.first + (ir.second - ir.first) / 2;

@@ -480,13 +480,13 @@
 {
 return policies::raise_evaluation_error<RealType>(function, "Unable to locate solution in a reasonable time:"
 " either there is no answer to quantile of the non central beta distribution"
- " or the answer is infinite. Current best guess is %1%",
+ " or the answer is infinite. Current best guess is %1%",
 policies::checked_narrowing_cast<RealType, forwarding_policy>(
- result,
+ result,
 function), Policy());
 }
 return policies::checked_narrowing_cast<RealType, forwarding_policy>(
- result,
+ result,
 function);
 }

@@ -509,7 +509,7 @@
 // Starting Poisson weight:
 T pois = gamma_p_derivative(T(k+1), l2, pol);
 // Starting beta term:
- T beta = x < y ?
+ T beta = x < y ?
 ibeta_derivative(a + k, b, x, pol)
 : ibeta_derivative(b, a + k, y, pol);
 T sum = 0;
@@ -546,7 +546,7 @@
 if(static_cast<boost::uintmax_t>(count + i - k) > max_iter)
 {
 return policies::raise_evaluation_error(
- "pdf(non_central_beta_distribution<%1%>, %1%)",
+ "pdf(non_central_beta_distribution<%1%>, %1%)",
 "Series did not converge, closest value was %1%", sum, pol);
 }
 }
@@ -560,9 +560,9 @@
 static const char* function = "pdf(non_central_beta_distribution<%1%>, %1%)";
 typedef typename policies::evaluation<RealType, Policy>::type value_type;
 typedef typename policies::normalise<
- Policy,
- policies::promote_float<false>,
- policies::promote_double<false>,
+ Policy,
+ policies::promote_float<false>,
+ policies::promote_double<false>,
 policies::discrete_quantile<>,
 policies::assert_undefined<> >::type forwarding_policy;

@@ -577,7 +577,7 @@
 !beta_detail::check_beta(
 function,
 b, &r, Policy())
- ||
+ ||
 !detail::check_non_centrality(
 function,
 l,
@@ -608,7 +608,7 @@
 typedef Policy policy_type;

 non_central_beta_distribution(RealType a_, RealType b_, RealType lambda) : a(a_), b(b_), ncp(lambda)
- {
+ {
 const char* function = "boost::math::non_central_beta_distribution<%1%>::non_central_beta_distribution(%1%,%1%)";
 RealType r;
 beta_detail::check_alpha(
@@ -651,7 +651,7 @@
 inline const std::pair<RealType, RealType> range(const non_central_beta_distribution<RealType, Policy>& /* dist */)
 { // Range of permissible values for random variable k.
 using boost::math::tools::max_value;
- return std::pair<RealType, RealType>(0, 1);
+ return std::pair<RealType, RealType>(static_cast<RealType>(0), static_cast<RealType>(1));
 }

 template <class RealType, class Policy>
@@ -659,7 +659,7 @@
 { // Range of supported values for random variable k.
 // This is range where cdf rises from 0 to 1, and outside it, the pdf is zero.
 using boost::math::tools::max_value;
- return std::pair<RealType, RealType>(0, 1);
+ return std::pair<RealType, RealType>(static_cast<RealType>(0), static_cast<RealType>(1));
 }

 template <class RealType, class Policy>
@@ -678,7 +678,7 @@
 !beta_detail::check_beta(
 function,
 b, &r, Policy())
- ||
+ ||
 !detail::check_non_centrality(
 function,
 l,
@@ -688,8 +688,8 @@
 RealType c = a + b + l / 2;
 RealType mean = 1 - (b / c) * (1 + l / (2 * c * c));
 return detail::generic_find_mode_01(
- dist,
- mean,
+ dist,
+ mean,
 function);
 }

@@ -702,7 +702,7 @@
 //
 template <class RealType, class Policy>
 inline RealType mean(const non_central_beta_distribution<RealType, Policy>& dist)
- {
+ {
 // TODO
 return 0;
 } // mean
@@ -728,7 +728,7 @@

 template <class RealType, class Policy>
 inline RealType kurtosis_excess(const non_central_beta_distribution<RealType, Policy>& dist)
- {
+ {
 const char* function = "boost::math::non_central_beta_distribution<%1%>::kurtosis_excess()";
 // TODO
 return 0;
@@ -748,7 +748,7 @@

 template <class RealType, class Policy>
 RealType cdf(const non_central_beta_distribution<RealType, Policy>& dist, const RealType& x)
- {
+ {
 const char* function = "boost::math::non_central_beta_distribution<%1%>::cdf(%1%)";
 RealType a = dist.alpha();
 RealType b = dist.beta();
@@ -761,7 +761,7 @@
 !beta_detail::check_beta(
 function,
 b, &r, Policy())
- ||
+ ||
 !detail::check_non_centrality(
 function,
 l,
@@ -798,7 +798,7 @@
 !beta_detail::check_beta(
 function,
 b, &r, Policy())
- ||
+ ||
 !detail::check_non_centrality(
 function,
 l,

Modified: branches/release/boost/math/distributions/non_central_chi_squared.hpp
==============================================================================
--- branches/release/boost/math/distributions/non_central_chi_squared.hpp (original)
+++ branches/release/boost/math/distributions/non_central_chi_squared.hpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -102,13 +102,13 @@
 //Error check:
 if(static_cast<boost::uintmax_t>(i-k) >= max_iter)
 policies::raise_evaluation_error(
- "cdf(non_central_chi_squared_distribution<%1%>, %1%)",
+ "cdf(non_central_chi_squared_distribution<%1%>, %1%)",
 "Series did not converge, closest value was %1%", sum, pol);
 //
 // Now backwards iteration: the gamma
 // function recurrences are unstable in this
 // direction, we rely on the terms deminishing in size
- // faster than we introduce cancellation errors.
+ // faster than we introduce cancellation errors.
 // For this reason it's very important that we start
 // *before* the largest term so that backwards iteration
 // is strictly converging.
@@ -133,7 +133,7 @@
 //
 // This is an implementation of:
 //
- // Algorithm AS 275:
+ // Algorithm AS 275:
 // Computing the Non-Central #2 Distribution Function
 // Cherng G. Ding
 // Applied Statistics, Vol. 41, No. 2. (1992), pp. 478-482.
@@ -176,7 +176,7 @@
 //Error check:
 if(static_cast<boost::uintmax_t>(i) >= max_iter)
 policies::raise_evaluation_error(
- "cdf(non_central_chi_squared_distribution<%1%>, %1%)",
+ "cdf(non_central_chi_squared_distribution<%1%>, %1%)",
 "Series did not converge, closest value was %1%", sum, pol);
 return sum;
 }
@@ -240,7 +240,7 @@
 // Backwards recursion first, this is the stable
 // direction for gamma function recurrences:
 //
- while(i <= k)
+ while(i <= k)
 {
 xtermb *= (a - i + 1) / x;
 gamkb += xtermb;
@@ -275,7 +275,7 @@
 //Error check:
 if(static_cast<boost::uintmax_t>(i) >= max_iter)
 policies::raise_evaluation_error(
- "cdf(non_central_chi_squared_distribution<%1%>, %1%)",
+ "cdf(non_central_chi_squared_distribution<%1%>, %1%)",
 "Series did not converge, closest value was %1%", sum, pol);

 return sum;
@@ -306,7 +306,7 @@
 break;
 if(static_cast<boost::uintmax_t>(i - k) >= max_iter)
 return policies::raise_evaluation_error(
- "pdf(non_central_chi_squared_distribution<%1%>, %1%)",
+ "pdf(non_central_chi_squared_distribution<%1%>, %1%)",
 "Series did not converge, closest value was %1%", sum, pol);
 pois *= l2 * x2 / ((i + 1) * (n2 + i));
 }
@@ -325,9 +325,9 @@
 {
 typedef typename policies::evaluation<RealType, Policy>::type value_type;
 typedef typename policies::normalise<
- Policy,
- policies::promote_float<false>,
- policies::promote_double<false>,
+ Policy,
+ policies::promote_float<false>,
+ policies::promote_double<false>,
 policies::discrete_quantile<>,
 policies::assert_undefined<> >::type forwarding_policy;

@@ -339,10 +339,10 @@
 {
 // Complement is the smaller of the two:
 result = detail::non_central_chi_square_q(
- static_cast<value_type>(x),
- static_cast<value_type>(k),
- static_cast<value_type>(l),
- forwarding_policy(),
+ static_cast<value_type>(x),
+ static_cast<value_type>(k),
+ static_cast<value_type>(l),
+ forwarding_policy(),
 static_cast<value_type>(invert ? 0 : -1));
 invert = !invert;
 }
@@ -351,9 +351,9 @@
 // For small values of the non-centrality parameter
 // we can use Ding's method:
 result = detail::non_central_chi_square_p_ding(
- static_cast<value_type>(x),
- static_cast<value_type>(k),
- static_cast<value_type>(l),
+ static_cast<value_type>(x),
+ static_cast<value_type>(k),
+ static_cast<value_type>(l),
 forwarding_policy(),
 static_cast<value_type>(invert ? -1 : 0));
 }
@@ -365,16 +365,16 @@
 // may return zero when the result is in fact
 // finite, use Krishnamoorthy's method instead:
 result = detail::non_central_chi_square_p(
- static_cast<value_type>(x),
- static_cast<value_type>(k),
- static_cast<value_type>(l),
+ static_cast<value_type>(x),
+ static_cast<value_type>(k),
+ static_cast<value_type>(l),
 forwarding_policy(),
 static_cast<value_type>(invert ? -1 : 0));
 }
 if(invert)
 result = -result;
 return policies::checked_narrowing_cast<RealType, forwarding_policy>(
- result,
+ result,
 "boost::math::non_central_chi_squared_cdf<%1%>(%1%, %1%, %1%)");
 }

@@ -403,9 +403,9 @@
 static const char* function = "quantile(non_central_chi_squared_distribution<%1%>, %1%)";
 typedef typename policies::evaluation<RealType, Policy>::type value_type;
 typedef typename policies::normalise<
- Policy,
- policies::promote_float<false>,
- policies::promote_double<false>,
+ Policy,
+ policies::promote_float<false>,
+ policies::promote_double<false>,
 policies::discrete_quantile<>,
 policies::assert_undefined<> >::type forwarding_policy;

@@ -442,13 +442,13 @@
 guess = tools::min_value<value_type>();

 value_type result = detail::generic_quantile(
- non_central_chi_squared_distribution<value_type, forwarding_policy>(k, l),
- p,
- guess,
- comp,
+ non_central_chi_squared_distribution<value_type, forwarding_policy>(k, l),
+ p,
+ guess,
+ comp,
 function);
 return policies::checked_narrowing_cast<RealType, forwarding_policy>(
- result,
+ result,
 function);
 }

@@ -459,9 +459,9 @@
 static const char* function = "pdf(non_central_chi_squared_distribution<%1%>, %1%)";
 typedef typename policies::evaluation<RealType, Policy>::type value_type;
 typedef typename policies::normalise<
- Policy,
- policies::promote_float<false>,
- policies::promote_double<false>,
+ Policy,
+ policies::promote_float<false>,
+ policies::promote_double<false>,
 policies::discrete_quantile<>,
 policies::assert_undefined<> >::type forwarding_policy;

@@ -510,7 +510,7 @@
 }
 }
 return policies::checked_narrowing_cast<RealType, forwarding_policy>(
- r,
+ r,
 function);
 }

@@ -545,8 +545,8 @@
 //
 // Can't a thing if one of p and q is zero:
 //
- return policies::raise_evaluation_error<RealType>(function,
- "Can't find degrees of freedom when the probability is 0 or 1, only possible answer is %1%",
+ return policies::raise_evaluation_error<RealType>(function,
+ "Can't find degrees of freedom when the probability is 0 or 1, only possible answer is %1%",
 RealType(std::numeric_limits<RealType>::quiet_NaN()), Policy());
 }
 degrees_of_freedom_finder<RealType, Policy> f(lam, x, p < q ? p : q, p < q ? false : true);
@@ -601,8 +601,8 @@
 //
 // Can't do a thing if one of p and q is zero:
 //
- return policies::raise_evaluation_error<RealType>(function,
- "Can't find non centrality parameter when the probability is 0 or 1, only possible answer is %1%",
+ return policies::raise_evaluation_error<RealType>(function,
+ "Can't find non centrality parameter when the probability is 0 or 1, only possible answer is %1%",
 RealType(std::numeric_limits<RealType>::quiet_NaN()), Policy());
 }
 non_centrality_finder<RealType, Policy> f(v, x, p < q ? p : q, p < q ? false : true);
@@ -636,7 +636,7 @@
 typedef Policy policy_type;

 non_central_chi_squared_distribution(RealType df_, RealType lambda) : df(df_), ncp(lambda)
- {
+ {
 const char* function = "boost::math::non_central_chi_squared_distribution<%1%>::non_central_chi_squared_distribution(%1%,%1%)";
 RealType r;
 detail::check_df(
@@ -662,19 +662,19 @@
 const char* function = "non_central_chi_squared<%1%>::find_degrees_of_freedom";
 typedef typename policies::evaluation<RealType, Policy>::type value_type;
 typedef typename policies::normalise<
- Policy,
- policies::promote_float<false>,
- policies::promote_double<false>,
+ Policy,
+ policies::promote_float<false>,
+ policies::promote_double<false>,
 policies::discrete_quantile<>,
 policies::assert_undefined<> >::type forwarding_policy;
 value_type result = detail::find_degrees_of_freedom(
- static_cast<value_type>(lam),
- static_cast<value_type>(x),
- static_cast<value_type>(p),
- static_cast<value_type>(1-p),
+ static_cast<value_type>(lam),
+ static_cast<value_type>(x),
+ static_cast<value_type>(p),
+ static_cast<value_type>(1-p),
 forwarding_policy());
 return policies::checked_narrowing_cast<RealType, forwarding_policy>(
- result,
+ result,
 function);
 }
 template <class A, class B, class C>
@@ -683,19 +683,19 @@
 const char* function = "non_central_chi_squared<%1%>::find_degrees_of_freedom";
 typedef typename policies::evaluation<RealType, Policy>::type value_type;
 typedef typename policies::normalise<
- Policy,
- policies::promote_float<false>,
- policies::promote_double<false>,
+ Policy,
+ policies::promote_float<false>,
+ policies::promote_double<false>,
 policies::discrete_quantile<>,
 policies::assert_undefined<> >::type forwarding_policy;
 value_type result = detail::find_degrees_of_freedom(
- static_cast<value_type>(c.dist),
- static_cast<value_type>(c.param1),
- static_cast<value_type>(1-c.param2),
- static_cast<value_type>(c.param2),
+ static_cast<value_type>(c.dist),
+ static_cast<value_type>(c.param1),
+ static_cast<value_type>(1-c.param2),
+ static_cast<value_type>(c.param2),
 forwarding_policy());
 return policies::checked_narrowing_cast<RealType, forwarding_policy>(
- result,
+ result,
 function);
 }
 static RealType find_non_centrality(RealType v, RealType x, RealType p)
@@ -703,19 +703,19 @@
 const char* function = "non_central_chi_squared<%1%>::find_non_centrality";
 typedef typename policies::evaluation<RealType, Policy>::type value_type;
 typedef typename policies::normalise<
- Policy,
- policies::promote_float<false>,
- policies::promote_double<false>,
+ Policy,
+ policies::promote_float<false>,
+ policies::promote_double<false>,
 policies::discrete_quantile<>,
 policies::assert_undefined<> >::type forwarding_policy;
 value_type result = detail::find_non_centrality(
- static_cast<value_type>(v),
- static_cast<value_type>(x),
- static_cast<value_type>(p),
- static_cast<value_type>(1-p),
+ static_cast<value_type>(v),
+ static_cast<value_type>(x),
+ static_cast<value_type>(p),
+ static_cast<value_type>(1-p),
 forwarding_policy());
 return policies::checked_narrowing_cast<RealType, forwarding_policy>(
- result,
+ result,
 function);
 }
 template <class A, class B, class C>
@@ -724,19 +724,19 @@
 const char* function = "non_central_chi_squared<%1%>::find_non_centrality";
 typedef typename policies::evaluation<RealType, Policy>::type value_type;
 typedef typename policies::normalise<
- Policy,
- policies::promote_float<false>,
- policies::promote_double<false>,
+ Policy,
+ policies::promote_float<false>,
+ policies::promote_double<false>,
 policies::discrete_quantile<>,
 policies::assert_undefined<> >::type forwarding_policy;
 value_type result = detail::find_non_centrality(
- static_cast<value_type>(c.dist),
- static_cast<value_type>(c.param1),
- static_cast<value_type>(1-c.param2),
- static_cast<value_type>(c.param2),
+ static_cast<value_type>(c.dist),
+ static_cast<value_type>(c.param1),
+ static_cast<value_type>(1-c.param2),
+ static_cast<value_type>(c.param2),
 forwarding_policy());
 return policies::checked_narrowing_cast<RealType, forwarding_policy>(
- result,
+ result,
 function);
 }
 private:
@@ -753,7 +753,7 @@
 inline const std::pair<RealType, RealType> range(const non_central_chi_squared_distribution<RealType, Policy>& /* dist */)
 { // Range of permissible values for random variable k.
 using boost::math::tools::max_value;
- return std::pair<RealType, RealType>(0, max_value<RealType>()); // Max integer?
+ return std::pair<RealType, RealType>(static_cast<RealType>(0), max_value<RealType>()); // Max integer?
 }

 template <class RealType, class Policy>
@@ -761,7 +761,7 @@
 { // Range of supported values for random variable k.
 // This is range where cdf rises from 0 to 1, and outside it, the pdf is zero.
 using boost::math::tools::max_value;
- return std::pair<RealType, RealType>(0, max_value<RealType>());
+ return std::pair<RealType, RealType>(static_cast<RealType>(0), max_value<RealType>());
 }

 template <class RealType, class Policy>
@@ -851,7 +851,7 @@

 template <class RealType, class Policy>
 inline RealType kurtosis_excess(const non_central_chi_squared_distribution<RealType, Policy>& dist)
- {
+ {
 const char* function = "boost::math::non_central_chi_squared_distribution<%1%>::kurtosis_excess()";
 RealType k = dist.degrees_of_freedom();
 RealType l = dist.non_centrality();
@@ -883,7 +883,7 @@

 template <class RealType, class Policy>
 RealType cdf(const non_central_chi_squared_distribution<RealType, Policy>& dist, const RealType& x)
- {
+ {
 const char* function = "boost::math::non_central_chi_squared_distribution<%1%>::cdf(%1%)";
 RealType k = dist.degrees_of_freedom();
 RealType l = dist.non_centrality();

Modified: branches/release/boost/math/distributions/non_central_f.hpp
==============================================================================
--- branches/release/boost/math/distributions/non_central_f.hpp (original)
+++ branches/release/boost/math/distributions/non_central_f.hpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -26,7 +26,7 @@
 typedef Policy policy_type;

 non_central_f_distribution(RealType v1_, RealType v2_, RealType lambda) : v1(v1_), v2(v2_), ncp(lambda)
- {
+ {
 const char* function = "boost::math::non_central_f_distribution<%1%>::non_central_f_distribution(%1%,%1%)";
 RealType r;
 detail::check_df(
@@ -69,7 +69,7 @@
 inline const std::pair<RealType, RealType> range(const non_central_f_distribution<RealType, Policy>& /* dist */)
 { // Range of permissible values for random variable k.
 using boost::math::tools::max_value;
- return std::pair<RealType, RealType>(0, max_value<RealType>());
+ return std::pair<RealType, RealType>(static_cast<RealType>(0), max_value<RealType>());
 }

 template <class RealType, class Policy>
@@ -77,12 +77,12 @@
 { // Range of supported values for random variable k.
 // This is range where cdf rises from 0 to 1, and outside it, the pdf is zero.
 using boost::math::tools::max_value;
- return std::pair<RealType, RealType>(0, max_value<RealType>());
+ return std::pair<RealType, RealType>(static_cast<RealType>(0), max_value<RealType>());
 }

 template <class RealType, class Policy>
 inline RealType mean(const non_central_f_distribution<RealType, Policy>& dist)
- {
+ {
 const char* function = "mean(non_central_f_distribution<%1%> const&)";
 RealType v1 = dist.degrees_of_freedom1();
 RealType v2 = dist.degrees_of_freedom2();
@@ -104,8 +104,8 @@
 return r;
 if(v2 <= 2)
 return policies::raise_domain_error(
- function,
- "Second degrees of freedom parameter was %1%, but must be > 2 !",
+ function,
+ "Second degrees of freedom parameter was %1%, but must be > 2 !",
 v2, Policy());
 return v2 * (v1 + l) / (v1 * (v2 - 2));
 } // mean
@@ -134,8 +134,8 @@
 Policy()))
 return r;
 return detail::generic_find_mode(
- dist,
- m * (n + l) / (n * (m - 2)),
+ dist,
+ m * (n + l) / (n * (m - 2)),
 function);
 }

@@ -163,8 +163,8 @@
 return r;
 if(m <= 4)
 return policies::raise_domain_error(
- function,
- "Second degrees of freedom parameter was %1%, but must be > 4 !",
+ function,
+ "Second degrees of freedom parameter was %1%, but must be > 4 !",
 m, Policy());
 RealType result = 2 * m * m * ((n + l) * (n + l)
 + (m - 2) * (n + 2 * l));
@@ -200,8 +200,8 @@
 return r;
 if(m <= 6)
 return policies::raise_domain_error(
- function,
- "Second degrees of freedom parameter was %1%, but must be > 6 !",
+ function,
+ "Second degrees of freedom parameter was %1%, but must be > 6 !",
 m, Policy());
 RealType result = 2 * constants::root_two<RealType>();
 result *= sqrt(m - 4);
@@ -214,7 +214,7 @@

 template <class RealType, class Policy>
 inline RealType kurtosis_excess(const non_central_f_distribution<RealType, Policy>& dist)
- {
+ {
 const char* function = "kurtosis_excess(non_central_f_distribution<%1%> const&)";
 BOOST_MATH_STD_USING
 RealType n = dist.degrees_of_freedom1();
@@ -237,18 +237,18 @@
 return r;
 if(m <= 8)
 return policies::raise_domain_error(
- function,
- "Second degrees of freedom parameter was %1%, but must be > 8 !",
+ function,
+ "Second degrees of freedom parameter was %1%, but must be > 8 !",
 m, Policy());
 RealType l2 = l * l;
 RealType l3 = l2 * l;
 RealType l4 = l2 * l2;
 RealType result = (3 * (m - 4) * (n * (m + n - 2)
- * (4 * (m - 2) * (m - 2)
+ * (4 * (m - 2) * (m - 2)
 + (m - 2) * (m + 10) * n
 + (10 + m) * n * n)
 + 4 * (m + n - 2) * (4 * (m - 2) * (m - 2)
- + (m - 2) * (10 + m) * n
+ + (m - 2) * (10 + m) * n
 + (10 + m) * n * n) * l + 2 * (10 + m)
 * (m + n - 2) * (2 * m + 3 * n - 4) * l2
 + 4 * (10 + m) * (-2 + m + n) * l3
@@ -270,9 +270,9 @@
 { // Probability Density/Mass Function.
 typedef typename policies::evaluation<RealType, Policy>::type value_type;
 typedef typename policies::normalise<
- Policy,
- policies::promote_float<false>,
- policies::promote_double<false>,
+ Policy,
+ policies::promote_float<false>,
+ policies::promote_double<false>,
 policies::discrete_quantile<>,
 policies::assert_undefined<> >::type forwarding_policy;

@@ -287,7 +287,7 @@

 template <class RealType, class Policy>
 RealType cdf(const non_central_f_distribution<RealType, Policy>& dist, const RealType& x)
- {
+ {
 const char* function = "cdf(const non_central_f_distribution<%1%>&, %1%)";
 RealType r;
 if(!detail::check_df(
@@ -304,7 +304,7 @@
 &r,
 Policy()))
 return r;
-
+
 if((x < 0) || !(boost::math::isfinite)(x))
 {
 return policies::raise_domain_error<RealType>(
@@ -321,7 +321,7 @@
 // non-central beta cdf routine, this ensures accuracy
 // even when we compute x to be ~ 1:
 //
- r = detail::non_central_beta_cdf(c, cp, alpha, beta,
+ r = detail::non_central_beta_cdf(c, cp, alpha, beta,
 dist.non_centrality(), false, Policy());
 return r;
 } // cdf
@@ -345,7 +345,7 @@
 &r,
 Policy()))
 return r;
-
+
 if((c.param < 0) || !(boost::math::isfinite)(c.param))
 {
 return policies::raise_domain_error<RealType>(
@@ -362,7 +362,7 @@
 // non-central beta cdf routine, this ensures accuracy
 // even when we compute x to be ~ 1:
 //
- r = detail::non_central_beta_cdf(x, cx, alpha, beta,
+ r = detail::non_central_beta_cdf(x, cx, alpha, beta,
 c.dist.non_centrality(), true, Policy());
 return r;
 } // ccdf
@@ -375,8 +375,8 @@
 RealType x = quantile(boost::math::non_central_beta_distribution<RealType, Policy>(alpha, beta, dist.non_centrality()), p);
 if(x == 1)
 return policies::raise_overflow_error<RealType>(
- "quantile(const non_central_f_distribution<%1%>&, %1%)",
- "Result of non central F quantile is too large to represent.",
+ "quantile(const non_central_f_distribution<%1%>&, %1%)",
+ "Result of non central F quantile is too large to represent.",
 Policy());
 return (x / (1 - x)) * (dist.degrees_of_freedom2() / dist.degrees_of_freedom1());
 } // quantile
@@ -389,8 +389,8 @@
 RealType x = quantile(complement(boost::math::non_central_beta_distribution<RealType, Policy>(alpha, beta, c.dist.non_centrality()), c.param));
 if(x == 1)
 return policies::raise_overflow_error<RealType>(
- "quantile(complement(const non_central_f_distribution<%1%>&, %1%))",
- "Result of non central F quantile is too large to represent.",
+ "quantile(complement(const non_central_f_distribution<%1%>&, %1%))",
+ "Result of non central F quantile is too large to represent.",
 Policy());
 return (x / (1 - x)) * (c.dist.degrees_of_freedom2() / c.dist.degrees_of_freedom1());
 } // quantile complement.

Modified: branches/release/boost/math/distributions/pareto.hpp
==============================================================================
--- branches/release/boost/math/distributions/pareto.hpp (original)
+++ branches/release/boost/math/distributions/pareto.hpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -164,7 +164,7 @@
 inline const std::pair<RealType, RealType> range(const pareto_distribution<RealType, Policy>& /*dist*/)
 { // Range of permissible values for random variable x.
 using boost::math::tools::max_value;
- return std::pair<RealType, RealType>(0, max_value<RealType>()); // scale zero to + infinity.
+ return std::pair<RealType, RealType>(static_cast<RealType>(0), max_value<RealType>()); // scale zero to + infinity.
 } // range

 template <class RealType, class Policy>

Modified: branches/release/boost/math/distributions/poisson.hpp
==============================================================================
--- branches/release/boost/math/distributions/poisson.hpp (original)
+++ branches/release/boost/math/distributions/poisson.hpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -54,7 +54,7 @@
 {
 namespace detail{
 template <class Dist>
- inline typename Dist::value_type
+ inline typename Dist::value_type
 inverse_discrete_quantile(
 const Dist& dist,
 const typename Dist::value_type& p,
@@ -64,7 +64,7 @@
 const policies::discrete_quantile<policies::integer_round_nearest>&,
 boost::uintmax_t& max_iter);
 template <class Dist>
- inline typename Dist::value_type
+ inline typename Dist::value_type
 inverse_discrete_quantile(
 const Dist& dist,
 const typename Dist::value_type& p,
@@ -74,7 +74,7 @@
 const policies::discrete_quantile<policies::integer_round_up>&,
 boost::uintmax_t& max_iter);
 template <class Dist>
- inline typename Dist::value_type
+ inline typename Dist::value_type
 inverse_discrete_quantile(
 const Dist& dist,
 const typename Dist::value_type& p,
@@ -84,7 +84,7 @@
 const policies::discrete_quantile<policies::integer_round_down>&,
 boost::uintmax_t& max_iter);
 template <class Dist>
- inline typename Dist::value_type
+ inline typename Dist::value_type
 inverse_discrete_quantile(
 const Dist& dist,
 const typename Dist::value_type& p,
@@ -94,7 +94,7 @@
 const policies::discrete_quantile<policies::integer_round_outwards>&,
 boost::uintmax_t& max_iter);
 template <class Dist>
- inline typename Dist::value_type
+ inline typename Dist::value_type
 inverse_discrete_quantile(
 const Dist& dist,
 const typename Dist::value_type& p,
@@ -104,7 +104,7 @@
 const policies::discrete_quantile<policies::integer_round_inwards>&,
 boost::uintmax_t& max_iter);
 template <class Dist>
- inline typename Dist::value_type
+ inline typename Dist::value_type
 inverse_discrete_quantile(
 const Dist& dist,
 const typename Dist::value_type& p,
@@ -235,7 +235,7 @@
 inline const std::pair<RealType, RealType> range(const poisson_distribution<RealType, Policy>& /* dist */)
 { // Range of permissible values for random variable k.
 using boost::math::tools::max_value;
- return std::pair<RealType, RealType>(0, max_value<RealType>()); // Max integer?
+ return std::pair<RealType, RealType>(static_cast<RealType>(0), max_value<RealType>()); // Max integer?
 }

 template <class RealType, class Policy>
@@ -243,7 +243,7 @@
 { // Range of supported values for random variable k.
 // This is range where cdf rises from 0 to 1, and outside it, the pdf is zero.
 using boost::math::tools::max_value;
- return std::pair<RealType, RealType>(0, max_value<RealType>());
+ return std::pair<RealType, RealType>(static_cast<RealType>(0), max_value<RealType>());
 }

 template <class RealType, class Policy>

Modified: branches/release/boost/math/distributions/rayleigh.hpp
==============================================================================
--- branches/release/boost/math/distributions/rayleigh.hpp (original)
+++ branches/release/boost/math/distributions/rayleigh.hpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -89,7 +89,7 @@
{ // Range of supported values for random variable x.
 // This is range where cdf rises from 0 to 1, and outside it, the pdf is zero.
 using boost::math::tools::max_value;
- return std::pair<RealType, RealType>((0), max_value<RealType>());
+ return std::pair<RealType, RealType>(static_cast<RealType>(0), max_value<RealType>());
}

template <class RealType, class Policy>
@@ -109,7 +109,7 @@
 return result;
 }
 RealType sigmasqr = sigma * sigma;
- result = x * (exp(-(x * x) / ( 2 * sigmasqr))) / sigmasqr;
+ result = x * (exp(-(x * x) / ( 2 * sigmasqr))) / sigmasqr;
 return result;
} // pdf

Modified: branches/release/boost/math/distributions/weibull.hpp
==============================================================================
--- branches/release/boost/math/distributions/weibull.hpp (original)
+++ branches/release/boost/math/distributions/weibull.hpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -103,7 +103,7 @@
inline const std::pair<RealType, RealType> range(const weibull_distribution<RealType, Policy>& /*dist*/)
{ // Range of permissible values for random variable x.
 using boost::math::tools::max_value;
- return std::pair<RealType, RealType>(0, max_value<RealType>());
+ return std::pair<RealType, RealType>(static_cast<RealType>(0), max_value<RealType>());
}

template <class RealType, class Policy>
@@ -133,7 +133,7 @@
 return result;

 if(x == 0)
- { // Special case, but x == min, pdf = 1 for shape = 1,
+ { // Special case, but x == min, pdf = 1 for shape = 1,
 return 0;
 }
 result = exp(-pow(x / scale, shape));

Modified: branches/release/boost/math/special_functions/cbrt.hpp
==============================================================================
--- branches/release/boost/math/special_functions/cbrt.hpp (original)
+++ branches/release/boost/math/special_functions/cbrt.hpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -69,7 +69,7 @@
 static_cast<T>(1.5874010519681994747517056392723), // 2^2/3
 };

- if(!boost::math::isfinite(z))
+ if(!(boost::math::isfinite)(z))
 {
 return policies::raise_domain_error("boost::math::cbrt<%1%>(%1%)", "Argument to function must be finite but got %1%.", z, pol);
 }

Modified: branches/release/boost/math/special_functions/detail/erf_inv.hpp
==============================================================================
--- branches/release/boost/math/special_functions/detail/erf_inv.hpp (original)
+++ branches/release/boost/math/special_functions/detail/erf_inv.hpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -277,12 +277,12 @@
template <class T, class Policy>
struct erf_roots
{
- std::tr1::tuple<T,T,T> operator()(const T& guess)
+ boost::math::tuple<T,T,T> operator()(const T& guess)
 {
 BOOST_MATH_STD_USING
 T derivative = sign * (2 / sqrt(constants::pi<T>())) * exp(-(guess * guess));
 T derivative2 = -2 * guess * derivative;
- return std::tr1::make_tuple(((sign > 0) ? boost::math::erf(guess, Policy()) : boost::math::erfc(guess, Policy())) - target, derivative, derivative2);
+ return boost::math::make_tuple(((sign > 0) ? boost::math::erf(guess, Policy()) : boost::math::erfc(guess, Policy())) - target, derivative, derivative2);
 }
 erf_roots(T z, int s) : target(z), sign(s) {}
private:

Modified: branches/release/boost/math/special_functions/detail/fp_traits.hpp
==============================================================================
--- branches/release/boost/math/special_functions/detail/fp_traits.hpp (original)
+++ branches/release/boost/math/special_functions/detail/fp_traits.hpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -545,7 +545,8 @@
    && !defined(__hpux) \
    && !defined(__DECCXX)\
    && !defined(__osf__) \
- && !defined(__SGI_STL_PORT) && !defined(_STLPORT_VERSION)
+ && !defined(__SGI_STL_PORT) && !defined(_STLPORT_VERSION)\
+ && !defined(BOOST_MATH_DISABLE_STD_FPCLASSIFY)
# define BOOST_MATH_USE_STD_FPCLASSIFY
#endif

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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -27,7 +27,7 @@
{
 temme_root_finder(const T t_, const T a_) : t(t_), a(a_) {}

- std::tr1::tuple<T, T> operator()(T x)
+ boost::math::tuple<T, T> operator()(T x)
 {
 BOOST_MATH_STD_USING // ADL of std names

@@ -35,16 +35,16 @@
 if(y == 0)
 {
 T big = tools::max_value<T>() / 4;
- return std::tr1::make_tuple(-big, -big);
+ return boost::math::make_tuple(-big, -big);
 }
 if(x == 0)
 {
 T big = tools::max_value<T>() / 4;
- return std::tr1::make_tuple(-big, big);
+ return boost::math::make_tuple(-big, big);
 }
 T f = log(x) + a * log(y) + t;
 T f1 = (1 / x) - (a / (y));
- return std::tr1::make_tuple(f, f1);
+ return boost::math::make_tuple(f, f1);
 }
private:
 T t, a;
@@ -416,7 +416,7 @@
 ibeta_roots(T _a, T _b, T t, bool inv = false)
 : a(_a), b(_b), target(t), invert(inv) {}

- std::tr1::tuple<T, T, T> operator()(T x)
+ boost::math::tuple<T, T, T> operator()(T x)
 {
 BOOST_MATH_STD_USING // ADL of std names

@@ -442,7 +442,7 @@
 if(f1 == 0)
 f1 = (invert ? -1 : 1) * tools::min_value<T>() * 64;

- return std::tr1::make_tuple(f, f1, f2);
+ return boost::math::make_tuple(f, f1, f2);
 }
private:
 T a, b, target;

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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -10,7 +10,7 @@
#pragma once
#endif

-#include <boost/tr1/tuple.hpp>
+#include <boost/math/tools/tuple.hpp>
#include <boost/math/special_functions/gamma.hpp>
#include <boost/math/special_functions/sign.hpp>
#include <boost/math/tools/roots.hpp>
@@ -122,7 +122,7 @@
 BOOST_MATH_INSTRUMENT_VARIABLE(b);
 if((b > 0.6) || ((b >= 0.45) && (a >= 0.3)))
 {
- // DiDonato & Morris Eq 21:
+ // DiDonato & Morris Eq 21:
 //
 // There is a slight variation from DiDonato and Morris here:
 // the first form given here is unstable when p is close to 1,
@@ -275,16 +275,18 @@
 {
 T z = w;
 T ap1 = a + 1;
+ T ap2 = a + 2;
 if(w < 0.15f * ap1)
 {
 // DiDonato and Morris Eq 35:
 T v = log(p) + boost::math::lgamma(ap1, pol);
 T s = 1;
 z = exp((v + w) / a);
- s = boost::math::log1p(z / ap1 * (1 + z / (a + 2)));
+ s = boost::math::log1p(z / ap1 * (1 + z / ap2));
 z = exp((v + z - s) / a);
+ s = boost::math::log1p(z / ap1 * (1 + z / ap2));
 z = exp((v + z - s) / a);
- s = boost::math::log1p(z / ap1 * (1 + z / (a + 2) * (1 + z / (a + 3))));
+ s = boost::math::log1p(z / ap1 * (1 + z / ap2 * (1 + z / (a + 3))));
 z = exp((v + z - s) / a);
 BOOST_MATH_INSTRUMENT_VARIABLE(z);
 }
@@ -332,7 +334,7 @@
 }
 }

- std::tr1::tuple<T, T, T> operator()(const T& x)const
+ boost::math::tuple<T, T, T> operator()(const T& x)const
 {
 BOOST_FPU_EXCEPTION_GUARD
 //
@@ -377,7 +379,7 @@
 f2 = -f2;
 }

- return std::tr1::make_tuple(f - p, f1, f2);
+ return boost::math::make_tuple(f - p, f1, f2);
 }
private:
 T a, p;

Modified: branches/release/boost/math/special_functions/detail/igamma_large.hpp
==============================================================================
--- branches/release/boost/math/special_functions/detail/igamma_large.hpp (original)
+++ branches/release/boost/math/special_functions/detail/igamma_large.hpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -257,7 +257,7 @@
 };
 workspace[12] = tools::evaluate_polynomial(C12, z);

- T result = tools::evaluate_polynomial(workspace, 1/a);
+ T result = tools::evaluate_polynomial<13, T, T>(workspace, 1/a);
 result *= exp(-y) / sqrt(2 * constants::pi<T>() * a);
 if(x < a)
 result = -result;
@@ -399,7 +399,7 @@
 workspace[8] = tools::evaluate_polynomial(C8, z);
 workspace[9] = static_cast<T>(-0.00059676129019274625L);

- T result = tools::evaluate_polynomial(workspace, 1/a);
+ T result = tools::evaluate_polynomial<10, T, T>(workspace, 1/a);
 result *= exp(-y) / sqrt(2 * constants::pi<T>() * a);
 if(x < a)
 result = -result;

Modified: branches/release/boost/math/special_functions/detail/t_distribution_inv.hpp
==============================================================================
--- branches/release/boost/math/special_functions/detail/t_distribution_inv.hpp (original)
+++ branches/release/boost/math/special_functions/detail/t_distribution_inv.hpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -118,7 +118,7 @@
 T rn = sqrt(df);
 T div = pow(rn * w, 1 / df);
 T power = div * div;
- T result = tools::evaluate_polynomial(d, power);
+ T result = tools::evaluate_polynomial<7, T, T>(d, power);
 result *= rn;
 result /= div;
 return -result;
@@ -200,7 +200,7 @@
 //
 // The result is then a polynomial in v (see Eq 56 of Shaw):
 //
- return tools::evaluate_odd_polynomial(c, v);
+ return tools::evaluate_odd_polynomial<11, T, T>(c, v);
}

template <class T, class Policy>

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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -87,7 +87,7 @@

namespace boost{

-#if defined(BOOST_HAS_FPCLASSIFY) || defined(isnan)
+#if (defined(BOOST_HAS_FPCLASSIFY) || defined(isnan)) && !defined(BOOST_MATH_DISABLE_STD_FPCLASSIFY)
//
// This must not be located in any namespace under boost::math
// otherwise we can get into an infinite loop if isnan is
@@ -133,7 +133,7 @@
 BOOST_MATH_INSTRUMENT_VARIABLE(t);

 // whenever possible check for Nan's first:
-#ifdef BOOST_HAS_FPCLASSIFY
+#if defined(BOOST_HAS_FPCLASSIFY) && !defined(BOOST_MATH_DISABLE_STD_FPCLASSIFY)
 if(::boost::math_detail::is_nan_helper(t, ::boost::is_floating_point<T>()))
 return FP_NAN;
#elif defined(isnan)

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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -835,7 +835,7 @@

typedef typename lanczos::lanczos<T, Policy>::type lanczos_type;

- T result;
+ T result = 0; // Just to avoid warning C4701: potentially uninitialized local variable 'result' used

BOOST_ASSERT((p_derivative == 0) || (normalised == true));

Modified: branches/release/boost/math/special_functions/lanczos.hpp
==============================================================================
--- branches/release/boost/math/special_functions/lanczos.hpp (original)
+++ branches/release/boost/math/special_functions/lanczos.hpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1229,9 +1229,11 @@
} // namespace math
} // namespace boost

+#if !defined(__GNUC__) || (__GNUC__ > 3) || ((__GNUC__ == 3) && (__GNUC_MINOR__ > 3))
#if (defined(_M_IX86_FP) && (_M_IX86_FP >= 2)) || defined(__SSE2__)
#include <boost/math/special_functions/detail/lanczos_sse2.hpp>
#endif
+#endif

#endif // BOOST_MATH_SPECIAL_FUNCTIONS_LANCZOS

Modified: branches/release/boost/math/special_functions/pow.hpp
==============================================================================
--- branches/release/boost/math/special_functions/pow.hpp (original)
+++ branches/release/boost/math/special_functions/pow.hpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -30,10 +30,9 @@
struct positive_power
{
 template <typename T>
- static typename tools::promote_args<T>::type result(T base)
+ static T result(T base)
 {
- typename tools::promote_args<T>::type power =
- positive_power<N/2>::result(base);
+ T power = positive_power<N/2>::result(base);
 return power * power;
 }
};
@@ -42,10 +41,9 @@
struct positive_power<N, 1>
{
 template <typename T>
- static typename tools::promote_args<T>::type result(T base)
+ static T result(T base)
 {
- typename tools::promote_args<T>::type power =
- positive_power<N/2>::result(base);
+ T power = positive_power<N/2>::result(base);
 return base * power * power;
 }
};
@@ -54,8 +52,7 @@
struct positive_power<1, 1>
{
 template <typename T>
- static typename tools::promote_args<T>::type result(T base)
- { return base; }
+ static T result(T base){ return base; }
};

@@ -63,7 +60,7 @@
struct power_if_positive
{
 template <typename T, class Policy>
- static typename tools::promote_args<T>::type result(T base, const Policy&)
+ static T result(T base, const Policy&)
 { return positive_power<N>::result(base); }
};

@@ -71,8 +68,7 @@
struct power_if_positive<N, false>
{
 template <typename T, class Policy>
- static typename tools::promote_args<T>::type
- result(T base, const Policy& policy)
+ static T result(T base, const Policy& policy)
 {
 if (base == 0)
 {
@@ -91,8 +87,7 @@
struct power_if_positive<0, true>
{
 template <typename T, class Policy>
- static typename tools::promote_args<T>::type
- result(T base, const Policy& policy)
+ static T result(T base, const Policy& policy)
 {
 if (base == 0)
 {
@@ -127,7 +122,10 @@

template <int N, typename T, class Policy>
inline typename tools::promote_args<T>::type pow(T base, const Policy& policy)
-{ return detail::select_power_if_positive<N>::type::result(base, policy); }
+{
+ typedef typename tools::promote_args<T>::type result_type;
+ return detail::select_power_if_positive<N>::type::result(static_cast<result_type>(base), policy);
+}

template <int N, typename T>

Modified: branches/release/boost/math/tools/roots.hpp
==============================================================================
--- branches/release/boost/math/tools/roots.hpp (original)
+++ branches/release/boost/math/tools/roots.hpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -14,7 +14,6 @@
#include <boost/config/no_tr1/cmath.hpp>
#include <stdexcept>

-#include <boost/tr1/tuple.hpp>
#include <boost/math/tools/config.hpp>
#include <boost/cstdint.hpp>
#include <boost/assert.hpp>
@@ -24,7 +23,7 @@
#pragma warning(push)
#pragma warning(disable: 4512)
#endif
-#include <boost/tr1/tuple.hpp>
+#include <boost/math/tools/tuple.hpp>
#ifdef BOOST_MSVC
#pragma warning(pop)
#endif
@@ -39,7 +38,7 @@

template <class Tuple, class T>
inline void unpack_0(const Tuple& t, T& val)
-{ val = std::tr1::get<0>(t); }
+{ val = boost::math::get<0>(t); }

template <class F, class T>
void handle_zero_derivative(F f,
@@ -64,7 +63,6 @@
 guess = min;
 }
 unpack_0(f(guess), last_f0);
- //last_f0 = std::tr1::get<0>(f(guess));
 delta = guess - result;
 }
 if(sign(last_f0) * sign(f0) < 0)
@@ -201,7 +199,7 @@
 last_f0 = f0;
 delta2 = delta1;
 delta1 = delta;
- std::tr1::tie(f0, f1) = f(result);
+ boost::math::tie(f0, f1) = f(result);
 if(0 == f0)
 break;
 if(f1 == 0)
@@ -296,7 +294,7 @@
 last_f0 = f0;
 delta2 = delta1;
 delta1 = delta;
- std::tr1::tie(f0, f1, f2) = f(result);
+ boost::math::tie(f0, f1, f2) = f(result);

 BOOST_MATH_INSTRUMENT_VARIABLE(f0);
 BOOST_MATH_INSTRUMENT_VARIABLE(f1);
@@ -446,7 +444,7 @@
 last_f0 = f0;
 delta2 = delta1;
 delta1 = delta;
- std::tr1::tie(f0, f1, f2) = f(result);
+ boost::math::tie(f0, f1, f2) = f(result);
 if(0 == f0)
 break;
 if((f1 == 0) && (f2 == 0))

Modified: branches/release/boost/math/tools/test_data.hpp
==============================================================================
--- branches/release/boost/math/tools/test_data.hpp (original)
+++ branches/release/boost/math/tools/test_data.hpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -26,7 +26,7 @@
#include <boost/type_traits/is_convertible.hpp>
#include <boost/type_traits/integral_constant.hpp>
#include <boost/tr1/random.hpp>
-#include <boost/tr1/tuple.hpp>
+#include <boost/math/tools/tuple.hpp>
#include <boost/math/tools/real_cast.hpp>

#include <set>
@@ -120,11 +120,11 @@
{
 // extract the N'th element, append, and recurse:
 typedef typename Seq::value_type value_type;
- value_type val = std::tr1::get<N>(data);
+ value_type val = boost::math::get<N>(data);
 s.push_back(val);

 typedef boost::integral_constant<int, N+1> next_value;
- typedef boost::integral_constant<bool, (std::tr1::tuple_size<Item>::value > N+1)> terminate;
+ typedef boost::integral_constant<bool, (boost::math::tuple_size<Item>::value > N+1)> terminate;

 unpack_and_append_tuple(s, data, next_value(), terminate());
}
@@ -140,7 +140,7 @@
{
 // Item had better be a tuple-like type or we've had it!!!!
 typedef boost::integral_constant<int, 0> next_value;
- typedef boost::integral_constant<bool, (std::tr1::tuple_size<Item>::value > 0)> terminate;
+ typedef boost::integral_constant<bool, (boost::math::tuple_size<Item>::value > 0)> terminate;

 unpack_and_append_tuple(s, data, next_value(), terminate());
}

Modified: branches/release/libs/math/build/Jamfile.v2
==============================================================================
--- branches/release/libs/math/build/Jamfile.v2 (original)
+++ branches/release/libs/math/build/Jamfile.v2 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -13,9 +13,10 @@
 #<toolset>intel-linux:<pch>off
 <toolset>intel-darwin:<pch>off
 <toolset>msvc-7.1:<pch>off
- <toolset>gcc:<cxxflags>-fvisibility=hidden
+ #<toolset>gcc:<cxxflags>-fvisibility=hidden
 <toolset>intel-linux:<cxxflags>-fvisibility=hidden
 <toolset>sun:<cxxflags>-xldscope=hidden
+ [ check-target-builds ../config//has_gcc_visibility : <cxxflags>-fvisibility=hidden : ]
 ;

cpp-pch pch : ../src/tr1/pch.hpp : <include>../src/tr1 <link>shared:<define>BOOST_MATH_TR1_DYN_LINK=1 ;

Modified: branches/release/libs/math/config/Jamfile.v2
==============================================================================
--- branches/release/libs/math/config/Jamfile.v2 (original)
+++ branches/release/libs/math/config/Jamfile.v2 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -15,11 +15,14 @@
obj has_ntl_rr : has_ntl_rr.cpp : <include>$(ntl-path)/include ;
obj has_gmpxx : has_gmpxx.cpp :
<include>$(gmp_path) <include>$(gmp_path)/mpfr <include>$(gmp_path)/gmpfrxx ;
+obj has_gcc_visibility : has_gcc_visibility.cpp :
+ <toolset>gcc:<cxxflags>-fvisibility=hidden <toolset>gcc:<cxxflags>-Werror ;

explicit has_long_double_support ;
explicit has_mpfr_class ;
explicit has_ntl_rr ;
explicit has_gmpxx ;
+explicit has_gcc_visibility ;

Modified: branches/release/libs/math/doc/html/index.html
==============================================================================
--- branches/release/libs/math/doc/html/index.html (original)
+++ branches/release/libs/math/doc/html/index.html 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Boost.Math</title>
<link rel="stylesheet" href="../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="index.html" title="Boost.Math">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
@@ -17,7 +17,7 @@
</tr></table>
<hr>
<div class="spirit-nav"></div>
-<div class="article">
+<div class="article" lang="en">
<div class="titlepage">
<div>
<div><h2 class="title">
@@ -51,11 +51,11 @@
Thijs van den Berg
</h3></div>
</div></div>
-<div>Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
+<div>Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
 Hubert Holin, Daryle Walker, Xiaogang Zhang, Bruno Lalande, Johan Råde,
 Gautam Sewani and Thijs van den Berg</div>
<div><div class="legalnotice">
-<a name="id759784"></a>
+<a name="id877658"></a>
 Distributed under the Boost Software License, Version 1.0. (See accompanying
 file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
@@ -461,7 +461,7 @@
</table></div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left">Last revised: , at </td>
+<td align="left">Last revised: September 01, 2010 at 19:10:43 +0100</td>
<td align="right"><div class="copyright-footer"></div></td>
</tr></table>
<hr>

Modified: branches/release/libs/math/doc/math.qbk
==============================================================================
--- branches/release/libs/math/doc/math.qbk (original)
+++ branches/release/libs/math/doc/math.qbk 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,12 +1,11 @@
[article Boost.Math
- [quickbook 1.4]
- [copyright 2006, 2007, 2008, 2009 John Maddock, Paul A. Bristow, Hubert Holin, Daryle Walker, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and Thijs van den Berg]
+ [quickbook 1.5]
+ [copyright 2006, 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow, Hubert Holin, Daryle Walker, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and Thijs van den Berg]
     [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 http://www.boost.org/LICENSE_1_0.txt])
     ]
- [category math]
     [authors [Maddock, John], [Bristow, Paul A.], [Holin, Hubert], [Walker, Daryle], [Zhang, Xiaogang], [Lalande, Bruno], [Råde, Johan], [Sewani, Gautam], [van den Berg, Thijs]]
     [last-revision $Date$]
]

Modified: branches/release/libs/math/doc/sf_and_dist/background.qbk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/background.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/background.qbk 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -3,12 +3,12 @@
[@http://en.wikipedia.org/wiki/Random_variate Random variates]
and [@http://en.wikipedia.org/wiki/Parameter distribution parameters]
are conventionally distinguished (for example in Wikipedia and Wolfram MathWorld
-by placing a semi-colon after the random variate (whose value you 'choose'),
+by placing a semi-colon after the __random_variate (whose value you 'choose'),
to separate the variate from the parameter(s) that defines the shape of the distribution.

For example, the binomial distribution has two parameters:
n (the number of trials) and p (the probability of success on one trial).
-It also has the random variate /k/: the number of successes observed.
+It also has the __random_variate /k/: the number of successes observed.
This means the probability density\/mass function (pdf) is written as ['f(k; n, p)].

Translating this into code the `binomial_distribution` constructor
@@ -18,7 +18,7 @@

While the function `pdf` has one argument specifying the distribution type
(which includes it's parameters, if any),
-and a second argument for the random variate. So taking our binomial distribution
+and a second argument for the __random_variate. So taking our binomial distribution
example, we would write:

pdf(binomial_distribution<RealType>(n, p), k);
@@ -30,16 +30,15 @@
Note that the [@http://en.wikipedia.org/wiki/Discrete_probability_distribution
discrete distributions], including the binomial, negative binomial, Poisson & Bernoulli,
are all mathematically defined as discrete functions:
-only integral values of the random variate are envisaged
+only integral values of the __random_variate are envisaged
and the functions are only defined at these integral values.
However because the method of calculation often uses continuous functions,
it is convenient to treat them as if they were continuous functions,
and permit non-integral values of their parameters.

To enforce a strict mathematical model,
-users may use floor or ceil functions on the random variate,
-prior to calling the distribution function,
-to enforce integral values.
+users may use floor or ceil functions on the __random_variate,
+prior to calling the distribution function, to enforce integral values.

For similar reasons, in continuous distributions, parameters like degrees of freedom
that might appear to be integral, are treated as real values

Modified: branches/release/libs/math/doc/sf_and_dist/building.qbk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/building.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/building.qbk 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,10 +1,15 @@
-[section:building If and How to Build the Library and its Examples and Tests]
+[section:building If and How to Build a Boost.Math Library, and its Examples and Tests]

-[h4 Building the Library]
+[h4 Building a Library (shared, dynamic .dll or static .lib)]

The first thing you need to ask yourself is "Do I need to build anything at all?"
as the bulk of this library is header only: meaning you can use it just by
-#including the necessary header(s). Refer to
+#including the necessary header(s).
+
+For most simple uses,
+including a header (or few) is best for compile time and program size.
+
+Refer to
[link math_toolkit.extern_c C99 and C++ TR1 C-style Functions]
for pros and cons of using
the TR1 components as opposed to the header only ones.
@@ -15,7 +20,7 @@

    bjam toolset=gcc --with-math install

-will do the job on Linux, while:
+that will do the job on Linux, while:

    bjam toolset=msvc --with-math --build-type=complete stage

@@ -94,7 +99,7 @@
[endsect]

[/ building.qbk
- Copyright 2006, 2007, 2008 John Maddock and Paul A. Bristow.
+ Copyright 2006, 2007, 2008, 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
   http://www.boost.org/LICENSE_1_0.txt).

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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -7,7 +7,7 @@
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,
@@ -53,7 +53,7 @@
[template performance_overview[]

By and large the performance of this library should be acceptable
-for most needs. However, you should note that the library's primary
+for most needs. However, you should note that this library's primary
emphasis is on accuracy and numerical stability, and /not/ speed.

In terms of the algorithms used, this library aims to use the same "best
@@ -73,7 +73,7 @@
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
-8 fold] have been found between some windows compilers for example.
+8 fold] have been found between some Windows compilers for example.

The [link math_toolkit.perf performance section] contains more
information on the performance

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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -30,6 +30,9 @@
M. A. (Thijs) van den Berg coded the Laplace distribution.
(Thijs has also threatened to implement some multivariate distributions).

+Thomas Mang requested the inverse gamma in chi squared distributions
+for Bayesian applications and helped in their implementation.
+
Professor Nico Temme for advice on the inverse incomplete beta function.

[@http://www.shoup.net Victor Shoup for NTL],
@@ -42,6 +45,10 @@
program used to generate the html and pdf versions
of this document, adding several new features en route.

+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.
+
Plots of the functions and distributions were prepared in
[@http://www.w3.org/ W3C] standard
[@http://www.svg.org/ Scalable Vector Graphic (SVG)] format
@@ -62,7 +69,7 @@
[endsect] [/section:credits Credits and Acknowledgements]

[/
- Copyright 2006, 2007, 2008, 2009 John Maddock and Paul A. Bristow.
+ Copyright 2006, 2007, 2008, 2009, 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
   http://www.boost.org/LICENSE_1_0.txt).

Modified: branches/release/libs/math/doc/sf_and_dist/dist_reference.qbk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/dist_reference.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/dist_reference.qbk 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -13,6 +13,8 @@
[include distributions/extreme_value.qbk]
[include distributions/fisher.qbk]
[include distributions/gamma.qbk]
+[include distributions/inverse_chi_squared.qbk]
+[include distributions/inverse_gamma.qbk]
[include distributions/hypergeometric.qbk]
[include distributions/laplace.qbk]
[include distributions/logistic.qbk]
@@ -121,7 +123,7 @@
[endsect][/section:future Extras Future Directions]

[/ dist_reference.qbk
- Copyright 2006 John Maddock and Paul A. Bristow.
+ 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
   http://www.boost.org/LICENSE_1_0.txt).

Modified: branches/release/libs/math/doc/sf_and_dist/dist_tutorial.qbk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/dist_tutorial.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/dist_tutorial.qbk 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,4 +1,4 @@
-[/ def names end in distrib to avoid clashes]
+[/ def names all end in distrib to avoid clashes with names of functions]
[def __binomial_distrib [link math_toolkit.dist.dist_ref.dists.binomial_dist Binomial Distribution]]
[def __chi_squared_distrib [link math_toolkit.dist.dist_ref.dists.chi_squared_dist Chi Squared Distribution]]
[def __normal_distrib [link math_toolkit.dist.dist_ref.dists.normal_dist Normal Distribution]]
@@ -19,14 +19,22 @@

All the code in this library is inside namespace boost::math.

+
In order to use a distribution /my_distribution/ you will need to include
either the header <boost/math/distributions/my_distribution.hpp> or
-the "include everything" header: <boost/math/distributions.hpp>.
+the "include all the distributions" header: <boost/math/distributions.hpp>.

For example, to use the Students-t distribution include either
<boost/math/distributions/students_t.hpp> or
<boost/math/distributions.hpp>

+You also need to bring distribution names into scope,
+perhaps with a `using namespace boost::math;` declaration,
+
+or specific `using` declarations like `using boost::math::normal;` (*recommended*).
+
+[caution Some math function names are also used in namespace std so including <random> could cause ambiguity!]
+
[endsect] [/ section:headers Headers and Namespaces]

[section:objects Distributions are Objects]
@@ -63,7 +71,12 @@
is nearly as convenient).
Probably 95% of uses are covered by these typedefs:

- using namespace boost::math;
+ // using namespace boost::math; // Avoid potential ambiguity with names in std <random>
+ // Safer to declare specific functions with using statement(s):
+
+ using boost::math::beta_distribution;
+ using boost::math::binomial_distribution;
+ using boost::math::students_t;

 // Construct a students_t distribution with 4 degrees of freedom:
 students_t d1(4);
@@ -136,37 +149,47 @@
] [/tip Random numbers that approximate Quantiles of Distributions]

For example, the binomial distribution has two parameters:
-n (the number of trials) and p (the probability of success on one trial).
+n (the number of trials) and p (the probability of success on any one trial).

The `binomial_distribution` constructor therefore has two parameters:

`binomial_distribution(RealType n, RealType p);`

-For this distribution the random variate is k: the number of successes observed.
+For this distribution the __random_variate is k: the number of successes observed.
The probability density\/mass function (pdf) is therefore written as ['f(k; n, p)].

[note

[*Random Variates and Distribution Parameters]

-[@http://en.wikipedia.org/wiki/Random_variate Random variates]
+The concept of a __random_variable is closely linked to the term __random_variate:
+a random variate is a particular value (outcome) of a random variable.
and [@http://en.wikipedia.org/wiki/Parameter distribution parameters]
-are conventionally distinguished (for example in Wikipedia and Wolfram MathWorld
-by placing a semi-colon (or sometimes vertical bar)
-after the random variate (whose value you 'choose'),
-to separate the variate from the parameter(s) that defines the shape of the distribution.
+are conventionally distinguished (for example in Wikipedia and Wolfram MathWorld)
+by placing a semi-colon or vertical bar)
+/after/ the __random_variable (whose value you 'choose'),
+to separate the variate from the parameter(s) that defines the shape of the distribution.[br]
+For example, the binomial distribution probability distribution function (PDF) is written as
+['f(k| n, p)] = Pr(K = k|n, p) = probability of observing k successes out of n trials.
+K is the __random_variable, k is the __random_variate,
+the parameters are n (trials) and p (probability).
] [/tip Random Variates and Distribution Parameters]

+[note By convention, __random_variate are lower case, usually k is integral, x if real, and
+__random_variable are upper case, K if integral, X if real. But this implementation treats
+all as floating point values `RealType`, so if you really want an integral result,
+you must round: see note on Discrete Probability Distributions below for details.]
+
As noted above the non-member function `pdf` has one parameter for the distribution object,
and a second for the random variate. So taking our binomial distribution
example, we would write:

`pdf(binomial_distribution<RealType>(n, p), k);`

-The ranges of random variate values that are permitted and are supported can be
+The ranges of __random_variate values that are permitted and are supported can be
tested by using two functions `range` and `support`.

-The distribution (effectively the random variate) is said to be 'supported'
+The distribution (effectively the __random_variate) is said to be 'supported'
over a range that is
[@http://en.wikipedia.org/wiki/Probability_distribution
 "the smallest closed set whose complement has probability zero"].
@@ -177,7 +200,7 @@

For most distributions, with probability distribution functions one might describe
as 'well-behaved', we have decided that it is most useful for the supported range
-to exclude random variate values like exact zero *if the end point is discontinuous*.
+to *exclude* random variate values like exact zero *if the end point is discontinuous*.
For example, the Weibull (scale 1, shape 1) distribution smoothly heads for unity
as the random variate x declines towards zero.
But at x = zero, the value of the pdf is suddenly exactly zero, by definition.
@@ -412,6 +435,7 @@
[include distributions/binomial_example.qbk]
[include distributions/negative_binomial_example.qbk]
[include distributions/normal_example.qbk]
+[/include distributions/inverse_gamma_example.qbk]
[include distributions/nc_chi_squared_example.qbk]
[include distributions/error_handling_example.qbk]
[include distributions/find_location_and_scale.qbk]
@@ -424,7 +448,7 @@
[endsect] [/ section:stat_tut Statistical Distributions Tutorial]

[/ dist_tutorial.qbk
- Copyright 2006 John Maddock and Paul A. Bristow.
+ 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
 http://www.boost.org/LICENSE_1_0.txt).

Modified: branches/release/libs/math/doc/sf_and_dist/distributions/binomial.qbk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/distributions/binomial.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/distributions/binomial.qbk 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -323,7 +323,7 @@
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 result. For example:

-`quantile(complement(binomial(n, p), P))``]]
+`quantile(complement(binomial(n, p), P))`]]
]

[h4 Examples]

Modified: branches/release/libs/math/doc/sf_and_dist/distributions/gamma.qbk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/distributions/gamma.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/distributions/gamma.qbk 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -127,10 +127,11 @@
[[kurtosis excess][6 / k ]]
]

-[endsect][/section:normal_dist Normal]
+[endsect][/section:gamma_dist Gamma (and Erlang) Distribution]
+

[/
- Copyright 2006 John Maddock and Paul A. Bristow.
+ 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
   http://www.boost.org/LICENSE_1_0.txt).

Modified: branches/release/libs/math/doc/sf_and_dist/distributions/non_members.qbk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/distributions/non_members.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/distributions/non_members.qbk 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,7 +1,7 @@
[section:nmp Non-Member Properties]

Properties that are common to all distributions are accessed via non-member
-getter functions. This allows more of these functions to be added over time
+getter functions: non-membership allows more of these functions to be added over time,
as the need arises. Unfortunately the literature uses many different and
confusing names to refer to a rather small number of actual concepts; refer
to the [link concept_index concept index] to find the property you
@@ -70,7 +70,7 @@
This function may return a __domain_error if the random variable is outside
the defined range for the distribution.

-For example the following graph shows the cdf for the
+For example, the following graph shows the cdf for the
normal distribution:

[$../graphs/cdf.png]
@@ -98,7 +98,7 @@
 // print survival function for x=2.0:
 std::cout << cdf(complement(norm, 2.0)) << std::endl;

-For example the following graph shows the __complement of the cdf for the
+For example, the following graph shows the __complement of the cdf for the
normal distribution:

[$../graphs/survival.png]
@@ -180,11 +180,11 @@
This function may return a __domain_error if the random variable is outside
the defined range for the distribution.

-For example for a standard normal distribution the pdf looks like this:
+For example, for a standard normal distribution the pdf looks like this:

[$../graphs/pdf.png]

-[h4 [#math.dist.range]range]
+[h4 [#math.dist.range]Range]

 template<class RealType, class ``__Policy``>
 std::pair<RealType, RealType> range(const ``['Distribution-Type]``<RealType, ``__Policy``>& dist);

Modified: branches/release/libs/math/doc/sf_and_dist/error_handling.qbk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/error_handling.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/error_handling.qbk 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -54,7 +54,7 @@
]

The following tables show all the permutations of errors and actions,
-with the default action for each error shown in bold:
+with the *default action for each error shown in bold*:

[table Possible Actions for Domain Errors
[[Action] [Behaviour]]
@@ -136,14 +136,19 @@
             this function must be defined by the user].]]
]

+All these error conditions are in namespace boost::math::policies,
+made available, for example, a by namespace declaration
+using `namespace boost::math::policies;` or individual using declarations
+`using boost::math::policies::overflow_error;`.
+
[heading Rationale]

-The flexibility of the current implementation should be reasonably obvious, the
+The flexibility of the current implementation should be reasonably obvious: the
default behaviours were chosen based on feedback during the formal review of
this library. It was felt that:

* Genuine errors should be flagged with exceptions
-rather than following C-compatible behaviour and setting ::errno.
+rather than following C-compatible behaviour and setting `::errno`.
* Numeric underflow and denormalised results were not considered to be
fatal errors in most cases, so it was felt that these should be ignored.

@@ -180,7 +185,7 @@

The default policy behaviour of this function is to throw a
std::domain_error C++ exception. But if the __Policy is to ignore
-the error, or set global ::errno, then a NaN will be returned.
+the error, or set global `::errno`, then a NaN will be returned.

This behaviour is chosen to assist compatibility with the behaviour of
['ISO/IEC 9899:1999 Programming languages - C]
@@ -328,8 +333,8 @@
`T` is the floating-point type passed to the function, `FunctionName` is the
name of the function, `Message` is an error message describing the problem,
Val is the value for which the result is indeterminate, Default is an
-alternative default result that must be returned for ignore_error and
-errno_on_error policies, and __Policy is the current policy in use for the
+alternative default result that must be returned for `ignore_error` and
+`errno_on_erro` policies, and __Policy is the current policy in use for the
function that was called.

The default policy for this function is `ignore_error`: note that this error
@@ -351,8 +356,7 @@
`T` is the floating point type passed to the function, `FunctionName` is the
name of the function, `Message` is an error message describing the problem,
`Val` is the erroneous argument,
-and __Policy is the current policy
-in use for the called function.
+and __Policy is the current policy in use for the called function.

The default behaviour of this function is to throw a `boost::math::rounding_error`.

@@ -384,7 +388,7 @@
[endsect][/section:error_handling Error Handling]

[/
- Copyright 2006 John Maddock and Paul A. Bristow.
+ 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
   http://www.boost.org/LICENSE_1_0.txt).

Modified: branches/release/libs/math/doc/sf_and_dist/fpclassify.qbk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/fpclassify.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/fpclassify.qbk 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -50,7 +50,7 @@
    // it works for any type that has numeric_limits support for type z:
    (isnan)(z);
    //
- // As above but with namespace qualification.
+ // As above but with explicit namespace qualification.
    (boost::math::isnan)(z);
    //
    // This will cause a compiler error if isnan is a native macro:
@@ -58,7 +58,7 @@
    // So always use instead:
    (boost::math::isnan)(z);
    //
- // You can also add a using statment,
+ // You can also add a using statement,
    // globally to a .cpp file, or to a local function in a .hpp file.
    using boost::math::isnan;
    // so you can write the shorter and less cluttered

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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -49,11 +49,11 @@
Thijs van den Berg
</h3></div>
</div></div>
-<div>Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg</div>
+<div>Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg</div>
<div><div class="legalnotice">
-<a name="id970792"></a>
+<a name="id1024313"></a>
 Distributed under the Boost Software License, Version 1.0. (See accompanying
 file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
@@ -80,11 +80,13 @@
<dt> Thread Safety</dt>
<dt> Performance</dt>
<dt><a href="math_toolkit/main_overview/building.html"> If and How to Build
- the Library and its Examples and Tests</a></dt>
+ a Boost.Math Library, and its Examples and Tests</a></dt>
<dt><a href="math_toolkit/main_overview/history1.html"> History and What's
 New</a></dt>
<dt><a href="math_toolkit/main_overview/tr1.html"> C99 and C++ TR1 C-style
 Functions</a></dt>
+<dt><a href="math_toolkit/main_overview/faq.html"> Frequently Asked Questions
+ FAQ</a></dt>
<dt><a href="math_toolkit/main_overview/contact.html"> Contact Info and
 Support</a></dt>
</dl></dd>
@@ -123,6 +125,8 @@
 Binomial Distribution Examples</a></dt>
<dt><a href="math_toolkit/dist/stat_tut/weg/normal_example.html"> Normal
 Distribution Examples</a></dt>
+<dt><a href="math_toolkit/dist/stat_tut/weg/inverse_gamma_eg.html">
+ Inverse Gamma Distribution Bayes Example</a></dt>
<dt><a href="math_toolkit/dist/stat_tut/weg/nccs_eg.html"> Non Central
 Chi Squared Example</a></dt>
<dt><a href="math_toolkit/dist/stat_tut/weg/error_eg.html"> Error Handling
@@ -162,6 +166,10 @@
<dt> F Distribution</dt>
<dt><a href="math_toolkit/dist/dist_ref/dists/gamma_dist.html"> Gamma
 (and Erlang) Distribution</a></dt>
+<dt><a href="math_toolkit/dist/dist_ref/dists/inverse_chi_squared_dist.html">
+ Inverse Chi Squared Distribution</a></dt>
+<dt><a href="math_toolkit/dist/dist_ref/dists/inverse_gamma_dist.html">
+ Inverse Gamma Distribution</a></dt>
<dt><a href="math_toolkit/dist/dist_ref/dists/hypergeometric_dist.html">
 Hypergeometric Distribution</a></dt>
<dt><a href="math_toolkit/dist/dist_ref/dists/laplace_dist.html"> Laplace
@@ -375,6 +383,7 @@
 Without Derivatives</a></dt>
<dt><a href="math_toolkit/toolkit/internals1/minima.html"> Locating Function
 Minima</a></dt>
+<dt> Tuples</dt>
</dl></dd>
<dt> Testing and Development</dt>
<dd><dl>
@@ -430,7 +439,7 @@
<dt><a href="math_toolkit/policy/pol_ref/error_handling_policies.html">
 Error Handling Policies</a></dt>
<dt><a href="math_toolkit/policy/pol_ref/internal_promotion.html"> Internal
- Promotion Policies</a></dt>
+ Floating-point Promotion Policies</a></dt>
<dt><a href="math_toolkit/policy/pol_ref/assert_undefined.html"> Mathematically
 Undefined Function Policies</a></dt>
<dt><a href="math_toolkit/policy/pol_ref/discrete_quant_ref.html"> Discrete
@@ -480,15 +489,15 @@
</dl>
</div>

- ISBN 0-9504833-2-X 978-0-9504833-2-0, Classification 519.2-dc22
 

 This manual is also available in <a href="http://svn.boost.org/svn/boost/sandbox/pdf/math/release/math.pdf" target="_top">printer
- friendly PDF format</a>.
+ friendly PDF format</a>, and as a CD ISBN 0-9504833-2-X 978-0-9504833-2-0,
+ Classification 519.2-dc22.
 
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left">Last revised: August 23, 2010 at 10:23:09 GMT</td>
+<td align="left">Last revised: September 29, 2010 at 17:50:24 GMT</td>
<td align="right"><div class="copyright-footer"></div></td>
</tr></table>
<hr>

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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -33,7 +33,7 @@
 and reflect more the general implementation philosophy used.
 
<a name="math_toolkit.backgrounders.implementation.implemention_philosophy"></a><h5>
-<a name="id1352920"></a>
+<a name="id1414612"></a>
 <a class="link" href="implementation.html#math_toolkit.backgrounders.implementation.implemention_philosophy">Implemention
 philosophy</a>
 </h5>
@@ -85,7 +85,7 @@
 These could still provide sufficient accuracy for some speed-critical applications.
 
<a name="math_toolkit.backgrounders.implementation.accuracy_and_representation_of_test_values"></a><h5>
-<a name="id1352984"></a>
+<a name="id1414676"></a>
 <a class="link" href="implementation.html#math_toolkit.backgrounders.implementation.accuracy_and_representation_of_test_values">Accuracy
 and Representation of Test Values</a>
 </h5>
@@ -130,7 +130,7 @@
 binary value).
 
<a name="math_toolkit.backgrounders.implementation.tolerance_of_tests"></a><h5>
-<a name="id1353128"></a>
+<a name="id1414820"></a>
 <a class="link" href="implementation.html#math_toolkit.backgrounders.implementation.tolerance_of_tests">Tolerance
 of Tests</a>
 </h5>
@@ -156,7 +156,7 @@
 first that the suffix L is present, and then that the tolerance is big enough.
 
<a name="math_toolkit.backgrounders.implementation.handling_unsuitable_arguments"></a><h5>
-<a name="id1353172"></a>
+<a name="id1414864"></a>
 <a class="link" href="implementation.html#math_toolkit.backgrounders.implementation.handling_unsuitable_arguments">Handling
 Unsuitable Arguments</a>
 </h5>
@@ -224,14 +224,14 @@
 </td></tr>
</table></div>
<a name="math_toolkit.backgrounders.implementation.handling_of_functions_that_are_not_mathematically_defined"></a><h5>
-<a name="id1353302"></a>
+<a name="id1414994"></a>
 <a class="link" href="implementation.html#math_toolkit.backgrounders.implementation.handling_of_functions_that_are_not_mathematically_defined">Handling
 of Functions that are Not Mathematically defined</a>
 </h5>

 Functions that are not mathematically defined, like the Cauchy mean, fail
- to compile by default. <a class="link" href="../policy/pol_ref/assert_undefined.html" title="Mathematically Undefined Function Policies">A
- policy</a> allows control of this.
+ to compile by default. A <a class="link" href="../policy/pol_ref/assert_undefined.html" title="Mathematically Undefined Function Policies">policy</a>
+ allows control of this.
 

 If the policy is to permit undefined functions, then calling them throws
@@ -258,7 +258,7 @@
 </td></tr>
</table></div>
<a name="math_toolkit.backgrounders.implementation.median_of_distributions"></a><h5>
-<a name="id1353387"></a>
+<a name="id1415079"></a>
 <a class="link" href="implementation.html#math_toolkit.backgrounders.implementation.median_of_distributions">Median
 of distributions</a>
 </h5>
@@ -268,11 +268,13 @@
 functions</a>, the mid-point in a list of values.
 

- However a useful median approximation for distribution <code class="computeroutput">dist</code>
- may be available from
+ However a useful numerical approximation for distribution <code class="computeroutput">dist</code>
+ is available as usual as an accessor non-member function median using <code class="computeroutput">median(dist)</code>,
+ that may be evaluated (in the absence of an analytic formula) by calling
 

- <code class="computeroutput">quantile(dist, 0.5)</code>.
+ <code class="computeroutput">quantile(dist, 0.5)</code> (this
+ is the mathematical definition of course).
 

 <a href="http://www.amstat.org/publications/jse/v13n2/vonhippel.html" target="_top">Mean,
@@ -291,7 +293,7 @@
 Basic Statistics.</a> give more detail, in particular for discrete distributions.
 
<a name="math_toolkit.backgrounders.implementation.handling_of_floating_point_infinity"></a><h5>
-<a name="id1353484"></a>
+<a name="id1415198"></a>
 <a class="link" href="implementation.html#math_toolkit.backgrounders.implementation.handling_of_floating_point_infinity">Handling
 of Floating-Point Infinity</a>
 </h5>
@@ -335,7 +337,7 @@
 handling policies</a>.
 
<a name="math_toolkit.backgrounders.implementation.scale__shape_and_location"></a><h5>
-<a name="id1353571"></a>
+<a name="id1415284"></a>
 <a class="link" href="implementation.html#math_toolkit.backgrounders.implementation.scale__shape_and_location">Scale,
 Shape and Location</a>
 </h5>
@@ -362,7 +364,7 @@
 functions, they can be added if required.
 
<a name="math_toolkit.backgrounders.implementation.notes_on_implementation_of_specific_functions__amp__distributions"></a><h5>
-<a name="id1353906"></a>
+<a name="id1417311"></a>
 <a class="link" href="implementation.html#math_toolkit.backgrounders.implementation.notes_on_implementation_of_specific_functions__amp__distributions">Notes
 on Implementation of Specific Functions & Distributions</a>
 </h5>
@@ -374,7 +376,7 @@
 lower = -1, mode = 0 and upper = 1 would be more suitable.
 </li></ul></div>
<a name="math_toolkit.backgrounders.implementation.rational_approximations_used"></a><h5>
-<a name="id1353930"></a>
+<a name="id1417335"></a>
 <a class="link" href="implementation.html#math_toolkit.backgrounders.implementation.rational_approximations_used">Rational
 Approximations Used</a>
 </h5>
@@ -417,7 +419,7 @@
 to the "true" minimax solution.
 
<a name="math_toolkit.backgrounders.implementation.representation_of_mathematical_constants"></a><h5>
-<a name="id1353974"></a>
+<a name="id1417379"></a>
 <a class="link" href="implementation.html#math_toolkit.backgrounders.implementation.representation_of_mathematical_constants">Representation
 of Mathematical Constants</a>
 </h5>
@@ -478,7 +480,7 @@
double p = boost::math::constants::pi(); // Context does not allow for disambiguation of overloaded function
</pre>
<a name="math_toolkit.backgrounders.implementation.thread_safety"></a><h5>
-<a name="id1354546"></a>
+<a name="id1417766"></a>
 <a class="link" href="implementation.html#math_toolkit.backgrounders.implementation.thread_safety">Thread
 safety</a>
 </h5>
@@ -503,7 +505,7 @@
 the right thing here at some point.
 
<a name="math_toolkit.backgrounders.implementation.sources_of_test_data"></a><h5>
-<a name="id1354582"></a>
+<a name="id1417802"></a>
 <a class="link" href="implementation.html#math_toolkit.backgrounders.implementation.sources_of_test_data">Sources
 of Test Data</a>
 </h5>
@@ -514,7 +516,10 @@
 in the case of serious disagreement. The accuracy, actual and claimed, vary
 very widely. Only <a href="http://functions.wolfram.com/" target="_top">Wolfram Mathematica
 functions</a> provided a higher accuracy than C++ double (64-bit floating-point)
- and was regarded as the most-trusted source by far.
+ and was regarded as the most-trusted source by far. The <a href="http://www.r-project.org/" target="_top">The
+ R Project for Statistical Computing</a> 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.
 

 A useful index of sources is: <a href="http://www.sal.hut.fi/Teaching/Resources/ProbStat/table.html" target="_top">Web-oriented
@@ -541,11 +546,19 @@
 the underlying special function is known to be difficult to implement.
 
<a name="math_toolkit.backgrounders.implementation.creating_and_managing_the_equations"></a><h5>
-<a name="id1354646"></a>
+<a name="id1417870"></a>
 <a class="link" href="implementation.html#math_toolkit.backgrounders.implementation.creating_and_managing_the_equations">Creating
 and Managing the Equations</a>
 </h5>

+ Equations that fit on a single line can most easily be produced by inline
+ Quickbook code using templates for Unicode Greek and Unicode Math symbols.
+ All Greek letter and small set of Math symbols is available at /boost-path/libs/math/doc/sf_and_dist/html4_symbols.qbk
+ 
+
+ Where equations need to use more than one line, real Math editors were used.
+ 
+
 The primary source for the equations is now MathML:
 see the *.mml files in libs/math/doc/sf_and_dist/equations/.
 
@@ -555,7 +568,7 @@
 mangles these files and should not currently be used.
 

- Convertion to SVG was achieved using SVGMath
+ Conversion to SVG was achieved using SVGMath
 and a command line such as:
 
<pre class="programlisting">$for file in *.mml; do
@@ -564,6 +577,11 @@
>done
</pre>

+ See also the section on "Using Python to run Inkscape" and "Using
+ inkscape to convert scalable vector SVG files to Portable Network graphic
+ PNG".
+ 
+
 Note that SVGMath requires that the mml files are not
 wrapped in an XHTML XML wrapper - this is added by Mathcast by default -
 one workaround is to copy an existing mml file and then edit it with Mathcast:
@@ -713,7 +731,7 @@
 HTML: this needs further investigation.
 
<a name="math_toolkit.backgrounders.implementation.producing_graphs"></a><h5>
-<a name="id1354892"></a>
+<a name="id1418127"></a>
 <a class="link" href="implementation.html#math_toolkit.backgrounders.implementation.producing_graphs">Producing
 Graphs</a>
 </h5>
@@ -722,17 +740,19 @@
 same process as the equations.
 

- 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 <a href="http://code.google.com/soc/2007/boost/about.html" target="_top">Google
- Summer of Code 2007</a> project of Jacob Voytko (whose work so far is
- at .\boost-sandbox\SOC\2007\visualization).
+ The programs <code class="computeroutput">/libs/math/doc/sf_and_dist/graphs/dist_graphs.cpp</code> and
+ <code class="computeroutput">/libs/math/doc/sf_and_dist/graphs/sf_graphs.cpp</code> generate
+ the SVG's directly using the <a href="http://code.google.com/soc/2007/boost/about.html" target="_top">Google
+ Summer of Code 2007</a> project of Jacob Voytko (whose work so far, considerably
+ enhanced and now reasonably mature and usable, by Paul A. Bristow, is at
+ .\boost-sandbox\SOC\2007\visualization).
 
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -27,7 +27,7 @@
<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>
<a name="math_toolkit.backgrounders.lanczos.motivation"></a><h5>
-<a name="id1355116"></a>
+<a name="id1418459"></a>
 <a class="link" href="lanczos.html#math_toolkit.backgrounders.lanczos.motivation">Motivation</a>
 </h5>

@@ -99,7 +99,7 @@
 functions divided by large powers into single (simpler) expressions.
 
<a name="math_toolkit.backgrounders.lanczos.the_approximation"></a><h5>
-<a name="id1355374"></a>
+<a name="id1418717"></a>
 <a class="link" href="lanczos.html#math_toolkit.backgrounders.lanczos.the_approximation">The
 Approximation</a>
 </h5>
@@ -161,7 +161,7 @@
 </td></tr>
</table></div>
<a name="math_toolkit.backgrounders.lanczos.computing_the_coefficients"></a><h5>
-<a name="id1355566"></a>
+<a name="id1418909"></a>
 <a class="link" href="lanczos.html#math_toolkit.backgrounders.lanczos.computing_the_coefficients">Computing
 the Coefficients</a>
 </h5>
@@ -205,7 +205,7 @@
 multiplied by F as the last step.
 
<a name="math_toolkit.backgrounders.lanczos.choosing_the_right_parameters"></a><h5>
-<a name="id1355723"></a>
+<a name="id1419066"></a>
 <a class="link" href="lanczos.html#math_toolkit.backgrounders.lanczos.choosing_the_right_parameters">Choosing
 the Right Parameters</a>
 </h5>
@@ -229,7 +229,7 @@
 computing to float precision with double precision arithmetic.
 
<div class="table">
-<a name="id1355777"></a>Table 53. Optimal choices for N and g when computing with guard digits (source:
+<a name="math_toolkit.backgrounders.lanczos.optimal_choices_for_n_and_g_when_computing_with_guard_digits__source__pugh_"></a>Table 53. Optimal choices for N and g when computing with guard digits (source:
 Pugh)
<div class="table-contents"><table class="table" summary="Optimal choices for N and g when computing with guard digits (source:
 Pugh)">
@@ -372,7 +372,7 @@
 exactly matches the machine epsilon for the type in question.
 
<div class="table">
-<a name="id1355999"></a>Table 54. Optimum value for N and g when computing at fixed precision
+<a name="math_toolkit.backgrounders.lanczos.optimum_value_for_n_and_g_when_computing_at_fixed_precision"></a>Table 54. Optimum value for N and g when computing at fixed precision
<div class="table-contents"><table class="table" summary="Optimum value for N and g when computing at fixed precision">
<colgroup>
<col>
@@ -535,7 +535,7 @@
 is exact, and so isn't used for the gamma function.
 
<a name="math_toolkit.backgrounders.lanczos.references"></a><h5>
-<a name="id1356260"></a>
+<a name="id1421249"></a>
 <a class="link" href="lanczos.html#math_toolkit.backgrounders.lanczos.references">References</a>
 </h5>
<a name="godfrey"></a><a name="pugh"></a><div class="orderedlist"><ol type="1">
@@ -560,9 +560,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -27,7 +27,7 @@
<a name="math_toolkit.backgrounders.refs"></a><a class="link" href="refs.html" title="References"> References</a>
</h3></div></div></div>
<a name="math_toolkit.backgrounders.refs.general_references"></a><h5>
-<a name="id1357538"></a>
+<a name="id1422173"></a>
 <a class="link" href="refs.html#math_toolkit.backgrounders.refs.general_references">General
 references</a>
 </h5>
@@ -75,8 +75,8 @@
 Wiley 2000.
 

- <a href="http://www.worldscibooks.com/mathematics/p191.html" target="_top">EXTREME VALUE
- DISTRIBUTIONS, Theory and Applications</a> Samuel Kotz & Saralees
+ <a href="http://www.worldscibooks.com/mathematics/p191.html" target="_top">Extreme Value
+ Distributions, Theory and Applications</a> Samuel Kotz & Saralees
 Nadarajah, ISBN 978-1-86094-224-2 & 1-86094-224-5 Oct 2000, Chapter 1.2
 discusses the various extreme value distributions.
 
@@ -91,7 +91,7 @@
 Library (version 2), Walter E. Brown</a>
 
<a name="math_toolkit.backgrounders.refs.calculators__that_we_found__and_used_to_cross_check___as_far_as_their_widely_varying_accuracy_allowed__"></a><h5>
-<a name="id1357634"></a>
+<a name="id1422269"></a>
 <a class="link" href="refs.html#math_toolkit.backgrounders.refs.calculators__that_we_found__and_used_to_cross_check___as_far_as_their_widely_varying_accuracy_allowed__">Calculators*
 that we found (and used to cross-check - as far as their widely-varying accuracy
 allowed).</a>
@@ -101,7 +101,7 @@
 Binomial Probability Distribution Calculator.
 
<a name="math_toolkit.backgrounders.refs.other_libraries"></a><h5>
-<a name="id1357660"></a>
+<a name="id1422295"></a>
 <a class="link" href="refs.html#math_toolkit.backgrounders.refs.other_libraries">Other Libraries</a>
 </h5>

@@ -133,7 +133,8 @@
 <a href="http://www.softintegration.com/docs/package/chnagstat/" target="_top">http://www.softintegration.com/docs/package class="emphasis">chnagstat</a>
 

- NAG libraries.
+ NAG
+ libraries.
 

 <a href="http://www.mathcad.com" target="_top">MathCAD</a>
@@ -158,12 +159,36 @@
 <a href="http://www.cas.lancs.ac.uk/glossary_v1.1/prob.html#probdistn" target="_top">Statistics
 Glossary</a>, Valerie Easton and John H. McColl.
 
+
+ _R R Development Core Team (2010).
+ R: A language and environment for statistical computing. R Foundation for
+ Statistical Computing, Vienna, Austria. ISBN 3-900051-07-0, URL http://www.R-project.org.
+ 
+
+ For use of R, see:
+ 
+
+ Jim Albert, Bayesian Computation with R, ISBN 978-0-387-71384-7.
+ 
+
+ <a href="http://www.quantnet.com/cplusplus-statistical-distributions-boost" target="_top">C++
+ Statistical Distributions in Boost - QuantNetwork forum</a> discusses
+ using Boost.Math in finance.
+ 
+
+ <a href="http://www.quantnet.com/boost-and-computational-finance/" target="_top">Quantnet
+ Boost and computational finance</a>. Robert Demming & Daniel J. Duffy,
+ Introduction to the C++ Boost Libraries - Volume I - Foundations and Volume
+ II ISBN 978-94-91028-01-4, Advanced Libraries and Applications, ISBN 978-94-91028-02-1
+ (to be published in 2011). discusses application of Boost.Math, especially
+ in finance.]
+ 
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -81,7 +81,7 @@
<a name="zero_error"></a>
 
<a name="math_toolkit.backgrounders.relative_error.the_impossibility_of_zero_error"></a><h5>
-<a name="id1355073"></a>
+<a name="id1418416"></a>
 <a class="link" href="relative_error.html#math_toolkit.backgrounders.relative_error.the_impossibility_of_zero_error">The
 Impossibility of Zero Error</a>
 </h5>
@@ -109,9 +109,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -94,7 +94,7 @@
 are located!
 
<a name="math_toolkit.backgrounders.remez.the_remez_method"></a><h5>
-<a name="id1356444"></a>
+<a name="id1421434"></a>
 <a class="link" href="remez.html#math_toolkit.backgrounders.remez.the_remez_method">The Remez
 Method</a>
 </h5>
@@ -105,7 +105,7 @@
 

 In the following discussion we'll use a concrete example to illustrate the
- Remez method: an approximation to the function ex over the range [-1, 1].
+ Remez method: an approximation to the function ex over the range [-1, 1].
 

 Before we can begin the Remez method, we must obtain an initial value for
@@ -174,7 +174,7 @@
</td></tr>
</table></div>
<a name="math_toolkit.backgrounders.remez.remez_step_1"></a><h5>
-<a name="id1356950"></a>
+<a name="id1421585"></a>
 <a class="link" href="remez.html#math_toolkit.backgrounders.remez.remez_step_1">Remez Step
 1</a>
 </h5>
@@ -205,7 +205,7 @@
 to 5.6x10-4.
 
<a name="math_toolkit.backgrounders.remez.remez_step_2"></a><h5>
-<a name="id1357025"></a>
+<a name="id1421660"></a>
 <a class="link" href="remez.html#math_toolkit.backgrounders.remez.remez_step_2">Remez Step
 2</a>
 </h5>
@@ -234,7 +234,7 @@
 In our example we perform multi-point exchange.
 
<a name="math_toolkit.backgrounders.remez.iteration"></a><h5>
-<a name="id1357057"></a>
+<a name="id1421692"></a>
 <a class="link" href="remez.html#math_toolkit.backgrounders.remez.iteration">Iteration</a>
 </h5>

@@ -250,7 +250,7 @@
 <img src="../../../graphs/remez-4.png" alt="remez-4">
 
<a name="math_toolkit.backgrounders.remez.rational_approximations"></a><h5>
-<a name="id1357102"></a>
+<a name="id1421737"></a>
 <a class="link" href="remez.html#math_toolkit.backgrounders.remez.rational_approximations">Rational
 Approximations</a>
 </h5>
@@ -299,7 +299,7 @@
 number of terms overall.
 
<a name="math_toolkit.backgrounders.remez.practical_considerations"></a><h5>
-<a name="id1357181"></a>
+<a name="id1421816"></a>
 <a class="link" href="remez.html#math_toolkit.backgrounders.remez.practical_considerations">Practical
 Considerations</a>
 </h5>
@@ -388,7 +388,7 @@
 a positive power less than one will skew them towards either end. More usefully,
 if we initially rescale the points over [0,1] and then raise to a positive
 power, we can skew them to the left or right. Returning to our example of
- ex over [-1,1], the initial interpolated form was some way from the minimax
+ ex over [-1,1], the initial interpolated form was some way from the minimax
 solution:
 

@@ -397,7 +397,7 @@

 However, if we first skew the interpolation points to the left (rescale them
 to [0, 1], raise to the power 1.3, and then rescale back to [-1,1]) we reduce
- the error from 1.3x10-3to 6x10-4:
+ the error from 1.3x10-3 to 6x10-4:
 

 <img src="../../../graphs/remez-5.png" alt="remez-5">
@@ -407,7 +407,7 @@
 desired minimax solution (5x10-4).
 
<a name="math_toolkit.backgrounders.remez.remez_method_checklist"></a><h5>
-<a name="id1357337"></a>
+<a name="id1421972"></a>
 <a class="link" href="remez.html#math_toolkit.backgrounders.remez.remez_method_checklist">Remez
 Method Checklist</a>
 </h5>
@@ -461,7 +461,7 @@
 </li>
</ul></div>
<a name="math_toolkit.backgrounders.remez.references"></a><h5>
-<a name="id1357418"></a>
+<a name="id1422053"></a>
 <a class="link" href="remez.html#math_toolkit.backgrounders.remez.references">References</a>
 </h5>

@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -106,6 +106,8 @@
 Distribution Examples</a></dt>
<dd><dl><dt><a href="dist/stat_tut/weg/normal_example/normal_misc.html">
 Some Miscellaneous Examples of the Normal (Gaussian) Distribution</a></dt></dl></dd>
+<dt><a href="dist/stat_tut/weg/inverse_gamma_eg.html">
+ Inverse Gamma Distribution Bayes Example</a></dt>
<dt><a href="dist/stat_tut/weg/nccs_eg.html"> Non Central
 Chi Squared Example</a></dt>
<dd><dl><dt><a href="dist/stat_tut/weg/nccs_eg/nccs_power_eg.html">
@@ -155,6 +157,10 @@
<dt> F Distribution</dt>
<dt><a href="dist/dist_ref/dists/gamma_dist.html"> Gamma
 (and Erlang) Distribution</a></dt>
+<dt><a href="dist/dist_ref/dists/inverse_chi_squared_dist.html">
+ Inverse Chi Squared Distribution</a></dt>
+<dt><a href="dist/dist_ref/dists/inverse_gamma_dist.html">
+ Inverse Gamma Distribution</a></dt>
<dt><a href="dist/dist_ref/dists/hypergeometric_dist.html">
 Hypergeometric Distribution</a></dt>
<dt><a href="dist/dist_ref/dists/laplace_dist.html"> Laplace
@@ -198,9 +204,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -48,6 +48,10 @@
<dt> F Distribution</dt>
<dt><a href="dist_ref/dists/gamma_dist.html"> Gamma
 (and Erlang) Distribution</a></dt>
+<dt><a href="dist_ref/dists/inverse_chi_squared_dist.html">
+ Inverse Chi Squared Distribution</a></dt>
+<dt><a href="dist_ref/dists/inverse_gamma_dist.html">
+ Inverse Gamma Distribution</a></dt>
<dt><a href="dist_ref/dists/hypergeometric_dist.html">
 Hypergeometric Distribution</a></dt>
<dt><a href="dist_ref/dists/laplace_dist.html"> Laplace
@@ -89,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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -28,7 +28,7 @@
 Algorithms</a>
</h4></div></div></div>
<a name="math_toolkit.dist.dist_ref.dist_algorithms.finding_the_location_and_scale_for_normal_and_similar_distributions"></a><h5>
-<a name="id1134521"></a>
+<a name="id1191991"></a>
 <a class="link" href="dist_algorithms.html#math_toolkit.dist.dist_ref.dist_algorithms.finding_the_location_and_scale_for_normal_and_similar_distributions">Finding
 the Location and Scale for Normal and similar distributions</a>
 </h5>
@@ -50,7 +50,7 @@
using boost::math::complement; // Will be needed by users who want to use complements.
</pre>
<a name="math_toolkit.dist.dist_ref.dist_algorithms.find_location_function"></a><h5>
-<a name="id1134620"></a>
+<a name="id1192089"></a>
 <a class="link" href="dist_algorithms.html#math_toolkit.dist.dist_ref.dist_algorithms.find_location_function">find_location
 function</a>
 </h5>
@@ -80,7 +80,7 @@
 }} // namespaces
</pre>
<a name="math_toolkit.dist.dist_ref.dist_algorithms.find_scale_function"></a><h5>
-<a name="id1135065"></a>
+<a name="id1194387"></a>
 <a class="link" href="dist_algorithms.html#math_toolkit.dist.dist_ref.dist_algorithms.find_scale_function">find_scale
 function</a>
 </h5>
@@ -130,9 +130,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -44,6 +44,10 @@
<dt> F Distribution</dt>
<dt><a href="dists/gamma_dist.html"> Gamma
 (and Erlang) Distribution</a></dt>
+<dt><a href="dists/inverse_chi_squared_dist.html">
+ Inverse Chi Squared Distribution</a></dt>
+<dt><a href="dists/inverse_gamma_dist.html">
+ Inverse Gamma Distribution</a></dt>
<dt><a href="dists/hypergeometric_dist.html">
 Hypergeometric Distribution</a></dt>
<dt><a href="dists/laplace_dist.html"> Laplace
@@ -82,9 +86,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -87,7 +87,7 @@
 <img src="../../../../../graphs/bernoulli_cdf.png" align="middle">
 
<a name="math_toolkit.dist.dist_ref.dists.bernoulli_dist.member_functions"></a><h5>
-<a name="id1081917"></a>
+<a name="id1137850"></a>
 <a class="link" href="bernoulli_dist.html#math_toolkit.dist.dist_ref.dists.bernoulli_dist.member_functions">Member
 Functions</a>
 </h5>
@@ -103,7 +103,7 @@
 Returns the success_fraction parameter of this distribution.
 
<a name="math_toolkit.dist.dist_ref.dists.bernoulli_dist.non_member_accessors"></a><h5>
-<a name="id1081995"></a>
+<a name="id1137928"></a>
 <a class="link" href="bernoulli_dist.html#math_toolkit.dist.dist_ref.dists.bernoulli_dist.non_member_accessors">Non-member
 Accessors</a>
 </h5>
@@ -128,7 +128,7 @@
 exception and make an error message available.
 
<a name="math_toolkit.dist.dist_ref.dists.bernoulli_dist.accuracy"></a><h5>
-<a name="id1082098"></a>
+<a name="id1138031"></a>
 <a class="link" href="bernoulli_dist.html#math_toolkit.dist.dist_ref.dists.bernoulli_dist.accuracy">Accuracy</a>
 </h5>

@@ -136,7 +136,7 @@
 and so should have errors within an epsilon or two.
 
<a name="math_toolkit.dist.dist_ref.dists.bernoulli_dist.implementation"></a><h5>
-<a name="id1082120"></a>
+<a name="id1138053"></a>
 <a class="link" href="bernoulli_dist.html#math_toolkit.dist.dist_ref.dists.bernoulli_dist.implementation">Implementation</a>
 </h5>

@@ -327,7 +327,7 @@
</tbody>
</table></div>
<a name="math_toolkit.dist.dist_ref.dists.bernoulli_dist.references"></a><h5>
-<a name="id1082449"></a>
+<a name="id1138382"></a>
 <a class="link" href="bernoulli_dist.html#math_toolkit.dist.dist_ref.dists.bernoulli_dist.references">References</a>
 </h5>
<div class="itemizedlist"><ul type="disc">
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -125,20 +125,19 @@
 <img src="../../../../../graphs/beta_pdf.png" align="middle">
 

- If α = β = 1, then it is a 
-<a href="http://en.wikipedia.org/wiki/Uniform_distribution_%28continuous%29" target="_top">uniform
+ If α = β = 1, then it is a __space <a href="http://en.wikipedia.org/wiki/Uniform_distribution_%28continuous%29" target="_top">uniform
 distribution</a>, equal to unity in the entire interval x = 0 to
- 1. If α and β are < 1, then the pdf is U-shaped. If α != β, then the shape
- is asymmetric and could be approximated by a triangle whose apex is away
- from the centre (where x = half).
+ 1. If α __space and β __space are < 1, then the pdf is U-shaped. If α !=
+ β, then the shape is asymmetric and could be approximated by a triangle
+ whose apex is away from the centre (where x = half).
 
<a name="math_toolkit.dist.dist_ref.dists.beta_dist.member_functions"></a><h5>
-<a name="id1084361"></a>
+<a name="id1139196"></a>
 <a class="link" href="beta_dist.html#math_toolkit.dist.dist_ref.dists.beta_dist.member_functions">Member
 Functions</a>
 </h5>
<a name="math_toolkit.dist.dist_ref.dists.beta_dist.constructor"></a><h6>
-<a name="id1084376"></a>
+<a name="id1139212"></a>
 <a class="link" href="beta_dist.html#math_toolkit.dist.dist_ref.dists.beta_dist.constructor">Constructor</a>
 </h6>
<pre class="programlisting">beta_distribution(RealType alpha, RealType beta);
@@ -165,7 +164,7 @@
 yellow in the graph above).
 
<a name="math_toolkit.dist.dist_ref.dists.beta_dist.parameter_accessors"></a><h6>
-<a name="id1084492"></a>
+<a name="id1139327"></a>
 <a class="link" href="beta_dist.html#math_toolkit.dist.dist_ref.dists.beta_dist.parameter_accessors">Parameter
 Accessors</a>
 </h6>
@@ -189,7 +188,7 @@
assert(mybeta.beta() == 5.); // mybeta.beta() returns 5
</pre>
<a name="math_toolkit.dist.dist_ref.dists.beta_dist.parameter_estimators"></a><h5>
-<a name="id1084693"></a>
+<a name="id1139529"></a>
 <a class="link" href="beta_dist.html#math_toolkit.dist.dist_ref.dists.beta_dist.parameter_estimators">Parameter
 Estimators</a>
 </h5>
@@ -197,15 +196,15 @@
 Two pairs of parameter estimators are provided.
 

- One estimates either α or β 
-from presumed-known mean and variance.
+ One estimates either α __space or β __space from presumed-known mean and
+ variance.
 

- The other pair estimates either α or β from the cdf and x.
+ The other pair estimates either α __space or β __space from the cdf and x.
 

- It is also possible to estimate α and β from 'known' mode & quantile.
- For example, calculators are provided by the <a href="http://www.ausvet.com.au/pprev/content.php?page=PPscript" target="_top">Pooled
+ It is also possible to estimate α __space and β __space from 'known' mode
+ & quantile. For example, calculators are provided by the <a href="http://www.ausvet.com.au/pprev/content.php?page=PPscript" target="_top">Pooled
 Prevalence Calculator</a> and <a href="http://www.epi.ucdavis.edu/diagnostictests/betabuster.html" target="_top">Beta
 Buster</a> but this is not yet implemented here.
 
@@ -214,7 +213,7 @@
 RealType variance); // Expected value of variance.
</pre>

- Returns the unique value of α that corresponds to a beta distribution with
+ Returns the unique value of α that corresponds to a beta distribution with
 mean mean and variance variance.
 
<pre class="programlisting">static RealType find_beta(
@@ -222,7 +221,7 @@
 RealType variance); // Expected value of variance.
</pre>

- Returns the unique value of β that corresponds to a beta distribution with
+ Returns the unique value of β that corresponds to a beta distribution with
 mean mean and variance variance.
 
<pre class="programlisting">static RealType find_alpha(
@@ -231,7 +230,7 @@
 RealType probability); // probability cdf
</pre>

- Returns the value of α that gives: <code class="computeroutput">cdf(beta_distribution<RealType>(alpha, beta), x) == probability</code>.
+ Returns the value of α that gives: <code class="computeroutput">cdf(beta_distribution<RealType>(alpha, beta), x) == probability</code>.
 
<pre class="programlisting">static RealType find_beta(
 RealType alpha, // alpha.
@@ -239,10 +238,10 @@
 RealType probability); // probability cdf.
</pre>

- Returns the value of β that gives: <code class="computeroutput">cdf(beta_distribution<RealType>(alpha, beta), x) == probability</code>.
+ Returns the value of β that gives: <code class="computeroutput">cdf(beta_distribution<RealType>(alpha, beta), x) == probability</code>.
 
<a name="math_toolkit.dist.dist_ref.dists.beta_dist.non_member_accessor_functions"></a><h5>
-<a name="id1085143"></a>
+<a name="id1140700"></a>
 <a class="link" href="beta_dist.html#math_toolkit.dist.dist_ref.dists.beta_dist.non_member_accessor_functions">Non-member
 Accessor Functions</a>
 </h5>
@@ -264,7 +263,7 @@
 Mathworld</a>.
 
<a name="math_toolkit.dist.dist_ref.dists.beta_dist.applications"></a><h5>
-<a name="id1085245"></a>
+<a name="id1140802"></a>
 <a class="link" href="beta_dist.html#math_toolkit.dist.dist_ref.dists.beta_dist.applications">Applications</a>
 </h5>

@@ -277,12 +276,12 @@
 statistical inference</a>.
 
<a name="math_toolkit.dist.dist_ref.dists.beta_dist.related_distributions"></a><h5>
-<a name="id1085270"></a>
+<a name="id1140827"></a>
 <a class="link" href="beta_dist.html#math_toolkit.dist.dist_ref.dists.beta_dist.related_distributions">Related
 distributions</a>
 </h5>

- The beta distribution with both α and β = 1 follows a <a href="http://en.wikipedia.org/wiki/Uniform_distribution_%28continuous%29" target="_top">uniform
+ The beta distribution with both α __space and β = 1 follows a <a href="http://en.wikipedia.org/wiki/Uniform_distribution_%28continuous%29" target="_top">uniform
 distribution</a>.
 

@@ -291,19 +290,20 @@
 

 The <a href="http://en.wikipedia.org/wiki/Binomial_distribution" target="_top">binomial
- distribution</a> is closely related when α and β are integers.
+ distribution</a> is closely related when α __space and β __space are
+ integers.
 

- With integer values of α and β the distribution B(i, j) is that of the j-th
- highest of a sample of i + j + 1 independent random variables uniformly
- distributed between 0 and 1. The cumulative probability from 0 to x is
- thus the probability that the j-th highest value is less than x. Or it
- is the probability that that at least i of the random variables are less
- than x, a probability given by summing over the <a class="link" href="binomial_dist.html" title="Binomial Distribution">Binomial
+ With integer values of α __space and β __space the distribution B(i, j) is
+ that of the j-th highest of a sample of i + j + 1 independent random
+ variables uniformly distributed between 0 and 1. The cumulative probability
+ from 0 to x is thus the probability that the j-th highest value is less
+ than x. Or it is the probability that that at least i of the random variables
+ are less than x, a probability given by summing over the <a class="link" href="binomial_dist.html" title="Binomial Distribution">Binomial
 Distribution</a> with its p parameter set to x.
 
<a name="math_toolkit.dist.dist_ref.dists.beta_dist.accuracy"></a><h5>
-<a name="id1085317"></a>
+<a name="id1140874"></a>
 <a class="link" href="beta_dist.html#math_toolkit.dist.dist_ref.dists.beta_dist.accuracy">Accuracy</a>
 </h5>

@@ -315,12 +315,12 @@
 please refer to these functions for information on accuracy.
 
<a name="math_toolkit.dist.dist_ref.dists.beta_dist.implementation"></a><h5>
-<a name="id1085362"></a>
+<a name="id1140918"></a>
 <a class="link" href="beta_dist.html#math_toolkit.dist.dist_ref.dists.beta_dist.implementation">Implementation</a>
 </h5>

 In the following table a and b
- are the parameters α and β, x is the random variable,
+ are the parameters α and β, x is the random variable,
 p is the probability and q = 1-p.
 
<div class="informaltable"><table class="table">
@@ -596,7 +596,7 @@
</tbody>
</table></div>
<a name="math_toolkit.dist.dist_ref.dists.beta_dist.references"></a><h5>
-<a name="id1086984"></a>
+<a name="id1141946"></a>
 <a class="link" href="beta_dist.html#math_toolkit.dist.dist_ref.dists.beta_dist.references">References</a>
 </h5>

@@ -614,9 +614,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -167,12 +167,12 @@

 
<a name="math_toolkit.dist.dist_ref.dists.binomial_dist.member_functions"></a><h5>
-<a name="id1087935"></a>
+<a name="id1143044"></a>
 <a class="link" href="binomial_dist.html#math_toolkit.dist.dist_ref.dists.binomial_dist.member_functions">Member
 Functions</a>
 </h5>
<a name="math_toolkit.dist.dist_ref.dists.binomial_dist.construct"></a><h6>
-<a name="id1087953"></a>
+<a name="id1143062"></a>
 <a class="link" href="binomial_dist.html#math_toolkit.dist.dist_ref.dists.binomial_dist.construct">Construct</a>
 </h6>
<pre class="programlisting">binomial_distribution(RealType n, RealType p);
@@ -189,7 +189,7 @@
 otherwise calls <a class="link" href="../../../main_overview/error_handling.html#domain_error">domain_error</a>.
 
<a name="math_toolkit.dist.dist_ref.dists.binomial_dist.accessors"></a><h6>
-<a name="id1088070"></a>
+<a name="id1143180"></a>
 <a class="link" href="binomial_dist.html#math_toolkit.dist.dist_ref.dists.binomial_dist.accessors">Accessors</a>
 </h6>
<pre class="programlisting">RealType success_fraction() const;
@@ -205,7 +205,7 @@
 was constructed.
 
<a name="math_toolkit.dist.dist_ref.dists.binomial_dist.lower_bound_on_the_success_fraction"></a><h6>
-<a name="id1088151"></a>
+<a name="id1143260"></a>
 <a class="link" href="binomial_dist.html#math_toolkit.dist.dist_ref.dists.binomial_dist.lower_bound_on_the_success_fraction">Lower
 Bound on the Success Fraction</a>
 </h6>
@@ -311,7 +311,7 @@
 limits illustrated in the case of the binomial. Biometrika 26 404-413.
 
<a name="math_toolkit.dist.dist_ref.dists.binomial_dist.upper_bound_on_the_success_fraction"></a><h6>
-<a name="id1088604"></a>
+<a name="id1143714"></a>
 <a class="link" href="binomial_dist.html#math_toolkit.dist.dist_ref.dists.binomial_dist.upper_bound_on_the_success_fraction">Upper
 Bound on the Success Fraction</a>
 </h6>
@@ -389,7 +389,7 @@
</td></tr>
</table></div>
<a name="math_toolkit.dist.dist_ref.dists.binomial_dist.estimating_the_number_of_trials_required_for_a_certain_number_of_successes"></a><h6>
-<a name="id1089290"></a>
+<a name="id1144030"></a>
 <a class="link" href="binomial_dist.html#math_toolkit.dist.dist_ref.dists.binomial_dist.estimating_the_number_of_trials_required_for_a_certain_number_of_successes">Estimating
 the Number of Trials Required for a Certain Number of Successes</a>
 </h6>
@@ -431,7 +431,7 @@
 of seeing 10 events that occur with frequency one half.
 
<a name="math_toolkit.dist.dist_ref.dists.binomial_dist.estimating_the_maximum_number_of_trials_to_ensure_no_more_than_a_certain_number_of_successes"></a><h6>
-<a name="id1089491"></a>
+<a name="id1144231"></a>
 <a class="link" href="binomial_dist.html#math_toolkit.dist.dist_ref.dists.binomial_dist.estimating_the_maximum_number_of_trials_to_ensure_no_more_than_a_certain_number_of_successes">Estimating
 the Maximum Number of Trials to Ensure no more than a Certain Number
 of Successes</a>
@@ -479,7 +479,7 @@
 Worked Example.</a>
 
<a name="math_toolkit.dist.dist_ref.dists.binomial_dist.non_member_accessors"></a><h5>
-<a name="id1089701"></a>
+<a name="id1144441"></a>
 <a class="link" href="binomial_dist.html#math_toolkit.dist.dist_ref.dists.binomial_dist.non_member_accessors">Non-member
 Accessors</a>
 </h5>
@@ -504,7 +504,7 @@
 in the context of this distribution:
 
<div class="table">
-<a name="id1089833"></a>Table 11. Meaning of the non-member accessors
+<a name="math_toolkit.dist.dist_ref.dists.binomial_dist.meaning_of_the_non_member_accessors"></a>Table 11. Meaning of the non-member accessors
<div class="table-contents"><table class="table" summary="Meaning of the non-member accessors">
<colgroup>
<col>
@@ -620,7 +620,7 @@
 
 <code class="computeroutput">quantile(complement(binomial(n,
 p),
- P))</code>`
+ P))</code>
 
 </td>
</tr>
@@ -628,7 +628,7 @@
</table></div>
</div>
 <a name="math_toolkit.dist.dist_ref.dists.binomial_dist.examples"></a><h5>
-<a name="id1090256"></a>
+<a name="id1144997"></a>
 <a class="link" href="binomial_dist.html#math_toolkit.dist.dist_ref.dists.binomial_dist.examples">Examples</a>
 </h5>

@@ -636,7 +636,7 @@
 examples</a> are available illustrating the use of the binomial distribution.
 
<a name="math_toolkit.dist.dist_ref.dists.binomial_dist.accuracy"></a><h5>
-<a name="id1090277"></a>
+<a name="id1146420"></a>
 <a class="link" href="binomial_dist.html#math_toolkit.dist.dist_ref.dists.binomial_dist.accuracy">Accuracy</a>
 </h5>

@@ -646,7 +646,7 @@
 please refer to these functions for information on accuracy.
 
<a name="math_toolkit.dist.dist_ref.dists.binomial_dist.implementation"></a><h5>
-<a name="id1090306"></a>
+<a name="id1146449"></a>
 <a class="link" href="binomial_dist.html#math_toolkit.dist.dist_ref.dists.binomial_dist.implementation">Implementation</a>
 </h5>

@@ -890,7 +890,7 @@
</tbody>
</table></div>
<a name="math_toolkit.dist.dist_ref.dists.binomial_dist.references"></a><h5>
-<a name="id1091356"></a>
+<a name="id1147499"></a>
 <a class="link" href="binomial_dist.html#math_toolkit.dist.dist_ref.dists.binomial_dist.references">References</a>
 </h5>
<div class="itemizedlist"><ul type="disc">
@@ -911,9 +911,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -63,8 +63,8 @@
 <img src="../../../../../equations/cauchy_ref1.png">
 

- The location parameter x0 is the location of the peak of the distribution
- (the mode of the distribution), while the scale parameter γ specifies half
+ The location parameter x0 is the location of the peak of the distribution
+ (the mode of the distribution), while the scale parameter γ specifies half
 the width of the PDF at half the maximum height. If the location is zero,
 and the scale 1, then the result is a standard Cauchy distribution.
 
@@ -88,7 +88,7 @@
 <img src="../../../../../graphs/cauchy_pdf2.png" align="middle">
 
<a name="math_toolkit.dist.dist_ref.dists.cauchy_dist.member_functions"></a><h5>
-<a name="id1093054"></a>
+<a name="id1148017"></a>
 <a class="link" href="cauchy_dist.html#math_toolkit.dist.dist_ref.dists.cauchy_dist.member_functions">Member
 Functions</a>
 </h5>
@@ -114,7 +114,7 @@
 Returns the scale parameter of the distribution.
 
<a name="math_toolkit.dist.dist_ref.dists.cauchy_dist.non_member_accessors"></a><h5>
-<a name="id1093202"></a>
+<a name="id1148165"></a>
 <a class="link" href="cauchy_dist.html#math_toolkit.dist.dist_ref.dists.cauchy_dist.non_member_accessors">Non-member
 Accessors</a>
 </h5>
@@ -148,7 +148,7 @@
 The domain of the random variable is [-[max_value], +[min_value]].
 
<a name="math_toolkit.dist.dist_ref.dists.cauchy_dist.accuracy"></a><h5>
-<a name="id1093345"></a>
+<a name="id1148308"></a>
 <a class="link" href="cauchy_dist.html#math_toolkit.dist.dist_ref.dists.cauchy_dist.accuracy">Accuracy</a>
 </h5>

@@ -157,12 +157,12 @@
 have very low error rates.
 
<a name="math_toolkit.dist.dist_ref.dists.cauchy_dist.implementation"></a><h5>
-<a name="id1093378"></a>
+<a name="id1148341"></a>
 <a class="link" href="cauchy_dist.html#math_toolkit.dist.dist_ref.dists.cauchy_dist.implementation">Implementation</a>
 </h5>

 In the following table x0 is the location parameter of the distribution,
- γ is its scale parameter, x is the random variate,
+ γ is its scale parameter, x is the random variate,
 p is the probability and q = 1-p.
 
<div class="informaltable"><table class="table">
@@ -224,7 +224,7 @@
 
 So the procedure is to calculate the cdf for -fabs(x) using
 the above formula. Note that to factor in the location and
- scale parameters you must substitute (x - x0 ) / γ for x in the
+ scale parameters you must substitute (x - x0 ) / γ for x in the
 above.
 
 
@@ -249,7 +249,7 @@
 then the relation
 
 
- x = x0 ± γ / tan(π * p)
+ x = x0 ± γ / tan(π * p)
 
 
 is used to obtain the result. Whether we're adding or subtracting
@@ -273,7 +273,7 @@
</tbody>
</table></div>
<a name="math_toolkit.dist.dist_ref.dists.cauchy_dist.references"></a><h5>
-<a name="id1093605"></a>
+<a name="id1148568"></a>
 <a class="link" href="cauchy_dist.html#math_toolkit.dist.dist_ref.dists.cauchy_dist.references">References</a>
 </h5>
<div class="itemizedlist"><ul type="disc">
@@ -294,9 +294,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -67,9 +67,9 @@
</pre>

 The Chi-Squared distribution is one of the most widely used distributions
- in statistical tests. If χi are ν
+ in statistical tests. If χi are ν 
independent, normally distributed random
- variables with means μi and variances σi2, then the random variable:
+ variables with means μi and variances σi2, then the random variable:
 

 <img src="../../../../../equations/chi_squ_ref1.png">
@@ -79,7 +79,7 @@
 

 The Chi-Squared distribution is a special case of the gamma distribution
- and has a single parameter ν that specifies the number of degrees of freedom.
+ and has a single parameter ν that specifies the number of degrees of freedom.
 The following graph illustrates how the distribution changes for different
 values of ν:
 
@@ -87,7 +87,7 @@
 <img src="../../../../../graphs/chi_squared_pdf.png" align="middle">
 
<a name="math_toolkit.dist.dist_ref.dists.chi_squared_dist.member_functions"></a><h5>
-<a name="id1094170"></a>
+<a name="id1149690"></a>
 <a class="link" href="chi_squared_dist.html#math_toolkit.dist.dist_ref.dists.chi_squared_dist.member_functions">Member
 Functions</a>
 </h5>
@@ -170,7 +170,7 @@
 NIST Engineering Statistics Handbook, Section 7.2.3.2</a>.
 
<a name="math_toolkit.dist.dist_ref.dists.chi_squared_dist.non_member_accessors"></a><h5>
-<a name="id1094502"></a>
+<a name="id1150021"></a>
 <a class="link" href="chi_squared_dist.html#math_toolkit.dist.dist_ref.dists.chi_squared_dist.non_member_accessors">Non-member
 Accessors</a>
 </h5>
@@ -196,7 +196,7 @@
 The domain of the random variable is [0, +∞].
 
<a name="math_toolkit.dist.dist_ref.dists.chi_squared_dist.examples"></a><h5>
-<a name="id1094605"></a>
+<a name="id1150125"></a>
 <a class="link" href="chi_squared_dist.html#math_toolkit.dist.dist_ref.dists.chi_squared_dist.examples">Examples</a>
 </h5>

@@ -204,7 +204,7 @@
 are available illustrating the use of the Chi Squared Distribution.
 
<a name="math_toolkit.dist.dist_ref.dists.chi_squared_dist.accuracy"></a><h5>
-<a name="id1094631"></a>
+<a name="id1150151"></a>
 <a class="link" href="chi_squared_dist.html#math_toolkit.dist.dist_ref.dists.chi_squared_dist.accuracy">Accuracy</a>
 </h5>

@@ -212,7 +212,7 @@
 gamma functions</a>: please refer to the accuracy data for those functions.
 
<a name="math_toolkit.dist.dist_ref.dists.chi_squared_dist.implementation"></a><h5>
-<a name="id1094655"></a>
+<a name="id1150175"></a>
 <a class="link" href="chi_squared_dist.html#math_toolkit.dist.dist_ref.dists.chi_squared_dist.implementation">Implementation</a>
 </h5>

@@ -379,7 +379,7 @@
</tbody>
</table></div>
<a name="math_toolkit.dist.dist_ref.dists.chi_squared_dist.references"></a><h5>
-<a name="id1095524"></a>
+<a name="id1150471"></a>
 <a class="link" href="chi_squared_dist.html#math_toolkit.dist.dist_ref.dists.chi_squared_dist.references">References</a>
 </h5>
<div class="itemizedlist"><ul type="disc">
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -71,7 +71,7 @@
 <img src="../../../../../graphs/exponential_pdf.png" align="middle">
 
<a name="math_toolkit.dist.dist_ref.dists.exp_dist.member_functions"></a><h5>
-<a name="id1095958"></a>
+<a name="id1150906"></a>
 <a class="link" href="exp_dist.html#math_toolkit.dist.dist_ref.dists.exp_dist.member_functions">Member
 Functions</a>
 </h5>
@@ -91,7 +91,7 @@
 Accessor function returns the lambda parameter of the distribution.
 
<a name="math_toolkit.dist.dist_ref.dists.exp_dist.non_member_accessors"></a><h5>
-<a name="id1096059"></a>
+<a name="id1151007"></a>
 <a class="link" href="exp_dist.html#math_toolkit.dist.dist_ref.dists.exp_dist.non_member_accessors">Non-member
 Accessors</a>
 </h5>
@@ -111,7 +111,7 @@
 The domain of the random variable is [0, +∞].
 
<a name="math_toolkit.dist.dist_ref.dists.exp_dist.accuracy"></a><h5>
-<a name="id1096158"></a>
+<a name="id1151106"></a>
 <a class="link" href="exp_dist.html#math_toolkit.dist.dist_ref.dists.exp_dist.accuracy">Accuracy</a>
 </h5>

@@ -122,7 +122,7 @@
 should have very low error rates.
 
<a name="math_toolkit.dist.dist_ref.dists.exp_dist.implementation"></a><h5>
-<a name="id1096206"></a>
+<a name="id1151154"></a>
 <a class="link" href="exp_dist.html#math_toolkit.dist.dist_ref.dists.exp_dist.implementation">Implementation</a>
 </h5>

@@ -283,7 +283,7 @@
</tbody>
</table></div>
<a name="math_toolkit.dist.dist_ref.dists.exp_dist.references"></a><h5>
-<a name="id1096473"></a>
+<a name="id1151447"></a>
 <a class="link" href="exp_dist.html#math_toolkit.dist.dist_ref.dists.exp_dist.references">references</a>
 </h5>
<div class="itemizedlist"><ul type="disc">
@@ -318,9 +318,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -100,7 +100,7 @@
 <img src="../../../../../graphs/extreme_value_pdf2.png" align="middle">
 
<a name="math_toolkit.dist.dist_ref.dists.extreme_dist.member_functions"></a><h5>
-<a name="id1097036"></a>
+<a name="id1152010"></a>
 <a class="link" href="extreme_dist.html#math_toolkit.dist.dist_ref.dists.extreme_dist.member_functions">Member
 Functions</a>
 </h5>
@@ -125,7 +125,7 @@
 Returns the scale parameter of the distribution.
 
<a name="math_toolkit.dist.dist_ref.dists.extreme_dist.non_member_accessors"></a><h5>
-<a name="id1097192"></a>
+<a name="id1152166"></a>
 <a class="link" href="extreme_dist.html#math_toolkit.dist.dist_ref.dists.extreme_dist.non_member_accessors">Non-member
 Accessors</a>
 </h5>
@@ -145,7 +145,7 @@
 The domain of the random parameter is [-∞, +∞].
 
<a name="math_toolkit.dist.dist_ref.dists.extreme_dist.accuracy"></a><h5>
-<a name="id1097289"></a>
+<a name="id1152263"></a>
 <a class="link" href="extreme_dist.html#math_toolkit.dist.dist_ref.dists.extreme_dist.accuracy">Accuracy</a>
 </h5>

@@ -154,7 +154,7 @@
 very low error rates.
 
<a name="math_toolkit.dist.dist_ref.dists.extreme_dist.implementation"></a><h5>
-<a name="id1097322"></a>
+<a name="id1152296"></a>
 <a class="link" href="extreme_dist.html#math_toolkit.dist.dist_ref.dists.extreme_dist.implementation">Implementation</a>
 </h5>

@@ -320,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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -58,12 +58,12 @@
</pre>

 The F distribution is a continuous distribution that arises when testing
- whether two samples have the same variance. If χ2m and χ2n are independent
+ whether two samples have the same variance. If χ2m and χ2n are independent
 variates each distributed as Chi-Squared with m
 and n degrees of freedom, then the test statistic:
 

- Fn,m = (χ2n / n) / (χ2m / m)
+ Fn,m = (χ2n / n) / (χ2m / m)
 

 Is distributed over the range [0, ∞] with an F distribution, and has the
@@ -80,7 +80,7 @@
 <img src="../../../../../graphs/fisher_f_pdf.png" align="middle">
 
<a name="math_toolkit.dist.dist_ref.dists.f_dist.member_functions"></a><h5>
-<a name="id1098154"></a>
+<a name="id1153060"></a>
 <a class="link" href="f_dist.html#math_toolkit.dist.dist_ref.dists.f_dist.member_functions">Member
 Functions</a>
 </h5>
@@ -106,7 +106,7 @@
 Returns the denominator degrees of freedom parameter of the distribution.
 
<a name="math_toolkit.dist.dist_ref.dists.f_dist.non_member_accessors"></a><h5>
-<a name="id1098308"></a>
+<a name="id1153213"></a>
 <a class="link" href="f_dist.html#math_toolkit.dist.dist_ref.dists.f_dist.non_member_accessors">Non-member
 Accessors</a>
 </h5>
@@ -126,7 +126,7 @@
 The domain of the random variable is [0, +∞].
 
<a name="math_toolkit.dist.dist_ref.dists.f_dist.examples"></a><h5>
-<a name="id1098408"></a>
+<a name="id1153313"></a>
 <a class="link" href="f_dist.html#math_toolkit.dist.dist_ref.dists.f_dist.examples">Examples</a>
 </h5>

@@ -134,7 +134,7 @@
 are available illustrating the use of the F Distribution.
 
<a name="math_toolkit.dist.dist_ref.dists.f_dist.accuracy"></a><h5>
-<a name="id1098429"></a>
+<a name="id1153334"></a>
 <a class="link" href="f_dist.html#math_toolkit.dist.dist_ref.dists.f_dist.accuracy">Accuracy</a>
 </h5>

@@ -143,7 +143,7 @@
 refer to those functions for accuracy data.
 
<a name="math_toolkit.dist.dist_ref.dists.f_dist.implementation"></a><h5>
-<a name="id1098456"></a>
+<a name="id1153361"></a>
 <a class="link" href="f_dist.html#math_toolkit.dist.dist_ref.dists.f_dist.implementation">Implementation</a>
 </h5>

@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -7,7 +7,7 @@
<link rel="home" href="../../../../index.html" title="Math Toolkit">
<link rel="up" href="../dists.html" title="Distributions">
<link rel="prev" href="f_dist.html" title="F Distribution">
-<link rel="next" href="hypergeometric_dist.html" title="Hypergeometric Distribution">
+<link rel="next" href="inverse_chi_squared_dist.html" title="Inverse Chi Squared Distribution">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
@@ -20,7 +20,7 @@
</tr></table>
<hr>
<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="hypergeometric_dist.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
+<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="inverse_chi_squared_dist.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
@@ -91,15 +91,15 @@
</td></tr>
</table></div>

- For shape parameter k and scale parameter θ it is
+ For shape parameter k and scale parameter θ it is
 defined by the probability density function:
 

 <img src="../../../../../equations/gamma_dist_ref1.png">
 

- Sometimes an alternative formulation is used: given parameters α= k and
- β= 1 / θ, then the distribution can be defined by the PDF:
+ Sometimes an alternative formulation is used: given parameters α = k and
+ β = 1 / θ, then the distribution can be defined by the PDF:
 

 <img src="../../../../../equations/gamma_dist_ref2.png">
@@ -137,7 +137,7 @@
 than a dedicated Erlang Distribution.
 
<a name="math_toolkit.dist.dist_ref.dists.gamma_dist.member_functions"></a><h5>
-<a name="id1099510"></a>
+<a name="id1156340"></a>
 <a class="link" href="gamma_dist.html#math_toolkit.dist.dist_ref.dists.gamma_dist.member_functions">Member
 Functions</a>
 </h5>
@@ -162,7 +162,7 @@
 Returns the scale parameter of this distribution.
 
<a name="math_toolkit.dist.dist_ref.dists.gamma_dist.non_member_accessors"></a><h5>
-<a name="id1099656"></a>
+<a name="id1156485"></a>
 <a class="link" href="gamma_dist.html#math_toolkit.dist.dist_ref.dists.gamma_dist.non_member_accessors">Non-member
 Accessors</a>
 </h5>
@@ -182,7 +182,7 @@
 The domain of the random variable is [0,+∞].
 
<a name="math_toolkit.dist.dist_ref.dists.gamma_dist.accuracy"></a><h5>
-<a name="id1101696"></a>
+<a name="id1156582"></a>
 <a class="link" href="gamma_dist.html#math_toolkit.dist.dist_ref.dists.gamma_dist.accuracy">Accuracy</a>
 </h5>

@@ -194,12 +194,12 @@
 refer to the accuracy data for those functions for more information.
 
<a name="math_toolkit.dist.dist_ref.dists.gamma_dist.implementation"></a><h5>
-<a name="id1101734"></a>
+<a name="id1156620"></a>
 <a class="link" href="gamma_dist.html#math_toolkit.dist.dist_ref.dists.gamma_dist.implementation">Implementation</a>
 </h5>

 In the following table k is the shape parameter
- of the distribution, θ is it's scale parameter, x
+ of the distribution, θ is it's scale parameter, x
 is the random variate, p is the probability and
 q = 1-p.
 
@@ -268,7 +268,7 @@
 </td>
<td>
 
- Using the relation: x = θ* <a class="link" href="../../../special/sf_gamma/igamma_inv.html" title="Incomplete Gamma Function Inverses">gamma_p_inv</a>(k,
+ Using the relation: x = θ * <a class="link" href="../../../special/sf_gamma/igamma_inv.html" title="Incomplete Gamma Function Inverses">gamma_p_inv</a>(k,
 p)
 
 </td>
@@ -281,7 +281,7 @@
 </td>
<td>
 
- Using the relation: x = θ* <a class="link" href="../../../special/sf_gamma/igamma_inv.html" title="Incomplete Gamma Function Inverses">gamma_q_inv</a>(k,
+ Using the relation: x = θ * <a class="link" href="../../../special/sf_gamma/igamma_inv.html" title="Incomplete Gamma Function Inverses">gamma_q_inv</a>(k,
 p)
 
 </td>
@@ -318,7 +318,7 @@
 </td>
<td>
 
- (k-1)θ for k>1 otherwise a <a class="link" href="../../../main_overview/error_handling.html#domain_error">domain_error</a>
+ (k-1)θ for k>1 otherwise a <a class="link" href="../../../main_overview/error_handling.html#domain_error">domain_error</a>
 
 </td>
</tr>
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the Boost Software License, Version 1.0. (See accompanying
 file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
@@ -373,7 +373,7 @@
</tr></table>
<hr>
<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="hypergeometric_dist.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
+<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="inverse_chi_squared_dist.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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -6,7 +6,7 @@
<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../../../index.html" title="Math Toolkit">
<link rel="up" href="../dists.html" title="Distributions">
-<link rel="prev" href="gamma_dist.html" title="Gamma (and Erlang) Distribution">
+<link rel="prev" href="inverse_gamma_dist.html" title="Inverse Gamma Distribution">
<link rel="next" href="laplace_dist.html" title="Laplace Distribution">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
@@ -20,7 +20,7 @@
</tr></table>
<hr>
<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="laplace_dist.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
+<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" lang="en">
<div class="titlepage"><div><div><h5 class="title">
@@ -102,7 +102,7 @@
 <img src="../../../../../graphs/hypergeometric_pdf_2.png" align="middle">
 
<a name="math_toolkit.dist.dist_ref.dists.hypergeometric_dist.member_functions"></a><h5>
-<a name="id1102606"></a>
+<a name="id1160233"></a>
 <a class="link" href="hypergeometric_dist.html#math_toolkit.dist.dist_ref.dists.hypergeometric_dist.member_functions">Member
 Functions</a>
 </h5>
@@ -131,7 +131,7 @@
 from the population N.
 
<a name="math_toolkit.dist.dist_ref.dists.hypergeometric_dist.non_member_accessors"></a><h5>
-<a name="id1102785"></a>
+<a name="id1160412"></a>
 <a class="link" href="hypergeometric_dist.html#math_toolkit.dist.dist_ref.dists.hypergeometric_dist.non_member_accessors">Non-member
 Accessors</a>
 </h5>
@@ -185,7 +185,7 @@
</td></tr>
</table></div>
<a name="math_toolkit.dist.dist_ref.dists.hypergeometric_dist.accuracy"></a><h5>
-<a name="id1102935"></a>
+<a name="id1160562"></a>
 <a class="link" href="hypergeometric_dist.html#math_toolkit.dist.dist_ref.dists.hypergeometric_dist.accuracy">Accuracy</a>
 </h5>

@@ -211,7 +211,7 @@
 meaningless for N >= 1015.
 
<a name="math_toolkit.dist.dist_ref.dists.hypergeometric_dist.testing"></a><h5>
-<a name="id1103169"></a>
+<a name="id1160796"></a>
 <a class="link" href="hypergeometric_dist.html#math_toolkit.dist.dist_ref.dists.hypergeometric_dist.testing">Testing</a>
 </h5>

@@ -223,7 +223,7 @@
 this implementation and NTL::RR.
 
<a name="math_toolkit.dist.dist_ref.dists.hypergeometric_dist.implementation"></a><h5>
-<a name="id1103193"></a>
+<a name="id1160820"></a>
 <a class="link" href="hypergeometric_dist.html#math_toolkit.dist.dist_ref.dists.hypergeometric_dist.implementation">Implementation</a>
 </h5>

@@ -328,9 +328,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the Boost Software License, Version 1.0. (See accompanying
 file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
@@ -338,7 +338,7 @@
</tr></table>
<hr>
<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="laplace_dist.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
+<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>
</body>
</html>

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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -62,7 +62,7 @@
 1972, p. 930). It is also called the double exponential distribution.
 

- For location parameter μ and scale parameter σ it is defined by the probability
+ For location parameter μ and scale parameter σ it is defined by the probability
 density function:
 

@@ -73,7 +73,7 @@
 deviation of the normal or Gaussian distribution.
 

- The following graph illustrates the effect of the parameters μ and σ on the
+ The following graph illustrates the effect of the parameters μ and σ on the
 PDF. Note that the range of the random variable remains [-∞,+∞] irrespective
 of the value of the location parameter:
 
@@ -81,7 +81,7 @@
 <img src="../../../../../graphs/laplace_pdf.png" align="middle">
 
<a name="math_toolkit.dist.dist_ref.dists.laplace_dist.member_functions"></a><h5>
-<a name="id1103965"></a>
+<a name="id1161547"></a>
 <a class="link" href="laplace_dist.html#math_toolkit.dist.dist_ref.dists.laplace_dist.member_functions">Member
 Functions</a>
 </h5>
@@ -113,7 +113,7 @@
 Returns the scale parameter of this distribution.
 
<a name="math_toolkit.dist.dist_ref.dists.laplace_dist.non_member_accessors"></a><h5>
-<a name="id1104127"></a>
+<a name="id1161709"></a>
 <a class="link" href="laplace_dist.html#math_toolkit.dist.dist_ref.dists.laplace_dist.non_member_accessors">Non-member
 Accessors</a>
 </h5>
@@ -133,7 +133,7 @@
 The domain of the random variable is [-∞,+∞].
 
<a name="math_toolkit.dist.dist_ref.dists.laplace_dist.accuracy"></a><h5>
-<a name="id1104224"></a>
+<a name="id1161806"></a>
 <a class="link" href="laplace_dist.html#math_toolkit.dist.dist_ref.dists.laplace_dist.accuracy">Accuracy</a>
 </h5>

@@ -141,7 +141,7 @@
 log and exp functions and as such should have very small errors.
 
<a name="math_toolkit.dist.dist_ref.dists.laplace_dist.implementation"></a><h5>
-<a name="id1104243"></a>
+<a name="id1161826"></a>
 <a class="link" href="laplace_dist.html#math_toolkit.dist.dist_ref.dists.laplace_dist.implementation">Implementation</a>
 </h5>

@@ -329,7 +329,7 @@
</tbody>
</table></div>
<a name="math_toolkit.dist.dist_ref.dists.laplace_dist.references"></a><h5>
-<a name="id1104565"></a>
+<a name="id1162147"></a>
 <a class="link" href="laplace_dist.html#math_toolkit.dist.dist_ref.dists.laplace_dist.references">References</a>
 </h5>
<div class="itemizedlist"><ul type="disc">
@@ -350,9 +350,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -72,7 +72,7 @@
 <img src="../../../../../graphs/logistic_pdf.png" align="middle">
 
<a name="math_toolkit.dist.dist_ref.dists.logistic_dist.member_functions"></a><h5>
-<a name="id1105054"></a>
+<a name="id1165159"></a>
 <a class="link" href="logistic_dist.html#math_toolkit.dist.dist_ref.dists.logistic_dist.member_functions">Member
 Functions</a>
 </h5>
@@ -98,7 +98,7 @@
 Returns the scale of this distribution.
 
<a name="math_toolkit.dist.dist_ref.dists.logistic_dist.non_member_accessors"></a><h5>
-<a name="id1105220"></a>
+<a name="id1165325"></a>
 <a class="link" href="logistic_dist.html#math_toolkit.dist.dist_ref.dists.logistic_dist.non_member_accessors">Non-member
 Accessors</a>
 </h5>
@@ -128,7 +128,7 @@
 and +<a class="link" href="../../../main_overview/error_handling.html#overflow_error">overflow_error</a> respectively.
 
<a name="math_toolkit.dist.dist_ref.dists.logistic_dist.accuracy"></a><h5>
-<a name="id1105370"></a>
+<a name="id1165475"></a>
 <a class="link" href="logistic_dist.html#math_toolkit.dist.dist_ref.dists.logistic_dist.accuracy">Accuracy</a>
 </h5>

@@ -140,7 +140,7 @@
 error can be guarenteed.
 
<a name="math_toolkit.dist.dist_ref.dists.logistic_dist.implementation"></a><h5>
-<a name="id1105425"></a>
+<a name="id1165530"></a>
 <a class="link" href="logistic_dist.html#math_toolkit.dist.dist_ref.dists.logistic_dist.implementation">Implementation</a>
 </h5>
<div class="informaltable"><table class="table">
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -88,7 +88,7 @@
 <img src="../../../../../graphs/lognormal_pdf2.png" align="middle">
 
<a name="math_toolkit.dist.dist_ref.dists.lognormal_dist.member_functions"></a><h5>
-<a name="id1106195"></a>
+<a name="id1166280"></a>
 <a class="link" href="lognormal_dist.html#math_toolkit.dist.dist_ref.dists.lognormal_dist.member_functions">Member
 Functions</a>
 </h5>
@@ -121,7 +121,7 @@
 Returns the scale parameter of this distribution.
 
<a name="math_toolkit.dist.dist_ref.dists.lognormal_dist.non_member_accessors"></a><h5>
-<a name="id1106355"></a>
+<a name="id1166439"></a>
 <a class="link" href="lognormal_dist.html#math_toolkit.dist.dist_ref.dists.lognormal_dist.non_member_accessors">Non-member
 Accessors</a>
 </h5>
@@ -141,7 +141,7 @@
 The domain of the random variable is [0,+∞].
 
<a name="math_toolkit.dist.dist_ref.dists.lognormal_dist.accuracy"></a><h5>
-<a name="id1106455"></a>
+<a name="id1166539"></a>
 <a class="link" href="lognormal_dist.html#math_toolkit.dist.dist_ref.dists.lognormal_dist.accuracy">Accuracy</a>
 </h5>

@@ -150,7 +150,7 @@
 function</a>, and as such should have very low error rates.
 
<a name="math_toolkit.dist.dist_ref.dists.lognormal_dist.implementation"></a><h5>
-<a name="id1106482"></a>
+<a name="id1166567"></a>
 <a class="link" href="lognormal_dist.html#math_toolkit.dist.dist_ref.dists.lognormal_dist.implementation">Implementation</a>
 </h5>

@@ -318,9 +318,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -96,7 +96,7 @@
 <img src="../../../../../graphs/nc_beta_pdf.png" align="middle">
 
<a name="math_toolkit.dist.dist_ref.dists.nc_beta_dist.member_functions"></a><h5>
-<a name="id1113307"></a>
+<a name="id1172494"></a>
 <a class="link" href="nc_beta_dist.html#math_toolkit.dist.dist_ref.dists.nc_beta_dist.member_functions">Member
 Functions</a>
 </h5>
@@ -128,7 +128,7 @@
 was constructed.
 
<a name="math_toolkit.dist.dist_ref.dists.nc_beta_dist.non_member_accessors"></a><h5>
-<a name="id1113493"></a>
+<a name="id1172680"></a>
 <a class="link" href="nc_beta_dist.html#math_toolkit.dist.dist_ref.dists.nc_beta_dist.non_member_accessors">Non-member
 Accessors</a>
 </h5>
@@ -152,7 +152,7 @@
 The domain of the random variable is [0, 1].
 
<a name="math_toolkit.dist.dist_ref.dists.nc_beta_dist.accuracy"></a><h5>
-<a name="id1113594"></a>
+<a name="id1172781"></a>
 <a class="link" href="nc_beta_dist.html#math_toolkit.dist.dist_ref.dists.nc_beta_dist.accuracy">Accuracy</a>
 </h5>

@@ -168,7 +168,7 @@
 zero error</a>.
 
<div class="table">
-<a name="id1113629"></a>Table 13. Errors In CDF of the Noncentral Beta
+<a name="math_toolkit.dist.dist_ref.dists.nc_beta_dist.errors_in_cdf_of_the_noncentral_beta"></a>Table 13. Errors In CDF of the Noncentral Beta
<div class="table-contents"><table class="table" summary="Errors In CDF of the Noncentral Beta">
<colgroup>
<col>
@@ -295,7 +295,7 @@
 functions are broadly similar.
 
<a name="math_toolkit.dist.dist_ref.dists.nc_beta_dist.tests"></a><h5>
-<a name="id1113835"></a>
+<a name="id1174676"></a>
 <a class="link" href="nc_beta_dist.html#math_toolkit.dist.dist_ref.dists.nc_beta_dist.tests">Tests</a>
 </h5>

@@ -307,7 +307,7 @@
 tests.
 
<a name="math_toolkit.dist.dist_ref.dists.nc_beta_dist.implementation"></a><h5>
-<a name="id1113859"></a>
+<a name="id1174700"></a>
 <a class="link" href="nc_beta_dist.html#math_toolkit.dist.dist_ref.dists.nc_beta_dist.implementation">Implementation</a>
 </h5>

@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -110,7 +110,7 @@
 <img src="../../../../../graphs/nccs_pdf.png" align="middle">
 
<a name="math_toolkit.dist.dist_ref.dists.nc_chi_squared_dist.member_functions"></a><h5>
-<a name="id1114878"></a>
+<a name="id1175719"></a>
 <a class="link" href="nc_chi_squared_dist.html#math_toolkit.dist.dist_ref.dists.nc_chi_squared_dist.member_functions">Member
 Functions</a>
 </h5>
@@ -183,7 +183,7 @@
 == q</code>.
 
<a name="math_toolkit.dist.dist_ref.dists.nc_chi_squared_dist.non_member_accessors"></a><h5>
-<a name="id1116857"></a>
+<a name="id1176620"></a>
 <a class="link" href="nc_chi_squared_dist.html#math_toolkit.dist.dist_ref.dists.nc_chi_squared_dist.non_member_accessors">Non-member
 Accessors</a>
 </h5>
@@ -203,7 +203,7 @@
 The domain of the random variable is [0, +∞].
 
<a name="math_toolkit.dist.dist_ref.dists.nc_chi_squared_dist.examples"></a><h5>
-<a name="id1116957"></a>
+<a name="id1176758"></a>
 <a class="link" href="nc_chi_squared_dist.html#math_toolkit.dist.dist_ref.dists.nc_chi_squared_dist.examples">Examples</a>
 </h5>

@@ -211,7 +211,7 @@
 example</a> for the noncentral chi-squared distribution.
 
<a name="math_toolkit.dist.dist_ref.dists.nc_chi_squared_dist.accuracy"></a><h5>
-<a name="id1116984"></a>
+<a name="id1176786"></a>
 <a class="link" href="nc_chi_squared_dist.html#math_toolkit.dist.dist_ref.dists.nc_chi_squared_dist.accuracy">Accuracy</a>
 </h5>

@@ -223,7 +223,7 @@
 zero error</a>.
 
<div class="table">
-<a name="id1117014"></a>Table 14. Errors In CDF of the Noncentral Chi-Squared
+<a name="math_toolkit.dist.dist_ref.dists.nc_chi_squared_dist.errors_in_cdf_of_the_noncentral_chi_squared"></a>Table 14. Errors In CDF of the Noncentral Chi-Squared
<div class="table-contents"><table class="table" summary="Errors In CDF of the Noncentral Chi-Squared">
<colgroup>
<col>
@@ -359,7 +359,7 @@
 produce an accuracy greater than the square root of the machine epsilon.
 
<a name="math_toolkit.dist.dist_ref.dists.nc_chi_squared_dist.tests"></a><h5>
-<a name="id1117244"></a>
+<a name="id1177046"></a>
 <a class="link" href="nc_chi_squared_dist.html#math_toolkit.dist.dist_ref.dists.nc_chi_squared_dist.tests">Tests</a>
 </h5>

@@ -373,7 +373,7 @@
 to at least 50 decimal digits - and is the used for our accuracy tests.
 
<a name="math_toolkit.dist.dist_ref.dists.nc_chi_squared_dist.implementation"></a><h5>
-<a name="id1117263"></a>
+<a name="id1177066"></a>
 <a class="link" href="nc_chi_squared_dist.html#math_toolkit.dist.dist_ref.dists.nc_chi_squared_dist.implementation">Implementation</a>
 </h5>

@@ -500,9 +500,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -95,7 +95,7 @@
 <img src="../../../../../graphs/nc_f_pdf.png" align="middle">
 
<a name="math_toolkit.dist.dist_ref.dists.nc_f_dist.member_functions"></a><h5>
-<a name="id1118116"></a>
+<a name="id1177919"></a>
 <a class="link" href="nc_f_dist.html#math_toolkit.dist.dist_ref.dists.nc_f_dist.member_functions">Member
 Functions</a>
 </h5>
@@ -127,7 +127,7 @@
 which this object was constructed.
 
<a name="math_toolkit.dist.dist_ref.dists.nc_f_dist.non_member_accessors"></a><h5>
-<a name="id1118304"></a>
+<a name="id1178107"></a>
 <a class="link" href="nc_f_dist.html#math_toolkit.dist.dist_ref.dists.nc_f_dist.non_member_accessors">Non-member
 Accessors</a>
 </h5>
@@ -147,7 +147,7 @@
 The domain of the random variable is [0, +∞].
 
<a name="math_toolkit.dist.dist_ref.dists.nc_f_dist.accuracy"></a><h5>
-<a name="id1120124"></a>
+<a name="id1178207"></a>
 <a class="link" href="nc_f_dist.html#math_toolkit.dist.dist_ref.dists.nc_f_dist.accuracy">Accuracy</a>
 </h5>

@@ -155,7 +155,7 @@
 Beta Distribution</a>: refer to that distribution for accuracy data.
 
<a name="math_toolkit.dist.dist_ref.dists.nc_f_dist.tests"></a><h5>
-<a name="id1120148"></a>
+<a name="id1178231"></a>
 <a class="link" href="nc_f_dist.html#math_toolkit.dist.dist_ref.dists.nc_f_dist.tests">Tests</a>
 </h5>

@@ -164,7 +164,7 @@
 Math library statistical package</a> and its pbeta and dbeta functions.
 
<a name="math_toolkit.dist.dist_ref.dists.nc_f_dist.implementation"></a><h5>
-<a name="id1120172"></a>
+<a name="id1178255"></a>
 <a class="link" href="nc_f_dist.html#math_toolkit.dist.dist_ref.dists.nc_f_dist.implementation">Implementation</a>
 </h5>

@@ -408,9 +408,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -85,7 +85,7 @@
 <img src="../../../../../graphs/nc_t_pdf.png" align="middle">
 
<a name="math_toolkit.dist.dist_ref.dists.nc_t_dist.member_functions"></a><h5>
-<a name="id1121068"></a>
+<a name="id1179698"></a>
 <a class="link" href="nc_t_dist.html#math_toolkit.dist.dist_ref.dists.nc_t_dist.member_functions">Member
 Functions</a>
 </h5>
@@ -111,7 +111,7 @@
 which this object was constructed.
 
<a name="math_toolkit.dist.dist_ref.dists.nc_t_dist.non_member_accessors"></a><h5>
-<a name="id1121207"></a>
+<a name="id1179837"></a>
 <a class="link" href="nc_t_dist.html#math_toolkit.dist.dist_ref.dists.nc_t_dist.non_member_accessors">Non-member
 Accessors</a>
 </h5>
@@ -131,7 +131,7 @@
 The domain of the random variable is [-∞, +∞].
 
<a name="math_toolkit.dist.dist_ref.dists.nc_t_dist.accuracy"></a><h5>
-<a name="id1121306"></a>
+<a name="id1179937"></a>
 <a class="link" href="nc_t_dist.html#math_toolkit.dist.dist_ref.dists.nc_t_dist.accuracy">Accuracy</a>
 </h5>

@@ -141,7 +141,7 @@
 one shown will have <a class="link" href="../../../backgrounders/relative_error.html#zero_error">effectively zero error</a>.
 
<div class="table">
-<a name="id1121329"></a>Table 15. Errors In CDF of the Noncentral T Distribution
+<a name="math_toolkit.dist.dist_ref.dists.nc_t_dist.errors_in_cdf_of_the_noncentral_t_distribution"></a>Table 15. Errors In CDF of the Noncentral T Distribution
<div class="table-contents"><table class="table" summary="Errors In CDF of the Noncentral T Distribution">
<colgroup>
<col>
@@ -255,7 +255,7 @@
 epsilon.
 
<a name="math_toolkit.dist.dist_ref.dists.nc_t_dist.tests"></a><h5>
-<a name="id1121506"></a>
+<a name="id1180137"></a>
 <a class="link" href="nc_t_dist.html#math_toolkit.dist.dist_ref.dists.nc_t_dist.tests">Tests</a>
 </h5>

@@ -270,7 +270,7 @@
 least 50 decimal places.
 
<a name="math_toolkit.dist.dist_ref.dists.nc_t_dist.implementation"></a><h5>
-<a name="id1121525"></a>
+<a name="id1180157"></a>
 <a class="link" href="nc_t_dist.html#math_toolkit.dist.dist_ref.dists.nc_t_dist.implementation">Implementation</a>
 </h5>

@@ -351,9 +351,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -123,7 +123,7 @@
 <img src="../../../../../graphs/negative_binomial_pdf_2.png" align="middle">
 
<a name="math_toolkit.dist.dist_ref.dists.negative_binomial_dist.related_distributions"></a><h5>
-<a name="id1107629"></a>
+<a name="id1168425"></a>
 <a class="link" href="negative_binomial_dist.html#math_toolkit.dist.dist_ref.dists.negative_binomial_dist.related_distributions">Related
 Distributions</a>
 </h5>
@@ -158,7 +158,7 @@
 The Poisson distribution is a special case for large successes
 

- poisson(λ) = lim r → ∞ negative_binomial(r, r / (λ + r)))
+ poisson(λ) = lim r → ∞ negative_binomial(r, r / (λ + r)))
 

 
@@ -200,12 +200,12 @@

 
<a name="math_toolkit.dist.dist_ref.dists.negative_binomial_dist.member_functions"></a><h5>
-<a name="id1107740"></a>
+<a name="id1168536"></a>
 <a class="link" href="negative_binomial_dist.html#math_toolkit.dist.dist_ref.dists.negative_binomial_dist.member_functions">Member
 Functions</a>
 </h5>
<a name="math_toolkit.dist.dist_ref.dists.negative_binomial_dist.construct"></a><h6>
-<a name="id1107753"></a>
+<a name="id1168549"></a>
 <a class="link" href="negative_binomial_dist.html#math_toolkit.dist.dist_ref.dists.negative_binomial_dist.construct">Construct</a>
 </h6>
<pre class="programlisting">negative_binomial_distribution(RealType r, RealType p);
@@ -221,7 +221,7 @@
 <= 1</code>.
 
<a name="math_toolkit.dist.dist_ref.dists.negative_binomial_dist.accessors"></a><h6>
-<a name="id1107862"></a>
+<a name="id1168658"></a>
 <a class="link" href="negative_binomial_dist.html#math_toolkit.dist.dist_ref.dists.negative_binomial_dist.accessors">Accessors</a>
 </h6>
<pre class="programlisting">RealType success_fraction() const; // successes / trials (0 <= p <= 1)
@@ -237,7 +237,7 @@
 was constructed.
 
<a name="math_toolkit.dist.dist_ref.dists.negative_binomial_dist.lower_bound_on_parameter_p"></a><h6>
-<a name="id1107947"></a>
+<a name="id1168743"></a>
 <a class="link" href="negative_binomial_dist.html#math_toolkit.dist.dist_ref.dists.negative_binomial_dist.lower_bound_on_parameter_p">Lower
 Bound on Parameter p</a>
 </h6>
@@ -298,7 +298,7 @@
 vol. 48, no3, 605-621</a>.
 
<a name="math_toolkit.dist.dist_ref.dists.negative_binomial_dist.upper_bound_on_parameter_p"></a><h6>
-<a name="id1108215"></a>
+<a name="id1169011"></a>
 <a class="link" href="negative_binomial_dist.html#math_toolkit.dist.dist_ref.dists.negative_binomial_dist.upper_bound_on_parameter_p">Upper
 Bound on Parameter p</a>
 </h6>
@@ -358,7 +358,7 @@
 vol. 48, no3, 605-621</a>.
 
<a name="math_toolkit.dist.dist_ref.dists.negative_binomial_dist.estimating_number_of_trials_to_ensure_at_least_a_certain_number_of_failures"></a><h6>
-<a name="id1110844"></a>
+<a name="id1169275"></a>
 <a class="link" href="negative_binomial_dist.html#math_toolkit.dist.dist_ref.dists.negative_binomial_dist.estimating_number_of_trials_to_ensure_at_least_a_certain_number_of_failures">Estimating
 Number of Trials to Ensure at Least a Certain Number of Failures</a>
 </h6>
@@ -409,7 +409,7 @@
 probability of observing k failures or fewer.
 
<a name="math_toolkit.dist.dist_ref.dists.negative_binomial_dist.estimating_number_of_trials_to_ensure_a_maximum_number_of_failures_or_less"></a><h6>
-<a name="id1111068"></a>
+<a name="id1169499"></a>
 <a class="link" href="negative_binomial_dist.html#math_toolkit.dist.dist_ref.dists.negative_binomial_dist.estimating_number_of_trials_to_ensure_a_maximum_number_of_failures_or_less">Estimating
 Number of Trials to Ensure a Maximum Number of Failures or Less</a>
 </h6>
@@ -457,7 +457,7 @@
 probability of observing more than k failures.
 
<a name="math_toolkit.dist.dist_ref.dists.negative_binomial_dist.non_member_accessors"></a><h5>
-<a name="id1111300"></a>
+<a name="id1169731"></a>
 <a class="link" href="negative_binomial_dist.html#math_toolkit.dist.dist_ref.dists.negative_binomial_dist.non_member_accessors">Non-member
 Accessors</a>
 </h5>
@@ -478,7 +478,7 @@
 in the context of this distribution:
 
<div class="table">
-<a name="id1111393"></a>Table 12. Meaning of the non-member accessors.
+<a name="math_toolkit.dist.dist_ref.dists.negative_binomial_dist.meaning_of_the_non_member_accessors_"></a>Table 12. Meaning of the non-member accessors.
<div class="table-contents"><table class="table" summary="Meaning of the non-member accessors.">
<colgroup>
<col>
@@ -606,7 +606,7 @@
</table></div>
</div>
 <a name="math_toolkit.dist.dist_ref.dists.negative_binomial_dist.accuracy"></a><h5>
-<a name="id1111812"></a>
+<a name="id1171082"></a>
 <a class="link" href="negative_binomial_dist.html#math_toolkit.dist.dist_ref.dists.negative_binomial_dist.accuracy">Accuracy</a>
 </h5>

@@ -616,7 +616,7 @@
 please refer to these functions for information on accuracy.
 
<a name="math_toolkit.dist.dist_ref.dists.negative_binomial_dist.implementation"></a><h5>
-<a name="id1111839"></a>
+<a name="id1171108"></a>
 <a class="link" href="negative_binomial_dist.html#math_toolkit.dist.dist_ref.dists.negative_binomial_dist.implementation">Implementation</a>
 </h5>

@@ -900,9 +900,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -66,7 +66,7 @@
 Normal Distribution.
 

- Given mean μ and standard deviation σ it has the PDF:
+ Given mean μ and standard deviation σ it has the PDF:
 

 <img src="../../../../../equations/normal_ref1.png">
@@ -79,7 +79,7 @@
 <img src="../../../../../graphs/normal_pdf.png" align="middle">
 
<a name="math_toolkit.dist.dist_ref.dists.normal_dist.member_functions"></a><h5>
-<a name="id1122239"></a>
+<a name="id1180871"></a>
 <a class="link" href="normal_dist.html#math_toolkit.dist.dist_ref.dists.normal_dist.member_functions">Member
 Functions</a>
 </h5>
@@ -109,7 +109,7 @@
 be used generically).
 
<a name="math_toolkit.dist.dist_ref.dists.normal_dist.non_member_accessors"></a><h5>
-<a name="id1122738"></a>
+<a name="id1181066"></a>
 <a class="link" href="normal_dist.html#math_toolkit.dist.dist_ref.dists.normal_dist.non_member_accessors">Non-member
 Accessors</a>
 </h5>
@@ -131,7 +131,7 @@
 and complement cdf -∞ = 1 and +∞ = 0, if RealType permits.
 
<a name="math_toolkit.dist.dist_ref.dists.normal_dist.accuracy"></a><h5>
-<a name="id1122835"></a>
+<a name="id1181163"></a>
 <a class="link" href="normal_dist.html#math_toolkit.dist.dist_ref.dists.normal_dist.accuracy">Accuracy</a>
 </h5>

@@ -139,7 +139,7 @@
 function</a>, and as such should have very low error rates.
 
<a name="math_toolkit.dist.dist_ref.dists.normal_dist.implementation"></a><h5>
-<a name="id1122860"></a>
+<a name="id1181189"></a>
 <a class="link" href="normal_dist.html#math_toolkit.dist.dist_ref.dists.normal_dist.implementation">Implementation</a>
 </h5>

@@ -289,9 +289,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -64,7 +64,7 @@
 f(x; α, β) = αβα / xα+ 1
 

- For shape parameter α > 0, and scale parameter β > 0. If x < β, the
+ For shape parameter α > 0, and scale parameter β > 0. If x < β , the
 pdf is zero.
 

@@ -87,12 +87,12 @@
 <img src="../../../../../graphs/pareto_pdf2.png" align="middle">
 
<a name="math_toolkit.dist.dist_ref.dists.pareto.related_distributions"></a><h5>
-<a name="id1123644"></a>
+<a name="id1183644"></a>
 <a class="link" href="pareto.html#math_toolkit.dist.dist_ref.dists.pareto.related_distributions">Related
 distributions</a>
 </h5>
<a name="math_toolkit.dist.dist_ref.dists.pareto.member_functions"></a><h5>
-<a name="id1123662"></a>
+<a name="id1183662"></a>
 <a class="link" href="pareto.html#math_toolkit.dist.dist_ref.dists.pareto.member_functions">Member
 Functions</a>
 </h5>
@@ -118,7 +118,7 @@
 Returns the shape parameter of this distribution.
 
<a name="math_toolkit.dist.dist_ref.dists.pareto.non_member_accessors"></a><h5>
-<a name="id1123830"></a>
+<a name="id1183830"></a>
 <a class="link" href="pareto.html#math_toolkit.dist.dist_ref.dists.pareto.non_member_accessors">Non-member
 Accessors</a>
 </h5>
@@ -138,7 +138,7 @@
 The supported domain of the random variable is [scale, ∞].
 
<a name="math_toolkit.dist.dist_ref.dists.pareto.accuracy"></a><h5>
-<a name="id1123929"></a>
+<a name="id1183930"></a>
 <a class="link" href="pareto.html#math_toolkit.dist.dist_ref.dists.pareto.accuracy">Accuracy</a>
 </h5>

@@ -151,12 +151,12 @@
 zero) see also <a class="link" href="../../stat_tut/overview/complements.html#why_complements">why complements?</a>.
 
<a name="math_toolkit.dist.dist_ref.dists.pareto.implementation"></a><h5>
-<a name="id1123966"></a>
+<a name="id1183967"></a>
 <a class="link" href="pareto.html#math_toolkit.dist.dist_ref.dists.pareto.implementation">Implementation</a>
 </h5>

- In the following table α is the shape parameter of the distribution, and
- β is its scale parameter, x is the random variate,
+ In the following table α is the shape parameter of the distribution, and
+ β is its scale parameter, x is the random variate,
 p is the probability and its complement q
 = 1-p.
 
@@ -198,7 +198,7 @@
 </td>
<td>
 
- Using the relation: cdf p = 1 - (β / x)α
+ Using the relation: cdf p = 1 - (β / x)α
 
 </td>
</tr>
@@ -210,7 +210,7 @@
 </td>
<td>
 
- Using the relation: q = 1 - p = -(β / x)α
+ Using the relation: q = 1 - p = -(β / x)α
 
 </td>
</tr>
@@ -319,7 +319,7 @@
</tbody>
</table></div>
<a name="math_toolkit.dist.dist_ref.dists.pareto.references"></a><h5>
-<a name="id1124274"></a>
+<a name="id1184274"></a>
 <a class="link" href="pareto.html#math_toolkit.dist.dist_ref.dists.pareto.references">References</a>
 </h5>
<div class="itemizedlist"><ul type="disc">
@@ -341,9 +341,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -59,7 +59,7 @@
 distribution</a> is a well-known statistical discrete distribution.
 It expresses the probability of a number of events (or failures, arrivals,
 occurrences ...) occurring in a fixed period of time, provided these
- events occur with a known mean rate λ
+ events occur with a known mean rate λ 
(events/time), and are independent
 of the time since the last event.
 
@@ -122,7 +122,7 @@

 
<a name="math_toolkit.dist.dist_ref.dists.poisson_dist.member_functions"></a><h5>
-<a name="id1124970"></a>
+<a name="id1184807"></a>
 <a class="link" href="poisson_dist.html#math_toolkit.dist.dist_ref.dists.poisson_dist.member_functions">Member
 Functions</a>
 </h5>
@@ -137,7 +137,7 @@
 Returns the mean of this distribution.
 
<a name="math_toolkit.dist.dist_ref.dists.poisson_dist.non_member_accessors"></a><h5>
-<a name="id1125058"></a>
+<a name="id1184896"></a>
 <a class="link" href="poisson_dist.html#math_toolkit.dist.dist_ref.dists.poisson_dist.non_member_accessors">Non-member
 Accessors</a>
 </h5>
@@ -157,7 +157,7 @@
 The domain of the random variable is [0, ∞].
 
<a name="math_toolkit.dist.dist_ref.dists.poisson_dist.accuracy"></a><h5>
-<a name="id1125156"></a>
+<a name="id1184993"></a>
 <a class="link" href="poisson_dist.html#math_toolkit.dist.dist_ref.dists.poisson_dist.accuracy">Accuracy</a>
 </h5>

@@ -171,11 +171,11 @@
 using an iterative method with a lower tolerance to avoid excessive computation.
 
<a name="math_toolkit.dist.dist_ref.dists.poisson_dist.implementation"></a><h5>
-<a name="id1125184"></a>
+<a name="id1185022"></a>
 <a class="link" href="poisson_dist.html#math_toolkit.dist.dist_ref.dists.poisson_dist.implementation">Implementation</a>
 </h5>

- In the following table λ is the mean of the distribution, k
+ In the following table λ is the mean of the distribution, k
 is the random variable, p is the probability and
 q = 1-p.
 
@@ -326,9 +326,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -64,7 +64,7 @@
 f(x; sigma) = x * exp(-x2/2 σ2) / σ2
 

- For sigma parameter σ > 0, and x > 0.
+ For sigma parameter σ > 0, and x > 0.
 

 The Rayleigh distribution is often used where two orthogonal components
@@ -86,7 +86,7 @@
 <img src="../../../../../graphs/rayleigh_cdf.png" align="middle">
 
<a name="math_toolkit.dist.dist_ref.dists.rayleigh.related_distributions"></a><h5>
-<a name="id1125906"></a>
+<a name="id1185905"></a>
 <a class="link" href="rayleigh.html#math_toolkit.dist.dist_ref.dists.rayleigh.related_distributions">Related
 distributions</a>
 </h5>
@@ -102,7 +102,7 @@
 distribution</a>.
 
<a name="math_toolkit.dist.dist_ref.dists.rayleigh.member_functions"></a><h5>
-<a name="id1125957"></a>
+<a name="id1185956"></a>
 <a class="link" href="rayleigh.html#math_toolkit.dist.dist_ref.dists.rayleigh.member_functions">Member
 Functions</a>
 </h5>
@@ -121,7 +121,7 @@
 Returns the sigma parameter of this distribution.
 
<a name="math_toolkit.dist.dist_ref.dists.rayleigh.non_member_accessors"></a><h5>
-<a name="id1126060"></a>
+<a name="id1186060"></a>
 <a class="link" href="rayleigh.html#math_toolkit.dist.dist_ref.dists.rayleigh.non_member_accessors">Non-member
 Accessors</a>
 </h5>
@@ -141,7 +141,7 @@
 The domain of the random variable is [0, max_value].
 
<a name="math_toolkit.dist.dist_ref.dists.rayleigh.accuracy"></a><h5>
-<a name="id1126160"></a>
+<a name="id1186159"></a>
 <a class="link" href="rayleigh.html#math_toolkit.dist.dist_ref.dists.rayleigh.accuracy">Accuracy</a>
 </h5>

@@ -151,11 +151,11 @@
 using NTL RR type with 150-bit accuracy, about 50 decimal digits.
 
<a name="math_toolkit.dist.dist_ref.dists.rayleigh.implementation"></a><h5>
-<a name="id1126194"></a>
+<a name="id1186193"></a>
 <a class="link" href="rayleigh.html#math_toolkit.dist.dist_ref.dists.rayleigh.implementation">Implementation</a>
 </h5>

- In the following table σ is the sigma parameter of the distribution, x
+ In the following table σ is the sigma parameter of the distribution, x
 is the random variate, p is the probability and
 q = 1-p.
 
@@ -197,7 +197,7 @@
 </td>
<td>
 
- Using the relation: p = 1 - exp(-x2/2) σ2 = -<a class="link" href="../../../special/powers/expm1.html" title="expm1">expm1</a>(-x2/2)
+ Using the relation: p = 1 - exp(-x2/2) σ2 = -<a class="link" href="../../../special/powers/expm1.html" title="expm1">expm1</a>(-x2/2)
 σ2
 
 </td>
@@ -320,7 +320,7 @@
</tbody>
</table></div>
<a name="math_toolkit.dist.dist_ref.dists.rayleigh.references"></a><h5>
-<a name="id1126530"></a>
+<a name="id1186529"></a>
 <a class="link" href="rayleigh.html#math_toolkit.dist.dist_ref.dists.rayleigh.references">References</a>
 </h5>
<div class="itemizedlist"><ul type="disc">
@@ -336,9 +336,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -97,7 +97,7 @@
 <img src="../../../../../graphs/students_t_pdf.png" align="middle">
 
<a name="math_toolkit.dist.dist_ref.dists.students_t_dist.member_functions"></a><h5>
-<a name="id1127110"></a>
+<a name="id1187110"></a>
 <a class="link" href="students_t_dist.html#math_toolkit.dist.dist_ref.dists.students_t_dist.member_functions">Member
 Functions</a>
 </h5>
@@ -174,7 +174,7 @@
 Engineering Statistics Handbook</a>.
 
<a name="math_toolkit.dist.dist_ref.dists.students_t_dist.non_member_accessors"></a><h5>
-<a name="id1129814"></a>
+<a name="id1187400"></a>
 <a class="link" href="students_t_dist.html#math_toolkit.dist.dist_ref.dists.students_t_dist.non_member_accessors">Non-member
 Accessors</a>
 </h5>
@@ -194,7 +194,7 @@
 The domain of the random variable is [-∞, +∞].
 
<a name="math_toolkit.dist.dist_ref.dists.students_t_dist.examples"></a><h5>
-<a name="id1129913"></a>
+<a name="id1187500"></a>
 <a class="link" href="students_t_dist.html#math_toolkit.dist.dist_ref.dists.students_t_dist.examples">Examples</a>
 </h5>

@@ -202,7 +202,7 @@
 are available illustrating the use of the Student's t distribution.
 
<a name="math_toolkit.dist.dist_ref.dists.students_t_dist.accuracy"></a><h5>
-<a name="id1129940"></a>
+<a name="id1187526"></a>
 <a class="link" href="students_t_dist.html#math_toolkit.dist.dist_ref.dists.students_t_dist.accuracy">Accuracy</a>
 </h5>

@@ -211,7 +211,7 @@
 inverses</a>, refer to accuracy data on those functions for more information.
 
<a name="math_toolkit.dist.dist_ref.dists.students_t_dist.implementation"></a><h5>
-<a name="id1129971"></a>
+<a name="id1187557"></a>
 <a class="link" href="students_t_dist.html#math_toolkit.dist.dist_ref.dists.students_t_dist.implementation">Implementation</a>
 </h5>

@@ -408,9 +408,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -128,7 +128,7 @@
 <img src="../../../../../graphs/triangular_cdf.png" align="middle">
 
<a name="math_toolkit.dist.dist_ref.dists.triangular_dist.member_functions"></a><h5>
-<a name="id1131001"></a>
+<a name="id1188757"></a>
 <a class="link" href="triangular_dist.html#math_toolkit.dist.dist_ref.dists.triangular_dist.member_functions">Member
 Functions</a>
 </h5>
@@ -163,7 +163,7 @@
 (default+1).
 
<a name="math_toolkit.dist.dist_ref.dists.triangular_dist.non_member_accessors"></a><h5>
-<a name="id1131219"></a>
+<a name="id1188975"></a>
 <a class="link" href="triangular_dist.html#math_toolkit.dist.dist_ref.dists.triangular_dist.non_member_accessors">Non-member
 Accessors</a>
 </h5>
@@ -184,7 +184,7 @@
 range is lower <= x <= upper.
 
<a name="math_toolkit.dist.dist_ref.dists.triangular_dist.accuracy"></a><h5>
-<a name="id1131319"></a>
+<a name="id1189075"></a>
 <a class="link" href="triangular_dist.html#math_toolkit.dist.dist_ref.dists.triangular_dist.accuracy">Accuracy</a>
 </h5>

@@ -193,7 +193,7 @@
 with arguments nearing the extremes of zero and unity.
 
<a name="math_toolkit.dist.dist_ref.dists.triangular_dist.implementation"></a><h5>
-<a name="id1131340"></a>
+<a name="id1189096"></a>
 <a class="link" href="triangular_dist.html#math_toolkit.dist.dist_ref.dists.triangular_dist.implementation">Implementation</a>
 </h5>

@@ -378,7 +378,7 @@
 Calculate and plot probability distributions</a>
 
<a name="math_toolkit.dist.dist_ref.dists.triangular_dist.references"></a><h5>
-<a name="id1131681"></a>
+<a name="id1189437"></a>
 <a class="link" href="triangular_dist.html#math_toolkit.dist.dist_ref.dists.triangular_dist.references">References</a>
 </h5>
<div class="itemizedlist"><ul type="disc">
@@ -414,9 +414,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -117,7 +117,7 @@
 <img src="../../../../../graphs/uniform_cdf.png" align="middle">
 
<a name="math_toolkit.dist.dist_ref.dists.uniform_dist.member_functions"></a><h5>
-<a name="id1133600"></a>
+<a name="id1191355"></a>
 <a class="link" href="uniform_dist.html#math_toolkit.dist.dist_ref.dists.uniform_dist.member_functions">Member
 Functions</a>
 </h5>
@@ -144,7 +144,7 @@
 Returns the upper parameter of this distribution.
 
<a name="math_toolkit.dist.dist_ref.dists.uniform_dist.non_member_accessors"></a><h5>
-<a name="id1133766"></a>
+<a name="id1191520"></a>
 <a class="link" href="uniform_dist.html#math_toolkit.dist.dist_ref.dists.uniform_dist.non_member_accessors">Non-member
 Accessors</a>
 </h5>
@@ -165,7 +165,7 @@
 range is only lower <= x <= upper.
 
<a name="math_toolkit.dist.dist_ref.dists.uniform_dist.accuracy"></a><h5>
-<a name="id1133870"></a>
+<a name="id1191625"></a>
 <a class="link" href="uniform_dist.html#math_toolkit.dist.dist_ref.dists.uniform_dist.accuracy">Accuracy</a>
 </h5>

@@ -173,7 +173,7 @@
 and so should have errors within an epsilon or two.
 
<a name="math_toolkit.dist.dist_ref.dists.uniform_dist.implementation"></a><h5>
-<a name="id1133889"></a>
+<a name="id1191644"></a>
 <a class="link" href="uniform_dist.html#math_toolkit.dist.dist_ref.dists.uniform_dist.implementation">Implementation</a>
 </h5>

@@ -337,7 +337,7 @@
</tbody>
</table></div>
<a name="math_toolkit.dist.dist_ref.dists.uniform_dist.references"></a><h5>
-<a name="id1134453"></a>
+<a name="id1191922"></a>
 <a class="link" href="uniform_dist.html#math_toolkit.dist.dist_ref.dists.uniform_dist.references">References</a>
 </h5>
<div class="itemizedlist"><ul type="disc">
@@ -357,9 +357,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/math_toolkit/dist/dist_ref/dists/weibull.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/weibull.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/weibull.html 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -65,7 +65,7 @@
 f(x; α, β) = (α/β) * (x / β)α - 1 * e-(x/β)α
 

- For shape parameter α > 0, and scale parameter β > 0, and x > 0.
+ For shape parameter α > 0, and scale parameter β > 0, and x > 0.
 

 The Weibull distribution is often used in the field of failure analysis;
@@ -74,14 +74,14 @@
 
<div class="itemizedlist"><ul type="disc">
<li>
- constant over time, then α = 1, suggests that items are failing from
+ constant over time, then α = 1, suggests that items are failing from
 random events.
 </li>
<li>
- decreases over time, then α < 1, suggesting "infant mortality".
+ decreases over time, then α < 1, suggesting "infant mortality".
 </li>
<li>
- increases over time, then α > 1, suggesting "wear out"
+ increases over time, then α > 1, suggesting "wear out"
 - more likely to fail as time goes by.
 </li>
</ul></div>
@@ -100,21 +100,21 @@
 <img src="../../../../../graphs/weibull_pdf2.png" align="middle">
 
<a name="math_toolkit.dist.dist_ref.dists.weibull.related_distributions"></a><h5>
-<a name="id1132288"></a>
+<a name="id1190031"></a>
 <a class="link" href="weibull.html#math_toolkit.dist.dist_ref.dists.weibull.related_distributions">Related
 distributions</a>
 </h5>

- When α = 3, the <a href="http://en.wikipedia.org/wiki/Weibull_distribution" target="_top">Weibull
+ When α = 3, the <a href="http://en.wikipedia.org/wiki/Weibull_distribution" target="_top">Weibull
 distribution</a> appears similar to the <a href="http://en.wikipedia.org/wiki/Normal_distribution" target="_top">normal
- distribution</a>. When α = 1, the Weibull distribution reduces to the
+ distribution</a>. When α = 1, the Weibull distribution reduces to the
 <a href="http://en.wikipedia.org/wiki/Exponential_distribution" target="_top">exponential
 distribution</a>. The relationship of the types of extreme value
 distributions, of which the Weibull is but one, is discussed by <a href="http://www.worldscibooks.com/mathematics/p191.html" target="_top">Extreme Value
 Distributions, Theory and Applications Samuel Kotz & Saralees Nadarajah</a>.
 
<a name="math_toolkit.dist.dist_ref.dists.weibull.member_functions"></a><h5>
-<a name="id1132330"></a>
+<a name="id1190072"></a>
 <a class="link" href="weibull.html#math_toolkit.dist.dist_ref.dists.weibull.member_functions">Member
 Functions</a>
 </h5>
@@ -140,7 +140,7 @@
 Returns the scale parameter of this distribution.
 
<a name="math_toolkit.dist.dist_ref.dists.weibull.non_member_accessors"></a><h5>
-<a name="id1132489"></a>
+<a name="id1190244"></a>
 <a class="link" href="weibull.html#math_toolkit.dist.dist_ref.dists.weibull.non_member_accessors">Non-member
 Accessors</a>
 </h5>
@@ -160,7 +160,7 @@
 The domain of the random variable is [0, ∞].
 
<a name="math_toolkit.dist.dist_ref.dists.weibull.accuracy"></a><h5>
-<a name="id1132588"></a>
+<a name="id1190343"></a>
 <a class="link" href="weibull.html#math_toolkit.dist.dist_ref.dists.weibull.accuracy">Accuracy</a>
 </h5>

@@ -170,11 +170,11 @@
 as such should have very low error rates.
 
<a name="math_toolkit.dist.dist_ref.dists.weibull.implementation"></a><h5>
-<a name="id1132629"></a>
+<a name="id1190384"></a>
 <a class="link" href="weibull.html#math_toolkit.dist.dist_ref.dists.weibull.implementation">Implementation</a>
 </h5>

- In the following table α is the shape parameter of the distribution, β is
+ In the following table α is the shape parameter of the distribution, β is
 it's scale parameter, x is the random variate,
 p is the probability and q = 1-p.
 
@@ -337,7 +337,7 @@
</tbody>
</table></div>
<a name="math_toolkit.dist.dist_ref.dists.weibull.references"></a><h5>
-<a name="id1132957"></a>
+<a name="id1190712"></a>
 <a class="link" href="weibull.html#math_toolkit.dist.dist_ref.dists.weibull.references">References</a>
 </h5>
<div class="itemizedlist"><ul type="disc">
@@ -357,9 +357,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -28,8 +28,8 @@
</h4></div></div></div>

 Properties that are common to all distributions are accessed via non-member
- getter functions. This allows more of these functions to be added over
- time as the need arises. Unfortunately the literature uses many different
+ getter functions: non-membership allows more of these functions to be added
+ over time, as the need arises. Unfortunately the literature uses many different
 and confusing names to refer to a rather small number of actual concepts;
 refer to the <a class="link" href="nmp.html#concept_index">concept index</a> to find
 the property you want by the name you are most familiar with. Or use the
@@ -37,7 +37,7 @@
 the function you want if you already know its name.
 
<a name="function_index"></a><a name="math_toolkit.dist.dist_ref.nmp.function_index"></a><h5>
-<a name="id1074762"></a>
+<a name="id1132552"></a>
 <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp.function_index">Function
 Index</a>
 </h5>
@@ -95,7 +95,7 @@
 </li>
</ul></div>
<a name="concept_index"></a><a name="math_toolkit.dist.dist_ref.nmp.conceptual_index"></a><h5>
-<a name="id1074987"></a>
+<a name="id1132776"></a>
 <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp.conceptual_index">Conceptual
 Index</a>
 </h5>
@@ -182,7 +182,7 @@
 </li>
</ul></div>
<a name="math.dist.cdf"></a><a name="math_toolkit.dist.dist_ref.nmp.cumulative_distribution_function"></a><h5>
-<a name="id1075323"></a>
+<a name="id1133112"></a>
 <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp.cumulative_distribution_function">Cumulative
 Distribution Function</a>
 </h5>
@@ -200,13 +200,13 @@
 if the random variable is outside the defined range for the distribution.
 

- For example the following graph shows the cdf for the normal distribution:
+ For example, the following graph shows the cdf for the normal distribution:
 

 <img src="../../../../graphs/cdf.png" alt="cdf">
 
<a name="math.dist.ccdf"></a><a name="math_toolkit.dist.dist_ref.nmp.complement_of_the_cumulative_distribution_function"></a><h5>
-<a name="id1077929"></a>
+<a name="id1133283"></a>
 <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp.complement_of_the_cumulative_distribution_function">Complement
 of the Cumulative Distribution Function</a>
 </h5>
@@ -236,8 +236,8 @@
std::cout << cdf(complement(norm, 2.0)) << std::endl;
</pre>

- For example the following graph shows the __complement of the cdf for the
- normal distribution:
+ For example, the following graph shows the __complement of the cdf for
+ the normal distribution:
 

 <img src="../../../../graphs/survival.png" alt="survival">
@@ -247,7 +247,7 @@
 complement is useful and when it should be used.
 
<a name="math.dist.hazard"></a><a name="math_toolkit.dist.dist_ref.nmp.hazard_function"></a><h5>
-<a name="id1078218"></a>
+<a name="id1133572"></a>
 <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp.hazard_function">Hazard Function</a>
 </h5>
<pre class="programlisting">template <class RealType, class <a class="link" href="../../policy.html" title="Policies">Policy</a>>
@@ -275,7 +275,7 @@
 </td></tr>
</table></div>
<a name="math.dist.chf"></a><a name="math_toolkit.dist.dist_ref.nmp.cumulative_hazard_function"></a><h5>
-<a name="id1078400"></a>
+<a name="id1133754"></a>
 <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp.cumulative_hazard_function">Cumulative
 Hazard Function</a>
 </h5>
@@ -303,7 +303,7 @@
 </td></tr>
</table></div>
<a name="math.dist.mean"></a><a name="math_toolkit.dist.dist_ref.nmp.mean"></a><h5>
-<a name="id1078583"></a>
+<a name="id1133937"></a>
 <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp.mean">mean</a>
 </h5>
<pre class="programlisting">template<class RealType, class <a class="link" href="../../policy.html" title="Policies">Policy</a>>
@@ -318,7 +318,7 @@
 distribution).
 
<a name="math.dist.median"></a><a name="math_toolkit.dist.dist_ref.nmp.median"></a><h5>
-<a name="id1078700"></a>
+<a name="id1134054"></a>
 <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp.median">median</a>
 </h5>
<pre class="programlisting">template<class RealType, class <a class="link" href="../../policy.html" title="Policies">Policy</a>>
@@ -328,7 +328,7 @@
 Returns the median of the distribution dist.
 
<a name="math.dist.mode"></a><a name="math_toolkit.dist.dist_ref.nmp.mode"></a><h5>
-<a name="id1078809"></a>
+<a name="id1134164"></a>
 <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp.mode">mode</a>
 </h5>
<pre class="programlisting">template<class RealType, <a class="link" href="../../policy.html" title="Policies">Policy</a>>
@@ -342,7 +342,7 @@
 if the distribution does not have a defined mode.
 
<a name="math.dist.pdf"></a><a name="math_toolkit.dist.dist_ref.nmp.probability_density_function"></a><h5>
-<a name="id1078925"></a>
+<a name="id1134306"></a>
 <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp.probability_density_function">Probability
 Density Function</a>
 </h5>
@@ -365,14 +365,14 @@
 if the random variable is outside the defined range for the distribution.
 

- For example for a standard normal distribution the pdf looks like this:
+ For example, for a standard normal distribution the pdf looks like this:
 

 <img src="../../../../graphs/pdf.png" alt="pdf">
 
<a name="math.dist.range"></a><a name="math_toolkit.dist.dist_ref.nmp.range"></a><h5>
-<a name="id1079094"></a>
- <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp.range">range</a>
+<a name="id1134475"></a>
+ <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp.range">Range</a>
 </h5>
<pre class="programlisting">template<class RealType, class <a class="link" href="../../policy.html" title="Policies">Policy</a>>
std::pair<RealType, RealType> range(const Distribution-Type<RealType, <a class="link" href="../../policy.html" title="Policies">Policy</a>>& dist);
@@ -381,7 +381,7 @@
 Returns the valid range of the random variable over distribution dist.
 
<a name="math.dist.quantile"></a><a name="math_toolkit.dist.dist_ref.nmp.quantile"></a><h5>
-<a name="id1079229"></a>
+<a name="id1134611"></a>
 <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp.quantile">Quantile</a>
 </h5>
<pre class="programlisting">template <class RealType, class <a class="link" href="../../policy.html" title="Policies">Policy</a>>
@@ -410,7 +410,7 @@
 <img src="../../../../graphs/quantile.png" alt="quantile">
 
<a name="math.dist.quantile_c"></a><a name="math_toolkit.dist.dist_ref.nmp.quantile_from_the_complement_of_the_probability_"></a><h5>
-<a name="id1079453"></a>
+<a name="id1134834"></a>
 <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp.quantile_from_the_complement_of_the_probability_">Quantile
 from the complement of the probability.</a>
 </h5>
@@ -456,7 +456,7 @@
 <img src="../../../../graphs/survival_inv.png" alt="survival_inv">
 
<a name="math.dist.sd"></a><a name="math_toolkit.dist.dist_ref.nmp.standard_deviation"></a><h5>
-<a name="id1079793"></a>
+<a name="id1135175"></a>
 <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp.standard_deviation">Standard
 Deviation</a>
 </h5>
@@ -471,7 +471,7 @@
 if the distribution does not have a defined standard deviation.
 
<a name="math.dist.support"></a><a name="math_toolkit.dist.dist_ref.nmp.support"></a><h5>
-<a name="id1079913"></a>
+<a name="id1135295"></a>
 <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp.support">support</a>
 </h5>
<pre class="programlisting">template<class RealType, class <a class="link" href="../../policy.html" title="Policies">Policy</a>>
@@ -488,7 +488,7 @@
 where the pdf is zero, and the cdf zero or unity.
 
<a name="math.dist.variance"></a><a name="math_toolkit.dist.dist_ref.nmp.variance"></a><h5>
-<a name="id1080610"></a>
+<a name="id1135439"></a>
 <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp.variance">Variance</a>
 </h5>
<pre class="programlisting">template <class RealType, class <a class="link" href="../../policy.html" title="Policies">Policy</a>>
@@ -502,7 +502,7 @@
 if the distribution does not have a defined variance.
 
<a name="math.dist.skewness"></a><a name="math_toolkit.dist.dist_ref.nmp.skewness"></a><h5>
-<a name="id1080729"></a>
+<a name="id1135557"></a>
 <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp.skewness">Skewness</a>
 </h5>
<pre class="programlisting">template <class RealType, class <a class="link" href="../../policy.html" title="Policies">Policy</a>>
@@ -516,7 +516,7 @@
 if the distribution does not have a defined skewness.
 
<a name="math.dist.kurtosis"></a><a name="math_toolkit.dist.dist_ref.nmp.kurtosis"></a><h5>
-<a name="id1080848"></a>
+<a name="id1135676"></a>
 <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp.kurtosis">Kurtosis</a>
 </h5>
<pre class="programlisting">template <class RealType, class <a class="link" href="../../policy.html" title="Policies">Policy</a>>
@@ -527,11 +527,11 @@
 dist.
 

- kertosis = β2= μ4 / μ22
+ kertosis = β2 = μ4 / μ22
 

- Where μi is the i'th central moment of the distribution, and in particular
- μ2 is the variance of the distribution.
+ Where μi is the i'th central moment of the distribution, and in particular
+ μ2 is the variance of the distribution.
 

 The kurtosis is a measure of the "peakedness" of a distribution.
@@ -558,7 +558,7 @@
 'Proper' kurtosis can have a value from zero to + infinity.
 
<a name="math.dist.kurtosis_excess"></a><a name="math_toolkit.dist.dist_ref.nmp.kurtosis_excess"></a><h5>
-<a name="id1081055"></a>
+<a name="id1135884"></a>
 <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp.kurtosis_excess">Kurtosis
 excess</a>
 </h5>
@@ -569,11 +569,11 @@
 Returns the kurtosis excess of the distribution dist.
 

- kurtosis excess = γ2= μ4 / μ22- 3 = kurtosis - 3
+ kurtosis excess = γ2 = μ4 / μ22 - 3 = kurtosis - 3
 

- Where μi is the i'th central moment of the distribution, and in particular
- μ2 is the variance of the distribution.
+ Where μi is the i'th central moment of the distribution, and in particular
+ μ2 is the variance of the distribution.
 

 The kurtosis excess is a measure of the "peakedness" of a distribution,
@@ -593,7 +593,7 @@
 The kurtosis excess of a normal distribution is zero.
 
<a name="cdfPQ"></a><a name="math_toolkit.dist.dist_ref.nmp.p_and_q"></a><h5>
-<a name="id1081240"></a>
+<a name="id1136070"></a>
 <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp.p_and_q">P and Q</a>
 </h5>

@@ -603,7 +603,7 @@
 returned by these functions.
 
<a name="percent"></a><a name="math_toolkit.dist.dist_ref.nmp.percent_point_function"></a><h5>
-<a name="id1081270"></a>
+<a name="id1136100"></a>
 <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp.percent_point_function">Percent
 Point Function</a>
 </h5>
@@ -612,7 +612,7 @@
 the <a class="link" href="nmp.html#math.dist.quantile">Quantile</a>.
 
<a name="cdf_inv"></a><a name="math_toolkit.dist.dist_ref.nmp.inverse_cdf_function_"></a><h5>
-<a name="id1081295"></a>
+<a name="id1136125"></a>
 <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp.inverse_cdf_function_">Inverse
 CDF Function.</a>
 </h5>
@@ -621,7 +621,7 @@
 <a class="link" href="nmp.html#math.dist.quantile">Quantile</a>.
 
<a name="survival_inv"></a><a name="math_toolkit.dist.dist_ref.nmp.inverse_survival_function_"></a><h5>
-<a name="id1081323"></a>
+<a name="id1136153"></a>
 <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp.inverse_survival_function_">Inverse
 Survival Function.</a>
 </h5>
@@ -629,7 +629,7 @@
 The inverse of the survival function, is the same as computing the <a class="link" href="nmp.html#math.dist.quantile_c">quantile from the complement of the probability</a>.
 
<a name="pmf"></a><a name="math_toolkit.dist.dist_ref.nmp.probability_mass_function"></a><h5>
-<a name="id1081353"></a>
+<a name="id1136183"></a>
 <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp.probability_mass_function">Probability
 Mass Function</a>
 </h5>
@@ -643,7 +643,7 @@
 applies to continuous distributions.
 
<a name="lower_critical"></a><a name="math_toolkit.dist.dist_ref.nmp.lower_critical_value_"></a><h5>
-<a name="id1081391"></a>
+<a name="id1136221"></a>
 <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp.lower_critical_value_">Lower
 Critical Value.</a>
 </h5>
@@ -653,7 +653,7 @@
 the <a class="link" href="nmp.html#math.dist.quantile">Quantile</a>.
 
<a name="upper_critical"></a><a name="math_toolkit.dist.dist_ref.nmp.upper_critical_value_"></a><h5>
-<a name="id1081417"></a>
+<a name="id1136246"></a>
 <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp.upper_critical_value_">Upper
 Critical Value.</a>
 </h5>
@@ -664,7 +664,7 @@
 complement of the probability</a>.
 
<a name="survival"></a><a name="math_toolkit.dist.dist_ref.nmp.survival_function"></a><h5>
-<a name="id1081443"></a>
+<a name="id1136273"></a>
 <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp.survival_function">Survival
 Function</a>
 </h5>
@@ -675,9 +675,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -27,7 +27,7 @@
<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>
<a name="math_toolkit.dist.future.adding_additional_location_and_scale_parameters"></a><h5>
-<a name="id1135551"></a>
+<a name="id1194873"></a>
 <a class="link" href="future.html#math_toolkit.dist.future.adding_additional_location_and_scale_parameters">Adding
 Additional Location and Scale Parameters</a>
 </h5>
@@ -55,7 +55,7 @@
 functions.
 
<a name="math_toolkit.dist.future.an__quot_any_distribution_quot__class"></a><h5>
-<a name="id1135715"></a>
+<a name="id1195038"></a>
 <a class="link" href="future.html#math_toolkit.dist.future.an__quot_any_distribution_quot__class">An
 "any_distribution" class</a>
 </h5>
@@ -84,7 +84,7 @@
 use case: this needs more investigation.
 
<a name="math_toolkit.dist.future.higher_level_hypothesis_tests"></a><h5>
-<a name="id1135924"></a>
+<a name="id1195246"></a>
 <a class="link" href="future.html#math_toolkit.dist.future.higher_level_hypothesis_tests">Higher
 Level Hypothesis Tests</a>
 </h5>
@@ -104,7 +104,7 @@
 expected_mean.
 
<a name="math_toolkit.dist.future.integration_with_statistical_accumulators"></a><h5>
-<a name="id1136086"></a>
+<a name="id1195408"></a>
 <a class="link" href="future.html#math_toolkit.dist.future.integration_with_statistical_accumulators">Integration
 With Statistical Accumulators</a>
 </h5>
@@ -126,9 +126,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -104,6 +104,8 @@
 Distribution Examples</a></dt>
<dd><dl><dt><a href="stat_tut/weg/normal_example/normal_misc.html">
 Some Miscellaneous Examples of the Normal (Gaussian) Distribution</a></dt></dl></dd>
+<dt><a href="stat_tut/weg/inverse_gamma_eg.html">
+ Inverse Gamma Distribution Bayes Example</a></dt>
<dt><a href="stat_tut/weg/nccs_eg.html"> Non Central
 Chi Squared Example</a></dt>
<dd><dl><dt><a href="stat_tut/weg/nccs_eg/nccs_power_eg.html">
@@ -138,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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -31,15 +31,16 @@
 Note that the <a href="http://en.wikipedia.org/wiki/Discrete_probability_distribution" target="_top">discrete
 distributions</a>, including the binomial, negative binomial, Poisson
 & Bernoulli, are all mathematically defined as discrete functions:
- only integral values of the random variate are envisaged and the functions
- are only defined at these integral values. However because the method of
- calculation often uses continuous functions, it is convenient to treat
- them as if they were continuous functions, and permit non-integral values
- of their parameters.
+ only integral values of the <a href="http://en.wikipedia.org/wiki/Random_variate" target="_top">random
+ variate</a> are envisaged and the functions are only defined at these
+ integral values. However because the method of calculation often uses continuous
+ functions, it is convenient to treat them as if they were continuous functions,
+ and permit non-integral values of their parameters.
 

 To enforce a strict mathematical model, users may use floor or ceil functions
- on the random variate, prior to calling the distribution function, to enforce
+ on the <a href="http://en.wikipedia.org/wiki/Random_variate" target="_top">random
+ variate</a>, prior to calling the distribution function, to enforce
 integral values.
 

@@ -83,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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -78,7 +78,7 @@
</table></div>

 For example, the binomial distribution has two parameters: n (the number
- of trials) and p (the probability of success on one trial).
+ of trials) and p (the probability of success on any one trial).
 

 The <code class="computeroutput">binomial_distribution</code>
@@ -90,9 +90,10 @@
 RealType p);</code>
 

- For this distribution the random variate is k: the number of successes
- observed. The probability density/mass function (pdf) is therefore written
- as f(k; n, p).
+ For this distribution the <a href="http://en.wikipedia.org/wiki/Random_variate" target="_top">random
+ variate</a> is k: the number of successes observed. The probability
+ density/mass function (pdf) is therefore written as f(k; n,
+ p).
 
<div class="note"><table border="0" summary="Note">
<tr>
@@ -106,16 +107,38 @@
 Random Variates and Distribution Parameters
 

- Random variates
- and <a href="http://en.wikipedia.org/wiki/Parameter" target="_top">distribution
+ The concept of a <a href="http://en.wikipedia.org/wiki/Random_variable" target="_top">random
+ variable</a> is closely linked to the term <a href="http://en.wikipedia.org/wiki/Random_variate" target="_top">random
+ variate</a>: a random variate is a particular value (outcome) of
+ a random variable. and <a href="http://en.wikipedia.org/wiki/Parameter" target="_top">distribution
 parameters</a> are conventionally distinguished (for example in
- Wikipedia and Wolfram MathWorld by placing a semi-colon (or sometimes
- vertical bar) after the random variate (whose value you 'choose'),
- to separate the variate from the parameter(s) that defines the shape
- of the distribution.
+ Wikipedia and Wolfram MathWorld) by placing a semi-colon or vertical
+ bar) after the <a href="http://en.wikipedia.org/wiki/Random_variable" target="_top">random
+ variable</a> (whose value you 'choose'), to separate the variate
+ from the parameter(s) that defines the shape of the distribution. 
+ For example, the binomial distribution probability distribution function
+ (PDF) is written as f(k| n, p) = Pr(K = k|n, p)
+ = probability of observing k successes out of n trials. K is the random variable,
+ k is the <a href="http://en.wikipedia.org/wiki/Random_variate" target="_top">random
+ variate</a>, the parameters are n (trials) and p (probability).
 
</td></tr>
</table></div>
+<div class="note"><table border="0" summary="Note">
+<tr>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../../../../doc/src/images/note.png"></td>
+<th align="left">Note</th>
+</tr>
+<tr><td align="left" valign="top">
+ By convention, <a href="http://en.wikipedia.org/wiki/Random_variate" target="_top">random
+ variate</a> are lower case, usually k is integral, x if real, and
+ random variable
+ are upper case, K if integral, X if real. But this implementation treats
+ all as floating point values <code class="computeroutput">RealType</code>,
+ so if you really want an integral result, you must round: see note
+ on Discrete Probability Distributions below for details.
+ </td></tr>
+</table></div>

 As noted above the non-member function <code class="computeroutput">pdf</code>
 has one parameter for the distribution object, and a second for the random
@@ -125,13 +148,14 @@
 <code class="computeroutput">pdf(binomial_distribution<RealType>(n, p), k);</code>
 

- The ranges of random variate values that are permitted and are supported
- can be tested by using two functions <code class="computeroutput">range</code>
+ The ranges of <a href="http://en.wikipedia.org/wiki/Random_variate" target="_top">random
+ variate</a> values that are permitted and are supported can be tested
+ by using two functions <code class="computeroutput">range</code>
 and <code class="computeroutput">support</code>.
 

- The distribution (effectively the random variate) is said to be 'supported'
- over a range that is <a href="http://en.wikipedia.org/wiki/Probability_distribution" target="_top">"the
+ The distribution (effectively the <a href="http://en.wikipedia.org/wiki/Random_variate" target="_top">random
+ variate</a>) is said to be 'supported' over a range that is <a href="http://en.wikipedia.org/wiki/Probability_distribution" target="_top">"the
 smallest closed set whose complement has probability zero"</a>.
 MathWorld uses the word 'defined' for this range. Non-mathematicians
 might say it means the 'interesting' smallest range of random variate
@@ -141,16 +165,16 @@

 For most distributions, with probability distribution functions one might
 describe as 'well-behaved', we have decided that it is most useful for
- the supported range to exclude random variate values like exact zero
- if the end point is discontinuous. For
- example, the Weibull (scale 1, shape 1) distribution smoothly heads for
- unity as the random variate x declines towards zero. But at x = zero,
- the value of the pdf is suddenly exactly zero, by definition. If you
- are plotting the PDF, or otherwise calculating, zero is not the most
- useful value for the lower limit of supported, as we discovered. So for
- this, and similar distributions, we have decided it is most numerically
- useful to use the closest value to zero, min_value, for the limit of
- the supported range. (The <code class="computeroutput">range</code>
+ the supported range to exclude random
+ variate values like exact zero if the end point
+ is discontinuous. For example, the Weibull (scale 1, shape
+ 1) distribution smoothly heads for unity as the random variate x declines
+ towards zero. But at x = zero, the value of the pdf is suddenly exactly
+ zero, by definition. If you are plotting the PDF, or otherwise calculating,
+ zero is not the most useful value for the lower limit of supported, as
+ we discovered. So for this, and similar distributions, we have decided
+ it is most numerically useful to use the closest value to zero, min_value,
+ for the limit of the supported range. (The <code class="computeroutput">range</code>
 remains from zero, so you will still get <code class="computeroutput">pdf(weibull, 0)
 == 0</code>).
 (Exponential and gamma distributions have similarly discontinuous functions).
@@ -223,9 +247,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -33,18 +33,38 @@

 In order to use a distribution my_distribution you
 will need to include either the header <boost/math/distributions/my_distribution.hpp>
- or the "include everything" header: <boost/math/distributions.hpp>.
+ or the "include all the distributions" header: <boost/math/distributions.hpp>.
 

 For example, to use the Students-t distribution include either <boost/math/distributions/students_t.hpp>
 or <boost/math/distributions.hpp>
 
+
+ You also need to bring distribution names into scope, perhaps with a
+ <code class="computeroutput">using namespace
+ boost::math;</code>
+ declaration,
+ 
+
+ or specific <code class="computeroutput">using</code> declarations
+ like <code class="computeroutput">using boost::math::normal;</code> (recommended).
+ 
+<div class="caution"><table border="0" summary="Caution">
+<tr>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Caution]" src="../../../../../../../../../doc/src/images/caution.png"></td>
+<th align="left">Caution</th>
+</tr>
+<tr><td align="left" valign="top">
+ Some math function names are also used in namespace std so including
+ <random> could cause ambiguity!
+ </td></tr>
+</table></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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -74,7 +74,12 @@
 - is nearly as convenient). Probably 95% of uses are covered by these
 typedefs:
 
-<pre class="programlisting">using namespace boost::math;
+<pre class="programlisting">// using namespace boost::math; // Avoid potential ambiguity with names in std <random>
+// Safer to declare specific functions with using statement(s):
+
+using boost::math::beta_distribution;
+using boost::math::binomial_distribution;
+using boost::math::students_t;

// Construct a students_t distribution with 4 degrees of freedom:
students_t d1(4);
@@ -114,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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -31,16 +31,17 @@
 <a href="http://en.wikipedia.org/wiki/Random_variate" target="_top">Random variates</a>
 and distribution parameters
 are conventionally distinguished (for example in Wikipedia and Wolfram
- MathWorld by placing a semi-colon after the random variate (whose value
- you 'choose'), to separate the variate from the parameter(s) that defines
- the shape of the distribution.
+ MathWorld by placing a semi-colon after the <a href="http://en.wikipedia.org/wiki/Random_variate" target="_top">random
+ variate</a> (whose value you 'choose'), to separate the variate from
+ the parameter(s) that defines the shape of the distribution.
 

 For example, the binomial distribution has two parameters: n (the number
 of trials) and p (the probability of success on one trial). It also has
- the random variate k: the number of successes observed.
- This means the probability density/mass function (pdf) is written as f(k;
- n, p).
+ the random variate
+ k: the number of successes observed. This means the
+ probability density/mass function (pdf) is written as f(k; n,
+ p).
 

 Translating this into code the <code class="computeroutput">binomial_distribution</code>
@@ -51,17 +52,18 @@

 While the function <code class="computeroutput">pdf</code>
 has one argument specifying the distribution type (which includes it's
- parameters, if any), and a second argument for the random variate. So taking
- our binomial distribution example, we would write:
+ parameters, if any), and a second argument for the <a href="http://en.wikipedia.org/wiki/Random_variate" target="_top">random
+ variate</a>. So taking our binomial distribution example, we would
+ write:
 
<pre class="programlisting">pdf(binomial_distribution<RealType>(n, p), k);
</pre>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -87,6 +87,8 @@
 Distribution Examples</a></dt>
<dd><dl><dt><a href="weg/normal_example/normal_misc.html">
 Some Miscellaneous Examples of the Normal (Gaussian) Distribution</a></dt></dl></dd>
+<dt><a href="weg/inverse_gamma_eg.html">
+ Inverse Gamma Distribution Bayes Example</a></dt>
<dt><a href="weg/nccs_eg.html"> Non Central
 Chi Squared Example</a></dt>
<dd><dl><dt><a href="weg/nccs_eg/nccs_power_eg.html">
@@ -112,12 +114,14 @@
 

 
+
+ 
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -100,7 +100,7 @@
 

 Please note that calculating two separate single sided bounds,
- each with risk level αis not the same thing as calculating a two sided
+ each with risk level α is not the same thing as calculating a two sided
 interval. Had we calculate two single-sided intervals each with a risk
 that the true value is outside the interval of α, then:
 
@@ -227,9 +227,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -391,9 +391,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -60,6 +60,10 @@
 using std::ios; using std::flush; using std::left; using std::right; using std::fixed;
#include <iomanip>
 using std::setw; using std::setprecision;
+#include <exception>
+ using std::exception;
+
+
</pre>

 
@@ -498,7 +502,7 @@
 <a name="math_toolkit.dist.stat_tut.weg.binom_eg.binomial_quiz_example.using_binomial_distribution_moments"></a>
 
<h5>
-<a name="id1028975"></a>
+<a name="id1083636"></a>
 <a class="link" href="binomial_quiz_example.html#math_toolkit.dist.stat_tut.weg.binom_eg.binomial_quiz_example.using_binomial_distribution_moments">Using
 Binomial distribution moments</a>
 </h5>
@@ -535,7 +539,7 @@
 <a name="math_toolkit.dist.stat_tut.weg.binom_eg.binomial_quiz_example.quantiles"></a>
 
<h5>
-<a name="id1029347"></a>
+<a name="id1084008"></a>
 <a class="link" href="binomial_quiz_example.html#math_toolkit.dist.stat_tut.weg.binom_eg.binomial_quiz_example.quantiles">Quantiles</a>
 </h5>

@@ -727,9 +731,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -39,9 +39,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -139,7 +139,7 @@
 is between 0.00551 and 0.00729.
 
<a name="math_toolkit.dist.stat_tut.weg.cs_eg.chi_sq_intervals.confidence_intervals_as_a_function_of_the_number_of_observations"></a><h5>
-<a name="id1012421"></a>
+<a name="id1068354"></a>
 <a class="link" href="chi_sq_intervals.html#math_toolkit.dist.stat_tut.weg.cs_eg.chi_sq_intervals.confidence_intervals_as_a_function_of_the_number_of_observations">Confidence
 intervals as a function of the number of observations</a>
 </h5>
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -166,9 +166,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -84,7 +84,7 @@

 

- But this is inconveniently long, so by writing
+ But this is inconveniently long, so we might be tempted to write
 

 
@@ -97,7 +97,8 @@

 

- or
+ but this might risk ambiguity with names in std random so *much better
+ is explicit <code class="computeroutput">using boost::math:: </code> * ... statements like
 

 
@@ -110,7 +111,7 @@

 

- we can reduce typing.
+ and we can still reduce typing.
 

 
@@ -296,22 +297,22 @@


<pre class="programlisting">// Explicit double precision:
-negative_binomial_distribution<double> mydist1(8., 0.25);
+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.
-negative_binomial_distribution<float> mydist3(8, 0.25);
+negative_binomial_distribution<float> mydist3(8, 0.25);

// Explicit float precision, float arguments, so no conversion:
-negative_binomial_distribution<float> mydist4(8.F, 0.25F);
+negative_binomial_distribution<float> mydist4(8.F, 0.25F);

// Explicit float precision, integer arguments promoted to float.
-negative_binomial_distribution<float> mydist5(8, 1);
+negative_binomial_distribution<float> mydist5(8, 1);

// Explicit double precision:
-negative_binomial_distribution<double> mydist6(8., 0.25);
+negative_binomial_distribution<double> mydist6(8., 0.25);

// Explicit long double precision:
negative_binomial_distribution<long double> mydist7(8., 0.25);</pre>
@@ -332,7 +333,7 @@
 <a name="math_toolkit.dist.stat_tut.weg.dist_construct_eg.default_arguments_to_distribution_constructors_"></a>
 
<h6>
-<a name="id1002600"></a>
+<a name="id1057053"></a>
 <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>
@@ -377,7 +378,7 @@


<pre class="programlisting"> 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.
@@ -396,9 +397,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -142,14 +142,17 @@

 try
 {
- errno = 0;
- students_t dist(degrees_of_freedom); // exception is thrown here if enabled
+ errno = 0; // Clear/reset.
+ students_t dist(degrees_of_freedom); // exception is thrown here if enabled.
 double p = cdf(dist, t);
- // test for error reported by other means:
+ // Test for error reported by other means:
 if((boost::math::isnan)(p))
 {
 cout << "cdf returned a NaN!" << endl;
- cout << "errno is set to: " << errno << endl;
+ if (errno != 0)
+ { // So errno has been set.
+ cout << "errno is set to: " << errno << endl;
+ }
 }
 else
 cout << "Probability of Student's t is " << p << endl;
@@ -159,7 +162,6 @@
 std::cout <<
 "\n""Message from thrown exception was:\n " << e.what() << std::endl;
 }
-
 return 0;
} // int main()</pre>

@@ -168,7 +170,7 @@
 

 Here's what the program output looks like with a default build (one
- that does throw exceptions):
+ that does throw exceptions):
 


@@ -201,7 +203,6 @@
<pre class="programlisting">Example error handling using Student's t function.
BOOST_MATH_DOMAIN_ERROR_POLICY is set to: ignore_error
cdf returned a NaN!
-errno is set to: 0
</pre>

 
@@ -216,7 +217,7 @@

 

- Which gives the output:
+ Which gives the output show errno:
 


@@ -250,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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -55,6 +55,7 @@
 using std::setw; using std::setprecision;
#include <limits>
 using std::numeric_limits;
+
</pre>

 
@@ -177,7 +178,7 @@
 <a name="math_toolkit.dist.stat_tut.weg.find_eg.find_location_eg.controlling_error_handling_from_find_location"></a>
 
<h5>
-<a name="id1062739"></a>
+<a name="id1117471"></a>
 <a class="link" href="find_location_eg.html#math_toolkit.dist.stat_tut.weg.find_eg.find_location_eg.controlling_error_handling_from_find_location">Controlling
 Error Handling from find_location</a>
 </h5>
@@ -268,9 +269,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -55,6 +55,8 @@
 using std::setw; using std::setprecision;
#include <limits>
 using std::numeric_limits;
+#include <stdexcept>
+ using std::exception;
</pre>

 
@@ -62,7 +64,7 @@
 <a name="math_toolkit.dist.stat_tut.weg.find_eg.find_mean_and_sd_eg.using_find_location_and_find_scale_to_meet_dispensing_and_measurement_specifications"></a>
 
<h5>
-<a name="id1067602"></a>
+<a name="id1122649"></a>
 <a class="link" href="find_mean_and_sd_eg.html#math_toolkit.dist.stat_tut.weg.find_eg.find_mean_and_sd_eg.using_find_location_and_find_scale_to_meet_dispensing_and_measurement_specifications">Using
 find_location and find_scale to meet dispensing and measurement specifications</a>
 </h5>
@@ -246,7 +248,7 @@
 <a name="math_toolkit.dist.stat_tut.weg.find_eg.find_mean_and_sd_eg.using_cauchy_lorentz_instead_of_normal_distribution"></a>
 
<h5>
-<a name="id1069096"></a>
+<a name="id1123831"></a>
 <a class="link" href="find_mean_and_sd_eg.html#math_toolkit.dist.stat_tut.weg.find_eg.find_mean_and_sd_eg.using_cauchy_lorentz_instead_of_normal_distribution">Using
 Cauchy-Lorentz instead of normal distribution</a>
 </h5>
@@ -397,7 +399,7 @@
 <a name="math_toolkit.dist.stat_tut.weg.find_eg.find_mean_and_sd_eg.changing_the_scale_or_standard_deviation"></a>
 
<h5>
-<a name="id1069744"></a>
+<a name="id1124479"></a>
 <a class="link" href="find_mean_and_sd_eg.html#math_toolkit.dist.stat_tut.weg.find_eg.find_mean_and_sd_eg.changing_the_scale_or_standard_deviation">Changing
 the scale or standard deviation</a>
 </h5>
@@ -711,9 +713,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -179,7 +179,7 @@
 <a name="math_toolkit.dist.stat_tut.weg.find_eg.find_scale_eg.controlling_how_errors_from_find_scale_are_handled"></a>
 
<h5>
-<a name="id1064953"></a>
+<a name="id1120761"></a>
 <a class="link" href="find_scale_eg.html#math_toolkit.dist.stat_tut.weg.find_eg.find_scale_eg.controlling_how_errors_from_find_scale_are_handled">Controlling
 how Errors from find_scale are handled</a>
 </h5>
@@ -291,9 +291,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -6,7 +6,7 @@
<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../../../index.html" title="Math Toolkit">
<link rel="up" href="../weg.html" title="Worked Examples">
-<link rel="prev" href="normal_example/normal_misc.html" title="Some Miscellaneous Examples of the Normal (Gaussian) Distribution">
+<link rel="prev" href="inverse_gamma_eg.html" title="Inverse Gamma Distribution Bayes Example">
<link rel="next" href="nccs_eg/nccs_power_eg.html" title="Tables of the power function of the χ2 test.">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
@@ -20,7 +20,7 @@
</tr></table>
<hr>
<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/nccs_power_eg.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="inverse_gamma_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" lang="en">
<div class="titlepage"><div><div><h5 class="title">
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the Boost Software License, Version 1.0. (See accompanying
 file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
@@ -46,7 +46,7 @@
</tr></table>
<hr>
<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/nccs_power_eg.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="inverse_gamma_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>
</body>
</html>

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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -49,7 +49,12 @@


<pre class="programlisting">#include <boost/math/distributions/non_central_chi_squared.hpp>
+using boost::math::chi_squared;
+using boost::math::non_central_chi_squared;
+
#include <iostream>
+using std::cout; using std::endl;
+using std::setprecision;

int main()
{</pre>
@@ -66,12 +71,12 @@



-<pre class="programlisting">std::cout << "[table\n[[[nu]]";
+<pre class="programlisting">cout << "[table\n[[[nu]]";
for(int lam = 2; lam <= 20; lam += 2)
{
- std::cout << "[[lambda]=" << lam << "]";
+ cout << "[[lambda]=" << lam << "]";
}
-std::cout << "]\n";</pre>
+cout << "]\n";</pre>

 

@@ -92,7 +97,7 @@

<pre class="programlisting">for(int n = 2; n <= 20; ++n)
{
- std::cout << "[[" << n << "]";
+ cout << "[[" << n << "]";
 for(int lam = 2; lam <= 20; lam += 2)
 {</pre>

@@ -107,7 +112,7 @@



-<pre class="programlisting">double cs = quantile(complement(boost::math::chi_squared(n), 0.05));</pre>
+<pre class="programlisting">double cs = quantile(complement(chi_squared(n), 0.05));</pre>

 

@@ -121,7 +126,7 @@



-<pre class="programlisting">double beta = cdf(complement(boost::math::non_central_chi_squared(n, lam), cs));</pre>
+<pre class="programlisting">double beta = cdf(complement(non_central_chi_squared(n, lam), cs));</pre>

 

@@ -134,11 +139,11 @@



-<pre class="programlisting"> std::cout << "[" << std::setprecision(3) << beta << "]";
+<pre class="programlisting"> cout << "[" << setprecision(3) << beta << "]";
 }
- std::cout << "]" << std::endl;
+ cout << "]" << endl;
 }
- std::cout << "]" << std::endl;
+ cout << "]" << endl;
}</pre>

 
@@ -1327,9 +1332,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -233,9 +233,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -791,9 +791,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -135,9 +135,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -7,7 +7,7 @@
<link rel="home" href="../../../../../index.html" title="Math Toolkit">
<link rel="up" href="../normal_example.html" title="Normal Distribution Examples">
<link rel="prev" href="../normal_example.html" title="Normal Distribution Examples">
-<link rel="next" href="../nccs_eg.html" title="Non Central Chi Squared Example">
+<link rel="next" href="../inverse_gamma_eg.html" title="Inverse Gamma Distribution Bayes Example">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
@@ -20,7 +20,7 @@
</tr></table>
<hr>
<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="../nccs_eg.html"><img src="../../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
+<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_gamma_eg.html"><img src="../../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h6 class="title">
@@ -32,7 +32,7 @@
 illustrates their use.
 
<a name="math_toolkit.dist.stat_tut.weg.normal_example.normal_misc.traditional_tables"></a><h5>
-<a name="id1047538"></a>
+<a name="id1101598"></a>
 <a class="link" href="normal_misc.html#math_toolkit.dist.stat_tut.weg.normal_example.normal_misc.traditional_tables">Traditional
 Tables</a>
 </h5>
@@ -278,7 +278,7 @@

 
<a name="math_toolkit.dist.stat_tut.weg.normal_example.normal_misc.standard_deviations_either_side_of_the_mean"></a><h5>
-<a name="id1049871"></a>
+<a name="id1104490"></a>
 <a class="link" href="normal_misc.html#math_toolkit.dist.stat_tut.weg.normal_example.normal_misc.standard_deviations_either_side_of_the_mean">Standard
 deviations either side of the Mean</a>
 </h5>
@@ -346,12 +346,12 @@

 
<a name="math_toolkit.dist.stat_tut.weg.normal_example.normal_misc.some_simple_examples"></a><h5>
-<a name="id1050398"></a>
+<a name="id1106692"></a>
 <a class="link" href="normal_misc.html#math_toolkit.dist.stat_tut.weg.normal_example.normal_misc.some_simple_examples">Some
 simple examples</a>
 </h5>
<a name="math_toolkit.dist.stat_tut.weg.normal_example.normal_misc.life_of_light_bulbs"></a><h5>
-<a name="id1050411"></a>
+<a name="id1106706"></a>
 <a class="link" href="normal_misc.html#math_toolkit.dist.stat_tut.weg.normal_example.normal_misc.life_of_light_bulbs">Life
 of light bulbs</a>
 </h5>
@@ -435,7 +435,7 @@

 
<a name="math_toolkit.dist.stat_tut.weg.normal_example.normal_misc.how_many_onions_"></a><h5>
-<a name="id1052606"></a>
+<a name="id1107217"></a>
 <a class="link" href="normal_misc.html#math_toolkit.dist.stat_tut.weg.normal_example.normal_misc.how_many_onions_">How
 many onions?</a>
 </h5>
@@ -494,7 +494,7 @@

 
<a name="math_toolkit.dist.stat_tut.weg.normal_example.normal_misc.packing_beef"></a><h5>
-<a name="id1053023"></a>
+<a name="id1107634"></a>
 <a class="link" href="normal_misc.html#math_toolkit.dist.stat_tut.weg.normal_example.normal_misc.packing_beef">Packing
 beef</a>
 </h5>
@@ -703,7 +703,7 @@

 
<a name="math_toolkit.dist.stat_tut.weg.normal_example.normal_misc.length_of_bolts"></a><h5>
-<a name="id1055251"></a>
+<a name="id1109856"></a>
 <a class="link" href="normal_misc.html#math_toolkit.dist.stat_tut.weg.normal_example.normal_misc.length_of_bolts">Length
 of bolts</a>
 </h5>
@@ -744,9 +744,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the Boost Software License, Version 1.0. (See accompanying
 file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
@@ -754,7 +754,7 @@
</tr></table>
<hr>
<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="../nccs_eg.html"><img src="../../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
+<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_gamma_eg.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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -57,7 +57,7 @@
</tr>
<tr><td align="left" valign="top">

- The quantity α is the maximum acceptable risk of falsely rejecting
+ The quantity α is the maximum acceptable risk of falsely rejecting
 the null-hypothesis. The smaller the value of α the greater the strength
 of the test.
 
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -27,7 +27,7 @@
<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>
<a name="math_toolkit.extern_c.c99.supported_c99_functions"></a><h5>
-<a name="id1244484"></a>
+<a name="id1302671"></a>
 <a class="link" href="c99.html#math_toolkit.extern_c.c99.supported_c99_functions">Supported
 C99 Functions</a>
 </h5>
@@ -138,7 +138,7 @@
acosh(2); // integer argument is treated as a double, returns double.
</pre>
<a name="math_toolkit.extern_c.c99.quick_reference"></a><h5>
-<a name="id1247301"></a>
+<a name="id1306580"></a>
 <a class="link" href="c99.html#math_toolkit.extern_c.c99.quick_reference">Quick Reference</a>
 </h5>

@@ -461,9 +461,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -285,7 +285,7 @@
 <a name="math_toolkit.extern_c.tr1.usage_recomendations"></a>
 
<h5>
-<a name="id1233759"></a>
+<a name="id1293636"></a>
 <a class="link" href="tr1.html#math_toolkit.extern_c.tr1.usage_recomendations">Usage Recomendations</a>
 </h5>

@@ -336,7 +336,7 @@
 <a name="math_toolkit.extern_c.tr1.supported_c99_functions"></a>
 
<h5>
-<a name="id1233962"></a>
+<a name="id1293839"></a>
 <a class="link" href="tr1.html#math_toolkit.extern_c.tr1.supported_c99_functions">Supported
 C99 Functions</a>
 </h5>
@@ -440,7 +440,7 @@
 <a name="math_toolkit.extern_c.tr1.supported_tr1_functions"></a>
 
<h5>
-<a name="id1237313"></a>
+<a name="id1296576"></a>
 <a class="link" href="tr1.html#math_toolkit.extern_c.tr1.supported_tr1_functions">Supported
 TR1 Functions</a>
 </h5>
@@ -579,7 +579,7 @@
 <a name="math_toolkit.extern_c.tr1.currently_unsupported_c99_functions"></a>
 
<h5>
-<a name="id1240742"></a>
+<a name="id1300568"></a>
 <a class="link" href="tr1.html#math_toolkit.extern_c.tr1.currently_unsupported_c99_functions">Currently
 Unsupported C99 Functions</a>
 </h5>
@@ -650,7 +650,7 @@
 <a name="math_toolkit.extern_c.tr1.currently_unsupported_tr1_functions"></a>
 
<h5>
-<a name="id1242414"></a>
+<a name="id1302240"></a>
 <a class="link" href="tr1.html#math_toolkit.extern_c.tr1.currently_unsupported_tr1_functions">Currently
 Unsupported TR1 Functions</a>
 </h5>
@@ -673,9 +673,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -28,7 +28,7 @@
 Reference</a>
</h3></div></div></div>
<a name="math_toolkit.extern_c.tr1_ref.supported_tr1_functions"></a><h5>
-<a name="id1251278"></a>
+<a name="id1309466"></a>
 <a class="link" href="tr1_ref.html#math_toolkit.extern_c.tr1_ref.supported_tr1_functions">Supported
 TR1 Functions</a>
 </h5>
@@ -163,7 +163,7 @@
expint(2); // integer argument is treated as a double, returns double.
</pre>
<a name="math_toolkit.extern_c.tr1_ref.quick_reference"></a><h5>
-<a name="id1254274"></a>
+<a name="id1313554"></a>
 <a class="link" href="tr1_ref.html#math_toolkit.extern_c.tr1_ref.quick_reference">Quick Reference</a>
 </h5>
<pre class="programlisting">// [5.2.1.1] associated Laguerre polynomials:
@@ -494,7 +494,7 @@
 for the full template (header only) version of this function.
 
<a name="math_toolkit.extern_c.tr1_ref.currently_unsupported_tr1_functions"></a><h5>
-<a name="id1259642"></a>
+<a name="id1319451"></a>
 <a class="link" href="tr1_ref.html#math_toolkit.extern_c.tr1_ref.currently_unsupported_tr1_functions">Currently
 Unsupported TR1 Functions</a>
 </h5>
@@ -522,9 +522,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -41,11 +41,13 @@
<dt> Thread Safety</dt>
<dt> Performance</dt>
<dt><a href="main_overview/building.html"> If and How to Build
- the Library and its Examples and Tests</a></dt>
+ a Boost.Math Library, and its Examples and Tests</a></dt>
<dt><a href="main_overview/history1.html"> History and What's
 New</a></dt>
<dt><a href="main_overview/tr1.html"> C99 and C++ TR1 C-style
 Functions</a></dt>
+<dt><a href="main_overview/faq.html"> Frequently Asked Questions
+ FAQ</a></dt>
<dt><a href="main_overview/contact.html"> Contact Info and
 Support</a></dt>
</dl></div>
@@ -58,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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,7 +1,7 @@
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>If and How to Build the Library and its Examples and Tests</title>
+<title>If and How to Build a Boost.Math Library, and its Examples and Tests</title>
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../index.html" title="Math Toolkit">
@@ -24,20 +24,27 @@
</div>
<div class="section" lang="en">
<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 the Library and its Examples and Tests"> If and How to Build
- the Library and its Examples and Tests</a>
+<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>
</h3></div></div></div>
-<a name="math_toolkit.main_overview.building.building_the_library"></a><h5>
-<a name="id986047"></a>
- <a class="link" href="building.html#math_toolkit.main_overview.building.building_the_library">Building
- the Library</a>
+<a name="math_toolkit.main_overview.building.building_a_library__shared__dynamic__dll_or_static__lib_"></a><h5>
+<a name="id1039724"></a>
+ <a class="link" href="building.html#math_toolkit.main_overview.building.building_a_library__shared__dynamic__dll_or_static__lib_">Building
+ a Library (shared, dynamic .dll or static .lib)</a>
 </h5>

 The first thing you need to ask yourself is "Do I need to build anything
 at all?" as the bulk of this library is header only: meaning you can
- use it just by #including the necessary header(s). Refer to <a class="link" href="../extern_c.html" title='TR1 and C99 external "C" Functions'>C99
- and C++ TR1 C-style Functions</a> for pros and cons of using the TR1 components
- as opposed to the header only ones.
+ use it just by #including the necessary header(s).
+ 
+
+ For most simple uses, including a header (or few) is best for compile time
+ and program size.
+ 
+
+ Refer to <a class="link" href="../extern_c.html" title='TR1 and C99 external "C" Functions'>C99 and C++ TR1 C-style Functions</a>
+ for pros and cons of using the TR1 components as opposed to the header only
+ ones.
 

 The only time you need to build
@@ -49,7 +56,7 @@
<pre class="programlisting">bjam toolset=gcc --with-math install
</pre>

- will do the job on Linux, while:
+ that will do the job on Linux, while:
 
<pre class="programlisting">bjam toolset=msvc --with-math --build-type=complete stage
</pre>
@@ -93,7 +100,7 @@
 building the sources. Boost.Build will do this automatically when appropriate.
 
<a name="math_toolkit.main_overview.building.building_the_examples"></a><h5>
-<a name="id986493"></a>
+<a name="id1040175"></a>
 <a class="link" href="building.html#math_toolkit.main_overview.building.building_the_examples">Building
 the Examples</a>
 </h5>
@@ -104,7 +111,7 @@
 the Boost headers are in your compilers #include search path.
 
<a name="math_toolkit.main_overview.building.building_the_tests"></a><h5>
-<a name="id986533"></a>
+<a name="id1040216"></a>
 <a class="link" href="building.html#math_toolkit.main_overview.building.building_the_tests">Building
 the Tests</a>
 </h5>
@@ -140,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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -37,7 +37,7 @@

 
<div class="table">
-<a name="id984838"></a>Table 9. Supported/Tested Compilers
+<a name="math_toolkit.main_overview.compilers_overview.supported_tested_compilers"></a>Table 9. Supported/Tested Compilers
<div class="table-contents"><table class="table" summary="Supported/Tested Compilers">
<colgroup>
<col>
@@ -549,7 +549,7 @@
 
 
<div class="table">
-<a name="id985563"></a>Table 10. Unsupported Compilers
+<a name="math_toolkit.main_overview.compilers_overview.unsupported_compilers"></a>Table 10. Unsupported Compilers
<div class="table-contents"><table class="table" summary="Unsupported Compilers">
<colgroup>
<col>
@@ -623,9 +623,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -6,7 +6,7 @@
<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../index.html" title="Math Toolkit">
<link rel="up" href="../main_overview.html" title="Overview">
-<link rel="prev" href="tr1.html" title="C99 and C++ TR1 C-style Functions">
+<link rel="prev" href="faq.html" title="Frequently Asked Questions FAQ">
<link rel="next" href="../dist.html" title="Statistical Distributions and Functions">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
@@ -20,7 +20,7 @@
</tr></table>
<hr>
<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="../dist.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
+<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" lang="en">
<div class="titlepage"><div><div><h3 class="title">
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the Boost Software License, Version 1.0. (See accompanying
 file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
@@ -58,7 +58,7 @@
</tr></table>
<hr>
<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="../dist.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
+<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>
</body>
</html>

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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -28,7 +28,7 @@
 File Structure</a>
</h3></div></div></div>
<a name="math_toolkit.main_overview.directories.boost_math"></a><h5>
-<a name="id971282"></a>
+<a name="id1024804"></a>
 <a class="link" href="directories.html#math_toolkit.main_overview.directories.boost_math">boost/math</a>
 </h5>
<div class="variablelist">
@@ -73,7 +73,7 @@
</dl>
</div>
<a name="math_toolkit.main_overview.directories.boost_libs"></a><h5>
-<a name="id979078"></a>
+<a name="id1032599"></a>
 <a class="link" href="directories.html#math_toolkit.main_overview.directories.boost_libs">boost/libs</a>
 </h5>
<div class="variablelist">
@@ -109,9 +109,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -27,7 +27,7 @@
<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>
<a name="math_toolkit.main_overview.error_handling.quick_reference"></a><h5>
-<a name="id980014"></a>
+<a name="id1033568"></a>
 <a class="link" href="error_handling.html#math_toolkit.main_overview.error_handling.quick_reference">Quick
 Reference</a>
 </h5>
@@ -131,10 +131,10 @@
</div>

 The following tables show all the permutations of errors and actions, with
- the default action for each error shown in bold:
+ the default action for each error shown in bold:
 
<div class="table">
-<a name="id980278"></a>Table 1. Possible Actions for Domain Errors
+<a name="math_toolkit.main_overview.error_handling.possible_actions_for_domain_errors"></a>Table 1. Possible Actions for Domain Errors
<div class="table-contents"><table class="table" summary="Possible Actions for Domain Errors">
<colgroup>
<col>
@@ -209,7 +209,7 @@
</table></div>
</div>
 <div class="table">
-<a name="id980524"></a>Table 2. Possible Actions for Pole Errors
+<a name="math_toolkit.main_overview.error_handling.possible_actions_for_pole_errors"></a>Table 2. Possible Actions for Pole Errors
<div class="table-contents"><table class="table" summary="Possible Actions for Pole Errors">
<colgroup>
<col>
@@ -284,7 +284,7 @@
</table></div>
</div>
 <div class="table">
-<a name="id980770"></a>Table 3. Possible Actions for Overflow Errors
+<a name="math_toolkit.main_overview.error_handling.possible_actions_for_overflow_errors"></a>Table 3. Possible Actions for Overflow Errors
<div class="table-contents"><table class="table" summary="Possible Actions for Overflow Errors">
<colgroup>
<col>
@@ -359,7 +359,7 @@
</table></div>
</div>
 <div class="table">
-<a name="id981016"></a>Table 4. Possible Actions for Underflow Errors
+<a name="math_toolkit.main_overview.error_handling.possible_actions_for_underflow_errors"></a>Table 4. Possible Actions for Underflow Errors
<div class="table-contents"><table class="table" summary="Possible Actions for Underflow Errors">
<colgroup>
<col>
@@ -434,7 +434,7 @@
</table></div>
</div>
 <div class="table">
-<a name="id981199"></a>Table 5. Possible Actions for Denorm Errors
+<a name="math_toolkit.main_overview.error_handling.possible_actions_for_denorm_errors"></a>Table 5. Possible Actions for Denorm Errors
<div class="table-contents"><table class="table" summary="Possible Actions for Denorm Errors">
<colgroup>
<col>
@@ -509,7 +509,7 @@
</table></div>
</div>
 <div class="table">
-<a name="id981381"></a>Table 6. Possible Actions for Rounding Errors
+<a name="math_toolkit.main_overview.error_handling.possible_actions_for_rounding_errors"></a>Table 6. Possible Actions for Rounding Errors
<div class="table-contents"><table class="table" summary="Possible Actions for Rounding Errors">
<colgroup>
<col>
@@ -584,7 +584,7 @@
</table></div>
</div>
 <div class="table">
-<a name="id981571"></a>Table 7. Possible Actions for Internal Evaluation Errors
+<a name="math_toolkit.main_overview.error_handling.possible_actions_for_internal_evaluation_errors"></a>Table 7. Possible Actions for Internal Evaluation Errors
<div class="table-contents"><table class="table" summary="Possible Actions for Internal Evaluation Errors">
<colgroup>
<col>
@@ -659,7 +659,7 @@
</table></div>
</div>
 <div class="table">
-<a name="id981759"></a>Table 8. Possible Actions for Indeterminate Result Errors
+<a name="math_toolkit.main_overview.error_handling.possible_actions_for_indeterminate_result_errors"></a>Table 8. Possible Actions for Indeterminate Result Errors
<div class="table-contents"><table class="table" summary="Possible Actions for Indeterminate Result Errors">
<colgroup>
<col>
@@ -734,19 +734,26 @@
</tbody>
</table></div>
</div>
- <a name="math_toolkit.main_overview.error_handling.rationale"></a><h5>
-<a name="id981952"></a>
+ 
+ All these error conditions are in namespace boost::math::policies, made available,
+ for example, a by namespace declaration using <code class="computeroutput">namespace
+ boost::math::policies;</code>
+ or individual using declarations <code class="computeroutput">using
+ boost::math::policies::overflow_error;</code>.
+ 
+<a name="math_toolkit.main_overview.error_handling.rationale"></a><h5>
+<a name="id1035592"></a>
 <a class="link" href="error_handling.html#math_toolkit.main_overview.error_handling.rationale">Rationale</a>
 </h5>

- The flexibility of the current implementation should be reasonably obvious,
+ The flexibility of the current implementation should be reasonably obvious:
 the default behaviours were chosen based on feedback during the formal review
 of this library. It was felt that:
 
<div class="itemizedlist"><ul type="disc">
<li>
 Genuine errors should be flagged with exceptions rather than following
- C-compatible behaviour and setting ::errno.
+ C-compatible behaviour and setting <code class="computeroutput">::errno</code>.
 </li>
<li>
 Numeric underflow and denormalised results were not considered to be
@@ -754,7 +761,7 @@
 </li>
</ul></div>
<a name="math_toolkit.main_overview.error_handling.finding_more_information"></a><h5>
-<a name="id981987"></a>
+<a name="id1035638"></a>
 <a class="link" href="error_handling.html#math_toolkit.main_overview.error_handling.finding_more_information">Finding
 More Information</a>
 </h5>
@@ -776,7 +783,7 @@
 The various kind of errors are described in more detail below.
 
<a name="domain_error"></a><a name="math_toolkit.main_overview.error_handling.domain_errors"></a><h5>
-<a name="id982040"></a>
+<a name="id1035690"></a>
 <a class="link" href="error_handling.html#math_toolkit.main_overview.error_handling.domain_errors">Domain
 Errors</a>
 </h5>
@@ -798,7 +805,7 @@

 The default policy behaviour of this function is to throw a std::domain_error
 C++ exception. But if the <a class="link" href="../policy.html" title="Policies">Policy</a>
- is to ignore the error, or set global ::errno, then a NaN will be returned.
+ is to ignore the error, or set global <code class="computeroutput">::errno</code>, then a NaN will be returned.
 

 This behaviour is chosen to assist compatibility with the behaviour of ISO/IEC
@@ -848,7 +855,7 @@
 for more details.
 
<a name="pole_error"></a><a name="math_toolkit.main_overview.error_handling.evaluation_at_a_pole"></a><h5>
-<a name="id982288"></a>
+<a name="id1035950"></a>
 <a class="link" href="error_handling.html#math_toolkit.main_overview.error_handling.evaluation_at_a_pole">Evaluation
 at a pole</a>
 </h5>
@@ -887,7 +894,7 @@
 for more details.
 
<a name="overflow_error"></a><a name="math_toolkit.main_overview.error_handling.numeric_overflow"></a><h5>
-<a name="id982496"></a>
+<a name="id1036157"></a>
 <a class="link" href="error_handling.html#math_toolkit.main_overview.error_handling.numeric_overflow">Numeric
 Overflow</a>
 </h5>
@@ -912,7 +919,7 @@
 doesn't support infinities, the maximum value for the type is returned.
 
<a name="underflow_error"></a><a name="math_toolkit.main_overview.error_handling.numeric_underflow"></a><h5>
-<a name="id982684"></a>
+<a name="id1036346"></a>
 <a class="link" href="error_handling.html#math_toolkit.main_overview.error_handling.numeric_underflow">Numeric
 Underflow</a>
 </h5>
@@ -935,7 +942,7 @@
 an <code class="computeroutput">std::underflow_error</code> C++ exception.
 
<a name="denorm_error"></a><a name="math_toolkit.main_overview.error_handling.denormalisation_errors"></a><h5>
-<a name="id982829"></a>
+<a name="id1036491"></a>
 <a class="link" href="error_handling.html#math_toolkit.main_overview.error_handling.denormalisation_errors">Denormalisation
 Errors</a>
 </h5>
@@ -958,7 +965,7 @@
 throws an <code class="computeroutput">std::underflow_error</code> C++ exception.
 
<a name="evaluation_error"></a><a name="math_toolkit.main_overview.error_handling.evaluation_errors"></a><h5>
-<a name="id982991"></a>
+<a name="id1036653"></a>
 <a class="link" href="error_handling.html#math_toolkit.main_overview.error_handling.evaluation_errors">Evaluation
 Errors</a>
 </h5>
@@ -995,7 +1002,7 @@
 for more details.
 
<a name="indeterminate_result_error"></a><a name="math_toolkit.main_overview.error_handling.indeterminate_result_errors"></a><h5>
-<a name="id983206"></a>
+<a name="id1036868"></a>
 <a class="link" href="error_handling.html#math_toolkit.main_overview.error_handling.indeterminate_result_errors">Indeterminate
 Result Errors</a>
 </h5>
@@ -1011,8 +1018,10 @@
 is the name of the function, <code class="computeroutput">Message</code>
 is an error message describing the problem, Val is the value for which the
 result is indeterminate, Default is an alternative default result that must
- be returned for ignore_error and errno_on_error policies, and <a class="link" href="../policy.html" title="Policies">Policy</a>
- is the current policy in use for the function that was called.
+ be returned for <code class="computeroutput">ignore_error</code>
+ and <code class="computeroutput">errno_on_erro</code> policies,
+ and <a class="link" href="../policy.html" title="Policies">Policy</a> is the current policy
+ in use for the function that was called.
 

 The default policy for this function is <code class="computeroutput">ignore_error</code>:
@@ -1022,7 +1031,7 @@
 the result of 00 is 1, even though the result is actually mathematically indeterminate.
 
<a name="rounding_error"></a><a name="math_toolkit.main_overview.error_handling.rounding_errors"></a><h5>
-<a name="id983356"></a>
+<a name="id1038125"></a>
 <a class="link" href="error_handling.html#math_toolkit.main_overview.error_handling.rounding_errors">Rounding
 Errors</a>
 </h5>
@@ -1062,7 +1071,7 @@
 for more details.
 
<a name="checked_narrowing_cast"></a><a name="math_toolkit.main_overview.error_handling.errors_from_typecasts"></a><h5>
-<a name="id984681"></a>
+<a name="id1038356"></a>
 <a class="link" href="error_handling.html#math_toolkit.main_overview.error_handling.errors_from_typecasts">Errors
 from typecasts</a>
 </h5>
@@ -1085,9 +1094,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -6,7 +6,7 @@
<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../index.html" title="Math Toolkit">
<link rel="up" href="../main_overview.html" title="Overview">
-<link rel="prev" href="building.html" title="If and How to Build the Library and its Examples and Tests">
+<link rel="prev" href="building.html" title="If and How to Build a Boost.Math Library, and its Examples and Tests">
<link rel="next" href="tr1.html" title="C99 and C++ TR1 C-style Functions">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
@@ -28,10 +28,32 @@
 New</a>
</h3></div></div></div>

+ <a name="math_toolkit.main_overview.history1.boost_1_45_0"></a>
+ 
+<h5>
+<a name="id1040450"></a>
+ <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 type="disc">
+<li>
+ Added warnings about potential ambiguity with std random library in
+ distribution and function names.
+ </li>
+<li>
+ Added inverse gamma distribution and inverse chi_square and scaled
+ inverse chi_square.
+ </li>
+<li>
+ Editorial revision of documentation, and added FAQ.
+ </li>
+</ul></div>
+
 <a name="math_toolkit.main_overview.history1.boost_1_44_0"></a>
 
<h5>
-<a name="id986768"></a>
+<a name="id1040488"></a>
 <a class="link" href="history1.html#math_toolkit.main_overview.history1.boost_1_44_0">Boost-1.44.0</a>
 </h5>

@@ -50,20 +72,20 @@
 <a name="math_toolkit.main_overview.history1.boost_1_41_0"></a>
 
<h5>
-<a name="id986799"></a>
+<a name="id1040519"></a>
 <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 type="disc"><li>
 Significantly improved performance for the incomplete gamma function
- and it's inverse.
+ and its inverse.
 </li></ul></div>

 <a name="math_toolkit.main_overview.history1.boost_1_40_0"></a>
 
<h5>
-<a name="id986823"></a>
+<a name="id1040543"></a>
 <a class="link" href="history1.html#math_toolkit.main_overview.history1.boost_1_40_0">Boost-1.40.0</a>
 </h5>

@@ -105,7 +127,7 @@
 <a name="math_toolkit.main_overview.history1.boost_1_38_0"></a>
 
<h5>
-<a name="id986912"></a>
+<a name="id1040632"></a>
 <a class="link" href="history1.html#math_toolkit.main_overview.history1.boost_1_38_0">Boost-1.38.0</a>
 </h5>

@@ -123,7 +145,7 @@
 <a name="math_toolkit.main_overview.history1.boost_1_37_0"></a>
 
<h5>
-<a name="id986948"></a>
+<a name="id1040668"></a>
 <a class="link" href="history1.html#math_toolkit.main_overview.history1.boost_1_37_0">Boost-1.37.0</a>
 </h5>

@@ -135,7 +157,7 @@
 <a name="math_toolkit.main_overview.history1.boost_1_36_0"></a>
 
<h5>
-<a name="id986972"></a>
+<a name="id1040692"></a>
 <a class="link" href="history1.html#math_toolkit.main_overview.history1.boost_1_36_0">Boost-1.36.0</a>
 </h5>

@@ -173,7 +195,7 @@
 <a name="math_toolkit.main_overview.history1.boost_1_35_0__post_review_first_official_release"></a>
 
<h5>
-<a name="id987057"></a>
+<a name="id1040777"></a>
 <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>
@@ -211,7 +233,7 @@
 <a name="math_toolkit.main_overview.history1.milestone_4__second_review_candidate__1st_march_2007_"></a>
 
<h5>
-<a name="id987144"></a>
+<a name="id1040864"></a>
 <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>
@@ -230,7 +252,7 @@
 <a name="math_toolkit.main_overview.history1.milestone_3__first_review_candidate__31st_dec_2006_"></a>
 
<h5>
-<a name="id987176"></a>
+<a name="id1040896"></a>
 <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>
@@ -263,7 +285,7 @@
 <a name="math_toolkit.main_overview.history1.milestone_2__released_september_10th_2006"></a>
 
<h5>
-<a name="id987238"></a>
+<a name="id1040959"></a>
 <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>
@@ -304,7 +326,7 @@
 <a name="math_toolkit.main_overview.history1.milestone_1__released_march_31st_2006"></a>
 
<h5>
-<a name="id987320"></a>
+<a name="id1041040"></a>
 <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>
@@ -339,16 +361,16 @@

 

- Sandbox and trunk last synchonised at revision: 56669.
+ Sandbox and trunk last synchonised at revision: .
 

 
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -30,7 +30,7 @@
 This library is divided into three interconnected parts:
 
<a name="math_toolkit.main_overview.intro.statistical_distributions"></a><h5>
-<a name="id970846"></a>
+<a name="id1024367"></a>
 <a class="link" href="intro.html#math_toolkit.main_overview.intro.statistical_distributions">Statistical
 Distributions</a>
 </h5>
@@ -56,7 +56,7 @@
 tests.
 
<a name="math_toolkit.main_overview.intro.mathematical_special_functions"></a><h5>
-<a name="id970930"></a>
+<a name="id1024451"></a>
 <a class="link" href="intro.html#math_toolkit.main_overview.intro.mathematical_special_functions">Mathematical
 Special Functions</a>
 </h5>
@@ -83,7 +83,7 @@
 double</code>.
 
<a name="math_toolkit.main_overview.intro.implementation_toolkit"></a><h5>
-<a name="id970997"></a>
+<a name="id1024518"></a>
 <a class="link" href="intro.html#math_toolkit.main_overview.intro.implementation_toolkit">Implementation
 Toolkit</a>
 </h5>
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -44,6 +44,17 @@

student_t mydist(10);
</pre>
+<div class="note"><table border="0" summary="Note">
+<tr>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../../doc/src/images/note.png"></td>
+<th align="left">Note</th>
+</tr>
+<tr><td align="left" valign="top">
+ Some distribution names are also used in std random library, so to avoid
+ the risk of ambiguity it is better to make explicit using declarations,
+ for example: <code class="computeroutput">using boost::math::students_t_distribution</code>
+ </td></tr>
+</table></div>

 Functions not intended for use by applications are in <code class="computeroutput">boost::math::detail</code>.
 
@@ -59,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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -31,7 +31,7 @@
 as handy shortcuts for common navigation tasks.
 
<a name="math_toolkit.main_overview.navigation.shortcuts"></a><h6>
-<a name="id971096"></a>
+<a name="id1024618"></a>
 <a class="link" href="navigation.html#math_toolkit.main_overview.navigation.shortcuts">Shortcuts</a>
 </h6>
<div class="blockquote"><blockquote class="blockquote">
@@ -129,9 +129,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -7,7 +7,7 @@
<link rel="home" href="../../index.html" title="Math Toolkit">
<link rel="up" href="../main_overview.html" title="Overview">
<link rel="prev" href="threads.html" title="Thread Safety">
-<link rel="next" href="building.html" title="If and How to Build the Library and its Examples and Tests">
+<link rel="next" href="building.html" title="If and How to Build a Boost.Math Library, and its Examples and Tests">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
@@ -30,7 +30,7 @@
 

 By and large the performance of this library should be acceptable for most
- needs. However, you should note that the library's primary emphasis is
+ needs. However, you should note that this library's primary emphasis is
 on accuracy and numerical stability, and not speed.
 

@@ -62,7 +62,7 @@
 </li>
<li>
 Pick your compiler carefully: <a class="link" href="../perf/comp_compilers.html" title="Comparing Compilers">performance
- differences of up to 8 fold</a> have been found between some windows
+ differences of up to 8 fold</a> have been found between some Windows
 compilers for example.
 </li>
</ol></div>
@@ -78,9 +78,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -39,7 +39,7 @@

 

- Generally speaking unless you find that the <a class="link" href="../policy/pol_tutorial/policy_tut_defaults.html" title="Policies Have Sensible Defaults">default
+ Generally speaking, unless you find that the <a class="link" href="../policy/pol_tutorial/policy_tut_defaults.html" title="Policies Have Sensible Defaults">default
 policy behaviour</a> when encountering 'bad' argument values does not
 meet your needs, you should not need to worry about policies.
 
@@ -69,7 +69,7 @@
 cannot be fully evaluated.
 </li>
<li>
- How <a class="link" href="../policy/pol_ref/internal_promotion.html" title="Internal Promotion Policies">accuracy
+ How <a class="link" href="../policy/pol_ref/internal_promotion.html" title="Internal Floating-point Promotion Policies">accuracy
 is controlled by internal promotion</a> to use more precise types.
 </li>
<li>
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -54,9 +54,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -7,7 +7,7 @@
<link rel="home" href="../../index.html" title="Math Toolkit">
<link rel="up" href="../main_overview.html" title="Overview">
<link rel="prev" href="history1.html" title="History and What's New">
-<link rel="next" href="contact.html" title="Contact Info and Support">
+<link rel="next" href="faq.html" title="Frequently Asked Questions FAQ">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
@@ -20,7 +20,7 @@
</tr></table>
<hr>
<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="contact.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
+<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" lang="en">
<div class="titlepage"><div><div><h3 class="title">
@@ -286,7 +286,7 @@
 <a name="math_toolkit.main_overview.tr1.usage_recomendations"></a>
 
<h5>
-<a name="id987793"></a>
+<a name="id1041513"></a>
 <a class="link" href="tr1.html#math_toolkit.main_overview.tr1.usage_recomendations">Usage
 Recomendations</a>
 </h5>
@@ -338,7 +338,7 @@
 <a name="math_toolkit.main_overview.tr1.supported_c99_functions"></a>
 
<h5>
-<a name="id987996"></a>
+<a name="id1041716"></a>
 <a class="link" href="tr1.html#math_toolkit.main_overview.tr1.supported_c99_functions">Supported
 C99 Functions</a>
 </h5>
@@ -442,7 +442,7 @@
 <a name="math_toolkit.main_overview.tr1.supported_tr1_functions"></a>
 
<h5>
-<a name="id990792"></a>
+<a name="id1044376"></a>
 <a class="link" href="tr1.html#math_toolkit.main_overview.tr1.supported_tr1_functions">Supported
 TR1 Functions</a>
 </h5>
@@ -581,7 +581,7 @@
 <a name="math_toolkit.main_overview.tr1.currently_unsupported_c99_functions"></a>
 
<h5>
-<a name="id994765"></a>
+<a name="id1048417"></a>
 <a class="link" href="tr1.html#math_toolkit.main_overview.tr1.currently_unsupported_c99_functions">Currently
 Unsupported C99 Functions</a>
 </h5>
@@ -652,7 +652,7 @@
 <a name="math_toolkit.main_overview.tr1.currently_unsupported_tr1_functions"></a>
 
<h5>
-<a name="id996500"></a>
+<a name="id1050084"></a>
 <a class="link" href="tr1.html#math_toolkit.main_overview.tr1.currently_unsupported_tr1_functions">Currently
 Unsupported TR1 Functions</a>
 </h5>
@@ -675,9 +675,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the Boost Software License, Version 1.0. (See accompanying
 file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
@@ -685,7 +685,7 @@
</tr></table>
<hr>
<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="contact.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
+<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>
</body>
</html>

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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -35,7 +35,7 @@
 in this respect).
 
<div class="table">
-<a name="id1343577"></a>Table 48. Performance Comparison of Various Windows Compilers
+<a name="math_toolkit.perf.comp_compilers.performance_comparison_of_various_windows_compilers"></a>Table 48. Performance Comparison of Various Windows Compilers
<div class="table-contents"><table class="table" summary="Performance Comparison of Various Windows Compilers">
<colgroup>
<col>
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -46,7 +46,7 @@
 </td></tr>
</table></div>
<a name="math_toolkit.perf.comparisons.comparison_to_gsl_1_13_and_cephes"></a><h5>
-<a name="id1346817"></a>
+<a name="id1406491"></a>
 <a class="link" href="comparisons.html#math_toolkit.perf.comparisons.comparison_to_gsl_1_13_and_cephes">Comparison
 to GSL-1.13 and Cephes</a>
 </h5>
@@ -344,7 +344,7 @@
 </td>
<td>
 
- +INF [<a name="id1347953" href="#ftn.id1347953" class="footnote">1</a>]
+ +INF [<a name="id1407048" href="#ftn.id1407048" class="footnote">1</a>]
 
 </td>
</tr>
@@ -423,7 +423,7 @@
<td>
 
 
-17.89[<a name="id1348110" href="#ftn.id1348110" class="footnote">2</a>]
+17.89[<a name="id1407205" href="#ftn.id1407205" class="footnote">2</a>]
 
(4.248e-005s)

@@ -548,11 +548,11 @@
</tr>
</tbody>
<tbody class="footnotes"><tr><td colspan="4">
-<div class="footnote">[<a name="ftn.id1347953" href="#id1347953" class="para">1</a>] 
+<div class="footnote">[<a name="ftn.id1407048" href="#id1407048" class="para">1</a>] 
 Cephes gets stuck in an infinite loop while trying to execute
 our test cases.
 </div>
-<div class="footnote">[<a name="ftn.id1348110" href="#id1348110" class="para">2</a>] 
+<div class="footnote">[<a name="ftn.id1407205" href="#id1407205" class="para">2</a>] 
 The performance here is dominated by a few cases where the parameters
 grow very large: faster asymptotic expansions are available,
 but are of limited (or even frankly terrible) precision. The
@@ -563,7 +563,7 @@
</td></tr></tbody>
</table></div>
<a name="math_toolkit.perf.comparisons.comparison_to_the_r_and_dcdflib_statistical_libraries_on_windows"></a><h5>
-<a name="id1348353"></a>
+<a name="id1407448"></a>
 <a class="link" href="comparisons.html#math_toolkit.perf.comparisons.comparison_to_the_r_and_dcdflib_statistical_libraries_on_windows">Comparison
 to the R and DCDFLIB Statistical Libraries on Windows</a>
 </h5>
@@ -574,7 +574,7 @@
 (R-2.9.2 appears not to be buildable with Visual C++).
 
<div class="table">
-<a name="id1348367"></a>Table 51. A Comparison to the R Statistical Library on Windows XP
+<a name="math_toolkit.perf.comparisons.a_comparison_to_the_r_statistical_library_on_windows_xp"></a>Table 51. A Comparison to the R Statistical Library on Windows XP
<div class="table-contents"><table class="table" summary="A Comparison to the R Statistical Library on Windows XP">
<colgroup>
<col>
@@ -659,7 +659,7 @@
<td>
 
 
-67.66[<a name="id1348517" href="#ftn.id1348517" class="footnote">1</a>]
+67.66[<a name="id1407613" href="#ftn.id1407613" class="footnote">1</a>]
 
(3.366e-004s)

@@ -1089,7 +1089,7 @@
<td>
 
 
-3.60[<a name="id1349275" href="#ftn.id1349275" class="footnote">2</a>]
+3.60[<a name="id1409669" href="#ftn.id1409669" class="footnote">2</a>]
 
(5.987e-007s)

@@ -1319,7 +1319,7 @@
<td>
 
 
-43.43[<a name="id1349755" href="#ftn.id1349755" class="footnote">3</a>]
+43.43[<a name="id1410080" href="#ftn.id1410080" class="footnote">3</a>]
 
(3.732e-004s)

@@ -1389,7 +1389,7 @@
<td>
 
 
-393.90[<a name="id1349881" href="#ftn.id1349881" class="footnote">4</a>]
+393.90[<a name="id1410206" href="#ftn.id1410206" class="footnote">4</a>]
 
(2.673e-002s)

@@ -1525,7 +1525,7 @@
<td>
 
 
-1.00[<a name="id1350132" href="#ftn.id1350132" class="footnote">5</a>]
+1.00[<a name="id1410457" href="#ftn.id1410457" class="footnote">5</a>]
 
(4.411e-004s)

@@ -1811,28 +1811,28 @@
</tr>
</tbody>
<tbody class="footnotes"><tr><td colspan="4">
-<div class="footnote">[<a name="ftn.id1348517" href="#id1348517" class="para">1</a>] 
+<div class="footnote">[<a name="ftn.id1407613" href="#id1407613" class="para">1</a>] 
 There are a small number of our test cases where the R library
 fails to converge on a result: these tend to dominate the performance
 result.
 </div>
-<div class="footnote">[<a name="ftn.id1349275" href="#id1349275" class="para">2</a>] 
+<div class="footnote">[<a name="ftn.id1409669" href="#id1409669" class="para">2</a>] 
 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.
 </div>
-<div class="footnote">[<a name="ftn.id1349755" href="#id1349755" class="para">3</a>] 
+<div class="footnote">[<a name="ftn.id1410080" href="#id1410080" class="para">3</a>] 
 The R library appears to use a linear-search strategy, that can
 perform very badly in a small number of pathological cases, but
 may or may not be more efficient in "typical" cases
 </div>
-<div class="footnote">[<a name="ftn.id1349881" href="#id1349881" class="para">4</a>] 
+<div class="footnote">[<a name="ftn.id1410206" href="#id1410206" class="para">4</a>] 
 There are a small number of our test cases where the R library
 fails to converge on a result: these tend to dominate the performance
 result.
 </div>
-<div class="footnote">[<a name="ftn.id1350132" href="#id1350132" class="para">5</a>] 
+<div class="footnote">[<a name="ftn.id1410457" href="#id1410457" class="para">5</a>] 
 There are a small number of our test cases where the R library
 fails to converge on a result: these tend to dominate the performance
 result.
@@ -1841,7 +1841,7 @@
</table></div>
</div>
 <a name="math_toolkit.perf.comparisons.comparison_to_the_r_statistical_library_on_linux"></a><h5>
-<a name="id1350636"></a>
+<a name="id1410961"></a>
 <a class="link" href="comparisons.html#math_toolkit.perf.comparisons.comparison_to_the_r_statistical_library_on_linux">Comparison
 to the R Statistical Library on Linux</a>
 </h5>
@@ -1851,7 +1851,7 @@
 G++ 4.3.3 using -O3 -DNDEBUG=1.
 
<div class="table">
-<a name="id1350651"></a>Table 52. A Comparison to the R Statistical Library on Linux
+<a name="math_toolkit.perf.comparisons.a_comparison_to_the_r_statistical_library_on_linux"></a>Table 52. A Comparison to the R Statistical Library on Linux
<div class="table-contents"><table class="table" summary="A Comparison to the R Statistical Library on Linux">
<colgroup>
<col>
@@ -1936,7 +1936,7 @@
<td>
 
 
-30.51[<a name="id1350801" href="#ftn.id1350801" class="footnote">1</a>]
+30.51[<a name="id1411127" href="#ftn.id1411127" class="footnote">1</a>]
 
(3.616e-004s)

@@ -2366,7 +2366,7 @@
<td>
 
 
-2.20[<a name="id1351557" href="#ftn.id1351557" class="footnote">2</a>]
+2.20[<a name="id1413249" href="#ftn.id1413249" class="footnote">2</a>]
 
(3.522e-007s)

@@ -2596,7 +2596,7 @@
<td>
 
 
-25.92[<a name="id1351971" href="#ftn.id1351971" class="footnote">3</a>]
+25.92[<a name="id1413663" href="#ftn.id1413663" class="footnote">3</a>]
 
(4.407e-004s)

@@ -2666,7 +2666,7 @@
<td>
 
 
-144.91[<a name="id1352097" href="#ftn.id1352097" class="footnote">4</a>]
+144.91[<a name="id1413789" href="#ftn.id1413789" class="footnote">4</a>]
 
(3.214e-002s)

@@ -2802,7 +2802,7 @@
<td>
 
 
-1.00[<a name="id1352343" href="#ftn.id1352343" class="footnote">5</a>]
+1.00[<a name="id1414035" href="#ftn.id1414035" class="footnote">5</a>]
 
(5.916e-004s)

@@ -3088,28 +3088,28 @@
</tr>
</tbody>
<tbody class="footnotes"><tr><td colspan="4">
-<div class="footnote">[<a name="ftn.id1350801" href="#id1350801" class="para">1</a>] 
+<div class="footnote">[<a name="ftn.id1411127" href="#id1411127" class="para">1</a>] 
 There are a small number of our test cases where the R library
 fails to converge on a result: these tend to dominate the performance
 result.
 </div>
-<div class="footnote">[<a name="ftn.id1351557" href="#id1351557" class="para">2</a>] 
+<div class="footnote">[<a name="ftn.id1413249" href="#id1413249" class="para">2</a>] 
 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.
 </div>
-<div class="footnote">[<a name="ftn.id1351971" href="#id1351971" class="para">3</a>] 
+<div class="footnote">[<a name="ftn.id1413663" href="#id1413663" class="para">3</a>] 
 The R library appears to use a linear-search strategy, that can
 perform very badly in a small number of pathological cases, but
 may or may not be more efficient in "typical" cases
 </div>
-<div class="footnote">[<a name="ftn.id1352097" href="#id1352097" class="para">4</a>] 
+<div class="footnote">[<a name="ftn.id1413789" href="#id1413789" class="para">4</a>] 
 There are a small number of our test cases where the R library
 fails to converge on a result: these tend to dominate the performance
 result.
 </div>
-<div class="footnote">[<a name="ftn.id1352343" href="#id1352343" class="para">5</a>] 
+<div class="footnote">[<a name="ftn.id1414035" href="#id1414035" class="para">5</a>] 
 There are a small number of our test cases where the R library
 fails to converge on a result: these tend to dominate the performance
 result.
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -33,7 +33,7 @@
 penalty for using the library in debug mode can be quite large.
 
<div class="table">
-<a name="id1343094"></a>Table 47. Performance Comparison of Release and Debug Settings
+<a name="math_toolkit.perf.getting_best.performance_comparison_of_release_and_debug_settings"></a>Table 47. Performance Comparison of Release and Debug Settings
<div class="table-contents"><table class="table" summary="Performance Comparison of Release and Debug Settings">
<colgroup>
<col>
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -52,12 +52,23 @@
 whatever that may be!
 </td></tr>
</table></div>
+<div class="note"><table border="0" summary="Note">
+<tr>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../../doc/src/images/note.png"></td>
+<th align="left">Note</th>
+</tr>
+<tr><td align="left" valign="top">
+ Since these tests were run, most compilers have improved their code optimisation,
+ and processor speeds have improved too, so these results are known to be
+ out of date.
+ </td></tr>
+</table></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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -30,7 +30,7 @@
 

 By and large the performance of this library should be acceptable for most
- needs. However, you should note that the library's primary emphasis is
+ needs. However, you should note that this library's primary emphasis is
 on accuracy and numerical stability, and not speed.
 

@@ -62,7 +62,7 @@
 </li>
<li>
 Pick your compiler carefully: <a class="link" href="comp_compilers.html" title="Comparing Compilers">performance
- differences of up to 8 fold</a> have been found between some windows
+ differences of up to 8 fold</a> have been found between some Windows
 compilers for example.
 </li>
</ol></div>
@@ -78,9 +78,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -238,7 +238,7 @@
 highly vectorisable processors in the future.
 
<div class="table">
-<a name="id1345621"></a>Table 49. A Comparison of Polynomial Evaluation Methods
+<a name="math_toolkit.perf.tuning.a_comparison_of_polynomial_evaluation_methods"></a>Table 49. A Comparison of Polynomial Evaluation Methods
<div class="table-contents"><table class="table" summary="A Comparison of Polynomial Evaluation Methods">
<colgroup>
<col>
@@ -632,13 +632,13 @@
 precision as possible is achieved, but may slow down execution in some environments.
 The defaults for this policy can be changed by <a class="link" href="../policy/pol_ref/policy_defaults.html" title="Using macros to Change the Policy Defaults">defining
 the macro <code class="computeroutput">BOOST_MATH_PROMOTE_DOUBLE_POLICY</code></a>
- to <code class="computeroutput">false</code>, or <a class="link" href="../policy/pol_ref/internal_promotion.html" title="Internal Promotion Policies">by
+ to <code class="computeroutput">false</code>, or <a class="link" href="../policy/pol_ref/internal_promotion.html" title="Internal Floating-point Promotion Policies">by
 specifying a specific policy</a> when calling the special functions or
 distributions. See also the <a class="link" href="../policy/pol_tutorial.html" title="Policy Tutorial">policy
 tutorial</a>.
 
<div class="table">
-<a name="id1346320"></a>Table 50. Performance Comparison with and Without Internal Promotion to long
+<a name="math_toolkit.perf.tuning.performance_comparison_with_and_without_internal_promotion_to_long_double"></a>Table 50. Performance Comparison with and Without Internal Promotion to long
 double
<div class="table-contents"><table class="table" summary="Performance Comparison with and Without Internal Promotion to long
 double">
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -54,7 +54,7 @@
<dt><a href="policy/pol_ref/error_handling_policies.html">
 Error Handling Policies</a></dt>
<dt><a href="policy/pol_ref/internal_promotion.html"> Internal
- Promotion Policies</a></dt>
+ Floating-point Promotion Policies</a></dt>
<dt><a href="policy/pol_ref/assert_undefined.html"> Mathematically
 Undefined Function Policies</a></dt>
<dt><a href="policy/pol_ref/discrete_quant_ref.html"> Discrete
@@ -76,9 +76,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -38,7 +38,7 @@

 

- Generally speaking unless you find that the <a class="link" href="pol_tutorial/policy_tut_defaults.html" title="Policies Have Sensible Defaults">default
+ Generally speaking, unless you find that the <a class="link" href="pol_tutorial/policy_tut_defaults.html" title="Policies Have Sensible Defaults">default
 policy behaviour</a> when encountering 'bad' argument values does not
 meet your needs, you should not need to worry about policies.
 
@@ -68,7 +68,7 @@
 cannot be fully evaluated.
 </li>
<li>
- How <a class="link" href="pol_ref/internal_promotion.html" title="Internal Promotion Policies">accuracy
+ How <a class="link" href="pol_ref/internal_promotion.html" title="Internal Floating-point Promotion Policies">accuracy
 is controlled by internal promotion</a> to use more precise types.
 </li>
<li>
@@ -120,9 +120,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -30,7 +30,7 @@
<dt><a href="pol_ref/error_handling_policies.html">
 Error Handling Policies</a></dt>
<dt><a href="pol_ref/internal_promotion.html"> Internal
- Promotion Policies</a></dt>
+ Floating-point Promotion Policies</a></dt>
<dt><a href="pol_ref/assert_undefined.html"> Mathematically
 Undefined Function Policies</a></dt>
<dt><a href="pol_ref/discrete_quant_ref.html"> Discrete
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -6,7 +6,7 @@
<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../../index.html" title="Math Toolkit">
<link rel="up" href="../pol_ref.html" title="Policy Reference">
-<link rel="prev" href="internal_promotion.html" title="Internal Promotion Policies">
+<link rel="prev" href="internal_promotion.html" title="Internal Floating-point Promotion Policies">
<link rel="next" href="discrete_quant_ref.html" title="Discrete Quantile Policies">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
@@ -33,7 +33,8 @@
 for certain distributions, but defined for others.
 

- For example, the Cauchy distribution does not have a mean, so what should
+ For example, the Cauchy distribution does not have a meaningful mean, so
+ what should
 
<pre class="programlisting">mean(cauchy<>());
</pre>
@@ -74,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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -55,7 +55,7 @@
 can take have the following meanings:
 
<a name="math_toolkit.policy.pol_ref.discrete_quant_ref.real"></a><h6>
-<a name="id1334283"></a>
+<a name="id1394054"></a>
 <a class="link" href="discrete_quant_ref.html#math_toolkit.policy.pol_ref.discrete_quant_ref.real">real</a>
 </h6>

@@ -68,18 +68,18 @@


<pre class="programlisting">#include <boost/math/distributions/negative_binomial.hpp>
+using boost::math::negative_binomial_distribution;

-using namespace boost::math;
using namespace boost::math::policies;

typedef negative_binomial_distribution<
 double,
- policy<discrete_quantile<integer_round_inwards> >
+ policy<discrete_quantile<real> >
 > dist_type;

-// Lower quantile:
+// Lower 5% quantile:
double x = quantile(dist_type(20, 0.3), 0.05);
-// Upper quantile:
+// Upper 95% quantile:
double y = quantile(complement(dist_type(20, 0.3), 0.05));

</pre>
@@ -93,7 +93,7 @@
 = 68.1584</code>.
 
<a name="math_toolkit.policy.pol_ref.discrete_quant_ref.integer_round_outwards"></a><h6>
-<a name="id1334635"></a>
+<a name="id1394410"></a>
 <a class="link" href="discrete_quant_ref.html#math_toolkit.policy.pol_ref.discrete_quant_ref.integer_round_outwards">integer_round_outwards</a>
 </h6>

@@ -120,14 +120,14 @@


<pre class="programlisting">#include <boost/math/distributions/negative_binomial.hpp>
+using boost::math::negative_binomial;

-using namespace boost::math;
-
-// Lower quantile rounded down:
-double x = quantile(negative_binomial(20, 0.3), 0.05);
-// Upper quantile rounded up:
-double y = quantile(complement(negative_binomial(20, 0.3), 0.05));
-
+// Use the default rounding policy integer_round_outwards.
+// Lower quantile rounded down:
+double x = quantile(negative_binomial(20, 0.3), 0.05); // rounded up 27 from 27.3898
+// Upper quantile rounded up:
+double y = quantile(complement(negative_binomial(20, 0.3), 0.05)); // rounded down to 69 from 68.1584
+
</pre>

 
@@ -151,7 +151,7 @@
 in each tail.
 
<a name="math_toolkit.policy.pol_ref.discrete_quant_ref.integer_round_inwards"></a><h6>
-<a name="id1335021"></a>
+<a name="id1394810"></a>
 <a class="link" href="discrete_quant_ref.html#math_toolkit.policy.pol_ref.discrete_quant_ref.integer_round_inwards">integer_round_inwards</a>
 </h6>

@@ -177,8 +177,8 @@


<pre class="programlisting">#include <boost/math/distributions/negative_binomial.hpp>
+using boost::math::negative_binomial_distribution;

-using namespace boost::math;
using namespace boost::math::policies;

typedef negative_binomial_distribution<
@@ -187,10 +187,10 @@
 > dist_type;

// Lower quantile rounded up:
-double x = quantile(dist_type(20, 0.3), 0.05);
-// Upper quantile rounded down:
-double y = quantile(complement(dist_type(20, 0.3), 0.05));
-
+double x = quantile(dist_type(20, 0.3), 0.05); // 28 rounded up from 27.3898
+// Upper quantile rounded down:
+double y = quantile(complement(dist_type(20, 0.3), 0.05)); // 68 rounded down from 68.1584
+
</pre>

 
@@ -214,7 +214,7 @@
 in each tail.
 
<a name="math_toolkit.policy.pol_ref.discrete_quant_ref.integer_round_down"></a><h6>
-<a name="id1335507"></a>
+<a name="id1395316"></a>
 <a class="link" href="discrete_quant_ref.html#math_toolkit.policy.pol_ref.discrete_quant_ref.integer_round_down">integer_round_down</a>
 </h6>

@@ -222,7 +222,7 @@
 or a lower quantile.
 
<a name="math_toolkit.policy.pol_ref.discrete_quant_ref.integer_round_up"></a><h6>
-<a name="id1335526"></a>
+<a name="id1395336"></a>
 <a class="link" href="discrete_quant_ref.html#math_toolkit.policy.pol_ref.discrete_quant_ref.integer_round_up">integer_round_up</a>
 </h6>

@@ -230,7 +230,7 @@
 a lower quantile.
 
<a name="math_toolkit.policy.pol_ref.discrete_quant_ref.integer_round_nearest"></a><h6>
-<a name="id1335546"></a>
+<a name="id1395355"></a>
 <a class="link" href="discrete_quant_ref.html#math_toolkit.policy.pol_ref.discrete_quant_ref.integer_round_nearest">integer_round_nearest</a>
 </h6>

@@ -249,8 +249,8 @@


<pre class="programlisting">#include <boost/math/distributions/negative_binomial.hpp>
+using boost::math::negative_binomial_distribution;

-using namespace boost::math;
using namespace boost::math::policies;

typedef negative_binomial_distribution<
@@ -259,10 +259,10 @@
 > dist_type;

// Lower quantile rounded up:
-double x = quantile(dist_type(20, 0.3), 0.05);
-// Upper quantile rounded down:
-double y = quantile(complement(dist_type(20, 0.3), 0.05));
-
+double x = quantile(dist_type(20, 0.3), 0.05); // 27
+// Upper quantile rounded down:
+double y = quantile(complement(dist_type(20, 0.3), 0.05)); // 68
+
</pre>

 
@@ -275,9 +275,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -7,7 +7,7 @@
<link rel="home" href="../../../index.html" title="Math Toolkit">
<link rel="up" href="../pol_ref.html" title="Policy Reference">
<link rel="prev" href="../pol_ref.html" title="Policy Reference">
-<link rel="next" href="internal_promotion.html" title="Internal Promotion Policies">
+<link rel="next" href="internal_promotion.html" title="Internal Floating-point Promotion Policies">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
@@ -39,7 +39,7 @@
 </li>
</ul></div>
<a name="math_toolkit.policy.pol_ref.error_handling_policies.available_actions_when_an_error_is_raised"></a><h5>
-<a name="id1327547"></a>
+<a name="id1388094"></a>
 <a class="link" href="error_handling_policies.html#math_toolkit.policy.pol_ref.error_handling_policies.available_actions_when_an_error_is_raised">Available
 Actions When an Error is Raised</a>
 </h5>
@@ -62,7 +62,7 @@
 The various enumerated values have the following meanings:
 
<a name="math_toolkit.policy.pol_ref.error_handling_policies.throw_on_error"></a><h6>
-<a name="id1327729"></a>
+<a name="id1388275"></a>
 <a class="link" href="error_handling_policies.html#math_toolkit.policy.pol_ref.error_handling_policies.throw_on_error">throw_on_error</a>
 </h6>

@@ -174,13 +174,15 @@
</tbody>
</table></div>
<a name="math_toolkit.policy.pol_ref.error_handling_policies.errno_on_error"></a><h6>
-<a name="id1327915"></a>
+<a name="id1388461"></a>
 <a class="link" href="error_handling_policies.html#math_toolkit.policy.pol_ref.error_handling_policies.errno_on_error">errno_on_error</a>
 </h6>

- Will set global <code class="computeroutput">::errno</code>
- to one of the following values depending upon the error type, and then
- return the same value as if the error had been ignored:
+ Will set global ::errno
+ <code class="computeroutput">::errno</code>
+ to one of the following values depending upon the error type (often EDOM
+ = 33 and ERANGE = 34), and then return the same value as if the error had
+ been ignored:
 
<div class="informaltable"><table class="table">
<colgroup>
@@ -287,7 +289,7 @@
</tbody>
</table></div>
<a name="math_toolkit.policy.pol_ref.error_handling_policies.ignore_error"></a><h6>
-<a name="id1328104"></a>
+<a name="id1388664"></a>
 <a class="link" href="error_handling_policies.html#math_toolkit.policy.pol_ref.error_handling_policies.ignore_error">ignore_error</a>
 </h6>

@@ -400,7 +402,7 @@
</tbody>
</table></div>
<a name="math_toolkit.policy.pol_ref.error_handling_policies.user_error"></a><h6>
-<a name="id1328297"></a>
+<a name="id1388857"></a>
 <a class="link" href="error_handling_policies.html#math_toolkit.policy.pol_ref.error_handling_policies.user_error">user_error</a>
 </h6>

@@ -449,7 +451,7 @@
 here</a>.
 
<a name="math_toolkit.policy.pol_ref.error_handling_policies.kinds_of_error_raised"></a><h5>
-<a name="id1329772"></a>
+<a name="id1389841"></a>
 <a class="link" href="error_handling_policies.html#math_toolkit.policy.pol_ref.error_handling_policies.kinds_of_error_raised">Kinds
 of Error Raised</a>
 </h5>
@@ -689,7 +691,7 @@
</tbody>
</table></div>
<a name="math_toolkit.policy.pol_ref.error_handling_policies.examples"></a><h5>
-<a name="id1330613"></a>
+<a name="id1390682"></a>
 <a class="link" href="error_handling_policies.html#math_toolkit.policy.pol_ref.error_handling_policies.examples">Examples</a>
 </h5>

@@ -703,29 +705,39 @@


<pre class="programlisting">#include <boost/math/special_functions/gamma.hpp>
+using boost::math::tgamma;

-using namespace boost::math::policies;
-using namespace boost::math;
+//using namespace boost::math::policies; may also be convenient.
+using boost::math::policies::policy;
+using boost::math::policies::evaluation_error;
+using boost::math::policies::domain_error;
+using boost::math::policies::overflow_error;
+using boost::math::policies::domain_error;
+using boost::math::policies::pole_error;
+using boost::math::policies::errno_on_error;

// Define a policy:
typedef policy<
- domain_error<errno_on_error>,
- pole_error<errno_on_error>,
- overflow_error<errno_on_error>,
- policies::evaluation_error<errno_on_error>
- > my_policy;
-
-// call the function:
-double t1 = tgamma(some_value, my_policy());
-
-// Alternatively we could use make_policy and define everything at the call site:
-double t2 = tgamma(some_value, make_policy(
- domain_error<errno_on_error>(),
- pole_error<errno_on_error>(),
- overflow_error<errno_on_error>(),
- policies::evaluation_error<errno_on_error>()
- ));
-
+ domain_error<errno_on_error>,
+ pole_error<errno_on_error>,
+ overflow_error<errno_on_error>,
+ evaluation_error<errno_on_error>
+> my_policy;
+
+double my_value = 0.; //
+
+// Call the function applying my_policy:
+double t1 = tgamma(my_value, my_policy());
+
+// Alternatively (and equivalently) we could use helpful function
+// make_policy and define everything at the call site:
+double t2 = tgamma(my_value,
+ make_policy(
+ domain_error<errno_on_error>(),
+ pole_error<errno_on_error>(),
+ overflow_error<errno_on_error>(),
+ evaluation_error<errno_on_error>() )
+ );
</pre>

 
@@ -741,21 +753,22 @@


<pre class="programlisting">#include <boost/math/distributions/normal.hpp>
+using boost::math::normal_distribution;

using namespace boost::math::policies;
-using namespace boost::math;

-// Define a policy:
+// Define a specific policy:
typedef policy<
 overflow_error<ignore_error>
 > my_policy;

-// Define the distribution:
+// Define the distribution, using my_policy:
typedef normal_distribution<double, my_policy> my_norm;

-// Get a quantile:
-double q = quantile(my_norm(), 0.05);
-
+// Construct a my_norm distribution, using default mean and standard deviation,
+// and get a 0.05 or 5% quantile:
+double q = quantile(my_norm(), 0.05); // = -1.64485
+
</pre>

 
@@ -764,9 +777,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,7 +1,7 @@
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Internal Promotion Policies</title>
+<title>Internal Floating-point Promotion Policies</title>
<link rel="stylesheet" href="../../../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../../index.html" title="Math Toolkit">
@@ -24,15 +24,16 @@
</div>
<div class="section" lang="en">
<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 Promotion Policies"> Internal
- Promotion Policies</a>
+<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>
</h4></div></div></div>

 Normally when evaluating a function at say <code class="computeroutput">float</code>
 precision, maximal accuracy is assured by conducting the calculation at
 <code class="computeroutput">double</code> precision internally,
- and then rounding the result. There are two policies that effect whether
- internal promotion takes place or not:
+ and then rounding the result. There are two policies that control whether
+ internal promotion to a higher precision floating-point type takes place,
+ or not:
 
<div class="informaltable"><table class="table">
<colgroup>
@@ -84,7 +85,7 @@
</tbody>
</table></div>
<a name="math_toolkit.policy.pol_ref.internal_promotion.examples"></a><h5>
-<a name="id1333217"></a>
+<a name="id1392979"></a>
 <a class="link" href="internal_promotion.html#math_toolkit.policy.pol_ref.internal_promotion.examples">Examples</a>
 </h5>

@@ -100,17 +101,18 @@
<pre class="programlisting">#include <boost/math/special_functions/gamma.hpp>

using namespace boost::math::policies;
-using namespace boost::math;
+using boost::math::tgamma;

-// Define a policy:
+// Define a new policy *not* internally promoting RealType to double:
typedef policy<
 promote_double<false>
 > my_policy;

-// Call the function:
+// Call the function, applying the new policy:
double t1 = tgamma(some_value, my_policy());

-// Alternatively we could use make_policy and define everything at the call site:
+// Alternatively we could use helper function make_policy,
+// and concisely define everything at the call site:
double t2 = tgamma(some_value, make_policy(promote_double<false>()));

</pre>
@@ -128,16 +130,16 @@


<pre class="programlisting">#include <boost/math/distributions/normal.hpp>
+using boost::math::normal_distribution;

using namespace boost::math::policies;
-using namespace boost::math;

// Define a policy:
typedef policy<
 promote_float<false>
 > my_policy;

-// Define the distribution:
+// Define the new normal distribution using my_policy:
typedef normal_distribution<float, my_policy> my_norm;

// Get a quantile:
@@ -151,9 +153,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -50,24 +50,27 @@


<pre class="programlisting">#include <boost/math/special_functions/gamma.hpp>
+//using boost::math::tgamma;
+// Need not declare using boost::math::tgamma here,
+// because will define tgamma in myspace using macro below.
+
+namespace myspace
+{
+ using namespace boost::math::policies;

-namespace myspace{
-
-using namespace boost::math::policies;
-
-// Define a policy that does not throw on overflow:
-typedef policy<overflow_error<errno_on_error> > my_policy;
-
-// Define the special functions in this scope to use the policy:
-BOOST_MATH_DECLARE_SPECIAL_FUNCTIONS(my_policy)
+ // Define a policy that does not throw on overflow:
+ typedef policy<overflow_error<errno_on_error> > my_policy;

+ // Define the special functions in this scope to use the policy:
+ BOOST_MATH_DECLARE_SPECIAL_FUNCTIONS(my_policy)
}

-//
-// Now we can use myspace::tgamma etc.
+// Now we can use myspace::tgamma etc.
// They will automatically use "my_policy":
//
-double t = myspace::tgamma(30.0); // will not throw on overflow
+double t = myspace::tgamma(30.0); // Will *not* throw on overflow,
+// despite the large value of factorial 30 = 265252859812191058636308480000000
+// unlike default policy boost::math::tgamma;

</pre>

@@ -102,33 +105,40 @@

<pre class="programlisting">#include <boost/math/distributions/cauchy.hpp>

-namespace myspace{
-
-using namespace boost::math::policies;
-
-// Define a policy to use, in this case we want all the distribution
-// accessor functions to compile, even if they are mathematically
-// undefined:
-typedef policy<assert_undefined<false> > my_policy;
-
-BOOST_MATH_DECLARE_DISTRIBUTIONS(double, my_policy)
-
-}
-
+namespace myspace
+{ // using namespace boost::math::policies; // May be convenient in myspace.
+
+ // Define a policy called my_policy to use.
+ using boost::math::policies::policy;
+
+// In this case we want all the distribution accessor functions to compile,
+// even if they are mathematically undefined, so
+// make the policy assert_undefined.
+ using boost::math::policies::assert_undefined;
+
+typedef policy<assert_undefined<false> > my_policy;
+
+// Finally apply this policy to type double.
+BOOST_MATH_DECLARE_DISTRIBUTIONS(double, my_policy)
+} // namespace myspace
+
// Now we can use myspace::cauchy etc, which will use policy
// myspace::mypolicy:
//
-// This compiles but raises a domain error at runtime:
-//
-void test_cauchy()
+// This compiles but throws a domain error exception at runtime.
+// Caution! If you omit the try'n'catch blocks,
+// it will just silently terminate, giving no clues as to why!
+// So try'n'catch blocks are very strongly recommended.
+
+void test_cauchy()
{
 try
 {
- double d = mean(myspace::cauchy());
- }
+ double d = mean(myspace::cauchy()); // Cauchy does not have a mean!
+ }
 catch(const std::domain_error& e)
 {
- std::cout << e.what() << std::endl;
+ cout << e.what() << endl;
 }
}

@@ -151,9 +161,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -245,9 +245,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -61,7 +61,7 @@
 then you can do so by defining various macros in boost/math/tools/user.hpp.
 
<a name="math_toolkit.policy.pol_ref.policy_defaults.boost_math_domain_error_policy"></a><h6>
-<a name="id1336840"></a>
+<a name="id1396719"></a>
 <a class="link" href="policy_defaults.html#math_toolkit.policy.pol_ref.policy_defaults.boost_math_domain_error_policy">BOOST_MATH_DOMAIN_ERROR_POLICY</a>
 </h6>

@@ -71,7 +71,7 @@
 <code class="computeroutput">ignore_error</code> or <code class="computeroutput">user_error</code>.
 
<a name="math_toolkit.policy.pol_ref.policy_defaults.boost_math_pole_error_policy"></a><h6>
-<a name="id1336893"></a>
+<a name="id1396772"></a>
 <a class="link" href="policy_defaults.html#math_toolkit.policy.pol_ref.policy_defaults.boost_math_pole_error_policy">BOOST_MATH_POLE_ERROR_POLICY</a>
 </h6>

@@ -81,7 +81,7 @@
 <code class="computeroutput">ignore_error</code> or <code class="computeroutput">user_error</code>.
 
<a name="math_toolkit.policy.pol_ref.policy_defaults.boost_math_overflow_error_policy"></a><h6>
-<a name="id1336946"></a>
+<a name="id1396825"></a>
 <a class="link" href="policy_defaults.html#math_toolkit.policy.pol_ref.policy_defaults.boost_math_overflow_error_policy">BOOST_MATH_OVERFLOW_ERROR_POLICY</a>
 </h6>

@@ -91,7 +91,7 @@
 <code class="computeroutput">ignore_error</code> or <code class="computeroutput">user_error</code>.
 
<a name="math_toolkit.policy.pol_ref.policy_defaults.boost_math_rounding_error_policy"></a><h6>
-<a name="id1336999"></a>
+<a name="id1396878"></a>
 <a class="link" href="policy_defaults.html#math_toolkit.policy.pol_ref.policy_defaults.boost_math_rounding_error_policy">BOOST_MATH_ROUNDING_ERROR_POLICY</a>
 </h6>

@@ -101,7 +101,7 @@
 <code class="computeroutput">ignore_error</code> or <code class="computeroutput">user_error</code>.
 
<a name="math_toolkit.policy.pol_ref.policy_defaults.boost_math_evaluation_error_policy"></a><h6>
-<a name="id1337052"></a>
+<a name="id1396930"></a>
 <a class="link" href="policy_defaults.html#math_toolkit.policy.pol_ref.policy_defaults.boost_math_evaluation_error_policy">BOOST_MATH_EVALUATION_ERROR_POLICY</a>
 </h6>

@@ -111,7 +111,7 @@
 <code class="computeroutput">ignore_error</code> or <code class="computeroutput">user_error</code>.
 
<a name="math_toolkit.policy.pol_ref.policy_defaults.boost_math_underflow_error_policy"></a><h6>
-<a name="id1337104"></a>
+<a name="id1396983"></a>
 <a class="link" href="policy_defaults.html#math_toolkit.policy.pol_ref.policy_defaults.boost_math_underflow_error_policy">BOOST_MATH_UNDERFLOW_ERROR_POLICY</a>
 </h6>

@@ -121,7 +121,7 @@
 <code class="computeroutput">ignore_error</code> or <code class="computeroutput">user_error</code>.
 
<a name="math_toolkit.policy.pol_ref.policy_defaults.boost_math_denorm_error_policy"></a><h6>
-<a name="id1337157"></a>
+<a name="id1397036"></a>
 <a class="link" href="policy_defaults.html#math_toolkit.policy.pol_ref.policy_defaults.boost_math_denorm_error_policy">BOOST_MATH_DENORM_ERROR_POLICY</a>
 </h6>

@@ -131,7 +131,7 @@
 <code class="computeroutput">ignore_error</code> or <code class="computeroutput">user_error</code>.
 
<a name="math_toolkit.policy.pol_ref.policy_defaults.boost_math_indeterminate_result_error_policy"></a><h6>
-<a name="id1337210"></a>
+<a name="id1397089"></a>
 <a class="link" href="policy_defaults.html#math_toolkit.policy.pol_ref.policy_defaults.boost_math_indeterminate_result_error_policy">BOOST_MATH_INDETERMINATE_RESULT_ERROR_POLICY</a>
 </h6>

@@ -142,7 +142,7 @@
 <code class="computeroutput">ignore_error</code> or <code class="computeroutput">user_error</code>.
 
<a name="math_toolkit.policy.pol_ref.policy_defaults.boost_math_digits10_policy"></a><h6>
-<a name="id1337263"></a>
+<a name="id1397142"></a>
 <a class="link" href="policy_defaults.html#math_toolkit.policy.pol_ref.policy_defaults.boost_math_digits10_policy">BOOST_MATH_DIGITS10_POLICY</a>
 </h6>

@@ -153,7 +153,7 @@
 recommended that you change this from the default.
 
<a name="math_toolkit.policy.pol_ref.policy_defaults.boost_math_promote_float_policy"></a><h6>
-<a name="id1337287"></a>
+<a name="id1397917"></a>
 <a class="link" href="policy_defaults.html#math_toolkit.policy.pol_ref.policy_defaults.boost_math_promote_float_policy">BOOST_MATH_PROMOTE_FLOAT_POLICY</a>
 </h6>

@@ -165,7 +165,7 @@
 off.
 
<a name="math_toolkit.policy.pol_ref.policy_defaults.boost_math_promote_double_policy"></a><h6>
-<a name="id1337340"></a>
+<a name="id1397970"></a>
 <a class="link" href="policy_defaults.html#math_toolkit.policy.pol_ref.policy_defaults.boost_math_promote_double_policy">BOOST_MATH_PROMOTE_DOUBLE_POLICY</a>
 </h6>

@@ -177,7 +177,7 @@
 off.
 
<a name="math_toolkit.policy.pol_ref.policy_defaults.boost_math_discrete_quantile_policy"></a><h6>
-<a name="id1337397"></a>
+<a name="id1398027"></a>
 <a class="link" href="policy_defaults.html#math_toolkit.policy.pol_ref.policy_defaults.boost_math_discrete_quantile_policy">BOOST_MATH_DISCRETE_QUANTILE_POLICY</a>
 </h6>

@@ -188,7 +188,7 @@
 Defaults to <code class="computeroutput">integer_round_outwards</code>.
 
<a name="math_toolkit.policy.pol_ref.policy_defaults.boost_math_assert_undefined_policy"></a><h6>
-<a name="id1337464"></a>
+<a name="id1398095"></a>
 <a class="link" href="policy_defaults.html#math_toolkit.policy.pol_ref.policy_defaults.boost_math_assert_undefined_policy">BOOST_MATH_ASSERT_UNDEFINED_POLICY</a>
 </h6>

@@ -201,7 +201,7 @@
 whether or not a particular property is well defined.
 
<a name="math_toolkit.policy.pol_ref.policy_defaults.boost_math_max_series_iteration_policy"></a><h6>
-<a name="id1337496"></a>
+<a name="id1398126"></a>
 <a class="link" href="policy_defaults.html#math_toolkit.policy.pol_ref.policy_defaults.boost_math_max_series_iteration_policy">BOOST_MATH_MAX_SERIES_ITERATION_POLICY</a>
 </h6>

@@ -210,7 +210,7 @@
 Defaults to 1000000.
 
<a name="math_toolkit.policy.pol_ref.policy_defaults.boost_math_max_root_iteration_policy"></a><h6>
-<a name="id1337517"></a>
+<a name="id1398147"></a>
 <a class="link" href="policy_defaults.html#math_toolkit.policy.pol_ref.policy_defaults.boost_math_max_root_iteration_policy">BOOST_MATH_MAX_ROOT_ITERATION_POLICY</a>
 </h6>

@@ -219,7 +219,7 @@
 Defaults to 200.
 
<a name="math_toolkit.policy.pol_ref.policy_defaults.example"></a><h6>
-<a name="id1337539"></a>
+<a name="id1398169"></a>
 <a class="link" href="policy_defaults.html#math_toolkit.policy.pol_ref.policy_defaults.example">Example</a>
 </h6>

@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -31,7 +31,8 @@
 There are two equivalent policies that effect the working precision
 used to calculate results, these policies both default to 0 - meaning calculate
 to the maximum precision available in the type being used - but can be
- set to other values to cause lower levels of precision to be used.
+ set to other values to cause lower levels of precision to be used. One
+ might want to trade precision for evaluation speed.
 
<pre class="programlisting">namespace boost{ namespace math{ namespace policies{

@@ -64,21 +65,19 @@


<pre class="programlisting">#include <boost/math/special_functions/gamma.hpp>
+using boost::math::tgamma;
+using boost::math::policies::policy;
+using boost::math::policies::digits10;

-using namespace boost::math;
-using namespace boost::math::policies;
-
-typedef policy<digits10<5> > pol;
-
-double t = tgamma(12, pol());
-
-</pre>
+typedef policy<digits10<5> > my_pol_5; // Define a new, non-default, policy
+// to calculate tgamma to accuracy of approximately 5 decimal digits.
+</pre>

 

 

- Or again using make_policy:
+ Or again using helper function <code class="computeroutput">make_policy</code>:
 

 
@@ -86,12 +85,12 @@


<pre class="programlisting">#include <boost/math/special_functions/gamma.hpp>
+using boost::math::tgamma;

-using namespace boost::math;
using namespace boost::math::policies;

-double t = tgamma(12, policy<digits10<5> >());
-
+double t = tgamma(12, policy<digits10<5> >()); // Concise make_policy.
+
</pre>

 
@@ -106,14 +105,16 @@


<pre class="programlisting">#include <boost/math/distributions/normal.hpp>
+using boost::math::normal_distribution;

-using namespace boost::math;
using namespace boost::math::policies;

+const int bits = 25; // approximate precision.
+
double q = quantile(
- normal_distribution<double, policy<digits2<25> > >(),
- 0.05);
-
+ normal_distribution<double, policy<digits2<bits> > >(),
+ 0.05); // 5% quantile.
+
</pre>

 
@@ -122,9 +123,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -29,7 +29,9 @@
</h4></div></div></div>

 All of the statistical distributions in this library are class templates
- that accept two template parameters, both with sensible defaults, for example:
+ that accept two template parameters: real type (float, double ...) and
+ policy (how to handle exceptional events), both with sensible defaults,
+ for example:
 
<pre class="programlisting">namespace boost{ namespace math{

@@ -58,27 +60,31 @@


<pre class="programlisting">#include <boost/math/distributions/binomial.hpp>
+using boost::math::binomial_distribution;
+
+// Begin by defining a policy type, that gives the behaviour we want:
+
+//using namespace boost::math::policies; or explicitly
+using boost::math::policies::policy;
+
+using boost::math::policies::promote_float;
+using boost::math::policies::discrete_quantile;
+using boost::math::policies::integer_round_nearest;

-//
-// Begin by defining a policy type, that gives the
-// behaviour we want:
-//
-using namespace boost::math::policies;
typedef policy<
- promote_float<false>,
- discrete_quantile<integer_round_nearest>
-> mypolicy;
+ promote_float<false>, // Do not promote to double.
+ discrete_quantile<integer_round_nearest> // Round result to nearest integer.
+> mypolicy;
//
-// Then define a distribution that uses it:
-//
+// Then define a new distribution that uses it:
typedef boost::math::binomial_distribution<float, mypolicy> mybinom;
-//
-// And now use it to get the quantile:
-//
-int main()
+
+// And now use it to get the quantile:
+
+int main()
{
- std::cout << "quantile is: " <<
- quantile(mybinom(200, 0.25), 0.05) << std::endl;
+ cout << "quantile(mybinom(200, 0.25), 0.05) is: " <<
+ quantile(mybinom(200, 0.25), 0.05) << endl;
}

</pre>
@@ -93,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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -64,10 +64,11 @@


<pre class="programlisting">#include <boost/math/special_functions/gamma.hpp>
-//
-// Define the policy to use:
-//
+using boost::math::tgamma;
+
+// Define the policy to use:
using namespace boost::math::policies;
+
typedef policy<
 domain_error<errno_on_error>,
 pole_error<errno_on_error>,
@@ -76,18 +77,21 @@
> c_policy;
//
// Now use the policy when calling tgamma:
-//
-int main()
+
+// http://msdn.microsoft.com/en-us/library/t3ayayh1.aspx
+// Microsoft errno declared in STDLIB.H as "extern int errno;"
+
+int main()
{
- errno = 0;
- std::cout << "Result of tgamma(30000) is: "
- << boost::math::tgamma(30000, c_policy()) << std::endl;
- std::cout << "errno = " << errno << std::endl;
- std::cout << "Result of tgamma(-10) is: "
- << boost::math::tgamma(-10, c_policy()) << std::endl;
- std::cout << "errno = " << errno << std::endl;
-}
-
+ errno = 0; // Reset.
+ cout << "Result of tgamma(30000) is: "
+ << tgamma(30000, c_policy()) << endl; // Too big parameter
+ cout << "errno = " << errno << endl; // errno 34 Numerical result out of range.
+ cout << "Result of tgamma(-10) is: "
+ << boost::math::tgamma(-10, c_policy()) << endl; // Negative parameter.
+ cout << "errno = " << errno << endl; // error 33 Numerical argument out of domain.
+} // int main()
+
</pre>

 
@@ -112,10 +116,18 @@


<pre class="programlisting">#include <boost/math/special_functions/gamma.hpp>
+using boost::math::tgamma;

int main()
{
- using namespace boost::math::policies;
+ // using namespace boost::math::policies; // or
+ using boost::math::policies::errno_on_error;
+ using boost::math::policies::make_policy;
+ using boost::math::policies::pole_error;
+ using boost::math::policies::domain_error;
+ using boost::math::policies::overflow_error;
+ using boost::math::policies::evaluation_error;
+
 errno = 0;
 std::cout << "Result of tgamma(30000) is: "
 << boost::math::tgamma(
@@ -152,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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -33,8 +33,8 @@
 

 For example, passing <code class="computeroutput">-DBOOST_MATH_DOMAIN_ERROR_POLICY=errno_on_error</code>
- to your compiler will cause domain errors to set <code class="computeroutput">::errno</code> and return a NaN rather than the
- usual default behaviour of throwing a <code class="computeroutput">std::domain_error</code>
+ to your compiler will cause domain errors to set <code class="computeroutput">::errno</code> and return a NaN
+ rather than the usual default behaviour of throwing a <code class="computeroutput">std::domain_error</code>
 exception.
 
<div class="tip"><table border="0" summary="Tip">
@@ -66,7 +66,7 @@

 

- may be ignored.
+ may be ignored.
 

 The compiler command line shows:
@@ -228,14 +228,17 @@

 try
 {
- errno = 0;
- students_t dist(degrees_of_freedom); // exception is thrown here if enabled
+ errno = 0; // Clear/reset.
+ students_t dist(degrees_of_freedom); // exception is thrown here if enabled.
 double p = cdf(dist, t);
- // test for error reported by other means:
+ // Test for error reported by other means:
 if((boost::math::isnan)(p))
 {
 cout << "cdf returned a NaN!" << endl;
- cout << "errno is set to: " << errno << endl;
+ if (errno != 0)
+ { // So errno has been set.
+ cout << "errno is set to: " << errno << endl;
+ }
 }
 else
 cout << "Probability of Student's t is " << p << endl;
@@ -245,7 +248,6 @@
 std::cout <<
 "\n""Message from thrown exception was:\n " << e.what() << std::endl;
 }
-
 return 0;
} // int main()</pre>

@@ -254,7 +256,7 @@
 

 Here's what the program output looks like with a default build (one that
- does throw exceptions):
+ does throw exceptions):
 


@@ -287,7 +289,6 @@
<pre class="programlisting">Example error handling using Student's t function.
BOOST_MATH_DOMAIN_ERROR_POLICY is set to: ignore_error
cdf returned a NaN!
-errno is set to: 0
</pre>

 
@@ -302,7 +303,7 @@

 

- Which gives the output:
+ Which gives the output show errno:
 


@@ -317,9 +318,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -29,17 +29,18 @@
</h4></div></div></div>

 Sometimes what you want to do is just change a set of policies within the
- current scope: the one thing you should not do in this situation is use
- the configuration macros, as this can lead to "One Definition Rule"
- violations. Instead this library provides a pair of macros especially for
- this purpose.
+ current scope: the one thing you should not do in
+ this situation is use the configuration macros, as this can
+ lead to "One Definition Rule" violations. Instead this library
+ provides a pair of macros especially for this purpose.
 

 Let's consider the special functions first: we can declare a set of forwarding
 functions that all use a specific policy using the macro BOOST_MATH_DECLARE_SPECIAL_FUNCTIONS(Policy).
 This macro should be used either inside a unique namespace set aside for
- the purpose, or an unnamed namespace if you just want the functions visible
- in global scope for the current file only.
+ the purpose (for example, a C namespace for a C-style policy), or an unnamed
+ namespace if you just want the functions visible in global scope for the
+ current file only.
 

 
@@ -51,46 +52,58 @@

 

- We'll begin by including the needed header:
+ We'll begin by including the needed header for our function:
 

 



-<pre class="programlisting">#include <boost/math/special_functions.hpp></pre>
+<pre class="programlisting">#include <boost/math/special_functions.hpp>
+//using boost::math::tgamma; // Not needed because using C::tgamma.</pre>

 

 

 Open up the "C" namespace that we'll use for our functions,
- and define the policy type we want: in this case one that sets ::errno
- rather than throwing exceptions. Any policies we don't specify here will
- inherit the defaults:
+ and define the policy type we want: in this case a C-style one that sets
+ ::errno and returns a standard value, rather than throwing exceptions.
+ 
+
+ 
+
+ Any policies we don't specify here will inherit the defaults.
 

 



-<pre class="programlisting">namespace C{
+<pre class="programlisting">namespace C
+{ // To hold our C-style policy.
+ //using namespace boost::math::policies; or explicitly:
+ using boost::math::policies::policy;

-using namespace boost::math::policies;
+ using boost::math::policies::domain_error;
+ using boost::math::policies::pole_error;
+ using boost::math::policies::overflow_error;
+ using boost::math::policies::evaluation_error;
+ using boost::math::policies::errno_on_error;

-typedef policy<
- domain_error<errno_on_error>,
- pole_error<errno_on_error>,
- overflow_error<errno_on_error>,
- evaluation_error<errno_on_error>
-> c_policy;</pre>
+ typedef policy<
+ domain_error<errno_on_error>,
+ pole_error<errno_on_error>,
+ overflow_error<errno_on_error>,
+ evaluation_error<errno_on_error>
+ > c_policy;</pre>

 

 

 All we need do now is invoke the BOOST_MATH_DECLARE_SPECIAL_FUNCTIONS
- macro passing our policy type as the single argument:
+ macro passing our policy type c_policy as the single argument:
 

 
@@ -125,7 +138,7 @@

 

- So that when we call <code class="computeroutput">C::tgamma(z)</code> we really end up calling <code class="computeroutput">boost::math::tgamma(z, C::c_policy())</code>:
+ So that when we call <code class="computeroutput">C::tgamma(z)</code>, we really end up calling <code class="computeroutput">boost::math::tgamma(z, C::c_policy())</code>:
 

 
@@ -135,13 +148,13 @@
<pre class="programlisting">int main()
{
 errno = 0;
- std::cout << "Result of tgamma(30000) is: "
- << C::tgamma(30000) << std::endl;
- std::cout << "errno = " << errno << std::endl;
- std::cout << "Result of tgamma(-10) is: "
- << C::tgamma(-10) << std::endl;
- std::cout << "errno = " << errno << std::endl;
-}</pre>
+ cout << "Result of tgamma(30000) is: "
+ << C::tgamma(30000) << endl; // Note using C::tgamma
+ cout << "errno = " << errno << endl; // errno = 34
+ cout << "Result of tgamma(-10) is: "
+ << C::tgamma(-10) << endl;
+ cout << "errno = " << errno << endl; // errno = 33, overwriting previous value of 34.
+}</pre>

 

@@ -161,8 +174,8 @@
 

 This mechanism is particularly useful when we want to define a project-wide
- policy, and don't want to modify the Boost source or set - possibly fragile
- and easy to forget - project wide build macros.
+ policy, and don't want to modify the Boost source, or to set project
+ wide build macros (possibly fragile and easy to forget).
 

 
@@ -177,32 +190,49 @@


<pre class="programlisting">#include <boost/math/special_functions.hpp>
-
-namespace {
-
+// using boost::math::tgamma; // Would create an ambiguity between
+// 'double boost::math::tgamma<int>(T)' and
+// 'double 'anonymous-namespace'::tgamma<int>(RT)'.
+
+namespace
+{ // unnamed
+
using namespace boost::math::policies;

typedef policy<
 domain_error<errno_on_error>,
 pole_error<errno_on_error>,
 overflow_error<errno_on_error>,
- evaluation_error<errno_on_error>
+ evaluation_error<errno_on_error>
> c_policy;

-BOOST_MATH_DECLARE_SPECIAL_FUNCTIONS(c_policy)
-
-} // close unnamed namespace
+BOOST_MATH_DECLARE_SPECIAL_FUNCTIONS(c_policy)</pre>
+
+ 
+
+ 
+
+ So that when we call <code class="computeroutput">tgamma(z)</code>, we really end up calling <code class="computeroutput">boost::math::tgamma(z, anonymous-namespace::c_policy())</code>.
+ 
+
+ 
+
+
+
+<pre class="programlisting">} // close unnamed namespace

int main()
{
 errno = 0;
- std::cout << "Result of tgamma(30000) is: "
- << tgamma(30000) << std::endl;
- std::cout << "errno = " << errno << std::endl;
- std::cout << "Result of tgamma(-10) is: "
- << tgamma(-10) << std::endl;
- std::cout << "errno = " << errno << std::endl;
-}
+ cout << "Result of tgamma(30000) is: "
+ << tgamma(30000) << endl;
+ // tgamma in unnamed namespace in this translation unit (file) only.
+ cout << "errno = " << errno << endl;
+ cout << "Result of tgamma(-10) is: "
+ << tgamma(-10) << endl;
+ cout << "errno = " << errno << endl;
+ // Default tgamma policy would throw an exception, and abort.
+}

</pre>

@@ -210,9 +240,9 @@

 

- Handling the statistical distributions is very similar except that now
- the macro BOOST_MATH_DECLARE_DISTRIBUTIONS accepts two parameters: the
- floating point type to use, and the policy type to apply. For example:
+ Handling policies for the statistical distributions is very similar except
+ that now the macro BOOST_MATH_DECLARE_DISTRIBUTIONS accepts two parameters:
+ the floating point type to use, and the policy type to apply. For example:
 
<pre class="programlisting">BOOST_MATH_DECLARE_DISTRIBUTIONS(double, mypolicy)
</pre>
@@ -247,7 +277,7 @@

 

- We'll begin by including the needed header:
+ We'll begin by including the needed header for all the distributions:
 

 
@@ -260,34 +290,37 @@

 

- Open up an appropriate namespace for our distributions, and define the
- policy type we want. Any policies we don't specify here will inherit
- the defaults:
+ Open up an appropriate namespace, calling it <code class="computeroutput">my_distributions</code>,
+ for our distributions, and define the policy type we want. Any policies
+ we don't specify here will inherit the defaults:
 

 



-<pre class="programlisting">namespace my_distributions{
-
-using namespace boost::math::policies;
-
-typedef policy<
- // return infinity and set errno rather than throw:
- overflow_error<errno_on_error>,
- // Don't promote double -> long double internally:
- promote_double<false>,
- // Return the closest integer result for discrete quantiles:
- discrete_quantile<integer_round_nearest>
-> my_policy;</pre>
+<pre class="programlisting">namespace my_distributions
+{
+ using namespace boost::math::policies;
+ // using boost::math::policies::errno_on_error; // etc.
+
+ typedef policy<
+ // return infinity and set errno rather than throw:
+ overflow_error<errno_on_error>,
+ // Don't promote double -> long double internally:
+ promote_double<false>,
+ // Return the closest integer result for discrete quantiles:
+ discrete_quantile<integer_round_nearest>
+ > my_policy;</pre>

 

 

 All we need do now is invoke the BOOST_MATH_DECLARE_DISTRIBUTIONS macro
- passing the floating point and policy types as arguments:
+ passing the floating point type <code class="computeroutput">double</code>
+ and policy types <code class="computeroutput">my_policy</code>
+ as arguments:
 

 
@@ -302,7 +335,7 @@

 

- We now have a set of typedefs defined in namespace my_namespace that
+ We now have a set of typedefs defined in namespace my_distributions that
 all look something like this:
 

@@ -320,7 +353,8 @@

 

- So that when we use my_namespace::normal we really end up using <code class="computeroutput">boost::math::normal_distribution<double, my_policy></code>:
+ So that when we use my_distributions::normal we really end up using
+ <code class="computeroutput">boost::math::normal_distribution<double, my_policy></code>:
 

 
@@ -329,26 +363,25 @@

<pre class="programlisting">int main()
{
- //
- // Start with something we know will overflow:
- //
+ // Construct distribution with something we know will overflow
+ // (using double rather than if promoted to long double):
 my_distributions::normal norm(10, 2);
+
 errno = 0;
- std::cout << "Result of quantile(norm, 0) is: "
- << quantile(norm, 0) << std::endl;
- std::cout << "errno = " << errno << std::endl;
+ cout << "Result of quantile(norm, 0) is: "
+ << quantile(norm, 0) << endl; // -infinity.
+ cout << "errno = " << errno << endl;
 errno = 0;
- std::cout << "Result of quantile(norm, 1) is: "
- << quantile(norm, 1) << std::endl;
- std::cout << "errno = " << errno << std::endl;
- //
- // Now try a discrete distribution:
- //
+ cout << "Result of quantile(norm, 1) is: "
+ << quantile(norm, 1) << endl; // +infinity.
+ cout << "errno = " << errno << endl;
+
+ // Now try a discrete distribution.
 my_distributions::binomial binom(20, 0.25);
- std::cout << "Result of quantile(binom, 0.05) is: "
- << quantile(binom, 0.05) << std::endl;
- std::cout << "Result of quantile(complement(binom, 0.05)) is: "
- << quantile(complement(binom, 0.05)) << std::endl;
+ cout << "Result of quantile(binom, 0.05) is: "
+ << quantile(binom, 0.05) << endl; // To check we get integer results.
+ cout << "Result of quantile(complement(binom, 0.05)) is: "
+ << quantile(complement(binom, 0.05)) << endl;
}</pre>

 
@@ -371,8 +404,8 @@
 

 This mechanism is particularly useful when we want to define a project-wide
- policy, and don't want to modify the Boost source or set - possibly fragile
- and easy to forget - project wide build macros.
+ policy, and don't want to modify the Boost source or set project wide
+ build macros (possibly fragile and easy to forget).
 

 
@@ -382,9 +415,9 @@
<th align="left">Note</th>
</tr>
<tr><td align="left" valign="top">
- There is an important limitation to note: you can not use the macros
+ There is an important limitation to note: you can *not use the macros
 BOOST_MATH_DECLARE_DISTRIBUTIONS and BOOST_MATH_DECLARE_SPECIAL_FUNCTIONS
- in the same namespace, as doing so creates ambiguities
+ in the same namespace*, as doing so creates ambiguities
 between functions and distributions of the same name.
 </td></tr>
</table></div>
@@ -398,47 +431,48 @@



-<pre class="programlisting">#include <boost/math/distributions.hpp>
-
-namespace {
-
-using namespace boost::math::policies;
-
-typedef policy<
- // return infinity and set errno rather than throw:
- overflow_error<errno_on_error>,
- // Don't promote double -> long double internally:
- promote_double<false>,
- // Return the closest integer result for discrete quantiles:
- discrete_quantile<integer_round_nearest>
-> my_policy;
+<pre class="programlisting">#include <boost/math/distributions.hpp> // All distributions.
+// using boost::math::normal; // Would create an ambguity between
+// boost::math::normal_distribution<RealType> boost::math::normal and
+// 'anonymous-namespace'::normal'.
+
+namespace
+{ // anonymous or unnnamed (rather than named as in policy_eg_6.cpp).
+
+ using namespace boost::math::policies;
+ // using boost::math::policies::errno_on_error; // etc.
+ typedef policy<
+ // return infinity and set errno rather than throw:
+ overflow_error<errno_on_error>,
+ // Don't promote double -> long double internally:
+ promote_double<false>,
+ // Return the closest integer result for discrete quantiles:
+ discrete_quantile<integer_round_nearest>
+ > my_policy;

-BOOST_MATH_DECLARE_DISTRIBUTIONS(double, my_policy)
+ BOOST_MATH_DECLARE_DISTRIBUTIONS(double, my_policy)

} // close namespace my_namespace

int main()
{
- //
- // Start with something we know will overflow:
- //
- normal norm(10, 2);
- errno = 0;
- std::cout << "Result of quantile(norm, 0) is: "
- << quantile(norm, 0) << std::endl;
- std::cout << "errno = " << errno << std::endl;
+ // Construct distribution with something we know will overflow.
+ normal norm(10, 2); // using 'anonymous-namespace'::normal
+ errno = 0;
+ cout << "Result of quantile(norm, 0) is: "
+ << quantile(norm, 0) << endl;
+ cout << "errno = " << errno << endl;
 errno = 0;
- std::cout << "Result of quantile(norm, 1) is: "
- << quantile(norm, 1) << std::endl;
- std::cout << "errno = " << errno << std::endl;
+ cout << "Result of quantile(norm, 1) is: "
+ << quantile(norm, 1) << endl;
+ cout << "errno = " << errno << endl;
 //
 // Now try a discrete distribution:
- //
 binomial binom(20, 0.25);
- std::cout << "Result of quantile(binom, 0.05) is: "
- << quantile(binom, 0.05) << std::endl;
- std::cout << "Result of quantile(complement(binom, 0.05)) is: "
- << quantile(complement(binom, 0.05)) << std::endl;
+ cout << "Result of quantile(binom, 0.05) is: "
+ << quantile(binom, 0.05) << endl;
+ cout << "Result of quantile(complement(binom, 0.05)) is: "
+ << quantile(complement(binom, 0.05)) << endl;
}

</pre>
@@ -449,9 +483,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -28,9 +28,11 @@
 Policies Have Sensible Defaults</a>
</h4></div></div></div>

- Most of the time you can just ignore the policy framework, the defaults
- for the various policies are as follows, if these work OK for you then
- you can stop reading now!
+ Most of the time you can just ignore the policy framework.
+ 
+
+ *The defaults for the various policies are as follows, if these
+ work OK for you then you can stop reading now!
 
<div class="variablelist">

@@ -123,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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -177,7 +177,7 @@
 base your comparisons on CDF's instead.
 
<a name="math_toolkit.policy.pol_tutorial.understand_dis_quant.other_rounding_policies_are_available"></a><h6>
-<a name="id1324944"></a>
+<a name="id1383756"></a>
 <a class="link" href="understand_dis_quant.html#math_toolkit.policy.pol_tutorial.understand_dis_quant.other_rounding_policies_are_available">Other
 Rounding Policies are Available</a>
 </h6>
@@ -249,7 +249,8 @@

 

- Begin by including the needed headers:
+ Begin by including the needed headers (and some using statements for
+ conciseness):
 

 
@@ -257,6 +258,12 @@


<pre class="programlisting">#include <iostream>
+using std::cout; using std::endl;
+using std::left; using std::fixed; using std::right; using std::scientific;
+#include <iomanip>
+using std::setw;
+using std::setprecision;
+
#include <boost/math/distributions/binomial.hpp></pre>

 
@@ -271,9 +278,26 @@



-<pre class="programlisting">using namespace boost::math::policies;
-using namespace boost::math;
+<pre class="programlisting">// Avoid
+// using namespace std; // and
+// using namespace boost::math;
+// to avoid potential ambiguity of names, like binomial.
+// using namespace boost::math::policies; is small risk, but
+// the necessary items are brought into scope thus:
+
+using boost::math::binomial_distribution;
+using boost::math::policies::policy;
+using boost::math::policies::discrete_quantile;
+
+using boost::math::policies::integer_round_outwards;
+using boost::math::policies::integer_round_down;
+using boost::math::policies::integer_round_up;
+using boost::math::policies::integer_round_nearest;
+using boost::math::policies::integer_round_inwards;
+using boost::math::policies::real;

+using boost::math::binomial_distribution; // Not std::binomial_distribution.
+
typedef binomial_distribution<
 double,
 policy<discrete_quantile<integer_round_outwards> > >
@@ -317,71 +341,71 @@

<pre class="programlisting">int main()
{
- std::cout <<
+ cout <<
 "Testing rounding policies for a 50 sample binomial distribution,\n"
 "with a success fraction of 0.5.\n\n"
 "Lower quantiles are calculated at p = 0.05\n\n"
 "Upper quantiles at p = 0.95.\n\n";

- std::cout << std::setw(25) << std::right
- << "Policy"<< std::setw(18) << std::right
- << "Lower Quantile" << std::setw(18) << std::right
- << "Upper Quantile" << std::endl;
+ cout << setw(25) << right
+ << "Policy"<< setw(18) << right
+ << "Lower Quantile" << setw(18) << right
+ << "Upper Quantile" << endl;

 // Test integer_round_outwards:
- std::cout << std::setw(25) << std::right
+ cout << setw(25) << right
 << "integer_round_outwards"
- << std::setw(18) << std::right
+ << setw(18) << right
 << quantile(binom_round_outwards(50, 0.5), 0.05)
- << std::setw(18) << std::right
+ << setw(18) << right
 << quantile(binom_round_outwards(50, 0.5), 0.95)
- << std::endl;
+ << endl;

 // Test integer_round_inwards:
- std::cout << std::setw(25) << std::right
+ cout << setw(25) << right
 << "integer_round_inwards"
- << std::setw(18) << std::right
+ << setw(18) << right
 << quantile(binom_round_inwards(50, 0.5), 0.05)
- << std::setw(18) << std::right
+ << setw(18) << right
 << quantile(binom_round_inwards(50, 0.5), 0.95)
- << std::endl;
+ << endl;

 // Test integer_round_down:
- std::cout << std::setw(25) << std::right
+ cout << setw(25) << right
 << "integer_round_down"
- << std::setw(18) << std::right
+ << setw(18) << right
 << quantile(binom_round_down(50, 0.5), 0.05)
- << std::setw(18) << std::right
+ << setw(18) << right
 << quantile(binom_round_down(50, 0.5), 0.95)
- << std::endl;
+ << endl;

 // Test integer_round_up:
- std::cout << std::setw(25) << std::right
+ cout << setw(25) << right
 << "integer_round_up"
- << std::setw(18) << std::right
+ << setw(18) << right
 << quantile(binom_round_up(50, 0.5), 0.05)
- << std::setw(18) << std::right
+ << setw(18) << right
 << quantile(binom_round_up(50, 0.5), 0.95)
- << std::endl;
+ << endl;

 // Test integer_round_nearest:
- std::cout << std::setw(25) << std::right
+ cout << setw(25) << right
 << "integer_round_nearest"
- << std::setw(18) << std::right
+ << setw(18) << right
 << quantile(binom_round_nearest(50, 0.5), 0.05)
- << std::setw(18) << std::right
+ << setw(18) << right
 << quantile(binom_round_nearest(50, 0.5), 0.95)
- << std::endl;
+ << endl;

 // Test real:
- std::cout << std::setw(25) << std::right
+ cout << setw(25) << right
 << "real"
- << std::setw(18) << std::right
+ << setw(18) << right
 << quantile(binom_real_quantile(50, 0.5), 0.05)
- << std::setw(18) << std::right
+ << setw(18) << right
 << quantile(binom_real_quantile(50, 0.5), 0.95)
- << std::endl;
-}</pre>
+ << endl;
+} // int main()</pre>

 

@@ -392,36 +416,30 @@



-<pre class="programlisting">Testing rounding policies for a 50 sample binomial distribution,
-with a success fraction of 0.5.
-
-Lower quantiles are calculated at p = 0.05
-
-Upper quantiles at p = 0.95.
-
-Testing rounding policies for a 50 sample binomial distribution,
-with a success fraction of 0.5.
-
-Lower quantiles are calculated at p = 0.05
-
-Upper quantiles at p = 0.95.
-
- Policy Lower Quantile Upper Quantile
- integer_round_outwards 18 31
- integer_round_inwards 19 30
- integer_round_down 18 30
- integer_round_up 19 31
- integer_round_nearest 19 30
- real 18.701 30.299
+<pre class="programlisting">policy_eg_10.vcxproj -> J:\Cpp\MathToolkit\test\Math_test\Release\policy_eg_10.exe
+ Testing rounding policies for a 50 sample binomial distribution,
+ with a success fraction of 0.5.
+
+ Lower quantiles are calculated at p = 0.05
+
+ Upper quantiles at p = 0.95.
+
+ Policy Lower Quantile Upper Quantile
+ integer_round_outwards 18 31
+ integer_round_inwards 19 30
+ integer_round_down 18 30
+ integer_round_up 19 31
+ integer_round_nearest 19 30
+ real 18.701 30.299
</pre>

 
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -63,34 +63,36 @@
 

 So out first job is to include the header we want to use, and then provide
- definitions for the user-defined error handlers we want to use:
+ definitions for our user-defined error handlers that we want to use.
+ We only provide our special domain and pole error handlers; other errors
+ like overflow and underflow use the default.
 

 



-<pre class="programlisting">#include <iostream>
-#include <boost/math/special_functions.hpp>
+<pre class="programlisting">#include <boost/math/special_functions.hpp>

-namespace boost{ namespace math{ namespace policies{
-
-template <class T>
-T user_domain_error(const char* function, const char* message, const T& val)
+namespace boost{ namespace math
{
- std::cerr << "Domain Error." << std::endl;
- return std::numeric_limits<T>::quiet_NaN();
-}
+ namespace policies
+ {
+ template <class T>
+ T user_domain_error(const char* function, const char* message, const T& val)
+ { // Ignoring function, message and val for this example, perhaps unhelpfully.
+ cerr << "Domain Error!" << endl;
+ return std::numeric_limits<T>::quiet_NaN();
+ }

-template <class T>
-T user_pole_error(const char* function, const char* message, const T& val)
-{
- std::cerr << "Pole Error." << std::endl;
- return std::numeric_limits<T>::quiet_NaN();
-}
-
-
-}}} // namespaces</pre>
+ template <class T>
+ T user_pole_error(const char* function, const char* message, const T& val)
+ { // Ignoring function, message and val for this example, perhaps unhelpfully.
+ cerr << "Pole Error!" << endl;
+ return std::numeric_limits<T>::quiet_NaN();
+ }
+ } // namespace policies
+}} // namespace boost{ namespace math</pre>

 

@@ -142,7 +144,7 @@
 

 So that when we call <code class="computeroutput">tgamma(z)</code> we really end up calling <code class="computeroutput">boost::math::tgamma(z, user_error_policy())</code>,
- and any errors will get directed to our own error handlers:
+ and any errors will get directed to our own error handlers.
 

 
@@ -151,10 +153,10 @@

<pre class="programlisting">int main()
{
- std::cout << "Result of erf_inv(-10) is: "
- << erf_inv(-10) << std::endl;
- std::cout << "Result of tgamma(-10) is: "
- << tgamma(-10) << std::endl;
+ cout << "Result of erf_inv(-10) is: "
+ << erf_inv(-10) << endl;
+ cout << "Result of tgamma(-10) is: "
+ << tgamma(-10) << endl;
}</pre>

 
@@ -166,10 +168,10 @@



-<pre class="programlisting">Domain Error.
-Result of erf_inv(-10) is: 1.#QNAN
-Pole Error.
-Result of tgamma(-10) is: 1.#QNAN
+<pre class="programlisting">Domain Error!
+ Pole Error!
+ Result of erf_inv(-10) is: 1.#QNAN
+ Result of tgamma(-10) is: 1.#QNAN
</pre>

 
@@ -191,8 +193,8 @@

<pre class="programlisting">template <class T>
T user_error_type(
- const char* function,
- const char* message,
+ const char* function,
+ const char* message,
 const T& val);
</pre>

@@ -209,7 +211,7 @@
<dd>
 The name of the function that raised the error, this string contains
 one or more %1% format specifiers that should be replaced by the
- name of type T.
+ name of real type T, like float or double.
 </dd>
<dt>const char* message</dt>
<dd>
@@ -238,14 +240,13 @@



-<pre class="programlisting">#include <iostream>
-#include <boost/math/special_functions.hpp></pre>
+<pre class="programlisting">#include <boost/math/special_functions.hpp></pre>

 

 

- Next we'll implement the error handlers for each type of error, starting
+ Next we'll implement our own error handlers for each type of error, starting
 with domain errors:
 

@@ -253,7 +254,9 @@



-<pre class="programlisting">namespace boost{ namespace math{ namespace policies{
+<pre class="programlisting">namespace boost{ namespace math{
+namespace policies
+{

template <class T>
T user_domain_error(const char* function, const char* message, const T& val)
@@ -263,7 +266,8 @@

 

- We'll begin with a bit of defensive programming:
+ We'll begin with a bit of defensive programming in case function or message
+ are empty:
 

 
@@ -279,7 +283,8 @@

 

- Next we'll format the name of the function with the name of type T:
+ Next we'll format the name of the function with the name of type T, perhaps
+ double:
 

 
@@ -294,7 +299,7 @@
 

 Then likewise format the error message with the value of parameter val,
- making sure we output all the digits of val:
+ making sure we output all the potentially significant digits of val:
 

 
@@ -303,7 +308,8 @@

<pre class="programlisting">msg += ": \n";
int prec = 2 + (std::numeric_limits<T>::digits * 30103UL) / 100000UL;
-msg += (boost::format(message) % boost::io::group(std::setprecision(prec), val)).str();</pre>
+// int prec = std::numeric_limits<T>::max_digits10; // For C++0X Standard Library
+msg += (boost::format(message) % boost::io::group(std::setprecision(prec), val)).str();</pre>

 

@@ -380,9 +386,9 @@
 msg += message;

 std::cerr << msg << std::endl;
-
+
 // Value passed to the function is an infinity, just return it:
- return val;
+ return val;
}</pre>

 
@@ -411,9 +417,9 @@
 msg += message;

 std::cerr << msg << std::endl;
-
+
 // Value passed to the function is zero, just return it:
- return val;
+ return val;
}</pre>

 
@@ -442,16 +448,16 @@
 msg += message;

 std::cerr << msg << std::endl;
-
+
 // Value passed to the function is denormalised, just return it:
- return val;
+ return val;
}</pre>

 

 

- Which leaves us with evaluation errors, these occur when an internal
+ Which leaves us with evaluation errors: these occur when an internal
 error occurs that prevents the function being fully evaluated. The parameter
 val contains the closest approximation to the result
 found so far:
@@ -467,7 +473,7 @@
 if(function == 0)
 function = "Unknown function with arguments of type %1%";
 if(message == 0)
- message = "An internal evaluation error occured with "
+ message = "An internal evaluation error occurred with "
 "the best value calculated so far of %1%";

 std::string msg("Error in function ");
@@ -475,17 +481,18 @@

 msg += ": \n";
 int prec = 2 + (std::numeric_limits<T>::digits * 30103UL) / 100000UL;
- msg += (boost::format(message) % boost::io::group(std::setprecision(prec), val)).str();
+ // int prec = std::numeric_limits<T>::max_digits10; // For C++0X Standard Library
+ msg += (boost::format(message) % boost::io::group(std::setprecision(prec), val)).str();

 std::cerr << msg << std::endl;

- // What do we return here? This is generally a fatal error,
- // that should never occur, just return a NaN for the purposes
- // of the example:
+ // What do we return here? This is generally a fatal error, that should never occur,
+ // so we just return a NaN for the purposes of the example:
 return std::numeric_limits<T>::quiet_NaN();
}

-}}} // namespaces</pre>
+} // policies
+}} // boost::math</pre>

 

@@ -499,8 +506,9 @@



-<pre class="programlisting">namespace{
-
+<pre class="programlisting">namespace
+{ // unnamed.
+
using namespace boost::math::policies;

typedef policy<
@@ -514,13 +522,13 @@

BOOST_MATH_DECLARE_SPECIAL_FUNCTIONS(user_error_policy)

-} // close unnamed namespace</pre>
+} // unnamed namespace</pre>

 

 

- We now have a set of forwarding functions defined in an unnamed namespace
+ We now have a set of forwarding functions, defined in an unnamed namespace,
 that all look something like this:
 

@@ -551,21 +559,21 @@
<pre class="programlisting">int main()
{
 // Raise a domain error:
- std::cout << "Result of erf_inv(-10) is: "
- << erf_inv(-10) << std::endl << std::endl;
+ cout << "Result of erf_inv(-10) is: "
+ << erf_inv(-10) << std::endl << endl;
 // Raise a pole error:
- std::cout << "Result of tgamma(-10) is: "
- << tgamma(-10) << std::endl << std::endl;
+ cout << "Result of tgamma(-10) is: "
+ << tgamma(-10) << std::endl << endl;
 // Raise an overflow error:
- std::cout << "Result of tgamma(3000) is: "
- << tgamma(3000) << std::endl << std::endl;
+ cout << "Result of tgamma(3000) is: "
+ << tgamma(3000) << std::endl << endl;
 // Raise an underflow error:
- std::cout << "Result of tgamma(-190.5) is: "
- << tgamma(-190.5) << std::endl << std::endl;
+ cout << "Result of tgamma(-190.5) is: "
+ << tgamma(-190.5) << std::endl << endl;
 // Unfortunately we can't predicably raise a denormalised
 // result, nor can we raise an evaluation error in this example
 // since these should never really occur!
-}</pre>
+} // int main()</pre>

 

@@ -606,16 +614,16 @@
 For example <code class="computeroutput">tgamma(-190.5)</code>
 is implemented in terms of <code class="computeroutput">tgamma(190.5)</code> - which overflows - the reflection formula
 for <code class="computeroutput">tgamma</code> then notices
- that it's dividing by infinity and underflows.
+ that it is dividing by infinity and so underflows.
 

 
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -38,7 +38,7 @@
 </li>
<li>
 What happens when you call a function that is mathematically undefined
- (for example if you ask for the mean of a Cauchy distribution).
+ (for example, if you ask for the mean of a Cauchy distribution).
 </li>
<li>
 What happens when you ask for a quantile of a discrete distribution.
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -145,9 +145,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -47,9 +47,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -28,7 +28,7 @@
 of the First and Second Kinds</a>
</h4></div></div></div>
<a name="math_toolkit.special.bessel.bessel.synopsis"></a><h5>
-<a name="id1194850"></a>
+<a name="id1252748"></a>
 <a class="link" href="bessel.html#math_toolkit.special.bessel.bessel.synopsis">Synopsis</a>
 </h5>
<pre class="programlisting">template <class T1, class T2>
@@ -44,7 +44,7 @@
<a class="link" href="../../main_overview/result_type.html" title="Calculation of the Type of the Result">calculated-result-type</a> cyl_neumann(T1 v, T2 x, const <a class="link" href="../../policy.html" title="Policies">Policy</a>&);
</pre>
<a name="math_toolkit.special.bessel.bessel.description"></a><h5>
-<a name="id1195217"></a>
+<a name="id1253116"></a>
 <a class="link" href="bessel.html#math_toolkit.special.bessel.bessel.description">Description</a>
 </h5>

@@ -104,13 +104,13 @@
 

 The following graph shows the behaviour of Yv: this is also cyclic for
- large x, but tends to -∞ for small x:
+ large x, but tends to -∞ for small x:
 

 <img src="../../../../graphs/cyl_neumann.png" align="middle">
 
<a name="math_toolkit.special.bessel.bessel.testing"></a><h5>
-<a name="id1195581"></a>
+<a name="id1253399"></a>
 <a class="link" href="bessel.html#math_toolkit.special.bessel.bessel.testing">Testing</a>
 </h5>

@@ -119,7 +119,7 @@
 (with all the special case handling removed).
 
<a name="math_toolkit.special.bessel.bessel.accuracy"></a><h5>
-<a name="id1195602"></a>
+<a name="id1253420"></a>
 <a class="link" href="bessel.html#math_toolkit.special.bessel.bessel.accuracy">Accuracy</a>
 </h5>

@@ -135,7 +135,7 @@
 zero error</a>. All values are relative errors in units of epsilon.
 
<div class="table">
-<a name="id1195635"></a>Table 36. Errors Rates in cyl_bessel_j
+<a name="math_toolkit.special.bessel.bessel.errors_rates_in_cyl_bessel_j"></a>Table 36. Errors Rates in cyl_bessel_j
<div class="table-contents"><table class="table" summary="Errors Rates in cyl_bessel_j">
<colgroup>
<col>
@@ -157,7 +157,7 @@
 </th>
<th>
 
- J0 and J1
+ J0 and J1
 
 </th>
<th>
@@ -167,7 +167,7 @@
 </th>
<th>
 
- Jv (large values of x > 1000)
+ Jv (large values of x > 1000)
 
 </th>
</tr></thead>
@@ -242,7 +242,7 @@
 </td>
<td>
 
- Peak=2x104 Mean=6x103
+ Peak=2x104 Mean=6x103
 
 </td>
</tr>
@@ -269,7 +269,7 @@
 </td>
<td>
 
- Peak=2x104 Mean=1x104
+ Peak=2x104 Mean=1x104
 
 </td>
</tr>
@@ -304,7 +304,7 @@
</table></div>
</div>
 <div class="table">
-<a name="id1195940"></a>Table 37. Errors Rates in cyl_neumann
+<a name="math_toolkit.special.bessel.bessel.errors_rates_in_cyl_neumann"></a>Table 37. Errors Rates in cyl_neumann
<div class="table-contents"><table class="table" summary="Errors Rates in cyl_neumann">
<colgroup>
<col>
@@ -326,7 +326,7 @@
 </th>
<th>
 
- J0 and J1
+ J0 and J1
 
 </th>
<th>
@@ -381,7 +381,7 @@
 Peak=561 Mean=36
 
 
- GSL Peak=1.4x106 Mean=7x104
+ GSL Peak=1.4x106 Mean=7x104 
 
 
 <a href="http://www.netlib.org/cephes/" target="_top">Cephes</a> Peak=+INF
@@ -433,12 +433,12 @@
 </td>
<td>
 
- Peak=2x104 Mean=8x103
+ Peak=2x104 Mean=8x103
 
 </td>
<td>
 
- Peak=1x105 Mean=6x103
+ Peak=1x105 Mean=6x103
 
 </td>
</tr>
@@ -465,7 +465,7 @@
 </td>
<td>
 
- Peak=2x104 Mean=1200
+ Peak=2x104 Mean=1200
 
 </td>
</tr>
@@ -494,7 +494,7 @@
 were found.
 
<a name="math_toolkit.special.bessel.bessel.implementation"></a><h5>
-<a name="id1196325"></a>
+<a name="id1255789"></a>
 <a class="link" href="bessel.html#math_toolkit.special.bessel.bessel.implementation">Implementation</a>
 </h5>

@@ -538,9 +538,9 @@
 

 When the order v is an integer the method first relates
- the result to J0, J1, Y0 and Y1 using either forwards or backwards recurrence
+ the result to J0, J1, Y0 and Y1 using either forwards or backwards recurrence
 (Miller's algorithm) depending upon which is stable. The values for J0,
- J1, Y0 and Y1 are calculated using the rational minimax approximations on
+ J1, Y0 and Y1 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:
@@ -562,18 +562,18 @@
 these methods are not used when type T has more than 64 binary digits.
 

- When x is small, Jx is best computed directly from
+ When x is small, Jx is best computed directly from
 the series:
 

 <img src="../../../../equations/bessel2.png">
 

- In the general case we compute Jv and Yv simultaneously.
+ In the general case we compute Jv and Yv simultaneously.
 

- To get the initial values, let μ = ν - floor(ν + 1/2), then μ is the fractional
- part of ν such that |μ| <= 1/2 (we need this for convergence later). The
+ To get the initial values, let μ = ν - floor(ν + 1/2), then μ is the fractional
+ part of ν such that |μ| <= 1/2 (we need this for convergence later). The
 idea is to calculate Jμ(x), Jμ+1(x), Yμ(x), Yμ+1(x) and use them to obtain
 Jν(x), Yν(x).
 
@@ -642,7 +642,7 @@
 <img src="../../../../equations/bessel16.png">
 

- gk and hk
+ gk and hk 
are also computed by recursions (involving gamma functions), but
 the formulas are a little complicated, readers are refered to N.M. Temme,
 On the numerical evaluation of the ordinary Bessel function of
@@ -650,16 +650,16 @@
 (1976). Note Temme's series converge only for |μ| <= 1/2.
 

- As the previous case, Yν is calculated from the forward recurrence, so is
+ As the previous case, Yν is calculated from the forward recurrence, so is
 Yν+1. With these two values and fν, the Wronskian yields Jν(x) directly without
 backward recurrence.
 
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -28,7 +28,7 @@
 Overview</a>
</h4></div></div></div>
<a name="math_toolkit.special.bessel.bessel_over.ordinary_bessel_functions"></a><h5>
-<a name="id1194100"></a>
+<a name="id1252000"></a>
 <a class="link" href="bessel_over.html#math_toolkit.special.bessel.bessel_over.ordinary_bessel_functions">Ordinary
 Bessel Functions</a>
 </h5>
@@ -39,7 +39,7 @@
 <img src="../../../../equations/bessel1.png">
 

- where ν is the order of the equation, and may be an
+ where ν is the order of the equation, and may be an
 arbitrary real or complex number, although integer orders are the most
 common occurrence.
 
@@ -48,7 +48,7 @@
 

 Since this is a second order differential equation, there must be two linearly
- independent solutions, the first of these is denoted Jv
+ independent solutions, the first of these is denoted Jv 
and known as a Bessel
 function of the first kind:
 
@@ -59,7 +59,7 @@
 This function is implemented in this library as <a class="link" href="bessel.html" title="Bessel Functions of the First and Second Kinds">cyl_bessel_j</a>.
 

- The second solution is denoted either Yv or Nv
+ The second solution is denoted either Yv or Nv 
and is known as either a Bessel
 Function of the second kind, or as a Neumann function:
 
@@ -103,7 +103,7 @@
 <img src="../../../../equations/bessel10.png">
 
<a name="math_toolkit.special.bessel.bessel_over.modified_bessel_functions"></a><h5>
-<a name="id1194419"></a>
+<a name="id1252320"></a>
 <a class="link" href="bessel_over.html#math_toolkit.special.bessel.bessel_over.modified_bessel_functions">Modified
 Bessel Functions</a>
 </h5>
@@ -119,7 +119,7 @@

 The solutions are known as the modified Bessel functions of the first and
 second kind (or occasionally as the hyperbolic Bessel functions of the
- first and second kind). They are denoted Iv and Kv
+ first and second kind). They are denoted Iv and Kv 
respectively:
 

@@ -167,7 +167,7 @@
 <img src="../../../../equations/mbessel10.png">
 
<a name="math_toolkit.special.bessel.bessel_over.spherical_bessel_functions"></a><h5>
-<a name="id1194724"></a>
+<a name="id1252625"></a>
 <a class="link" href="bessel_over.html#math_toolkit.special.bessel.bessel_over.spherical_bessel_functions">Spherical
 Bessel Functions</a>
 </h5>
@@ -180,14 +180,14 @@
 

 The two linearly independent solutions to this equation are called the
- spherical Bessel functions jn and yn, and are related to the ordinary Bessel
- functions Jn and Yn by:
+ spherical Bessel functions jn and yn , and are related to the ordinary Bessel
+ functions Jn and Yn by:
 

 <img src="../../../../equations/sbessel2.png">
 

- The spherical Bessel function of the second kind yn
+ The spherical Bessel function of the second kind yn 
is also known as the
 spherical Neumann function nn.
 
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -28,7 +28,7 @@
 Functions of the First and Second Kinds</a>
</h4></div></div></div>
<a name="math_toolkit.special.bessel.mbessel.synopsis"></a><h5>
-<a name="id1196938"></a>
+<a name="id1256401"></a>
 <a class="link" href="mbessel.html#math_toolkit.special.bessel.mbessel.synopsis">Synopsis</a>
 </h5>
<pre class="programlisting">template <class T1, class T2>
@@ -44,7 +44,7 @@
<a class="link" href="../../main_overview/result_type.html" title="Calculation of the Type of the Result">calculated-result-type</a> cyl_bessel_k(T1 v, T2 x, const <a class="link" href="../../policy.html" title="Policies">Policy</a>&);
</pre>
<a name="math_toolkit.special.bessel.mbessel.description"></a><h5>
-<a name="id1197305"></a>
+<a name="id1256768"></a>
 <a class="link" href="mbessel.html#math_toolkit.special.bessel.mbessel.description">Description</a>
 </h5>

@@ -109,7 +109,7 @@
 <img src="../../../../graphs/cyl_bessel_k.png" align="middle">
 
<a name="math_toolkit.special.bessel.mbessel.testing"></a><h5>
-<a name="id1197578"></a>
+<a name="id1257040"></a>
 <a class="link" href="mbessel.html#math_toolkit.special.bessel.mbessel.testing">Testing</a>
 </h5>

@@ -118,7 +118,7 @@
 (with all the special case handling removed).
 
<a name="math_toolkit.special.bessel.mbessel.accuracy"></a><h5>
-<a name="id1197599"></a>
+<a name="id1257062"></a>
 <a class="link" href="mbessel.html#math_toolkit.special.bessel.mbessel.accuracy">Accuracy</a>
 </h5>

@@ -129,7 +129,7 @@
 zero error</a>. All values are relative errors in units of epsilon.
 
<div class="table">
-<a name="id1197623"></a>Table 38. Errors Rates in cyl_bessel_i
+<a name="math_toolkit.special.bessel.mbessel.errors_rates_in_cyl_bessel_i"></a>Table 38. Errors Rates in cyl_bessel_i
<div class="table-contents"><table class="table" summary="Errors Rates in cyl_bessel_i">
<colgroup>
<col>
@@ -226,7 +226,7 @@
</table></div>
</div>
 <div class="table">
-<a name="id1197928"></a>Table 39. Errors Rates in cyl_bessel_k
+<a name="math_toolkit.special.bessel.mbessel.errors_rates_in_cyl_bessel_k"></a>Table 39. Errors Rates in cyl_bessel_k
<div class="table-contents"><table class="table" summary="Errors Rates in cyl_bessel_k">
<colgroup>
<col>
@@ -326,19 +326,19 @@
</table></div>
</div>
 <a name="math_toolkit.special.bessel.mbessel.implementation"></a><h5>
-<a name="id1198090"></a>
+<a name="id1257405"></a>
 <a class="link" href="mbessel.html#math_toolkit.special.bessel.mbessel.implementation">Implementation</a>
 </h5>

 The following are handled as special cases first:
 

- When computing Iv for x < 0, then ν must be an integer
- or a domain error occurs. If ν is an integer, then the function is odd if
- ν is odd and even if ν is even, and we can reflect to x > 0.
+ When computing Iv for x < 0, then ν must be an integer
+ or a domain error occurs. If ν is an integer, then the function is odd if
+ ν is odd and even if ν is even, and we can reflect to x > 0.
 

- For Iv with v equal to 0, 1 or 0.5 are handled as special cases.
+ For Iv with v equal to 0, 1 or 0.5 are handled as special cases.
 

 The 0 and 1 cases use minimax rational approximations on finite and infinite
@@ -362,20 +362,20 @@
 I0.5(x) = sqrt(2 / πx) * sinh(x)
 

- For Kv with v an integer, the result is calculated
+ For Kv with v an integer, the result is calculated
 using the recurrence relation:
 

 <img src="../../../../equations/mbessel5.png">
 

- starting from K0 and K1 which are calculated using rational the approximations
+ starting from K0 and K1 which are calculated using rational the approximations
 above. These rational approximations are accurate to around 19 digits,
 and are therefore only used when T has no more than 64 binary digits of
 precision.
 

- In the general case, we first normalize ν to [<code class="literal">0, [inf</code>])
+ In the general case, we first normalize ν to [<code class="literal">0, [inf</code>])
 with the help of the reflection formulae:
 

@@ -385,7 +385,7 @@
 <img src="../../../../equations/mbessel10.png">
 

- Let μ = ν - floor(ν + 1/2), then μ is the fractional part of ν such that |μ| <=
+ Let μ = ν - floor(ν + 1/2), then μ is the fractional part of ν such that |μ| <=
 1/2 (we need this for convergence later). The idea is to calculate Kμ(x)
 and Kμ+1(x), and use them to obtain Iν(x) and Kν(x).
 
@@ -422,7 +422,7 @@

 When x is large (x > 2), both
 continued fractions converge (CF1 may be slow for really large x).
- Kμ and Kμ+1
+ Kμ and Kμ+1 
can be calculated by
 

@@ -455,7 +455,7 @@
 <img src="../../../../equations/mbessel16.png">
 

- fk and hk
+ fk and hk 
are also computed by recursions (involving gamma functions), but
 the formulas are a little complicated, readers are referred to N.M. Temme,
 On the numerical evaluation of the modified Bessel function of
@@ -469,9 +469,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -28,7 +28,7 @@
 Bessel Functions of the First and Second Kinds</a>
</h4></div></div></div>
<a name="math_toolkit.special.bessel.sph_bessel.synopsis"></a><h5>
-<a name="id1198610"></a>
+<a name="id1260672"></a>
 <a class="link" href="sph_bessel.html#math_toolkit.special.bessel.sph_bessel.synopsis">Synopsis</a>
 </h5>
<pre class="programlisting">template <class T1, class T2>
@@ -44,7 +44,7 @@
<a class="link" href="../../main_overview/result_type.html" title="Calculation of the Type of the Result">calculated-result-type</a> sph_neumann(unsigned v, T2 x, const <a class="link" href="../../policy.html" title="Policies">Policy</a>&);
</pre>
<a name="math_toolkit.special.bessel.sph_bessel.description"></a><h5>
-<a name="id1198978"></a>
+<a name="id1261039"></a>
 <a class="link" href="sph_bessel.html#math_toolkit.special.bessel.sph_bessel.description">Description</a>
 </h5>

@@ -84,20 +84,20 @@
 whenever the result is undefined or complex: this occurs when <code class="computeroutput">x < 0</code>.
 

- The jv function is cyclic like Jv but differs in its behaviour at the origin:
+ The jv function is cyclic like Jv but differs in its behaviour at the origin:
 

 <img src="../../../../graphs/sph_bessel.png" align="middle">
 

- Likewise yv is also cyclic for large x, but tends to -∞
+ Likewise yv is also cyclic for large x, but tends to -∞ 
for small x:
 

 <img src="../../../../graphs/sph_neumann.png" align="middle">
 
<a name="math_toolkit.special.bessel.sph_bessel.testing"></a><h5>
-<a name="id1199176"></a>
+<a name="id1261239"></a>
 <a class="link" href="sph_bessel.html#math_toolkit.special.bessel.sph_bessel.testing">Testing</a>
 </h5>

@@ -106,7 +106,7 @@
 implementation (with all the special case handling removed).
 
<a name="math_toolkit.special.bessel.sph_bessel.accuracy"></a><h5>
-<a name="id1199197"></a>
+<a name="id1261260"></a>
 <a class="link" href="sph_bessel.html#math_toolkit.special.bessel.sph_bessel.accuracy">Accuracy</a>
 </h5>

@@ -116,7 +116,7 @@
 refer to these functions for accuracy data.
 
<a name="math_toolkit.special.bessel.sph_bessel.implementation"></a><h5>
-<a name="id1199224"></a>
+<a name="id1261287"></a>
 <a class="link" href="sph_bessel.html#math_toolkit.special.bessel.sph_bessel.implementation">Implementation</a>
 </h5>

@@ -130,7 +130,7 @@
 The special cases occur for:
 

- j0= <a class="link" href="../sinc/sinc_pi.html" title="sinc_pi">sinc_pi</a>(x)
+ j0 = <a class="link" href="../sinc/sinc_pi.html" title="sinc_pi">sinc_pi</a>(x)
 = sin(x) / x
 

@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -28,7 +28,7 @@
 of the First Kind - Legendre Form</a>
</h4></div></div></div>
<a name="math_toolkit.special.ellint.ellint_1.synopsis"></a><h6>
-<a name="id1206921"></a>
+<a name="id1266675"></a>
 <a class="link" href="ellint_1.html#math_toolkit.special.ellint.ellint_1.synopsis">Synopsis</a>
 </h6>

@@ -55,7 +55,7 @@
}} // namespaces
</pre>
<a name="math_toolkit.special.ellint.ellint_1.description"></a><h6>
-<a name="id1207325"></a>
+<a name="id1267079"></a>
 <a class="link" href="ellint_1.html#math_toolkit.special.ellint.ellint_1.description">Description</a>
 </h6>

@@ -123,7 +123,7 @@

 
<a name="math_toolkit.special.ellint.ellint_1.accuracy"></a><h6>
-<a name="id1207790"></a>
+<a name="id1267544"></a>
 <a class="link" href="ellint_1.html#math_toolkit.special.ellint.ellint_1.accuracy">Accuracy</a>
 </h6>

@@ -134,7 +134,7 @@
 All values are relative errors in units of epsilon.
 
<div class="table">
-<a name="id1207808"></a>Table 41. Errors Rates in the Elliptic Integrals of the First Kind
+<a name="math_toolkit.special.ellint.ellint_1.errors_rates_in_the_elliptic_integrals_of_the_first_kind"></a>Table 41. Errors Rates in the Elliptic Integrals of the First Kind
<div class="table-contents"><table class="table" summary="Errors Rates in the Elliptic Integrals of the First Kind">
<colgroup>
<col>
@@ -235,7 +235,7 @@
</table></div>
</div>
 <a name="math_toolkit.special.ellint.ellint_1.testing"></a><h6>
-<a name="id1209750"></a>
+<a name="id1267730"></a>
 <a class="link" href="ellint_1.html#math_toolkit.special.ellint.ellint_1.testing">Testing</a>
 </h6>

@@ -245,7 +245,7 @@
 this implementation.
 
<a name="math_toolkit.special.ellint.ellint_1.implementation"></a><h6>
-<a name="id1209772"></a>
+<a name="id1267751"></a>
 <a class="link" href="ellint_1.html#math_toolkit.special.ellint.ellint_1.implementation">Implementation</a>
 </h6>

@@ -264,9 +264,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -28,7 +28,7 @@
 of the Second Kind - Legendre Form</a>
</h4></div></div></div>
<a name="math_toolkit.special.ellint.ellint_2.synopsis"></a><h6>
-<a name="id1209852"></a>
+<a name="id1267832"></a>
 <a class="link" href="ellint_2.html#math_toolkit.special.ellint.ellint_2.synopsis">Synopsis</a>
 </h6>

@@ -55,7 +55,7 @@
}} // namespaces
</pre>
<a name="math_toolkit.special.ellint.ellint_2.description"></a><h6>
-<a name="id1210256"></a>
+<a name="id1268236"></a>
 <a class="link" href="ellint_2.html#math_toolkit.special.ellint.ellint_2.description">Description</a>
 </h6>

@@ -123,7 +123,7 @@

 
<a name="math_toolkit.special.ellint.ellint_2.accuracy"></a><h6>
-<a name="id1210721"></a>
+<a name="id1269793"></a>
 <a class="link" href="ellint_2.html#math_toolkit.special.ellint.ellint_2.accuracy">Accuracy</a>
 </h6>

@@ -134,7 +134,7 @@
 All values are relative errors in units of epsilon.
 
<div class="table">
-<a name="id1210739"></a>Table 42. Errors Rates in the Elliptic Integrals of the Second Kind
+<a name="math_toolkit.special.ellint.ellint_2.errors_rates_in_the_elliptic_integrals_of_the_second_kind"></a>Table 42. Errors Rates in the Elliptic Integrals of the Second Kind
<div class="table-contents"><table class="table" summary="Errors Rates in the Elliptic Integrals of the Second Kind">
<colgroup>
<col>
@@ -235,7 +235,7 @@
</table></div>
</div>
 <a name="math_toolkit.special.ellint.ellint_2.testing"></a><h6>
-<a name="id1210907"></a>
+<a name="id1269980"></a>
 <a class="link" href="ellint_2.html#math_toolkit.special.ellint.ellint_2.testing">Testing</a>
 </h6>

@@ -245,7 +245,7 @@
 this implementation.
 
<a name="math_toolkit.special.ellint.ellint_2.implementation"></a><h6>
-<a name="id1210928"></a>
+<a name="id1270002"></a>
 <a class="link" href="ellint_2.html#math_toolkit.special.ellint.ellint_2.implementation">Implementation</a>
 </h6>

@@ -264,9 +264,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -28,7 +28,7 @@
 of the Third Kind - Legendre Form</a>
</h4></div></div></div>
<a name="math_toolkit.special.ellint.ellint_3.synopsis"></a><h6>
-<a name="id1211009"></a>
+<a name="id1270082"></a>
 <a class="link" href="ellint_3.html#math_toolkit.special.ellint.ellint_3.synopsis">Synopsis</a>
 </h6>

@@ -55,7 +55,7 @@
}} // namespaces
</pre>
<a name="math_toolkit.special.ellint.ellint_3.description"></a><h6>
-<a name="id1211519"></a>
+<a name="id1270592"></a>
 <a class="link" href="ellint_3.html#math_toolkit.special.ellint.ellint_3.description">Description</a>
 </h6>

@@ -129,7 +129,7 @@

 
<a name="math_toolkit.special.ellint.ellint_3.accuracy"></a><h6>
-<a name="id1212120"></a>
+<a name="id1271194"></a>
 <a class="link" href="ellint_3.html#math_toolkit.special.ellint.ellint_3.accuracy">Accuracy</a>
 </h6>

@@ -140,7 +140,7 @@
 All values are relative errors in units of epsilon.
 
<div class="table">
-<a name="id1212138"></a>Table 43. Errors Rates in the Elliptic Integrals of the Third Kind
+<a name="math_toolkit.special.ellint.ellint_3.errors_rates_in_the_elliptic_integrals_of_the_third_kind"></a>Table 43. Errors Rates in the Elliptic Integrals of the Third Kind
<div class="table-contents"><table class="table" summary="Errors Rates in the Elliptic Integrals of the Third Kind">
<colgroup>
<col>
@@ -241,7 +241,7 @@
</table></div>
</div>
 <a name="math_toolkit.special.ellint.ellint_3.testing"></a><h6>
-<a name="id1212305"></a>
+<a name="id1271380"></a>
 <a class="link" href="ellint_3.html#math_toolkit.special.ellint.ellint_3.testing">Testing</a>
 </h6>

@@ -251,7 +251,7 @@
 this implementation.
 
<a name="math_toolkit.special.ellint.ellint_3.implementation"></a><h6>
-<a name="id1212327"></a>
+<a name="id1271401"></a>
 <a class="link" href="ellint_3.html#math_toolkit.special.ellint.ellint_3.implementation">Implementation</a>
 </h6>

@@ -288,10 +288,10 @@
 Π(n, φ+mπ, k) = Π(n, φ, k) + 2mΠ(n, k) ; n <= 1
 

- Π(n, φ+mπ, k) = Π(n, φ, k) ; n > 1 [<a name="id1212441" href="#ftn.id1212441" class="footnote">1</a>]
+ Π(n, φ+mπ, k) = Π(n, φ, k) ; n > 1 [<a name="id1271515" href="#ftn.id1271515" class="footnote">1</a>]
 

- are used to move φ to the range [0, π/2].
+ are used to move φ to the range [0, π/2].
 

 The functions are then implemented in terms of Carlson's integrals using
@@ -308,7 +308,7 @@
 
<div class="footnotes">
 <hr width="100" align="left">
-<div class="footnote">[<a name="ftn.id1212441" href="#id1212441" class="para">1</a>] 
+<div class="footnote">[<a name="ftn.id1271515" href="#id1271515" class="para">1</a>] 
 I haven't been able to find a literature reference for this relation,
 but it appears to be the convention used by Mathematica. Intuitively
 the first 2 * m * Π(n, k) terms cancel out as the
@@ -318,9 +318,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -28,7 +28,7 @@
 Integrals - Carlson Form</a>
</h4></div></div></div>
<a name="math_toolkit.special.ellint.ellint_carlson.synopsis"></a><h6>
-<a name="id1202199"></a>
+<a name="id1262481"></a>
 <a class="link" href="ellint_carlson.html#math_toolkit.special.ellint.ellint_carlson.synopsis">Synopsis</a>
 </h6>

@@ -100,7 +100,7 @@
}} // namespaces
</pre>
<a name="math_toolkit.special.ellint.ellint_carlson.description"></a><h6>
-<a name="id1203499"></a>
+<a name="id1264896"></a>
 <a class="link" href="ellint_carlson.html#math_toolkit.special.ellint.ellint_carlson.description">Description</a>
 </h6>

@@ -236,7 +236,7 @@
 <img src="../../../../equations/ellint18.png">
 
<a name="math_toolkit.special.ellint.ellint_carlson.testing"></a><h6>
-<a name="id1206431"></a>
+<a name="id1266184"></a>
 <a class="link" href="ellint_carlson.html#math_toolkit.special.ellint.ellint_carlson.testing">Testing</a>
 </h6>

@@ -259,7 +259,7 @@
 to verify their correctness: see the above Carlson paper for details.
 
<a name="math_toolkit.special.ellint.ellint_carlson.accuracy"></a><h6>
-<a name="id1206472"></a>
+<a name="id1266225"></a>
 <a class="link" href="ellint_carlson.html#math_toolkit.special.ellint.ellint_carlson.accuracy">Accuracy</a>
 </h6>

@@ -270,7 +270,7 @@
 All values are relative errors in units of epsilon.
 
<div class="table">
-<a name="id1206490"></a>Table 40. Errors Rates in the Carlson Elliptic Integrals
+<a name="math_toolkit.special.ellint.ellint_carlson.errors_rates_in_the_carlson_elliptic_integrals"></a>Table 40. Errors Rates in the Carlson Elliptic Integrals
<div class="table-contents"><table class="table" summary="Errors Rates in the Carlson Elliptic Integrals">
<colgroup>
<col>
@@ -413,7 +413,7 @@
</table></div>
</div>
 <a name="math_toolkit.special.ellint.ellint_carlson.implementation"></a><h6>
-<a name="id1206737"></a>
+<a name="id1266491"></a>
 <a class="link" href="ellint_carlson.html#math_toolkit.special.ellint.ellint_carlson.implementation">Implementation</a>
 </h6>

@@ -451,9 +451,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -49,14 +49,14 @@
 Elliptic integral</a>.
 
<a name="math_toolkit.special.ellint.ellint_intro.notation"></a><h5>
-<a name="id1199371"></a>
+<a name="id1261434"></a>
 <a class="link" href="ellint_intro.html#math_toolkit.special.ellint.ellint_intro.notation">Notation</a>
 </h5>

 All variables are real numbers unless otherwise noted.
 
<a name="ellint_def"></a><a name="math_toolkit.special.ellint.ellint_intro.definition"></a><h5>
-<a name="id1199392"></a>
+<a name="id1261455"></a>
 <a class="link" href="ellint_intro.html#math_toolkit.special.ellint.ellint_intro.definition">Definition</a>
 </h5>

@@ -245,7 +245,7 @@
</td></tr>
</table></div>
<a name="ellint_theorem"></a><a name="math_toolkit.special.ellint.ellint_intro.duplication_theorem"></a><h5>
-<a name="id1199992"></a>
+<a name="id1262055"></a>
 <a class="link" href="ellint_intro.html#math_toolkit.special.ellint.ellint_intro.duplication_theorem">Duplication
 Theorem</a>
 </h5>
@@ -257,7 +257,7 @@
 <img src="../../../../equations/ellint13.png">
 
<a name="ellint_formula"></a><a name="math_toolkit.special.ellint.ellint_intro.carlson_s_formulas"></a><h5>
-<a name="id1200046"></a>
+<a name="id1262109"></a>
 <a class="link" href="ellint_intro.html#math_toolkit.special.ellint.ellint_intro.carlson_s_formulas">Carlson's
 Formulas</a>
 </h5>
@@ -275,7 +275,7 @@
 <img src="../../../../equations/ellint15.png">
 
<a name="math_toolkit.special.ellint.ellint_intro.numerical_algorithms"></a><h5>
-<a name="id1201900"></a>
+<a name="id1262182"></a>
 <a class="link" href="ellint_intro.html#math_toolkit.special.ellint.ellint_intro.numerical_algorithms">Numerical
 Algorithms</a>
 </h5>
@@ -289,7 +289,7 @@
 integrals with satisfactory precisions.
 
<a name="ellint_refs"></a><a name="math_toolkit.special.ellint.ellint_intro.references"></a><h5>
-<a name="id1201933"></a>
+<a name="id1262214"></a>
 <a class="link" href="ellint_intro.html#math_toolkit.special.ellint.ellint_intro.references">References</a>
 </h5>

@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -28,7 +28,7 @@
 Integral Ei</a>
</h4></div></div></div>
<a name="math_toolkit.special.expint.expint_i.synopsis"></a><h5>
-<a name="id1215772"></a>
+<a name="id1273582"></a>
 <a class="link" href="expint_i.html#math_toolkit.special.expint.expint_i.synopsis">Synopsis</a>
 </h5>

@@ -63,7 +63,7 @@

 
<a name="math_toolkit.special.expint.expint_i.description"></a><h5>
-<a name="id1216032"></a>
+<a name="id1274412"></a>
 <a class="link" href="expint_i.html#math_toolkit.special.expint.expint_i.description">Description</a>
 </h5>
<pre class="programlisting">template <class T>
@@ -83,7 +83,7 @@
 <img src="../../../../graphs/expint_i.png" align="middle">
 
<a name="math_toolkit.special.expint.expint_i.accuracy"></a><h5>
-<a name="id1216230"></a>
+<a name="id1274610"></a>
 <a class="link" href="expint_i.html#math_toolkit.special.expint.expint_i.accuracy">Accuracy</a>
 </h5>

@@ -95,7 +95,7 @@
 error</a>.
 
<div class="table">
-<a name="id1216253"></a>Table 46. Errors In the Function expint(z)
+<a name="math_toolkit.special.expint.expint_i.errors_in_the_function_expint_z_"></a>Table 46. Errors In the Function expint(z)
<div class="table-contents"><table class="table" summary="Errors In the Function expint(z)">
<colgroup>
<col>
@@ -207,7 +207,7 @@
 slightly over the range [4,6].
 
<a name="math_toolkit.special.expint.expint_i.testing"></a><h5>
-<a name="id1216428"></a>
+<a name="id1274810"></a>
 <a class="link" href="expint_i.html#math_toolkit.special.expint.expint_i.testing">Testing</a>
 </h5>

@@ -222,7 +222,7 @@
 check.
 
<a name="math_toolkit.special.expint.expint_i.implementation"></a><h5>
-<a name="id1216455"></a>
+<a name="id1274836"></a>
 <a class="link" href="expint_i.html#math_toolkit.special.expint.expint_i.implementation">Implementation</a>
 </h5>

@@ -252,7 +252,7 @@
 a minimax rational approximation rescaled so that it is evaluated over
 [-1,1]. Note that while the rational approximation over [0,6] converges
 rapidly to the minimax solution it is rather ill-conditioned in practice.
- Cody and Thacher [<a name="id1216542" href="#ftn.id1216542" class="footnote">2</a>] experienced the same issue and converted the polynomials into
+ Cody and Thacher [<a name="id1274924" href="#ftn.id1274924" class="footnote">2</a>] experienced the same issue and converted the polynomials into
 Chebeshev form to ensure stable computation. By experiment we found that
 the polynomials are just as stable in polynomial as Chebyshev form, provided
 they are computed over the interval [-1,1].
@@ -282,7 +282,7 @@
 
<div class="footnotes">
 <hr width="100" align="left">
-<div class="footnote">[<a name="ftn.id1216542" href="#id1216542" class="para">2</a>] 
+<div class="footnote">[<a name="ftn.id1274924" href="#id1274924" class="para">2</a>] 
 W. J. Cody and H. C. Thacher, Jr., Rational Chebyshev approximations
 for the exponential integral E1(x), Math. Comp. 22 (1968), 641-649, and
 W. J. Cody and H. C. Thacher, Jr., Chebyshev approximations for the exponential
@@ -292,9 +292,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -28,7 +28,7 @@
 Integral En</a>
</h4></div></div></div>
<a name="math_toolkit.special.expint.expint_n.synopsis"></a><h5>
-<a name="id1213511"></a>
+<a name="id1272590"></a>
 <a class="link" href="expint_n.html#math_toolkit.special.expint.expint_n.synopsis">Synopsis</a>
 </h5>

@@ -63,7 +63,7 @@

 
<a name="math_toolkit.special.expint.expint_n.description"></a><h5>
-<a name="id1213798"></a>
+<a name="id1272877"></a>
 <a class="link" href="expint_n.html#math_toolkit.special.expint.expint_n.description">Description</a>
 </h5>
<pre class="programlisting">template <class T>
@@ -83,7 +83,7 @@
 <img src="../../../../graphs/expint2.png" align="middle">
 
<a name="math_toolkit.special.expint.expint_n.accuracy"></a><h5>
-<a name="id1215292"></a>
+<a name="id1273101"></a>
 <a class="link" href="expint_n.html#math_toolkit.special.expint.expint_n.accuracy">Accuracy</a>
 </h5>

@@ -94,7 +94,7 @@
 the one shown will have <a class="link" href="../../backgrounders/relative_error.html#zero_error">effectively zero error</a>.
 
<div class="table">
-<a name="id1215315"></a>Table 45. Errors In the Function expint(n, z)
+<a name="math_toolkit.special.expint.expint_n.errors_in_the_function_expint_n__z_"></a>Table 45. Errors In the Function expint(n, z)
<div class="table-contents"><table class="table" summary="Errors In the Function expint(n, z)">
<colgroup>
<col>
@@ -225,7 +225,7 @@
</table></div>
</div>
 <a name="math_toolkit.special.expint.expint_n.testing"></a><h5>
-<a name="id1215534"></a>
+<a name="id1273345"></a>
 <a class="link" href="expint_n.html#math_toolkit.special.expint.expint_n.testing">Testing</a>
 </h5>

@@ -240,7 +240,7 @@
 check.
 
<a name="math_toolkit.special.expint.expint_n.implementation"></a><h5>
-<a name="id1215561"></a>
+<a name="id1273371"></a>
 <a class="link" href="expint_n.html#math_toolkit.special.expint.expint_n.implementation">Implementation</a>
 </h5>

@@ -287,9 +287,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -65,7 +65,7 @@
 if the result is too large to represent in type T.
 
<a name="math_toolkit.special.factorials.sf_binomial.accuracy"></a><h5>
-<a name="id1157967"></a>
+<a name="id1221676"></a>
 <a class="link" href="sf_binomial.html#math_toolkit.special.factorials.sf_binomial.accuracy">Accuracy</a>
 </h5>

@@ -74,14 +74,14 @@
 function for larger arguments.
 
<a name="math_toolkit.special.factorials.sf_binomial.testing"></a><h5>
-<a name="id1157988"></a>
+<a name="id1221698"></a>
 <a class="link" href="sf_binomial.html#math_toolkit.special.factorials.sf_binomial.testing">Testing</a>
 </h5>

 The spot tests for the binomial coefficients use data generated by functions.wolfram.com.
 
<a name="math_toolkit.special.factorials.sf_binomial.implementation"></a><h5>
-<a name="id1158008"></a>
+<a name="id1221717"></a>
 <a class="link" href="sf_binomial.html#math_toolkit.special.factorials.sf_binomial.implementation">Implementation</a>
 </h5>

@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -64,7 +64,7 @@
 of i! is possible.
 
<a name="math_toolkit.special.factorials.sf_double_factorial.accuracy"></a><h5>
-<a name="id1156804"></a>
+<a name="id1215139"></a>
 <a class="link" href="sf_double_factorial.html#math_toolkit.special.factorials.sf_double_factorial.accuracy">Accuracy</a>
 </h5>

@@ -72,14 +72,14 @@
 so error rates should be no more than a couple of epsilon higher.
 
<a name="math_toolkit.special.factorials.sf_double_factorial.testing"></a><h5>
-<a name="id1156826"></a>
+<a name="id1215161"></a>
 <a class="link" href="sf_double_factorial.html#math_toolkit.special.factorials.sf_double_factorial.testing">Testing</a>
 </h5>

 The spot tests for the double factorial use data generated by functions.wolfram.com.
 
<a name="math_toolkit.special.factorials.sf_double_factorial.implementation"></a><h5>
-<a name="id1156845"></a>
+<a name="id1215180"></a>
 <a class="link" href="sf_double_factorial.html#math_toolkit.special.factorials.sf_double_factorial.implementation">Implementation</a>
 </h5>

@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -27,7 +27,7 @@
<a name="math_toolkit.special.factorials.sf_factorial"></a><a class="link" href="sf_factorial.html" title="Factorial"> Factorial</a>
</h4></div></div></div>
<a name="math_toolkit.special.factorials.sf_factorial.synopsis"></a><h5>
-<a name="id1153595"></a>
+<a name="id1214116"></a>
 <a class="link" href="sf_factorial.html#math_toolkit.special.factorials.sf_factorial.synopsis">Synopsis</a>
 </h5>

@@ -54,7 +54,7 @@
}} // namespaces
</pre>
<a name="math_toolkit.special.factorials.sf_factorial.description"></a><h5>
-<a name="id1153904"></a>
+<a name="id1214424"></a>
 <a class="link" href="sf_factorial.html#math_toolkit.special.factorials.sf_factorial.description">Description</a>
 </h5>
<pre class="programlisting">template <class T>
@@ -112,7 +112,7 @@
 the size of further tables that depend on the factorials.
 
<a name="math_toolkit.special.factorials.sf_factorial.accuracy"></a><h5>
-<a name="id1154264"></a>
+<a name="id1214784"></a>
 <a class="link" href="sf_factorial.html#math_toolkit.special.factorials.sf_factorial.accuracy">Accuracy</a>
 </h5>

@@ -121,7 +121,7 @@
 will be the same as for <a class="link" href="../sf_gamma/tgamma.html" title="Gamma">tgamma</a>.
 
<a name="math_toolkit.special.factorials.sf_factorial.testing"></a><h5>
-<a name="id1154307"></a>
+<a name="id1214827"></a>
 <a class="link" href="sf_factorial.html#math_toolkit.special.factorials.sf_factorial.testing">Testing</a>
 </h5>

@@ -130,7 +130,7 @@
 function handle those cases already.
 
<a name="math_toolkit.special.factorials.sf_factorial.implementation"></a><h5>
-<a name="id1154332"></a>
+<a name="id1214852"></a>
 <a class="link" href="sf_factorial.html#math_toolkit.special.factorials.sf_factorial.implementation">Implementation</a>
 </h5>

@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -76,7 +76,7 @@
 the type of the result is T.
 
<a name="math_toolkit.special.factorials.sf_falling_factorial.accuracy"></a><h5>
-<a name="id1157612"></a>
+<a name="id1221321"></a>
 <a class="link" href="sf_falling_factorial.html#math_toolkit.special.factorials.sf_falling_factorial.accuracy">Accuracy</a>
 </h5>

@@ -84,14 +84,14 @@
 function.
 
<a name="math_toolkit.special.factorials.sf_falling_factorial.testing"></a><h5>
-<a name="id1157638"></a>
+<a name="id1221348"></a>
 <a class="link" href="sf_falling_factorial.html#math_toolkit.special.factorials.sf_falling_factorial.testing">Testing</a>
 </h5>

 The spot tests for the falling factorials use data generated by functions.wolfram.com.
 
<a name="math_toolkit.special.factorials.sf_falling_factorial.implementation"></a><h5>
-<a name="id1157657"></a>
+<a name="id1221367"></a>
 <a class="link" href="sf_falling_factorial.html#math_toolkit.special.factorials.sf_falling_factorial.implementation">Implementation</a>
 </h5>

@@ -103,9 +103,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -80,7 +80,7 @@
 the type of the result is T.
 
<a name="math_toolkit.special.factorials.sf_rising_factorial.accuracy"></a><h5>
-<a name="id1157216"></a>
+<a name="id1215551"></a>
 <a class="link" href="sf_rising_factorial.html#math_toolkit.special.factorials.sf_rising_factorial.accuracy">Accuracy</a>
 </h5>

@@ -88,14 +88,14 @@
 function.
 
<a name="math_toolkit.special.factorials.sf_rising_factorial.testing"></a><h5>
-<a name="id1157242"></a>
+<a name="id1215577"></a>
 <a class="link" href="sf_rising_factorial.html#math_toolkit.special.factorials.sf_rising_factorial.testing">Testing</a>
 </h5>

 The spot tests for the rising factorials use data generated by functions.wolfram.com.
 
<a name="math_toolkit.special.factorials.sf_rising_factorial.implementation"></a><h5>
-<a name="id1157261"></a>
+<a name="id1215596"></a>
 <a class="link" href="sf_rising_factorial.html#math_toolkit.special.factorials.sf_rising_factorial.implementation">Implementation</a>
 </h5>

@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -67,14 +67,14 @@
 <img src="../../../../graphs/acosh.png" align="middle">
 
<a name="math_toolkit.special.inv_hyper.acosh.accuracy"></a><h5>
-<a name="id1224653"></a>
+<a name="id1284803"></a>
 <a class="link" href="acosh.html#math_toolkit.special.inv_hyper.acosh.accuracy">Accuracy</a>
 </h5>

 Generally accuracy is to within 1 or 2 epsilon across all supported platforms.
 
<a name="math_toolkit.special.inv_hyper.acosh.testing"></a><h5>
-<a name="id1224670"></a>
+<a name="id1284820"></a>
 <a class="link" href="acosh.html#math_toolkit.special.inv_hyper.acosh.testing">Testing</a>
 </h5>

@@ -90,7 +90,7 @@
 to at least 50 decimal digits.
 
<a name="math_toolkit.special.inv_hyper.acosh.implementation"></a><h5>
-<a name="id1224714"></a>
+<a name="id1284864"></a>
 <a class="link" href="acosh.html#math_toolkit.special.inv_hyper.acosh.implementation">Implementation</a>
 </h5>

@@ -122,9 +122,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -62,14 +62,14 @@

 
<a name="math_toolkit.special.inv_hyper.asinh.accuracy"></a><h5>
-<a name="id1225121"></a>
+<a name="id1285271"></a>
 <a class="link" href="asinh.html#math_toolkit.special.inv_hyper.asinh.accuracy">Accuracy</a>
 </h5>

 Generally accuracy is to within 1 or 2 epsilon across all supported platforms.
 
<a name="math_toolkit.special.inv_hyper.asinh.testing"></a><h5>
-<a name="id1225138"></a>
+<a name="id1285288"></a>
 <a class="link" href="asinh.html#math_toolkit.special.inv_hyper.asinh.testing">Testing</a>
 </h5>

@@ -85,7 +85,7 @@
 to at least 50 decimal digits.
 
<a name="math_toolkit.special.inv_hyper.asinh.implementation"></a><h5>
-<a name="id1225182"></a>
+<a name="id1285332"></a>
 <a class="link" href="asinh.html#math_toolkit.special.inv_hyper.asinh.implementation">Implementation</a>
 </h5>

@@ -117,9 +117,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -58,12 +58,12 @@
 then returns the result of <a class="link" href="../../main_overview/error_handling.html#domain_error">domain_error</a>.
 

- If x is in the range <code class="literal">[-1;-1+ε[</code>, then the result of -<a class="link" href="../../main_overview/error_handling.html#overflow_error">overflow_error</a> is returned, with ε
+ If x is in the range <code class="literal">[-1;-1+ε[</code>, then the result of -<a class="link" href="../../main_overview/error_handling.html#overflow_error">overflow_error</a> is returned, with ε 
denoting
 numeric_limits<T>::epsilon().
 

- If x is in the range <code class="literal">]+1-ε;+1]</code>, then the result of <a class="link" href="../../main_overview/error_handling.html#overflow_error">overflow_error</a> is returned, with ε
+ If x is in the range <code class="literal">]+1-ε;+1]</code>, then the result of <a class="link" href="../../main_overview/error_handling.html#overflow_error">overflow_error</a> is returned, with ε 
denoting
 numeric_limits<T>::epsilon().
 
@@ -76,14 +76,14 @@
 <img src="../../../../graphs/atanh.png" align="middle">
 
<a name="math_toolkit.special.inv_hyper.atanh.accuracy"></a><h5>
-<a name="id1225632"></a>
+<a name="id1285782"></a>
 <a class="link" href="atanh.html#math_toolkit.special.inv_hyper.atanh.accuracy">Accuracy</a>
 </h5>

 Generally accuracy is to within 1 or 2 epsilon across all supported platforms.
 
<a name="math_toolkit.special.inv_hyper.atanh.testing"></a><h5>
-<a name="id1225649"></a>
+<a name="id1285799"></a>
 <a class="link" href="atanh.html#math_toolkit.special.inv_hyper.atanh.testing">Testing</a>
 </h5>

@@ -99,7 +99,7 @@
 to at least 50 decimal digits.
 
<a name="math_toolkit.special.inv_hyper.atanh.implementation"></a><h5>
-<a name="id1225693"></a>
+<a name="id1285844"></a>
 <a class="link" href="atanh.html#math_toolkit.special.inv_hyper.atanh.implementation">Implementation</a>
 </h5>

@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -40,9 +40,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -71,7 +71,7 @@
 <img src="../../../../graphs/cbrt.png" align="middle">
 
<a name="math_toolkit.special.powers.cbrt.accuracy"></a><h5>
-<a name="id1218106"></a>
+<a name="id1276467"></a>
 <a class="link" href="cbrt.html#math_toolkit.special.powers.cbrt.accuracy">Accuracy</a>
 </h5>

@@ -79,7 +79,7 @@
 should have approximately 2 epsilon accuracy.
 
<a name="math_toolkit.special.powers.cbrt.testing"></a><h5>
-<a name="id1218130"></a>
+<a name="id1276491"></a>
 <a class="link" href="cbrt.html#math_toolkit.special.powers.cbrt.testing">Testing</a>
 </h5>

@@ -89,9 +89,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -32,7 +32,7 @@
 computes the compile-time integral power of a run-time base.
 
<a name="math_toolkit.special.powers.ct_pow.synopsis"></a><h5>
-<a name="id1219282"></a>
+<a name="id1278756"></a>
 <a class="link" href="ct_pow.html#math_toolkit.special.powers.ct_pow.synopsis">Synopsis</a>
 </h5>

@@ -49,7 +49,7 @@
}}
</pre>
<a name="math_toolkit.special.powers.ct_pow.rationale_and_usage"></a><h5>
-<a name="id1219543"></a>
+<a name="id1279017"></a>
 <a class="link" href="ct_pow.html#math_toolkit.special.powers.ct_pow.rationale_and_usage">Rationale
 and Usage</a>
 </h5>
@@ -91,7 +91,7 @@
 Only 3 different products were actually computed.
 
<a name="math_toolkit.special.powers.ct_pow.return_type"></a><h5>
-<a name="id1221051"></a>
+<a name="id1279290"></a>
 <a class="link" href="ct_pow.html#math_toolkit.special.powers.ct_pow.return_type">Return Type</a>
 </h5>

@@ -112,7 +112,7 @@
 </li>
</ul></div>
<a name="math_toolkit.special.powers.ct_pow.policies"></a><h5>
-<a name="id1221145"></a>
+<a name="id1279383"></a>
 <a class="link" href="ct_pow.html#math_toolkit.special.powers.ct_pow.policies">Policies</a>
 </h5>

@@ -126,7 +126,7 @@

 
<a name="math_toolkit.special.powers.ct_pow.error_handling"></a><h5>
-<a name="id1221175"></a>
+<a name="id1279413"></a>
 <a class="link" href="ct_pow.html#math_toolkit.special.powers.ct_pow.error_handling">Error
 Handling</a>
 </h5>
@@ -232,7 +232,7 @@
double result = pow<-5>(base);
</pre>
<a name="math_toolkit.special.powers.ct_pow.acknowledgements"></a><h5>
-<a name="id1222015"></a>
+<a name="id1281619"></a>
 <a class="link" href="ct_pow.html#math_toolkit.special.powers.ct_pow.acknowledgements">Acknowledgements</a>
 </h5>

@@ -243,7 +243,7 @@
improving the implementation.
 
<a name="math_toolkit.special.powers.ct_pow.references"></a><h5>
-<a name="id1222035"></a>
+<a name="id1281639"></a>
 <a class="link" href="ct_pow.html#math_toolkit.special.powers.ct_pow.references">References</a>
 </h5>

@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -80,7 +80,7 @@
 <img src="../../../../graphs/expm1.png" align="middle">
 
<a name="math_toolkit.special.powers.expm1.accuracy"></a><h5>
-<a name="id1217763"></a>
+<a name="id1276124"></a>
 <a class="link" href="expm1.html#math_toolkit.special.powers.expm1.accuracy">Accuracy</a>
 </h5>

@@ -88,7 +88,7 @@
 should have approximately 1 epsilon accuracy.
 
<a name="math_toolkit.special.powers.expm1.testing"></a><h5>
-<a name="id1217787"></a>
+<a name="id1276148"></a>
 <a class="link" href="expm1.html#math_toolkit.special.powers.expm1.testing">Testing</a>
 </h5>

@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -58,7 +58,7 @@
 representable.
 
<a name="math_toolkit.special.powers.hypot.implementation"></a><h5>
-<a name="id1219198"></a>
+<a name="id1278672"></a>
 <a class="link" href="hypot.html#math_toolkit.special.powers.hypot.implementation">Implementation</a>
 </h5>

@@ -67,7 +67,7 @@
 arguments if this is not the case).
 

- Then if x * ε >= y we can simply return x.
+ Then if x * ε >= y we can simply return x.
 

 Otherwise the result is given by:
@@ -78,9 +78,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -93,7 +93,7 @@
 <img src="../../../../graphs/log1p.png" align="middle">
 
<a name="math_toolkit.special.powers.log1p.accuracy"></a><h5>
-<a name="id1217337"></a>
+<a name="id1275718"></a>
 <a class="link" href="log1p.html#math_toolkit.special.powers.log1p.accuracy">Accuracy</a>
 </h5>

@@ -101,7 +101,7 @@
 should have approximately 1 epsilon accuracy.
 
<a name="math_toolkit.special.powers.log1p.testing"></a><h5>
-<a name="id1217361"></a>
+<a name="id1275742"></a>
 <a class="link" href="log1p.html#math_toolkit.special.powers.log1p.testing">Testing</a>
 </h5>

@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -74,14 +74,14 @@
 <img src="../../../../graphs/powm1.png" align="middle">
 
<a name="math_toolkit.special.powers.powm1.accuracy"></a><h5>
-<a name="id1218894"></a>
+<a name="id1278368"></a>
 <a class="link" href="powm1.html#math_toolkit.special.powers.powm1.accuracy">Accuracy</a>
 </h5>

 Should have approximately 2-3 epsilon accuracy.
 
<a name="math_toolkit.special.powers.powm1.testing"></a><h5>
-<a name="id1218911"></a>
+<a name="id1278385"></a>
 <a class="link" href="powm1.html#math_toolkit.special.powers.powm1.testing">Testing</a>
 </h5>

@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -76,7 +76,7 @@
 <img src="../../../../graphs/sqrt1pm1.png" align="middle">
 
<a name="math_toolkit.special.powers.sqrt1pm1.accuracy"></a><h5>
-<a name="id1218498"></a>
+<a name="id1277972"></a>
 <a class="link" href="sqrt1pm1.html#math_toolkit.special.powers.sqrt1pm1.accuracy">Accuracy</a>
 </h5>

@@ -84,7 +84,7 @@
 should have approximately 3 epsilon accuracy.
 
<a name="math_toolkit.special.powers.sqrt1pm1.testing"></a><h5>
-<a name="id1218522"></a>
+<a name="id1277996"></a>
 <a class="link" href="sqrt1pm1.html#math_toolkit.special.powers.sqrt1pm1.testing">Testing</a>
 </h5>

@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -28,7 +28,7 @@
 of the Incomplete Beta Function</a>
</h4></div></div></div>
<a name="math_toolkit.special.sf_beta.beta_derivative.synopsis"></a><h5>
-<a name="id1171194"></a>
+<a name="id1234369"></a>
 <a class="link" href="beta_derivative.html#math_toolkit.special.sf_beta.beta_derivative.synopsis">Synopsis</a>
 </h5>

@@ -49,7 +49,7 @@
}} // namespaces
</pre>
<a name="math_toolkit.special.sf_beta.beta_derivative.description"></a><h5>
-<a name="id1171529"></a>
+<a name="id1235180"></a>
 <a class="link" href="beta_derivative.html#math_toolkit.special.sf_beta.beta_derivative.description">Description</a>
 </h5>

@@ -76,14 +76,14 @@

 
<a name="math_toolkit.special.sf_beta.beta_derivative.accuracy"></a><h5>
-<a name="id1171608"></a>
+<a name="id1235260"></a>
 <a class="link" href="beta_derivative.html#math_toolkit.special.sf_beta.beta_derivative.accuracy">Accuracy</a>
 </h5>

 Almost identical to the incomplete beta function <a class="link" href="ibeta_function.html" title="Incomplete Beta Functions">ibeta</a>.
 
<a name="math_toolkit.special.sf_beta.beta_derivative.implementation"></a><h5>
-<a name="id1171634"></a>
+<a name="id1235285"></a>
 <a class="link" href="beta_derivative.html#math_toolkit.special.sf_beta.beta_derivative.implementation">Implementation</a>
 </h5>

@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -27,7 +27,7 @@
<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>
<a name="math_toolkit.special.sf_beta.beta_function.synopsis"></a><h5>
-<a name="id1158098"></a>
+<a name="id1221807"></a>
 <a class="link" href="beta_function.html#math_toolkit.special.sf_beta.beta_function.synopsis">Synopsis</a>
 </h5>

@@ -48,7 +48,7 @@
}} // namespaces
</pre>
<a name="math_toolkit.special.sf_beta.beta_function.description"></a><h5>
-<a name="id1158377"></a>
+<a name="id1222087"></a>
 <a class="link" href="beta_function.html#math_toolkit.special.sf_beta.beta_function.description">Description</a>
 </h5>

@@ -86,7 +86,7 @@
 type calculation rules</a> when T1 and T2 are different types.
 
<a name="math_toolkit.special.sf_beta.beta_function.accuracy"></a><h5>
-<a name="id1158489"></a>
+<a name="id1222198"></a>
 <a class="link" href="beta_function.html#math_toolkit.special.sf_beta.beta_function.accuracy">Accuracy</a>
 </h5>

@@ -98,7 +98,7 @@
 zero error</a>.
 
<div class="table">
-<a name="id1158516"></a>Table 22. Peak Errors In the Beta Function
+<a name="math_toolkit.special.sf_beta.beta_function.peak_errors_in_the_beta_function"></a>Table 22. Peak Errors In the Beta Function
<div class="table-contents"><table class="table" summary="Peak Errors In the Beta Function">
<colgroup>
<col>
@@ -244,7 +244,7 @@
 very small.
 
<a name="math_toolkit.special.sf_beta.beta_function.testing"></a><h5>
-<a name="id1158752"></a>
+<a name="id1222462"></a>
 <a class="link" href="beta_function.html#math_toolkit.special.sf_beta.beta_function.testing">Testing</a>
 </h5>

@@ -253,7 +253,7 @@
 at 1000-bit precision.
 
<a name="math_toolkit.special.sf_beta.beta_function.implementation"></a><h5>
-<a name="id1158776"></a>
+<a name="id1222486"></a>
 <a class="link" href="beta_function.html#math_toolkit.special.sf_beta.beta_function.implementation">Implementation</a>
 </h5>

@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -28,7 +28,7 @@
 Beta Functions</a>
</h4></div></div></div>
<a name="math_toolkit.special.sf_beta.ibeta_function.synopsis"></a><h5>
-<a name="id1160110"></a>
+<a name="id1222720"></a>
 <a class="link" href="ibeta_function.html#math_toolkit.special.sf_beta.ibeta_function.synopsis">Synopsis</a>
 </h5>

@@ -67,7 +67,7 @@
}} // namespaces
</pre>
<a name="math_toolkit.special.sf_beta.ibeta_function.description"></a><h5>
-<a name="id1161126"></a>
+<a name="id1224837"></a>
 <a class="link" href="ibeta_function.html#math_toolkit.special.sf_beta.ibeta_function.description">Description</a>
 </h5>

@@ -163,7 +163,7 @@
 <img src="../../../../equations/ibeta2.png">
 
<a name="math_toolkit.special.sf_beta.ibeta_function.accuracy"></a><h5>
-<a name="id1162301"></a>
+<a name="id1226012"></a>
 <a class="link" href="ibeta_function.html#math_toolkit.special.sf_beta.ibeta_function.accuracy">Accuracy</a>
 </h5>

@@ -182,7 +182,7 @@
 with the wider exponent range of the long double types.
 
<div class="table">
-<a name="id1162332"></a>Table 23. Errors In the Function ibeta(a,b,x)
+<a name="math_toolkit.special.sf_beta.ibeta_function.errors_in_the_function_ibeta_a_b_x_"></a>Table 23. Errors In the Function ibeta(a,b,x)
<div class="table-contents"><table class="table" summary="Errors In the Function ibeta(a,b,x)">
<colgroup>
<col>
@@ -274,13 +274,13 @@
 </td>
<td>
 
- Peak=4x103 Mean=203
+ Peak=4x103 Mean=203
 
 
- (GSL Peak~3x105 Mean~2x104)
+ (GSL Peak~3x105 Mean~2x104 )
 
 
- (Cephes Peak~5x105 Mean~2x104)
+ (Cephes Peak~5x105 Mean~2x104 )
 
 </td>
</tr>
@@ -307,7 +307,7 @@
 </td>
<td>
 
- Peak~5x104 Mean=3x103
+ Peak~5x104 Mean=3x103 
 
 </td>
</tr>
@@ -334,7 +334,7 @@
 </td>
<td>
 
- Peak~5x104 Mean=3x103
+ Peak~5x104 Mean=3x103 
 
 </td>
</tr>
@@ -361,7 +361,7 @@
 </td>
<td>
 
- Peak~2x104 Mean=1x103
+ Peak~2x104 Mean=1x103 
 
 </td>
</tr>
@@ -369,7 +369,7 @@
</table></div>
</div>
 <div class="table">
-<a name="id1162673"></a>Table 24. Errors In the Function ibetac(a,b,x)
+<a name="math_toolkit.special.sf_beta.ibeta_function.errors_in_the_function_ibetac_a_b_x_"></a>Table 24. Errors In the Function ibetac(a,b,x)
<div class="table-contents"><table class="table" summary="Errors In the Function ibetac(a,b,x)">
<colgroup>
<col>
@@ -447,7 +447,7 @@
 </td>
<td>
 
- Peak=3x103 Mean=159
+ Peak=3x103 Mean=159
 
 </td>
</tr>
@@ -474,7 +474,7 @@
 </td>
<td>
 
- Peak~9x104 Mean=3x103
+ Peak~9x104 Mean=3x103 
 
 </td>
</tr>
@@ -501,7 +501,7 @@
 </td>
<td>
 
- Peak~9x104 Mean=3x103
+ Peak~9x104 Mean=3x103 
 
 </td>
</tr>
@@ -528,7 +528,7 @@
 </td>
<td>
 
- Peak~3x104 Mean=1x103
+ Peak~3x104 Mean=1x103 
 
 </td>
</tr>
@@ -536,7 +536,7 @@
</table></div>
</div>
 <div class="table">
-<a name="id1162960"></a>Table 25. Errors In the Function beta(a, b, x)
+<a name="math_toolkit.special.sf_beta.ibeta_function.errors_in_the_function_beta_a__b__x_"></a>Table 25. Errors In the Function beta(a, b, x)
<div class="table-contents"><table class="table" summary="Errors In the Function beta(a, b, x)">
<colgroup>
<col>
@@ -641,7 +641,7 @@
 </td>
<td>
 
- Peak~7x104 Mean=3x103
+ Peak~7x104 Mean=3x103 
 
 </td>
</tr>
@@ -668,7 +668,7 @@
 </td>
<td>
 
- Peak~7x104 Mean=3x103
+ Peak~7x104 Mean=3x103 
 
 </td>
</tr>
@@ -695,7 +695,7 @@
 </td>
<td>
 
- Peak~6x104 Mean=3x103
+ Peak~6x104 Mean=3x103 
 
 </td>
</tr>
@@ -703,7 +703,7 @@
</table></div>
</div>
 <div class="table">
-<a name="id1163244"></a>Table 26. Errors In the Function betac(a,b,x)
+<a name="math_toolkit.special.sf_beta.ibeta_function.errors_in_the_function_betac_a_b_x_"></a>Table 26. Errors In the Function betac(a,b,x)
<div class="table-contents"><table class="table" summary="Errors In the Function betac(a,b,x)">
<colgroup>
<col>
@@ -781,7 +781,7 @@
 </td>
<td>
 
- Peak=4x103 Mean=113
+ Peak=4x103 Mean=113
 
 </td>
</tr>
@@ -808,7 +808,7 @@
 </td>
<td>
 
- Peak~1x105 Mean=5x103
+ Peak~1x105 Mean=5x103 
 
 </td>
</tr>
@@ -835,7 +835,7 @@
 </td>
<td>
 
- Peak~1x105 Mean=5x103
+ Peak~1x105 Mean=5x103 
 
 </td>
</tr>
@@ -862,7 +862,7 @@
 </td>
<td>
 
- Peak~9x104 Mean=5x103
+ Peak~9x104 Mean=5x103 
 
 </td>
</tr>
@@ -870,7 +870,7 @@
</table></div>
</div>
 <a name="math_toolkit.special.sf_beta.ibeta_function.testing"></a><h5>
-<a name="id1163534"></a>
+<a name="id1227256"></a>
 <a class="link" href="ibeta_function.html#math_toolkit.special.sf_beta.ibeta_function.testing">Testing</a>
 </h5>

@@ -888,7 +888,7 @@
 have test data that is fully independent of the code.
 
<a name="math_toolkit.special.sf_beta.ibeta_function.implementation"></a><h5>
-<a name="id1163570"></a>
+<a name="id1227292"></a>
 <a class="link" href="ibeta_function.html#math_toolkit.special.sf_beta.ibeta_function.implementation">Implementation</a>
 </h5>

@@ -972,9 +972,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -87,7 +87,7 @@
}} // namespaces
</pre>
<a name="math_toolkit.special.sf_beta.ibeta_inv_function.description"></a><h5>
-<a name="id1167686"></a>
+<a name="id1229781"></a>
 <a class="link" href="ibeta_inv_function.html#math_toolkit.special.sf_beta.ibeta_inv_function.description">Description</a>
 </h5>

@@ -323,7 +323,7 @@

 
<a name="math_toolkit.special.sf_beta.ibeta_inv_function.accuracy"></a><h5>
-<a name="id1170394"></a>
+<a name="id1233581"></a>
 <a class="link" href="ibeta_inv_function.html#math_toolkit.special.sf_beta.ibeta_inv_function.accuracy">Accuracy</a>
 </h5>

@@ -335,7 +335,7 @@
 or <code class="computeroutput">1</code>.
 
<a name="math_toolkit.special.sf_beta.ibeta_inv_function.testing"></a><h5>
-<a name="id1170435"></a>
+<a name="id1233621"></a>
 <a class="link" href="ibeta_inv_function.html#math_toolkit.special.sf_beta.ibeta_inv_function.testing">Testing</a>
 </h5>

@@ -359,7 +359,7 @@
 </li>
</ul></div>
<a name="math_toolkit.special.sf_beta.ibeta_inv_function.implementation_of_ibeta_inv_and_ibetac_inv"></a><h5>
-<a name="id1170491"></a>
+<a name="id1233678"></a>
 <a class="link" href="ibeta_inv_function.html#math_toolkit.special.sf_beta.ibeta_inv_function.implementation_of_ibeta_inv_and_ibetac_inv">Implementation
 of ibeta_inv and ibetac_inv</a>
 </h5>
@@ -527,7 +527,7 @@
 rapidly converges on the true value.
 
<a name="math_toolkit.special.sf_beta.ibeta_inv_function.implementation_of_inverses_on_the_a_and_b_parameters"></a><h5>
-<a name="id1171132"></a>
+<a name="id1234307"></a>
 <a class="link" href="ibeta_inv_function.html#math_toolkit.special.sf_beta.ibeta_inv_function.implementation_of_inverses_on_the_a_and_b_parameters">Implementation
 of inverses on the a and b parameters</a>
 </h5>
@@ -554,9 +554,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -28,7 +28,7 @@
 Functions</a>
</h4></div></div></div>
<a name="math_toolkit.special.sf_erf.error_function.synopsis"></a><h5>
-<a name="id1171679"></a>
+<a name="id1235330"></a>
 <a class="link" href="error_function.html#math_toolkit.special.sf_erf.error_function.synopsis">Synopsis</a>
 </h5>

@@ -69,7 +69,7 @@

 
<a name="math_toolkit.special.sf_erf.error_function.description"></a><h5>
-<a name="id1172062"></a>
+<a name="id1235713"></a>
 <a class="link" href="error_function.html#math_toolkit.special.sf_erf.error_function.description">Description</a>
 </h5>
<pre class="programlisting">template <class T>
@@ -106,7 +106,7 @@
 <img src="../../../../graphs/erfc.png" align="middle">
 
<a name="math_toolkit.special.sf_erf.error_function.accuracy"></a><h5>
-<a name="id1172450"></a>
+<a name="id1236101"></a>
 <a class="link" href="error_function.html#math_toolkit.special.sf_erf.error_function.accuracy">Accuracy</a>
 </h5>

@@ -119,7 +119,7 @@
 the one shown will have <a class="link" href="../../backgrounders/relative_error.html#zero_error">effectively zero error</a>.
 
<div class="table">
-<a name="id1172487"></a>Table 27. Errors In the Function erf(z)
+<a name="math_toolkit.special.sf_erf.error_function.errors_in_the_function_erf_z_"></a>Table 27. Errors In the Function erf(z)
<div class="table-contents"><table class="table" summary="Errors In the Function erf(z)">
<colgroup>
<col>
@@ -325,7 +325,7 @@
</table></div>
</div>
 <div class="table">
-<a name="id1174278"></a>Table 28. Errors In the Function erfc(z)
+<a name="math_toolkit.special.sf_erf.error_function.errors_in_the_function_erfc_z_"></a>Table 28. Errors In the Function erfc(z)
<div class="table-contents"><table class="table" summary="Errors In the Function erfc(z)">
<colgroup>
<col>
@@ -531,7 +531,7 @@
</table></div>
</div>
 <a name="math_toolkit.special.sf_erf.error_function.testing"></a><h5>
-<a name="id1174636"></a>
+<a name="id1236852"></a>
 <a class="link" href="error_function.html#math_toolkit.special.sf_erf.error_function.testing">Testing</a>
 </h5>

@@ -546,7 +546,7 @@
 check.
 
<a name="math_toolkit.special.sf_erf.error_function.implementation"></a><h5>
-<a name="id1174665"></a>
+<a name="id1236881"></a>
 <a class="link" href="error_function.html#math_toolkit.special.sf_erf.error_function.implementation">Implementation</a>
 </h5>

@@ -623,9 +623,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -28,7 +28,7 @@
 Inverses</a>
</h4></div></div></div>
<a name="math_toolkit.special.sf_erf.error_inv.synopsis"></a><h5>
-<a name="id1175395"></a>
+<a name="id1238163"></a>
 <a class="link" href="error_inv.html#math_toolkit.special.sf_erf.error_inv.synopsis">Synopsis</a>
 </h5>

@@ -69,7 +69,7 @@

 
<a name="math_toolkit.special.sf_erf.error_inv.description"></a><h5>
-<a name="id1175778"></a>
+<a name="id1238546"></a>
 <a class="link" href="error_inv.html#math_toolkit.special.sf_erf.error_inv.description">Description</a>
 </h5>
<pre class="programlisting">template <class T>
@@ -103,7 +103,7 @@
 <img src="../../../../graphs/erfc_inv.png" align="middle">
 
<a name="math_toolkit.special.sf_erf.error_inv.accuracy"></a><h5>
-<a name="id1176165"></a>
+<a name="id1238933"></a>
 <a class="link" href="error_inv.html#math_toolkit.special.sf_erf.error_inv.accuracy">Accuracy</a>
 </h5>

@@ -113,7 +113,7 @@
 error functions</a>.
 
<a name="math_toolkit.special.sf_erf.error_inv.testing"></a><h5>
-<a name="id1176187"></a>
+<a name="id1238955"></a>
 <a class="link" href="error_inv.html#math_toolkit.special.sf_erf.error_inv.testing">Testing</a>
 </h5>

@@ -136,7 +136,7 @@
 </li>
</ul></div>
<a name="math_toolkit.special.sf_erf.error_inv.implementation"></a><h5>
-<a name="id1176236"></a>
+<a name="id1239004"></a>
 <a class="link" href="error_inv.html#math_toolkit.special.sf_erf.error_inv.implementation">Implementation</a>
 </h5>

@@ -196,9 +196,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -27,7 +27,7 @@
<a name="math_toolkit.special.sf_gamma.digamma"></a><a class="link" href="digamma.html" title="Digamma"> Digamma</a>
</h4></div></div></div>
<a name="math_toolkit.special.sf_gamma.digamma.synopsis"></a><h5>
-<a name="id1141706"></a>
+<a name="id1202036"></a>
 <a class="link" href="digamma.html#math_toolkit.special.sf_gamma.digamma.synopsis">Synopsis</a>
 </h5>

@@ -48,7 +48,7 @@
}} // namespaces
</pre>
<a name="math_toolkit.special.sf_gamma.digamma.description"></a><h5>
-<a name="id1141933"></a>
+<a name="id1202262"></a>
 <a class="link" href="digamma.html#math_toolkit.special.sf_gamma.digamma.description">Description</a>
 </h5>

@@ -82,7 +82,7 @@
 T otherwise.
 
<a name="math_toolkit.special.sf_gamma.digamma.accuracy"></a><h5>
-<a name="id1142041"></a>
+<a name="id1202370"></a>
 <a class="link" href="digamma.html#math_toolkit.special.sf_gamma.digamma.accuracy">Accuracy</a>
 </h5>

@@ -270,7 +270,7 @@
 absolute error will remain very low.
 
<a name="math_toolkit.special.sf_gamma.digamma.testing"></a><h5>
-<a name="id1142345"></a>
+<a name="id1202674"></a>
 <a class="link" href="digamma.html#math_toolkit.special.sf_gamma.digamma.testing">Testing</a>
 </h5>

@@ -280,7 +280,7 @@
 see below).
 
<a name="math_toolkit.special.sf_gamma.digamma.implementation"></a><h5>
-<a name="id1142366"></a>
+<a name="id1202696"></a>
 <a class="link" href="digamma.html#math_toolkit.special.sf_gamma.digamma.implementation">Implementation</a>
 </h5>

@@ -379,9 +379,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -28,7 +28,7 @@
 of the Incomplete Gamma Function</a>
</h4></div></div></div>
<a name="math_toolkit.special.sf_gamma.gamma_derivatives.synopsis"></a><h5>
-<a name="id1153154"></a>
+<a name="id1213674"></a>
 <a class="link" href="gamma_derivatives.html#math_toolkit.special.sf_gamma.gamma_derivatives.synopsis">Synopsis</a>
 </h5>

@@ -49,7 +49,7 @@
}} // namespaces
</pre>
<a name="math_toolkit.special.sf_gamma.gamma_derivatives.description"></a><h5>
-<a name="id1153438"></a>
+<a name="id1213958"></a>
 <a class="link" href="gamma_derivatives.html#math_toolkit.special.sf_gamma.gamma_derivatives.description">Description</a>
 </h5>

@@ -80,7 +80,7 @@
 otherwise the return type is simply T1.
 
<a name="math_toolkit.special.sf_gamma.gamma_derivatives.accuracy"></a><h5>
-<a name="id1153522"></a>
+<a name="id1214042"></a>
 <a class="link" href="gamma_derivatives.html#math_toolkit.special.sf_gamma.gamma_derivatives.accuracy">Accuracy</a>
 </h5>

@@ -88,7 +88,7 @@
 refer to the documentation for that function for more information.
 
<a name="math_toolkit.special.sf_gamma.gamma_derivatives.implementation"></a><h5>
-<a name="id1153550"></a>
+<a name="id1214070"></a>
 <a class="link" href="gamma_derivatives.html#math_toolkit.special.sf_gamma.gamma_derivatives.implementation">Implementation</a>
 </h5>

@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -51,7 +51,7 @@
}} // namespaces
</pre>
<a name="math_toolkit.special.sf_gamma.gamma_ratios.description"></a><h5>
-<a name="id1143880"></a>
+<a name="id1203658"></a>
 <a class="link" href="gamma_ratios.html#math_toolkit.special.sf_gamma.gamma_ratios.description">Description</a>
 </h5>
<pre class="programlisting">template <class T1, class T2>
@@ -117,7 +117,7 @@
 <img src="../../../../graphs/tgamma_delta_ratio.png" align="middle">
 
<a name="math_toolkit.special.sf_gamma.gamma_ratios.accuracy"></a><h5>
-<a name="id1144437"></a>
+<a name="id1205341"></a>
 <a class="link" href="gamma_ratios.html#math_toolkit.special.sf_gamma.gamma_ratios.accuracy">Accuracy</a>
 </h5>

@@ -127,7 +127,7 @@
 <a class="link" href="../../backgrounders/relative_error.html#zero_error">effectively zero error</a>.
 
<div class="table">
-<a name="id1144455"></a>Table 16. Errors In the Function tgamma_delta_ratio(a, delta)
+<a name="math_toolkit.special.sf_gamma.gamma_ratios.errors_in_the_function_tgamma_delta_ratio_a__delta_"></a>Table 16. Errors In the Function tgamma_delta_ratio(a, delta)
<div class="table-contents"><table class="table" summary="Errors In the Function tgamma_delta_ratio(a, delta)">
<colgroup>
<col>
@@ -230,7 +230,7 @@
</table></div>
</div>
 <div class="table">
-<a name="id1144620"></a>Table 17. Errors In the Function tgamma_ratio(a, b)
+<a name="math_toolkit.special.sf_gamma.gamma_ratios.errors_in_the_function_tgamma_ratio_a__b_"></a>Table 17. Errors In the Function tgamma_ratio(a, b)
<div class="table-contents"><table class="table" summary="Errors In the Function tgamma_ratio(a, b)">
<colgroup>
<col>
@@ -327,7 +327,7 @@
</table></div>
</div>
 <a name="math_toolkit.special.sf_gamma.gamma_ratios.testing"></a><h5>
-<a name="id1144777"></a>
+<a name="id1205683"></a>
 <a class="link" href="gamma_ratios.html#math_toolkit.special.sf_gamma.gamma_ratios.testing">Testing</a>
 </h5>

@@ -336,7 +336,7 @@
 a deliberately naive calculation of Γ(x)/Γ(y).
 
<a name="math_toolkit.special.sf_gamma.gamma_ratios.implementation"></a><h5>
-<a name="id1144801"></a>
+<a name="id1205707"></a>
 <a class="link" href="gamma_ratios.html#math_toolkit.special.sf_gamma.gamma_ratios.implementation">Implementation</a>
 </h5>

@@ -353,9 +353,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -28,7 +28,7 @@
 Functions</a>
</h4></div></div></div>
<a name="math_toolkit.special.sf_gamma.igamma.synopsis"></a><h5>
-<a name="id1144843"></a>
+<a name="id1205749"></a>
 <a class="link" href="igamma.html#math_toolkit.special.sf_gamma.igamma.synopsis">Synopsis</a>
 </h5>

@@ -67,7 +67,7 @@
}} // namespaces
</pre>
<a name="math_toolkit.special.sf_gamma.igamma.description"></a><h5>
-<a name="id1148259"></a>
+<a name="id1206554"></a>
 <a class="link" href="igamma.html#math_toolkit.special.sf_gamma.igamma.description">Description</a>
 </h5>

@@ -160,7 +160,7 @@
 <img src="../../../../equations/igamma1.png">
 
<a name="math_toolkit.special.sf_gamma.igamma.accuracy"></a><h5>
-<a name="id1149219"></a>
+<a name="id1208614"></a>
 <a class="link" href="igamma.html#math_toolkit.special.sf_gamma.igamma.accuracy">Accuracy</a>
 </h5>

@@ -185,7 +185,7 @@
 All values are in units of epsilon.
 
<div class="table">
-<a name="id1149261"></a>Table 18. Errors In the Function gamma_p(a,z)
+<a name="math_toolkit.special.sf_gamma.igamma.errors_in_the_function_gamma_p_a_z_"></a>Table 18. Errors In the Function gamma_p(a,z)
<div class="table-contents"><table class="table" summary="Errors In the Function gamma_p(a,z)">
<colgroup>
<col>
@@ -372,7 +372,7 @@
</table></div>
</div>
 <div class="table">
-<a name="id1149578"></a>Table 19. Errors In the Function gamma_q(a,z)
+<a name="math_toolkit.special.sf_gamma.igamma.errors_in_the_function_gamma_q_a_z_"></a>Table 19. Errors In the Function gamma_q(a,z)
<div class="table-contents"><table class="table" summary="Errors In the Function gamma_q(a,z)">
<colgroup>
<col>
@@ -558,7 +558,7 @@
</table></div>
</div>
 <div class="table">
-<a name="id1149913"></a>Table 20. Errors In the Function tgamma_lower(a,z)
+<a name="math_toolkit.special.sf_gamma.igamma.errors_in_the_function_tgamma_lower_a_z_"></a>Table 20. Errors In the Function tgamma_lower(a,z)
<div class="table-contents"><table class="table" summary="Errors In the Function tgamma_lower(a,z)">
<colgroup>
<col>
@@ -693,7 +693,7 @@
</table></div>
</div>
 <div class="table">
-<a name="id1150133"></a>Table 21. Errors In the Function tgamma(a,z)
+<a name="math_toolkit.special.sf_gamma.igamma.errors_in_the_function_tgamma_a_z_"></a>Table 21. Errors In the Function tgamma(a,z)
<div class="table-contents"><table class="table" summary="Errors In the Function tgamma(a,z)">
<colgroup>
<col>
@@ -828,7 +828,7 @@
</table></div>
</div>
 <a name="math_toolkit.special.sf_gamma.igamma.testing"></a><h5>
-<a name="id1150358"></a>
+<a name="id1209758"></a>
 <a class="link" href="igamma.html#math_toolkit.special.sf_gamma.igamma.testing">Testing</a>
 </h5>

@@ -844,7 +844,7 @@
 fraction (see below) is unstable for small a and z.
 
<a name="math_toolkit.special.sf_gamma.igamma.implementation"></a><h5>
-<a name="id1150385"></a>
+<a name="id1209784"></a>
 <a class="link" href="igamma.html#math_toolkit.special.sf_gamma.igamma.implementation">Implementation</a>
 </h5>

@@ -1013,7 +1013,7 @@
 by Temme (see references below).
 
<a name="math_toolkit.special.sf_gamma.igamma.references"></a><h5>
-<a name="id1151125"></a>
+<a name="id1210545"></a>
 <a class="link" href="igamma.html#math_toolkit.special.sf_gamma.igamma.references">References</a>
 </h5>
<div class="itemizedlist"><ul type="disc">
@@ -1040,9 +1040,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -28,7 +28,7 @@
 Gamma Function Inverses</a>
</h4></div></div></div>
<a name="math_toolkit.special.sf_gamma.igamma_inv.synopsis"></a><h5>
-<a name="id1151186"></a>
+<a name="id1210607"></a>
 <a class="link" href="igamma_inv.html#math_toolkit.special.sf_gamma.igamma_inv.synopsis">Synopsis</a>
 </h5>

@@ -67,7 +67,7 @@
}} // namespaces
</pre>
<a name="math_toolkit.special.sf_gamma.igamma_inv.description"></a><h5>
-<a name="id1151992"></a>
+<a name="id1211412"></a>
 <a class="link" href="igamma_inv.html#math_toolkit.special.sf_gamma.igamma_inv.description">Description</a>
 </h5>

@@ -173,7 +173,7 @@
 0.
 
<a name="math_toolkit.special.sf_gamma.igamma_inv.accuracy"></a><h5>
-<a name="id1153005"></a>
+<a name="id1212425"></a>
 <a class="link" href="igamma_inv.html#math_toolkit.special.sf_gamma.igamma_inv.accuracy">Accuracy</a>
 </h5>

@@ -187,7 +187,7 @@
 functions.
 
<a name="math_toolkit.special.sf_gamma.igamma_inv.testing"></a><h5>
-<a name="id1153031"></a>
+<a name="id1212451"></a>
 <a class="link" href="igamma_inv.html#math_toolkit.special.sf_gamma.igamma_inv.testing">Testing</a>
 </h5>

@@ -211,7 +211,7 @@
 </li>
</ul></div>
<a name="math_toolkit.special.sf_gamma.igamma_inv.implementation"></a><h5>
-<a name="id1153088"></a>
+<a name="id1213608"></a>
 <a class="link" href="igamma_inv.html#math_toolkit.special.sf_gamma.igamma_inv.implementation">Implementation</a>
 </h5>

@@ -250,9 +250,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -27,7 +27,7 @@
<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>
<a name="math_toolkit.special.sf_gamma.lgamma.synopsis"></a><h5>
-<a name="id1139258"></a>
+<a name="id1198496"></a>
 <a class="link" href="lgamma.html#math_toolkit.special.sf_gamma.lgamma.synopsis">Synopsis</a>
 </h5>

@@ -54,7 +54,7 @@
}} // namespaces
</pre>
<a name="math_toolkit.special.sf_gamma.lgamma.description"></a><h5>
-<a name="id1139641"></a>
+<a name="id1198878"></a>
 <a class="link" href="lgamma.html#math_toolkit.special.sf_gamma.lgamma.description">Description</a>
 </h5>

@@ -98,7 +98,7 @@
 T otherwise.
 
<a name="math_toolkit.special.sf_gamma.lgamma.accuracy"></a><h5>
-<a name="id1140468"></a>
+<a name="id1199006"></a>
 <a class="link" href="lgamma.html#math_toolkit.special.sf_gamma.lgamma.accuracy">Accuracy</a>
 </h5>

@@ -349,7 +349,7 @@
</tbody>
</table></div>
<a name="math_toolkit.special.sf_gamma.lgamma.testing"></a><h5>
-<a name="id1140931"></a>
+<a name="id1199469"></a>
 <a class="link" href="lgamma.html#math_toolkit.special.sf_gamma.lgamma.testing">Testing</a>
 </h5>

@@ -360,7 +360,7 @@
 Random tests in key problem areas are also used.
 
<a name="math_toolkit.special.sf_gamma.lgamma.implementation"></a><h5>
-<a name="id1140952"></a>
+<a name="id1199489"></a>
 <a class="link" href="lgamma.html#math_toolkit.special.sf_gamma.lgamma.implementation">Implementation</a>
 </h5>

@@ -390,7 +390,7 @@
 <img src="../../../../equations/lgamm4.png">
 

- Where Le,g is the Lanczos sum, scaled by eg.
+ Where Le,g is the Lanczos sum, scaled by eg.
 

 As before the reflection formula is used for z < 0.
@@ -460,7 +460,7 @@
 <img src="../../../../equations/lgamm5.png">
 

- The Ck terms in the above are the same as in the <a class="link" href="../../backgrounders/lanczos.html" title="The Lanczos Approximation">Lanczos
+ The Ck terms in the above are the same as in the <a class="link" href="../../backgrounders/lanczos.html" title="The Lanczos Approximation">Lanczos
 approximation</a>.
 

@@ -472,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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -27,7 +27,7 @@
<a name="math_toolkit.special.sf_gamma.tgamma"></a><a class="link" href="tgamma.html" title="Gamma"> Gamma</a>
</h4></div></div></div>
<a name="math_toolkit.special.sf_gamma.tgamma.synopsis"></a><h5>
-<a name="id1136316"></a>
+<a name="id1195639"></a>
 <a class="link" href="tgamma.html#math_toolkit.special.sf_gamma.tgamma.synopsis">Synopsis</a>
 </h5>

@@ -54,7 +54,7 @@
}} // namespaces
</pre>
<a name="math_toolkit.special.sf_gamma.tgamma.description"></a><h5>
-<a name="id1137844"></a>
+<a name="id1195988"></a>
 <a class="link" href="tgamma.html#math_toolkit.special.sf_gamma.tgamma.description">Description</a>
 </h5>
<pre class="programlisting">template <class T>
@@ -129,7 +129,7 @@

 
<a name="math_toolkit.special.sf_gamma.tgamma.accuracy"></a><h5>
-<a name="id1138309"></a>
+<a name="id1197546"></a>
 <a class="link" href="tgamma.html#math_toolkit.special.sf_gamma.tgamma.accuracy">Accuracy</a>
 </h5>

@@ -384,7 +384,7 @@
</tbody>
</table></div>
<a name="math_toolkit.special.sf_gamma.tgamma.testing"></a><h5>
-<a name="id1138783"></a>
+<a name="id1198020"></a>
 <a class="link" href="tgamma.html#math_toolkit.special.sf_gamma.tgamma.testing">Testing</a>
 </h5>

@@ -399,7 +399,7 @@
 a lanczos approximation accurate to around 100 decimal digits.
 
<a name="math_toolkit.special.sf_gamma.tgamma.implementation"></a><h5>
-<a name="id1138840"></a>
+<a name="id1198077"></a>
 <a class="link" href="tgamma.html#math_toolkit.special.sf_gamma.tgamma.implementation">Implementation</a>
 </h5>

@@ -440,7 +440,7 @@
 

 is used. Particular care has to be taken to evaluate the <code class="computeroutput">z * sin([pi][space] * z)</code>
- part: a special routine is used to reduce z prior to multiplying by π to
+ part: a special routine is used to reduce z prior to multiplying by π to
 ensure that the result in is the range [0, π/2]. Without this an excessive
 amount of error occurs in this region (which is hard enough already, as
 the rate of change near a negative pole is exceptionally
@@ -464,9 +464,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -27,7 +27,7 @@
<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>
<a name="math_toolkit.special.sf_poly.hermite.synopsis"></a><h5>
-<a name="id1189350"></a>
+<a name="id1247236"></a>
 <a class="link" href="hermite.html#math_toolkit.special.sf_poly.hermite.synopsis">Synopsis</a>
 </h5>

@@ -51,7 +51,7 @@
}} // namespaces
</pre>
<a name="math_toolkit.special.sf_poly.hermite.description"></a><h5>
-<a name="id1189990"></a>
+<a name="id1247603"></a>
 <a class="link" href="hermite.html#math_toolkit.special.sf_poly.hermite.description">Description</a>
 </h5>

@@ -136,7 +136,7 @@
</dl>
</div>
<a name="math_toolkit.special.sf_poly.hermite.accuracy"></a><h5>
-<a name="id1190748"></a>
+<a name="id1249590"></a>
 <a class="link" href="hermite.html#math_toolkit.special.sf_poly.hermite.accuracy">Accuracy</a>
 </h5>

@@ -146,7 +146,7 @@
 zero error</a>.
 
<div class="table">
-<a name="id1190766"></a>Table 34. Peak Errors In the Hermite Polynomial
+<a name="math_toolkit.special.sf_poly.hermite.peak_errors_in_the_hermite_polynomial"></a>Table 34. Peak Errors In the Hermite Polynomial
<div class="table-contents"><table class="table" summary="Peak Errors In the Hermite Polynomial">
<colgroup>
<col>
@@ -253,7 +253,7 @@
 is very close to a root.
 
<a name="math_toolkit.special.sf_poly.hermite.testing"></a><h5>
-<a name="id1190929"></a>
+<a name="id1249772"></a>
 <a class="link" href="hermite.html#math_toolkit.special.sf_poly.hermite.testing">Testing</a>
 </h5>

@@ -263,7 +263,7 @@
 precision.
 
<a name="math_toolkit.special.sf_poly.hermite.implementation"></a><h5>
-<a name="id1190950"></a>
+<a name="id1249794"></a>
 <a class="link" href="hermite.html#math_toolkit.special.sf_poly.hermite.implementation">Implementation</a>
 </h5>

@@ -274,9 +274,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -28,7 +28,7 @@
 Associated) Polynomials</a>
</h4></div></div></div>
<a name="math_toolkit.special.sf_poly.laguerre.synopsis"></a><h5>
-<a name="id1185093"></a>
+<a name="id1244485"></a>
 <a class="link" href="laguerre.html#math_toolkit.special.sf_poly.laguerre.synopsis">Synopsis</a>
 </h5>

@@ -62,7 +62,7 @@
}} // namespaces
</pre>
<a name="math_toolkit.special.sf_poly.laguerre.description"></a><h5>
-<a name="id1185763"></a>
+<a name="id1245155"></a>
 <a class="link" href="laguerre.html#math_toolkit.special.sf_poly.laguerre.description">Description</a>
 </h5>

@@ -210,7 +210,7 @@
</dl>
</div>
<a name="math_toolkit.special.sf_poly.laguerre.accuracy"></a><h5>
-<a name="id1188951"></a>
+<a name="id1246835"></a>
 <a class="link" href="laguerre.html#math_toolkit.special.sf_poly.laguerre.accuracy">Accuracy</a>
 </h5>

@@ -220,7 +220,7 @@
 zero error</a>.
 
<div class="table">
-<a name="id1188969"></a>Table 32. Peak Errors In the Laguerre Polynomial
+<a name="math_toolkit.special.sf_poly.laguerre.peak_errors_in_the_laguerre_polynomial"></a>Table 32. Peak Errors In the Laguerre Polynomial
<div class="table-contents"><table class="table" summary="Peak Errors In the Laguerre Polynomial">
<colgroup>
<col>
@@ -320,7 +320,7 @@
</table></div>
</div>
 <div class="table">
-<a name="id1189134"></a>Table 33. Peak Errors In the Associated Laguerre Polynomial
+<a name="math_toolkit.special.sf_poly.laguerre.peak_errors_in_the_associated_laguerre_polynomial"></a>Table 33. Peak Errors In the Associated Laguerre Polynomial
<div class="table-contents"><table class="table" summary="Peak Errors In the Associated Laguerre Polynomial">
<colgroup>
<col>
@@ -427,7 +427,7 @@
 is very close to a root.
 
<a name="math_toolkit.special.sf_poly.laguerre.testing"></a><h5>
-<a name="id1189300"></a>
+<a name="id1247187"></a>
 <a class="link" href="laguerre.html#math_toolkit.special.sf_poly.laguerre.testing">Testing</a>
 </h5>

@@ -437,7 +437,7 @@
 precision.
 
<a name="math_toolkit.special.sf_poly.laguerre.implementation"></a><h5>
-<a name="id1189322"></a>
+<a name="id1247208"></a>
 <a class="link" href="laguerre.html#math_toolkit.special.sf_poly.laguerre.implementation">Implementation</a>
 </h5>

@@ -448,9 +448,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -28,7 +28,7 @@
 Associated) Polynomials</a>
</h4></div></div></div>
<a name="math_toolkit.special.sf_poly.legendre.synopsis"></a><h5>
-<a name="id1181221"></a>
+<a name="id1239367"></a>
 <a class="link" href="legendre.html#math_toolkit.special.sf_poly.legendre.synopsis">Synopsis</a>
 </h5>

@@ -84,7 +84,7 @@

 
<a name="math_toolkit.special.sf_poly.legendre.description"></a><h5>
-<a name="id1182073"></a>
+<a name="id1242002"></a>
 <a class="link" href="legendre.html#math_toolkit.special.sf_poly.legendre.description">Description</a>
 </h5>
<pre class="programlisting">template <class T>
@@ -292,7 +292,7 @@
</dl>
</div>
<a name="math_toolkit.special.sf_poly.legendre.accuracy"></a><h5>
-<a name="id1184460"></a>
+<a name="id1243848"></a>
 <a class="link" href="legendre.html#math_toolkit.special.sf_poly.legendre.accuracy">Accuracy</a>
 </h5>

@@ -302,7 +302,7 @@
 zero error</a>.
 
<div class="table">
-<a name="id1184478"></a>Table 29. Peak Errors In the Legendre P Function
+<a name="math_toolkit.special.sf_poly.legendre.peak_errors_in_the_legendre_p_function"></a>Table 29. Peak Errors In the Legendre P Function
<div class="table-contents"><table class="table" summary="Peak Errors In the Legendre P Function">
<colgroup>
<col>
@@ -431,7 +431,7 @@
</table></div>
</div>
 <div class="table">
-<a name="id1184678"></a>Table 30. Peak Errors In the Associated Legendre P Function
+<a name="math_toolkit.special.sf_poly.legendre.peak_errors_in_the_associated_legendre_p_function"></a>Table 30. Peak Errors In the Associated Legendre P Function
<div class="table-contents"><table class="table" summary="Peak Errors In the Associated Legendre P Function">
<colgroup>
<col>
@@ -531,7 +531,7 @@
</table></div>
</div>
 <div class="table">
-<a name="id1184834"></a>Table 31. Peak Errors In the Legendre Q Function
+<a name="math_toolkit.special.sf_poly.legendre.peak_errors_in_the_legendre_q_function"></a>Table 31. Peak Errors In the Legendre Q Function
<div class="table-contents"><table class="table" summary="Peak Errors In the Legendre Q Function">
<colgroup>
<col>
@@ -673,7 +673,7 @@
 given here.
 
<a name="math_toolkit.special.sf_poly.legendre.testing"></a><h5>
-<a name="id1185044"></a>
+<a name="id1244436"></a>
 <a class="link" href="legendre.html#math_toolkit.special.sf_poly.legendre.testing">Testing</a>
 </h5>

@@ -683,7 +683,7 @@
 precision.
 
<a name="math_toolkit.special.sf_poly.legendre.implementation"></a><h5>
-<a name="id1185066"></a>
+<a name="id1244458"></a>
 <a class="link" href="legendre.html#math_toolkit.special.sf_poly.legendre.implementation">Implementation</a>
 </h5>

@@ -694,9 +694,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -27,7 +27,7 @@
<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>
<a name="math_toolkit.special.sf_poly.sph_harm.synopsis"></a><h5>
-<a name="id1190978"></a>
+<a name="id1249821"></a>
 <a class="link" href="sph_harm.html#math_toolkit.special.sf_poly.sph_harm.synopsis">Synopsis</a>
 </h5>

@@ -60,7 +60,7 @@
}} // namespaces
</pre>
<a name="math_toolkit.special.sf_poly.sph_harm.description"></a><h5>
-<a name="id1191802"></a>
+<a name="id1250646"></a>
 <a class="link" href="sph_harm.html#math_toolkit.special.sf_poly.sph_harm.description">Description</a>
 </h5>

@@ -102,8 +102,8 @@
<tr><td align="left" valign="top">

 Care must be taken in correctly identifying the arguments to this function:
- θ is taken as the polar (colatitudinal) coordinate with θ in [0, π], and φ as
- the azimuthal (longitudinal) coordinate with φ in [0,2π). This is the convention
+ θ is taken as the polar (colatitudinal) coordinate with θ in [0, π], and φ as
+ the azimuthal (longitudinal) coordinate with φ in [0,2π). This is the convention
 used in Physics, and matches the definition used by <a href="http://documents.wolfram.com/mathematica/functions/SphericalHarmonicY" target="_top">Mathematica
 in the function SpericalHarmonicY</a>, but is opposite to the usual
 mathematical conventions.
@@ -117,11 +117,11 @@
 This implementation returns zero for m > n
 

- For θ outside [0, π] and φ outside [0, 2π] this implementation follows the
+ For θ outside [0, π] and φ outside [0, 2π] this implementation follows the
 convention used by Mathematica: the function is periodic with period
- π in θ and 2π in φ. Please note that this is not the behaviour one would get
+ π in θ and 2π in φ. Please note that this is not the behaviour one would get
 from a casual application of the function's definition. Cautious users
- should keep θ and φ to the range [0, π] and [0, 2π] respectively.
+ should keep θ and φ to the range [0, π] and [0, 2π] respectively.
 

 See: <a href="http://mathworld.wolfram.com/SphericalHarmonic.html" target="_top">Weisstein,
@@ -155,7 +155,7 @@
 <img src="../../../../equations/spherical_2.png">
 
<a name="math_toolkit.special.sf_poly.sph_harm.accuracy"></a><h5>
-<a name="id1193825"></a>
+<a name="id1251564"></a>
 <a class="link" href="sph_harm.html#math_toolkit.special.sf_poly.sph_harm.accuracy">Accuracy</a>
 </h5>

@@ -170,7 +170,7 @@
 All values are in units of epsilon.
 
<div class="table">
-<a name="id1193846"></a>Table 35. Peak Errors In the Sperical Harmonic Functions
+<a name="math_toolkit.special.sf_poly.sph_harm.peak_errors_in_the_sperical_harmonic_functions"></a>Table 35. Peak Errors In the Sperical Harmonic Functions
<div class="table-contents"><table class="table" summary="Peak Errors In the Sperical Harmonic Functions">
<colgroup>
<col>
@@ -276,7 +276,7 @@
 arbitrarily large when the function is very close to a root.
 
<a name="math_toolkit.special.sf_poly.sph_harm.testing"></a><h5>
-<a name="id1194016"></a>
+<a name="id1251916"></a>
 <a class="link" href="sph_harm.html#math_toolkit.special.sf_poly.sph_harm.testing">Testing</a>
 </h5>

@@ -286,7 +286,7 @@
 precision.
 
<a name="math_toolkit.special.sf_poly.sph_harm.implementation"></a><h5>
-<a name="id1194037"></a>
+<a name="id1251937"></a>
 <a class="link" href="sph_harm.html#math_toolkit.special.sf_poly.sph_harm.implementation">Implementation</a>
 </h5>

@@ -301,9 +301,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -27,7 +27,7 @@
<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>
<a name="math_toolkit.special.zetas.zeta.synopsis"></a><h5>
-<a name="id1212537"></a>
+<a name="id1271612"></a>
 <a class="link" href="zeta.html#math_toolkit.special.zetas.zeta.synopsis">Synopsis</a>
 </h5>

@@ -62,7 +62,7 @@

 
<a name="math_toolkit.special.zetas.zeta.description"></a><h5>
-<a name="id1212797"></a>
+<a name="id1271872"></a>
 <a class="link" href="zeta.html#math_toolkit.special.zetas.zeta.description">Description</a>
 </h5>
<pre class="programlisting">template <class T>
@@ -85,7 +85,7 @@
 <img src="../../../../graphs/zeta2.png" align="middle">
 
<a name="math_toolkit.special.zetas.zeta.accuracy"></a><h5>
-<a name="id1213022"></a>
+<a name="id1272097"></a>
 <a class="link" href="zeta.html#math_toolkit.special.zetas.zeta.accuracy">Accuracy</a>
 </h5>

@@ -97,7 +97,7 @@
 shown will have <a class="link" href="../../backgrounders/relative_error.html#zero_error">effectively zero error</a>.
 
<div class="table">
-<a name="id1213049"></a>Table 44. Errors In the Function zeta(z)
+<a name="math_toolkit.special.zetas.zeta.errors_in_the_function_zeta_z_"></a>Table 44. Errors In the Function zeta(z)
<div class="table-contents"><table class="table" summary="Errors In the Function zeta(z)">
<colgroup>
<col>
@@ -234,7 +234,7 @@
</table></div>
</div>
 <a name="math_toolkit.special.zetas.zeta.testing"></a><h5>
-<a name="id1213278"></a>
+<a name="id1272357"></a>
 <a class="link" href="zeta.html#math_toolkit.special.zetas.zeta.testing">Testing</a>
 </h5>

@@ -249,7 +249,7 @@
 check.
 
<a name="math_toolkit.special.zetas.zeta.implementation"></a><h5>
-<a name="id1213305"></a>
+<a name="id1272383"></a>
 <a class="link" href="zeta.html#math_toolkit.special.zetas.zeta.implementation">Implementation</a>
 </h5>

@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/math_toolkit/status/compilers.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/status/compilers.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/status/compilers.html 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -37,7 +37,7 @@

 
<div class="table">
-<a name="id1358428"></a>Table 55. Supported/Tested Compilers
+<a name="math_toolkit.status.compilers.supported_tested_compilers"></a>Table 55. Supported/Tested Compilers
<div class="table-contents"><table class="table" summary="Supported/Tested Compilers">
<colgroup>
<col>
@@ -549,7 +549,7 @@
 
 
<div class="table">
-<a name="id1362511"></a>Table 56. Unsupported Compilers
+<a name="math_toolkit.status.compilers.unsupported_compilers"></a>Table 56. Unsupported Compilers
<div class="table-contents"><table class="table" summary="Unsupported Compilers">
<colgroup>
<col>
@@ -623,9 +623,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -63,6 +63,10 @@
 threatened to implement some multivariate distributions).
 

+ Thomas Mang requested the inverse gamma in chi squared distributions for
+ Bayesian applications and helped in their implementation.
+ 
+
 Professor Nico Temme for advice on the inverse incomplete beta function.
 

@@ -76,6 +80,11 @@
 several new features en route.
 

+ 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
+ MathWorld</a>, an invaluable resource.
+ 
+
 Plots of the functions and distributions were prepared in W3C
 standard Scalable Vector Graphic (SVG)
 format using a program created by Jacob Voytko during a <a href="http://code.google.com/soc/2007/" target="_top">Google
@@ -94,9 +103,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -27,10 +27,32 @@
<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>

+ <a name="math_toolkit.status.history1.boost_1_45_0"></a>
+ 
+<h5>
+<a name="id1422470"></a>
+ <a class="link" href="history1.html#math_toolkit.status.history1.boost_1_45_0">Boost-1.45.0</a>
+ </h5>
+
+ 
+<div class="itemizedlist"><ul type="disc">
+<li>
+ Added warnings about potential ambiguity with std random library in
+ distribution and function names.
+ </li>
+<li>
+ Added inverse gamma distribution and inverse chi_square and scaled
+ inverse chi_square.
+ </li>
+<li>
+ Editorial revision of documentation, and added FAQ.
+ </li>
+</ul></div>
+
 <a name="math_toolkit.status.history1.boost_1_44_0"></a>
 
<h5>
-<a name="id1357801"></a>
+<a name="id1422508"></a>
 <a class="link" href="history1.html#math_toolkit.status.history1.boost_1_44_0">Boost-1.44.0</a>
 </h5>

@@ -49,20 +71,20 @@
 <a name="math_toolkit.status.history1.boost_1_41_0"></a>
 
<h5>
-<a name="id1357832"></a>
+<a name="id1422539"></a>
 <a class="link" href="history1.html#math_toolkit.status.history1.boost_1_41_0">Boost-1.41.0</a>
 </h5>

 
<div class="itemizedlist"><ul type="disc"><li>
 Significantly improved performance for the incomplete gamma function
- and it's inverse.
+ and its inverse.
 </li></ul></div>

 <a name="math_toolkit.status.history1.boost_1_40_0"></a>
 
<h5>
-<a name="id1357856"></a>
+<a name="id1422563"></a>
 <a class="link" href="history1.html#math_toolkit.status.history1.boost_1_40_0">Boost-1.40.0</a>
 </h5>

@@ -104,7 +126,7 @@
 <a name="math_toolkit.status.history1.boost_1_38_0"></a>
 
<h5>
-<a name="id1357945"></a>
+<a name="id1422652"></a>
 <a class="link" href="history1.html#math_toolkit.status.history1.boost_1_38_0">Boost-1.38.0</a>
 </h5>

@@ -122,7 +144,7 @@
 <a name="math_toolkit.status.history1.boost_1_37_0"></a>
 
<h5>
-<a name="id1357981"></a>
+<a name="id1422688"></a>
 <a class="link" href="history1.html#math_toolkit.status.history1.boost_1_37_0">Boost-1.37.0</a>
 </h5>

@@ -134,7 +156,7 @@
 <a name="math_toolkit.status.history1.boost_1_36_0"></a>
 
<h5>
-<a name="id1358005"></a>
+<a name="id1422712"></a>
 <a class="link" href="history1.html#math_toolkit.status.history1.boost_1_36_0">Boost-1.36.0</a>
 </h5>

@@ -172,7 +194,7 @@
 <a name="math_toolkit.status.history1.boost_1_35_0__post_review_first_official_release"></a>
 
<h5>
-<a name="id1358090"></a>
+<a name="id1422797"></a>
 <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>
@@ -210,7 +232,7 @@
 <a name="math_toolkit.status.history1.milestone_4__second_review_candidate__1st_march_2007_"></a>
 
<h5>
-<a name="id1358177"></a>
+<a name="id1422884"></a>
 <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>
@@ -229,7 +251,7 @@
 <a name="math_toolkit.status.history1.milestone_3__first_review_candidate__31st_dec_2006_"></a>
 
<h5>
-<a name="id1358209"></a>
+<a name="id1422916"></a>
 <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>
@@ -262,7 +284,7 @@
 <a name="math_toolkit.status.history1.milestone_2__released_september_10th_2006"></a>
 
<h5>
-<a name="id1358272"></a>
+<a name="id1422979"></a>
 <a class="link" href="history1.html#math_toolkit.status.history1.milestone_2__released_september_10th_2006">Milestone
 2: Released September 10th 2006</a>
 </h5>
@@ -303,7 +325,7 @@
 <a name="math_toolkit.status.history1.milestone_1__released_march_31st_2006"></a>
 
<h5>
-<a name="id1358353"></a>
+<a name="id1423060"></a>
 <a class="link" href="history1.html#math_toolkit.status.history1.milestone_1__released_march_31st_2006">Milestone
 1: Released March 31st 2006</a>
 </h5>
@@ -338,16 +360,16 @@

 

- Sandbox and trunk last synchonised at revision: 56669.
+ Sandbox and trunk last synchonised at revision: .
 

 
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -43,7 +43,7 @@
 with it.
 
<a name="math_toolkit.status.issues.tgamma"></a><h5>
-<a name="id1362643"></a>
+<a name="id1424553"></a>
 <a class="link" href="issues.html#math_toolkit.status.issues.tgamma">tgamma</a>
 </h5>
<div class="itemizedlist"><ul type="disc"><li>
@@ -51,7 +51,7 @@
 be optimized any further? (low priority)
 </li></ul></div>
<a name="math_toolkit.status.issues.incomplete_beta"></a><h5>
-<a name="id1362671"></a>
+<a name="id1424582"></a>
 <a class="link" href="issues.html#math_toolkit.status.issues.incomplete_beta">Incomplete Beta</a>
 </h5>
<div class="itemizedlist"><ul type="disc"><li>
@@ -59,7 +59,7 @@
 b (medium priority).
 </li></ul></div>
<a name="math_toolkit.status.issues.inverse_gamma"></a><h5>
-<a name="id1362695"></a>
+<a name="id1424606"></a>
 <a class="link" href="issues.html#math_toolkit.status.issues.inverse_gamma">Inverse Gamma</a>
 </h5>
<div class="itemizedlist"><ul type="disc"><li>
@@ -67,7 +67,7 @@
 is good enough (Medium Priority).
 </li></ul></div>
<a name="math_toolkit.status.issues.polynomials"></a><h5>
-<a name="id1362719"></a>
+<a name="id1424630"></a>
 <a class="link" href="issues.html#math_toolkit.status.issues.polynomials">Polynomials</a>
 </h5>
<div class="itemizedlist"><ul type="disc"><li>
@@ -77,7 +77,7 @@
 not (Low Priority).
 </li></ul></div>
<a name="math_toolkit.status.issues.elliptic_integrals"></a><h5>
-<a name="id1362743"></a>
+<a name="id1424654"></a>
 <a class="link" href="issues.html#math_toolkit.status.issues.elliptic_integrals">Elliptic Integrals</a>
 </h5>
<div class="itemizedlist"><ul type="disc">
@@ -130,7 +130,7 @@
 </li>
</ul></div>
<a name="math_toolkit.status.issues.inverse_hyperbolic_functions"></a><h5>
-<a name="id1362874"></a>
+<a name="id1424785"></a>
 <a class="link" href="issues.html#math_toolkit.status.issues.inverse_hyperbolic_functions">Inverse
 Hyperbolic Functions</a>
 </h5>
@@ -140,7 +140,7 @@
 This is probably only an issue for very high precision types (Low Priority).
 </li></ul></div>
<a name="math_toolkit.status.issues.statistical_distributions"></a><h5>
-<a name="id1362903"></a>
+<a name="id1424814"></a>
 <a class="link" href="issues.html#math_toolkit.status.issues.statistical_distributions">Statistical
 distributions</a>
 </h5>
@@ -149,7 +149,7 @@
 for very large degrees of freedom?
 </li></ul></div>
<a name="math_toolkit.status.issues.feature_requests"></a><h5>
-<a name="id1362927"></a>
+<a name="id1424838"></a>
 <a class="link" href="issues.html#math_toolkit.status.issues.feature_requests">Feature Requests</a>
 </h5>

@@ -1098,38 +1098,6 @@
<tr>
<td>
 
- Laplace
- 
- </td>
-<td>
- 
- -
- 
- </td>
-<td>
- 
- -
- 
- </td>
-<td>
- 
- -
- 
- </td>
-<td>
- 
- X
- 
- </td>
-<td>
- 
- -
- 
- </td>
-</tr>
-<tr>
-<td>
- 
 Semicircular
 
 </td>
@@ -1278,9 +1246,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -44,6 +44,7 @@
 Without Derivatives</a></dt>
<dt><a href="toolkit/internals1/minima.html"> Locating Function
 Minima</a></dt>
+<dt> Tuples</dt>
</dl></dd>
<dt> Testing and Development</dt>
<dd><dl>
@@ -59,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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -41,13 +41,14 @@
 Without Derivatives</a></dt>
<dt><a href="internals1/minima.html"> Locating Function
 Minima</a></dt>
+<dt> Tuples</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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -28,7 +28,7 @@
 Evaluation</a>
</h4></div></div></div>
<a name="math_toolkit.toolkit.internals1.cf.synopsis"></a><h5>
-<a name="id1264812"></a>
+<a name="id1324006"></a>
 <a class="link" href="cf.html#math_toolkit.toolkit.internals1.cf.synopsis">Synopsis</a>
 </h5>

@@ -78,7 +78,7 @@
}}} // namespaces
</pre>
<a name="math_toolkit.toolkit.internals1.cf.description"></a><h5>
-<a name="id1265843"></a>
+<a name="id1325037"></a>
 <a class="link" href="cf.html#math_toolkit.toolkit.internals1.cf.description">Description</a>
 </h5>

@@ -178,7 +178,7 @@
 a continued fraction for convergence.
 
<a name="math_toolkit.toolkit.internals1.cf.implementation"></a><h5>
-<a name="id1266054"></a>
+<a name="id1325248"></a>
 <a class="link" href="cf.html#math_toolkit.toolkit.internals1.cf.implementation">Implementation</a>
 </h5>

@@ -188,7 +188,7 @@
 Lentz, W.J. 1976, Applied Optics, vol. 15, pp. 668-671.
 
<a name="math_toolkit.toolkit.internals1.cf.examples"></a><h5>
-<a name="id1266071"></a>
+<a name="id1325265"></a>
 <a class="link" href="cf.html#math_toolkit.toolkit.internals1.cf.examples">Examples</a>
 </h5>

@@ -271,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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/math_toolkit/toolkit/internals1/constants.html
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/constants.html (original)
+++ branches/release/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/constants.html 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -28,7 +28,7 @@
 Constants</a>
</h4></div></div></div>
<a name="math_toolkit.toolkit.internals1.constants.synopsis"></a><h5>
-<a name="id1260122"></a>
+<a name="id1319931"></a>
 <a class="link" href="constants.html#math_toolkit.toolkit.internals1.constants.synopsis">Synopsis</a>
 </h5>

@@ -59,7 +59,7 @@
}}} // namespaces
</pre>
<a name="math_toolkit.toolkit.internals1.constants.description"></a><h5>
-<a name="id1260762"></a>
+<a name="id1320571"></a>
 <a class="link" href="constants.html#math_toolkit.toolkit.internals1.constants.description">Description</a>
 </h5>

@@ -368,9 +368,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -7,7 +7,7 @@
<link rel="home" href="../../../index.html" title="Math Toolkit">
<link rel="up" href="../internals1.html" title="Reused Utilities">
<link rel="prev" href="roots2.html" title="Root Finding Without Derivatives">
-<link rel="next" href="../internals2.html" title="Testing and Development">
+<link rel="next" href="tuples.html" title="Tuples">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
@@ -20,7 +20,7 @@
</tr></table>
<hr>
<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="../internals2.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
+<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" lang="en">
<div class="titlepage"><div><div><h4 class="title">
@@ -28,7 +28,7 @@
 Minima</a>
</h4></div></div></div>
<a name="math_toolkit.toolkit.internals1.minima.synopsis"></a><h5>
-<a name="id1281935"></a>
+<a name="id1342060"></a>
 <a class="link" href="minima.html#math_toolkit.toolkit.internals1.minima.synopsis">synopsis</a>
 </h5>

@@ -45,7 +45,7 @@
std::pair<T, T> brent_find_minima(F f, T min, T max, int bits, boost::uintmax_t& max_iter);
</pre>
<a name="math_toolkit.toolkit.internals1.minima.description"></a><h5>
-<a name="id1282281"></a>
+<a name="id1342543"></a>
 <a class="link" href="minima.html#math_toolkit.toolkit.internals1.minima.description">Description</a>
 </h5>

@@ -89,7 +89,7 @@
 the abscissa at the minima and the value of f(x) at the minima.
 
<a name="math_toolkit.toolkit.internals1.minima.implementation"></a><h5>
-<a name="id1282392"></a>
+<a name="id1342654"></a>
 <a class="link" href="minima.html#math_toolkit.toolkit.internals1.minima.implementation">Implementation</a>
 </h5>

@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the Boost Software License, Version 1.0. (See accompanying
 file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
@@ -122,7 +122,7 @@
</tr></table>
<hr>
<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="../internals2.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
+<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>
</body>
</html>

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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -28,7 +28,7 @@
 and Rational Function Evaluation</a>
</h4></div></div></div>
<a name="math_toolkit.toolkit.internals1.rational.synopsis"></a><h5>
-<a name="id1266798"></a>
+<a name="id1325992"></a>
 <a class="link" href="rational.html#math_toolkit.toolkit.internals1.rational.synopsis">synopsis</a>
 </h5>

@@ -79,7 +79,7 @@
V evaluate_rational(const T* num, const U* denom, V z, unsigned count);
</pre>
<a name="math_toolkit.toolkit.internals1.rational.description"></a><h5>
-<a name="id1268383"></a>
+<a name="id1328669"></a>
 <a class="link" href="rational.html#math_toolkit.toolkit.internals1.rational.description">Description</a>
 </h5>

@@ -193,7 +193,7 @@
 evaluation with compile-time array sizes may offer slightly better performance.
 
<a name="math_toolkit.toolkit.internals1.rational.implementation"></a><h5>
-<a name="id1271314"></a>
+<a name="id1331055"></a>
 <a class="link" href="rational.html#math_toolkit.toolkit.internals1.rational.implementation">Implementation</a>
 </h5>

@@ -222,9 +222,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -28,7 +28,7 @@
 With Derivatives</a>
</h4></div></div></div>
<a name="math_toolkit.toolkit.internals1.roots.synopsis"></a><h5>
-<a name="id1271377"></a>
+<a name="id1331117"></a>
 <a class="link" href="roots.html#math_toolkit.toolkit.internals1.roots.synopsis">Synopsis</a>
 </h5>

@@ -61,7 +61,7 @@
}}} // namespaces
</pre>
<a name="math_toolkit.toolkit.internals1.roots.description"></a><h5>
-<a name="id1272243"></a>
+<a name="id1331984"></a>
 <a class="link" href="roots.html#math_toolkit.toolkit.internals1.roots.description">Description</a>
 </h5>

@@ -82,17 +82,17 @@
<dd>

 Type F must be a callable function object that accepts one parameter
- and returns a tuple:
+ and returns a <a class="link" href="tuples.html" title="Tuples">boost::math::tuple</a>:
 

- For the second order iterative methods (Newton Raphson) the tuple
+ For the second order iterative methods (Newton Raphson) the <a class="link" href="tuples.html" title="Tuples">boost::math::tuple</a>
 should have two elements containing the evaluation of the function
 and it's first derivative.
 

- For the third order methods (Halley and Schroeder) the tuple should
- have three elements containing the evaluation of the function and
- its first and second derivatives.
+ For the third order methods (Halley and Schroeder) the <a class="link" href="tuples.html" title="Tuples">boost::math::tuple</a>
+ should have three elements containing the evaluation of the function
+ and its first and second derivatives.
 
</dd>
<dt>T guess</dt>
@@ -176,7 +176,7 @@
<a name="newton"></a>
 
<a name="math_toolkit.toolkit.internals1.roots.newton_raphson_method"></a><h5>
-<a name="id1273025"></a>
+<a name="id1332233"></a>
 <a class="link" href="roots.html#math_toolkit.toolkit.internals1.roots.newton_raphson_method">Newton
 Raphson Method</a>
 </h5>
@@ -196,7 +196,7 @@
<a name="halley"></a>
 
<a name="math_toolkit.toolkit.internals1.roots.halley_s_method"></a><h5>
-<a name="id1273083"></a>
+<a name="id1332291"></a>
 <a class="link" href="roots.html#math_toolkit.toolkit.internals1.roots.halley_s_method">Halley's
 Method</a>
 </h5>
@@ -220,7 +220,7 @@
<a name="schroeder"></a>
 
<a name="math_toolkit.toolkit.internals1.roots.schroeder_s_method"></a><h5>
-<a name="id1273144"></a>
+<a name="id1332352"></a>
 <a class="link" href="roots.html#math_toolkit.toolkit.internals1.roots.schroeder_s_method">Schroeder's
 Method</a>
 </h5>
@@ -244,7 +244,7 @@
 iteration.
 
<a name="math_toolkit.toolkit.internals1.roots.example"></a><h5>
-<a name="id1273198"></a>
+<a name="id1332406"></a>
 <a class="link" href="roots.html#math_toolkit.toolkit.internals1.roots.example">Example</a>
 </h5>

@@ -263,7 +263,7 @@
struct cbrt_functor
{
 cbrt_functor(T const& target) : a(target){}
- std::tr1::tuple<T, T> operator()(T const& z)
+ <a class="link" href="tuples.html" title="Tuples">boost::math::tuple</a><T, T> operator()(T const& z)
 {
 T sqr = z * z;
 return std::tr1::make_tuple(sqr * z - a, 3 * sqr);
@@ -316,7 +316,7 @@
struct cbrt_functor
{
 cbrt_functor(T const& target) : a(target){}
- std::tr1::tuple<T, T, T> operator()(T const& z)
+ <a class="link" href="tuples.html" title="Tuples">boost::math::tuple</a><T, T, T> operator()(T const& z)
 {
 T sqr = z * z;
 return std::tr1::make_tuple(sqr * z - a, 3 * sqr, 6 * z);
@@ -369,9 +369,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -28,7 +28,7 @@
 Without Derivatives</a>
</h4></div></div></div>
<a name="math_toolkit.toolkit.internals1.roots2.synopsis"></a><h5>
-<a name="id1274748"></a>
+<a name="id1335589"></a>
 <a class="link" href="roots2.html#math_toolkit.toolkit.internals1.roots2.synopsis">Synopsis</a>
 </h5>

@@ -141,7 +141,7 @@
}}} // namespaces
</pre>
<a name="math_toolkit.toolkit.internals1.roots2.description"></a><h5>
-<a name="id1276779"></a>
+<a name="id1337587"></a>
 <a class="link" href="roots2.html#math_toolkit.toolkit.internals1.roots2.description">Description</a>
 </h5>

@@ -561,7 +561,7 @@
 as soon as both ends of the interval round to the same nearest integer.
 
<a name="math_toolkit.toolkit.internals1.roots2.implementation"></a><h5>
-<a name="id1281897"></a>
+<a name="id1342022"></a>
 <a class="link" href="roots2.html#math_toolkit.toolkit.internals1.roots2.implementation">Implementation</a>
 </h5>

@@ -579,9 +579,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -28,7 +28,7 @@
 Series Evaluation</a>
</h4></div></div></div>
<a name="math_toolkit.toolkit.internals1.series_evaluation.synopsis"></a><h5>
-<a name="id1261398"></a>
+<a name="id1321207"></a>
 <a class="link" href="series_evaluation.html#math_toolkit.toolkit.internals1.series_evaluation.synopsis">Synopsis</a>
 </h5>

@@ -70,7 +70,7 @@
}}} // namespaces
</pre>
<a name="math_toolkit.toolkit.internals1.series_evaluation.description"></a><h5>
-<a name="id1262410"></a>
+<a name="id1323311"></a>
 <a class="link" href="series_evaluation.html#math_toolkit.toolkit.internals1.series_evaluation.description">Description</a>
 </h5>

@@ -127,7 +127,7 @@
 summation in this way.
 
<a name="math_toolkit.toolkit.internals1.series_evaluation.example"></a><h5>
-<a name="id1262508"></a>
+<a name="id1323410"></a>
 <a class="link" href="series_evaluation.html#math_toolkit.toolkit.internals1.series_evaluation.example">Example</a>
 </h5>

@@ -186,9 +186,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -6,7 +6,7 @@
<meta name="generator" content="DocBook XSL Stylesheets V1.74.0">
<link rel="home" href="../../index.html" title="Math Toolkit">
<link rel="up" href="../toolkit.html" title="Internal Details and Tools (Experimental)">
-<link rel="prev" href="internals1/minima.html" title="Locating Function Minima">
+<link rel="prev" href="internals1/tuples.html" title="Tuples">
<link rel="next" href="internals2/polynomials.html" title="Polynomials">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
@@ -20,7 +20,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="internals1/minima.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>
+<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" lang="en">
<div class="titlepage"><div><div><h3 class="title">
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the Boost Software License, Version 1.0. (See accompanying
 file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
@@ -48,7 +48,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="internals1/minima.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>
+<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>
</body>
</html>

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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -28,7 +28,7 @@
 Error and Testing</a>
</h4></div></div></div>
<a name="math_toolkit.toolkit.internals2.error_test.synopsis"></a><h5>
-<a name="id1286504"></a>
+<a name="id1346569"></a>
 <a class="link" href="error_test.html#math_toolkit.toolkit.internals2.error_test.synopsis">Synopsis</a>
 </h5>

@@ -45,7 +45,7 @@
test_result<see-below> test(const A& a, F1 test_func, F2 expect_func);
</pre>
<a name="math_toolkit.toolkit.internals2.error_test.description"></a><h5>
-<a name="id1287488"></a>
+<a name="id1346825"></a>
 <a class="link" href="error_test.html#math_toolkit.toolkit.internals2.error_test.description">Description</a>
 </h5>
<pre class="programlisting">template <class T>
@@ -157,7 +157,7 @@
 is mainly a debugging/development aid (and a good place for a breakpoint).
 
<a name="math_toolkit.toolkit.internals2.error_test.example"></a><h5>
-<a name="id1288212"></a>
+<a name="id1350308"></a>
 <a class="link" href="error_test.html#math_toolkit.toolkit.internals2.error_test.example">Example</a>
 </h5>

@@ -212,9 +212,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -43,9 +43,9 @@
 to achieve.
 

- Unless you already familar with the Remez method you should first read
+ Unless you already familar with the Remez method, you should first read
 the <a class="link" href="../../backgrounders/remez.html" title="The Remez Method">brief background article
- explaining the principals behind the Remez algorithm</a>.
+ explaining the principles behind the Remez algorithm</a>.
 

 The program consists of two parts:
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -27,7 +27,7 @@
<a name="math_toolkit.toolkit.internals2.polynomials"></a><a class="link" href="polynomials.html" title="Polynomials"> Polynomials</a>
</h4></div></div></div>
<a name="math_toolkit.toolkit.internals2.polynomials.synopsis"></a><h5>
-<a name="id1282441"></a>
+<a name="id1342899"></a>
 <a class="link" href="polynomials.html#math_toolkit.toolkit.internals2.polynomials.synopsis">Synopsis</a>
 </h5>

@@ -103,7 +103,7 @@
}}} // namespaces
</pre>
<a name="math_toolkit.toolkit.internals2.polynomials.description"></a><h5>
-<a name="id1285592"></a>
+<a name="id1345657"></a>
 <a class="link" href="polynomials.html#math_toolkit.toolkit.internals2.polynomials.description">Description</a>
 </h5>

@@ -122,9 +122,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -46,7 +46,7 @@
 </li>
</ul></div>
<a name="math_toolkit.toolkit.internals2.test_data.synopsis"></a><h5>
-<a name="id1289014"></a>
+<a name="id1351111"></a>
 <a class="link" href="test_data.html#math_toolkit.toolkit.internals2.test_data.synopsis">Synopsis</a>
 </h5>
<pre class="programlisting">namespace boost{ namespace math{ namespace tools{
@@ -147,7 +147,7 @@
}}} // namespaces
</pre>
<a name="math_toolkit.toolkit.internals2.test_data.description"></a><h5>
-<a name="id1292274"></a>
+<a name="id1353347"></a>
 <a class="link" href="test_data.html#math_toolkit.toolkit.internals2.test_data.description">Description</a>
 </h5>

@@ -177,7 +177,7 @@
 </li>
</ul></div>
<a name="math_toolkit.toolkit.internals2.test_data.example_1__output_data_for_graph_plotting"></a><h6>
-<a name="id1292331"></a>
+<a name="id1353403"></a>
 <a class="link" href="test_data.html#math_toolkit.toolkit.internals2.test_data.example_1__output_data_for_graph_plotting">Example
 1: Output Data for Graph Plotting</a>
 </h6>
@@ -211,7 +211,7 @@
 <img src="../../../../graphs/lgamma.png" align="middle">
 
<a name="math_toolkit.toolkit.internals2.test_data.example_2__creating_test_data"></a><h6>
-<a name="id1292735"></a>
+<a name="id1353808"></a>
 <a class="link" href="test_data.html#math_toolkit.toolkit.internals2.test_data.example_2__creating_test_data">Example
 2: Creating Test Data</a>
 </h6>
@@ -347,8 +347,9 @@

 The first two values in each row are the input parameters that were passed
 to our functor and the last value is the return value from the functor.
- Had our functor returned a tuple rather than a value, then we would have
- had one entry for each element in the tuple in addition to the input parameters.
+ Had our functor returned a <a class="link" href="../internals1/tuples.html" title="Tuples">boost::math::tuple</a>
+ rather than a value, then we would have had one entry for each element
+ in the tuple in addition to the input parameters.
 

 The first #define serves two purposes:
@@ -375,7 +376,7 @@
 used by default as it's rather hard on the compiler when the table is large.
 
<a name="math_toolkit.toolkit.internals2.test_data.example_3__profiling_a_continued_fraction_for_convergence_and_accuracy"></a><h6>
-<a name="id1296556"></a>
+<a name="id1356729"></a>
 <a class="link" href="test_data.html#math_toolkit.toolkit.internals2.test_data.example_3__profiling_a_continued_fraction_for_convergence_and_accuracy">Example
 3: Profiling a Continued Fraction for Convergence and Accuracy</a>
 </h6>
@@ -409,7 +410,7 @@
</pre>

 We want to measure both the relative error, and the rate of convergence
- of this fraction, so we'll write a functor that returns both as a tuple:
+ of this fraction, so we'll write a functor that returns both as a <a class="link" href="../internals1/tuples.html" title="Tuples">boost::math::tuple</a>:
 class test_data will unpack the tuple for us, and create one column of
 data for each element in the tuple (in addition to the input parameters):
 
@@ -417,12 +418,12 @@
#include <boost/math/tools/test.hpp>
#include <boost/math/special_functions/gamma.hpp>
#include <boost/math/tools/ntl.hpp>
-#include <boost/tr1/tuple.hpp>
+#include <boost/math/tools/tuple.hpp>

template <class T>
struct profile_gamma_fraction
{
- typedef std::tr1::tuple<T, T> result_type;
+ typedef <a class="link" href="../internals1/tuples.html" title="Tuples">boost::math::tuple</a><T, T> result_type;

 result_type operator()(T val)
 {
@@ -443,7 +444,7 @@
 T err = real_cast<T>(relative_error(true_val, NTL::RR(found_val)) / std::numeric_limits<T>::epsilon());
 //
 // now just return the results as a tuple:
- return std::tr1::make_tuple(err, iters);
+ return boost::math::make_tuple(err, iters);
 }
};
</pre>
@@ -481,7 +482,7 @@
 of a and z.
 
<a name="math_toolkit.toolkit.internals2.test_data.reference"></a><h5>
-<a name="id1298229"></a>
+<a name="id1359138"></a>
 <a class="link" href="test_data.html#math_toolkit.toolkit.internals2.test_data.reference">reference</a>
 </h5>
<a name="test_data_reference"></a>
@@ -534,9 +535,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -163,9 +163,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -42,7 +42,7 @@
 behaves just like a built in floating point type.
 
<a name="math_toolkit.using_udt.concepts.basic_arithmetic_requirements"></a><h5>
-<a name="id1299282"></a>
+<a name="id1360191"></a>
 <a class="link" href="concepts.html#math_toolkit.using_udt.concepts.basic_arithmetic_requirements">Basic
 Arithmetic Requirements</a>
 </h5>
@@ -1035,7 +1035,7 @@
</td></tr>
</table></div>
<a name="math_toolkit.using_udt.concepts.standard_library_support_requirements"></a><h5>
-<a name="id1303785"></a>
+<a name="id1362782"></a>
 <a class="link" href="concepts.html#math_toolkit.using_udt.concepts.standard_library_support_requirements">Standard
 Library Support Requirements</a>
 </h5>
@@ -1350,9 +1350,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -382,9 +382,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -54,9 +54,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -28,7 +28,7 @@
 Infinities and NaN's</a>
</h3></div></div></div>
<a name="math_toolkit.utils.fpclass.synopsis"></a><h5>
-<a name="id1228805"></a>
+<a name="id1288136"></a>
 <a class="link" href="fpclass.html#math_toolkit.utils.fpclass.synopsis">Synopsis</a>
 </h5>
<pre class="programlisting">#define FP_ZERO /* implementation specific value */
@@ -58,7 +58,7 @@
 to use these functions.
 
<a name="math_toolkit.utils.fpclass.description"></a><h5>
-<a name="id1230289"></a>
+<a name="id1288527"></a>
 <a class="link" href="fpclass.html#math_toolkit.utils.fpclass.description">Description</a>
 </h5>

@@ -85,7 +85,7 @@
// it works for any type that has numeric_limits support for type z:
(isnan)(z);
//
-// As above but with namespace qualification.
+// As above but with explicit namespace qualification.
(boost::math::isnan)(z);
//
// This will cause a compiler error if isnan is a native macro:
@@ -93,7 +93,7 @@
// So always use instead:
(boost::math::isnan)(z);
//
-// You can also add a using statment,
+// You can also add a using statement,
// globally to a .cpp file, or to a local function in a .hpp file.
using boost::math::isnan;
// so you can write the shorter and less cluttered
@@ -219,9 +219,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -32,7 +32,7 @@
 number of ULP.
 
<a name="math_toolkit.utils.next_float.float_advance.synopsis"></a><h5>
-<a name="id1233115"></a>
+<a name="id1292992"></a>
 <a class="link" href="float_advance.html#math_toolkit.utils.next_float.float_advance.synopsis">Synopsis</a>
 </h5>

@@ -50,7 +50,7 @@
}} // namespaces
</pre>
<a name="math_toolkit.utils.next_float.float_advance.description___float_advance"></a><h5>
-<a name="id1233279"></a>
+<a name="id1293156"></a>
 <a class="link" href="float_advance.html#math_toolkit.utils.next_float.float_advance.description___float_advance">Description
 - float_advance</a>
 </h5>
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -34,7 +34,7 @@
 different.
 
<a name="math_toolkit.utils.next_float.float_distance.synopsis"></a><h5>
-<a name="id1232744"></a>
+<a name="id1292074"></a>
 <a class="link" href="float_distance.html#math_toolkit.utils.next_float.float_distance.synopsis">Synopsis</a>
 </h5>

@@ -52,7 +52,7 @@
}} // namespaces
</pre>
<a name="math_toolkit.utils.next_float.float_distance.description___float_distance"></a><h5>
-<a name="id1232908"></a>
+<a name="id1292785"></a>
 <a class="link" href="float_distance.html#math_toolkit.utils.next_float.float_distance.description___float_distance">Description
 - float_distance</a>
 </h5>
@@ -95,9 +95,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -28,7 +28,7 @@
 the Next Greater Representable Value (float_next)</a>
</h4></div></div></div>
<a name="math_toolkit.utils.next_float.float_next.synopsis"></a><h5>
-<a name="id1232229"></a>
+<a name="id1291559"></a>
 <a class="link" href="float_next.html#math_toolkit.utils.next_float.float_next.synopsis">Synopsis</a>
 </h5>

@@ -46,7 +46,7 @@
}} // namespaces
</pre>
<a name="math_toolkit.utils.next_float.float_next.description___float_next"></a><h5>
-<a name="id1232380"></a>
+<a name="id1291711"></a>
 <a class="link" href="float_next.html#math_toolkit.utils.next_float.float_next.description___float_next">Description
 - float_next</a>
 </h5>
@@ -63,9 +63,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -28,7 +28,7 @@
 the Next Smaller Representable Value (float_prior)</a>
</h4></div></div></div>
<a name="math_toolkit.utils.next_float.float_prior.synopsis"></a><h5>
-<a name="id1232481"></a>
+<a name="id1291811"></a>
 <a class="link" href="float_prior.html#math_toolkit.utils.next_float.float_prior.synopsis">Synopsis</a>
 </h5>

@@ -46,7 +46,7 @@
}} // namespaces
</pre>
<a name="math_toolkit.utils.next_float.float_prior.description___float_prior"></a><h5>
-<a name="id1232632"></a>
+<a name="id1291963"></a>
 <a class="link" href="float_prior.html#math_toolkit.utils.next_float.float_prior.description___float_prior">Description
 - float_prior</a>
 </h5>
@@ -63,9 +63,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -28,7 +28,7 @@
 Next Representable Value in a Specific Direction (nextafter)</a>
</h4></div></div></div>
<a name="math_toolkit.utils.next_float.nextafter.synopsis"></a><h5>
-<a name="id1231693"></a>
+<a name="id1291033"></a>
 <a class="link" href="nextafter.html#math_toolkit.utils.next_float.nextafter.synopsis">Synopsis</a>
 </h5>

@@ -46,7 +46,7 @@
}} // namespaces
</pre>
<a name="math_toolkit.utils.next_float.nextafter.description___nextafter"></a><h5>
-<a name="id1231860"></a>
+<a name="id1291199"></a>
 <a class="link" href="nextafter.html#math_toolkit.utils.next_float.nextafter.description___nextafter">Description
 - nextafter</a>
 </h5>
@@ -76,7 +76,7 @@
 returns an <a class="link" href="../../main_overview/error_handling.html#overflow_error">overflow_error</a>.
 
<a name="math_toolkit.utils.next_float.nextafter.examples___nextafter"></a><h5>
-<a name="id1231945"></a>
+<a name="id1291285"></a>
 <a class="link" href="nextafter.html#math_toolkit.utils.next_float.nextafter.examples___nextafter">Examples
 - nextafter</a>
 </h5>
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -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 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -28,7 +28,7 @@
 Functions</a>
</h3></div></div></div>
<a name="math_toolkit.utils.sign_functions.synopsis"></a><h5>
-<a name="id1231038"></a>
+<a name="id1290377"></a>
 <a class="link" href="sign_functions.html#math_toolkit.utils.sign_functions.synopsis">Synopsis</a>
 </h5>

@@ -52,7 +52,7 @@
}} // namespaces
</pre>
<a name="math_toolkit.utils.sign_functions.description"></a><h5>
-<a name="id1231332"></a>
+<a name="id1290671"></a>
 <a class="link" href="sign_functions.html#math_toolkit.utils.sign_functions.description">Description</a>
 </h5>
<pre class="programlisting">template<class T>
@@ -82,9 +82,9 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009 John Maddock, Paul A. Bristow,
- Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani
- and Thijs van den Berg
+<td align="right"><div class="copyright-footer">Copyright © 2006 , 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow,
+ Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
+ Thijs van den Berg
 Distributed under the 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/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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,17 +1,22 @@
-[/ Symbols and Greek letters (about 120) from HTML4 ]
+[/ Symbols and Greek letters (about 120) from HTML4.]
[/ File HTML4_symbols.qbk]
[/ See http://www.htmlhelp.com/reference/html40/entities/symbols.html]
+[/ See also http://en.wikipedia.org/wiki/List_of_XML_and_HTML_character_entity_references]
[/ http://www.alanwood.net/demos/ent4_frame.html]
+[/ http://www.unicode.org/charts/PDF/U2200.pdf and others]
[/ All (except 2 angle brackets) show OK on Firefox 2.0]

[/ See also Latin-1 aka Western (ISO-8859-1) in latin1_symbols.qbk]
[/ http://www.htmlhelp.com/reference/html40/entities/latin1.html]
+[/Unicode Latin extended http://www.unicode.org/charts/U0080.pdf]

[/ Also some miscellaneous math charaters added to this list - see the end.]
+[/ For others see also math_symbols.qbk]

[/ To use, enclose the template name in square brackets.]

[template fnof[]'''ƒ'''] [/ ƒ Latin small f with hook = function = florin]
+[/ Capital Greek start with capital letter, lower case all small.]
[template Alpha[]'''Α'''] [/ ? Greek capital letter alpha]
[template Beta[]'''Β'''] [/ ? Greek capital letter beta]
[template Gamma[]'''Γ'''] [/ G Greek capital letter gamma]
@@ -135,13 +140,28 @@
[template clubs[]'''♣'''] [/ ? black club suit = shamrock]
[template hearts[]'''♥'''] [/ ? black heart suit = valentine]
[template diams[]'''♦'''] [/ ? black diamond suit]
+[template euro[]'''€'''] [/ ? Euro currency symbol]

[/ Other symbols, not in the HTML4 list:]
-[template space[]''' ''']
[template plusminus[]'''±'''] [/ ? plus or minus sign]
+[template space[] ''''''] [/ plain space]
+[template spaces[] '''ߐ'''] [/ spaces - but produces a funny symbol!]
+[template nbsp[] '''&#00A0;'''] [/ non-breaking space]
+[template narrownbsp[] '''&#202F;'''] [/ narrow non-breaking space]
+[template wordjoin[] '''ࠌ'''] [/ word joiner - no line break either side]
+
+[template sqrt[]'''√'''] [/ ? square root sqrt symbol]
+[/template pow2[]'''⁳'''] [/ 2073 is NOT superscript 2 character]
+[template pow2[]'''²'''] [/ superscript 2 character]
+[template pow3[]'''³'''] [/ superscript 3 character]
+[template pown[]'''ⁿ'''] [/ superscript n character]
+[template frac12[]'''½'''] [/ fraction half]
+[template frac14[]'''¼'''] [/ fraction quarter]
+[template frac34[]'''¾'''] [/ fraction three quarter]
+

[/
-Copyright 2007 Paul A. Bristow.
+Copyright 2007, 2010 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/implementation.qbk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/implementation.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/implementation.qbk 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -146,7 +146,7 @@

Functions that are not mathematically defined,
like the Cauchy mean, fail to compile by default.
-[link math_toolkit.policy.pol_ref.assert_undefined A policy]
+A [link math_toolkit.policy.pol_ref.assert_undefined policy]
allows control of this.

If the policy is to permit undefined functions, then calling them
@@ -167,12 +167,14 @@
[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 median approximation for distribution `dist` may be available from
+However a useful numerical approximation for distribution `dist`
+is available as usual as an accessor non-member function median using `median(dist)`,
+that may be evaluated (in the absence of an analytic formula) by calling

-`quantile(dist, 0.5)`.
+`quantile(dist, 0.5)` (this is the /mathematical/ definition of course).

[@http://www.amstat.org/publications/jse/v13n2/vonhippel.html Mean, Median, and Skew, Paul T von Hippel]

@@ -368,6 +370,9 @@
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,
+but the usual Intel X86 distribution uses 64-but doubles,
+so our use was limited to the 15 to 17 decimal digit accuracy.

A useful index of sources is:
[@http://www.sal.hut.fi/Teaching/Resources/ProbStat/table.html
@@ -391,6 +396,13 @@

[h4 Creating and Managing the Equations]

+Equations that fit on a single line can most easily be produced by inline Quickbook code
+using templates for Unicode Greek and Unicode Math symbols.
+All Greek letter and small set of Math symbols is available at
+/boost-path/libs/math/doc/sf_and_dist/html4_symbols.qbk
+
+Where equations need to use more than one line, real Math editors were used.
+
The primary source for the equations is now
[@http://www.w3.org/Math/ MathML]: see the
*.mml files in libs\/math\/doc\/sf_and_dist\/equations\/.
@@ -400,7 +412,7 @@
please note that the equation editor supplied with Open Office
currently mangles these files and should not currently be used.

-Convertion to SVG was achieved using
+Conversion to SVG was achieved using
[@http://www.grigoriev.ru/svgmath/ SVGMath] and a command line
such as:

@@ -411,6 +423,9 @@
>done
]

+See also the section on "Using Python to run Inkscape" and
+"Using inkscape to convert scalable vector SVG files to Portable Network graphic PNG".
+
Note that SVGMath requires that the mml files are *not* wrapped in an XHTML
XML wrapper - this is added by Mathcast by default - one workaround is to
copy an existing mml file and then edit it with Mathcast: the existing
@@ -560,16 +575,18 @@
process as the equations.

The programs
-/libs/math/doc/sf_and_dist/graphs/dist_graphs.cpp
-and /libs/math/doc/sf_and_dist/graphs/sf_graphs.cpp
+`/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
[@http://code.google.com/soc/2007/boost/about.html Google Summer of Code 2007]
-project of Jacob Voytko (whose work so far is at .\boost-sandbox\SOC\2007\visualization).
+project of Jacob Voytko (whose work so far,
+considerably enhanced and now reasonably mature and usable, by Paul A. Bristow,
+is at .\boost-sandbox\SOC\2007\visualization).

[endsect] [/section:implementation Implementation Notes]

[/
- Copyright 2006, 2007 John Maddock and Paul A. Bristow.
+ Copyright 2006, 2007, 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
   http://www.boost.org/LICENSE_1_0.txt).

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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -122,7 +122,6 @@
[[Double Gamma][-][-][-][X][-]]
[[Double Weibul][-][-][-][X][-]]
[[Hyperbolic Secant][-][-][-][X][-]]
-[[Laplace][-][-][-][X][-]]
[[Semicircular][-][-][-][X][-]]
[[Bradford][-][-][-][X][-]]
[[Birr / Fisk][-][-][-][X][-]]

Modified: branches/release/libs/math/doc/sf_and_dist/latin1_symbols.qbk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/latin1_symbols.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/latin1_symbols.qbk 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,10 +1,14 @@
-[/ Symbols and accented letters from Latin-1]
+[/ Symbols and accented letters from Latin-1]
[/ File Latin1_symbols.qbk]
[/ http://www.htmlhelp.com/reference/html40/entities/latin1.html ]
[/ based on table Copyright </copyright.html> 1998-2006 Liam Quinn.]
[/ Glyphs <http://www.unicode.org/charts/> of the characters ]
[/ are available at the Unicode Consortium <http://www.unicode.org/>. ]
+[/ To use these symbols in Quickbook: enclose template name in square brackets.]
+[/ See also Greek and math symbols in html4_symbols.qbk]

+[/ These are all 8th bit ANSI symbols. C1 controls and Latin-1 Supplement]
+[/ See http://www.unicode.org/charts/PDF/U0080.pdf]
[template nbsp[]''' '''] [/ no-break space = non-breaking space]
[template iexcl[]'''¡'''] [/ inverted exclamation mark ]
[template cent[]'''¢'''] [/ cent sign ]
@@ -99,11 +103,11 @@
[template ucirc[]'''û'''] [/ Latin small letter u with circumflex ]
[template uuml[]'''ü'''] [/ Latin small letter u with diaeresis ]
[template yacute[]'''ý'''] [/ Latin small letter y with acute ]
-[template thorn[]'''þ'''] [/ Latin small letter thorn ]
+[template thorn[]'''þ'''] [/ Latin small letter thorn ]
[template yuml[]'''ÿ'''] [/ Latin small letter y with diaeresis ]

[/ File Latin1_symbols.qbk
-Copyright 2007 Paul A. Bristow.
+Copyright 2007, 2010 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/license.qbk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/license.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/license.qbk 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,5 +1,5 @@
[/
- Copyright 2006 John Maddock and Paul A. Bristow.
+ 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
   http://www.boost.org/LICENSE_1_0.txt).

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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,18 +1,18 @@
[article Math Toolkit
- [quickbook 1.4]
- [copyright 2006, 2007, 2008, 2009 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and Thijs van den Berg]
- [purpose ISBN 0-9504833-2-X 978-0-9504833-2-0, Classification 519.2-dc22]
+ [quickbook 1.5]
+ [copyright 2006, 2007, 2008, 2009, 2010 John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan RÃ¥de, Gautam Sewani and Thijs van den Berg]
+ [/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]]
- [category math]
- [purpose mathematics]
+ [authors [Maddock, John], [Bristow, Paul A.], [Holin, Hubert], [Zhang, Xiaogang], [Lalande, Bruno], [RÃ¥de, Johan], [Sewani, Gautam], [van den Berg, Thijs]]
 [/last-revision $Date$]
]

+[/ \u00E5 = Latin small letter A wiht ring above doesn't seem to work in authors]
+
[template equation[name] '''<inlinemediaobject>
<imageobject role="html">
<imagedata fileref="../equations/'''[name]'''.png"></imagedata>
@@ -31,7 +31,9 @@
</imageobject>
</inlinemediaobject>''']

-[include html4_symbols.qbk] [/ just for testing]
+[include html4_symbols.qbk]
+[/include math_symbols.qbk]
+
[/include latin1_symbols.qbk] [/ just for testing]
[include common_overviews.qbk] [/ overviews that appear in more than one place!]
[include tr1.qbk] [/tr1 docs also appear in more than one place!]
@@ -39,8 +41,8 @@

[def __effects [*Effects: ]]
[def __formula [*Formula: ]]
-[def __exm1 '''<code>e<superscript>x</superscript> - 1</code>''']
-[def __ex '''<code>e<superscript>x</superscript></code>''']
+[def __exm1 '''<code>e<superscript>x</superscript> - 1</code>'''] [/e^x -1]
+[def __ex '''<code>e<superscript>x</superscript></code>'''] [/e^x]
[def __te '''2ɛ'''] [/small Latin letter open e]

[def __ceilR '''⌉''']
@@ -53,14 +55,7 @@
[def __eacute '''é''']
[def __quarter '''¼''']
[def __nearequal '''≊''']
-[def __quarter '''¼''']
-[def __space '''''']
-
-[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 __godfrey [link godfrey Godfrey]]
-[def __pugh [link pugh Pugh]]
+[def __spaces ''' '''] [/spaces - useful for an indent.]

[def __caution This is now an official Boost library, but remains a library under
 construction, the code is fully functional and robust, but
@@ -70,6 +65,7 @@
[template tr1[] [@http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2005/n1836.pdf Technical Report on C++ Library Extensions]]
[template C99[] [@http://www.open-std.org/JTC1/SC22/WG14/www/docs/n1256.pdf C99 Standard ISO/IEC 9899:1999]]
[template jm_rationals[] [link math_toolkit.backgrounders.implementation.rational_approximations_used devised by JM]]
+
[def __domain_error [link domain_error domain_error]]
[def __pole_error [link pole_error pole_error]]
[def __overflow_error [link overflow_error overflow_error]]
@@ -200,6 +196,8 @@
[def __expint [link math_toolkit.special.expint.expint_i expint]]
[def __spherical_harmonic [link math_toolkit.special.sf_poly.sph_harm spherical_harmonic]]

+[/tools]
+[def __tuple [link math_toolkit.toolkit.internals1.tuples boost::math::tuple]]

[/ distribution non-members]
[def __cdf [link math.dist.cdf Cumulative Distribution Function]]
@@ -230,6 +228,8 @@
[def __F_distrib [link math_toolkit.dist.dist_ref.dists.f_dist Fisher F Distribution]]
[def __gamma_distrib [link math_toolkit.dist.dist_ref.dists.gamma_dist Gamma Distribution]]
[def __hypergeometric_distrib [link math_toolkit.dist.dist_ref.dists.hypergeometric_dist Hypergeometric Distribution]]
+[def __inverse_gamma_distrib [link math_toolkit.dist.dist_ref.dists.inverse_gamma_dist Inverse Gamma Distribution]]
+[def __inverse_chi_squared_distrib [link math_toolkit.dist.dist_ref.dists.inverse_chi_squared_dist Inverse chi squared Distribution]]
[def __laplace_distrib [link math_toolkit.dist.dist_ref.dists.laplace_dist Laplace Distribution]]
[def __logistic_distrib [link math_toolkit.dist.dist_ref.dists.logistic_dist Logistic Distribution]]
[def __lognormal_distrib [link math_toolkit.dist.dist_ref.dists.lognormal_dist Log-normal Distribution]]
@@ -254,6 +254,12 @@
[def __error_policy [link math_toolkit.policy.pol_ref.error_handling_policies error handling policies]]
[def __changing_policy_defaults [link math_toolkit.policy.pol_ref.policy_defaults changing policies defaults]]
[def __user_error_handling [link math_toolkit.policy.pol_tutorial.user_def_err_pol user error handling]]
+[def __promotion_policy [link math_toolkit.policy.pol_ref.internal_promotion internal promotion policy]]
+[def __precision_policy [link math_toolkit.policy.pol_ref.precision_pol precision policy]]
+
+[def __random_variate [@http://en.wikipedia.org/wiki/Random_variate random variate]]
+[def __random_variable [@http://en.wikipedia.org/wiki/Random_variable random variable]]
+[def __probability_distribution [@[@http://en.wikipedia.org/wiki/Probability_distribution probability_distribution]]

[def __usual_accessors __cdf, __pdf, __quantile, __hazard,
 __chf, __mean, __median, __mode, __variance, __sd, __skewness,
@@ -263,10 +269,23 @@
[def __glibc [@http://www.gnu.org/software/libc/ GNU C Lib]]
[def __hpc [@http://docs.hp.com/en/B9106-90010/index.html HP-UX C Library]]
[def __cephes [@http://www.netlib.org/cephes/ Cephes]]
+[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 __R [@http://www.r-project.org/ The R Project for Statistical Computing]]
+[def __godfrey [link godfrey Godfrey]]
+[def __pugh [link pugh Pugh]]
+[def __NaN [@http://en.wikipedia.org/wiki/NaN NaN]]
+[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 __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]]

[/ Some composite templates]
[template super[x]'''<superscript>'''[x]'''</superscript>''']
@@ -314,12 +333,14 @@

This manual is also available in
[@http://svn.boost.org/svn/boost/sandbox/pdf/math/release/math.pdf
-printer friendly PDF format].
+printer friendly PDF format],
+and as a CD ISBN 0-9504833-2-X 978-0-9504833-2-0, Classification 519.2-dc22.
+

[section:main_overview Overview]

[include overview.qbk]
-[include structure.qbk] [/getting about]
+[include structure.qbk] [/getting about, directory and file structure.]

[include result_type_calc.qbk]
[include error_handling.qbk]
@@ -343,13 +364,14 @@
[section:tr1 C99 and C++ TR1 C-style Functions]
[tr1_overview]
[endsect]
+[include faq.qbk]
[include contact_info.qbk]

[endsect] [/section:main_overview Overview]

[section:dist Statistical Distributions and Functions]
[include dist_tutorial.qbk]
-[include dist_reference.qbk]
+[include dist_reference.qbk] [/includes all individual distribution.qbk files]
[endsect] [/section:dist Statistical Distributions and Functions]

[section:special Special Functions]
@@ -437,12 +459,13 @@
[include roots.qbk]
[include roots_without_derivatives.qbk]
[include minima.qbk]
+[include tuple.qbk]
[endsect] [/section:internals1 Reused Utilities]

[section:internals2 Testing and Development]
[include polynomial.qbk]
[include minimax.qbk]
-[include relative_error.qbk]
+[include relative_error.qbk] [/ uncertainty of floating-point calculations.]
[include test_data.qbk]
[endsect] [/section:internals2 Testing and Development]

@@ -462,7 +485,7 @@
[include lanczos.qbk]
[include remez.qbk]
[include references.qbk]
-[endsect] [/section:backgrounds Backgrounders]
+[endsect] [/section:backgrounders Backgrounders]

[section:status Library Status]
[section:history1 History and What's New]

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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -12,9 +12,9 @@
To use this tool, you will need to have a reasonable grasp of what the Remez
algorithm is, and the general form of the approximation you want to achieve.

-Unless you already familar with the Remez method
+Unless you already familar with the Remez method,
you should first read the [link math_toolkit.backgrounders.remez
-brief background article explaining the principals behind the
+brief background article explaining the principles behind the
Remez algorithm].

The program consists of two parts:

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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -29,6 +29,9 @@
"typical" usage: whatever that may be!
]

+[note Since these tests were run, most compilers have improved their code optimisation,
+and processor speeds have improved too, so these results are known to be out of date.]
+
[endsect]

[section:getting_best Getting the Best Performance from this Library]

Modified: branches/release/libs/math/doc/sf_and_dist/policy.qbk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/policy.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/policy.qbk 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -2,7 +2,7 @@

[section:pol_overview Policy Overview]
[policy_overview]
-[endsect][/section:pol_overview Policy Overview]
+[endsect] [/section:pol_overview Policy Overview]

[include policy_tutorial.qbk]

@@ -50,8 +50,9 @@

[h5 errno_on_error]

-Will set global `::errno` to one of the following values depending
-upon the error type, and then return the same value as if the error
+Will set global __errno `::errno` to one of the following values depending
+upon the error type (often EDOM = 33 and ERANGE = 34),
+and then return the same value as if the error
had been ignored:
 [table
 [[Error Type][errno value]]
@@ -226,12 +227,12 @@

[endsect] [/section:error_handling_policies Error Handling Policies]

-[section:internal_promotion Internal Promotion Policies]
+[section:internal_promotion Internal Floating-point Promotion Policies]

Normally when evaluating a function at say `float` precision, maximal
accuracy is assured by conducting the calculation at `double` precision
internally, and then rounding the result. There are two policies that
-effect whether internal promotion takes place or not:
+control whether internal promotion to a higher precision floating-point type takes place, or not:

[table
[[Policy][Meaning]]
@@ -265,7 +266,8 @@
(they are present for all the statistical distributions supported)
but which may be mathematically undefined for certain distributions, but defined for others.

-For example, the Cauchy distribution does not have a mean, so what should
+For example, the Cauchy distribution does not have a meaningful mean,
+so what should

 mean(cauchy<>());

@@ -421,7 +423,7 @@
used to calculate results, these policies both default to 0 - meaning
calculate to the maximum precision available in the type being used
 - but can be set to other values to cause lower levels of precision
-to be used.
+to be used. One might want to trade precision for evaluation speed.

 namespace boost{ namespace math{ namespace policies{

@@ -447,7 +449,7 @@

[policy_ref_snip9]

-Or again using ['make_policy]:
+Or again using helper function `make_policy`:

[import ../../example/policy_ref_snip10.cpp]

@@ -878,8 +880,8 @@
[endsect][/section:pol_ref Policy Reference]
[endsect][/section:policy Policies]

-[/ math.qbk
- Copyright 2007 John Maddock and Paul A. Bristow.
+[/ policy.qbk
+ Copyright 2007, 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
 http://www.boost.org/LICENSE_1_0.txt).

Modified: branches/release/libs/math/doc/sf_and_dist/policy_tutorial.qbk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/policy_tutorial.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/policy_tutorial.qbk 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -9,7 +9,7 @@

* What action to take when an error occurs.
* What happens when you call a function that is mathematically undefined
-(for example if you ask for the mean of a Cauchy distribution).
+(for example, if you ask for the mean of a Cauchy distribution).
* What happens when you ask for a quantile of a discrete distribution.
* Whether the library is allowed to internally promote `float` to `double`
and `double` to `long double` in order to improve precision.
@@ -34,9 +34,10 @@

[section:policy_tut_defaults Policies Have Sensible Defaults]

-Most of the time you can just ignore the policy framework, the defaults for
-the various policies are as follows, if these work OK for you then you can
-stop reading now!
+Most of the time you can just ignore the policy framework.
+
+['*The defaults for the various policies are as follows,
+if these work OK for you then you can stop reading now!]

[variablelist
[[Domain Error][Throws a `std::domain_error` exception.]]
@@ -115,7 +116,7 @@
configuration macro method.

For example, passing `-DBOOST_MATH_DOMAIN_ERROR_POLICY=errno_on_error` to
-your compiler will cause domain errors to set `::errno` and return a NaN
+your compiler will cause domain errors to set `::errno` and return a __NaN
rather than the usual default behaviour of throwing a `std::domain_error`
exception.

@@ -131,7 +132,7 @@
``#define BOOST_MATH_ASSERT_UNDEFINED_POLICY false
#define BOOST_MATH_OVERFLOW_ERROR_POLICY errno_on_error``

-may be ignored.
+*may be ignored*.

The compiler command line shows:

@@ -174,8 +175,9 @@
[section:ad_hoc_dist_policies Setting Policies for Distributions on an Ad Hoc Basis]

All of the statistical distributions in this library are class templates
-that accept two template parameters, both with sensible defaults, for
-example:
+that accept two template parameters:
+real type (float, double ...) and policy (how to handle exceptional events),
+both with sensible defaults, for example:

    namespace boost{ namespace math{

@@ -264,8 +266,8 @@
[section:namespace_policies Setting Policies at Namespace or Translation Unit Scope]

Sometimes what you want to do is just change a set of policies within
-the current scope: the one thing you should not do in this situation
-is use the configuration macros, as this can lead to "One Definition
+the current scope: *the one thing you should not do in this situation
+is use the configuration macros*, as this can lead to "One Definition
Rule" violations. Instead this library provides a pair of macros
especially for this purpose.

@@ -273,7 +275,8 @@
forwarding functions that all use a specific policy using the
macro BOOST_MATH_DECLARE_SPECIAL_FUNCTIONS(['Policy]). This
macro should be used either inside a unique namespace set aside for the
-purpose, or an unnamed namespace if you just want the functions
+purpose (for example, a C namespace for a C-style policy),
+or an unnamed namespace if you just want the functions
visible in global scope for the current file only.

[import ../../example/policy_eg_4.cpp]
@@ -288,7 +291,7 @@

[policy_eg_5]

-Handling the statistical distributions is very similar except that now
+Handling policies for the statistical distributions is very similar except that now
the macro BOOST_MATH_DECLARE_DISTRIBUTIONS accepts two parameters: the
floating point type to use, and the policy type to apply. For example:

@@ -306,9 +309,9 @@
[policy_eg_6]

[note
-There is an important limitation to note: you can not use the macros
+There is an important limitation to note: you can *not use the macros
BOOST_MATH_DECLARE_DISTRIBUTIONS and BOOST_MATH_DECLARE_SPECIAL_FUNCTIONS
-['in the same namespace], as doing so creates ambiguities between functions
+['in the same namespace]*, as doing so creates ambiguities between functions
and distributions of the same name.
]

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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -31,7 +31,7 @@
Statistical Distributions (Wiley Series in Probability & Statistics) (Paperback)
by N.A.J. Hastings, Brian Peacock, Merran Evans, ISBN: 0471371246, Wiley 2000.

-[@http://www.worldscibooks.com/mathematics/p191.html EXTREME VALUE DISTRIBUTIONS, Theory and Applications]
+[@http://www.worldscibooks.com/mathematics/p191.html Extreme Value Distributions, Theory and Applications]
Samuel Kotz & Saralees Nadarajah, ISBN 978-1-86094-224-2 & 1-86094-224-5 Oct 2000,
Chapter 1.2 discusses the various extreme value distributions.

@@ -61,7 +61,7 @@

[@http://www.softintegration.com/docs/package/chnagstat/ http://www.softintegration.com/docs/package/chnagstat/]

-[@http://www.nag.com/numeric/numerical_libraries.asp NAG ]libraries.
+[@http://www.nag.com/numeric/numerical_libraries.asp NAG] libraries.

[@http://www.mathcad.com MathCAD]

@@ -75,6 +75,25 @@

[@http://www.cas.lancs.ac.uk/glossary_v1.1/prob.html#probdistn Statistics Glossary], Valerie Easton and John H. McColl.

+[__R]
+R Development Core Team (2010). R: A language and environment for
+statistical computing. R Foundation for Statistical Computing,
+Vienna, Austria. ISBN 3-900051-07-0, URL http://www.R-project.org.
+
+For use of R, see:
+
+Jim Albert, Bayesian Computation with R, ISBN 978-0-387-71384-7.
+
+[@http://www.quantnet.com/cplusplus-statistical-distributions-boost
+C++ Statistical Distributions in Boost - QuantNetwork forum]
+discusses using Boost.Math in finance.
+
+[@http://www.quantnet.com/boost-and-computational-finance/ Quantnet Boost and computational finance].
+Robert Demming & Daniel J. Duffy, Introduction to the C++ Boost Libraries - Volume I - Foundations
+and Volume II ISBN 978-94-91028-01-4, Advanced Libraries and Applications, ISBN 978-94-91028-02-1
+(to be published in 2011).
+discusses application of Boost.Math, especially in finance.]
+
[endsect] [/section:references References]
[/
Copyright 2006 John Maddock and Paul A. Bristow.

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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,5 +1,11 @@
[template history[]

+[h4 Boost-1.45.0]
+
+* Added warnings about potential ambiguity with std random library in distribution and function names.
+* Added inverse gamma distribution and inverse chi_square and scaled inverse chi_square.
+* Editorial revision of documentation, and added FAQ.
+
[h4 Boost-1.44.0]

* Fixed incorrect range and support for Rayleigh distribution.
@@ -8,7 +14,7 @@

[h4 Boost-1.41.0]

-* Significantly improved performance for the incomplete gamma function and it's inverse.
+* Significantly improved performance for the incomplete gamma function and its inverse.

[h4 Boost-1.40.0]

@@ -104,11 +110,11 @@

SVN Revisions:

-Sandbox and trunk last synchonised at revision: 56669.
+Sandbox and trunk last synchonised at revision: .

]
[/
- Copyright 2006 John Maddock and Paul A. Bristow.
+ 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
   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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -39,13 +39,13 @@

[variablelist Parameters of the root finding functions
[[F f] [Type F must be a callable function object that accepts one parameter and
- returns a tuple:
+ returns a __tuple:

For the second order iterative methods (Newton Raphson)
- the tuple should have two elements containing the evaluation
+ the __tuple should have two elements containing the evaluation
 of the function and it's first derivative.

-For the third order methods (Halley and Schroeder) the tuple
+For the third order methods (Halley and Schroeder) the __tuple
 should have three elements containing the evaluation of
 the function and its first and second derivatives.]]
[[T guess] [The initial starting value.]]
@@ -146,7 +146,7 @@
 struct cbrt_functor
 {
 cbrt_functor(T const& target) : a(target){}
- std::tr1::tuple<T, T> operator()(T const& z)
+ ``__tuple``<T, T> operator()(T const& z)
 {
 T sqr = z * z;
 return std::tr1::make_tuple(sqr * z - a, 3 * sqr);
@@ -191,7 +191,7 @@
 struct cbrt_functor
 {
 cbrt_functor(T const& target) : a(target){}
- std::tr1::tuple<T, T, T> operator()(T const& z)
+ ``__tuple``<T, T, T> operator()(T const& z)
 {
 T sqr = z * z;
 return std::tr1::make_tuple(sqr * z - a, 3 * sqr, 6 * z);

Modified: branches/release/libs/math/doc/sf_and_dist/structure.qbk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/structure.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/structure.qbk 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -109,6 +109,10 @@

    student_t mydist(10);

+[note Some distribution names are also used in std random library,
+so to avoid the risk of ambiguity it is better to make explicit using declarations,
+for example: `using boost::math::students_t_distribution`]
+
Functions not intended for use by applications are in `boost::math::detail`.

Functions that may have more general use, like `digits`

Modified: branches/release/libs/math/doc/sf_and_dist/test_data.qbk
==============================================================================
--- branches/release/libs/math/doc/sf_and_dist/test_data.qbk (original)
+++ branches/release/libs/math/doc/sf_and_dist/test_data.qbk 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -272,7 +272,7 @@

The first two values in each row are the input parameters that were passed
to our functor and the last value is the return value from the functor.
-Had our functor returned a tuple rather than a value, then we would have had
+Had our functor returned a __tuple rather than a value, then we would have had
one entry for each element in the tuple in addition to the input parameters.

The first #define serves two purposes:
@@ -321,7 +321,7 @@
 };

We want to measure both the relative error, and the rate of convergence
-of this fraction, so we'll write a functor that returns both as a tuple:
+of this fraction, so we'll write a functor that returns both as a __tuple:
class test_data will unpack the tuple for us, and create one column of data
for each element in the tuple (in addition to the input parameters):

@@ -329,12 +329,12 @@
 #include <boost/math/tools/test.hpp>
 #include <boost/math/special_functions/gamma.hpp>
 #include <boost/math/tools/ntl.hpp>
- #include <boost/tr1/tuple.hpp>
+ #include <boost/math/tools/tuple.hpp>

 template <class T>
 struct profile_gamma_fraction
 {
- typedef std::tr1::tuple<T, T> result_type;
+ typedef ``__tuple``<T, T> result_type;

 result_type operator()(T val)
 {
@@ -355,7 +355,7 @@
 T err = real_cast<T>(relative_error(true_val, NTL::RR(found_val)) / std::numeric_limits<T>::epsilon());
 //
 // now just return the results as a tuple:
- return std::tr1::make_tuple(err, iters);
+ return boost::math::make_tuple(err, iters);
 }
 };

Modified: branches/release/libs/math/example/Jamfile.v2
==============================================================================
--- branches/release/libs/math/example/Jamfile.v2 (original)
+++ branches/release/libs/math/example/Jamfile.v2 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,6 +1,7 @@
-# \math_toolkit\libs\math\example\jamfile.v2
+# \libs\math\example\jamfile.v2
# Runs statistics examples
-# Copyright 2007 John Maddock and Paul A. Bristow.
+# Copyright 2007 John Maddock
+# Copyright Paul A. Bristow 2007, 2010.
# Distributed under the Boost Software License, Version 1.0.
# (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

@@ -28,7 +29,6 @@

run binomial_coinflip_example.cpp ;
run binomial_confidence_limits.cpp ;
-run binomial_example3.cpp ;
run binomial_example_nag.cpp ;
run binomial_quiz_example.cpp ;
run binomial_sample_sizes.cpp ;

Modified: branches/release/libs/math/example/binomial_coinflip_example.cpp
==============================================================================
--- branches/release/libs/math/example/binomial_coinflip_example.cpp (original)
+++ branches/release/libs/math/example/binomial_coinflip_example.cpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,4 +1,4 @@
-// Copyright Paul A. 2007
+// Copyright Paul A. 2007, 2010
// Copyright John Maddock 2006

// Use, modification and distribution are subject to the

Modified: branches/release/libs/math/example/binomial_confidence_limits.cpp
==============================================================================
--- branches/release/libs/math/example/binomial_confidence_limits.cpp (original)
+++ branches/release/libs/math/example/binomial_confidence_limits.cpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,4 +1,6 @@
// Copyright John Maddock 2006
+// Copyright Paul A. Bristow 2010
+
// Use, modification and distribution are subject to the
// Boost Software License, Version 1.0.
// (See accompanying file LICENSE_1_0.txt
@@ -11,7 +13,11 @@
#endif

#include <iostream>
+using std::cout; using std::endl;
#include <iomanip>
+using std::fixed; using std::left; using std::right; using std::right; using std::setw;
+using std::setprecision;
+
#include <boost/math/distributions/binomial.hpp>

void confidence_limits_on_frequency(unsigned trials, unsigned successes)
@@ -21,11 +27,11 @@
 // successes = Total number of observed successes.
 //
 // Calculate confidence limits for an observed
- // frequency of occurrence that follows a binomial
- // distribution.
+ // frequency of occurrence that follows a binomial distribution.
 //
- using namespace std;
- using namespace boost::math;
+ //using namespace std; // Avoid
+ // using namespace boost::math; // potential name ambiguity with std <random>
+ using boost::math::binomial_distribution;

 // Print out general info:
 cout <<

Deleted: branches/release/libs/math/example/binomial_example3.cpp
==============================================================================
--- branches/release/libs/math/example/binomial_example3.cpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
+++ (empty file)
@@ -1,91 +0,0 @@
-// Copyright Paul A. 2006
-// Copyright John Maddock 2006
-// 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)
-
-// Simple example of computing probabilities for a binomial random variable.
-// Replication of source nag_binomial_dist (g01bjc).
-
-// Shows how to replace NAG C library calls by Boost Math Toolkit C++ calls.
-
-#ifdef _MSC_VER
-# pragma warning(disable: 4512) // assignment operator could not be generated.
-# pragma warning(disable: 4510) // default constructor could not be generated.
-# pragma warning(disable: 4610) // can never be instantiated - user defined constructor required.
-#endif
-
-#include <iostream>
-using std::cout;
-using std::endl;
-using std::ios;
-using std::showpoint;
-#include <iomanip>
-using std::fixed;
-using std::setw;
-#include <boost/math/distributions/binomial.hpp>
-
-int main()
-{
- cout << "Example 3 of using the binomial distribution to replicate a NAG library call." << endl;
- using boost::math::binomial_distribution;
-
- // This replicates the computation of the examples of using nag-binomial_dist
- // using g01bjc in section g01 Sample Calculations on Statistical Data.
- // http://www.nag.co.uk/numeric/cl/manual/pdf/G01/g01bjc.pdf
- // Program results section 8.3 page 3.g01bjc.3
- //8.2. Program Data
- //g01bjc Example Program Data
- //4 0.50 2 : n, p, k
- //19 0.44 13
- //100 0.75 67
- //2000 0.33 700
- //8.3. Program Results
- //g01bjc Example Program Results
- //n p k plek pgtk peqk
- //4 0.500 2 0.68750 0.31250 0.37500
- //19 0.440 13 0.99138 0.00862 0.01939
- //100 0.750 67 0.04460 0.95540 0.01700
- //2000 0.330 700 0.97251 0.02749 0.00312
-
- cout.setf(ios::showpoint); // Trailing zeros to show significant decimal digits.
- cout.precision(5); // Should be able to calculate this?
- cout << fixed;
- // Binomial distribution.
-
- // Note that cdf(dist, k) is equivalent to NAG library plek probability of <= k
- // cdf(complement(dist, k)) is equivalent to NAG library pgtk probability of > k
- // pdf(dist, k) is equivalent to NAG library peqk probability of == k
-
- cout << " n p k plek pgtk peqk " << endl;
- binomial_distribution<>my_dist(4, 0.5);
- cout << setw(4) << (int)my_dist.trials() << " " << my_dist.success_fraction() << " "<< 2 << " "
- << cdf(my_dist, 2) << " " << cdf(complement(my_dist, 2)) << " " << pdf(my_dist, 2) << endl;
- binomial_distribution<>two(19, 0.440);
- cout << setw(4) << (int)two.trials() << " " << two.success_fraction() << " " << 13 << " "
- << cdf(two, 13) << " " << cdf(complement(two, 13)) << " " << pdf(two, 13) << endl;
- binomial_distribution<>three(100, 0.750);
- cout << setw(4) << (int)three.trials() << " " << three.success_fraction() << " " << 67 << " "
- << cdf(three, 67) << " " << cdf(complement(three, 67)) << " " << pdf(three, 67) << endl;
- binomial_distribution<>four(2000, 0.330);
- cout << setw(4) << (int)four.trials() << " " << four.success_fraction() << " " << 700 << " "
- << cdf(four, 700) << " " << cdf(complement(four, 700)) << " " << pdf(four, 700) << endl;
-
- return 0;
-} // int main()
-
-/*
-
-Autorun "i:\boost-sandbox\math_toolkit\libs\math\test\msvc80\debug\binomial_example3.exe"
-Example 3 of using the binomial distribution.
- n p k plek pgtk peqk
- 4 0.50000 2 0.68750 0.31250 0.37500
- 19 0.44000 13 0.99138 0.00862 0.01939
- 100 0.75000 67 0.04460 0.95540 0.01700
-2000 0.33000 700 0.97251 0.02749 0.00312
-
-
-
- */
-

Modified: branches/release/libs/math/example/binomial_example_nag.cpp
==============================================================================
--- branches/release/libs/math/example/binomial_example_nag.cpp (original)
+++ branches/release/libs/math/example/binomial_example_nag.cpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,4 +1,4 @@
-// Copyright Paul A. 2007
+// Copyright Paul A. 2007, 2010
// Copyright John Maddock 2007
// Use, modification and distribution are subject to the
// Boost Software License, Version 1.0.

Modified: branches/release/libs/math/example/binomial_quiz_example.cpp
==============================================================================
--- branches/release/libs/math/example/binomial_quiz_example.cpp (original)
+++ branches/release/libs/math/example/binomial_quiz_example.cpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,4 +1,4 @@
-// Copyright Paul A. Bristow 2007, 2009
+// Copyright Paul A. Bristow 2007, 2009, 2010
// Copyright John Maddock 2006

// Use, modification and distribution are subject to the
@@ -38,6 +38,10 @@
 using std::ios; using std::flush; using std::left; using std::right; using std::fixed;
#include <iomanip>
 using std::setw; using std::setprecision;
+#include <exception>
+ using std::exception;
+
+
//][/binomial_quiz_example1]

int main()
@@ -406,7 +410,7 @@

//] [/discrete_quantile_real]
 }
- catch(const std::exception& e)
+ catch(const exception& e)
 { // Always useful to include try & catch blocks because
 // default policies are to throw exceptions on arguments that cause
 // errors like underflow, overflow.

Modified: branches/release/libs/math/example/binomial_sample_sizes.cpp
==============================================================================
--- branches/release/libs/math/example/binomial_sample_sizes.cpp (original)
+++ branches/release/libs/math/example/binomial_sample_sizes.cpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,4 +1,6 @@
-// (C) Copyright John Maddock 2006
+// Copyright John Maddock 2006
+// Copyright Paul A. Bristow 2010
+
// Use, modification and distribution are subject to the
// Boost Software License, Version 1.0.
// (See accompanying file LICENSE_1_0.txt
@@ -11,7 +13,11 @@
#endif

#include <iostream>
+using std::cout; using std::endl;
#include <iomanip>
+using std::fixed; using std::left; using std::right; using std::right; using std::setw;
+using std::setprecision;
+
#include <boost/math/distributions/binomial.hpp>

void find_max_sample_size(double p, unsigned successes)
@@ -25,8 +31,9 @@
 // A typical use would be failure analysis, where you want
 // zero or fewer "successes" with some probability.
 //
- using namespace std;
- using namespace boost::math;
+ // using namespace boost::math;
+ // Avoid potential binomial_distribution name ambiguity with std <random>
+ using boost::math::binomial_distribution;

 // Print out general info:
 cout <<
@@ -74,3 +81,96 @@
 return 0;
}

+
+/*
+
+Output:
+
+ binomial_sample_sizes.cpp
+ binomial_sample_sizes_example.vcxproj -> J:\Cpp\MathToolkit\test\Math_test\Debug\binomial_sample_sizes_example.exe
+ ________________________
+ Maximum Number of Trials
+ ________________________
+
+ Success ratio = 0.001
+ Maximum Number of "successes" permitted = 0
+
+
+ ____________________________
+ Confidence Max Number
+ Value (%) Of Trials
+ ____________________________
+ 50.000 692
+ 75.000 287
+ 90.000 105
+ 95.000 51
+ 99.000 10
+ 99.900 0
+ 99.990 0
+ 99.999 0
+
+ ________________________
+ Maximum Number of Trials
+ ________________________
+
+ Success ratio = 0.0001000
+ Maximum Number of "successes" permitted = 0
+
+
+ ____________________________
+ Confidence Max Number
+ Value (%) Of Trials
+ ____________________________
+ 50.000 6931
+ 75.000 2876
+ 90.000 1053
+ 95.000 512
+ 99.000 100
+ 99.900 10
+ 99.990 0
+ 99.999 0
+
+ ________________________
+ Maximum Number of Trials
+ ________________________
+
+ Success ratio = 0.0000100
+ Maximum Number of "successes" permitted = 0
+
+
+ ____________________________
+ Confidence Max Number
+ Value (%) Of Trials
+ ____________________________
+ 50.000 69314
+ 75.000 28768
+ 90.000 10535
+ 95.000 5129
+ 99.000 1005
+ 99.900 100
+ 99.990 10
+ 99.999 1
+
+ ________________________
+ Maximum Number of Trials
+ ________________________
+
+ Success ratio = 0.0000010
+ Maximum Number of "successes" permitted = 0
+
+
+ ____________________________
+ Confidence Max Number
+ Value (%) Of Trials
+ ____________________________
+ 50.000 693146
+ 75.000 287681
+ 90.000 105360
+ 95.000 51293
+ 99.000 10050
+ 99.900 1000
+ 99.990 100
+ 99.999 10
+
+
+*/

Modified: branches/release/libs/math/example/c_error_policy_example.cpp
==============================================================================
--- branches/release/libs/math/example/c_error_policy_example.cpp (original)
+++ branches/release/libs/math/example/c_error_policy_example.cpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,6 +1,6 @@
// C_error_policy_example.cpp

-// Copyright Paul A. Bristow 2007.
+// Copyright Paul A. Bristow 2007, 2010.
// Copyright John Maddock 2007.

// Use, modification and distribution are subject to the
@@ -11,6 +11,8 @@
// Suppose we want a call to tgamma to behave in a C-compatible way
// and set global ::errno rather than throw an exception.

+#include <cerrno> // for ::errno
+
#include <boost/math/special_functions/gamma.hpp>
using boost::math::tgamma;

@@ -27,7 +29,7 @@
//using boost::math::policies::ignore_error;

//using namespace boost::math::policies;
-//using namespace boost::math;
+//using namespace boost::math; // avoid potential ambiuity with std:: <random>

// Define a policy:
typedef policy<
@@ -58,7 +60,7 @@
 overflow_error<errno_on_error>(),
 evaluation_error<errno_on_error>()
 ));
- cout << "tgamma(4., make_policy( ...) = " << t << endl; // 6
+ cout << "tgamma(4., make_policy(...) = " << t << endl; // 6

 return 0;
} // int main()
@@ -67,8 +69,13 @@

Output

-Autorun "i:\boost-06-05-03-1300\libs\math\test\Math_test\debug\c_error_policy_example.exe"
-tgamma(4., C_error_policy() = 6
-tgamma(4., make_policy( ...) = 6
+ c_error_policy_example.cpp
+ Generating code
+ Finished generating code
+ c_error_policy_example.vcxproj -> J:\Cpp\MathToolkit\test\Math_test\Release\c_error_policy_example.exe
+ tgamma(4., C_error_policy() = 6
+ tgamma(4., make_policy(...) = 6
+ tgamma(4., C_error_policy() = 6
+ tgamma(4., make_policy(...) = 6

*/

Modified: branches/release/libs/math/example/chi_square_std_dev_test.cpp
==============================================================================
--- branches/release/libs/math/example/chi_square_std_dev_test.cpp (original)
+++ branches/release/libs/math/example/chi_square_std_dev_test.cpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,5 +1,5 @@
// Copyright John Maddock 2006, 2007
-// Copyright Paul A. Bristow 2007
+// Copyright Paul A. Bristow 2010

// Use, modification and distribution are subject to the
// Boost Software License, Version 1.0.
@@ -12,8 +12,8 @@
#include <iomanip>
using std::setw;
using std::setprecision;
-#include <boost/math/distributions/chi_squared.hpp>

+#include <boost/math/distributions/chi_squared.hpp>

void confidence_limits_on_std_deviation(
 double Sd, // Sample Standard Deviation
@@ -31,7 +31,7 @@
 // contains the true standard deviation or it does not.
 // See http://www.itl.nist.gov/div898/handbook/eda/section3/eda358.htm

- // using namespace boost::math;
+ // using namespace boost::math; // potential name ambiguity with std <random>
 using boost::math::chi_squared;
 using boost::math::quantile;
 using boost::math::complement;
@@ -76,10 +76,10 @@

void confidence_limits_on_std_deviation_alpha(
 double Sd, // Sample Standard Deviation
- double alpha // confidence
- )
+ double alpha // confidence
+ )
{ // Calculate confidence intervals for the standard deviation.
- // for the alpha parameter, for a range number of observations,
+ // for the alpha parameter, for a range number of observations,
 // from a mere 2 up to a million.
 // O. L. Davies, Statistical Methods in Research and Production, ISBN 0 05 002437 X,
 // 4.33 Page 68, Table H, pp 452 459.
@@ -111,7 +111,7 @@
 unsigned int N = obs[i]; // Observations
 // Start by declaring the distribution with the appropriate :
 chi_squared dist(N - 1);
-
+
 // Now print out the data for the table row.
 cout << fixed << setprecision(3) << setw(10) << right << N;
 // Calculate limits: (alpha /2 because it is a two-sided (upper and lower limit) test.
@@ -244,17 +244,17 @@
 {
 // Confidence value:
 cout << fixed << setprecision(3) << setw(10) << right << 100 * (1-alpha[i]);
- // calculate df for a lower single-sided test:
+ // Calculate df for a lower single-sided test:
 double df = chi_squared::find_degrees_of_freedom(
 -diff, alpha[i], alpha[i], variance);
- // convert to sample size:
+ // Convert to integral sample size (df is a floating point value in this implementation):
 double size = ceil(df) + 1;
 // Print size:
 cout << fixed << setprecision(0) << setw(16) << right << size;
- // calculate df for an upper single-sided test:
+ // Calculate df for an upper single-sided test:
 df = chi_squared::find_degrees_of_freedom(
 diff, alpha[i], alpha[i], variance);
- // convert to sample size:
+ // Convert to integral sample size:
 size = ceil(df) + 1;
 // Print size:
 cout << fixed << setprecision(0) << setw(16) << right << size << endl;

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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,6 +1,6 @@
// distribution_construction.cpp

-// Copyright Paul A. Bristow 2007.
+// Copyright Paul A. Bristow 2007, 2010.

// Use, modification and distribution are subject to the
// Boost Software License, Version 1.0.
@@ -39,27 +39,25 @@
*/
//] [/distribution_construction1 end of Quickbook in C++ markup]

-
-
-
int main()
{
//[distribution_construction2
-/*`
+/*`
First, a negative binomial distribution with 8 successes
and a success fraction 0.25, 25% or 1 in 4, is constructed like this:
*/
 boost::math::negative_binomial_distribution<double> mydist0(8., 0.25);
 /*`
- But this is inconveniently long, so by writing
+ But this is inconveniently long, so we might be tempted to write
 */
 using namespace boost::math;
 /*`
- or
+ but this might risk ambiguity with names in std random so
+ *much better is explicit `using boost::math:: ` * ... statements like
 */
 using boost::math::negative_binomial_distribution;
 /*`
- we can reduce typing.
+ 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
@@ -75,7 +73,7 @@
 typedef negative_binomial_distribution<double> negative_binomial; // Reserved name of type double.

 [caution
- This convenience typedef is /not/ provided if a clash would occur
+ 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.
 ]
@@ -84,7 +82,7 @@
 */

 using boost::math::negative_binomial;
-
+
 /*`
 we have a convenient typedef to `negative_binomial_distribution<double>`:
 */
@@ -113,7 +111,7 @@
 /*`
 For cases when the typdef distribution name would clash with a math special function
 (currently only beta and gamma)
- the typedef is deliberately not provided, and the longer version of the name
+ the typedef is deliberately not provided, and the longer version of the name
 must be used. For example do not use:

 using boost::math::beta;
@@ -121,12 +119,12 @@

 Which produces the error messages:

- [pre
+ [pre
 error C2146: syntax error : missing ';' before identifier 'mybetad0'
 warning C4551: function call missing argument list
 error C3861: 'mybetad0': identifier not found
 ]
-
+
 Instead you should use:
 */
 using boost::math::beta_distribution;
@@ -139,41 +137,41 @@
 /*`
 We can, of course, still provide the type explicitly thus:
 */
-
+
 // Explicit double precision:
- negative_binomial_distribution<double> mydist1(8., 0.25);
+ 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.
- negative_binomial_distribution<float> mydist3(8, 0.25);
+ negative_binomial_distribution<float> mydist3(8, 0.25);

 // Explicit float precision, float arguments, so no conversion:
- negative_binomial_distribution<float> mydist4(8.F, 0.25F);
+ negative_binomial_distribution<float> mydist4(8.F, 0.25F);

 // Explicit float precision, integer arguments promoted to float.
- negative_binomial_distribution<float> mydist5(8, 1);
+ negative_binomial_distribution<float> mydist5(8, 1);

 // Explicit double precision:
- negative_binomial_distribution<double> mydist6(8., 0.25);
+ negative_binomial_distribution<double> mydist6(8., 0.25);

 // Explicit long double precision:
- negative_binomial_distribution<long double> mydist7(8., 0.25);
+ 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:
-
+
 negative_binomial_distribution<MyFPType> mydist6(8, 1); // Integer arguments -> MyFPType.

 [heading 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,
@@ -181,13 +179,13 @@
 For other distributions, like the normal distribution,
 it is obviously very useful to provide 'standard'
 defaults for the mean and standard deviation 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.

Modified: branches/release/libs/math/example/error_handling_example.cpp
==============================================================================
--- branches/release/libs/math/example/error_handling_example.cpp (original)
+++ branches/release/libs/math/example/error_handling_example.cpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,6 +1,6 @@
// example_error_handling.cpp

-// Copyright Paul A. Bristow 2007.
+// Copyright Paul A. Bristow 2007, 2010.
// Copyright John Maddock 2007.

// Use, modification and distribution are subject to the
@@ -11,6 +11,11 @@
// Note that this file contains quickbook markup as well as code
// and comments, don't change any of the special comment markups!

+// Optional macro definitions described in text below:
+// #define BOOST_MATH_DOMAIN_ERROR_POLICY ignore_error
+// #define BOOST_MATH_DOMAIN_ERROR_POLICY errno_on_error
+// #define BOOST_MATH_DOMAIN_ERROR_POLICY is set to: throw_on_error
+
//[error_handling_example
/*`
The following example demonstrates the effect of
@@ -59,11 +64,9 @@
 using std::exception;

/*`
-
Next we'll define the program's main() to call the student's t
-distribution with an invalid degrees of freedom parameter, the program
-is set up to handle either an exception or a NaN:
-
+distribution with an invalid degrees of freedom parameter,
+the program is set up to handle either an exception or a NaN:
*/

int main()
@@ -77,14 +80,17 @@

 try
 {
- errno = 0;
- students_t dist(degrees_of_freedom); // exception is thrown here if enabled
+ errno = 0; // Clear/reset.
+ students_t dist(degrees_of_freedom); // exception is thrown here if enabled.
 double p = cdf(dist, t);
- // test for error reported by other means:
+ // Test for error reported by other means:
 if((boost::math::isnan)(p))
 {
 cout << "cdf returned a NaN!" << endl;
- cout << "errno is set to: " << errno << endl;
+ if (errno != 0)
+ { // So errno has been set.
+ cout << "errno is set to: " << errno << endl;
+ }
 }
 else
 cout << "Probability of Student's t is " << p << endl;
@@ -94,14 +100,13 @@
 std::cout <<
 "\n""Message from thrown exception was:\n " << e.what() << std::endl;
 }
-
 return 0;
} // int main()

/*`

Here's what the program output looks like with a default build
-(one that does throw exceptions):
+(one that *does throw exceptions*):

[pre
Example error handling using Student's t function.
@@ -122,14 +127,13 @@
Example error handling using Student's t function.
BOOST_MATH_DOMAIN_ERROR_POLICY is set to: ignore_error
cdf returned a NaN!
-errno is set to: 0
]

And finally let's build with:

 #define BOOST_MATH_DOMAIN_ERROR_POLICY errno_on_error

-Which gives the output:
+Which gives the output show errno:

[pre
Example error handling using Student's t function.

Modified: branches/release/libs/math/example/error_policies_example.cpp
==============================================================================
--- branches/release/libs/math/example/error_policies_example.cpp (original)
+++ branches/release/libs/math/example/error_policies_example.cpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,6 +1,6 @@
// error_policies_example.cpp

-// Copyright Paul A. Bristow 2007.
+// Copyright Paul A. Bristow 2007, 2010.
// Copyright John Maddock 2007.

// Use, modification and distribution are subject to the
@@ -15,12 +15,13 @@
    using boost::math::students_t; // Probability of students_t(df, t).
    using boost::math::students_t_distribution;

-// using namespace boost::math;
+// using namespace boost::math; causes:
//.\error_policy_normal.cpp(30) : error C2872: 'policy' : ambiguous symbol
-// could be 'I:\Boost-sandbox\math_toolkit\boost/math/policies/policy.hpp(392) : boost::math::policies::policy'
+// could be '\boost/math/policies/policy.hpp(392) : boost::math::policies::policy'
// or 'boost::math::policies'

- // So can't use this using namespace command.
+// So should not use this 'using namespace boost::math;' command.
+
// Suppose we want a statistical distribution to return infinities,
// rather than throw exceptions (the default policy), then we can use:

@@ -29,6 +30,8 @@
    using std::cout;
    using std::endl;

+// using namespace boost::math::policies; or
+
using boost::math::policies::policy;
// Possible errors
using boost::math::policies::overflow_error;
@@ -37,7 +40,6 @@
using boost::math::policies::pole_error;
using boost::math::policies::denorm_error;
using boost::math::policies::evaluation_error;
-
using boost::math::policies::ignore_error;

// Define a custom policy to ignore just overflow:
@@ -89,11 +91,15 @@

Output:

-quantile(my_normal(), 0.05); = -1.64485
-quantile(my_normal(), 0.); = -1.#INF
-quantile(my_normal(), 0.); = -1.#INF
-quantile(my_students_t(), 0.); = 1.#QNAN
-quantile(my_normal2(), 0.); = -2.32635
-quantile(my_normal2(), 0.); = -1.#INF
+error_policies_example.cpp
+ Generating code
+ Finished generating code
+ error_policy_normal_example.vcxproj -> J:\Cpp\MathToolkit\test\Math_test\Release\error_policies_example.exe
+ quantile(my_normal(), 0.05); = -1.64485
+ quantile(my_normal(), 0.); = -1.#INF
+ quantile(my_normal(), 0.); = -1.#INF
+ quantile(my_students_t(), 0.); = 1.#QNAN
+ quantile(my_normal2(), 0.); = -2.32635
+ quantile(my_normal2(), 0.); = -1.#INF

*/

Modified: branches/release/libs/math/example/error_policy_example.cpp
==============================================================================
--- branches/release/libs/math/example/error_policy_example.cpp (original)
+++ branches/release/libs/math/example/error_policy_example.cpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,6 +1,6 @@
// example_policy_handling.cpp

-// Copyright Paul A. Bristow 2007.
+// Copyright Paul A. Bristow 2007, 2010.
// Copyright John Maddock 2007.

// Use, modification and distribution are subject to the
@@ -14,13 +14,17 @@
// for student's t distribution CDF,
// and catching the exception.

-// See error_handling_policies for more examples.
+// See error_handling_policies.cpp for more examples.

// Boost
#include <boost/math/distributions/students_t.hpp>
using boost::math::students_t_distribution; // Probability of students_t(df, t).
using boost::math::students_t; // Probability of students_t(df, t) convenience typedef for double.

+using boost::math::policies::policy;
+using boost::math::policies::domain_error;
+using boost::math::policies::ignore_error;
+
// std
#include <iostream>
 using std::cout;
@@ -29,16 +33,12 @@
#include <stdexcept>
 using std::exception;

-using boost::math::policies::policy;
-using boost::math::policies::domain_error;
-using boost::math::policies::ignore_error;
-
// Define a (bad?) policy to ignore domain errors ('bad' arguments):
typedef policy<
 domain_error<ignore_error>
> my_policy;

-// Define my distribution with this different domain error policy:
+// Define my_students_t distribution with this different domain error policy:
typedef students_t_distribution<double, my_policy> my_students_t;

int main()
@@ -49,15 +49,16 @@

 try
 {
- cout << "Probability of ignore_error Student's t is " << cdf(my_students_t(degrees_of_freedom), t) << endl;
+ cout << "Probability of ignore_error Student's t is "
+ << cdf(my_students_t(degrees_of_freedom), t) << endl;
 cout << "Probability of default error policy Student's t is " << endl;
- // BY contrast the students_t distribution default domain error policy is to throw,
+ // By contrast the students_t distribution default domain error policy is to throw,
 cout << cdf(students_t(-1), -1) << endl; // so this will throw.
- /*`
+/*`
 Message from thrown exception was:
 Error in function boost::math::students_t_distribution<double>::students_t_distribution:
 Degrees of freedom argument is -1, but must be > 0 !
- */
+*/

 // We could also define a 'custom' distribution
 // with an "ignore overflow error policy" in a single statement:
@@ -78,11 +79,15 @@

Output:

-Example error handling using Student's t function.
-Probability of ignore_error Student's t is 1.#QNAN
-Probability of default error policy Student's t is
-Message from thrown exception was:
- Error in function boost::math::students_t_distribution<double>::students_t_distribution:
- Degrees of freedom argument is -1, but must be > 0 !
+ error_policy_example.cpp
+ Generating code
+ Finished generating code
+ error_policy_example.vcxproj -> J:\Cpp\MathToolkit\test\Math_test\Release\error_policy_example.exe
+ Example error handling using Student's t function.
+ Probability of ignore_error Student's t is 1.#QNAN
+ Probability of default error policy Student's t is
+
+ Message from thrown exception was:
+ Error in function boost::math::students_t_distribution<double>::students_t_distribution: Degrees of freedom argument is -1, but must be > 0 !

*/

Modified: branches/release/libs/math/example/f_test.cpp
==============================================================================
--- branches/release/libs/math/example/f_test.cpp (original)
+++ branches/release/libs/math/example/f_test.cpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,5 +1,5 @@
// Copyright John Maddock 2006
-// Copyright Paul A. Bristow 2007, 2008
+// Copyright Paul A. Bristow 2007, 2008, 2010

// Use, modification and distribution are subject to the
// Boost Software License, Version 1.0.
@@ -10,11 +10,16 @@
# pragma warning(disable: 4512) // assignment operator could not be generated.
# pragma warning(disable: 4510) // default constructor could not be generated.
# pragma warning(disable: 4610) // can never be instantiated - user defined constructor required.
-# pragma warning(disable: 4180) // qualifier has no effect (in fusion).
+# pragma warning(disable: 4180) // qualifier has no effect (in Fusion).
#endif

#include <iostream>
+using std::cout; using std::endl;
+using std::left; using std::fixed; using std::right; using std::scientific;
#include <iomanip>
+using std::setw;
+using std::setprecision;
+
#include <boost/math/distributions/fisher_f.hpp>

void f_test(
@@ -33,8 +38,8 @@
 // difference is not down to chance.
 // See http://www.itl.nist.gov/div898/handbook/eda/section3/eda359.htm
 //
- using namespace std;
- using namespace boost::math;
+ // Avoid "using namespace boost::math;" because of potential name ambiguity.
+ using boost::math::fisher_f;

 // Print header:
 cout <<
@@ -126,60 +131,120 @@

Output:

-____________________________________
-F test for equal standard deviations
-____________________________________
-
-Sample 1:
-Number of Observations = 240
-Sample Standard Deviation = 65.549
-
-Sample 2:
-Number of Observations = 240
-Sample Standard Deviation = 61.854
-
-Test Statistic = 1.123
-
-CDF of test statistic: = 8.148e-001
-Upper Critical Value at alpha: = 1.238e+000
-Upper Critical Value at alpha/2: = 1.289e+000
-Lower Critical Value at alpha: = 8.080e-001
-Lower Critical Value at alpha/2: = 7.756e-001
-
-Results for Alternative Hypothesis and alpha = 0.0500
-
-Alternative Hypothesis Conclusion
-Standard deviations are unequal (two sided test) REJECTED
-Standard deviation 1 is less than standard deviation 2 REJECTED
-Standard deviation 1 is greater than standard deviation 2 REJECTED
-
-
-____________________________________
-F test for equal standard deviations
-____________________________________
-
-Sample 1:
-Number of Observations = 11.00000
-Sample Standard Deviation = 4.90820
-
-Sample 2:
-Number of Observations = 9.00000
-Sample Standard Deviation = 2.58740
-
-Test Statistic = 3.59847
-
-CDF of test statistic: = 9.589e-001
-Upper Critical Value at alpha: = 3.347e+000
-Upper Critical Value at alpha/2: = 4.295e+000
-Lower Critical Value at alpha: = 3.256e-001
-Lower Critical Value at alpha/2: = 2.594e-001
-
-Results for Alternative Hypothesis and alpha = 0.0500
-
-Alternative Hypothesis Conclusion
-Standard deviations are unequal (two sided test) REJECTED
-Standard deviation 1 is less than standard deviation 2 REJECTED
-Standard deviation 1 is greater than standard deviation 2 NOT REJECTED
+ f_test.cpp
+ F-test_example1.vcxproj -> J:\Cpp\MathToolkit\test\Math_test\Debug\F_test_example1.exe
+ ____________________________________
+ F test for equal standard deviations
+ ____________________________________
+
+ Sample 1:
+ Number of Observations = 240
+ Sample Standard Deviation = 65.549
+
+ Sample 2:
+ Number of Observations = 240
+ Sample Standard Deviation = 61.854
+
+ Test Statistic = 1.123
+
+ CDF of test statistic: = 8.148e-001
+ Upper Critical Value at alpha: = 1.238e+000
+ Upper Critical Value at alpha/2: = 1.289e+000
+ Lower Critical Value at alpha: = 8.080e-001
+ Lower Critical Value at alpha/2: = 7.756e-001
+
+ Results for Alternative Hypothesis and alpha = 0.0500
+
+ Alternative Hypothesis Conclusion
+ Standard deviations are unequal (two sided test) REJECTED
+ Standard deviation 1 is less than standard deviation 2 REJECTED
+ Standard deviation 1 is greater than standard deviation 2 REJECTED
+
+
+ ____________________________________
+ F test for equal standard deviations
+ ____________________________________
+
+ Sample 1:
+ Number of Observations = 11.00000
+ Sample Standard Deviation = 4.90820
+
+ Sample 2:
+ Number of Observations = 9.00000
+ Sample Standard Deviation = 2.58740
+
+ Test Statistic = 3.59847
+
+ CDF of test statistic: = 9.589e-001
+ Upper Critical Value at alpha: = 3.347e+000
+ Upper Critical Value at alpha/2: = 4.295e+000
+ Lower Critical Value at alpha: = 3.256e-001
+ Lower Critical Value at alpha/2: = 2.594e-001
+
+ Results for Alternative Hypothesis and alpha = 0.0500
+
+ Alternative Hypothesis Conclusion
+ Standard deviations are unequal (two sided test) REJECTED
+ Standard deviation 1 is less than standard deviation 2 REJECTED
+ Standard deviation 1 is greater than standard deviation 2 NOT REJECTED
+
+
+ ____________________________________
+ F test for equal standard deviations
+ ____________________________________
+
+ Sample 1:
+ Number of Observations = 240
+ Sample Standard Deviation = 65.549
+
+ Sample 2:
+ Number of Observations = 240
+ Sample Standard Deviation = 61.854
+
+ Test Statistic = 1.123
+
+ CDF of test statistic: = 8.148e-001
+ Upper Critical Value at alpha: = 1.238e+000
+ Upper Critical Value at alpha/2: = 1.289e+000
+ Lower Critical Value at alpha: = 8.080e-001
+ Lower Critical Value at alpha/2: = 7.756e-001
+
+ Results for Alternative Hypothesis and alpha = 0.0500
+
+ Alternative Hypothesis Conclusion
+ Standard deviations are unequal (two sided test) REJECTED
+ Standard deviation 1 is less than standard deviation 2 REJECTED
+ Standard deviation 1 is greater than standard deviation 2 REJECTED
+
+
+ ____________________________________
+ F test for equal standard deviations
+ ____________________________________
+
+ Sample 1:
+ Number of Observations = 11.00000
+ Sample Standard Deviation = 4.90820
+
+ Sample 2:
+ Number of Observations = 9.00000
+ Sample Standard Deviation = 2.58740
+
+ Test Statistic = 3.59847
+
+ CDF of test statistic: = 9.589e-001
+ Upper Critical Value at alpha: = 3.347e+000
+ Upper Critical Value at alpha/2: = 4.295e+000
+ Lower Critical Value at alpha: = 3.256e-001
+ Lower Critical Value at alpha/2: = 2.594e-001
+
+ Results for Alternative Hypothesis and alpha = 0.0500
+
+ Alternative Hypothesis Conclusion
+ Standard deviations are unequal (two sided test) REJECTED
+ Standard deviation 1 is less than standard deviation 2 REJECTED
+ Standard deviation 1 is greater than standard deviation 2 NOT REJECTED
+
+

*/

Modified: branches/release/libs/math/example/find_location_example.cpp
==============================================================================
--- branches/release/libs/math/example/find_location_example.cpp (original)
+++ branches/release/libs/math/example/find_location_example.cpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,6 +1,6 @@
// find_location.cpp

-// Copyright Paul A. Bristow 2008.
+// Copyright Paul A. Bristow 2008, 2010.

// Use, modification and distribution are subject to the
// Boost Software License, Version 1.0.
@@ -13,9 +13,9 @@
// Note that this file contains Quickbook mark-up as well as code
// and comments, don't change any of the special comment mark-ups!

-#ifdef _MSC_VER
-# pragma warning(disable: 4180) // qualifier has no effect (in fusion).
-#endif
+//#ifdef _MSC_VER
+//# pragma warning(disable: 4180) // qualifier has no effect (in Fusion).
+//#endif

//[find_location1
/*`
@@ -40,11 +40,12 @@
 using std::setw; using std::setprecision;
#include <limits>
 using std::numeric_limits;
+
//] [/find_location1]

int main()
{
- cout << "Example: Find location (mean)." << endl;
+ cout << "Example: Find location (or mean)." << endl;
 try
 {
//[find_location2

Modified: branches/release/libs/math/example/find_mean_and_sd_normal.cpp
==============================================================================
--- branches/release/libs/math/example/find_mean_and_sd_normal.cpp (original)
+++ branches/release/libs/math/example/find_mean_and_sd_normal.cpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,6 +1,6 @@
// find_mean_and_sd_normal.cpp

-// Copyright Paul A. Bristow 2007.
+// Copyright Paul A. Bristow 2007, 2010.

// Use, modification and distribution are subject to the
// Boost Software License, Version 1.0.
@@ -36,6 +36,8 @@
 using std::setw; using std::setprecision;
#include <limits>
 using std::numeric_limits;
+#include <stdexcept>
+ using std::exception;
//] [/normal_std Quickbook]

int main()
@@ -364,13 +366,13 @@
//] [/normal_find_location_and_scale_eg Quickbook end]

 }
- catch(const std::exception& e)
+ catch(const exception& e)
 { // Always useful to include try & catch blocks because default policies
 // are to throw exceptions on arguments that cause errors like underflow, overflow.
 // Lacking try & catch blocks, the program will abort without a message below,
 // which may give some helpful clues as to the cause of the exception.
- std::cout <<
- "\n""Message from thrown exception was:\n " << e.what() << std::endl;
+ cout <<
+ "\n""Message from thrown exception was:\n " << e.what() << endl;
 }
 return 0;
} // int main()

Modified: branches/release/libs/math/example/find_root_example.cpp
==============================================================================
--- branches/release/libs/math/example/find_root_example.cpp (original)
+++ branches/release/libs/math/example/find_root_example.cpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,6 +1,6 @@
// find_root_example.cpp

-// Copyright Paul A. Bristow 2007.
+// Copyright Paul A. Bristow 2007, 2010.

// Use, modification and distribution are subject to the
// Boost Software License, Version 1.0.
@@ -29,10 +29,11 @@
 using std::setw; using std::setprecision;
#include <limits>
 using std::numeric_limits;
-//] //[/root_find1]
-
-
+#include <stdexcept>
+ using std::exception;

+//] //[/root_find1]
+
int main()
{
 cout << "Example: Normal distribution, root finding.";

Modified: branches/release/libs/math/example/find_scale_example.cpp
==============================================================================
--- branches/release/libs/math/example/find_scale_example.cpp (original)
+++ branches/release/libs/math/example/find_scale_example.cpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,6 +1,6 @@
// find_scale.cpp

-// Copyright Paul A. Bristow 2007.
+// Copyright Paul A. Bristow 2007, 2010.

// Use, modification and distribution are subject to the
// Boost Software License, Version 1.0.

Modified: branches/release/libs/math/example/laplace_example.cpp
==============================================================================
--- branches/release/libs/math/example/laplace_example.cpp (original)
+++ branches/release/libs/math/example/laplace_example.cpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,6 +1,6 @@
// laplace_example.cpp

-// Copyright Paul A. Bristow 2008.
+// Copyright Paul A. Bristow 2008, 2010.

// Use, modification and distribution are subject to the
// Boost Software License, Version 1.0.
@@ -128,7 +128,6 @@
return 0;
} // int main()

-
/*

Output is:
@@ -166,6 +165,5 @@
95% of gaussian area has a z between 1.95996 and -1.95996
95% of laplace area has a z between 2.99573 and -2.99573

-
*/

Modified: branches/release/libs/math/example/nc_chi_sq_example.cpp
==============================================================================
--- branches/release/libs/math/example/nc_chi_sq_example.cpp (original)
+++ branches/release/libs/math/example/nc_chi_sq_example.cpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,4 +1,5 @@
// Copyright John Maddock 2008
+// Copyright Paul A. Bristow 2010
// Use, modification and distribution are subject to the
// Boost Software License, Version 1.0.
// (See accompanying file LICENSE_1_0.txt
@@ -24,7 +25,12 @@
*/

#include <boost/math/distributions/non_central_chi_squared.hpp>
+using boost::math::chi_squared;
+using boost::math::non_central_chi_squared;
+
#include <iostream>
+using std::cout; using std::endl;
+using std::setprecision;

int main()
{
@@ -32,12 +38,12 @@
 Create a table of the power of the [chi][super 2] test at
 5% significance level, start with a table header:
 */
- std::cout << "[table\n[[[nu]]";
+ cout << "[table\n[[[nu]]";
 for(int lam = 2; lam <= 20; lam += 2)
 {
- std::cout << "[[lambda]=" << lam << "]";
+ cout << "[[lambda]=" << lam << "]";
 }
- std::cout << "]\n";
+ cout << "]\n";

 /*`
 (Note: the enclosing [] brackets are to format as a table in Boost.Quickbook).
@@ -48,26 +54,26 @@

 for(int n = 2; n <= 20; ++n)
 {
- std::cout << "[[" << n << "]";
+ cout << "[[" << n << "]";
 for(int lam = 2; lam <= 20; lam += 2)
 {
 /*`
 Calculate the [chi][super 2] statistic for a 5% significance:
 */
- double cs = quantile(complement(boost::math::chi_squared(n), 0.05));
+ double cs = quantile(complement(chi_squared(n), 0.05));
 /*`
 The power of the test is given by the complement of the CDF
 of the non-central [chi][super 2] distribution:
 */
- double beta = cdf(complement(boost::math::non_central_chi_squared(n, lam), cs));
+ double beta = cdf(complement(non_central_chi_squared(n, lam), cs));
 /*`
 Then output the cell value:
 */
- std::cout << "[" << std::setprecision(3) << beta << "]";
+ cout << "[" << setprecision(3) << beta << "]";
 }
- std::cout << "]" << std::endl;
+ cout << "]" << endl;
 }
- std::cout << "]" << std::endl;
+ cout << "]" << endl;
}

/*`

Modified: branches/release/libs/math/example/neg_binom_confidence_limits.cpp
==============================================================================
--- branches/release/libs/math/example/neg_binom_confidence_limits.cpp (original)
+++ branches/release/libs/math/example/neg_binom_confidence_limits.cpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,7 +1,7 @@
// neg_binomial_confidence_limits.cpp

// Copyright John Maddock 2006
-// Copyright Paul A. Bristow 2007
+// Copyright Paul A. Bristow 2007, 2010
// Use, modification and distribution are subject to the
// Boost Software License, Version 1.0.
// (See accompanying file LICENSE_1_0.txt

Modified: branches/release/libs/math/example/neg_binomial_sample_sizes.cpp
==============================================================================
--- branches/release/libs/math/example/neg_binomial_sample_sizes.cpp (original)
+++ branches/release/libs/math/example/neg_binomial_sample_sizes.cpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,7 +1,8 @@
// neg_binomial_sample_sizes.cpp

-// Copyright Paul A. Bristow 2007
// Copyright John Maddock 2006
+// Copyright Paul A. Bristow 2007, 2010
+
// Use, modification and distribution are subject to the
// Boost Software License, Version 1.0.
// (See accompanying file LICENSE_1_0.txt

Modified: branches/release/libs/math/example/negative_binomial_example1.cpp
==============================================================================
--- branches/release/libs/math/example/negative_binomial_example1.cpp (original)
+++ branches/release/libs/math/example/negative_binomial_example1.cpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,6 +1,6 @@
// negative_binomial_example1.cpp

-// Copyright Paul A. Bristow 2007.
+// Copyright Paul A. Bristow 2007, 2010.

// Use, modification and distribution are subject to the
// Boost Software License, Version 1.0.

Modified: branches/release/libs/math/example/negative_binomial_example2.cpp
==============================================================================
--- branches/release/libs/math/example/negative_binomial_example2.cpp (original)
+++ branches/release/libs/math/example/negative_binomial_example2.cpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,6 +1,6 @@
// negative_binomial_example2.cpp

-// Copyright Paul A. Bristow 2007.
+// Copyright Paul A. Bristow 2007, 2010.

// Use, modification and distribution are subject to the
// Boost Software License, Version 1.0.

Modified: branches/release/libs/math/example/normal_misc_examples.cpp
==============================================================================
--- branches/release/libs/math/example/normal_misc_examples.cpp (original)
+++ branches/release/libs/math/example/normal_misc_examples.cpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,6 +1,6 @@
// normal_misc_examples.cpp

-// Copyright Paul A. Bristow 2007.
+// Copyright Paul A. Bristow 2007, 2010.

// Use, modification and distribution are subject to the
// Boost Software License, Version 1.0.
@@ -504,6 +504,3 @@
95% of bolts are shorter than 4.11

*/
-
-
-

Modified: branches/release/libs/math/example/policy_eg_1.cpp
==============================================================================
--- branches/release/libs/math/example/policy_eg_1.cpp (original)
+++ branches/release/libs/math/example/policy_eg_1.cpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,17 +1,21 @@
// Copyright John Maddock 2007.
+// Copyright Paul A> Bristow 2010
// 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 <iostream>
+using std::cout; using std::endl;
+#include <cerrno> // for ::errno

//[policy_eg_1

#include <boost/math/special_functions/gamma.hpp>
-//
+using boost::math::tgamma;
+
// Define the policy to use:
-//
using namespace boost::math::policies;
+
typedef policy<
domain_error<errno_on_error>,
pole_error<errno_on_error>,
@@ -20,17 +24,34 @@
> c_policy;
//
// Now use the policy when calling tgamma:
-//
+
+// http://msdn.microsoft.com/en-us/library/t3ayayh1.aspx
+// Microsoft errno declared in STDLIB.H as "extern int errno;"
+
int main()
{
- errno = 0;
- std::cout << "Result of tgamma(30000) is: "
- << boost::math::tgamma(30000, c_policy()) << std::endl;
- std::cout << "errno = " << errno << std::endl;
- std::cout << "Result of tgamma(-10) is: "
- << boost::math::tgamma(-10, c_policy()) << std::endl;
- std::cout << "errno = " << errno << std::endl;
-}
+ errno = 0; // Reset.
+ cout << "Result of tgamma(30000) is: "
+ << tgamma(30000, c_policy()) << endl; // Too big parameter
+ cout << "errno = " << errno << endl; // errno 34 Numerical result out of range.
+ cout << "Result of tgamma(-10) is: "
+ << boost::math::tgamma(-10, c_policy()) << endl; // Negative parameter.
+ cout << "errno = " << errno << endl; // error 33 Numerical argument out of domain.
+} // int main()

//]

+/* Output
+
+policy_eg_1.cpp
+ Generating code
+ Finished generating code
+ policy_eg_1.vcxproj -> J:\Cpp\MathToolkit\test\Math_test\Release\policy_eg_1.exe
+ Result of tgamma(30000) is: 1.#INF
+ errno = 34
+ Result of tgamma(-10) is: 1.#QNAN
+ errno = 33
+
+*/
+
+

Modified: branches/release/libs/math/example/policy_eg_10.cpp
==============================================================================
--- branches/release/libs/math/example/policy_eg_10.cpp (original)
+++ branches/release/libs/math/example/policy_eg_10.cpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,4 +1,5 @@
// Copyright John Maddock 2007.
+// Copyright Paul A. Bristow 2010
// 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)
@@ -16,22 +17,42 @@
success fraction of 0.5 once again, and calculate
all the possible quantiles at 0.05 and 0.95.

-Begin by including the needed headers:
+Begin by including the needed headers (and some using statements for conciseness):

*/
-
#include <iostream>
-#include <boost/math/distributions/binomial.hpp>
+using std::cout; using std::endl;
+using std::left; using std::fixed; using std::right; using std::scientific;
+#include <iomanip>
+using std::setw;
+using std::setprecision;

+#include <boost/math/distributions/binomial.hpp>
/*`

Next we'll bring the needed declarations into scope, and
define distribution types for all the available rounding policies:

*/
+// Avoid
+// using namespace std; // and
+// using namespace boost::math;
+// to avoid potential ambiguity of names, like binomial.
+// using namespace boost::math::policies; is small risk, but
+// the necessary items are brought into scope thus:
+
+using boost::math::binomial_distribution;
+using boost::math::policies::policy;
+using boost::math::policies::discrete_quantile;
+
+using boost::math::policies::integer_round_outwards;
+using boost::math::policies::integer_round_down;
+using boost::math::policies::integer_round_up;
+using boost::math::policies::integer_round_nearest;
+using boost::math::policies::integer_round_inwards;
+using boost::math::policies::real;

-using namespace boost::math::policies;
-using namespace boost::math;
+using boost::math::binomial_distribution; // Not std::binomial_distribution.

typedef binomial_distribution<
 double,
@@ -64,108 +85,99 @@
 binom_real_quantile;

/*`
-
Now let's set to work calling those quantiles:
-
*/

int main()
{
- std::cout <<
+ cout <<
 "Testing rounding policies for a 50 sample binomial distribution,\n"
 "with a success fraction of 0.5.\n\n"
 "Lower quantiles are calculated at p = 0.05\n\n"
 "Upper quantiles at p = 0.95.\n\n";

- std::cout << std::setw(25) << std::right
- << "Policy"<< std::setw(18) << std::right
- << "Lower Quantile" << std::setw(18) << std::right
- << "Upper Quantile" << std::endl;
+ cout << setw(25) << right
+ << "Policy"<< setw(18) << right
+ << "Lower Quantile" << setw(18) << right
+ << "Upper Quantile" << endl;

 // Test integer_round_outwards:
- std::cout << std::setw(25) << std::right
+ cout << setw(25) << right
 << "integer_round_outwards"
- << std::setw(18) << std::right
+ << setw(18) << right
 << quantile(binom_round_outwards(50, 0.5), 0.05)
- << std::setw(18) << std::right
+ << setw(18) << right
 << quantile(binom_round_outwards(50, 0.5), 0.95)
- << std::endl;
+ << endl;

 // Test integer_round_inwards:
- std::cout << std::setw(25) << std::right
+ cout << setw(25) << right
 << "integer_round_inwards"
- << std::setw(18) << std::right
+ << setw(18) << right
 << quantile(binom_round_inwards(50, 0.5), 0.05)
- << std::setw(18) << std::right
+ << setw(18) << right
 << quantile(binom_round_inwards(50, 0.5), 0.95)
- << std::endl;
+ << endl;

 // Test integer_round_down:
- std::cout << std::setw(25) << std::right
+ cout << setw(25) << right
 << "integer_round_down"
- << std::setw(18) << std::right
+ << setw(18) << right
 << quantile(binom_round_down(50, 0.5), 0.05)
- << std::setw(18) << std::right
+ << setw(18) << right
 << quantile(binom_round_down(50, 0.5), 0.95)
- << std::endl;
+ << endl;

 // Test integer_round_up:
- std::cout << std::setw(25) << std::right
+ cout << setw(25) << right
 << "integer_round_up"
- << std::setw(18) << std::right
+ << setw(18) << right
 << quantile(binom_round_up(50, 0.5), 0.05)
- << std::setw(18) << std::right
+ << setw(18) << right
 << quantile(binom_round_up(50, 0.5), 0.95)
- << std::endl;
+ << endl;

 // Test integer_round_nearest:
- std::cout << std::setw(25) << std::right
+ cout << setw(25) << right
 << "integer_round_nearest"
- << std::setw(18) << std::right
+ << setw(18) << right
 << quantile(binom_round_nearest(50, 0.5), 0.05)
- << std::setw(18) << std::right
+ << setw(18) << right
 << quantile(binom_round_nearest(50, 0.5), 0.95)
- << std::endl;
+ << endl;

 // Test real:
- std::cout << std::setw(25) << std::right
+ cout << setw(25) << right
 << "real"
- << std::setw(18) << std::right
+ << setw(18) << right
 << quantile(binom_real_quantile(50, 0.5), 0.05)
- << std::setw(18) << std::right
+ << setw(18) << right
 << quantile(binom_real_quantile(50, 0.5), 0.95)
- << std::endl;
-}
+ << endl;
+} // int main()

/*`

Which produces the program output:

[pre
-Testing rounding policies for a 50 sample binomial distribution,
-with a success fraction of 0.5.
-
-Lower quantiles are calculated at p = 0.05
-
-Upper quantiles at p = 0.95.
-
-Testing rounding policies for a 50 sample binomial distribution,
-with a success fraction of 0.5.
-
-Lower quantiles are calculated at p = 0.05
-
-Upper quantiles at p = 0.95.
-
- Policy Lower Quantile Upper Quantile
- integer_round_outwards 18 31
- integer_round_inwards 19 30
- integer_round_down 18 30
- integer_round_up 19 31
- integer_round_nearest 19 30
- real 18.701 30.299
+ policy_eg_10.vcxproj -> J:\Cpp\MathToolkit\test\Math_test\Release\policy_eg_10.exe
+ Testing rounding policies for a 50 sample binomial distribution,
+ with a success fraction of 0.5.
+
+ Lower quantiles are calculated at p = 0.05
+
+ Upper quantiles at p = 0.95.
+
+ Policy Lower Quantile Upper Quantile
+ integer_round_outwards 18 31
+ integer_round_inwards 19 30
+ integer_round_down 18 30
+ integer_round_up 19 31
+ integer_round_nearest 19 30
+ real 18.701 30.299
]

*/

-//] ends quickbook import
-
+//] //[policy_eg_10] ends quickbook import.

Modified: branches/release/libs/math/example/policy_eg_2.cpp
==============================================================================
--- branches/release/libs/math/example/policy_eg_2.cpp (original)
+++ branches/release/libs/math/example/policy_eg_2.cpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,17 +1,28 @@
// Copyright John Maddock 2007.
+// Copyright Paul A. Bristow 2010
// 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 <iostream>
+using std::cout; using std::endl;
+#include <cerrno> // for ::errno

//[policy_eg_2

#include <boost/math/special_functions/gamma.hpp>
+using boost::math::tgamma;

int main()
{
- using namespace boost::math::policies;
+ // using namespace boost::math::policies; // or
+ using boost::math::policies::errno_on_error;
+ using boost::math::policies::make_policy;
+ using boost::math::policies::pole_error;
+ using boost::math::policies::domain_error;
+ using boost::math::policies::overflow_error;
+ using boost::math::policies::evaluation_error;
+
 errno = 0;
 std::cout << "Result of tgamma(30000) is: "
 << boost::math::tgamma(
@@ -40,5 +51,15 @@
 std::cout << "errno = " << errno << std::endl;
}

-//]
+//] //[/policy_eg_2]
+
+/*
+
+Output:
+
+ Result of tgamma(30000) is: 1.#INF
+ errno = 34
+ Result of tgamma(-10) is: 1.#QNAN
+ errno = 33
+*/

Modified: branches/release/libs/math/example/policy_eg_3.cpp
==============================================================================
--- branches/release/libs/math/example/policy_eg_3.cpp (original)
+++ branches/release/libs/math/example/policy_eg_3.cpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,5 +1,5 @@
// Copyright John Maddock 2007.
-// Copyright Paul A. Bristow 2007.
+// Copyright Paul A. Bristow 2007, 2010.

// Use, modification and distribution are subject to the
// Boost Software License, Version 1.0. (See accompanying file
@@ -11,32 +11,45 @@
#endif

#include <iostream>
+using std::cout; using std::endl;

//[policy_eg_3

#include <boost/math/distributions/binomial.hpp>
+using boost::math::binomial_distribution;
+
+// Begin by defining a policy type, that gives the behaviour we want:
+
+//using namespace boost::math::policies; or explicitly
+using boost::math::policies::policy;
+
+using boost::math::policies::promote_float;
+using boost::math::policies::discrete_quantile;
+using boost::math::policies::integer_round_nearest;

-//
-// Begin by defining a policy type, that gives the
-// behaviour we want:
-//
-using namespace boost::math::policies;
typedef policy<
- promote_float<false>,
- discrete_quantile<integer_round_nearest>
+ promote_float<false>, // Do not promote to double.
+ discrete_quantile<integer_round_nearest> // Round result to nearest integer.
> mypolicy;
//
-// Then define a distribution that uses it:
-//
+// Then define a new distribution that uses it:
typedef boost::math::binomial_distribution<float, mypolicy> mybinom;
-//
+
// And now use it to get the quantile:
-//
+
int main()
{
- std::cout << "quantile is: " <<
- quantile(mybinom(200, 0.25), 0.05) << std::endl;
+ cout << "quantile(mybinom(200, 0.25), 0.05) is: " <<
+ quantile(mybinom(200, 0.25), 0.05) << endl;
}

//]

+/*
+
+Output:
+
+ quantile(mybinom(200, 0.25), 0.05) is: 40
+
+*/
+

Modified: branches/release/libs/math/example/policy_eg_4.cpp
==============================================================================
--- branches/release/libs/math/example/policy_eg_4.cpp (original)
+++ branches/release/libs/math/example/policy_eg_4.cpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,4 +1,6 @@
// Copyright John Maddock 2007.
+// Copyright Paul A. Bristow 2010
+
// 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)
@@ -7,6 +9,8 @@
// and comments, don't change any of the special comment mark-ups!

#include <iostream>
+using std::cout; using std::endl;
+#include <cerrno> // for ::errno

//[policy_eg_4

@@ -14,36 +18,41 @@
Suppose we want `C::foo()` to behave in a C-compatible way and set
`::errno` on error rather than throwing any exceptions.

-We'll begin by including the needed header:
+We'll begin by including the needed header for our function:
*/

#include <boost/math/special_functions.hpp>
+//using boost::math::tgamma; // Not needed because using C::tgamma.

/*`
-
Open up the "C" namespace that we'll use for our functions, and
-define the policy type we want: in this case one that sets
-::errno rather than throwing exceptions. Any policies we don't
-specify here will inherit the defaults:
+define the policy type we want: in this case a C-style one that sets
+::errno and returns a standard value, rather than throwing exceptions.

+Any policies we don't specify here will inherit the defaults.
*/

-namespace C{
-
-using namespace boost::math::policies;
-
-typedef policy<
- domain_error<errno_on_error>,
- pole_error<errno_on_error>,
- overflow_error<errno_on_error>,
- evaluation_error<errno_on_error>
-> c_policy;
+namespace C
+{ // To hold our C-style policy.
+ //using namespace boost::math::policies; or explicitly:
+ using boost::math::policies::policy;
+
+ using boost::math::policies::domain_error;
+ using boost::math::policies::pole_error;
+ using boost::math::policies::overflow_error;
+ using boost::math::policies::evaluation_error;
+ using boost::math::policies::errno_on_error;
+
+ typedef policy<
+ domain_error<errno_on_error>,
+ pole_error<errno_on_error>,
+ overflow_error<errno_on_error>,
+ evaluation_error<errno_on_error>
+ > c_policy;

/*`
-
All we need do now is invoke the BOOST_MATH_DECLARE_SPECIAL_FUNCTIONS
-macro passing our policy type as the single argument:
-
+macro passing our policy type c_policy as the single argument:
*/

BOOST_MATH_DECLARE_SPECIAL_FUNCTIONS(c_policy)
@@ -51,7 +60,6 @@
} // close namespace C

/*`
-
We now have a set of forwarding functions defined in namespace C
that all look something like this:

@@ -64,21 +72,19 @@
}
``

-So that when we call `C::tgamma(z)` we really end up calling
+So that when we call `C::tgamma(z)`, we really end up calling
`boost::math::tgamma(z, C::c_policy())`:
-
*/

-
int main()
{
errno = 0;
- std::cout << "Result of tgamma(30000) is: "
- << C::tgamma(30000) << std::endl;
- std::cout << "errno = " << errno << std::endl;
- std::cout << "Result of tgamma(-10) is: "
- << C::tgamma(-10) << std::endl;
- std::cout << "errno = " << errno << std::endl;
+ cout << "Result of tgamma(30000) is: "
+ << C::tgamma(30000) << endl; // Note using C::tgamma
+ cout << "errno = " << errno << endl; // errno = 34
+ cout << "Result of tgamma(-10) is: "
+ << C::tgamma(-10) << endl;
+ cout << "errno = " << errno << endl; // errno = 33, overwriting previous value of 34.
}

/*`
@@ -92,11 +98,10 @@
errno = 33
]

-This mechanism is particularly useful when we want to define a
-project-wide policy, and don't want to modify the Boost source
-or set - possibly fragile and easy to forget - project wide
-build macros.
+This mechanism is particularly useful when we want to define a project-wide policy,
+and don't want to modify the Boost source,
+or to set project wide build macros (possibly fragile and easy to forget).

*/
-//]
+//] //[/policy_eg_4]

Modified: branches/release/libs/math/example/policy_eg_5.cpp
==============================================================================
--- branches/release/libs/math/example/policy_eg_5.cpp (original)
+++ branches/release/libs/math/example/policy_eg_5.cpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,4 +1,5 @@
// Copyright John Maddock 2007.
+// Copyright Paul A. Bristow 2010
// 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)
@@ -7,12 +8,18 @@
// and comments, don't change any of the special comment mark-ups!

#include <iostream>
+using std::cout; using std::endl;
+#include <cerrno> // for ::errno

//[policy_eg_5

#include <boost/math/special_functions.hpp>
+// using boost::math::tgamma; // Would create an ambiguity between
+// 'double boost::math::tgamma<int>(T)' and
+// 'double 'anonymous-namespace'::tgamma<int>(RT)'.

-namespace {
+namespace
+{ // unnamed

using namespace boost::math::policies;

@@ -20,22 +27,40 @@
 domain_error<errno_on_error>,
 pole_error<errno_on_error>,
 overflow_error<errno_on_error>,
- evaluation_error<errno_on_error>
+ evaluation_error<errno_on_error>
> c_policy;

BOOST_MATH_DECLARE_SPECIAL_FUNCTIONS(c_policy)

+/*`
+So that when we call `tgamma(z)`, we really end up calling
+ `boost::math::tgamma(z, anonymous-namespace::c_policy())`.
+*/
+
} // close unnamed namespace

int main()
{
 errno = 0;
- std::cout << "Result of tgamma(30000) is: "
- << tgamma(30000) << std::endl;
- std::cout << "errno = " << errno << std::endl;
- std::cout << "Result of tgamma(-10) is: "
- << tgamma(-10) << std::endl;
- std::cout << "errno = " << errno << std::endl;
+ cout << "Result of tgamma(30000) is: "
+ << tgamma(30000) << endl;
+ // tgamma in unnamed namespace in this translation unit (file) only.
+ cout << "errno = " << errno << endl;
+ cout << "Result of tgamma(-10) is: "
+ << tgamma(-10) << endl;
+ cout << "errno = " << errno << endl;
+ // Default tgamma policy would throw an exception, and abort.
}

-//]
+//] //[/policy_eg_5]
+
+/*
+Output:
+
+ Result of tgamma(30000) is: 1.#INF
+ errno = 34
+ Result of tgamma(-10) is: 1.#QNAN
+ errno = 33
+
+
+*/

Modified: branches/release/libs/math/example/policy_eg_6.cpp
==============================================================================
--- branches/release/libs/math/example/policy_eg_6.cpp (original)
+++ branches/release/libs/math/example/policy_eg_6.cpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,4 +1,5 @@
// Copyright John Maddock 2007.
+// Copyright Paul A. Bristow 2010
// 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)
@@ -7,6 +8,8 @@
// and comments, don't change any of the special comment mark-ups!

#include <iostream>
+using std::cout; using std::endl;
+#include <cerrno> // for ::errno

//[policy_eg_6

@@ -18,36 +21,37 @@
* Return the closest integer result from the quantiles of discrete
distributions.

-We'll begin by including the needed header:
+We'll begin by including the needed header for all the distributions:
*/

#include <boost/math/distributions.hpp>

/*`

-Open up an appropriate namespace for our distributions, and
-define the policy type we want. Any policies we don't
-specify here will inherit the defaults:
+Open up an appropriate namespace, calling it `my_distributions`,
+for our distributions, and define the policy type we want.
+Any policies we don't specify here will inherit the defaults:

*/

-namespace my_distributions{
-
-using namespace boost::math::policies;
+namespace my_distributions
+{
+ using namespace boost::math::policies;
+ // using boost::math::policies::errno_on_error; // etc.

-typedef policy<
- // return infinity and set errno rather than throw:
- overflow_error<errno_on_error>,
- // Don't promote double -> long double internally:
- promote_double<false>,
- // Return the closest integer result for discrete quantiles:
- discrete_quantile<integer_round_nearest>
-> my_policy;
+ typedef policy<
+ // return infinity and set errno rather than throw:
+ overflow_error<errno_on_error>,
+ // Don't promote double -> long double internally:
+ promote_double<false>,
+ // Return the closest integer result for discrete quantiles:
+ discrete_quantile<integer_round_nearest>
+ > my_policy;

/*`

All we need do now is invoke the BOOST_MATH_DECLARE_DISTRIBUTIONS
-macro passing the floating point and policy types as arguments:
+macro passing the floating point type `double` and policy types `my_policy` as arguments:

*/

@@ -57,7 +61,7 @@

/*`

-We now have a set of typedefs defined in namespace my_namespace
+We now have a set of typedefs defined in namespace my_distributions
that all look something like this:

``
@@ -67,34 +71,32 @@
// etc
``

-So that when we use my_namespace::normal we really end up using
+So that when we use my_distributions::normal we really end up using
`boost::math::normal_distribution<double, my_policy>`:

*/

-
int main()
{
- //
- // Start with something we know will overflow:
- //
+ // Construct distribution with something we know will overflow
+ // (using double rather than if promoted to long double):
 my_distributions::normal norm(10, 2);
+
 errno = 0;
- std::cout << "Result of quantile(norm, 0) is: "
- << quantile(norm, 0) << std::endl;
- std::cout << "errno = " << errno << std::endl;
+ cout << "Result of quantile(norm, 0) is: "
+ << quantile(norm, 0) << endl; // -infinity.
+ cout << "errno = " << errno << endl;
 errno = 0;
- std::cout << "Result of quantile(norm, 1) is: "
- << quantile(norm, 1) << std::endl;
- std::cout << "errno = " << errno << std::endl;
- //
- // Now try a discrete distribution:
- //
+ cout << "Result of quantile(norm, 1) is: "
+ << quantile(norm, 1) << endl; // +infinity.
+ cout << "errno = " << errno << endl;
+
+ // Now try a discrete distribution.
 my_distributions::binomial binom(20, 0.25);
- std::cout << "Result of quantile(binom, 0.05) is: "
- << quantile(binom, 0.05) << std::endl;
- std::cout << "Result of quantile(complement(binom, 0.05)) is: "
- << quantile(complement(binom, 0.05)) << std::endl;
+ cout << "Result of quantile(binom, 0.05) is: "
+ << quantile(binom, 0.05) << endl; // To check we get integer results.
+ cout << "Result of quantile(complement(binom, 0.05)) is: "
+ << quantile(complement(binom, 0.05)) << endl;
}

/*`
@@ -110,10 +112,10 @@
Result of quantile(complement(binom, 0.05)) is: 8
]

-This mechanism is particularly useful when we want to define a
+This mechanism is particularly useful when we want to define a
project-wide policy, and don't want to modify the Boost source
-or set - possibly fragile and easy to forget - project wide
-build macros.
+or set project wide build macros (possibly fragile and easy to forget).

-*/ //] ends quickbook imported section
+*/
+//] //[/policy_eg_6]

Modified: branches/release/libs/math/example/policy_eg_7.cpp
==============================================================================
--- branches/release/libs/math/example/policy_eg_7.cpp (original)
+++ branches/release/libs/math/example/policy_eg_7.cpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,4 +1,5 @@
// Copyright John Maddock 2007.
+// Copyright Paul A. Bristow 2010
// 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)
@@ -7,51 +8,66 @@
// and comments, don't change any of the special comment mark-ups!

#include <iostream>
+using std::cout; using std::endl;
+#include <cerrno> // for ::errno

//[policy_eg_7

-#include <boost/math/distributions.hpp>
+#include <boost/math/distributions.hpp> // All distributions.
+// using boost::math::normal; // Would create an ambguity between
+// boost::math::normal_distribution<RealType> boost::math::normal and
+// 'anonymous-namespace'::normal'.
+
+namespace
+{ // anonymous or unnnamed (rather than named as in policy_eg_6.cpp).
+
+ using namespace boost::math::policies;
+ // using boost::math::policies::errno_on_error; // etc.
+ typedef policy<
+ // return infinity and set errno rather than throw:
+ overflow_error<errno_on_error>,
+ // Don't promote double -> long double internally:
+ promote_double<false>,
+ // Return the closest integer result for discrete quantiles:
+ discrete_quantile<integer_round_nearest>
+ > my_policy;

-namespace {
-
-using namespace boost::math::policies;
-
-typedef policy<
- // return infinity and set errno rather than throw:
- overflow_error<errno_on_error>,
- // Don't promote double -> long double internally:
- promote_double<false>,
- // Return the closest integer result for discrete quantiles:
- discrete_quantile<integer_round_nearest>
-> my_policy;
-
-BOOST_MATH_DECLARE_DISTRIBUTIONS(double, my_policy)
+ BOOST_MATH_DECLARE_DISTRIBUTIONS(double, my_policy)

} // close namespace my_namespace

int main()
{
- //
- // Start with something we know will overflow:
- //
- normal norm(10, 2);
+ // Construct distribution with something we know will overflow.
+ normal norm(10, 2); // using 'anonymous-namespace'::normal
 errno = 0;
- std::cout << "Result of quantile(norm, 0) is: "
- << quantile(norm, 0) << std::endl;
- std::cout << "errno = " << errno << std::endl;
+ cout << "Result of quantile(norm, 0) is: "
+ << quantile(norm, 0) << endl;
+ cout << "errno = " << errno << endl;
 errno = 0;
- std::cout << "Result of quantile(norm, 1) is: "
- << quantile(norm, 1) << std::endl;
- std::cout << "errno = " << errno << std::endl;
+ cout << "Result of quantile(norm, 1) is: "
+ << quantile(norm, 1) << endl;
+ cout << "errno = " << errno << endl;
 //
 // Now try a discrete distribution:
- //
 binomial binom(20, 0.25);
- std::cout << "Result of quantile(binom, 0.05) is: "
- << quantile(binom, 0.05) << std::endl;
- std::cout << "Result of quantile(complement(binom, 0.05)) is: "
- << quantile(complement(binom, 0.05)) << std::endl;
+ cout << "Result of quantile(binom, 0.05) is: "
+ << quantile(binom, 0.05) << endl;
+ cout << "Result of quantile(complement(binom, 0.05)) is: "
+ << quantile(complement(binom, 0.05)) << endl;
}

-//] ends quickbook imported section
+//] //[/policy_eg_7]
+
+/*
+
+Output:
+
+ Result of quantile(norm, 0) is: -1.#INF
+ errno = 34
+ Result of quantile(norm, 1) is: 1.#INF
+ errno = 34
+ Result of quantile(binom, 0.05) is: 1
+ Result of quantile(complement(binom, 0.05)) is: 8

+*/

Modified: branches/release/libs/math/example/policy_eg_8.cpp
==============================================================================
--- branches/release/libs/math/example/policy_eg_8.cpp (original)
+++ branches/release/libs/math/example/policy_eg_8.cpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,5 +1,5 @@
// Copyright John Maddock 2007.
-// Copyright Paul a. Bristow 2007
+// Copyright Paul a. Bristow 2010
// 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)
@@ -8,19 +8,18 @@
// and comments, don't change any of the special comment mark-ups!

#ifdef _MSC_VER
-# pragma warning (disable : 4100) // 'unreferenced formal parameter
+# pragma warning (disable : 4100) // unreferenced formal parameters
#endif

-
#include <iostream>
+using std::cout; using std::endl; using std::cerr;

//[policy_eg_8

/*`
-
Suppose we want our own user-defined error handlers rather than the
-any of the default ones supplied by the library to be used. If
-we set the policy for a specific type of error to `user_error`
+any of the default ones supplied by the library to be used.
+If we set the policy for a specific type of error to `user_error`
then the library will call a user-supplied error handler.
These are forward declared, but not defined in
boost/math/policies/error_handling.hpp like this:
@@ -45,38 +44,37 @@
}}} // namespaces

So out first job is to include the header we want to use, and then
-provide definitions for the user-defined error handlers we want to use:
-
+provide definitions for our user-defined error handlers that we want to use.
+We only provide our special domain and pole error handlers;
+other errors like overflow and underflow use the default.
*/

-#include <iostream>
#include <boost/math/special_functions.hpp>

-namespace boost{ namespace math{ namespace policies{
-
-template <class T>
-T user_domain_error(const char* function, const char* message, const T& val)
+namespace boost{ namespace math
{
- std::cerr << "Domain Error." << std::endl;
- return std::numeric_limits<T>::quiet_NaN();
-}
-
-template <class T>
-T user_pole_error(const char* function, const char* message, const T& val)
-{
- std::cerr << "Pole Error." << std::endl;
- return std::numeric_limits<T>::quiet_NaN();
-}
-
-
-}}} // namespaces
+ namespace policies
+ {
+ template <class T>
+ T user_domain_error(const char* function, const char* message, const T& val)
+ { // Ignoring function, message and val for this example, perhaps unhelpfully.
+ cerr << "Domain Error!" << endl;
+ return std::numeric_limits<T>::quiet_NaN();
+ }
+
+ template <class T>
+ T user_pole_error(const char* function, const char* message, const T& val)
+ { // Ignoring function, message and val for this example, perhaps unhelpfully.
+ cerr << "Pole Error!" << endl;
+ return std::numeric_limits<T>::quiet_NaN();
+ }
+ } // namespace policies
+}} // namespace boost{ namespace math

/*`
-
Now we'll need to define a suitable policy that will call these handlers,
and define some forwarding functions that make use of the policy:
-
*/

namespace{
@@ -93,7 +91,6 @@
} // close unnamed namespace

/*`
-
We now have a set of forwarding functions defined in an unnamed namespace
that all look something like this:

@@ -108,17 +105,15 @@

So that when we call `tgamma(z)` we really end up calling
`boost::math::tgamma(z, user_error_policy())`, and any
-errors will get directed to our own error handlers:
-
+errors will get directed to our own error handlers.
*/

-
int main()
{
- std::cout << "Result of erf_inv(-10) is: "
- << erf_inv(-10) << std::endl;
- std::cout << "Result of tgamma(-10) is: "
- << tgamma(-10) << std::endl;
+ cout << "Result of erf_inv(-10) is: "
+ << erf_inv(-10) << endl;
+ cout << "Result of tgamma(-10) is: "
+ << tgamma(-10) << endl;
}

/*`
@@ -126,12 +121,11 @@
Which outputs:

[pre
-Domain Error.
-Result of erf_inv(-10) is: 1.#QNAN
-Pole Error.
-Result of tgamma(-10) is: 1.#QNAN
+ Domain Error!
+ Pole Error!
+ Result of erf_inv(-10) is: 1.#QNAN
+ Result of tgamma(-10) is: 1.#QNAN
]
*/

-//]
-
+//] // //[/policy_eg_8]

Modified: branches/release/libs/math/example/policy_eg_9.cpp
==============================================================================
--- branches/release/libs/math/example/policy_eg_9.cpp (original)
+++ branches/release/libs/math/example/policy_eg_9.cpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,4 +1,5 @@
// Copyright John Maddock 2007.
+// Copyright Paul A. Bristow 2010
// 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)
@@ -7,11 +8,11 @@
// and comments, don't change any of the special comment mark-ups!

#include <iostream>
+using std::cout; using std::endl; using std::cerr;

//[policy_eg_9

/*`
-
The previous example was all well and good, but the custom error handlers
didn't really do much of any use. In this example we'll implement all
the custom handlers and show how the information provided to them can be
@@ -21,8 +22,8 @@

 template <class T>
 T user_``['error_type]``(
- const char* function,
- const char* message,
+ const char* function,
+ const char* message,
 const T& val);

and accepts three arguments:
@@ -31,7 +32,7 @@
[[const char* function]
 [The name of the function that raised the error, this string
 contains one or more %1% format specifiers that should be
- replaced by the name of type T.]]
+ replaced by the name of real type T, like float or double.]]
[[const char* message]
 [A message associated with the error, normally this
 contains a %1% format specifier that should be replaced with
@@ -49,42 +50,42 @@

*/

-#include <iostream>
#include <boost/math/special_functions.hpp>

/*`
-
-Next we'll implement the error handlers for each type of error,
+Next we'll implement our own error handlers for each type of error,
starting with domain errors:
-
*/

-namespace boost{ namespace math{ namespace policies{
+namespace boost{ namespace math{
+namespace policies
+{

template <class T>
T user_domain_error(const char* function, const char* message, const T& val)
{
 /*`
- We'll begin with a bit of defensive programming:
+ We'll begin with a bit of defensive programming in case function or message are empty:
 */
 if(function == 0)
 function = "Unknown function with arguments of type %1%";
 if(message == 0)
 message = "Cause unknown with bad argument %1%";
 /*`
- Next we'll format the name of the function with the name of type T:
+ Next we'll format the name of the function with the name of type T, perhaps double:
 */
 std::string msg("Error in function ");
 msg += (boost::format(function) % typeid(T).name()).str();
 /*`
 Then likewise format the error message with the value of parameter /val/,
- making sure we output all the digits of /val/:
+ making sure we output all the potentially significant digits of /val/:
 */
 msg += ": \n";
 int prec = 2 + (std::numeric_limits<T>::digits * 30103UL) / 100000UL;
+ // int prec = std::numeric_limits<T>::max_digits10; // For C++0X Standard Library
 msg += (boost::format(message) % boost::io::group(std::setprecision(prec), val)).str();
 /*`
- Now we just have to do something with the message, we could throw an
+ Now we just have to do something with the message, we could throw an
 exception, but for the purposes of this example we'll just dump the message
 to std::cerr:
 */
@@ -96,7 +97,7 @@
}

/*`
-Pole errors are essentially a special case of domain errors,
+Pole errors are essentially a special case of domain errors,
so in this example we'll just return the result of a domain error:
*/

@@ -125,9 +126,9 @@
 msg += message;

 std::cerr << msg << std::endl;
-
+
 // Value passed to the function is an infinity, just return it:
- return val;
+ return val;
}

/*`
@@ -149,9 +150,9 @@
 msg += message;

 std::cerr << msg << std::endl;
-
+
 // Value passed to the function is zero, just return it:
- return val;
+ return val;
}

/*`
@@ -173,13 +174,13 @@
 msg += message;

 std::cerr << msg << std::endl;
-
+
 // Value passed to the function is denormalised, just return it:
- return val;
+ return val;
}

/*`
-Which leaves us with evaluation errors, these occur when an internal
+Which leaves us with evaluation errors: these occur when an internal
error occurs that prevents the function being fully evaluated.
The parameter /val/ contains the closest approximation to the result
found so far:
@@ -191,7 +192,7 @@
 if(function == 0)
 function = "Unknown function with arguments of type %1%";
 if(message == 0)
- message = "An internal evaluation error occured with "
+ message = "An internal evaluation error occurred with "
 "the best value calculated so far of %1%";

 std::string msg("Error in function ");
@@ -199,27 +200,27 @@

 msg += ": \n";
 int prec = 2 + (std::numeric_limits<T>::digits * 30103UL) / 100000UL;
+ // int prec = std::numeric_limits<T>::max_digits10; // For C++0X Standard Library
 msg += (boost::format(message) % boost::io::group(std::setprecision(prec), val)).str();

 std::cerr << msg << std::endl;

- // What do we return here? This is generally a fatal error,
- // that should never occur, just return a NaN for the purposes
- // of the example:
+ // What do we return here? This is generally a fatal error, that should never occur,
+ // so we just return a NaN for the purposes of the example:
 return std::numeric_limits<T>::quiet_NaN();
}

-}}} // namespaces
+} // policies
+}} // boost::math

/*`
-
Now we'll need to define a suitable policy that will call these handlers,
and define some forwarding functions that make use of the policy:
-
*/

-namespace{
+namespace
+{ // unnamed.

using namespace boost::math::policies;

@@ -234,11 +235,10 @@

BOOST_MATH_DECLARE_SPECIAL_FUNCTIONS(user_error_policy)

-} // close unnamed namespace
+} // unnamed namespace

/*`
-
-We now have a set of forwarding functions defined in an unnamed namespace
+We now have a set of forwarding functions, defined in an unnamed namespace,
that all look something like this:

``
@@ -253,28 +253,26 @@
So that when we call `tgamma(z)` we really end up calling
`boost::math::tgamma(z, user_error_policy())`, and any
errors will get directed to our own error handlers:
-
*/

-
int main()
{
 // Raise a domain error:
- std::cout << "Result of erf_inv(-10) is: "
- << erf_inv(-10) << std::endl << std::endl;
+ cout << "Result of erf_inv(-10) is: "
+ << erf_inv(-10) << std::endl << endl;
 // Raise a pole error:
- std::cout << "Result of tgamma(-10) is: "
- << tgamma(-10) << std::endl << std::endl;
+ cout << "Result of tgamma(-10) is: "
+ << tgamma(-10) << std::endl << endl;
 // Raise an overflow error:
- std::cout << "Result of tgamma(3000) is: "
- << tgamma(3000) << std::endl << std::endl;
+ cout << "Result of tgamma(3000) is: "
+ << tgamma(3000) << std::endl << endl;
 // Raise an underflow error:
- std::cout << "Result of tgamma(-190.5) is: "
- << tgamma(-190.5) << std::endl << std::endl;
+ cout << "Result of tgamma(-190.5) is: "
+ << tgamma(-190.5) << std::endl << endl;
 // Unfortunately we can't predicably raise a denormalised
 // result, nor can we raise an evaluation error in this example
 // since these should never really occur!
-}
+} // int main()

/*`

@@ -307,10 +305,8 @@
of the fact that many functions are implemented in terms of one or more
sub-routines each of which may have it's own error handling. For example
`tgamma(-190.5)` is implemented in terms of `tgamma(190.5)` - which overflows -
-the reflection formula for `tgamma` then notices that it's dividing by
-infinity and underflows.
-
+the reflection formula for `tgamma` then notices that it is dividing by
+infinity and so underflows.
*/

-//]
-
+//] //[/policy_eg_9]

Modified: branches/release/libs/math/example/policy_ref_snip1.cpp
==============================================================================
--- branches/release/libs/math/example/policy_ref_snip1.cpp (original)
+++ branches/release/libs/math/example/policy_ref_snip1.cpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,4 +1,5 @@
// Copyright John Maddock 2007.
+// Copyright Paul A. Bristow 2010.
// 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)
@@ -6,39 +7,69 @@
// Note that this file contains quickbook mark-up as well as code
// and comments, don't change any of the special comment mark-ups!

-double some_value = 0;
-
//[policy_ref_snip1

#include <boost/math/special_functions/gamma.hpp>
+using boost::math::tgamma;

-using namespace boost::math::policies;
-using namespace boost::math;
+//using namespace boost::math::policies; may also be convenient.
+using boost::math::policies::policy;
+using boost::math::policies::evaluation_error;
+using boost::math::policies::domain_error;
+using boost::math::policies::overflow_error;
+using boost::math::policies::domain_error;
+using boost::math::policies::pole_error;
+using boost::math::policies::errno_on_error;

// Define a policy:
typedef policy<
- domain_error<errno_on_error>,
- pole_error<errno_on_error>,
- overflow_error<errno_on_error>,
- policies::evaluation_error<errno_on_error>
- > my_policy;
-
-// call the function:
-double t1 = tgamma(some_value, my_policy());
-
-// Alternatively we could use make_policy and define everything at the call site:
-double t2 = tgamma(some_value, make_policy(
- domain_error<errno_on_error>(),
- pole_error<errno_on_error>(),
- overflow_error<errno_on_error>(),
- policies::evaluation_error<errno_on_error>()
- ));
-
+ domain_error<errno_on_error>,
+ pole_error<errno_on_error>,
+ overflow_error<errno_on_error>,
+ evaluation_error<errno_on_error>
+> my_policy;
+
+double my_value = 0.; //
+
+// Call the function applying my_policy:
+double t1 = tgamma(my_value, my_policy());
+
+// Alternatively (and equivalently) we could use helpful function
+// make_policy and define everything at the call site:
+double t2 = tgamma(my_value,
+ make_policy(
+ domain_error<errno_on_error>(),
+ pole_error<errno_on_error>(),
+ overflow_error<errno_on_error>(),
+ evaluation_error<errno_on_error>() )
+ );
//]

#include <iostream>
+using std::cout; using std::endl;

int main()
{
- std::cout << t1 << " " << t2 << std::endl;
+ cout << "my_value = " << my_value << endl;
+ try
+ { // First with default policy - throw an exception.
+ cout << "tgamma(my_value) = " << tgamma(my_value) << endl;
+ }
+ catch(const std::exception& e)
+ {
+ cout <<"\n""Message from thrown exception was:\n " << e.what() << endl;
+ }
+
+ cout << "tgamma(my_value, my_policy() = " << t1 << endl;
+ cout << "tgamma(my_value, make_policy(domain_error<errno_on_error>(), pole_error<errno_on_error>(), overflow_error<errno_on_error>(), evaluation_error<errno_on_error>() ) = " << t2 << endl;
}
+
+/*
+Output:
+ my_value = 0
+
+ Message from thrown exception was:
+ Error in function boost::math::tgamma<long double>(long double): Evaluation of tgamma at a negative integer 0.
+ tgamma(my_value, my_policy() = 1.#QNAN
+ tgamma(my_value, make_policy(domain_error<errno_on_error>(), pole_error<errno_on_error>(), overflow_error<errno_on_error>(), evaluation_error<errno_on_error>() ) = 1.#QNAN
+*/

Modified: branches/release/libs/math/example/policy_ref_snip10.cpp
==============================================================================
--- branches/release/libs/math/example/policy_ref_snip10.cpp (original)
+++ branches/release/libs/math/example/policy_ref_snip10.cpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,4 +1,5 @@
// Copyright John Maddock 2007.
+// Copyright Paul A. Bristow 2010
// 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)
@@ -6,20 +7,33 @@
// Note that this file contains quickbook mark-up as well as code
// and comments, don't change any of the special comment mark-ups!

+// Setting precision in a single function call using make_policy.
+
+#include <iostream>
+using std::cout; using std::endl;
+
//[policy_ref_snip10

#include <boost/math/special_functions/gamma.hpp>
+using boost::math::tgamma;

-using namespace boost::math;
using namespace boost::math::policies;

-double t = tgamma(12, policy<digits10<5> >());
+double t = tgamma(12, policy<digits10<5> >()); // Concise make_policy.
+
+//] //[/policy_ref_snip10]

-//]

-#include <iostream>

int main()
{
- std::cout << t << std::endl;
+ cout << "tgamma(12, policy<digits10<5> >()) = "<< t << endl;
}
+
+/*
+
+Output:
+
+ tgamma(12, policy<digits10<5> >()) = 3.99168e+007
+
+*/
\ No newline at end of file

Modified: branches/release/libs/math/example/policy_ref_snip11.cpp
==============================================================================
--- branches/release/libs/math/example/policy_ref_snip11.cpp (original)
+++ branches/release/libs/math/example/policy_ref_snip11.cpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,4 +1,5 @@
// Copyright John Maddock 2007.
+// Copyright Paul A. Bristow 2010
// 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)
@@ -6,22 +7,38 @@
// Note that this file contains quickbook mark-up as well as code
// and comments, don't change any of the special comment mark-ups!

+#include <iostream>
+using std::cout; using std::endl;
+
+// Setting (approximate) precision 25 bits in a single function call using make_policy.
+
//[policy_ref_snip11

#include <boost/math/distributions/normal.hpp>
+using boost::math::normal_distribution;

-using namespace boost::math;
using namespace boost::math::policies;

-double q = quantile(
- normal_distribution<double, policy<digits2<25> > >(),
- 0.05);
+const int bits = 25; // approximate precision.

-//]
+double q = quantile(
+ normal_distribution<double, policy<digits2<bits> > >(),
+ 0.05); // 5% quantile.

-#include <iostream>
+//] //[/policy_ref_snip11]

int main()
{
- std::cout << q << std::endl;
+ std::streamsize p = 2 + (bits * 30103UL) / 100000UL;
+ // Approximate number of significant decimal digits for 25 bits.
+ cout.precision(p);
+ cout << bits << " binary bits is approoximately equivalent to " < > >(), 0.05 = "
+ << q << endl; // -1.64485
}
+
+/*
+Output:
+ 25 binary bits is approoximately equivalent to 9 decimal digits
+ quantile(normal_distribution<double, policy<digits2<25> > >(), 0.05 = -1.64485363
+ */
\ No newline at end of file

Modified: branches/release/libs/math/example/policy_ref_snip12.cpp
==============================================================================
--- branches/release/libs/math/example/policy_ref_snip12.cpp (original)
+++ branches/release/libs/math/example/policy_ref_snip12.cpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,4 +1,5 @@
// Copyright John Maddock 2007.
+// Copyright Paul A. Bristow 2010
// 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)
@@ -6,33 +7,49 @@
// Note that this file contains quickbook mark-up as well as code
// and comments, don't change any of the special comment mark-ups!

-//[policy_ref_snip12
+// Define tgamma function with a no overflow policy
+// into a specific namespace-scope.

-#include <boost/math/special_functions/gamma.hpp>
+#include <iostream>
+using std::cout; using std::endl;

-namespace myspace{
+//[policy_ref_snip12

-using namespace boost::math::policies;
+#include <boost/math/special_functions/gamma.hpp>
+//using boost::math::tgamma;
+// Need not declare using boost::math::tgamma here,
+// because will define tgamma in myspace using macro below.

-// Define a policy that does not throw on overflow:
-typedef policy<overflow_error<errno_on_error> > my_policy;
+namespace myspace
+{
+ using namespace boost::math::policies;

-// Define the special functions in this scope to use the policy:
-BOOST_MATH_DECLARE_SPECIAL_FUNCTIONS(my_policy)
+ // Define a policy that does not throw on overflow:
+ typedef policy<overflow_error<errno_on_error> > my_policy;

+ // Define the special functions in this scope to use the policy:
+ BOOST_MATH_DECLARE_SPECIAL_FUNCTIONS(my_policy)
}

-//
// Now we can use myspace::tgamma etc.
// They will automatically use "my_policy":
//
-double t = myspace::tgamma(30.0); // will not throw on overflow
+double t = myspace::tgamma(30.0); // Will *not* throw on overflow,
+// despite the large value of factorial 30 = 265252859812191058636308480000000
+// unlike default policy boost::math::tgamma;

//]

-#include <iostream>
-
int main()
{
- std::cout << t << std::endl;
+ cout << "myspace::tgamma(30.0) = " << t << endl;
}
+
+/*
+
+Output:
+
+myspace::tgamma(30.0) = 8.84176e+030
+
+*/
+

Modified: branches/release/libs/math/example/policy_ref_snip13.cpp
==============================================================================
--- branches/release/libs/math/example/policy_ref_snip13.cpp (original)
+++ branches/release/libs/math/example/policy_ref_snip13.cpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,4 +1,5 @@
// Copyright John Maddock 2007.
+// Copyright Paul A. Bristow 2010
// 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)
@@ -7,48 +8,68 @@
// and comments, don't change any of the special comment mark-ups!

#ifdef _MSC_VER
-#pragma warning (disable : 4189) // 'd' : local variable is initialized but not referenced
+# pragma warning (disable : 4189) // 'd' : local variable is initialized but not referenced
#endif

+#include <iostream>
+using std::cout; using std::endl;
+
+#include <stdexcept>
+using std::domain_error;
+
//[policy_ref_snip13

#include <boost/math/distributions/cauchy.hpp>

-namespace myspace{
+namespace myspace
+{ // using namespace boost::math::policies; // May be convenient in myspace.

-using namespace boost::math::policies;
+ // Define a policy called my_policy to use.
+ using boost::math::policies::policy;
+
+// In this case we want all the distribution accessor functions to compile,
+// even if they are mathematically undefined, so
+// make the policy assert_undefined.
+ using boost::math::policies::assert_undefined;

-// Define a policy to use, in this case we want all the distribution
-// accessor functions to compile, even if they are mathematically
-// undefined:
typedef policy<assert_undefined<false> > my_policy;

+// Finally apply this policy to type double.
BOOST_MATH_DECLARE_DISTRIBUTIONS(double, my_policy)
-
-}
+} // namespace myspace

// Now we can use myspace::cauchy etc, which will use policy
// myspace::mypolicy:
//
-// This compiles but raises a domain error at runtime:
-//
+// This compiles but throws a domain error exception at runtime.
+// Caution! If you omit the try'n'catch blocks,
+// it will just silently terminate, giving no clues as to why!
+// So try'n'catch blocks are very strongly recommended.
+
void test_cauchy()
{
 try
 {
- double d = mean(myspace::cauchy());
+ double d = mean(myspace::cauchy()); // Cauchy does not have a mean!
 }
 catch(const std::domain_error& e)
 {
- std::cout << e.what() << std::endl;
+ cout << e.what() << endl;
 }
}

-//]
-
-#include <iostream>
+//] //[/policy_ref_snip13]

int main()
{
 test_cauchy();
}
+
+/*
+
+Output:
+
+policy_snip_13.vcxproj -> J:\Cpp\MathToolkit\test\Math_test\Release\policy_snip_13.exe
+ Error in function boost::math::mean(cauchy<double>&): The Cauchy distribution does not have a mean: the only possible return value is 1.#QNAN.
+
+ */
\ No newline at end of file

Modified: branches/release/libs/math/example/policy_ref_snip2.cpp
==============================================================================
--- branches/release/libs/math/example/policy_ref_snip2.cpp (original)
+++ branches/release/libs/math/example/policy_ref_snip2.cpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,4 +1,5 @@
// Copyright John Maddock 2007.
+// Copyright Paul A. Bristow 2010
// 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)
@@ -6,29 +7,41 @@
// Note that this file contains quickbook mark-up as well as code
// and comments, don't change any of the special comment mark-ups!

+#include <iostream>
+using std::cout; using std::endl;
+
//[policy_ref_snip2

#include <boost/math/distributions/normal.hpp>
+using boost::math::normal_distribution;

using namespace boost::math::policies;
-using namespace boost::math;

-// Define a policy:
+// Define a specific policy:
typedef policy<
overflow_error<ignore_error>
> my_policy;

-// Define the distribution:
+// Define the distribution, using my_policy:
typedef normal_distribution<double, my_policy> my_norm;

-// Get a quantile:
-double q = quantile(my_norm(), 0.05);
+// Construct a my_norm distribution, using default mean and standard deviation,
+// and get a 0.05 or 5% quantile:
+double q = quantile(my_norm(), 0.05); // = -1.64485

-//]
-
-#include <iostream>
+//] //[/policy_ref_snip2]

int main()
{
- std::cout << q << std::endl;
+ my_norm n; // Construct a my_norm distribution,
+ // using default mean zero and standard deviation unity.
+ double q = quantile(n, 0.05); // and get a quantile.
+ cout << "quantile(my_norm(), 0.05) = " << q << endl;
}
+
+/*
+
+Output:
+
+ quantile(my_norm(), 0.05) = -1.64485
+*/

Modified: branches/release/libs/math/example/policy_ref_snip3.cpp
==============================================================================
--- branches/release/libs/math/example/policy_ref_snip3.cpp (original)
+++ branches/release/libs/math/example/policy_ref_snip3.cpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,4 +1,5 @@
// Copyright John Maddock 2007.
+// Copyright Paul A. Bristow 2010
// 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)
@@ -6,31 +7,34 @@
// Note that this file contains quickbook mark-up as well as code
// and comments, don't change any of the special comment mark-ups!

-double some_value = 2;
+double some_value = 2.;

//[policy_ref_snip3

#include <boost/math/special_functions/gamma.hpp>

using namespace boost::math::policies;
-using namespace boost::math;
+using boost::math::tgamma;

-// Define a policy:
+// Define a new policy *not* internally promoting RealType to double:
typedef policy<
promote_double<false>
> my_policy;

-// Call the function:
+// Call the function, applying the new policy:
double t1 = tgamma(some_value, my_policy());

-// Alternatively we could use make_policy and define everything at the call site:
+// Alternatively we could use helper function make_policy,
+// and concisely define everything at the call site:
double t2 = tgamma(some_value, make_policy(promote_double<false>()));

-//]
+//] //[\policy_ref_snip3]

#include <iostream>
+using std::cout; using std::endl;

int main()
{
- std::cout << t1 << " " << t2 << std::endl;
+ cout << "tgamma(some_value, my_policy()) = " << t1
+ << ", tgamma(some_value, make_policy(promote_double<false>()) = " << t2 << endl;
}

Modified: branches/release/libs/math/example/policy_ref_snip4.cpp
==============================================================================
--- branches/release/libs/math/example/policy_ref_snip4.cpp (original)
+++ branches/release/libs/math/example/policy_ref_snip4.cpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,5 +1,5 @@
// Copyright John Maddock 2007.
-// Copyright Paul A. Bristow 2007.
+// Copyright Paul A. Bristow 2010.
// 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)
@@ -15,16 +15,16 @@
//[policy_ref_snip4

#include <boost/math/distributions/normal.hpp>
+using boost::math::normal_distribution;

using namespace boost::math::policies;
-using namespace boost::math;

// Define a policy:
typedef policy<
promote_float<false>
> my_policy;

-// Define the distribution:
+// Define the new normal distribution using my_policy:
typedef normal_distribution<float, my_policy> my_norm;

// Get a quantile:
@@ -33,8 +33,9 @@
//] [policy_ref_snip4]

#include <iostream>
+using std::cout; using std::endl;

int main()
{
- std::cout << q << std::endl;
+ cout << " quantile(my_norm(), 0.05f) = " << q << endl; // -1.64485
}

Modified: branches/release/libs/math/example/policy_ref_snip5.cpp
==============================================================================
--- branches/release/libs/math/example/policy_ref_snip5.cpp (original)
+++ branches/release/libs/math/example/policy_ref_snip5.cpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,4 +1,5 @@
// Copyright John Maddock 2007.
+// Copyright Paul A. Bristow 2010.
// 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)
@@ -9,25 +10,36 @@
//[policy_ref_snip5

#include <boost/math/distributions/negative_binomial.hpp>
+using boost::math::negative_binomial_distribution;

-using namespace boost::math;
using namespace boost::math::policies;

typedef negative_binomial_distribution<
double,
- policy<discrete_quantile<integer_round_inwards> >
+ policy<discrete_quantile<real> >
> dist_type;

-// Lower quantile:
+// Lower 5% quantile:
double x = quantile(dist_type(20, 0.3), 0.05);
-// Upper quantile:
+// Upper 95% quantile:
double y = quantile(complement(dist_type(20, 0.3), 0.05));

-//]
+//] //[/policy_ref_snip5]

#include <iostream>
+using std::cout; using std::endl;

int main()
{
- std::cout << x << " " << y << std::endl;
+ cout << "quantile(dist_type(20, 0.3), 0.05) = " << x
+ << "\nquantile(complement(dist_type(20, 0.3), 0.05) = " << y << endl;
}
+
+/*
+
+Output:
+ quantile(dist_type(20, 0.3), 0.05) = 27.3898
+ quantile(complement(dist_type(20, 0.3), 0.05) = 68.1584
+
+ */
+

Modified: branches/release/libs/math/example/policy_ref_snip6.cpp
==============================================================================
--- branches/release/libs/math/example/policy_ref_snip6.cpp (original)
+++ branches/release/libs/math/example/policy_ref_snip6.cpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,4 +1,5 @@
// Copyright John Maddock 2007.
+// Copyright Paul A. Bristow 2010.
// 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)
@@ -9,19 +10,29 @@
//[policy_ref_snip6

#include <boost/math/distributions/negative_binomial.hpp>
+using boost::math::negative_binomial;

-using namespace boost::math;
-
+// Use the default rounding policy integer_round_outwards.
// Lower quantile rounded down:
-double x = quantile(negative_binomial(20, 0.3), 0.05);
+double x = quantile(negative_binomial(20, 0.3), 0.05); // rounded up 27 from 27.3898
// Upper quantile rounded up:
-double y = quantile(complement(negative_binomial(20, 0.3), 0.05));
+double y = quantile(complement(negative_binomial(20, 0.3), 0.05)); // rounded down to 69 from 68.1584

-//]
+//] //[/policy_ref_snip6]

#include <iostream>
+using std::cout; using std::endl;

int main()
{
- std::cout << x << " " << y << std::endl;
+ cout << "quantile(negative_binomial(20, 0.3), 0.05) = "<< x <<endl
+ << "quantile(complement(negative_binomial(20, 0.3), 0.05)) = " << y << endl;
}
+
+/*
+Output:
+
+ quantile(negative_binomial(20, 0.3), 0.05) = 27
+ quantile(complement(negative_binomial(20, 0.3), 0.05)) = 69
+*/
+

Modified: branches/release/libs/math/example/policy_ref_snip7.cpp
==============================================================================
--- branches/release/libs/math/example/policy_ref_snip7.cpp (original)
+++ branches/release/libs/math/example/policy_ref_snip7.cpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,4 +1,5 @@
// Copyright John Maddock 2007.
+// Copyright Paul A. Bristow 2010.
// 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)
@@ -9,8 +10,8 @@
//[policy_ref_snip7

#include <boost/math/distributions/negative_binomial.hpp>
+using boost::math::negative_binomial_distribution;

-using namespace boost::math;
using namespace boost::math::policies;

typedef negative_binomial_distribution<
@@ -19,15 +20,29 @@
> dist_type;

// Lower quantile rounded up:
-double x = quantile(dist_type(20, 0.3), 0.05);
+double x = quantile(dist_type(20, 0.3), 0.05); // 28 rounded up from 27.3898
// Upper quantile rounded down:
-double y = quantile(complement(dist_type(20, 0.3), 0.05));
+double y = quantile(complement(dist_type(20, 0.3), 0.05)); // 68 rounded down from 68.1584

-//]
+//] //[/policy_ref_snip7]

#include <iostream>
+using std::cout; using std::endl;

int main()
{
- std::cout << x << " " << y << std::endl;
+ cout << "using policy<discrete_quantile<integer_round_inwards> > " << endl
+ << "quantile(dist_type(20, 0.3), 0.05) = " << x << endl
+ << "quantile(complement(dist_type(20, 0.3), 0.05)) = " << y << endl;
}
+
+/*
+
+Output:
+ using policy<discrete_quantile<integer_round_inwards> >
+ quantile(dist_type(20, 0.3), 0.05) = 28
+ quantile(complement(dist_type(20, 0.3), 0.05)) = 68
+
+
+*/
+

Modified: branches/release/libs/math/example/policy_ref_snip8.cpp
==============================================================================
--- branches/release/libs/math/example/policy_ref_snip8.cpp (original)
+++ branches/release/libs/math/example/policy_ref_snip8.cpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,4 +1,5 @@
// Copyright John Maddock 2007.
+// Copyright Paul A. Bristow 2010.
// 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)
@@ -9,8 +10,8 @@
//[policy_ref_snip8

#include <boost/math/distributions/negative_binomial.hpp>
+using boost::math::negative_binomial_distribution;

-using namespace boost::math;
using namespace boost::math::policies;

typedef negative_binomial_distribution<
@@ -19,15 +20,28 @@
> dist_type;

// Lower quantile rounded up:
-double x = quantile(dist_type(20, 0.3), 0.05);
+double x = quantile(dist_type(20, 0.3), 0.05); // 27
// Upper quantile rounded down:
-double y = quantile(complement(dist_type(20, 0.3), 0.05));
+double y = quantile(complement(dist_type(20, 0.3), 0.05)); // 68

-//]
+//] //[/policy_ref_snip8]

#include <iostream>
+using std::cout; using std::endl;

int main()
{
- std::cout << x << " " << y << std::endl;
+ cout << "using policy<discrete_quantile<integer_round_nearest> " << endl
+ << "quantile(dist_type(20, 0.3), 0.05) = " << x << endl
+ << "quantile(complement(dist_type(20, 0.3), 0.05)) " << y << endl;
}
+
+/*
+
+Output:
+
+ quantile(dist_type(20, 0.3), 0.05) = 27
+ quantile(complement(dist_type(20, 0.3), 0.05)) 68
+
+
+*/

Modified: branches/release/libs/math/example/policy_ref_snip9.cpp
==============================================================================
--- branches/release/libs/math/example/policy_ref_snip9.cpp (original)
+++ branches/release/libs/math/example/policy_ref_snip9.cpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,4 +1,6 @@
// Copyright John Maddock 2007.
+// Copyright Paul A. Bristow 2010
+
// 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)
@@ -6,22 +8,29 @@
// Note that this file contains quickbook mark-up as well as code
// and comments, don't change any of the special comment mark-ups!

+#include <iostream>
+using std::cout; using std::endl;
+
//[policy_ref_snip9

#include <boost/math/special_functions/gamma.hpp>
+using boost::math::tgamma;
+using boost::math::policies::policy;
+using boost::math::policies::digits10;

-using namespace boost::math;
-using namespace boost::math::policies;
-
-typedef policy<digits10<5> > pol;
-
-double t = tgamma(12, pol());
-
+typedef policy<digits10<5> > my_pol_5; // Define a new, non-default, policy
+// to calculate tgamma to accuracy of approximately 5 decimal digits.
//]

-#include <iostream>
-
int main()
{
- std::cout << t << std::endl;
+ cout.precision(5); // To only show 5 (hopefully) accurate decimal digits.
+ double t = tgamma(12, my_pol_5()); // Apply the 5 decimal digits accuracy policy to use of tgamma.
+ cout << "tgamma(12, my_pol_5() = " << t << endl;
}
+
+/*
+
+Output:
+ tgamma(12, my_pol_5() = 3.9917e+007
+*/

Modified: branches/release/libs/math/example/students_t_single_sample.cpp
==============================================================================
--- branches/release/libs/math/example/students_t_single_sample.cpp (original)
+++ branches/release/libs/math/example/students_t_single_sample.cpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,5 +1,5 @@
// Copyright John Maddock 2006
-// Copyright Paul A. Bristow 2007
+// Copyright Paul A. Bristow 2007, 2010

// Use, modification and distribution are subject to the
// Boost Software License, Version 1.0.
@@ -12,9 +12,16 @@
# pragma warning(disable: 4610) // can never be instantiated - user defined constructor required.
#endif

+#include <boost/math/distributions/students_t.hpp>
+
+// avoid "using namespace std;" and "using namespace boost::math;"
+// to avoid potential ambiguity with names in std random.
#include <iostream>
+using std::cout; using std::endl;
+using std::left; using std::fixed; using std::right; using std::scientific;
#include <iomanip>
-#include <boost/math/distributions/students_t.hpp>
+using std::setw;
+using std::setprecision;

void confidence_limits_on_mean(double Sm, double Sd, unsigned Sn)
{
@@ -35,8 +42,7 @@
 // contains the true mean or it does not.
 // See http://www.itl.nist.gov/div898/handbook/eda/section3/eda352.htm

- using namespace std;
- using namespace boost::math;
+ using boost::math::students_t;

 // Print out general info:
 cout <<
@@ -86,7 +92,7 @@
 cout << fixed << setprecision(5) << setw(15) << right << Sm + w << endl;
 }
 cout << endl;
-}
+} // void confidence_limits_on_mean

void single_sample_t_test(double M, double Sm, double Sd, unsigned Sn, double alpha)
{
@@ -103,9 +109,8 @@
 // to chance. We can also test the alternative hypothesis
 // that any difference is not down to chance.
 // See http://www.itl.nist.gov/div898/handbook/eda/section3/eda352.htm
- //
- using namespace std;
- using namespace boost::math;
+
+ using boost::math::students_t;

 // Print header:
 cout <<
@@ -159,7 +164,7 @@
 else
 cout << "REJECTED\n";
 cout << endl << endl;
-}
+} // void single_sample_t_test(

void single_sample_find_df(double M, double Sm, double Sd)
{
@@ -168,8 +173,8 @@
 // Sm = Sample Mean.
 // Sd = Sample Standard Deviation.
 //
- using namespace std;
- using namespace boost::math;
+
+ using boost::math::students_t;

 // Print out general info:
 cout <<
@@ -216,7 +221,7 @@
 cout << fixed << setprecision(0) << setw(16) << right << size << endl;
 }
 cout << endl;
-}
+} // void single_sample_find_df

int main()
{
@@ -250,177 +255,171 @@
 single_sample_find_df(38.9, 37.8, 0.964365);

 return 0;
-}
+} // int main()

/*

Output:

------- Build started: Project: students_t_single_sample, Configuration: Debug Win32 ------
-Compiling...
-students_t_single_sample.cpp
-Linking...
-Autorun "i:\boost-06-05-03-1300\libs\math\test\Math_test\debug\students_t_single_sample.exe"
-__________________________________
-2-Sided Confidence Limits For Mean
-__________________________________
-
-Number of Observations = 195
-Mean = 9.26146
-Standard Deviation = 0.02278881
-
-
-_______________________________________________________________
-Confidence T Interval Lower Upper
- Value (%) Value Width Limit Limit
-_______________________________________________________________
- 50.000 0.676 1.103e-003 9.26036 9.26256
- 75.000 1.154 1.883e-003 9.25958 9.26334
- 90.000 1.653 2.697e-003 9.25876 9.26416
- 95.000 1.972 3.219e-003 9.25824 9.26468
- 99.000 2.601 4.245e-003 9.25721 9.26571
- 99.900 3.341 5.453e-003 9.25601 9.26691
- 99.990 3.973 6.484e-003 9.25498 9.26794
- 99.999 4.537 7.404e-003 9.25406 9.26886
-
-__________________________________
-Student t test for a single sample
-__________________________________
-
-Number of Observations = 195
-Sample Mean = 9.26146
-Sample Standard Deviation = 0.02279
-Expected True Mean = 5.00000
-
-Sample Mean - Expected Test Mean = 4.26146
-Degrees of Freedom = 194
-T Statistic = 2611.28380
-Probability that difference is due to chance = 0.000e+000
-
-Results for Alternative Hypothesis and alpha = 0.0500
-
-Alternative Hypothesis Conclusion
-Mean != 5.000 NOT REJECTED
-Mean < 5.000 REJECTED
-Mean > 5.000 NOT REJECTED
-
-
-_____________________________________________________________
-Estimated sample sizes required for various confidence levels
-_____________________________________________________________
-
-True Mean = 5.00000
-Sample Mean = 9.26146
-Sample Standard Deviation = 0.02279
-
-
-_______________________________________________________________
-Confidence Estimated Estimated
- Value (%) Sample Size Sample Size
- (one sided test) (two sided test)
-_______________________________________________________________
- 50.000 2 2
- 75.000 2 2
- 90.000 2 2
- 95.000 2 2
- 99.000 2 2
- 99.900 3 3
- 99.990 3 3
- 99.999 4 4
-
-__________________________________
-2-Sided Confidence Limits For Mean
-__________________________________
-
-Number of Observations = 3
-Mean = 37.8000000
-Standard Deviation = 0.9643650
-
-
-_______________________________________________________________
-Confidence T Interval Lower Upper
- Value (%) Value Width Limit Limit
-_______________________________________________________________
- 50.000 0.816 0.455 37.34539 38.25461
- 75.000 1.604 0.893 36.90717 38.69283
- 90.000 2.920 1.626 36.17422 39.42578
- 95.000 4.303 2.396 35.40438 40.19562
- 99.000 9.925 5.526 32.27408 43.32592
- 99.900 31.599 17.594 20.20639 55.39361
- 99.990 99.992 55.673 -17.87346 93.47346
- 99.999 316.225 176.067 -138.26683 213.86683
-
-__________________________________
-Student t test for a single sample
-__________________________________
-
-Number of Observations = 3
-Sample Mean = 37.80000
-Sample Standard Deviation = 0.96437
-Expected True Mean = 38.90000
-
-Sample Mean - Expected Test Mean = -1.10000
-Degrees of Freedom = 2
-T Statistic = -1.97566
-Probability that difference is due to chance = 1.869e-001
-
-Results for Alternative Hypothesis and alpha = 0.0500
-
-Alternative Hypothesis Conclusion
-Mean != 38.900 REJECTED
-Mean < 38.900 REJECTED
-Mean > 38.900 REJECTED
-
-
-__________________________________
-Student t test for a single sample
-__________________________________
-
-Number of Observations = 3
-Sample Mean = 37.80000
-Sample Standard Deviation = 0.96437
-Expected True Mean = 38.90000
-
-Sample Mean - Expected Test Mean = -1.10000
-Degrees of Freedom = 2
-T Statistic = -1.97566
-Probability that difference is due to chance = 1.869e-001
-
-Results for Alternative Hypothesis and alpha = 0.1000
-
-Alternative Hypothesis Conclusion
-Mean != 38.900 REJECTED
-Mean < 38.900 NOT REJECTED
-Mean > 38.900 REJECTED
-
-
-_____________________________________________________________
-Estimated sample sizes required for various confidence levels
-_____________________________________________________________
-
-True Mean = 38.90000
-Sample Mean = 37.80000
-Sample Standard Deviation = 0.96437
-
-
-_______________________________________________________________
-Confidence Estimated Estimated
- Value (%) Sample Size Sample Size
- (one sided test) (two sided test)
-_______________________________________________________________
- 75.000 3 4
- 90.000 7 9
- 95.000 11 13
- 99.000 20 22
- 99.900 35 37
- 99.990 50 53
- 99.999 66 68
-
-Build Time 0:03
-Build log was saved at "file://i:\boost-06-05-03-1300\libs\math\test\Math_test\students_t_single_sample\Debug\BuildLog.htm"
-students_t_single_sample - 0 error(s), 0 warning(s)
-========== Build: 1 succeeded, 0 failed, 0 up-to-date, 0 skipped ==========
-
+------ Rebuild All started: Project: students_t_single_sample, Configuration: Release Win32 ------
+ students_t_single_sample.cpp
+ Generating code
+ Finished generating code
+ students_t_single_sample.vcxproj -> J:\Cpp\MathToolkit\test\Math_test\Release\students_t_single_sample.exe
+ __________________________________
+ 2-Sided Confidence Limits For Mean
+ __________________________________
+
+ Number of Observations = 195
+ Mean = 9.26146
+ Standard Deviation = 0.02278881
+
+
+ _______________________________________________________________
+ Confidence T Interval Lower Upper
+ Value (%) Value Width Limit Limit
+ _______________________________________________________________
+ 50.000 0.676 1.103e-003 9.26036 9.26256
+ 75.000 1.154 1.883e-003 9.25958 9.26334
+ 90.000 1.653 2.697e-003 9.25876 9.26416
+ 95.000 1.972 3.219e-003 9.25824 9.26468
+ 99.000 2.601 4.245e-003 9.25721 9.26571
+ 99.900 3.341 5.453e-003 9.25601 9.26691
+ 99.990 3.973 6.484e-003 9.25498 9.26794
+ 99.999 4.537 7.404e-003 9.25406 9.26886
+
+ __________________________________
+ Student t test for a single sample
+ __________________________________
+
+ Number of Observations = 195
+ Sample Mean = 9.26146
+ Sample Standard Deviation = 0.02279
+ Expected True Mean = 5.00000
+
+ Sample Mean - Expected Test Mean = 4.26146
+ Degrees of Freedom = 194
+ T Statistic = 2611.28380
+ Probability that difference is due to chance = 0.000e+000
+
+ Results for Alternative Hypothesis and alpha = 0.0500
+
+ Alternative Hypothesis Conclusion
+ Mean != 5.000 NOT REJECTED
+ Mean < 5.000 REJECTED
+ Mean > 5.000 NOT REJECTED
+
+
+ _____________________________________________________________
+ Estimated sample sizes required for various confidence levels
+ _____________________________________________________________
+
+ True Mean = 5.00000
+ Sample Mean = 9.26146
+ Sample Standard Deviation = 0.02279
+
+
+ _______________________________________________________________
+ Confidence Estimated Estimated
+ Value (%) Sample Size Sample Size
+ (one sided test) (two sided test)
+ _______________________________________________________________
+ 75.000 2 2
+ 90.000 2 2
+ 95.000 2 2
+ 99.000 2 2
+ 99.900 3 3
+ 99.990 3 3
+ 99.999 4 4
+
+ __________________________________
+ 2-Sided Confidence Limits For Mean
+ __________________________________
+
+ Number of Observations = 3
+ Mean = 37.8000000
+ Standard Deviation = 0.9643650
+
+
+ _______________________________________________________________
+ Confidence T Interval Lower Upper
+ Value (%) Value Width Limit Limit
+ _______________________________________________________________
+ 50.000 0.816 0.455 37.34539 38.25461
+ 75.000 1.604 0.893 36.90717 38.69283
+ 90.000 2.920 1.626 36.17422 39.42578
+ 95.000 4.303 2.396 35.40438 40.19562
+ 99.000 9.925 5.526 32.27408 43.32592
+ 99.900 31.599 17.594 20.20639 55.39361
+ 99.990 99.992 55.673 -17.87346 93.47346
+ 99.999 316.225 176.067 -138.26683 213.86683
+
+ __________________________________
+ Student t test for a single sample
+ __________________________________
+
+ Number of Observations = 3
+ Sample Mean = 37.80000
+ Sample Standard Deviation = 0.96437
+ Expected True Mean = 38.90000
+
+ Sample Mean - Expected Test Mean = -1.10000
+ Degrees of Freedom = 2
+ T Statistic = -1.97566
+ Probability that difference is due to chance = 1.869e-001
+
+ Results for Alternative Hypothesis and alpha = 0.0500
+
+ Alternative Hypothesis Conclusion
+ Mean != 38.900 REJECTED
+ Mean < 38.900 REJECTED
+ Mean > 38.900 REJECTED
+
+
+ __________________________________
+ Student t test for a single sample
+ __________________________________
+
+ Number of Observations = 3
+ Sample Mean = 37.80000
+ Sample Standard Deviation = 0.96437
+ Expected True Mean = 38.90000
+
+ Sample Mean - Expected Test Mean = -1.10000
+ Degrees of Freedom = 2
+ T Statistic = -1.97566
+ Probability that difference is due to chance = 1.869e-001
+
+ Results for Alternative Hypothesis and alpha = 0.1000
+
+ Alternative Hypothesis Conclusion
+ Mean != 38.900 REJECTED
+ Mean < 38.900 NOT REJECTED
+ Mean > 38.900 REJECTED
+
+
+ _____________________________________________________________
+ Estimated sample sizes required for various confidence levels
+ _____________________________________________________________
+
+ True Mean = 38.90000
+ Sample Mean = 37.80000
+ Sample Standard Deviation = 0.96437
+
+
+ _______________________________________________________________
+ Confidence Estimated Estimated
+ Value (%) Sample Size Sample Size
+ (one sided test) (two sided test)
+ _______________________________________________________________
+ 75.000 3 4
+ 90.000 7 9
+ 95.000 11 13
+ 99.000 20 22
+ 99.900 35 37
+ 99.990 50 53
+ 99.999 66 68
+

*/

Modified: branches/release/libs/math/example/students_t_two_samples.cpp
==============================================================================
--- branches/release/libs/math/example/students_t_two_samples.cpp (original)
+++ branches/release/libs/math/example/students_t_two_samples.cpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,5 +1,6 @@
// Copyright John Maddock 2006.
-// Copyright Paul A. Bristow 2007.
+// Copyright Paul A. Bristow 2007, 2010
+
// Use, modification and distribution are subject to the
// Boost Software License, Version 1.0.
// (See accompanying file LICENSE_1_0.txt
@@ -12,27 +13,25 @@
#endif

#include <iostream>
+using std::cout; using std::endl;
+using std::left; using std::fixed; using std::right; using std::scientific;
#include <iomanip>
+using std::setw;
+using std::setprecision;
+
#include <boost/math/distributions/students_t.hpp>
+ using boost::math::students_t;
+

void two_samples_t_test_equal_sd(
- double Sm1,
- double Sd1,
- unsigned Sn1,
- double Sm2,
- double Sd2,
- unsigned Sn2,
- double alpha)
+ double Sm1, // Sm1 = Sample Mean 1.
+ double Sd1, // Sd1 = Sample Standard Deviation 1.
+ unsigned Sn1, // Sn1 = Sample Size 1.
+ double Sm2, // Sm2 = Sample Mean 2.
+ double Sd2, // Sd2 = Sample Standard Deviation 2.
+ unsigned Sn2, // Sn2 = Sample Size 2.
+ double alpha) // alpha = Significance Level.
{
- //
- // Sm1 = Sample Mean 1.
- // Sd1 = Sample Standard Deviation 1.
- // Sn1 = Sample Size 1.
- // Sm2 = Sample Mean 2.
- // Sd2 = Sample Standard Deviation 2.
- // Sn2 = Sample Size 2.
- // alpha = Significance Level.
- //
 // A Students t test applied to two sets of data.
 // We are testing the null hypothesis that the two
 // samples have the same mean and that any difference
@@ -40,7 +39,9 @@
 // See http://www.itl.nist.gov/div898/handbook/eda/section3/eda353.htm
 //
 using namespace std;
- using namespace boost::math;
+ // using namespace boost::math;
+
+ using boost::math::students_t;

 // Print header:
 cout <<
@@ -99,31 +100,22 @@
}

void two_samples_t_test_unequal_sd(
- double Sm1,
- double Sd1,
- unsigned Sn1,
- double Sm2,
- double Sd2,
- unsigned Sn2,
- double alpha)
+ double Sm1, // Sm1 = Sample Mean 1.
+ double Sd1, // Sd1 = Sample Standard Deviation 1.
+ unsigned Sn1, // Sn1 = Sample Size 1.
+ double Sm2, // Sm2 = Sample Mean 2.
+ double Sd2, // Sd2 = Sample Standard Deviation 2.
+ unsigned Sn2, // Sn2 = Sample Size 2.
+ double alpha) // alpha = Significance Level.
{
- //
- // Sm1 = Sample Mean 1.
- // Sd1 = Sample Standard Deviation 1.
- // Sn1 = Sample Size 1.
- // Sm2 = Sample Mean 2.
- // Sd2 = Sample Standard Deviation 2.
- // Sn2 = Sample Size 2.
- // alpha = Significance Level.
- //
 // A Students t test applied to two sets of data.
 // We are testing the null hypothesis that the two
- // samples have the same mean and that any difference
- // if due to chance.
+ // samples have the same mean and
+ // that any difference is due to chance.
 // See http://www.itl.nist.gov/div898/handbook/eda/section3/eda353.htm
 //
 using namespace std;
- using namespace boost::math;
+ using boost::math::students_t;

 // Print header:
 cout <<
@@ -202,60 +194,58 @@

/*
Output is
+------ Rebuild All started: Project: students_t_two_samples, Configuration: Release Win32 ------
+ students_t_two_samples.cpp
+ Generating code
+ Finished generating code
+ students_t_two_samples.vcxproj -> J:\Cpp\MathToolkit\test\Math_test\Release\students_t_two_samples.exe
+ _______________________________________________
+ Student t test for two samples (equal variances)
+ _______________________________________________
+
+ Number of Observations (Sample 1) = 249
+ Sample 1 Mean = 20.145
+ Sample 1 Standard Deviation = 6.4147
+ Number of Observations (Sample 2) = 79
+ Sample 2 Mean = 30.481
+ Sample 2 Standard Deviation = 6.1077
+ Degrees of Freedom = 326
+ Pooled Standard Deviation = 326
+ T Statistic = -12.621
+ Probability that difference is due to chance = 5.273e-030
+
+ Results for Alternative Hypothesis and alpha = 0.0500
+
+ Alternative Hypothesis Conclusion
+ Sample 1 Mean != Sample 2 Mean NOT REJECTED
+ Sample 1 Mean < Sample 2 Mean NOT REJECTED
+ Sample 1 Mean > Sample 2 Mean REJECTED
+
+
+ _________________________________________________
+ Student t test for two samples (unequal variances)
+ _________________________________________________
+
+ Number of Observations (Sample 1) = 249
+ Sample 1 Mean = 20.14458
+ Sample 1 Standard Deviation = 6.41470
+ Number of Observations (Sample 2) = 79
+ Sample 2 Mean = 30.48101
+ Sample 2 Standard Deviation = 6.10771
+ Degrees of Freedom = 136.87499
+ T Statistic = -12.94627
+ Probability that difference is due to chance = 1.571e-025
+
+ Results for Alternative Hypothesis and alpha = 0.0500
+
+ Alternative Hypothesis Conclusion
+ Sample 1 Mean != Sample 2 Mean NOT REJECTED
+ Sample 1 Mean < Sample 2 Mean NOT REJECTED
+ Sample 1 Mean > Sample 2 Mean REJECTED
+
+
+========== Rebuild All: 1 succeeded, 0 failed, 0 skipped ==========

------- Build started: Project: students_t_two_samples, Configuration: Debug Win32 ------
-Compiling...
-students_t_two_samples.cpp
-Linking...
-Autorun "i:\boost-06-05-03-1300\libs\math\test\Math_test\debug\students_t_two_samples.exe"
-_______________________________________________
-Student t test for two samples (equal variances)
-_______________________________________________
-
-Number of Observations (Sample 1) = 249
-Sample 1 Mean = 20.145
-Sample 1 Standard Deviation = 6.4147
-Number of Observations (Sample 2) = 79
-Sample 2 Mean = 30.481
-Sample 2 Standard Deviation = 6.1077
-Degrees of Freedom = 326
-Pooled Standard Deviation = 326
-T Statistic = -12.621
-Probability that difference is due to chance = 5.273e-030
-
-Results for Alternative Hypothesis and alpha = 0.0500
-
-Alternative Hypothesis Conclusion
-Sample 1 Mean != Sample 2 Mean NOT REJECTED
-Sample 1 Mean < Sample 2 Mean NOT REJECTED
-Sample 1 Mean > Sample 2 Mean REJECTED
-
-
-_________________________________________________
-Student t test for two samples (unequal variances)
-_________________________________________________
-
-Number of Observations (Sample 1) = 249
-Sample 1 Mean = 20.14458
-Sample 1 Standard Deviation = 6.41470
-Number of Observations (Sample 2) = 79
-Sample 2 Mean = 30.48101
-Sample 2 Standard Deviation = 6.10771
-Degrees of Freedom = 136.87499
-T Statistic = -12.94627
-Probability that difference is due to chance = 1.571e-025
-
-Results for Alternative Hypothesis and alpha = 0.0500
-
-Alternative Hypothesis Conclusion
-Sample 1 Mean != Sample 2 Mean NOT REJECTED
-Sample 1 Mean < Sample 2 Mean NOT REJECTED
-Sample 1 Mean > Sample 2 Mean REJECTED
-
-Build Time 0:03
-Build log was saved at "file://i:\boost-06-05-03-1300\libs\math\test\Math_test\students_t_two_samples\Debug\BuildLog.htm"
-students_t_two_samples - 0 error(s), 0 warning(s)
-========== Build: 1 succeeded, 0 failed, 0 up-to-date, 0 skipped ==========

*/

Modified: branches/release/libs/math/performance/distributions.cpp
==============================================================================
--- branches/release/libs/math/performance/distributions.cpp (original)
+++ branches/release/libs/math/performance/distributions.cpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -293,12 +293,6 @@

extern "C" {
#include "Rmath.h"
-/*
-double qnchisq(double, double, double, int, int)
-{
- return 0;
-}
-*/
}

#define BOOST_MATH_R_DISTRIBUTION3_TEST(name, param1_table, param2_table, param3_table, random_variable_table, probability_table) \

Modified: branches/release/libs/math/test/Jamfile.v2
==============================================================================
--- branches/release/libs/math/test/Jamfile.v2 (original)
+++ branches/release/libs/math/test/Jamfile.v2 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,9 +1,11 @@
-# Copyright Daryle Walker, Hubert Holin, John Maddock and Paul A. Bristow 2006 - 2007
+# Copyright Daryle Walker, Hubert Holin, John Maddock 2006 - 2007
+# copyright Paul A. Bristow 2006 - 2010
# Distributed under the Boost Software License, Version 1.0.
# (See accompanying file LICENSE_1_0.txt or copy at
# http://www.boost.org/LICENSE_1_0.txt.
# \math_toolkit\libs\math\test\jamfile.v2
-# Runs all math toolkit tests, functions & distributions.
+# Runs all math toolkit tests, functions & distributions,
+# and build math examples.

# bring in the rules for testing
import testing ;
@@ -42,8 +44,8 @@
 <link>shared:<define>BOOST_REGEX_DYN_LINK=1
 # Sunpro and cygwin/Mingw have problems building regex as a shared lib:
 <toolset>sun:<link>static
- <toolset>gcc-mw:<link>static
- <toolset>gcc-mingw:<link>static
+ <toolset>gcc-mw:<link>static
+ <toolset>gcc-mingw:<link>static
 <toolset>gcc-cygwin:<link>static
 <define>BOOST_ALL_NO_LIB=1
 <define>BOOST_UBLAS_UNSUPPORTED_COMPILER=0
@@ -418,6 +420,10 @@
 <toolset>intel:<pch>off
 : test_igamma_inva_real_concept ;
run test_instantiate1.cpp test_instantiate2.cpp ;
+
+run test_inverse_gamma_distribution.cpp ../../test/build//boost_test_exec_monitor ;
+run test_inverse_chi_squared_distribution.cpp ../../test/build//boost_test_exec_monitor ;
+
run test_laplace.cpp ../../test/build//boost_unit_test_framework/<link>static ;
run test_inv_hyp.cpp pch ../../test/build//boost_test_exec_monitor ;
run test_laguerre.cpp pch ../../test/build//boost_test_exec_monitor ;
@@ -665,6 +671,8 @@
run compile_test/dist_find_scale_incl_test.cpp compile_test/main.cpp ;
run compile_test/dist_fisher_f_incl_test.cpp compile_test/main.cpp ;
run compile_test/dist_gamma_incl_test.cpp compile_test/main.cpp ;
+run compile_test/dist_inv_gamma_incl_test.cpp compile_test/main.cpp ;
+run compile_test/dist_inv_chi_sq_incl_test.cpp compile_test/main.cpp ;
run compile_test/dist_hypergeo_incl_test.cpp compile_test/main.cpp ;
run compile_test/dist_laplace_incl_test.cpp compile_test/main.cpp ;
run compile_test/dist_logistic_incl_test.cpp compile_test/main.cpp ;

Added: branches/release/libs/math/test/compile_test/dist_inv_chi_sq_incl_test.cpp
==============================================================================
--- (empty file)
+++ branches/release/libs/math/test/compile_test/dist_inv_chi_sq_incl_test.cpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -0,0 +1,25 @@
+// Copyright John Maddock 2006.
+// 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)
+//
+// Basic sanity check that header <boost/math/distributions/gamma.hpp>
+// #includes all the files that it needs to.
+//
+#include <boost/math/distributions/inverse_chi_squared.hpp>
+//
+// Note this header includes no other headers, this is
+// important if this test is to be meaningful:
+//
+#include "test_compile_result.hpp"
+
+void compile_and_link_test()
+{
+ TEST_DIST_FUNC(inverse_chi_squared)
+}
+
+template class boost::math::inverse_chi_squared_distribution<float, boost::math::policies::policy<> >;
+template class boost::math::inverse_chi_squared_distribution<double, boost::math::policies::policy<> >;
+#ifndef BOOST_MATH_NO_LONG_DOUBLE_MATH_FUNCTIONS
+template class boost::math::inverse_chi_squared_distribution<long double, boost::math::policies::policy<> >;
+#endif

Added: branches/release/libs/math/test/compile_test/dist_inv_gamma_incl_test.cpp
==============================================================================
--- (empty file)
+++ branches/release/libs/math/test/compile_test/dist_inv_gamma_incl_test.cpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -0,0 +1,25 @@
+// Copyright John Maddock 2006.
+// 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)
+//
+// Basic sanity check that header <boost/math/distributions/gamma.hpp>
+// #includes all the files that it needs to.
+//
+#include <boost/math/distributions/inverse_gamma.hpp>
+//
+// Note this header includes no other headers, this is
+// important if this test is to be meaningful:
+//
+#include "test_compile_result.hpp"
+
+void compile_and_link_test()
+{
+ TEST_DIST_FUNC(inverse_gamma)
+}
+
+template class boost::math::inverse_gamma_distribution<float, boost::math::policies::policy<> >;
+template class boost::math::inverse_gamma_distribution<double, boost::math::policies::policy<> >;
+#ifndef BOOST_MATH_NO_LONG_DOUBLE_MATH_FUNCTIONS
+template class boost::math::inverse_gamma_distribution<long double, boost::math::policies::policy<> >;
+#endif

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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -68,6 +68,8 @@
 function_requires<DistributionConcept<extreme_value_distribution<RealType> > >();
 function_requires<DistributionConcept<fisher_f_distribution<RealType> > >();
 function_requires<DistributionConcept<gamma_distribution<RealType> > >();
+ function_requires<DistributionConcept<inverse_gamma_distribution<RealType> > >();
+ function_requires<DistributionConcept<inverse_chi_squared_distribution<RealType> > >();
 function_requires<DistributionConcept<laplace_distribution<RealType> > >();
 function_requires<DistributionConcept<logistic_distribution<RealType> > >();
 function_requires<DistributionConcept<lognormal_distribution<RealType> > >();
@@ -95,6 +97,8 @@
 function_requires<DistributionConcept<extreme_value_distribution<RealType, test_policy> > >();
 function_requires<DistributionConcept<fisher_f_distribution<RealType, test_policy> > >();
 function_requires<DistributionConcept<gamma_distribution<RealType, test_policy> > >();
+ function_requires<DistributionConcept<inverse_gamma_distribution<RealType, test_policy> > >();
+ function_requires<DistributionConcept<inverse_chi_squared_distribution<RealType, test_policy> > >();
 function_requires<DistributionConcept<logistic_distribution<RealType, test_policy> > >();
 function_requires<DistributionConcept<lognormal_distribution<RealType, test_policy> > >();
 function_requires<DistributionConcept<non_central_chi_squared_distribution<RealType, test_policy> > >();

Modified: branches/release/libs/math/test/compile_test/tools_roots_inc_test.cpp
==============================================================================
--- branches/release/libs/math/test/compile_test/tools_roots_inc_test.cpp (original)
+++ branches/release/libs/math/test/compile_test/tools_roots_inc_test.cpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -7,6 +7,7 @@
// #includes all the files that it needs to.
//
#include <boost/math/tools/roots.hpp>
+#include <boost/math/tools/tuple.hpp>
//
// Note this header includes no other headers, this is
// important if this test is to be meaningful:
@@ -21,7 +22,7 @@
{
 typedef double (*F)(double);
 typedef std::pair<double, double> (*F2)(double);
- typedef std::tr1::tuple<double, double, double> (*F3)(double);
+ typedef boost::math::tuple<double, double, double> (*F3)(double);
 typedef boost::math::tools::eps_tolerance<double> Tol;
 Tol tol(u);
 boost::uintmax_t max_iter = 0;

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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,9 +1,13 @@
-// (C) Copyright John Maddock 2005.
+// Copyright John Maddock 2005.
+// Copyright Paul A. Bristow 2010
// 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>
+#include <pch.hpp> // include \libs\math\src\tr1\
+
+// Requires MS extensions permitted or fails to link.
+

#define BOOST_MATH_OVERFLOW_ERROR_POLICY ignore_error

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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -198,3 +198,29 @@

return 0;
}
+
+/*
+
+ Running 1 test case...
+ Testing with integral bases and positive small exponents
+ Testing with integral bases and negative small exponents
+ Testing with float precision bases and positive small exponents
+ Testing with float precision bases and negative small exponents
+ Testing with float precision bases and positive big exponents
+ Testing with float precision bases and negative big exponents
+ Testing with double precision bases and positive small exponents
+ Testing with double precision bases and negative small exponents
+ Testing with double precision bases and positive big exponents
+ Testing with double precision bases and negative big exponents
+ Testing with long double precision bases and positive small exponents
+ Testing with long double precision bases and negative small exponents
+ Testing with long double precision bases and positive big exponents
+ Testing with long double precision bases and negative big exponents
+ Testing with concepts::real_concept precision bases and positive small exponents
+ Testing with concepts::real_concept precision bases and negative small exponents
+ Testing with concepts::real_concept precision bases and positive big exponents
+ Testing with concepts::real_concept precision bases and negative big exponents
+
+ *** No errors detected
+
+ */

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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,9 +1,15 @@
-// (C) Copyright John Maddock 2006.
+// Copyright John Maddock 2006.
+// Copyright Paul A. Bristow 2010
+
// 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>
+#ifdef _MSC_VER
+# pragma warning (disable : 4224)
+#endif
+
+#include <pch.hpp> // include \libs\math\src\

#include <boost/math/concepts/real_concept.hpp>
#include <boost/test/test_exec_monitor.hpp>
@@ -126,7 +132,7 @@
void test_cbrt(T, const char* name)
{
 //
- // The actual test data is rather verbose, so it's in a separate file
+ // The actual test data is rather verbose, so it's in a separate file.
 //
 // The contents are as follows, each row of data contains
 // three items, input value a, input value b and erf(a, b):

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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -65,6 +65,7 @@
#include <boost/math/policies/policy.hpp>
#include <boost/math/policies/error_handling.hpp>
#include <boost/test/test_exec_monitor.hpp> // for test_main
+#include <cerrno> // for errno
//
// Define some policies:
//
@@ -240,5 +241,73 @@
Error in function boost::math::test_function<class boost::math::concepts::real_concept>(class boost::math::concepts::real_concept, class boost::math::concepts::real_concept, class boost::math::concepts::real_concept): Internal Evaluation Error, best value so far was 1.25
*** No errors detected

+VS 2010
+------ Rebuild All started: Project: test_error_handling, Configuration: Release Win32 ------
+ test_error_handling.cpp
+ Generating code
+ Finished generating code
+ test_error_handling.vcxproj -> J:\Cpp\MathToolkit\test\Math_test\Release\test_error_handling.exe
+ Running 1 test case...
+ Error in function boost::math::test_function<float>(float, float, float): Error while handling value 0
+ Error in function boost::math::test_function<float>(float, float, float): Domain Error evaluating function at 0
+ Error in function boost::math::test_function<float>(float, float, float): Error while handling value 0
+ Error in function boost::math::test_function<float>(float, float, float): Evaluation of function at pole 0
+ Error in function boost::math::test_function<float>(float, float, float): Error message goes here...
+ Error in function boost::math::test_function<float>(float, float, float): Overflow Error
+ Error in function boost::math::test_function<float>(float, float, float): Error message goes here...
+ Error in function boost::math::test_function<float>(float, float, float): Underflow Error
+ Error in function boost::math::test_function<float>(float, float, float): Error message goes here...
+ Error in function boost::math::test_function<float>(float, float, float): Denorm Error
+ Error in function boost::math::test_function<float>(float, float, float): Error while handling value 1.25
+ Error in function boost::math::test_function<float>(float, float, float): Internal Evaluation Error, best value so far was 1.25
+ Error in function boost::math::test_function<float>(float, float, float): Error while handling value 1.25
+ Error in function boost::math::test_function<float>(float, float, float): Indeterminate result with value 1.25
+ Error in function boost::math::test_function<double>(double, double, double): Error while handling value 0
+ Error in function boost::math::test_function<double>(double, double, double): Domain Error evaluating function at 0
+ Error in function boost::math::test_function<double>(double, double, double): Error while handling value 0
+ Error in function boost::math::test_function<double>(double, double, double): Evaluation of function at pole 0
+ Error in function boost::math::test_function<double>(double, double, double): Error message goes here...
+ Error in function boost::math::test_function<double>(double, double, double): Overflow Error
+ Error in function boost::math::test_function<double>(double, double, double): Error message goes here...
+ Error in function boost::math::test_function<double>(double, double, double): Underflow Error
+ Error in function boost::math::test_function<double>(double, double, double): Error message goes here...
+ Error in function boost::math::test_function<double>(double, double, double): Denorm Error
+ Error in function boost::math::test_function<double>(double, double, double): Error while handling value 1.25
+ Error in function boost::math::test_function<double>(double, double, double): Internal Evaluation Error, best value so far was 1.25
+ Error in function boost::math::test_function<double>(double, double, double): Error while handling value 1.25
+ Error in function boost::math::test_function<double>(double, double, double): Indeterminate result with value 1.25
+ Error in function boost::math::test_function<long double>(long double, long double, long double): Error while handling value 0
+ Error in function boost::math::test_function<long double>(long double, long double, long double): Domain Error evaluating function at 0
+ Error in function boost::math::test_function<long double>(long double, long double, long double): Error while handling value 0
+ Error in function boost::math::test_function<long double>(long double, long double, long double): Evaluation of function at pole 0
+ Error in function boost::math::test_function<long double>(long double, long double, long double): Error message goes here...
+ Error in function boost::math::test_function<long double>(long double, long double, long double): Overflow Error
+ Error in function boost::math::test_function<long double>(long double, long double, long double): Error message goes here...
+ Error in function boost::math::test_function<long double>(long double, long double, long double): Underflow Error
+ Error in function boost::math::test_function<long double>(long double, long double, long double): Error message goes here...
+ Error in function boost::math::test_function<long double>(long double, long double, long double): Denorm Error
+ Error in function boost::math::test_function<long double>(long double, long double, long double): Error while handling value 1.25
+ Error in function boost::math::test_function<long double>(long double, long double, long double): Internal Evaluation Error, best value so far was 1.25
+ Error in function boost::math::test_function<long double>(long double, long double, long double): Error while handling value 1.25
+ Error in function boost::math::test_function<long double>(long double, long double, long double): Indeterminate result with value 1.25
+ Error in function boost::math::test_function<class boost::math::concepts::real_concept>(class boost::math::concepts::real_concept, class boost::math::concepts::real_concept, class boost::math::concepts::real_concept): Error while handling value 0
+ Error in function boost::math::test_function<class boost::math::concepts::real_concept>(class boost::math::concepts::real_concept, class boost::math::concepts::real_concept, class boost::math::concepts::real_concept): Domain Error evaluating function at 0
+ Error in function boost::math::test_function<class boost::math::concepts::real_concept>(class boost::math::concepts::real_concept, class boost::math::concepts::real_concept, class boost::math::concepts::real_concept): Error while handling value 0
+ Error in function boost::math::test_function<class boost::math::concepts::real_concept>(class boost::math::concepts::real_concept, class boost::math::concepts::real_concept, class boost::math::concepts::real_concept): Evaluation of function at pole 0
+ Error in function boost::math::test_function<class boost::math::concepts::real_concept>(class boost::math::concepts::real_concept, class boost::math::concepts::real_concept, class boost::math::concepts::real_concept): Error message goes here...
+ Error in function boost::math::test_function<class boost::math::concepts::real_concept>(class boost::math::concepts::real_concept, class boost::math::concepts::real_concept, class boost::math::concepts::real_concept): Overflow Error
+ Error in function boost::math::test_function<class boost::math::concepts::real_concept>(class boost::math::concepts::real_concept, class boost::math::concepts::real_concept, class boost::math::concepts::real_concept): Error message goes here...
+ Error in function boost::math::test_function<class boost::math::concepts::real_concept>(class boost::math::concepts::real_concept, class boost::math::concepts::real_concept, class boost::math::concepts::real_concept): Underflow Error
+ Error in function boost::math::test_function<class boost::math::concepts::real_concept>(class boost::math::concepts::real_concept, class boost::math::concepts::real_concept, class boost::math::concepts::real_concept): Error message goes here...
+ Error in function boost::math::test_function<class boost::math::concepts::real_concept>(class boost::math::concepts::real_concept, class boost::math::concepts::real_concept, class boost::math::concepts::real_concept): Denorm Error
+ Error in function boost::math::test_function<class boost::math::concepts::real_concept>(class boost::math::concepts::real_concept, class boost::math::concepts::real_concept, class boost::math::concepts::real_concept): Error while handling value 1.25
+ Error in function boost::math::test_function<class boost::math::concepts::real_concept>(class boost::math::concepts::real_concept, class boost::math::concepts::real_concept, class boost::math::concepts::real_concept): Internal Evaluation Error, best value so far was 1.25
+ Error in function boost::math::test_function<class boost::math::concepts::real_concept>(class boost::math::concepts::real_concept, class boost::math::concepts::real_concept, class boost::math::concepts::real_concept): Error while handling value 1.25
+
+ *** No errors detected
+ Error in function boost::math::test_function<class boost::math::concepts::real_concept>(class boost::math::concepts::real_concept, class boost::math::concepts::real_concept, class boost::math::concepts::real_concept): Indeterminate result with value 1.25
+========== Rebuild All: 1 succeeded, 0 failed, 0 skipped ==========
+
+
*/

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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,5 +1,5 @@
// Copyright John Maddock 2006.
-// Copyright Paul A. Bristow 2007.
+// Copyright Paul A. Bristow 2007, 2010.

// Use, modification and distribution are subject to the
// Boost Software License, Version 1.0.
@@ -11,11 +11,11 @@
// http://en.wikipedia.org/wiki/Gamma_distribution
// http://www.itl.nist.gov/div898/handbook/eda/section3/eda366b.htm
// Also:
-// Weisstein, Eric W. "Gamma Distribution."
-// From MathWorld--A Wolfram Web Resource.
+// Weisstein, Eric W. "Gamma Distribution."
+// From MathWorld--A Wolfram Web Resource.
// http://mathworld.wolfram.com/GammaDistribution.html

-#include <pch.hpp>
+#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
@@ -23,7 +23,7 @@

#include <boost/math/distributions/gamma.hpp>
 using boost::math::gamma_distribution;
-#include <boost/math/tools/test.hpp>
+#include <boost/math/tools/test.hpp>

#include <iostream>
 using std::cout;
@@ -96,7 +96,7 @@
 // The first tests use values generated by MathCAD,
 // and should be accurate to around double precision.
 //
- RealType tolerance = (std::max)(RealType(5e-14f), std::numeric_limits<RealType>::epsilon() * 20) * 100;
+ RealType tolerance = (std::max)(RealType(5e-14f), std::numeric_limits<RealType>::epsilon() * 20) * 100;
 cout << "Tolerance for type " << typeid(RealType).name() << " is " << tolerance << " %" << endl;

 check_gamma(

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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -1,4 +1,4 @@
-// Copyright Paul A. Bristow 2007.
+// Copyright Paul A. Bristow 2010.
// Copyright John Maddock 2007.

// Use, modification and distribution are subject to the
@@ -15,7 +15,7 @@
// From MathWorld--A Wolfram Web Resource.
// http://mathworld.wolfram.com/NormalDistribution.html

-#include <pch.hpp>
+#include <pch.hpp> // include directory libs/math/src/tr1/ is needed.

#ifdef _MSC_VER
#pragma warning (disable: 4127) // conditional expression is constant
@@ -326,6 +326,43 @@
Tolerance for type class boost::math::concepts::real_concept is 0.01 %
*** No errors detected

+
+
+
+------ Build started: Project: test_normal, Configuration: Release Win32 ------
+ test_normal.cpp
+ Generating code
+ Finished generating code
+ test_normal.vcxproj -> J:\Cpp\MathToolkit\test\Math_test\Release\test_normal.exe
+ Running 1 test case...
+ Tolerance for type float is 0.01 %
+ Tolerance for type double is 0.01 %
+ Tolerance for type long double is 0.01 %
+ Tolerance for type class boost::math::concepts::real_concept is 0.01 %
+
+ *** No errors detected
+ Detected memory leaks!
+ Dumping objects ->
+ {2413} normal block at 0x00321190, 42 bytes long.
+ Data: <class boost::mat> 63 6C 61 73 73 20 62 6F 6F 73 74 3A 3A 6D 61 74
+ {2412} normal block at 0x003231F0, 8 bytes long.
+ Data: < 2 22 > 90 11 32 00 98 32 32 00
+ {1824} normal block at 0x00323180, 12 bytes long.
+ Data: <long double > 6C 6F 6E 67 20 64 6F 75 62 6C 65 00
+ {1823} normal block at 0x00323298, 8 bytes long.
+ Data: < 12 `22 > 80 31 32 00 60 32 32 00
+ {1227} normal block at 0x00323148, 7 bytes long.
+ Data: <double > 64 6F 75 62 6C 65 00
+ {1226} normal block at 0x00323260, 8 bytes long.
+ Data: <H12 02 > 48 31 32 00 A0 30 32 00
+ {633} normal block at 0x003230D8, 6 bytes long.
+ Data: <float > 66 6C 6F 61 74 00
+ {632} normal block at 0x003230A0, 8 bytes long.
+ Data: < 02 > D8 30 32 00 00 00 00 00
+ Object dump complete.
+========== Build: 1 succeeded, 0 failed, 0 up-to-date, 0 skipped ==========
+
+
*/

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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -56,7 +56,7 @@
 ibeta_roots_2(T _a, T _b, T t, bool inv = false)
 : a(_a), b(_b), target(t), invert(inv) {}

- std::tr1::tuple<T, T> operator()(const T& x)
+ boost::math::tuple<T, T> operator()(const T& x)
 {
 typedef typename boost::math::lanczos::lanczos<T, Policy>::type L;
 T f = boost::math::detail::ibeta_imp(a, b, x, Policy(), invert, true) - target;
@@ -72,7 +72,7 @@
 if(f1 == 0)
 f1 = (invert ? -1 : 1) * boost::math::tools::min_value<T>() * 64;

- return std::tr1::make_tuple(f, f1);
+ return boost::math::make_tuple(f, f1);
 }
private:
 T a, b, target;
@@ -85,7 +85,7 @@
 ibeta_roots_3(T _a, T _b, T t, bool inv = false)
 : a(_a), b(_b), target(t), invert(inv) {}

- std::tr1::tuple<T, T, T> operator()(const T& x)
+ boost::math::tuple<T, T, T> operator()(const T& x)
 {
 typedef typename boost::math::lanczos::lanczos<T, Policy>::type L;
 T f = boost::math::detail::ibeta_imp(a, b, x, Policy(), invert, true) - target;
@@ -104,7 +104,7 @@
 if(f1 == 0)
 f1 = (invert ? -1 : 1) * boost::math::tools::min_value<T>() * 64;

- return std::tr1::make_tuple(f, f1, f2);
+ return boost::math::make_tuple(f, f1, f2);
 }
private:
 T a, b, target;

Modified: branches/release/libs/math/tools/bessel_data.cpp
==============================================================================
--- branches/release/libs/math/tools/bessel_data.cpp (original)
+++ branches/release/libs/math/tools/bessel_data.cpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -12,8 +12,8 @@
//
#include <fstream>

+#include <boost/math/bindings/rr.hpp>
#include <boost/math/tools/test_data.hpp>
-#include "ntl_rr_lanczos.hpp"

#include <boost/math/special_functions/bessel.hpp>

Modified: branches/release/libs/math/tools/beta_data.cpp
==============================================================================
--- branches/release/libs/math/tools/beta_data.cpp (original)
+++ branches/release/libs/math/tools/beta_data.cpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -6,10 +6,8 @@
#include <boost/math/bindings/rr.hpp>
#include <boost/math/special_functions/gamma.hpp>
#include <boost/math/constants/constants.hpp>
-#include <boost/math/tools/test.hpp>
-#include <fstream>
-
#include <boost/math/tools/test_data.hpp>
+#include <fstream>

using namespace boost::math::tools;

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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -21,7 +21,7 @@
 return *pf;
}

-std::tr1::tuple<boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR> generate_rf_data(boost::math::ntl::RR n)
+boost::math::tuple<boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR> generate_rf_data(boost::math::ntl::RR n)
{
 static std::tr1::mt19937 r;
 std::tr1::uniform_real<float> ur(0, 1);
@@ -37,10 +37,10 @@
 boost::math::ntl::RR zr(truncate_to_float(&z));

 boost::math::ntl::RR result = boost::math::ellint_rf(xr, yr, zr);
- return std::tr1::make_tuple(xr, yr, zr, result);
+ return boost::math::make_tuple(xr, yr, zr, result);
}

-std::tr1::tuple<boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR> generate_rc_data(boost::math::ntl::RR n)
+boost::math::tuple<boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR> generate_rc_data(boost::math::ntl::RR n)
{
 static std::tr1::mt19937 r;
 std::tr1::uniform_real<float> ur(0, 1);
@@ -53,10 +53,10 @@
 boost::math::ntl::RR yr(truncate_to_float(&y));

 boost::math::ntl::RR result = boost::math::ellint_rc(xr, yr);
- return std::tr1::make_tuple(xr, yr, result);
+ return boost::math::make_tuple(xr, yr, result);
}

-std::tr1::tuple<boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR> generate_rj_data(boost::math::ntl::RR n)
+boost::math::tuple<boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR> generate_rj_data(boost::math::ntl::RR n)
{
 static std::tr1::mt19937 r;
 std::tr1::uniform_real<float> ur(0, 1);
@@ -78,10 +78,10 @@
 boost::math::ellint_rj(x, y, z, p);

 boost::math::ntl::RR result = boost::math::ellint_rj(xr, yr, zr, pr);
- return std::tr1::make_tuple(xr, yr, zr, pr, result);
+ return boost::math::make_tuple(xr, yr, zr, pr, result);
}

-std::tr1::tuple<boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR> generate_rd_data(boost::math::ntl::RR n)
+boost::math::tuple<boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR> generate_rd_data(boost::math::ntl::RR n)
{
 static std::tr1::mt19937 r;
 std::tr1::uniform_real<float> ur(0, 1);
@@ -97,7 +97,7 @@
 boost::math::ntl::RR zr(truncate_to_float(&z));

 boost::math::ntl::RR result = boost::math::ellint_rd(xr, yr, zr);
- return std::tr1::make_tuple(xr, yr, zr, result);
+ return boost::math::make_tuple(xr, yr, zr, result);
}

int test_main(int argc, char*argv [])

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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -3,9 +3,9 @@
// 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 "ntl_rr_digamma.hpp"
+#include <boost/math/bindings/rr.hpp>
+#include <boost/math/special_functions/digamma.hpp>
#include <boost/test/included/test_exec_monitor.hpp>
-#include <boost/math/tools/test.hpp>
#include <fstream>

#include <boost/math/tools/test_data.hpp>
@@ -44,7 +44,7 @@
 do{
 if(0 == get_user_parameter_info(arg1, "z"))
 return 1;
- data.insert(&boost::math::digamma, arg1);
+ data.insert(&boost::math::digamma<boost::math::ntl::RR>, arg1);

 std::cout << "Any more data [y/n]?";
 std::getline(std::cin, line);

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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -23,14 +23,14 @@
 return *pf;
}

-std::tr1::tuple<boost::math::ntl::RR, boost::math::ntl::RR> generate_data(boost::math::ntl::RR n, boost::math::ntl::RR phi)
+boost::math::tuple<boost::math::ntl::RR, boost::math::ntl::RR> generate_data(boost::math::ntl::RR n, boost::math::ntl::RR phi)
{
 static std::tr1::mt19937 r;
 std::tr1::uniform_real<float> ui(0, 1);
 float k = ui(r);
 boost::math::ntl::RR kr(truncate_to_float(&k));
 boost::math::ntl::RR result = boost::math::ellint_3(kr, n, phi);
- return std::tr1::make_tuple(kr, result);
+ return boost::math::make_tuple(kr, result);
}

int test_main(int argc, char*argv [])

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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -13,8 +13,6 @@

#include <boost/math/tools/test_data.hpp>

-#include "ntl_rr_lanczos.hpp"
-
using namespace boost::math::tools;
using namespace std;

@@ -33,7 +31,7 @@

struct erf_data_generator
{
- std::tr1::tuple<boost::math::ntl::RR, boost::math::ntl::RR> operator()(boost::math::ntl::RR z)
+ boost::math::tuple<boost::math::ntl::RR, boost::math::ntl::RR> operator()(boost::math::ntl::RR z)
 {
 // very naively calculate spots using the gamma function at high precision:
 int sign = 1;
@@ -58,7 +56,7 @@
 }
 if(sign < 1)
 g2 = 2 - g2;
- return std::tr1::make_tuple(g1, g2);
+ return boost::math::make_tuple(g1, g2);
 }
};

@@ -119,14 +117,14 @@
 << terms << " terms." << std::endl;
}

-std::tr1::tuple<boost::math::ntl::RR, boost::math::ntl::RR> erfc_inv(boost::math::ntl::RR r)
+boost::math::tuple<boost::math::ntl::RR, boost::math::ntl::RR> erfc_inv(boost::math::ntl::RR r)
{
 boost::math::ntl::RR x = exp(-r * r);
 x = NTL::RoundToPrecision(x.value(), 64);
 std::cout << x << " ";
 boost::math::ntl::RR result = boost::math::erfc_inv(x);
 std::cout << result << std::endl;
- return std::tr1::make_tuple(x, result);
+ return boost::math::make_tuple(x, result);
}

@@ -165,7 +163,7 @@
 }
 else if(strcmp(argv[1], "--erfc_inv") == 0)
 {
- std::tr1::tuple<boost::math::ntl::RR, boost::math::ntl::RR> (*f)(boost::math::ntl::RR);
+ boost::math::tuple<boost::math::ntl::RR, boost::math::ntl::RR> (*f)(boost::math::ntl::RR);
 f = erfc_inv;
 std::cout << "Welcome.\n"
 "This program will generate spot tests for the inverse erfc function:\n";

Modified: branches/release/libs/math/tools/expint_data.cpp
==============================================================================
--- branches/release/libs/math/tools/expint_data.cpp (original)
+++ branches/release/libs/math/tools/expint_data.cpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -4,7 +4,6 @@
// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

#include <boost/math/bindings/rr.hpp>
-#include "ntl_rr_digamma.hpp"
#include <boost/math/special_functions/expint.hpp>
#include <boost/math/constants/constants.hpp>
#include <fstream>

Modified: branches/release/libs/math/tools/expint_i_data.cpp
==============================================================================
--- branches/release/libs/math/tools/expint_i_data.cpp (original)
+++ branches/release/libs/math/tools/expint_i_data.cpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -4,7 +4,6 @@
// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

#include <boost/math/bindings/rr.hpp>
-#include "ntl_rr_digamma.hpp"
#include <boost/math/special_functions/expint.hpp>
#include <boost/math/constants/constants.hpp>
#include <fstream>

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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -12,7 +12,6 @@
#include <fstream>

#include <boost/math/tools/test_data.hpp>
-#include "ntl_rr_lanczos.hpp"

using namespace boost::math::tools;

@@ -37,12 +36,12 @@

struct gamma_inverse_generator_a
{
- std::tr1::tuple<boost::math::ntl::RR, boost::math::ntl::RR> operator()(const boost::math::ntl::RR x, const boost::math::ntl::RR p)
+ boost::math::tuple<boost::math::ntl::RR, boost::math::ntl::RR> operator()(const boost::math::ntl::RR x, const boost::math::ntl::RR p)
 {
 boost::math::ntl::RR x1 = boost::math::gamma_p_inva(x, p);
 boost::math::ntl::RR x2 = boost::math::gamma_q_inva(x, p);
 std::cout << "Inverse for " << x << " " << p << std::endl;
- return std::tr1::make_tuple(x1, x2);
+ return boost::math::make_tuple(x1, x2);
 }
};

Modified: branches/release/libs/math/tools/generate_test_values.cpp
==============================================================================
--- branches/release/libs/math/tools/generate_test_values.cpp (original)
+++ branches/release/libs/math/tools/generate_test_values.cpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -7,7 +7,7 @@
# define NTL_STD_CXX
#endif

-#include <ntl/RR.h>
+#include <NTL/RR.h>
#include <iostream>
#include <iomanip>

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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -17,11 +17,11 @@

template<class T>
-std::tr1::tuple<T, T, T> hermite_data(T n, T x)
+boost::math::tuple<T, T, T> hermite_data(T n, T x)
{
 n = floor(n);
 T r1 = hermite(boost::math::tools::real_cast<unsigned>(n), x);
- return std::tr1::make_tuple(n, x, r1);
+ return boost::math::make_tuple(n, x, r1);
}

int test_main(int argc, char*argv [])

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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -23,7 +23,7 @@

struct hypergeometric_generator
{
- std::tr1::tuple<
+ boost::math::tuple<
 boost::math::ntl::RR,
 boost::math::ntl::RR,
 boost::math::ntl::RR,
@@ -43,7 +43,7 @@
 int N = itrunc(rN);
 int r = itrunc(rr);
 int n = itrunc(rn);
- uniform_int<> ui((std::max)(0, n + r - N), (std::min)(n, r));
+ boost::uniform_int<> ui((std::max)(0, n + r - N), (std::min)(n, r));
 int k = ui(rnd);

 hypergeometric_distribution<ntl::RR> d(r, n, N);
@@ -59,7 +59,7 @@

 std::cout << "N = " << N << " r = " << r << " n = " << n << " PDF = " << p << " CDF = " << c << " CCDF = " << cc << std::endl;

- return tr1::make_tuple(r, n, N, k, p, c, cc);
+ return boost::math::make_tuple(r, n, N, k, p, c, cc);
 }
 catch(const std::exception& e)
 {

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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -15,9 +15,6 @@

#include <boost/math/tools/test_data.hpp>

-// speed up beta function computation with a 90-decimal digit approximation:
-#include "ntl_rr_lanczos.hpp"
-
using namespace boost::math::tools;
using namespace boost::math;
using namespace std;
@@ -68,7 +65,7 @@
 std::swap(a, b);

 std::pair<T, T> p(a, b);
- std::map<std::pair<T, T>, T>::const_iterator i = m.find(p);
+ typename std::map<std::pair<T, T>, T>::const_iterator i = m.find(p);
 if(i != m.end())
 return i->second;

@@ -180,7 +177,7 @@

struct beta_data_generator
{
- std::tr1::tuple<boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR> operator()(boost::math::ntl::RR ap, boost::math::ntl::RR bp, boost::math::ntl::RR x_)
+ boost::math::tuple<boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR> operator()(boost::math::ntl::RR ap, boost::math::ntl::RR bp, boost::math::ntl::RR x_)
 {
 float a = truncate_to_float(real_cast<float>(gen() * pow(boost::math::ntl::RR(10), ap)));
 float b = truncate_to_float(real_cast<float>(gen() * pow(boost::math::ntl::RR(10), bp)));
@@ -188,14 +185,14 @@
 std::cout << a << " " < ib_full = ibeta_fraction1(boost::math::ntl::RR(a), boost::math::ntl::RR(b), boost::math::ntl::RR(x));
 std::pair<boost::math::ntl::RR, boost::math::ntl::RR> ib_reg = ibeta_fraction1_regular(boost::math::ntl::RR(a), boost::math::ntl::RR(b), boost::math::ntl::RR(x));
- return std::tr1::make_tuple(a, b, x, ib_full.first, ib_full.second, ib_reg.first, ib_reg.second);
+ return boost::math::make_tuple(a, b, x, ib_full.first, ib_full.second, ib_reg.first, ib_reg.second);
 }
};

// medium sized values:
struct beta_data_generator_medium
{
- std::tr1::tuple<boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR> operator()(boost::math::ntl::RR x_)
+ boost::math::tuple<boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR> operator()(boost::math::ntl::RR x_)
 {
 boost::math::ntl::RR a = gen2();
 boost::math::ntl::RR b = gen2();
@@ -212,13 +209,13 @@
 std::cout << exp_beta << std::endl;
 }*/
 std::pair<boost::math::ntl::RR, boost::math::ntl::RR> ib_reg = ibeta_fraction1_regular(boost::math::ntl::RR(a), boost::math::ntl::RR(b), boost::math::ntl::RR(x));
- return std::tr1::make_tuple(a, b, x, ib_full.first, ib_full.second, ib_reg.first, ib_reg.second);
+ return boost::math::make_tuple(a, b, x, ib_full.first, ib_full.second, ib_reg.first, ib_reg.second);
 }
};

struct beta_data_generator_small
{
- std::tr1::tuple<boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR> operator()(boost::math::ntl::RR x_)
+ boost::math::tuple<boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR> operator()(boost::math::ntl::RR x_)
 {
 float a = truncate_to_float(gen2()/10);
 float b = truncate_to_float(gen2()/10);
@@ -226,19 +223,19 @@
 std::cout << a << " " < ib_full = ibeta_fraction1(boost::math::ntl::RR(a), boost::math::ntl::RR(b), boost::math::ntl::RR(x));
 std::pair<boost::math::ntl::RR, boost::math::ntl::RR> ib_reg = ibeta_fraction1_regular(boost::math::ntl::RR(a), boost::math::ntl::RR(b), boost::math::ntl::RR(x));
- return std::tr1::make_tuple(a, b, x, ib_full.first, ib_full.second, ib_reg.first, ib_reg.second);
+ return boost::math::make_tuple(a, b, x, ib_full.first, ib_full.second, ib_reg.first, ib_reg.second);
 }
};

struct beta_data_generator_int
{
- std::tr1::tuple<boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR> operator()(boost::math::ntl::RR a, boost::math::ntl::RR b, boost::math::ntl::RR x_)
+ boost::math::tuple<boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR> operator()(boost::math::ntl::RR a, boost::math::ntl::RR b, boost::math::ntl::RR x_)
 {
 float x = truncate_to_float(real_cast<float>(x_));
 std::cout << a << " " < ib_full = ibeta_fraction1(a, b, boost::math::ntl::RR(x));
 std::pair<boost::math::ntl::RR, boost::math::ntl::RR> ib_reg = ibeta_fraction1_regular(a, b, boost::math::ntl::RR(x));
- return std::tr1::make_tuple(a, b, x, ib_full.first, ib_full.second, ib_reg.first, ib_reg.second);
+ return boost::math::make_tuple(a, b, x, ib_full.first, ib_full.second, ib_reg.first, ib_reg.second);
 }
};

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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -13,7 +13,6 @@
#include <fstream>

#include <boost/math/tools/test_data.hpp>
-#include "ntl_rr_lanczos.hpp"

using namespace boost::math::tools;

@@ -44,7 +43,7 @@

struct ibeta_inv_data_generator
{
- std::tr1::tuple<boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR> operator()(boost::math::ntl::RR ap, boost::math::ntl::RR bp, boost::math::ntl::RR x_)
+ boost::math::tuple<boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR> operator()(boost::math::ntl::RR ap, boost::math::ntl::RR bp, boost::math::ntl::RR x_)
 {
 float a = truncate_to_float(real_cast<float>(gen() * pow(boost::math::ntl::RR(10), ap)));
 float b = truncate_to_float(real_cast<float>(gen() * pow(boost::math::ntl::RR(10), bp)));
@@ -54,7 +53,7 @@
 std::cout << " " << inv << std::flush;
 boost::math::ntl::RR invc = boost::math::ibetac_inv(boost::math::ntl::RR(a), boost::math::ntl::RR(b), boost::math::ntl::RR(x));
 std::cout << " " << invc << std::endl;
- return std::tr1::make_tuple(a, b, x, inv, invc);
+ return boost::math::make_tuple(a, b, x, inv, invc);
 }
};

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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -12,7 +12,6 @@
#include <fstream>

#include <boost/math/tools/test_data.hpp>
-#include "ntl_rr_lanczos.hpp"

using namespace boost::math::tools;

@@ -43,7 +42,7 @@

struct ibeta_inv_data_generator
{
- std::tr1::tuple<boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR> operator()
+ boost::math::tuple<boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR> operator()
 (boost::math::ntl::RR bp, boost::math::ntl::RR x_, boost::math::ntl::RR p_)
 {
 float b = truncate_to_float(real_cast<float>(gen() * pow(boost::math::ntl::RR(10), bp)));
@@ -58,7 +57,7 @@
 std::cout << " " << invb << std::flush;
 boost::math::ntl::RR invbc = boost::math::ibetac_invb(boost::math::ntl::RR(b), boost::math::ntl::RR(x), boost::math::ntl::RR(p));
 std::cout << " " << invbc << std::endl;
- return std::tr1::make_tuple(b, x, p, inv, invc, invb, invbc);
+ return boost::math::make_tuple(b, x, p, inv, invc, invb, invbc);
 }
};

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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -12,7 +12,6 @@
#include <fstream>

#include <boost/math/tools/test_data.hpp>
-#include "ntl_rr_lanczos.hpp"

using namespace boost::math::tools;

@@ -43,7 +42,7 @@
//
struct igamma_data_generator
{
- std::tr1::tuple<boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR> operator()(boost::math::ntl::RR a, boost::math::ntl::RR x)
+ boost::math::tuple<boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR, boost::math::ntl::RR> operator()(boost::math::ntl::RR a, boost::math::ntl::RR x)
 {
 // very naively calculate spots:
 boost::math::ntl::RR z;
@@ -80,29 +79,29 @@
 boost::math::ntl::RR rlg = boost::math::gamma_p(a, z);
 boost::math::ntl::RR rug = boost::math::gamma_q(a, z);

- return std::tr1::make_tuple(z, ug, rug, lg, rlg);
+ return boost::math::make_tuple(z, ug, rug, lg, rlg);
 }
};

struct gamma_inverse_generator
{
- std::tr1::tuple<boost::math::ntl::RR, boost::math::ntl::RR> operator()(const boost::math::ntl::RR a, const boost::math::ntl::RR p)
+ boost::math::tuple<boost::math::ntl::RR, boost::math::ntl::RR> operator()(const boost::math::ntl::RR a, const boost::math::ntl::RR p)
 {
 boost::math::ntl::RR x1 = boost::math::gamma_p_inv(a, p);
 boost::math::ntl::RR x2 = boost::math::gamma_q_inv(a, p);
 std::cout << "Inverse for " << a << " " < operator()(const boost::math::ntl::RR x, const boost::math::ntl::RR p)
+ boost::math::tuple<boost::math::ntl::RR, boost::math::ntl::RR> operator()(const boost::math::ntl::RR x, const boost::math::ntl::RR p)
 {
 boost::math::ntl::RR x1 = boost::math::gamma_p_inva(x, p);
 boost::math::ntl::RR x2 = boost::math::gamma_q_inva(x, p);
 std::cout << "Inverse for " << x << " " << p << std::endl;
- return std::tr1::make_tuple(x1, x2);
+ return boost::math::make_tuple(x1, x2);
 }
};

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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -18,20 +18,20 @@

template<class T>
-std::tr1::tuple<T, T, T> laguerre2_data(T n, T x)
+boost::math::tuple<T, T, T> laguerre2_data(T n, T x)
{
 n = floor(n);
 T r1 = laguerre(boost::math::tools::real_cast<unsigned>(n), x);
- return std::tr1::make_tuple(n, x, r1);
+ return boost::math::make_tuple(n, x, r1);
}

template<class T>
-std::tr1::tuple<T, T, T, T> laguerre3_data(T n, T m, T x)
+boost::math::tuple<T, T, T, T> laguerre3_data(T n, T m, T x)
{
 n = floor(n);
 m = floor(m);
 T r1 = laguerre(real_cast<unsigned>(n), real_cast<unsigned>(m), x);
- return std::tr1::make_tuple(n, m, x, r1);
+ return boost::math::make_tuple(n, m, x, r1);
}

int test_main(int argc, char*argv [])

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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -18,23 +18,23 @@

template<class T>
-std::tr1::tuple<T, T, T, T> legendre_p_data(T n, T x)
+boost::math::tuple<T, T, T, T> legendre_p_data(T n, T x)
{
 n = floor(n);
 T r1 = legendre_p(boost::math::tools::real_cast<int>(n), x);
 T r2 = legendre_q(boost::math::tools::real_cast<int>(n), x);
- return std::tr1::make_tuple(n, x, r1, r2);
+ return boost::math::make_tuple(n, x, r1, r2);
}

template<class T>
-std::tr1::tuple<T, T, T, T> assoc_legendre_p_data(T n, T x)
+boost::math::tuple<T, T, T, T> assoc_legendre_p_data(T n, T x)
{
 static tr1::mt19937 r;
 int l = real_cast<int>(floor(n));
 tr1::uniform_int<> ui((std::max)(-l, -40), (std::min)(l, 40));
 int m = ui(r);
 T r1 = legendre_p(l, m, x);
- return std::tr1::make_tuple(n, m, x, r1);
+ return boost::math::make_tuple(n, m, x, r1);
}

int test_main(int argc, char*argv [])

Modified: branches/release/libs/math/tools/log1p_expm1_data.cpp
==============================================================================
--- branches/release/libs/math/tools/log1p_expm1_data.cpp (original)
+++ branches/release/libs/math/tools/log1p_expm1_data.cpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -15,9 +15,9 @@

struct data_generator
{
- std::tr1::tuple<boost::math::ntl::RR, boost::math::ntl::RR> operator()(boost::math::ntl::RR z)
+ boost::math::tuple<boost::math::ntl::RR, boost::math::ntl::RR> operator()(boost::math::ntl::RR z)
{
- return std::tr1::make_tuple(boost::math::log1p(z), boost::math::expm1(z));
+ return boost::math::make_tuple(boost::math::log1p(z), boost::math::expm1(z));
}
};

Modified: branches/release/libs/math/tools/process_perf_results.cpp
==============================================================================
--- branches/release/libs/math/tools/process_perf_results.cpp (original)
+++ branches/release/libs/math/tools/process_perf_results.cpp 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -63,7 +63,8 @@
    // Load quickbook file:
    //
    std::ifstream is(argv[argc-1]);
- std::ofstream os(std::string(argv[argc-1]).append(".bak").c_str());
+ std::string bak_file = std::string(argv[argc-1]).append(".bak");
+ std::ofstream os(bak_file.c_str());
    e.assign(
       "\\[perf\\s+([^\\s.]+)"
       "(?:"

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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -26,12 +26,12 @@

template<class T>
-std::tr1::tuple<T, T, T, T, T, T> spherical_harmonic_data(T i)
+boost::math::tuple<T, T, T, T, T, T> spherical_harmonic_data(T i)
{
 static tr1::mt19937 r;

 int n = real_cast<int>(floor(i));
- tr1::uniform_int<> ui(0, (std::min)(n, 40));
+ std::tr1::uniform_int<> ui(0, (std::min)(n, 40));
 int m = ui(r);

 std::tr1::uniform_real<float> ur(-2*constants::pi<float>(), 2*constants::pi<float>());
@@ -42,7 +42,7 @@

 T r1 = spherical_harmonic_r(n, m, theta, phi);
 T r2 = spherical_harmonic_i(n, m, theta, phi);
- return std::tr1::make_tuple(n, m, theta, phi, r1, r2);
+ return boost::math::make_tuple(n, m, theta, phi, r1, r2);
}

int test_main(int argc, char*argv [])

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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -11,12 +11,10 @@

#include <boost/math/tools/test_data.hpp>

-#include "ntl_rr_lanczos.hpp"
-
using namespace boost::math::tools;
using namespace std;

-std::tr1::tuple<boost::math::ntl::RR, boost::math::ntl::RR>
+boost::math::tuple<boost::math::ntl::RR, boost::math::ntl::RR>
 tgamma_ratio(const boost::math::ntl::RR& a, const boost::math::ntl::RR& delta)
{
 if(delta > a)
@@ -27,7 +25,7 @@
 if((r1 > (std::numeric_limits<float>::max)()) || (r2 > (std::numeric_limits<float>::max)()))
 throw std::domain_error("");

- return std::tr1::make_tuple(r1, r2);
+ return boost::math::make_tuple(r1, r2);
}

boost::math::ntl::RR tgamma_ratio2(const boost::math::ntl::RR& a, const boost::math::ntl::RR& b)

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 2010-10-04 11:17:21 EDT (Mon, 04 Oct 2010)
@@ -28,12 +28,12 @@

struct zeta_data_generator2
{
- std::tr1::tuple<boost::math::ntl::RR, boost::math::ntl::RR> operator()(boost::math::ntl::RR z)
+ boost::math::tuple<boost::math::ntl::RR, boost::math::ntl::RR> operator()(boost::math::ntl::RR z)
 {
 std::cout << -z << " ";
 boost::math::ntl::RR result = boost::math::zeta(-z);
 std::cout << result << std::endl;
- return std::tr1::make_tuple(-z, result);
+ return boost::math::make_tuple(-z, result);
 }
};

Next message: lucanus.j.simonson_at_[hidden]: "[Boost-commit] svn:boost r65750 - trunk/boost/polygon"
Previous message: bdawes_at_[hidden]: "[Boost-commit] svn:boost r65748 - in trunk/libs/filesystem: v2/test v3/src v3/test"

Date view	Thread view	Subject view	Author view

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