Boost-Commit :

Date view	Thread view	Subject view	Author view

Subject: [Boost-commit] svn:boost r65664 - in trunk/libs/math/doc: html sf_and_dist sf_and_dist/distributions sf_and_dist/html sf_and_dist/html/math_toolkit sf_and_dist/html/math_toolkit/backgrounders sf_and_dist/html/math_toolkit/dist sf_and_dist/html/math_toolkit/dist/dist_ref sf_and_dist/html/math_toolkit/dist/dist_ref/dists sf_and_dist/html/math_toolkit/dist/stat_tut sf_and_dist/html/math_toolkit/dist/stat_tut/overview sf_and_dist/html/math_toolkit/dist/stat_tut/weg sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg sf_and_dist/html/math_toolkit/dist/stat_tut/weg/cs_eg sf_and_dist/html/math_toolkit/dist/stat_tut/weg/find_eg sf_and_dist/html/math_toolkit/dist/stat_tut/weg/nccs_eg sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg sf_and_dist/html/math_toolkit/dist/stat_tut/weg/normal_example sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg sf_and_dist/html/math_toolkit/extern_c sf_and_dist/html/math_toolkit/main_overview sf_and_dist/html/math_toolkit/perf sf_and_dist/html/math_toolkit/policy sf_and_dist/html/math_toolkit/policy/pol_ref sf_and_dist/html/math_toolkit/policy/pol_tutorial sf_and_dist/html/math_toolkit/special sf_and_dist/html/math_toolkit/special/bessel sf_and_dist/html/math_toolkit/special/ellint sf_and_dist/html/math_toolkit/special/expint sf_and_dist/html/math_toolkit/special/factorials sf_and_dist/html/math_toolkit/special/inv_hyper sf_and_dist/html/math_toolkit/special/powers sf_and_dist/html/math_toolkit/special/sf_beta sf_and_dist/html/math_toolkit/special/sf_erf sf_and_dist/html/math_toolkit/special/sf_gamma sf_and_dist/html/math_toolkit/special/sf_poly sf_and_dist/html/math_toolkit/special/sinc sf_and_dist/html/math_toolkit/special/zetas sf_and_dist/html/math_toolkit/status sf_and_dist/html/math_toolkit/toolkit sf_and_dist/html/math_toolkit/toolkit/internals1 sf_and_dist/html/math_toolkit/toolkit/internals2 sf_and_dist/html/math_toolkit/using_udt sf_and_dist/html/math_toolkit/utils sf_and_dist/html/math_toolkit/utils/next_float sf_and_dist/html/math_toolkit/utils/rounding
From: pbristow_at_[hidden]
Date: 2010-09-29 05:24:38

Next message: pbristow_at_[hidden]: "[Boost-commit] svn:boost r65665 - trunk/libs/math/example"
Previous message: pbristow_at_[hidden]: "[Boost-commit] svn:boost r65662 - trunk/libs/math/test"

Author: pbristow
Date: 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
New Revision: 65664
URL: http://svn.boost.org/trac/boost/changeset/65664

Log:
Full read through, many minor edits, added two new distributions, including graphs. New items for 1.45 added, new credits, and new FAQ section.
Added:
   trunk/libs/math/doc/sf_and_dist/distributions/inverse_chi_squared.qbk (contents, props changed)
Text files modified:
   trunk/libs/math/doc/html/index.html | 10
   trunk/libs/math/doc/sf_and_dist/background.qbk | 13
   trunk/libs/math/doc/sf_and_dist/building.qbk | 15
   trunk/libs/math/doc/sf_and_dist/common_overviews.qbk | 6
   trunk/libs/math/doc/sf_and_dist/credits.qbk | 9
   trunk/libs/math/doc/sf_and_dist/dist_reference.qbk | 1
   trunk/libs/math/doc/sf_and_dist/dist_tutorial.qbk | 42
   trunk/libs/math/doc/sf_and_dist/distributions/binomial.qbk | 2
   trunk/libs/math/doc/sf_and_dist/distributions/inverse_gamma.qbk | 82
   trunk/libs/math/doc/sf_and_dist/distributions/inverse_gamma_example.qbk | 4
   trunk/libs/math/doc/sf_and_dist/distributions/non_members.qbk | 10
   trunk/libs/math/doc/sf_and_dist/error_handling.qbk | 22
   trunk/libs/math/doc/sf_and_dist/fpclassify.qbk | 4
   trunk/libs/math/doc/sf_and_dist/html/index.html | 528 ++++----
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders.html | 13
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/implementation.html | 57
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/lanczos.html | 12
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/refs.html | 30
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/relative_error.html | 9
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/remez.html | 24
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist.html | 245 ++--
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref.html | 87
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dist_algorithms.html | 8
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists.html | 81
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/bernoulli_dist.html | 14
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/beta_dist.html | 70
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/binomial_dist.html | 84
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/cauchy_dist.html | 22
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/chi_squared_dist.html | 22
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/exp_dist.html | 12
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/extreme_dist.html | 10
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/f_dist.html | 16
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/gamma_dist.html | 30
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/hypergeometric_dist.html | 14
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/inverse_gamma_dist.html | 164 ++
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/laplace_dist.html | 16
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/logistic_dist.html | 12
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/lognormal_dist.html | 12
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/nc_beta_dist.html | 12
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/nc_chi_squared_dist.html | 16
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/nc_f_dist.html | 18
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/nc_t_dist.html | 12
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/negative_binomial_dist.html | 85
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/normal_dist.html | 12
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/pareto.html | 25
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/poisson_dist.html | 68
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/rayleigh.html | 20
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/students_t_dist.html | 14
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/triangular_dist.html | 14
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/uniform_dist.html | 12
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/weibull.html | 28
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/nmp.html | 82
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/future.html | 10
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut.html | 154 +-
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/dist_params.html | 15
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview.html | 21
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/complements.html | 14
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/generic.html | 80
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/headers.html | 34
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/objects.html | 2
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/parameters.html | 4
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/summary.html | 2
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/variates.html | 20
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg.html | 130 +-
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg.html | 19
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg/binom_conf.html | 7
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg/binom_size_eg.html | 4
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg/binomial_coinflip_example.html | 265 +---
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg/binomial_quiz_example.html | 500 ++------
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/c_sharp.html | 2
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/cs_eg.html | 15
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/cs_eg/chi_sq_intervals.html | 6
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/cs_eg/chi_sq_size.html | 5
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/cs_eg/chi_sq_test.html | 4
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/dist_construct_eg.html | 348 ++----
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/error_eg.html | 157 -
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/f_eg.html | 2
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/find_eg.html | 14
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/find_eg/find_location_eg.html | 186 +--
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/find_eg/find_mean_and_sd_eg.html | 682 ++++-------
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/find_eg/find_scale_eg.html | 217 +--
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/inverse_gamma_eg.html | 13
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/nag_library.html | 2
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/nccs_eg.html | 6
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/nccs_eg/nccs_power_eg.html | 2278 +++++++++++++++++++--------------------
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg.html | 20
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg/neg_binom_conf.html | 103 -
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg/neg_binom_size_eg.html | 83
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg/negative_binomial_example1.html | 653 ++++-------
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg/negative_binomial_example2.html | 16
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/normal_example.html | 6
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/normal_example/normal_misc.html | 578 +++------
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg.html | 26
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg/paired_st.html | 4
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg/tut_mean_intervals.html | 6
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg/tut_mean_size.html | 6
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg/tut_mean_test.html | 4
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg/two_sample_students_t.html | 4
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/extern_c.html | 8
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/extern_c/c99.html | 6
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/extern_c/tr1.html | 518 +++-----
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/extern_c/tr1_ref.html | 8
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview.html | 42
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/building.html | 33
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/compilers_overview.html | 1073 +++++++++---------
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/contact.html | 8
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/directories.html | 6
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/error_handling.html | 49
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/history1.html | 484 +++----
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/intro.html | 8
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/namespaces.html | 2
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/navigation.html | 4
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/perf_over.html | 72
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/pol_overview.html | 142 +-
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/result_type.html | 4
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/threads.html | 2
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/tr1.html | 526 ++++-----
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/perf.html | 18
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/perf/comp_compilers.html | 2
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/perf/comparisons.html | 58
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/perf/getting_best.html | 2
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/perf/interp.html | 13
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/perf/perf_over.html | 70
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/perf/perf_test_app.html | 2
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/perf/tuning.html | 4
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy.html | 68
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_overview.html | 142 +-
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref.html | 24
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/assert_undefined.html | 7
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/discrete_quant_ref.html | 38
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/error_handling_policies.html | 40
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/internal_promotion.html | 25
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/iteration_pol.html | 2
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/namespace_pol.html | 18
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/pol_ref_ref.html | 2
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/policy_defaults.html | 34
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/precision_pol.html | 25
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial.html | 38
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/ad_hoc_dist_policies.html | 14
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/ad_hoc_sf_policies.html | 16
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/changing_policy_defaults.html | 164 -
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/namespace_policies.html | 296 +---
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/policy_tut_defaults.html | 12
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/policy_usage.html | 4
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/understand_dis_quant.html | 68
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/user_def_err_pol.html | 414 ++----
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/what_is_a_policy.html | 6
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special.html | 133 +-
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel.html | 20
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel/bessel.html | 59
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel/bessel_over.html | 22
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel/mbessel.html | 43
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel/sph_bessel.html | 31
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint.html | 12
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_1.html | 34
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_2.html | 34
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_3.html | 40
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_carlson.html | 56
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_intro.html | 14
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/expint.html | 10
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/expint/expint_i.html | 29
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/expint/expint_n.html | 25
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials.html | 18
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_binomial.html | 19
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_double_factorial.html | 21
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_factorial.html | 23
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_falling_factorial.html | 21
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_rising_factorial.html | 21
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper.html | 10
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper/acosh.html | 19
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper/asinh.html | 19
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper/atanh.html | 23
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper/inv_hyper_over.html | 2
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers.html | 16
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/cbrt.html | 17
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/ct_pow.html | 27
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/expm1.html | 17
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/hypot.html | 17
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/log1p.html | 17
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/powm1.html | 17
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/sqrt1pm1.html | 17
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta.html | 10
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta/beta_derivative.html | 21
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta/beta_function.html | 23
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta/ibeta_function.html | 57
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta/ibeta_inv_function.html | 89 -
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_erf.html | 7
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_erf/error_function.html | 24
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_erf/error_inv.html | 23
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma.html | 16
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/digamma.html | 23
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/gamma_derivatives.html | 21
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/gamma_ratios.html | 32
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/igamma.html | 25
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/igamma_inv.html | 23
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/lgamma.html | 27
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/tgamma.html | 36
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly.html | 10
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly/hermite.html | 23
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly/laguerre.html | 23
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly/legendre.html | 23
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly/sph_harm.html | 33
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sinc.html | 4
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sinc/sinc_overview.html | 2
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sinc/sinc_pi.html | 11
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sinc/sinhc_pi.html | 11
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/zetas.html | 4
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/zetas/zeta.html | 23
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/status.html | 10
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/status/compilers.html | 1073 +++++++++---------
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/status/credits.html | 11
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/status/history1.html | 482 +++----
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/status/issues.html | 50
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit.html | 34
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1.html | 20
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/cf.html | 10
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/constants.html | 6
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/minima.html | 8
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/rational.html | 8
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/roots.html | 26
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/roots2.html | 41
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/series_evaluation.html | 10
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/tuples.html | 6
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2.html | 10
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2/error_test.html | 8
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2/minimax.html | 6
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2/polynomials.html | 6
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2/test_data.html | 16
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals_overview.html | 2
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt.html | 12
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/archetypes.html | 2
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/concepts.html | 6
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/dist_concept.html | 2
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/use_mpfr.html | 2
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/use_ntl.html | 2
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/utils.html | 30
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/utils/fpclass.html | 10
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float.html | 14
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/float_advance.html | 6
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/float_distance.html | 6
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/float_next.html | 8
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/float_prior.html | 6
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/nextafter.html | 8
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/utils/rounding.html | 8
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/utils/rounding/modf.html | 2
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/utils/rounding/round.html | 2
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/utils/rounding/trunc.html | 2
   trunk/libs/math/doc/sf_and_dist/html/math_toolkit/utils/sign_functions.html | 6
   trunk/libs/math/doc/sf_and_dist/html4_symbols.qbk | 26
   trunk/libs/math/doc/sf_and_dist/implementation.qbk | 19
   trunk/libs/math/doc/sf_and_dist/issues.qbk | 1
   trunk/libs/math/doc/sf_and_dist/latin1_symbols.qbk | 10
   trunk/libs/math/doc/sf_and_dist/license.qbk | 2
   trunk/libs/math/doc/sf_and_dist/math.qbk | 57
   trunk/libs/math/doc/sf_and_dist/minimax.qbk | 4
   trunk/libs/math/doc/sf_and_dist/performance.qbk | 3
   trunk/libs/math/doc/sf_and_dist/policy.qbk | 18
   trunk/libs/math/doc/sf_and_dist/policy_tutorial.qbk | 29
   trunk/libs/math/doc/sf_and_dist/references.qbk | 17
   trunk/libs/math/doc/sf_and_dist/roadmap.qbk | 7
   260 files changed, 7648 insertions(+), 9627 deletions(-)

Modified: trunk/libs/math/doc/html/index.html
==============================================================================
--- trunk/libs/math/doc/html/index.html (original)
+++ trunk/libs/math/doc/html/index.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 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: trunk/libs/math/doc/sf_and_dist/background.qbk
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/background.qbk (original)
+++ trunk/libs/math/doc/sf_and_dist/background.qbk 2010-09-29 05:23:59 EDT (Wed, 29 Sep 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: trunk/libs/math/doc/sf_and_dist/building.qbk
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/building.qbk (original)
+++ trunk/libs/math/doc/sf_and_dist/building.qbk 2010-09-29 05:23:59 EDT (Wed, 29 Sep 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: trunk/libs/math/doc/sf_and_dist/common_overviews.qbk
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/common_overviews.qbk (original)
+++ trunk/libs/math/doc/sf_and_dist/common_overviews.qbk 2010-09-29 05:23:59 EDT (Wed, 29 Sep 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: trunk/libs/math/doc/sf_and_dist/credits.qbk
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/credits.qbk (original)
+++ trunk/libs/math/doc/sf_and_dist/credits.qbk 2010-09-29 05:23:59 EDT (Wed, 29 Sep 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: trunk/libs/math/doc/sf_and_dist/dist_reference.qbk
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/dist_reference.qbk (original)
+++ trunk/libs/math/doc/sf_and_dist/dist_reference.qbk 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -13,6 +13,7 @@
[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]

Modified: trunk/libs/math/doc/sf_and_dist/dist_tutorial.qbk
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/dist_tutorial.qbk (original)
+++ trunk/libs/math/doc/sf_and_dist/dist_tutorial.qbk 2010-09-29 05:23:59 EDT (Wed, 29 Sep 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,16 +19,22 @@

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

-[note Some math function names are also used in namespace std so including <random> could cause ambiguity.]

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]
@@ -143,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"].
@@ -184,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.

Modified: trunk/libs/math/doc/sf_and_dist/distributions/binomial.qbk
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/distributions/binomial.qbk (original)
+++ trunk/libs/math/doc/sf_and_dist/distributions/binomial.qbk 2010-09-29 05:23:59 EDT (Wed, 29 Sep 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]

Added: trunk/libs/math/doc/sf_and_dist/distributions/inverse_chi_squared.qbk
==============================================================================
--- (empty file)
+++ trunk/libs/math/doc/sf_and_dist/distributions/inverse_chi_squared.qbk 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -0,0 +1,167 @@
+[section:inverse_chi_squared_dist Inverse Chi Squared Distribution]
+
+``#include <boost/math/distributions/inverse_chi_squared.hpp>``
+
+ namespace boost{ namespace math{
+
+ template <class RealType = double,
+ class ``__Policy`` = ``__policy_class`` >
+ class inverse_chi_squared_distribution
+ {
+ public:
+ typedef RealType value_type;
+ typedef Policy policy_type;
+
+ inverse_chi_squared_distribution(RealType df = 1); // Not explicitly scaled, default 1/df.
+ inverse_chi_squared_distribution(RealType df, RealType scale = 1/df); // Scaled.
+
+ RealType degrees_of_freedom()const; // Default 1.
+ RealType scale()const; // Optional scale [xi] (variance), default 1/degrees_of_freedom.
+ };
+
+ }} // namespace boost // namespace math
+
+The inverse chi squared distribution is a continuous probability distribution
+of the *reciprocal* of a variable distributed according to the chi squared distribution.
+
+The sources below give confusingly different formulae
+using different symbols for the distribution pdf,
+but they are all the same, or related by a change of variable, or choice of scale.
+
+Two constructors are available to implement both the scaled and (implicitly) unscaled versions.
+
+The main version has an explicit scale parameter which implements the
+[@http://en.wikipedia.org/wiki/Scaled-inverse-chi-square_distribution scaled inverse chi_squared distribution].
+
+A second version has an implicit scale = 1/degrees of freedom and gives the 1st definition in the
+[@http://en.wikipedia.org/wiki/Inverse-chi-square_distribution Wikipedia inverse chi_squared distribution].
+The 2nd Wikipedia inverse chi_squared distribution definition can be implemented
+by explicitly specifying a scale = 1.
+
+Both definitions are also available in Wolfram Mathematica and in __R (geoR) with default scale = 1/degrees of freedom.
+
+See
+
+* Inverse chi_squared distribution [@http://en.wikipedia.org/wiki/Inverse-chi-square_distribution]
+* Scaled inverse chi_squared distribution[@http://en.wikipedia.org/wiki/Scaled-inverse-chi-square_distribution]
+* R inverse chi_squared distribution functions [@http://hosho.ees.hokudai.ac.jp/~kubo/Rdoc/library/geoR/html/InvChisquare.html R ]
+* Inverse chi_squared distribution functions [@http://mathworld.wolfram.com/InverseChi-SquaredDistribution.html Weisstein, Eric W. "Inverse Chi-Squared Distribution." From MathWorld--A Wolfram Web Resource.]
+* Inverse chi_squared distribution reference [@http://reference.wolfram.com/mathematica/ref/InverseChiSquareDistribution.html Weisstein, Eric W. "Inverse Chi-Squared Distribution reference." From Wolfram Mathematica.]
+
+The inverse_chi_squared distribution is used in
+[@http://en.wikipedia.org/wiki/Bayesian_statistics Bayesian statistics]:
+the scaled inverse chi-square is conjugate prior for the normal distribution
+with known mean, model parameter [sigma][pow2] (variance).
+
+See [@http://en.wikipedia.org/wiki/Conjugate_prior conjugate priors including a table of distributions and their priors.]
+
+See also __inverse_gamma_distrib and __chi_squared_distrib.
+
+The inverse_chi_squared distribution is a psecial case of a inverse_gamma distribution
+with nu (degrees_of_freedom) shape ([alpha]) and scale ([beta]) where
+
+__spaces [alpha]= [nu] /2 and [beta] = [frac12].
+
+[note This distribution *does* provide the typedef:
+
+``typedef inverse_chi_squared_distribution<double> inverse_chi_squared;``
+
+If you want a `double` precision inverse_chi_squared distribution you can use
+
+``boost::math::inverse_chi_squared_distribution<>``
+
+or you can write `inverse_chi_squared my_invchisqr(2, 3);`]
+
+For degrees of freedom parameter [nu] and scale parameter [xi],
+it is defined by the probability density function (PDF):
+
+__spaces f(x;[nu], [xi]) = 2 [super -[nu]/2] e[super(-1/2x] x [super(-1-[nu]/2)] / [Gamma]([nu]/2)
+
+and Cumulative Density Function (CDF)
+
+__spaces F(x;[nu], [xi]) = [Gamma]( [nu] /2, [nu][xi]/2x) / [Gamma]([nu] /2)
+
+The following graphs illustrate how the PDF and CDF of the inverse chi_squared distribution
+varies for a few values of parameters [nu] and [xi]:
+
+[graph inverse_chi_squared_pdf] [/.png or .svg]
+
+[graph inverse_chi_squared_cdf]
+
+[h4 Member Functions]
+
+ inverse_chi_squared_distribution(RealType df = 1); // Implicitly scaled 1/df.
+ inverse_chi_squared_distribution(RealType df = 1, RealType scale); // Explicitly scaled.
+
+Constructs an inverse chi_squared distribution with [nu] degrees of freedom ['df],
+and scale ['scale] with default value 1/df (1/[nu].
+
+Requires that the degrees of freedom [nu] parameter is greater than zero, otherwise calls
+__domain_error.
+
+ RealType degrees_of_freedom()const;
+
+Returns the degrees_of_freedom [nu] parameter of this distribution.
+
+ RealType scale()const;
+
+Returns the scale [xi] parameter of this distribution.
+
+[h4 Non-member Accessors]
+
+All the [link math_toolkit.dist.dist_ref.nmp usual non-member accessor functions] that are generic to all
+distributions are supported: __usual_accessors.
+
+The domain of the random variate is \[0,+[infin]\].
+[note Unlike some definitions, this implementation supports a random variate
+equal to zero as a special case, returning zero for both pdf and cdf.]
+
+[h4 Accuracy]
+
+The inverse gamma distribution is implemented in terms of the
+incomplete gamma functions like the __inverse_gamma_distrib that use
+__gamma_p and __gamma_q and their inverses __gamma_p_inv and __gamma_q_inv:
+refer to the accuracy data for those functions for more information.
+But in general, gamma (and thus inverse gamma) results are often accurate to a few epsilon,
+>14 decimal digits accuracy for 64-bit double.
+unless iteration is involved, as for the estimation of degrees of freedom.
+
+[h4 Implementation]
+
+In the following table [nu] is the degrees of freedom parameter and
+[xi] is the scale parameter of the distribution,
+/x/ is the random variate, /p/ is the probability and /q = 1-p/ its complement.
+Parameters [alpha] for shape and [beta] for scale
+are used for the inverse gamma function: [alpha] = [nu]/2 and [beta] = [nu] * [xi]/2.
+
+[table
+[[Function][Implementation Notes]]
+[[pdf][Using the relation: pdf = __gamma_p_derivative([alpha], [beta]/ x, [beta]) / x * x ]]
+[[cdf][Using the relation: p = __gamma_q([alpha], [beta] / x) ]]
+[[cdf complement][Using the relation: q = __gamma_p([alpha], [beta] / x) ]]
+[[quantile][Using the relation: x = [beta][space]/ __gamma_q_inv([alpha], p) ]]
+[[quantile from the complement][Using the relation: x = [alpha][space]/ __gamma_p_inv([alpha], q) ]]
+[[mode][[nu] * [xi] / ([nu] + 2) ]]
+[[median][no closed form analytic equation is known, but is evaluated as quantile(0.5)]]
+[[mean][1 / ([nu] - 1) for [nu] > 2, else a __domain_error]]
+[[variance][2 [nu][pow2] [xi][pow2] / (([nu] -2)[pow2] ([nu] -4)) for [nu] >4, else a __domain_error]]
+[[skewness][4 [sqrt]2 [sqrt]([nu]-4) /([nu]-6) for [nu] >6, else a __domain_error ]]
+[[kurtosis_excess][12 * (5[nu] - 22) / ([nu] - 6) * ([nu] - 8) for [nu] >8, else a __domain_error]]
+[[kurtosis][3 + 12 * (5[nu] - 22) / ([nu] - 6) * ([nu]-8) for [nu] >8, else a __domain_error]]
+] [/table]
+
+[h4 References]
+
+# Bayesian Data Analysis, Andrew Gelman, John B. Carlin, Hal S. Stern, Donald B. Rubin,
+ISBN-13: 978-1584883883, Chapman & Hall; 2 edition (29 July 2003).
+
+# Bayesian Computation with R, Jim Albert, ISBN-13: 978-0387922973, Springer; 2nd ed. edition (10 Jun 2009)
+
+[endsect] [/section:inverse_chi_squared_dist Inverse chi_squared Distribution]
+
+[/
+ Copyright 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).
+]
\ No newline at end of file

Modified: trunk/libs/math/doc/sf_and_dist/distributions/inverse_gamma.qbk
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/distributions/inverse_gamma.qbk (original)
+++ trunk/libs/math/doc/sf_and_dist/distributions/inverse_gamma.qbk 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -20,65 +20,73 @@

 }} // namespaces

-The inverse_gamma distribution is a continuous probability distribution distribution
-of the reciprocal of a variable distributed according to the gamma distribution..
+The inverse_gamma distribution is a continuous probability distribution
+of the reciprocal of a variable distributed according to the gamma distribution.
+
+The inverse_gamma distribution is used in Bayesian statistics.
+
+See [@http://en.wikipedia.org/wiki/Inverse-gamma_distribution inverse gamma distribution].
+
+[@http://rss.acs.unt.edu/Rdoc/library/pscl/html/igamma.html R inverse gamma distribution functions].
+
+[@http://reference.wolfram.com/mathematica/ref/InverseGammaDistribution.html Wolfram inverse gamma distribution].
+
+See also __gamma_distrib.

[note
In spite of potential confusion with the inverse gamma function, this
-distribution does provide the typedef:
+distribution *does* provide the typedef:

-``typedef inverse_gamma_distibution<double> gamma;``
+``typedef inverse_gamma_distribution<double> gamma;``

-If you want a double precision gamma distribution you can use
+If you want a `double` precision gamma distribution you can use

-``boost::math::inverse_gamma_distribution<>``]
+``boost::math::inverse_gamma_distribution<>``

-For shape parameter /k/ and scale parameter [theta][space] it is defined by the
-probability density function:
+or you can write `inverse_gamma my_ig(2, 3);`]

-[equation inverse_gamma_dist_ref1]
+For shape parameter [alpha] and scale parameter [beta], it is defined
+by the probability density function (PDF):

-Sometimes an alternative formulation is used: given parameters
-[alpha][space]= k and [beta][space]= 1 / [theta], then the
-distribution can be defined by the PDF:
+__spaces f(x;[alpha], [beta]) = [beta][super [alpha]] * (1/x) [super [alpha]+1] exp(-[beta]/x) / [Gamma]([alpha])

-[equation inverse_gamma_dist_ref2]
+and cumulative density function (CDF)

+__spaces F(x;[alpha], [beta]) = [Gamma]([alpha], [beta]/x) / [Gamma]([alpha])

-The following two graphs illustrate how the PDF of the gamma distribution
+The following graphs illustrate how the PDF and CDF of the inverse gamma distribution
varies as the parameters vary:

-[graph inverse_gamma1_pdf]
-
-[graph inverse_gamma2_pdf]
-
+[graph inverse_gamma_pdf] [/png or svg]

+[graph inverse_gamma_cdf]

[h4 Member Functions]

- inverse_gamma_distribution(RealType shape, RealType scale = 1);
+ inverse_gamma_distribution(RealType shape = 1, RealType scale = 1);

-Constructs a gamma distribution with shape /shape/ and
-scale /scale/.
+Constructs an inverse gamma distribution with shape [alpha] and scale [beta].

Requires that the shape and scale parameters are greater than zero, otherwise calls
__domain_error.

 RealType shape()const;

-Returns the /shape/ parameter of this distribution.
+Returns the [alpha] shape parameter of this inverse gamma distribution.

 RealType scale()const;

-Returns the /scale/ parameter of this distribution.
+Returns the [beta] scale parameter of this inverse gamma distribution.

[h4 Non-member Accessors]

All the [link math_toolkit.dist.dist_ref.nmp usual non-member accessor functions] that are generic to all
distributions are supported: __usual_accessors.

-The domain of the random variable is \[0,+[infin]\].
+The domain of the random variate is \[0,+[infin]\].
+[note Unlike some definitions, this implementation supports a random variate
+equal to zero as a special case, returning zero for pdf and cdf.]

[h4 Accuracy]

@@ -86,24 +94,28 @@
incomplete gamma functions __gamma_p and __gamma_q and their
inverses __gamma_p_inv and __gamma_q_inv: refer to the accuracy
data for those functions for more information.
-But in general results are accurate to a few epsilon, >14 decimnal digits accuracy for 64-but double..
+But in general, inverse_gamma results are accurate to a few epsilon,
+>14 decimal digits accuracy for 64-bit double.

[h4 Implementation]

-In the following table /k/ is the shape parameter of the distribution,
-[theta][space] is its scale parameter, /x/ is the random variate, /p/ is the probability
+In the following table [alpha] is the shape parameter of the distribution,
+[alpha][space] is its scale parameter, /x/ is the random variate, /p/ is the probability
and /q = 1-p/.

[table
[[Function][Implementation Notes]]
-[[pdf][Using the relation: pdf = __gamma_p_derivative(k, x / [theta]) / [theta] ]]
-[[cdf][Using the relation: p = __gamma_p(k, x / [theta]) ]]
-[[cdf complement][Using the relation: q = __gamma_q(k, x / [theta]) ]]
-[[quantile][Using the relation: x = [theta][space]* __gamma_p_inv(k, p) ]]
-[[quantile from the complement][Using the relation: x = [theta][space]* __gamma_q_inv(k, p) ]]
-[[mean][k[theta] ]]
-[[variance][k[theta][super 2] ]]
-[[mode][otherwise a __domain_error ]]
+[[pdf][Using the relation: pdf = __gamma_p_derivative([alpha], [beta]/ x, [beta]) / x * x ]]
+[[cdf][Using the relation: p = __gamma_q([alpha], [beta] / x) ]]
+[[cdf complement][Using the relation: q = __gamma_p([alpha], [beta] / x) ]]
+[[quantile][Using the relation: x = [beta][space]/ __gamma_q_inv([alpha], p) ]]
+[[quantile from the complement][Using the relation: x = [alpha][space]/ __gamma_p_inv([alpha], q) ]]
+[[mode][[beta] / ([alpha] + 1) ]]
+[[median][no analytic equation is known, but is evaluated as quantile(0.5)]]
+[[mean][[beta] / ([alpha] - 1) for [alpha] > 1, else a __domain_error]]
+[[variance][([beta] * [beta]) / ([alpha] - 1) * ([alpha] - 1) * ([alpha] - 2) for [alpha] >2, else a __domain_error]]
+[[skewness][4 * sqrt ([alpha] -2) / ([alpha] -3) for [alpha] >3, else a __domain_error]]
+[[kurtosis_excess][(30 * [alpha] - 66) / ([alpha]-3)*([alpha] - 4)) for [alpha] >4, else a __domain_error]]
] [/table]

[endsect][/section:inverse_gamma_dist Inverse Gamma Distribution]

Modified: trunk/libs/math/doc/sf_and_dist/distributions/inverse_gamma_example.qbk
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/distributions/inverse_gamma_example.qbk (original)
+++ trunk/libs/math/doc/sf_and_dist/distributions/inverse_gamma_example.qbk 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -1,9 +1,9 @@

[section:inverse_gamma_eg Inverse Gamma Distribution Bayes Example]

+TODO

-
-[endsect][/section:inverse_gamma_eg Inverse Gamma Distribution Bayes Example]
+[endsect] [/section:inverse_gamma_eg Inverse Gamma Distribution Bayes Example]

[/

Modified: trunk/libs/math/doc/sf_and_dist/distributions/non_members.qbk
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/distributions/non_members.qbk (original)
+++ trunk/libs/math/doc/sf_and_dist/distributions/non_members.qbk 2010-09-29 05:23:59 EDT (Wed, 29 Sep 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: trunk/libs/math/doc/sf_and_dist/error_handling.qbk
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/error_handling.qbk (original)
+++ trunk/libs/math/doc/sf_and_dist/error_handling.qbk 2010-09-29 05:23:59 EDT (Wed, 29 Sep 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: trunk/libs/math/doc/sf_and_dist/fpclassify.qbk
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/fpclassify.qbk (original)
+++ trunk/libs/math/doc/sf_and_dist/fpclassify.qbk 2010-09-29 05:23:59 EDT (Wed, 29 Sep 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: trunk/libs/math/doc/sf_and_dist/html/index.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/index.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/index.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -53,7 +53,7 @@
 Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani and
 Thijs van den Berg</div>
<div><div class="legalnotice">
-<a name="id1008327"></a>
+<a name="id885850"></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)
 
@@ -64,435 +64,435 @@
<div class="toc">
Table of Contents
<dl>
-<dt> Overview</dt>
+<dt>Overview</dt>
<dd><dl>
-<dt> About the Math Toolkit</dt>
-<dt> Navigation</dt>
-<dt><a href="math_toolkit/main_overview/directories.html"> Directory and
+<dt>About the Math Toolkit</dt>
+<dt>Navigation</dt>
+<dt><a href="math_toolkit/main_overview/directories.html">Directory and
 File Structure</a></dt>
-<dt> Namespaces</dt>
-<dt><a href="math_toolkit/main_overview/result_type.html"> Calculation
- of the Type of the Result</a></dt>
-<dt> Error Handling</dt>
-<dt> Compilers</dt>
-<dt><a href="math_toolkit/main_overview/pol_overview.html"> Configuration
+<dt>Namespaces</dt>
+<dt><a href="math_toolkit/main_overview/result_type.html">Calculation of
+ the Type of the Result</a></dt>
+<dt>Error Handling</dt>
+<dt>Compilers</dt>
+<dt><a href="math_toolkit/main_overview/pol_overview.html">Configuration
 and Policies</a></dt>
-<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>
-<dt><a href="math_toolkit/main_overview/history1.html"> History and What's
+<dt>Thread Safety</dt>
+<dt>Performance</dt>
+<dt><a href="math_toolkit/main_overview/building.html">If and How to Build
+ 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
+<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/contact.html"> Contact Info and
+<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>
-<dt> Statistical Distributions and Functions</dt>
+<dt>Statistical Distributions and Functions</dt>
<dd><dl>
-<dt><a href="math_toolkit/dist/stat_tut.html"> Statistical Distributions
+<dt><a href="math_toolkit/dist/stat_tut.html">Statistical Distributions
 Tutorial</a></dt>
<dd><dl>
-<dt> Overview of Distributions</dt>
+<dt>Overview of Distributions</dt>
<dd><dl>
-<dt><a href="math_toolkit/dist/stat_tut/overview/headers.html"> Headers
+<dt><a href="math_toolkit/dist/stat_tut/overview/headers.html">Headers
 and Namespaces</a></dt>
-<dt><a href="math_toolkit/dist/stat_tut/overview/objects.html"> Distributions
+<dt><a href="math_toolkit/dist/stat_tut/overview/objects.html">Distributions
 are Objects</a></dt>
-<dt><a href="math_toolkit/dist/stat_tut/overview/generic.html"> Generic
+<dt><a href="math_toolkit/dist/stat_tut/overview/generic.html">Generic
 operations common to all distributions are non-member functions</a></dt>
-<dt><a href="math_toolkit/dist/stat_tut/overview/complements.html">
- Complements are supported too - and when to use them</a></dt>
-<dt><a href="math_toolkit/dist/stat_tut/overview/parameters.html">
- Parameters can be calculated</a></dt>
-<dt> Summary</dt>
-</dl></dd>
-<dt> Worked Examples</dt>
-<dd><dl>
-<dt><a href="math_toolkit/dist/stat_tut/weg/dist_construct_eg.html">
- Distribution Construction Example</a></dt>
-<dt><a href="math_toolkit/dist/stat_tut/weg/st_eg.html"> Student's
- t Distribution Examples</a></dt>
-<dt><a href="math_toolkit/dist/stat_tut/weg/cs_eg.html"> Chi Squared
+<dt><a href="math_toolkit/dist/stat_tut/overview/complements.html">Complements
+ are supported too - and when to use them</a></dt>
+<dt><a href="math_toolkit/dist/stat_tut/overview/parameters.html">Parameters
+ can be calculated</a></dt>
+<dt>Summary</dt>
+</dl></dd>
+<dt>Worked Examples</dt>
+<dd><dl>
+<dt><a href="math_toolkit/dist/stat_tut/weg/dist_construct_eg.html">Distribution
+ Construction Example</a></dt>
+<dt><a href="math_toolkit/dist/stat_tut/weg/st_eg.html">Student's t
 Distribution Examples</a></dt>
-<dt><a href="math_toolkit/dist/stat_tut/weg/f_eg.html"> F Distribution
+<dt><a href="math_toolkit/dist/stat_tut/weg/cs_eg.html">Chi Squared
+ Distribution Examples</a></dt>
+<dt><a href="math_toolkit/dist/stat_tut/weg/f_eg.html">F Distribution
 Examples</a></dt>
-<dt><a href="math_toolkit/dist/stat_tut/weg/binom_eg.html"> Binomial
+<dt><a href="math_toolkit/dist/stat_tut/weg/binom_eg.html">Binomial
 Distribution Examples</a></dt>
-<dt><a href="math_toolkit/dist/stat_tut/weg/neg_binom_eg.html"> Negative
+<dt><a href="math_toolkit/dist/stat_tut/weg/neg_binom_eg.html">Negative
 Binomial Distribution Examples</a></dt>
-<dt><a href="math_toolkit/dist/stat_tut/weg/normal_example.html"> Normal
+<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
+<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
+<dt><a href="math_toolkit/dist/stat_tut/weg/error_eg.html">Error Handling
 Example</a></dt>
-<dt><a href="math_toolkit/dist/stat_tut/weg/find_eg.html"> Find Location
+<dt><a href="math_toolkit/dist/stat_tut/weg/find_eg.html">Find Location
 and Scale Examples</a></dt>
-<dt><a href="math_toolkit/dist/stat_tut/weg/nag_library.html"> Comparison
+<dt><a href="math_toolkit/dist/stat_tut/weg/nag_library.html">Comparison
 with C, R, FORTRAN-style Free Functions</a></dt>
-<dt><a href="math_toolkit/dist/stat_tut/weg/c_sharp.html"> Using the
+<dt><a href="math_toolkit/dist/stat_tut/weg/c_sharp.html">Using the
 Distributions from Within C#</a></dt>
</dl></dd>
-<dt><a href="math_toolkit/dist/stat_tut/variates.html"> Random Variates
+<dt><a href="math_toolkit/dist/stat_tut/variates.html">Random Variates
 and Distribution Parameters</a></dt>
-<dt><a href="math_toolkit/dist/stat_tut/dist_params.html"> Discrete Probability
+<dt><a href="math_toolkit/dist/stat_tut/dist_params.html">Discrete Probability
 Distributions</a></dt>
</dl></dd>
-<dt><a href="math_toolkit/dist/dist_ref.html"> Statistical Distributions
+<dt><a href="math_toolkit/dist/dist_ref.html">Statistical Distributions
 Reference</a></dt>
<dd><dl>
-<dt> Non-Member Properties</dt>
-<dt> Distributions</dt>
+<dt>Non-Member Properties</dt>
+<dt>Distributions</dt>
<dd><dl>
-<dt><a href="math_toolkit/dist/dist_ref/dists/bernoulli_dist.html">
- Bernoulli Distribution</a></dt>
-<dt><a href="math_toolkit/dist/dist_ref/dists/beta_dist.html"> Beta
+<dt><a href="math_toolkit/dist/dist_ref/dists/bernoulli_dist.html">Bernoulli
 Distribution</a></dt>
-<dt><a href="math_toolkit/dist/dist_ref/dists/binomial_dist.html">
- Binomial Distribution</a></dt>
-<dt><a href="math_toolkit/dist/dist_ref/dists/cauchy_dist.html"> Cauchy-Lorentz
+<dt><a href="math_toolkit/dist/dist_ref/dists/beta_dist.html">Beta
 Distribution</a></dt>
-<dt><a href="math_toolkit/dist/dist_ref/dists/chi_squared_dist.html">
- Chi Squared Distribution</a></dt>
-<dt><a href="math_toolkit/dist/dist_ref/dists/exp_dist.html"> Exponential
+<dt><a href="math_toolkit/dist/dist_ref/dists/binomial_dist.html">Binomial
+ Distribution</a></dt>
+<dt><a href="math_toolkit/dist/dist_ref/dists/cauchy_dist.html">Cauchy-Lorentz
 Distribution</a></dt>
-<dt><a href="math_toolkit/dist/dist_ref/dists/extreme_dist.html"> Extreme
+<dt><a href="math_toolkit/dist/dist_ref/dists/chi_squared_dist.html">Chi
+ Squared Distribution</a></dt>
+<dt><a href="math_toolkit/dist/dist_ref/dists/exp_dist.html">Exponential
+ Distribution</a></dt>
+<dt><a href="math_toolkit/dist/dist_ref/dists/extreme_dist.html">Extreme
 Value Distribution</a></dt>
-<dt> F Distribution</dt>
-<dt><a href="math_toolkit/dist/dist_ref/dists/gamma_dist.html"> Gamma
+<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_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
- Distribution</a></dt>
-<dt><a href="math_toolkit/dist/dist_ref/dists/logistic_dist.html">
- Logistic Distribution</a></dt>
-<dt><a href="math_toolkit/dist/dist_ref/dists/lognormal_dist.html">
- Log Normal Distribution</a></dt>
-<dt><a href="math_toolkit/dist/dist_ref/dists/negative_binomial_dist.html">
- Negative Binomial Distribution</a></dt>
-<dt><a href="math_toolkit/dist/dist_ref/dists/nc_beta_dist.html"> Noncentral
+<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
+ Distribution</a></dt>
+<dt><a href="math_toolkit/dist/dist_ref/dists/logistic_dist.html">Logistic
+ Distribution</a></dt>
+<dt><a href="math_toolkit/dist/dist_ref/dists/lognormal_dist.html">Log
+ Normal Distribution</a></dt>
+<dt><a href="math_toolkit/dist/dist_ref/dists/negative_binomial_dist.html">Negative
+ Binomial Distribution</a></dt>
+<dt><a href="math_toolkit/dist/dist_ref/dists/nc_beta_dist.html">Noncentral
 Beta Distribution</a></dt>
-<dt><a href="math_toolkit/dist/dist_ref/dists/nc_chi_squared_dist.html">
- Noncentral Chi-Squared Distribution</a></dt>
-<dt><a href="math_toolkit/dist/dist_ref/dists/nc_f_dist.html"> Noncentral
+<dt><a href="math_toolkit/dist/dist_ref/dists/nc_chi_squared_dist.html">Noncentral
+ Chi-Squared Distribution</a></dt>
+<dt><a href="math_toolkit/dist/dist_ref/dists/nc_f_dist.html">Noncentral
 F Distribution</a></dt>
-<dt><a href="math_toolkit/dist/dist_ref/dists/nc_t_dist.html"> Noncentral
+<dt><a href="math_toolkit/dist/dist_ref/dists/nc_t_dist.html">Noncentral
 T Distribution</a></dt>
-<dt><a href="math_toolkit/dist/dist_ref/dists/normal_dist.html"> Normal
+<dt><a href="math_toolkit/dist/dist_ref/dists/normal_dist.html">Normal
 (Gaussian) Distribution</a></dt>
-<dt><a href="math_toolkit/dist/dist_ref/dists/pareto.html"> Pareto
+<dt>Pareto Distribution</dt>
+<dt><a href="math_toolkit/dist/dist_ref/dists/poisson_dist.html">Poisson
 Distribution</a></dt>
-<dt><a href="math_toolkit/dist/dist_ref/dists/poisson_dist.html"> Poisson
+<dt><a href="math_toolkit/dist/dist_ref/dists/rayleigh.html">Rayleigh
 Distribution</a></dt>
-<dt><a href="math_toolkit/dist/dist_ref/dists/rayleigh.html"> Rayleigh
+<dt><a href="math_toolkit/dist/dist_ref/dists/students_t_dist.html">Students
+ t Distribution</a></dt>
+<dt><a href="math_toolkit/dist/dist_ref/dists/triangular_dist.html">Triangular
 Distribution</a></dt>
-<dt><a href="math_toolkit/dist/dist_ref/dists/students_t_dist.html">
- Students t Distribution</a></dt>
-<dt><a href="math_toolkit/dist/dist_ref/dists/triangular_dist.html">
- Triangular Distribution</a></dt>
-<dt><a href="math_toolkit/dist/dist_ref/dists/weibull.html"> Weibull
+<dt><a href="math_toolkit/dist/dist_ref/dists/weibull.html">Weibull
 Distribution</a></dt>
-<dt><a href="math_toolkit/dist/dist_ref/dists/uniform_dist.html"> Uniform
+<dt><a href="math_toolkit/dist/dist_ref/dists/uniform_dist.html">Uniform
 Distribution</a></dt>
</dl></dd>
-<dt><a href="math_toolkit/dist/dist_ref/dist_algorithms.html"> Distribution
+<dt><a href="math_toolkit/dist/dist_ref/dist_algorithms.html">Distribution
 Algorithms</a></dt>
</dl></dd>
-<dt> Extras/Future Directions</dt>
+<dt>Extras/Future Directions</dt>
</dl></dd>
-<dt> Special Functions</dt>
+<dt>Special Functions</dt>
<dd><dl>
-<dt> Gamma Functions</dt>
+<dt>Gamma Functions</dt>
<dd><dl>
-<dt> Gamma</dt>
-<dt> Log Gamma</dt>
-<dt> Digamma</dt>
-<dt><a href="math_toolkit/special/sf_gamma/gamma_ratios.html"> Ratios
+<dt>Gamma</dt>
+<dt>Log Gamma</dt>
+<dt>Digamma</dt>
+<dt><a href="math_toolkit/special/sf_gamma/gamma_ratios.html">Ratios
 of Gamma Functions</a></dt>
-<dt><a href="math_toolkit/special/sf_gamma/igamma.html"> Incomplete Gamma
+<dt><a href="math_toolkit/special/sf_gamma/igamma.html">Incomplete Gamma
 Functions</a></dt>
-<dt><a href="math_toolkit/special/sf_gamma/igamma_inv.html"> Incomplete
+<dt><a href="math_toolkit/special/sf_gamma/igamma_inv.html">Incomplete
 Gamma Function Inverses</a></dt>
-<dt><a href="math_toolkit/special/sf_gamma/gamma_derivatives.html"> Derivative
+<dt><a href="math_toolkit/special/sf_gamma/gamma_derivatives.html">Derivative
 of the Incomplete Gamma Function</a></dt>
</dl></dd>
-<dt><a href="math_toolkit/special/factorials.html"> Factorials and Binomial
+<dt><a href="math_toolkit/special/factorials.html">Factorials and Binomial
 Coefficients</a></dt>
<dd><dl>
-<dt> Factorial</dt>
-<dt><a href="math_toolkit/special/factorials/sf_double_factorial.html">
- Double Factorial</a></dt>
-<dt><a href="math_toolkit/special/factorials/sf_rising_factorial.html">
- Rising Factorial</a></dt>
-<dt><a href="math_toolkit/special/factorials/sf_falling_factorial.html">
- Falling Factorial</a></dt>
-<dt><a href="math_toolkit/special/factorials/sf_binomial.html"> Binomial
+<dt>Factorial</dt>
+<dt><a href="math_toolkit/special/factorials/sf_double_factorial.html">Double
+ Factorial</a></dt>
+<dt><a href="math_toolkit/special/factorials/sf_rising_factorial.html">Rising
+ Factorial</a></dt>
+<dt><a href="math_toolkit/special/factorials/sf_falling_factorial.html">Falling
+ Factorial</a></dt>
+<dt><a href="math_toolkit/special/factorials/sf_binomial.html">Binomial
 Coefficients</a></dt>
</dl></dd>
-<dt> Beta Functions</dt>
+<dt>Beta Functions</dt>
<dd><dl>
-<dt> Beta</dt>
-<dt><a href="math_toolkit/special/sf_beta/ibeta_function.html"> Incomplete
+<dt>Beta</dt>
+<dt><a href="math_toolkit/special/sf_beta/ibeta_function.html">Incomplete
 Beta Functions</a></dt>
-<dt><a href="math_toolkit/special/sf_beta/ibeta_inv_function.html"> The
+<dt><a href="math_toolkit/special/sf_beta/ibeta_inv_function.html">The
 Incomplete Beta Function Inverses</a></dt>
-<dt><a href="math_toolkit/special/sf_beta/beta_derivative.html"> Derivative
+<dt><a href="math_toolkit/special/sf_beta/beta_derivative.html">Derivative
 of the Incomplete Beta Function</a></dt>
</dl></dd>
-<dt> Error Functions</dt>
+<dt>Error Functions</dt>
<dd><dl>
-<dt><a href="math_toolkit/special/sf_erf/error_function.html"> Error
- Functions</a></dt>
-<dt><a href="math_toolkit/special/sf_erf/error_inv.html"> Error Function
+<dt>Error Functions</dt>
+<dt><a href="math_toolkit/special/sf_erf/error_inv.html">Error Function
 Inverses</a></dt>
</dl></dd>
-<dt> Polynomials</dt>
+<dt>Polynomials</dt>
<dd><dl>
-<dt><a href="math_toolkit/special/sf_poly/legendre.html"> Legendre (and
+<dt><a href="math_toolkit/special/sf_poly/legendre.html">Legendre (and
 Associated) Polynomials</a></dt>
-<dt><a href="math_toolkit/special/sf_poly/laguerre.html"> Laguerre (and
+<dt><a href="math_toolkit/special/sf_poly/laguerre.html">Laguerre (and
 Associated) Polynomials</a></dt>
-<dt> Hermite Polynomials</dt>
-<dt> Spherical Harmonics</dt>
+<dt>Hermite Polynomials</dt>
+<dt>Spherical Harmonics</dt>
</dl></dd>
-<dt> Bessel Functions</dt>
+<dt>Bessel Functions</dt>
<dd><dl>
-<dt><a href="math_toolkit/special/bessel/bessel_over.html"> Bessel Function
+<dt><a href="math_toolkit/special/bessel/bessel_over.html">Bessel Function
 Overview</a></dt>
-<dt><a href="math_toolkit/special/bessel/bessel.html"> Bessel Functions
+<dt><a href="math_toolkit/special/bessel/bessel.html">Bessel Functions
 of the First and Second Kinds</a></dt>
-<dt><a href="math_toolkit/special/bessel/mbessel.html"> Modified Bessel
+<dt><a href="math_toolkit/special/bessel/mbessel.html">Modified Bessel
+ Functions of the First and Second Kinds</a></dt>
+<dt><a href="math_toolkit/special/bessel/sph_bessel.html">Spherical Bessel
 Functions of the First and Second Kinds</a></dt>
-<dt><a href="math_toolkit/special/bessel/sph_bessel.html"> Spherical
- Bessel Functions of the First and Second Kinds</a></dt>
</dl></dd>
-<dt> Elliptic Integrals</dt>
+<dt>Elliptic Integrals</dt>
<dd><dl>
-<dt><a href="math_toolkit/special/ellint/ellint_intro.html"> Elliptic
+<dt><a href="math_toolkit/special/ellint/ellint_intro.html">Elliptic
 Integral Overview</a></dt>
-<dt><a href="math_toolkit/special/ellint/ellint_carlson.html"> Elliptic
+<dt><a href="math_toolkit/special/ellint/ellint_carlson.html">Elliptic
 Integrals - Carlson Form</a></dt>
-<dt><a href="math_toolkit/special/ellint/ellint_1.html"> Elliptic Integrals
+<dt><a href="math_toolkit/special/ellint/ellint_1.html">Elliptic Integrals
 of the First Kind - Legendre Form</a></dt>
-<dt><a href="math_toolkit/special/ellint/ellint_2.html"> Elliptic Integrals
+<dt><a href="math_toolkit/special/ellint/ellint_2.html">Elliptic Integrals
 of the Second Kind - Legendre Form</a></dt>
-<dt><a href="math_toolkit/special/ellint/ellint_3.html"> Elliptic Integrals
+<dt><a href="math_toolkit/special/ellint/ellint_3.html">Elliptic Integrals
 of the Third Kind - Legendre Form</a></dt>
</dl></dd>
-<dt> Zeta Functions</dt>
-<dd><dl><dt> Riemann Zeta Function</dt></dl></dd>
-<dt> Exponential Integrals</dt>
-<dd><dl>
-<dt><a href="math_toolkit/special/expint/expint_n.html"> Exponential
- Integral En</a></dt>
-<dt><a href="math_toolkit/special/expint/expint_i.html"> Exponential
- Integral Ei</a></dt>
+<dt>Zeta Functions</dt>
+<dd><dl><dt>Riemann Zeta Function</dt></dl></dd>
+<dt>Exponential Integrals</dt>
+<dd><dl>
+<dt><a href="math_toolkit/special/expint/expint_n.html">Exponential Integral
+ En</a></dt>
+<dt><a href="math_toolkit/special/expint/expint_i.html">Exponential Integral
+ Ei</a></dt>
</dl></dd>
-<dt><a href="math_toolkit/special/powers.html"> Logs, Powers, Roots and
+<dt><a href="math_toolkit/special/powers.html">Logs, Powers, Roots and
 Exponentials</a></dt>
<dd><dl>
-<dt> log1p</dt>
-<dt> expm1</dt>
-<dt> cbrt</dt>
-<dt> sqrt1pm1</dt>
-<dt> powm1</dt>
-<dt> hypot</dt>
-<dt><a href="math_toolkit/special/powers/ct_pow.html"> Compile Time Power
+<dt>log1p</dt>
+<dt>expm1</dt>
+<dt>cbrt</dt>
+<dt>sqrt1pm1</dt>
+<dt>powm1</dt>
+<dt>hypot</dt>
+<dt><a href="math_toolkit/special/powers/ct_pow.html">Compile Time Power
 of a Runtime Base</a></dt>
</dl></dd>
-<dt><a href="math_toolkit/special/sinc.html"> Sinus Cardinal and Hyperbolic
+<dt><a href="math_toolkit/special/sinc.html">Sinus Cardinal and Hyperbolic
 Sinus Cardinal Functions</a></dt>
<dd><dl>
-<dt><a href="math_toolkit/special/sinc/sinc_overview.html"> Sinus Cardinal
+<dt><a href="math_toolkit/special/sinc/sinc_overview.html">Sinus Cardinal
 and Hyperbolic Sinus Cardinal Functions Overview</a></dt>
<dt>sinc_pi</dt>
<dt>sinhc_pi</dt>
</dl></dd>
-<dt> Inverse Hyperbolic Functions</dt>
+<dt>Inverse Hyperbolic Functions</dt>
<dd><dl>
-<dt><a href="math_toolkit/special/inv_hyper/inv_hyper_over.html"> Inverse
+<dt><a href="math_toolkit/special/inv_hyper/inv_hyper_over.html">Inverse
 Hyperbolic Functions Overview</a></dt>
-<dt> acosh</dt>
-<dt> asinh</dt>
-<dt> atanh</dt>
+<dt>acosh</dt>
+<dt>asinh</dt>
+<dt>atanh</dt>
</dl></dd>
</dl></dd>
-<dt> Floating Point Utilities</dt>
+<dt>Floating Point Utilities</dt>
<dd><dl>
-<dt><a href="math_toolkit/utils/rounding.html"> Rounding Truncation and
+<dt><a href="math_toolkit/utils/rounding.html">Rounding Truncation and
 Integer Conversion</a></dt>
<dd><dl>
-<dt> Rounding Functions</dt>
-<dt> Truncation Functions</dt>
-<dt><a href="math_toolkit/utils/rounding/modf.html"> Integer and Fractional
+<dt>Rounding Functions</dt>
+<dt>Truncation Functions</dt>
+<dt><a href="math_toolkit/utils/rounding/modf.html">Integer and Fractional
 Part Splitting (modf)</a></dt>
</dl></dd>
-<dt><a href="math_toolkit/utils/fpclass.html"> Floating-Point Classification:
+<dt><a href="math_toolkit/utils/fpclass.html">Floating-Point Classification:
 Infinities and NaN's</a></dt>
-<dt><a href="math_toolkit/utils/sign_functions.html"> Sign Manipulation
+<dt><a href="math_toolkit/utils/sign_functions.html">Sign Manipulation
 Functions</a></dt>
-<dt><a href="math_toolkit/utils/next_float.html"> Floating-Point Representation
+<dt><a href="math_toolkit/utils/next_float.html">Floating-Point Representation
 Distance (ULP), and Finding Adjacent Floating-Point Values</a></dt>
<dd><dl>
-<dt><a href="math_toolkit/utils/next_float/nextafter.html"> Finding the
+<dt><a href="math_toolkit/utils/next_float/nextafter.html">Finding the
 Next Representable Value in a Specific Direction (nextafter)</a></dt>
-<dt><a href="math_toolkit/utils/next_float/float_next.html"> Finding
- the Next Greater Representable Value (float_next)</a></dt>
-<dt><a href="math_toolkit/utils/next_float/float_prior.html"> Finding
+<dt><a href="math_toolkit/utils/next_float/float_next.html">Finding the
+ Next Greater Representable Value (float_next)</a></dt>
+<dt><a href="math_toolkit/utils/next_float/float_prior.html">Finding
 the Next Smaller Representable Value (float_prior)</a></dt>
-<dt><a href="math_toolkit/utils/next_float/float_distance.html"> Calculating
+<dt><a href="math_toolkit/utils/next_float/float_distance.html">Calculating
 the Representation Distance Between Two Floating Point Values (ULP) float_distance</a></dt>
-<dt><a href="math_toolkit/utils/next_float/float_advance.html"> Advancing
+<dt><a href="math_toolkit/utils/next_float/float_advance.html">Advancing
 a Floating Point Value by a Specific Representation Distance (ULP) float_advance</a></dt>
</dl></dd>
</dl></dd>
-<dt><a href="math_toolkit/extern_c.html"> TR1 and C99 external "C"
+<dt><a href="math_toolkit/extern_c.html">TR1 and C99 external "C"
 Functions</a></dt>
<dd><dl>
-<dt> C99 and TR1 C Functions Overview</dt>
-<dt> C99 C Functions</dt>
-<dt><a href="math_toolkit/extern_c/tr1_ref.html"> TR1 C Functions Quick
+<dt>C99 and TR1 C Functions Overview</dt>
+<dt>C99 C Functions</dt>
+<dt><a href="math_toolkit/extern_c/tr1_ref.html">TR1 C Functions Quick
 Reference</a></dt>
</dl></dd>
-<dt> Internal Details and Tools (Experimental)</dt>
+<dt>Internal Details and Tools (Experimental)</dt>
<dd><dl>
-<dt> Overview</dt>
-<dt> Reused Utilities</dt>
+<dt>Overview</dt>
+<dt>Reused Utilities</dt>
<dd><dl>
-<dt><a href="math_toolkit/toolkit/internals1/constants.html"> Numeric
+<dt><a href="math_toolkit/toolkit/internals1/constants.html">Numeric
 Constants</a></dt>
-<dt><a href="math_toolkit/toolkit/internals1/series_evaluation.html">
- Series Evaluation</a></dt>
-<dt><a href="math_toolkit/toolkit/internals1/cf.html"> Continued Fraction
+<dt><a href="math_toolkit/toolkit/internals1/series_evaluation.html">Series
 Evaluation</a></dt>
-<dt><a href="math_toolkit/toolkit/internals1/rational.html"> Polynomial
+<dt><a href="math_toolkit/toolkit/internals1/cf.html">Continued Fraction
+ Evaluation</a></dt>
+<dt><a href="math_toolkit/toolkit/internals1/rational.html">Polynomial
 and Rational Function Evaluation</a></dt>
-<dt><a href="math_toolkit/toolkit/internals1/roots.html"> Root Finding
+<dt><a href="math_toolkit/toolkit/internals1/roots.html">Root Finding
 With Derivatives</a></dt>
-<dt><a href="math_toolkit/toolkit/internals1/roots2.html"> Root Finding
+<dt><a href="math_toolkit/toolkit/internals1/roots2.html">Root Finding
 Without Derivatives</a></dt>
-<dt><a href="math_toolkit/toolkit/internals1/minima.html"> Locating Function
+<dt><a href="math_toolkit/toolkit/internals1/minima.html">Locating Function
 Minima</a></dt>
-<dt> Tuples</dt>
+<dt>Tuples</dt>
</dl></dd>
-<dt> Testing and Development</dt>
+<dt>Testing and Development</dt>
<dd><dl>
-<dt> Polynomials</dt>
-<dt><a href="math_toolkit/toolkit/internals2/minimax.html"> Minimax Approximations
+<dt>Polynomials</dt>
+<dt><a href="math_toolkit/toolkit/internals2/minimax.html">Minimax Approximations
 and the Remez Algorithm</a></dt>
-<dt><a href="math_toolkit/toolkit/internals2/error_test.html"> Relative
+<dt><a href="math_toolkit/toolkit/internals2/error_test.html">Relative
 Error and Testing</a></dt>
-<dt><a href="math_toolkit/toolkit/internals2/test_data.html"> Graphing,
+<dt><a href="math_toolkit/toolkit/internals2/test_data.html">Graphing,
 Profiling, and Generating Test Data for Special Functions</a></dt>
</dl></dd>
</dl></dd>
-<dt><a href="math_toolkit/using_udt.html"> Use with User-Defined Floating-Point
+<dt><a href="math_toolkit/using_udt.html">Use with User-Defined Floating-Point
 Types</a></dt>
<dd><dl>
-<dt><a href="math_toolkit/using_udt/use_ntl.html"> Using With NTL - a High-Precision
+<dt><a href="math_toolkit/using_udt/use_ntl.html">Using With NTL - a High-Precision
 Floating-Point Library</a></dt>
-<dt><a href="math_toolkit/using_udt/use_mpfr.html"> Using With MPFR / GMP
+<dt><a href="math_toolkit/using_udt/use_mpfr.html">Using With MPFR / GMP
 - a High-Precision Floating-Point Library</a></dt>
-<dt><a href="math_toolkit/using_udt/concepts.html"> Conceptual Requirements
+<dt><a href="math_toolkit/using_udt/concepts.html">Conceptual Requirements
 for Real Number Types</a></dt>
-<dt><a href="math_toolkit/using_udt/dist_concept.html"> Conceptual Requirements
+<dt><a href="math_toolkit/using_udt/dist_concept.html">Conceptual Requirements
 for Distribution Types</a></dt>
-<dt><a href="math_toolkit/using_udt/archetypes.html"> Conceptual Archetypes
+<dt><a href="math_toolkit/using_udt/archetypes.html">Conceptual Archetypes
 and Testing</a></dt>
</dl></dd>
-<dt> Policies</dt>
+<dt>Policies</dt>
<dd><dl>
-<dt> Policy Overview</dt>
-<dt> Policy Tutorial</dt>
+<dt>Policy Overview</dt>
+<dt>Policy Tutorial</dt>
<dd><dl>
-<dt><a href="math_toolkit/policy/pol_tutorial/what_is_a_policy.html">
- So Just What is a Policy Anyway?</a></dt>
-<dt><a href="math_toolkit/policy/pol_tutorial/policy_tut_defaults.html">
- Policies Have Sensible Defaults</a></dt>
-<dt><a href="math_toolkit/policy/pol_tutorial/policy_usage.html"> So
- How are Policies Used Anyway?</a></dt>
-<dt><a href="math_toolkit/policy/pol_tutorial/changing_policy_defaults.html">
- Changing the Policy Defaults</a></dt>
-<dt><a href="math_toolkit/policy/pol_tutorial/ad_hoc_dist_policies.html">
- Setting Policies for Distributions on an Ad Hoc Basis</a></dt>
-<dt><a href="math_toolkit/policy/pol_tutorial/ad_hoc_sf_policies.html">
- Changing the Policy on an Ad Hoc Basis for the Special Functions</a></dt>
-<dt><a href="math_toolkit/policy/pol_tutorial/namespace_policies.html">
- Setting Policies at Namespace or Translation Unit Scope</a></dt>
-<dt><a href="math_toolkit/policy/pol_tutorial/user_def_err_pol.html">
- Calling User Defined Error Handlers</a></dt>
-<dt><a href="math_toolkit/policy/pol_tutorial/understand_dis_quant.html">
- Understanding Quantiles of Discrete Distributions</a></dt>
-</dl></dd>
-<dt> Policy Reference</dt>
-<dd><dl>
-<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>
-<dt><a href="math_toolkit/policy/pol_ref/assert_undefined.html"> Mathematically
+<dt><a href="math_toolkit/policy/pol_tutorial/what_is_a_policy.html">So
+ Just What is a Policy Anyway?</a></dt>
+<dt><a href="math_toolkit/policy/pol_tutorial/policy_tut_defaults.html">Policies
+ Have Sensible Defaults</a></dt>
+<dt><a href="math_toolkit/policy/pol_tutorial/policy_usage.html">So How
+ are Policies Used Anyway?</a></dt>
+<dt><a href="math_toolkit/policy/pol_tutorial/changing_policy_defaults.html">Changing
+ the Policy Defaults</a></dt>
+<dt><a href="math_toolkit/policy/pol_tutorial/ad_hoc_dist_policies.html">Setting
+ Policies for Distributions on an Ad Hoc Basis</a></dt>
+<dt><a href="math_toolkit/policy/pol_tutorial/ad_hoc_sf_policies.html">Changing
+ the Policy on an Ad Hoc Basis for the Special Functions</a></dt>
+<dt><a href="math_toolkit/policy/pol_tutorial/namespace_policies.html">Setting
+ Policies at Namespace or Translation Unit Scope</a></dt>
+<dt><a href="math_toolkit/policy/pol_tutorial/user_def_err_pol.html">Calling
+ User Defined Error Handlers</a></dt>
+<dt><a href="math_toolkit/policy/pol_tutorial/understand_dis_quant.html">Understanding
+ Quantiles of Discrete Distributions</a></dt>
+</dl></dd>
+<dt>Policy Reference</dt>
+<dd><dl>
+<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
+ 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
+<dt><a href="math_toolkit/policy/pol_ref/discrete_quant_ref.html">Discrete
 Quantile Policies</a></dt>
-<dt><a href="math_toolkit/policy/pol_ref/precision_pol.html"> Precision
+<dt><a href="math_toolkit/policy/pol_ref/precision_pol.html">Precision
 Policies</a></dt>
-<dt><a href="math_toolkit/policy/pol_ref/iteration_pol.html"> Iteration
+<dt><a href="math_toolkit/policy/pol_ref/iteration_pol.html">Iteration
 Limits Policies</a></dt>
-<dt><a href="math_toolkit/policy/pol_ref/policy_defaults.html"> Using
+<dt><a href="math_toolkit/policy/pol_ref/policy_defaults.html">Using
 macros to Change the Policy Defaults</a></dt>
-<dt><a href="math_toolkit/policy/pol_ref/namespace_pol.html"> Setting
+<dt><a href="math_toolkit/policy/pol_ref/namespace_pol.html">Setting
 Polices at Namespace Scope</a></dt>
-<dt><a href="math_toolkit/policy/pol_ref/pol_ref_ref.html"> Policy Class
+<dt><a href="math_toolkit/policy/pol_ref/pol_ref_ref.html">Policy Class
 Reference</a></dt>
</dl></dd>
</dl></dd>
-<dt> Performance</dt>
+<dt>Performance</dt>
<dd><dl>
-<dt> Performance Overview</dt>
-<dt> Interpreting these Results</dt>
-<dt><a href="math_toolkit/perf/getting_best.html"> Getting the Best Performance
+<dt>Performance Overview</dt>
+<dt>Interpreting these Results</dt>
+<dt><a href="math_toolkit/perf/getting_best.html">Getting the Best Performance
 from this Library</a></dt>
-<dt> Comparing Compilers</dt>
-<dt> Performance Tuning Macros</dt>
-<dt><a href="math_toolkit/perf/comparisons.html"> Comparisons to Other
- Open Source Libraries</a></dt>
-<dt><a href="math_toolkit/perf/perf_test_app.html"> The Performance Test
+<dt>Comparing Compilers</dt>
+<dt>Performance Tuning Macros</dt>
+<dt><a href="math_toolkit/perf/comparisons.html">Comparisons to Other Open
+ Source Libraries</a></dt>
+<dt><a href="math_toolkit/perf/perf_test_app.html">The Performance Test
 Application</a></dt>
</dl></dd>
-<dt> Backgrounders</dt>
+<dt>Backgrounders</dt>
<dd><dl>
-<dt><a href="math_toolkit/backgrounders/implementation.html"> Additional
+<dt><a href="math_toolkit/backgrounders/implementation.html">Additional
 Implementation Notes</a></dt>
-<dt><a href="math_toolkit/backgrounders/relative_error.html"> Relative
- Error</a></dt>
-<dt> The Lanczos Approximation</dt>
-<dt> The Remez Method</dt>
-<dt> References</dt>
-</dl></dd>
-<dt> Library Status</dt>
-<dd><dl>
-<dt> History and What's New</dt>
-<dt> Compilers</dt>
-<dt> Known Issues, and Todo List</dt>
-<dt> Credits and Acknowledgements</dt>
+<dt>Relative Error</dt>
+<dt>The Lanczos Approximation</dt>
+<dt>The Remez Method</dt>
+<dt>References</dt>
+</dl></dd>
+<dt>Library Status</dt>
+<dd><dl>
+<dt>History and What's New</dt>
+<dt>Compilers</dt>
+<dt>Known Issues, and Todo List</dt>
+<dt>Credits and Acknowledgements</dt>
</dl></dd>
</dl>
</div>

- 
-
 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: September 05, 2010 at 10:44:05 GMT</td>
+<td align="left">Last revised: September 28, 2010 at 14:53:56 GMT</td>
<td align="right"><div class="copyright-footer"></div></td>
</tr></table>
<hr>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,16 +24,15 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="math_toolkit.backgrounders"></a><a class="link" href="backgrounders.html" title="Backgrounders"> Backgrounders</a>
+<a name="math_toolkit.backgrounders"></a><a class="link" href="backgrounders.html" title="Backgrounders">Backgrounders</a>
</h2></div></div></div>
<div class="toc"><dl>
-<dt><a href="backgrounders/implementation.html"> Additional
+<dt><a href="backgrounders/implementation.html">Additional
Implementation Notes</a></dt>
-<dt><a href="backgrounders/relative_error.html"> Relative
- Error</a></dt>
-<dt> The Lanczos Approximation</dt>
-<dt> The Remez Method</dt>
-<dt> References</dt>
+<dt>Relative Error</dt>
+<dt>The Lanczos Approximation</dt>
+<dt>The Remez Method</dt>
+<dt>References</dt>
</dl></div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/implementation.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/implementation.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/implementation.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.backgrounders.implementation"></a><a class="link" href="implementation.html" title="Additional Implementation Notes"> Additional
+<a name="math_toolkit.backgrounders.implementation"></a><a class="link" href="implementation.html" title="Additional Implementation Notes">Additional
 Implementation Notes</a>
</h3></div></div></div>

@@ -33,7 +33,7 @@
 and reflect more the general implementation philosophy used.
 
<a name="math_toolkit.backgrounders.implementation.implemention_philosophy"></a><h5>
-<a name="id1393976"></a>
+<a name="id1268630"></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="id1394040"></a>
+<a name="id1268694"></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="id1394184"></a>
+<a name="id1268838"></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="id1394228"></a>
+<a name="id1268882"></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="id1394358"></a>
+<a name="id1269012"></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="id1394443"></a>
+<a name="id1269097"></a>
 <a class="link" href="implementation.html#math_toolkit.backgrounders.implementation.median_of_distributions">Median
 of distributions</a>
 </h5>
@@ -268,7 +268,9 @@
 functions</a>, the mid-point in a list of values.
 

- However a useful median numerical approximation for distribution <code class="computeroutput">dist</code> may be available by calling
+ 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> (this
@@ -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="id1394544"></a>
+<a name="id1269772"></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="id1394630"></a>
+<a name="id1269858"></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="id1396255"></a>
+<a name="id1270193"></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="id1396279"></a>
+<a name="id1270217"></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="id1396324"></a>
+<a name="id1270262"></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="id1396710"></a>
+<a name="id1270648"></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="id1396746"></a>
+<a name="id1270684"></a>
 <a class="link" href="implementation.html#math_toolkit.backgrounders.implementation.sources_of_test_data">Sources
 of Test Data</a>
 </h5>
@@ -544,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="id1396814"></a>
+<a name="id1270752"></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/.
 
@@ -638,8 +648,8 @@
<pre class="programlisting">
</pre>

-  is provided
- in the xep.xml downloaded, but the Windows TrueType fonts are commented out.
+ is provided in the xep.xml downloaded, but the Windows TrueType fonts are
+ commented out.
 

 JM's XEP config file \xep\xep.xml has the following font configuration section
@@ -721,7 +731,7 @@
 HTML: this needs further investigation.
 
<a name="math_toolkit.backgrounders.implementation.producing_graphs"></a><h5>
-<a name="id1397064"></a>
+<a name="id1271009"></a>
 <a class="link" href="implementation.html#math_toolkit.backgrounders.implementation.producing_graphs">Producing
 Graphs</a>
 </h5>
@@ -733,8 +743,9 @@
 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 is
- at .\boost-sandbox\SOC\2007\visualization).
+ 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>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/lanczos.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/lanczos.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/lanczos.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,10 +24,10 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.backgrounders.lanczos"></a><a class="link" href="lanczos.html" title="The Lanczos Approximation"> The Lanczos Approximation</a>
+<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="id1397396"></a>
+<a name="id1271338"></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="id1397654"></a>
+<a name="id1271596"></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="id1397846"></a>
+<a name="id1271788"></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="id1398004"></a>
+<a name="id1271945"></a>
 <a class="link" href="lanczos.html#math_toolkit.backgrounders.lanczos.choosing_the_right_parameters">Choosing
 the Right Parameters</a>
 </h5>
@@ -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="id1399759"></a>
+<a name="id1272807"></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">

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/refs.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/refs.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/refs.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,10 +24,10 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.backgrounders.refs"></a><a class="link" href="refs.html" title="References"> References</a>
+<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="id1400683"></a>
+<a name="id1273731"></a>
 <a class="link" href="refs.html#math_toolkit.backgrounders.refs.general_references">General
 references</a>
 </h5>
@@ -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="id1400779"></a>
+<a name="id1273827"></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="id1400805"></a>
+<a name="id1273852"></a>
 <a class="link" href="refs.html#math_toolkit.backgrounders.refs.other_libraries">Other Libraries</a>
 </h5>

@@ -160,10 +160,28 @@
 Glossary</a>, Valerie Easton and John H. McColl.
 

- _R
+ _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, Jim Albert, Bayesian Computation with R, ISBN 978-0-387-71384-7.
+ 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>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/relative_error.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/relative_error.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/relative_error.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,8 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.backgrounders.relative_error"></a><a class="link" href="relative_error.html" title="Relative Error"> Relative
- Error</a>
+<a name="math_toolkit.backgrounders.relative_error"></a><a class="link" href="relative_error.html" title="Relative Error">Relative Error</a>
</h3></div></div></div>

 Given an actual value a and a found value v
@@ -78,10 +77,8 @@
 errors differ by a factor of 2, can actually be accurate to the same number
 of binary digits. You have been warned!
 
-<a name="zero_error"></a>
- 
-<a name="math_toolkit.backgrounders.relative_error.the_impossibility_of_zero_error"></a><h5>
-<a name="id1397353"></a>
+<a name="zero_error"></a><a name="math_toolkit.backgrounders.relative_error.the_impossibility_of_zero_error"></a><h5>
+<a name="id1271295"></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>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/remez.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/remez.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/backgrounders/remez.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.backgrounders.remez"></a><a class="link" href="remez.html" title="The Remez Method"> The Remez Method</a>
+<a name="math_toolkit.backgrounders.remez"></a><a class="link" href="remez.html" title="The Remez Method">The Remez Method</a>
</h3></div></div></div>

 The Remez algorithm
@@ -94,7 +94,7 @@
 are located!
 
<a name="math_toolkit.backgrounders.remez.the_remez_method"></a><h5>
-<a name="id1399944"></a>
+<a name="id1272992"></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="id1400095"></a>
+<a name="id1273143"></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="id1400170"></a>
+<a name="id1273218"></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="id1400202"></a>
+<a name="id1273250"></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="id1400247"></a>
+<a name="id1273294"></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="id1400326"></a>
+<a name="id1273374"></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="id1400482"></a>
+<a name="id1273530"></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="id1400563"></a>
+<a name="id1273611"></a>
 <a class="link" href="remez.html#math_toolkit.backgrounders.remez.references">References</a>
 </h5>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,180 +24,179 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="math_toolkit.dist"></a><a class="link" href="dist.html" title="Statistical Distributions and Functions"> Statistical Distributions and Functions</a>
+<a name="math_toolkit.dist"></a><a class="link" href="dist.html" title="Statistical Distributions and Functions">Statistical Distributions and Functions</a>
</h2></div></div></div>
<div class="toc"><dl>
-<dt><a href="dist/stat_tut.html"> Statistical Distributions
+<dt><a href="dist/stat_tut.html">Statistical Distributions
 Tutorial</a></dt>
<dd><dl>
-<dt> Overview of Distributions</dt>
+<dt>Overview of Distributions</dt>
<dd><dl>
-<dt><a href="dist/stat_tut/overview/headers.html"> Headers
+<dt><a href="dist/stat_tut/overview/headers.html">Headers
 and Namespaces</a></dt>
-<dt><a href="dist/stat_tut/overview/objects.html"> Distributions
+<dt><a href="dist/stat_tut/overview/objects.html">Distributions
 are Objects</a></dt>
-<dt><a href="dist/stat_tut/overview/generic.html"> Generic
+<dt><a href="dist/stat_tut/overview/generic.html">Generic
 operations common to all distributions are non-member functions</a></dt>
-<dt><a href="dist/stat_tut/overview/complements.html">
- Complements are supported too - and when to use them</a></dt>
-<dt><a href="dist/stat_tut/overview/parameters.html">
- Parameters can be calculated</a></dt>
-<dt> Summary</dt>
-</dl></dd>
-<dt> Worked Examples</dt>
-<dd><dl>
-<dt><a href="dist/stat_tut/weg/dist_construct_eg.html">
- Distribution Construction Example</a></dt>
-<dt><a href="dist/stat_tut/weg/st_eg.html"> Student's
- t Distribution Examples</a></dt>
-<dd><dl>
-<dt><a href="dist/stat_tut/weg/st_eg/tut_mean_intervals.html">
- Calculating confidence intervals on the mean with the Students-t distribution</a></dt>
-<dt><a href="dist/stat_tut/weg/st_eg/tut_mean_test.html">
- Testing a sample mean for difference from a "true" mean</a></dt>
-<dt><a href="dist/stat_tut/weg/st_eg/tut_mean_size.html">
- Estimating how large a sample size would have to become in order to give
- a significant Students-t test result with a single sample test</a></dt>
-<dt><a href="dist/stat_tut/weg/st_eg/two_sample_students_t.html">
- Comparing the means of two samples with the Students-t test</a></dt>
-<dt><a href="dist/stat_tut/weg/st_eg/paired_st.html">
- Comparing two paired samples with the Student's t distribution</a></dt>
+<dt><a href="dist/stat_tut/overview/complements.html">Complements
+ are supported too - and when to use them</a></dt>
+<dt><a href="dist/stat_tut/overview/parameters.html">Parameters
+ can be calculated</a></dt>
+<dt>Summary</dt>
+</dl></dd>
+<dt>Worked Examples</dt>
+<dd><dl>
+<dt><a href="dist/stat_tut/weg/dist_construct_eg.html">Distribution
+ Construction Example</a></dt>
+<dt><a href="dist/stat_tut/weg/st_eg.html">Student's t
+ Distribution Examples</a></dt>
+<dd><dl>
+<dt><a href="dist/stat_tut/weg/st_eg/tut_mean_intervals.html">Calculating
+ confidence intervals on the mean with the Students-t distribution</a></dt>
+<dt><a href="dist/stat_tut/weg/st_eg/tut_mean_test.html">Testing
+ a sample mean for difference from a "true" mean</a></dt>
+<dt><a href="dist/stat_tut/weg/st_eg/tut_mean_size.html">Estimating
+ how large a sample size would have to become in order to give a significant
+ Students-t test result with a single sample test</a></dt>
+<dt><a href="dist/stat_tut/weg/st_eg/two_sample_students_t.html">Comparing
+ the means of two samples with the Students-t test</a></dt>
+<dt><a href="dist/stat_tut/weg/st_eg/paired_st.html">Comparing
+ two paired samples with the Student's t distribution</a></dt>
</dl></dd>
-<dt><a href="dist/stat_tut/weg/cs_eg.html"> Chi Squared
+<dt><a href="dist/stat_tut/weg/cs_eg.html">Chi Squared
 Distribution Examples</a></dt>
<dd><dl>
-<dt><a href="dist/stat_tut/weg/cs_eg/chi_sq_intervals.html">
- Confidence Intervals on the Standard Deviation</a></dt>
-<dt><a href="dist/stat_tut/weg/cs_eg/chi_sq_test.html">
- Chi-Square Test for the Standard Deviation</a></dt>
-<dt><a href="dist/stat_tut/weg/cs_eg/chi_sq_size.html">
- Estimating the Required Sample Sizes for a Chi-Square Test for the Standard
- Deviation</a></dt>
+<dt><a href="dist/stat_tut/weg/cs_eg/chi_sq_intervals.html">Confidence
+ Intervals on the Standard Deviation</a></dt>
+<dt><a href="dist/stat_tut/weg/cs_eg/chi_sq_test.html">Chi-Square
+ Test for the Standard Deviation</a></dt>
+<dt><a href="dist/stat_tut/weg/cs_eg/chi_sq_size.html">Estimating
+ the Required Sample Sizes for a Chi-Square Test for the Standard Deviation</a></dt>
</dl></dd>
-<dt><a href="dist/stat_tut/weg/f_eg.html"> F Distribution
+<dt><a href="dist/stat_tut/weg/f_eg.html">F Distribution
 Examples</a></dt>
-<dt><a href="dist/stat_tut/weg/binom_eg.html"> Binomial
+<dt><a href="dist/stat_tut/weg/binom_eg.html">Binomial
 Distribution Examples</a></dt>
<dd><dl>
-<dt><a href="dist/stat_tut/weg/binom_eg/binomial_coinflip_example.html">
- Binomial Coin-Flipping Example</a></dt>
-<dt><a href="dist/stat_tut/weg/binom_eg/binomial_quiz_example.html">
- Binomial Quiz Example</a></dt>
-<dt><a href="dist/stat_tut/weg/binom_eg/binom_conf.html">
- Calculating Confidence Limits on the Frequency of Occurrence for a Binomial
- Distribution</a></dt>
-<dt><a href="dist/stat_tut/weg/binom_eg/binom_size_eg.html">
- Estimating Sample Sizes for a Binomial Distribution.</a></dt>
+<dt><a href="dist/stat_tut/weg/binom_eg/binomial_coinflip_example.html">Binomial
+ Coin-Flipping Example</a></dt>
+<dt><a href="dist/stat_tut/weg/binom_eg/binomial_quiz_example.html">Binomial
+ Quiz Example</a></dt>
+<dt><a href="dist/stat_tut/weg/binom_eg/binom_conf.html">Calculating
+ Confidence Limits on the Frequency of Occurrence for a Binomial Distribution</a></dt>
+<dt><a href="dist/stat_tut/weg/binom_eg/binom_size_eg.html">Estimating
+ Sample Sizes for a Binomial Distribution.</a></dt>
</dl></dd>
-<dt><a href="dist/stat_tut/weg/neg_binom_eg.html"> Negative
+<dt><a href="dist/stat_tut/weg/neg_binom_eg.html">Negative
 Binomial Distribution Examples</a></dt>
<dd><dl>
-<dt><a href="dist/stat_tut/weg/neg_binom_eg/neg_binom_conf.html">
- Calculating Confidence Limits on the Frequency of Occurrence for the
- Negative Binomial Distribution</a></dt>
-<dt><a href="dist/stat_tut/weg/neg_binom_eg/neg_binom_size_eg.html">
- Estimating Sample Sizes for the Negative Binomial.</a></dt>
-<dt><a href="dist/stat_tut/weg/neg_binom_eg/negative_binomial_example1.html">
- Negative Binomial Sales Quota Example.</a></dt>
-<dt><a href="dist/stat_tut/weg/neg_binom_eg/negative_binomial_example2.html">
- Negative Binomial Table Printing Example.</a></dt>
+<dt><a href="dist/stat_tut/weg/neg_binom_eg/neg_binom_conf.html">Calculating
+ Confidence Limits on the Frequency of Occurrence for the Negative Binomial
+ Distribution</a></dt>
+<dt><a href="dist/stat_tut/weg/neg_binom_eg/neg_binom_size_eg.html">Estimating
+ Sample Sizes for the Negative Binomial.</a></dt>
+<dt><a href="dist/stat_tut/weg/neg_binom_eg/negative_binomial_example1.html">Negative
+ Binomial Sales Quota Example.</a></dt>
+<dt><a href="dist/stat_tut/weg/neg_binom_eg/negative_binomial_example2.html">Negative
+ Binomial Table Printing Example.</a></dt>
</dl></dd>
-<dt><a href="dist/stat_tut/weg/normal_example.html"> Normal
+<dt><a href="dist/stat_tut/weg/normal_example.html">Normal
 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
+<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">
- Tables of the power function of the χ2 test.</a></dt></dl></dd>
-<dt><a href="dist/stat_tut/weg/error_eg.html"> Error Handling
+<dd><dl><dt><a href="dist/stat_tut/weg/nccs_eg/nccs_power_eg.html">Tables
+ of the power function of the χ2 test.</a></dt></dl></dd>
+<dt><a href="dist/stat_tut/weg/error_eg.html">Error Handling
 Example</a></dt>
-<dt><a href="dist/stat_tut/weg/find_eg.html"> Find Location
+<dt><a href="dist/stat_tut/weg/find_eg.html">Find Location
 and Scale Examples</a></dt>
<dd><dl>
-<dt><a href="dist/stat_tut/weg/find_eg/find_location_eg.html">
- Find Location (Mean) Example</a></dt>
-<dt><a href="dist/stat_tut/weg/find_eg/find_scale_eg.html">
- Find Scale (Standard Deviation) Example</a></dt>
-<dt><a href="dist/stat_tut/weg/find_eg/find_mean_and_sd_eg.html">
- Find mean and standard deviation example</a></dt>
+<dt><a href="dist/stat_tut/weg/find_eg/find_location_eg.html">Find
+ Location (Mean) Example</a></dt>
+<dt><a href="dist/stat_tut/weg/find_eg/find_scale_eg.html">Find
+ Scale (Standard Deviation) Example</a></dt>
+<dt><a href="dist/stat_tut/weg/find_eg/find_mean_and_sd_eg.html">Find
+ mean and standard deviation example</a></dt>
</dl></dd>
-<dt><a href="dist/stat_tut/weg/nag_library.html"> Comparison
+<dt><a href="dist/stat_tut/weg/nag_library.html">Comparison
 with C, R, FORTRAN-style Free Functions</a></dt>
-<dt><a href="dist/stat_tut/weg/c_sharp.html"> Using the
+<dt><a href="dist/stat_tut/weg/c_sharp.html">Using the
 Distributions from Within C#</a></dt>
</dl></dd>
-<dt><a href="dist/stat_tut/variates.html"> Random Variates
+<dt><a href="dist/stat_tut/variates.html">Random Variates
 and Distribution Parameters</a></dt>
-<dt><a href="dist/stat_tut/dist_params.html"> Discrete Probability
+<dt><a href="dist/stat_tut/dist_params.html">Discrete Probability
 Distributions</a></dt>
</dl></dd>
-<dt><a href="dist/dist_ref.html"> Statistical Distributions
+<dt><a href="dist/dist_ref.html">Statistical Distributions
 Reference</a></dt>
<dd><dl>
-<dt> Non-Member Properties</dt>
-<dt> Distributions</dt>
+<dt>Non-Member Properties</dt>
+<dt>Distributions</dt>
<dd><dl>
-<dt><a href="dist/dist_ref/dists/bernoulli_dist.html">
- Bernoulli Distribution</a></dt>
-<dt><a href="dist/dist_ref/dists/beta_dist.html"> Beta
+<dt><a href="dist/dist_ref/dists/bernoulli_dist.html">Bernoulli
 Distribution</a></dt>
-<dt><a href="dist/dist_ref/dists/binomial_dist.html">
- Binomial Distribution</a></dt>
-<dt><a href="dist/dist_ref/dists/cauchy_dist.html"> Cauchy-Lorentz
+<dt><a href="dist/dist_ref/dists/beta_dist.html">Beta
 Distribution</a></dt>
-<dt><a href="dist/dist_ref/dists/chi_squared_dist.html">
- Chi Squared Distribution</a></dt>
-<dt><a href="dist/dist_ref/dists/exp_dist.html"> Exponential
+<dt><a href="dist/dist_ref/dists/binomial_dist.html">Binomial
+ Distribution</a></dt>
+<dt><a href="dist/dist_ref/dists/cauchy_dist.html">Cauchy-Lorentz
 Distribution</a></dt>
-<dt><a href="dist/dist_ref/dists/extreme_dist.html"> Extreme
+<dt><a href="dist/dist_ref/dists/chi_squared_dist.html">Chi
+ Squared Distribution</a></dt>
+<dt><a href="dist/dist_ref/dists/exp_dist.html">Exponential
+ Distribution</a></dt>
+<dt><a href="dist/dist_ref/dists/extreme_dist.html">Extreme
 Value Distribution</a></dt>
-<dt> F Distribution</dt>
-<dt><a href="dist/dist_ref/dists/gamma_dist.html"> Gamma
+<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_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
- Distribution</a></dt>
-<dt><a href="dist/dist_ref/dists/logistic_dist.html">
- Logistic Distribution</a></dt>
-<dt><a href="dist/dist_ref/dists/lognormal_dist.html">
- Log Normal Distribution</a></dt>
-<dt><a href="dist/dist_ref/dists/negative_binomial_dist.html">
- Negative Binomial Distribution</a></dt>
-<dt><a href="dist/dist_ref/dists/nc_beta_dist.html"> Noncentral
+<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
+ Distribution</a></dt>
+<dt><a href="dist/dist_ref/dists/logistic_dist.html">Logistic
+ Distribution</a></dt>
+<dt><a href="dist/dist_ref/dists/lognormal_dist.html">Log
+ Normal Distribution</a></dt>
+<dt><a href="dist/dist_ref/dists/negative_binomial_dist.html">Negative
+ Binomial Distribution</a></dt>
+<dt><a href="dist/dist_ref/dists/nc_beta_dist.html">Noncentral
 Beta Distribution</a></dt>
-<dt><a href="dist/dist_ref/dists/nc_chi_squared_dist.html">
- Noncentral Chi-Squared Distribution</a></dt>
-<dt><a href="dist/dist_ref/dists/nc_f_dist.html"> Noncentral
+<dt><a href="dist/dist_ref/dists/nc_chi_squared_dist.html">Noncentral
+ Chi-Squared Distribution</a></dt>
+<dt><a href="dist/dist_ref/dists/nc_f_dist.html">Noncentral
 F Distribution</a></dt>
-<dt><a href="dist/dist_ref/dists/nc_t_dist.html"> Noncentral
+<dt><a href="dist/dist_ref/dists/nc_t_dist.html">Noncentral
 T Distribution</a></dt>
-<dt><a href="dist/dist_ref/dists/normal_dist.html"> Normal
+<dt><a href="dist/dist_ref/dists/normal_dist.html">Normal
 (Gaussian) Distribution</a></dt>
-<dt><a href="dist/dist_ref/dists/pareto.html"> Pareto
+<dt>Pareto Distribution</dt>
+<dt><a href="dist/dist_ref/dists/poisson_dist.html">Poisson
 Distribution</a></dt>
-<dt><a href="dist/dist_ref/dists/poisson_dist.html"> Poisson
+<dt><a href="dist/dist_ref/dists/rayleigh.html">Rayleigh
 Distribution</a></dt>
-<dt><a href="dist/dist_ref/dists/rayleigh.html"> Rayleigh
+<dt><a href="dist/dist_ref/dists/students_t_dist.html">Students
+ t Distribution</a></dt>
+<dt><a href="dist/dist_ref/dists/triangular_dist.html">Triangular
 Distribution</a></dt>
-<dt><a href="dist/dist_ref/dists/students_t_dist.html">
- Students t Distribution</a></dt>
-<dt><a href="dist/dist_ref/dists/triangular_dist.html">
- Triangular Distribution</a></dt>
-<dt><a href="dist/dist_ref/dists/weibull.html"> Weibull
+<dt><a href="dist/dist_ref/dists/weibull.html">Weibull
 Distribution</a></dt>
-<dt><a href="dist/dist_ref/dists/uniform_dist.html"> Uniform
+<dt><a href="dist/dist_ref/dists/uniform_dist.html">Uniform
 Distribution</a></dt>
</dl></dd>
-<dt><a href="dist/dist_ref/dist_algorithms.html"> Distribution
+<dt><a href="dist/dist_ref/dist_algorithms.html">Distribution
 Algorithms</a></dt>
</dl></dd>
-<dt> Extras/Future Directions</dt>
+<dt>Extras/Future Directions</dt>
</dl></div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,68 +24,69 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.dist.dist_ref"></a><a class="link" href="dist_ref.html" title="Statistical Distributions Reference"> Statistical Distributions
+<a name="math_toolkit.dist.dist_ref"></a><a class="link" href="dist_ref.html" title="Statistical Distributions Reference">Statistical Distributions
 Reference</a>
</h3></div></div></div>
<div class="toc"><dl>
-<dt> Non-Member Properties</dt>
-<dt> Distributions</dt>
+<dt>Non-Member Properties</dt>
+<dt>Distributions</dt>
<dd><dl>
-<dt><a href="dist_ref/dists/bernoulli_dist.html">
- Bernoulli Distribution</a></dt>
-<dt><a href="dist_ref/dists/beta_dist.html"> Beta
+<dt><a href="dist_ref/dists/bernoulli_dist.html">Bernoulli
 Distribution</a></dt>
-<dt><a href="dist_ref/dists/binomial_dist.html">
- Binomial Distribution</a></dt>
-<dt><a href="dist_ref/dists/cauchy_dist.html"> Cauchy-Lorentz
+<dt><a href="dist_ref/dists/beta_dist.html">Beta
 Distribution</a></dt>
-<dt><a href="dist_ref/dists/chi_squared_dist.html">
- Chi Squared Distribution</a></dt>
-<dt><a href="dist_ref/dists/exp_dist.html"> Exponential
+<dt><a href="dist_ref/dists/binomial_dist.html">Binomial
+ Distribution</a></dt>
+<dt><a href="dist_ref/dists/cauchy_dist.html">Cauchy-Lorentz
 Distribution</a></dt>
-<dt><a href="dist_ref/dists/extreme_dist.html"> Extreme
+<dt><a href="dist_ref/dists/chi_squared_dist.html">Chi
+ Squared Distribution</a></dt>
+<dt><a href="dist_ref/dists/exp_dist.html">Exponential
+ Distribution</a></dt>
+<dt><a href="dist_ref/dists/extreme_dist.html">Extreme
 Value Distribution</a></dt>
-<dt> F Distribution</dt>
-<dt><a href="dist_ref/dists/gamma_dist.html"> Gamma
+<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_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
- Distribution</a></dt>
-<dt><a href="dist_ref/dists/logistic_dist.html">
- Logistic Distribution</a></dt>
-<dt><a href="dist_ref/dists/lognormal_dist.html">
- Log Normal Distribution</a></dt>
-<dt><a href="dist_ref/dists/negative_binomial_dist.html">
- Negative Binomial Distribution</a></dt>
-<dt><a href="dist_ref/dists/nc_beta_dist.html"> Noncentral
+<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
+ Distribution</a></dt>
+<dt><a href="dist_ref/dists/logistic_dist.html">Logistic
+ Distribution</a></dt>
+<dt><a href="dist_ref/dists/lognormal_dist.html">Log
+ Normal Distribution</a></dt>
+<dt><a href="dist_ref/dists/negative_binomial_dist.html">Negative
+ Binomial Distribution</a></dt>
+<dt><a href="dist_ref/dists/nc_beta_dist.html">Noncentral
 Beta Distribution</a></dt>
-<dt><a href="dist_ref/dists/nc_chi_squared_dist.html">
- Noncentral Chi-Squared Distribution</a></dt>
-<dt><a href="dist_ref/dists/nc_f_dist.html"> Noncentral
+<dt><a href="dist_ref/dists/nc_chi_squared_dist.html">Noncentral
+ Chi-Squared Distribution</a></dt>
+<dt><a href="dist_ref/dists/nc_f_dist.html">Noncentral
 F Distribution</a></dt>
-<dt><a href="dist_ref/dists/nc_t_dist.html"> Noncentral
+<dt><a href="dist_ref/dists/nc_t_dist.html">Noncentral
 T Distribution</a></dt>
-<dt><a href="dist_ref/dists/normal_dist.html"> Normal
+<dt><a href="dist_ref/dists/normal_dist.html">Normal
 (Gaussian) Distribution</a></dt>
-<dt><a href="dist_ref/dists/pareto.html"> Pareto
+<dt>Pareto Distribution</dt>
+<dt><a href="dist_ref/dists/poisson_dist.html">Poisson
 Distribution</a></dt>
-<dt><a href="dist_ref/dists/poisson_dist.html"> Poisson
+<dt><a href="dist_ref/dists/rayleigh.html">Rayleigh
 Distribution</a></dt>
-<dt><a href="dist_ref/dists/rayleigh.html"> Rayleigh
+<dt><a href="dist_ref/dists/students_t_dist.html">Students
+ t Distribution</a></dt>
+<dt><a href="dist_ref/dists/triangular_dist.html">Triangular
 Distribution</a></dt>
-<dt><a href="dist_ref/dists/students_t_dist.html">
- Students t Distribution</a></dt>
-<dt><a href="dist_ref/dists/triangular_dist.html">
- Triangular Distribution</a></dt>
-<dt><a href="dist_ref/dists/weibull.html"> Weibull
+<dt><a href="dist_ref/dists/weibull.html">Weibull
 Distribution</a></dt>
-<dt><a href="dist_ref/dists/uniform_dist.html"> Uniform
+<dt><a href="dist_ref/dists/uniform_dist.html">Uniform
 Distribution</a></dt>
</dl></dd>
-<dt><a href="dist_ref/dist_algorithms.html"> Distribution
+<dt><a href="dist_ref/dist_algorithms.html">Distribution
 Algorithms</a></dt>
</dl></div>
</div>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dist_algorithms.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dist_algorithms.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dist_algorithms.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.dist.dist_ref.dist_algorithms"></a><a class="link" href="dist_algorithms.html" title="Distribution Algorithms"> Distribution
+<a name="math_toolkit.dist.dist_ref.dist_algorithms"></a><a class="link" href="dist_algorithms.html" title="Distribution Algorithms">Distribution
 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="id1174610"></a>
+<a name="id1048546"></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="id1174708"></a>
+<a name="id1048644"></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="id1175154"></a>
+<a name="id1049089"></a>
 <a class="link" href="dist_algorithms.html#math_toolkit.dist.dist_ref.dist_algorithms.find_scale_function">find_scale
 function</a>
 </h5>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,61 +24,62 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.dist.dist_ref.dists"></a><a class="link" href="dists.html" title="Distributions"> Distributions</a>
+<a name="math_toolkit.dist.dist_ref.dists"></a><a class="link" href="dists.html" title="Distributions">Distributions</a>
</h4></div></div></div>
<div class="toc"><dl>
-<dt><a href="dists/bernoulli_dist.html">
- Bernoulli Distribution</a></dt>
-<dt><a href="dists/beta_dist.html"> Beta
+<dt><a href="dists/bernoulli_dist.html">Bernoulli
 Distribution</a></dt>
-<dt><a href="dists/binomial_dist.html">
- Binomial Distribution</a></dt>
-<dt><a href="dists/cauchy_dist.html"> Cauchy-Lorentz
+<dt><a href="dists/beta_dist.html">Beta
 Distribution</a></dt>
-<dt><a href="dists/chi_squared_dist.html">
- Chi Squared Distribution</a></dt>
-<dt><a href="dists/exp_dist.html"> Exponential
+<dt><a href="dists/binomial_dist.html">Binomial
+ Distribution</a></dt>
+<dt><a href="dists/cauchy_dist.html">Cauchy-Lorentz
 Distribution</a></dt>
-<dt><a href="dists/extreme_dist.html"> Extreme
+<dt><a href="dists/chi_squared_dist.html">Chi
+ Squared Distribution</a></dt>
+<dt><a href="dists/exp_dist.html">Exponential
+ Distribution</a></dt>
+<dt><a href="dists/extreme_dist.html">Extreme
 Value Distribution</a></dt>
-<dt> F Distribution</dt>
-<dt><a href="dists/gamma_dist.html"> Gamma
+<dt>F Distribution</dt>
+<dt><a href="dists/gamma_dist.html">Gamma
 (and Erlang) 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
- Distribution</a></dt>
-<dt><a href="dists/logistic_dist.html">
- Logistic Distribution</a></dt>
-<dt><a href="dists/lognormal_dist.html">
- Log Normal Distribution</a></dt>
-<dt><a href="dists/negative_binomial_dist.html">
- Negative Binomial Distribution</a></dt>
-<dt><a href="dists/nc_beta_dist.html"> Noncentral
+<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
+ Distribution</a></dt>
+<dt><a href="dists/logistic_dist.html">Logistic
+ Distribution</a></dt>
+<dt><a href="dists/lognormal_dist.html">Log
+ Normal Distribution</a></dt>
+<dt><a href="dists/negative_binomial_dist.html">Negative
+ Binomial Distribution</a></dt>
+<dt><a href="dists/nc_beta_dist.html">Noncentral
 Beta Distribution</a></dt>
-<dt><a href="dists/nc_chi_squared_dist.html">
- Noncentral Chi-Squared Distribution</a></dt>
-<dt><a href="dists/nc_f_dist.html"> Noncentral
+<dt><a href="dists/nc_chi_squared_dist.html">Noncentral
+ Chi-Squared Distribution</a></dt>
+<dt><a href="dists/nc_f_dist.html">Noncentral
 F Distribution</a></dt>
-<dt><a href="dists/nc_t_dist.html"> Noncentral
+<dt><a href="dists/nc_t_dist.html">Noncentral
 T Distribution</a></dt>
-<dt><a href="dists/normal_dist.html"> Normal
+<dt><a href="dists/normal_dist.html">Normal
 (Gaussian) Distribution</a></dt>
-<dt><a href="dists/pareto.html"> Pareto
+<dt>Pareto Distribution</dt>
+<dt><a href="dists/poisson_dist.html">Poisson
 Distribution</a></dt>
-<dt><a href="dists/poisson_dist.html"> Poisson
+<dt><a href="dists/rayleigh.html">Rayleigh
 Distribution</a></dt>
-<dt><a href="dists/rayleigh.html"> Rayleigh
+<dt><a href="dists/students_t_dist.html">Students
+ t Distribution</a></dt>
+<dt><a href="dists/triangular_dist.html">Triangular
 Distribution</a></dt>
-<dt><a href="dists/students_t_dist.html">
- Students t Distribution</a></dt>
-<dt><a href="dists/triangular_dist.html">
- Triangular Distribution</a></dt>
-<dt><a href="dists/weibull.html"> Weibull
+<dt><a href="dists/weibull.html">Weibull
 Distribution</a></dt>
-<dt><a href="dists/uniform_dist.html"> Uniform
+<dt><a href="dists/uniform_dist.html">Uniform
 Distribution</a></dt>
</dl></div>
</div>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/bernoulli_dist.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/bernoulli_dist.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/bernoulli_dist.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.dist_ref.dists.bernoulli_dist"></a><a class="link" href="bernoulli_dist.html" title="Bernoulli Distribution">
- Bernoulli Distribution</a>
+<a name="math_toolkit.dist.dist_ref.dists.bernoulli_dist"></a><a class="link" href="bernoulli_dist.html" title="Bernoulli Distribution">Bernoulli
+ Distribution</a>
</h5></div></div></div>


@@ -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="id1120230"></a>
+<a name="id990422"></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="id1120308"></a>
+<a name="id990500"></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="id1120411"></a>
+<a name="id990603"></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="id1120433"></a>
+<a name="id990624"></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="id1120762"></a>
+<a name="id990953"></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">

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/beta_dist.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/beta_dist.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/beta_dist.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.dist_ref.dists.beta_dist"></a><a class="link" href="beta_dist.html" title="Beta Distribution"> Beta
+<a name="math_toolkit.dist.dist_ref.dists.beta_dist"></a><a class="link" href="beta_dist.html" title="Beta Distribution">Beta
 Distribution</a>
</h5></div></div></div>

@@ -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="id1122674"></a>
+<a name="id991768"></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="id1122689"></a>
+<a name="id992876"></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="id1122804"></a>
+<a name="id992992"></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="id1123006"></a>
+<a name="id993193"></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="id1123456"></a>
+<a name="id993643"></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="id1123558"></a>
+<a name="id993745"></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="id1123583"></a>
+<a name="id993770"></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="id1123630"></a>
+<a name="id993817"></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="id1123674"></a>
+<a name="id993862"></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">
@@ -500,8 +500,6 @@
 
 </td>
<td>
- 
- 
 </td>
</tr>
<tr>
@@ -596,7 +594,7 @@
</tbody>
</table></div>
<a name="math_toolkit.dist.dist_ref.dists.beta_dist.references"></a><h5>
-<a name="id1125297"></a>
+<a name="id994885"></a>
 <a class="link" href="beta_dist.html#math_toolkit.dist.dist_ref.dists.beta_dist.references">References</a>
 </h5>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/binomial_dist.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/binomial_dist.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/binomial_dist.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.dist_ref.dists.binomial_dist"></a><a class="link" href="binomial_dist.html" title="Binomial Distribution">
- Binomial Distribution</a>
+<a name="math_toolkit.dist.dist_ref.dists.binomial_dist"></a><a class="link" href="binomial_dist.html" title="Binomial Distribution">Binomial
+ Distribution</a>
</h5></div></div></div>


@@ -127,8 +127,6 @@

 <img src="../../../../../graphs/binomial_pdf_2.png" align="middle">
 
-
- 
<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>
@@ -136,43 +134,39 @@
</tr>
<tr><td align="left" valign="top">

- The Binomial distribution is a discrete distribution: internally
- functions like the <code class="computeroutput">cdf</code>
- and <code class="computeroutput">pdf</code> are treated
- "as if" they are continuous functions, but in reality the
- results returned from these functions only have meaning if an integer
- value is provided for the random variate argument.
- 
-
- The quantile function will by default return an integer result that
- has been rounded outwards. That is to say lower
- quantiles (where the probability is less than 0.5) are rounded downward,
- and upper quantiles (where the probability is greater than 0.5) are
- rounded upwards. This behaviour ensures that if an X% quantile is
- requested, then at least the requested coverage
- will be present in the central region, and no more than
- the requested coverage will be present in the tails.
- 
-
- This behaviour can be changed so that the quantile functions are
- rounded differently, or even return a real-valued result using <a class="link" href="../../../policy/pol_overview.html" title="Policy Overview">Policies</a>. It is
- strongly recommended that you read the tutorial <a class="link" href="../../../policy/pol_tutorial/understand_dis_quant.html" title="Understanding Quantiles of Discrete Distributions">Understanding
- Quantiles of Discrete Distributions</a> before using the quantile
- function on the Binomial distribution. The <a class="link" href="../../../policy/pol_ref/discrete_quant_ref.html" title="Discrete Quantile Policies">reference
- docs</a> describe how to change the rounding policy for these
- distributions.
- 
+ The Binomial distribution is a discrete distribution: internally functions
+ like the <code class="computeroutput">cdf</code> and <code class="computeroutput">pdf</code> are treated "as if"
+ they are continuous functions, but in reality the results returned
+ from these functions only have meaning if an integer value is provided
+ for the random variate argument.
+ 
+
+ The quantile function will by default return an integer result that
+ has been rounded outwards. That is to say lower
+ quantiles (where the probability is less than 0.5) are rounded downward,
+ and upper quantiles (where the probability is greater than 0.5) are
+ rounded upwards. This behaviour ensures that if an X% quantile is requested,
+ then at least the requested coverage will be present
+ in the central region, and no more than the requested
+ coverage will be present in the tails.
+ 
+
+ This behaviour can be changed so that the quantile functions are rounded
+ differently, or even return a real-valued result using <a class="link" href="../../../policy/pol_overview.html" title="Policy Overview">Policies</a>.
+ It is strongly recommended that you read the tutorial <a class="link" href="../../../policy/pol_tutorial/understand_dis_quant.html" title="Understanding Quantiles of Discrete Distributions">Understanding
+ Quantiles of Discrete Distributions</a> before using the quantile
+ function on the Binomial distribution. The <a class="link" href="../../../policy/pol_ref/discrete_quant_ref.html" title="Discrete Quantile Policies">reference
+ docs</a> describe how to change the rounding policy for these distributions.
+ 
</td></tr>
</table></div>
-
- 
<a name="math_toolkit.dist.dist_ref.dists.binomial_dist.member_functions"></a><h5>
-<a name="id1126248"></a>
+<a name="id997484"></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="id1126266"></a>
+<a name="id997502"></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 +183,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="id1126383"></a>
+<a name="id997619"></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 +199,7 @@
 was constructed.
 
<a name="math_toolkit.dist.dist_ref.dists.binomial_dist.lower_bound_on_the_success_fraction"></a><h6>
-<a name="id1126464"></a>
+<a name="id997700"></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 +305,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="id1127065"></a>
+<a name="id998153"></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 +383,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="id1127381"></a>
+<a name="id998469"></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 +425,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="id1127582"></a>
+<a name="id998670"></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 +473,7 @@
 Worked Example.</a>
 
<a name="math_toolkit.dist.dist_ref.dists.binomial_dist.non_member_accessors"></a><h5>
-<a name="id1127792"></a>
+<a name="id998880"></a>
 <a class="link" href="binomial_dist.html#math_toolkit.dist.dist_ref.dists.binomial_dist.non_member_accessors">Non-member
 Accessors</a>
 </h5>
@@ -620,7 +614,7 @@
 
 <code class="computeroutput">quantile(complement(binomial(n,
 p),
- P))</code>`
+ P))</code>
 
 </td>
</tr>
@@ -628,7 +622,7 @@
</table></div>
</div>
 <a name="math_toolkit.dist.dist_ref.dists.binomial_dist.examples"></a><h5>
-<a name="id1128348"></a>
+<a name="id999459"></a>
 <a class="link" href="binomial_dist.html#math_toolkit.dist.dist_ref.dists.binomial_dist.examples">Examples</a>
 </h5>

@@ -636,7 +630,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="id1128370"></a>
+<a name="id999481"></a>
 <a class="link" href="binomial_dist.html#math_toolkit.dist.dist_ref.dists.binomial_dist.accuracy">Accuracy</a>
 </h5>

@@ -646,7 +640,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="id1128398"></a>
+<a name="id999509"></a>
 <a class="link" href="binomial_dist.html#math_toolkit.dist.dist_ref.dists.binomial_dist.implementation">Implementation</a>
 </h5>

@@ -890,7 +884,7 @@
</tbody>
</table></div>
<a name="math_toolkit.dist.dist_ref.dists.binomial_dist.references"></a><h5>
-<a name="id1131533"></a>
+<a name="id1000559"></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">

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/cauchy_dist.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/cauchy_dist.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/cauchy_dist.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.dist_ref.dists.cauchy_dist"></a><a class="link" href="cauchy_dist.html" title="Cauchy-Lorentz Distribution"> Cauchy-Lorentz
+<a name="math_toolkit.dist.dist_ref.dists.cauchy_dist"></a><a class="link" href="cauchy_dist.html" title="Cauchy-Lorentz Distribution">Cauchy-Lorentz
 Distribution</a>
</h5></div></div></div>

@@ -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="id1132052"></a>
+<a name="id1001078"></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="id1132199"></a>
+<a name="id1002615"></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="id1132342"></a>
+<a name="id1002757"></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="id1132376"></a>
+<a name="id1002791"></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="id1132602"></a>
+<a name="id1003018"></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">

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/chi_squared_dist.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/chi_squared_dist.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/chi_squared_dist.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.dist_ref.dists.chi_squared_dist"></a><a class="link" href="chi_squared_dist.html" title="Chi Squared Distribution">
- Chi Squared Distribution</a>
+<a name="math_toolkit.dist.dist_ref.dists.chi_squared_dist"></a><a class="link" href="chi_squared_dist.html" title="Chi Squared Distribution">Chi
+ Squared Distribution</a>
</h5></div></div></div>


@@ -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="id1133168"></a>
+<a name="id1003583"></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="id1133783"></a>
+<a name="id1003914"></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="id1133886"></a>
+<a name="id1004017"></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="id1133912"></a>
+<a name="id1004044"></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="id1133936"></a>
+<a name="id1004068"></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="id1134233"></a>
+<a name="id1004364"></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">

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/exp_dist.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/exp_dist.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/exp_dist.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.dist_ref.dists.exp_dist"></a><a class="link" href="exp_dist.html" title="Exponential Distribution"> Exponential
+<a name="math_toolkit.dist.dist_ref.dists.exp_dist"></a><a class="link" href="exp_dist.html" title="Exponential Distribution">Exponential
 Distribution</a>
</h5></div></div></div>

@@ -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="id1134667"></a>
+<a name="id1006617"></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="id1134768"></a>
+<a name="id1006718"></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="id1134868"></a>
+<a name="id1006817"></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="id1134916"></a>
+<a name="id1006865"></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="id1135182"></a>
+<a name="id1007132"></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">

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/extreme_dist.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/extreme_dist.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/extreme_dist.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.dist_ref.dists.extreme_dist"></a><a class="link" href="extreme_dist.html" title="Extreme Value Distribution"> Extreme
+<a name="math_toolkit.dist.dist_ref.dists.extreme_dist"></a><a class="link" href="extreme_dist.html" title="Extreme Value Distribution">Extreme
 Value Distribution</a>
</h5></div></div></div>

@@ -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="id1135745"></a>
+<a name="id1007694"></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="id1135901"></a>
+<a name="id1007850"></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="id1136014"></a>
+<a name="id1007948"></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="id1136047"></a>
+<a name="id1007981"></a>
 <a class="link" href="extreme_dist.html#math_toolkit.dist.dist_ref.dists.extreme_dist.implementation">Implementation</a>
 </h5>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/f_dist.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/f_dist.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/f_dist.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.dist_ref.dists.f_dist"></a><a class="link" href="f_dist.html" title="F Distribution"> F Distribution</a>
+<a name="math_toolkit.dist.dist_ref.dists.f_dist"></a><a class="link" href="f_dist.html" title="F Distribution">F Distribution</a>
</h5></div></div></div>


@@ -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="id1136810"></a>
+<a name="id1008818"></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="id1136964"></a>
+<a name="id1008972"></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="id1137064"></a>
+<a name="id1009071"></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="id1137085"></a>
+<a name="id1009093"></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="id1137112"></a>
+<a name="id1009119"></a>
 <a class="link" href="f_dist.html#math_toolkit.dist.dist_ref.dists.f_dist.implementation">Implementation</a>
 </h5>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/gamma_dist.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/gamma_dist.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/gamma_dist.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 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="inverse_gamma_dist.html" title="Inverse Gamma 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,11 +20,11 @@
</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="inverse_gamma_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">
-<a name="math_toolkit.dist.dist_ref.dists.gamma_dist"></a><a class="link" href="gamma_dist.html" title="Gamma (and Erlang) Distribution"> Gamma
+<a name="math_toolkit.dist.dist_ref.dists.gamma_dist"></a><a class="link" href="gamma_dist.html" title="Gamma (and Erlang) Distribution">Gamma
 (and Erlang) Distribution</a>
</h5></div></div></div>

@@ -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="id1140041"></a>
+<a name="id1010174"></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="id1140186"></a>
+<a name="id1010319"></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="id1140283"></a>
+<a name="id1010417"></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="id1140322"></a>
+<a name="id1010455"></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>
@@ -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="inverse_gamma_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: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/hypergeometric_dist.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/hypergeometric_dist.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/hypergeometric_dist.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.dist_ref.dists.hypergeometric_dist"></a><a class="link" href="hypergeometric_dist.html" title="Hypergeometric Distribution">
- Hypergeometric Distribution</a>
+<a name="math_toolkit.dist.dist_ref.dists.hypergeometric_dist"></a><a class="link" href="hypergeometric_dist.html" title="Hypergeometric Distribution">Hypergeometric
+ Distribution</a>
</h5></div></div></div>


@@ -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="id1142226"></a>
+<a name="id1016383"></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="id1142405"></a>
+<a name="id1016562"></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="id1142555"></a>
+<a name="id1016712"></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="id1142789"></a>
+<a name="id1016946"></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="id1142813"></a>
+<a name="id1016970"></a>
 <a class="link" href="hypergeometric_dist.html#math_toolkit.dist.dist_ref.dists.hypergeometric_dist.implementation">Implementation</a>
 </h5>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/inverse_gamma_dist.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/inverse_gamma_dist.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/inverse_gamma_dist.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 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_chi_squared_dist.html" title="Inverse Chi Squared Distribution">
<link rel="next" href="hypergeometric_dist.html" title="Hypergeometric Distribution">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
@@ -20,12 +20,12 @@
</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="hypergeometric_dist.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="inverse_chi_squared_dist.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dists.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="hypergeometric_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">
-<a name="math_toolkit.dist.dist_ref.dists.inverse_gamma_dist"></a><a class="link" href="inverse_gamma_dist.html" title="Inverse Gamma Distribution">
- Inverse Gamma Distribution</a>
+<a name="math_toolkit.dist.dist_ref.dists.inverse_gamma_dist"></a><a class="link" href="inverse_gamma_dist.html" title="Inverse Gamma Distribution">Inverse
+ Gamma Distribution</a>
</h5></div></div></div>


@@ -53,8 +53,26 @@
</pre>

 The inverse_gamma distribution is a continuous probability distribution
- distribution of the reciprocal of a variable distributed according to
- the gamma distribution..
+ of the reciprocal of a variable distributed according to the gamma distribution.
+ 
+
+ The inverse_gamma distribution is used in Bayesian statistics.
+ 
+
+ See <a href="http://en.wikipedia.org/wiki/Inverse-gamma_distribution" target="_top">inverse
+ gamma distribution</a>.
+ 
+
+ <a href="http://rss.acs.unt.edu/Rdoc/library/pscl/html/igamma.html" target="_top">R
+ inverse gamma distribution functions</a>.
+ 
+
+ <a href="http://reference.wolfram.com/mathematica/ref/InverseGammaDistribution.html" target="_top">Wolfram
+ inverse gamma distribution</a>.
+ 
+
+ See also <a class="link" href="gamma_dist.html" title="Gamma (and Erlang) Distribution">Gamma
+ Distribution</a>.
 
<div class="note"><table border="0" summary="Note">
<tr>
@@ -64,16 +82,17 @@
<tr><td align="left" valign="top">

 In spite of potential confusion with the inverse gamma function, this
- distribution does provide the typedef:
+ distribution does provide the typedef:
 



-<pre class="programlisting">typedef inverse_gamma_distibution<double> gamma;</pre>
+<pre class="programlisting">typedef inverse_gamma_distribution<double> gamma;</pre>

 

- If you want a double precision gamma distribution you can use
+ If you want a <code class="computeroutput">double</code> precision
+ gamma distribution you can use
 


@@ -81,42 +100,44 @@
<pre class="programlisting">boost::math::inverse_gamma_distribution<></pre>

 
+
+ or you can write <code class="computeroutput">inverse_gamma
+ my_ig(2, 3);</code>
+ 
</td></tr>
</table></div>

- For shape parameter k and scale parameter θ it is
- defined by the probability density function:
+ For shape parameter α and scale parameter β, it is defined by the probability
+ density function (PDF):
 

- <img src="../../../../../equations/inverse_gamma_dist_ref1.png">
+   f(x;α, β) = βα * (1/x) α+1 exp(-β/x) / Γ(α)
 

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

- <img src="../../../../../equations/inverse_gamma_dist_ref2.png">
+   F(x;α, β) = Γ(α, β/x) / Γ(α)
 

- The following two graphs illustrate how the PDF of the gamma distribution
- varies as the parameters vary:
+ The following graphs illustrate how the PDF and CDF of the inverse gamma
+ distribution varies as the parameters vary:
 

- <img src="../../../../../graphs/inverse_gamma1_pdf.png" align="middle">
+ <img src="../../../../../graphs/inverse_gamma_pdf.png" align="middle">
 

- <img src="../../../../../graphs/inverse_gamma2_pdf.png" align="middle">
+ <img src="../../../../../graphs/inverse_gamma_cdf.png" align="middle">
 
<a name="math_toolkit.dist.dist_ref.dists.inverse_gamma_dist.member_functions"></a><h5>
-<a name="id1141123"></a>
+<a name="id1014519"></a>
 <a class="link" href="inverse_gamma_dist.html#math_toolkit.dist.dist_ref.dists.inverse_gamma_dist.member_functions">Member
 Functions</a>
 </h5>
-<pre class="programlisting">inverse_gamma_distribution(RealType shape, RealType scale = 1);
+<pre class="programlisting">inverse_gamma_distribution(RealType shape = 1, RealType scale = 1);
</pre>

- Constructs a gamma distribution with shape shape
- and scale scale.
+ Constructs an inverse gamma distribution with shape α and scale β.
 

 Requires that the shape and scale parameters are greater than zero, otherwise
@@ -125,15 +146,15 @@
<pre class="programlisting">RealType shape()const;
</pre>

- Returns the shape parameter of this distribution.
+ Returns the α shape parameter of this inverse gamma distribution.
 
<pre class="programlisting">RealType scale()const;
</pre>

- Returns the scale parameter of this distribution.
+ Returns the β scale parameter of this inverse gamma distribution.
 
<a name="math_toolkit.dist.dist_ref.dists.inverse_gamma_dist.non_member_accessors"></a><h5>
-<a name="id1141266"></a>
+<a name="id1014656"></a>
 <a class="link" href="inverse_gamma_dist.html#math_toolkit.dist.dist_ref.dists.inverse_gamma_dist.non_member_accessors">Non-member
 Accessors</a>
 </h5>
@@ -150,10 +171,20 @@
 <a class="link" href="../nmp.html#math.dist.range">range</a> and <a class="link" href="../nmp.html#math.dist.support">support</a>.
 

- The domain of the random variable is [0,+∞].
+ The domain of the random variate is [0,+∞].
 
+<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">
+ Unlike some definitions, this implementation supports a random variate
+ equal to zero as a special case, returning zero for pdf and cdf.
+ </td></tr>
+</table></div>
<a name="math_toolkit.dist.dist_ref.dists.inverse_gamma_dist.accuracy"></a><h5>
-<a name="id1141366"></a>
+<a name="id1014763"></a>
 <a class="link" href="inverse_gamma_dist.html#math_toolkit.dist.dist_ref.dists.inverse_gamma_dist.accuracy">Accuracy</a>
 </h5>

@@ -163,18 +194,17 @@
 and their inverses <a class="link" href="../../../special/sf_gamma/igamma_inv.html" title="Incomplete Gamma Function Inverses">gamma_p_inv</a>
 and <a class="link" href="../../../special/sf_gamma/igamma_inv.html" title="Incomplete Gamma Function Inverses">gamma_q_inv</a>:
 refer to the accuracy data for those functions for more information.
- But in general results are accurate to a few epsilon, >14 decimnal
- digits accuracy for 64-but double..
+ But in general, inverse_gamma results are accurate to a few epsilon,
+ >14 decimal digits accuracy for 64-bit double.
 
<a name="math_toolkit.dist.dist_ref.dists.inverse_gamma_dist.implementation"></a><h5>
-<a name="id1141404"></a>
+<a name="id1014801"></a>
 <a class="link" href="inverse_gamma_dist.html#math_toolkit.dist.dist_ref.dists.inverse_gamma_dist.implementation">Implementation</a>
 </h5>

- In the following table k is the shape parameter
- of the distribution, θ is its scale parameter, x is
- the random variate, p is the probability and q
- = 1-p.
+ In the following table α is the shape parameter of the distribution, α is
+ its scale parameter, x is the random variate, p
+ is the probability and q = 1-p.
 
<div class="informaltable"><table class="table">
<colgroup>
@@ -202,8 +232,8 @@
 </td>
<td>
 
- Using the relation: pdf = <a class="link" href="../../../special/sf_gamma/gamma_derivatives.html" title="Derivative of the Incomplete Gamma Function">gamma_p_derivative</a>(k,
- x / θ) / θ
+ Using the relation: pdf = <a class="link" href="../../../special/sf_gamma/gamma_derivatives.html" title="Derivative of the Incomplete Gamma Function">gamma_p_derivative</a>(α,
+ β/ x, β) / x * x
 
 </td>
</tr>
@@ -215,8 +245,8 @@
 </td>
<td>
 
- Using the relation: p = <a class="link" href="../../../special/sf_gamma/igamma.html" title="Incomplete Gamma Functions">gamma_p</a>(k,
- x / θ)
+ Using the relation: p = <a class="link" href="../../../special/sf_gamma/igamma.html" title="Incomplete Gamma Functions">gamma_q</a>(kα,
+ β / x)
 
 </td>
</tr>
@@ -228,8 +258,8 @@
 </td>
<td>
 
- Using the relation: q = <a class="link" href="../../../special/sf_gamma/igamma.html" title="Incomplete Gamma Functions">gamma_q</a>(k,
- x / θ)
+ Using the relation: q = <a class="link" href="../../../special/sf_gamma/igamma.html" title="Incomplete Gamma Functions">gamma_p</a>(α,
+ β / x)
 
 </td>
</tr>
@@ -241,7 +271,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_q_inv</a>(α,
 p)
 
 </td>
@@ -254,8 +284,32 @@
 </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,
- p)
+ Using the relation: x = α / <a class="link" href="../../../special/sf_gamma/igamma_inv.html" title="Incomplete Gamma Function Inverses">gamma_p_inv</a>(α,
+ q)
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ mode
+ 
+ </td>
+<td>
+ 
+ β / (α + 1)
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ median
+ 
+ </td>
+<td>
+ 
+ no analytic equation is known, but is evaluated as quantile(0.5)
 
 </td>
</tr>
@@ -267,7 +321,7 @@
 </td>
<td>
 
- kθ
+ β / (α - 1) for α > 1, else a <a class="link" href="../../../main_overview/error_handling.html#domain_error">domain_error</a>
 
 </td>
</tr>
@@ -279,19 +333,31 @@
 </td>
<td>
 
- kθ2
+ (β * β) / (α - 1) * (α - 1) * (α - 2) for α >2, else a <a class="link" href="../../../main_overview/error_handling.html#domain_error">domain_error</a>
 
 </td>
</tr>
<tr>
<td>
 
- mode
+ skewness
+ 
+ </td>
+<td>
+ 
+ 4 * sqrt (α -2) / (α -3) for α >3, else a <a class="link" href="../../../main_overview/error_handling.html#domain_error">domain_error</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ kurtosis_excess
 
 </td>
<td>
 
- otherwise a <a class="link" href="../../../main_overview/error_handling.html#domain_error">domain_error</a>
+ (30 * α - 66) / (α-3)*(α - 4)) for α >4, else a <a class="link" href="../../../main_overview/error_handling.html#domain_error">domain_error</a>
 
 </td>
</tr>
@@ -310,7 +376,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="hypergeometric_dist.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="inverse_chi_squared_dist.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../dists.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="hypergeometric_dist.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/laplace_dist.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/laplace_dist.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/laplace_dist.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.dist_ref.dists.laplace_dist"></a><a class="link" href="laplace_dist.html" title="Laplace Distribution"> Laplace
+<a name="math_toolkit.dist.dist_ref.dists.laplace_dist"></a><a class="link" href="laplace_dist.html" title="Laplace Distribution">Laplace
 Distribution</a>
</h5></div></div></div>

@@ -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="id1143540"></a>
+<a name="id1017697"></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="id1143702"></a>
+<a name="id1018124"></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="id1143799"></a>
+<a name="id1018221"></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="id1143819"></a>
+<a name="id1018240"></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="id1144140"></a>
+<a name="id1018562"></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">

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/logistic_dist.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/logistic_dist.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/logistic_dist.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.dist_ref.dists.logistic_dist"></a><a class="link" href="logistic_dist.html" title="Logistic Distribution">
- Logistic Distribution</a>
+<a name="math_toolkit.dist.dist_ref.dists.logistic_dist"></a><a class="link" href="logistic_dist.html" title="Logistic Distribution">Logistic
+ Distribution</a>
</h5></div></div></div>


@@ -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="id1144752"></a>
+<a name="id1019051"></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="id1144917"></a>
+<a name="id1019217"></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="id1145067"></a>
+<a name="id1019367"></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="id1145122"></a>
+<a name="id1019422"></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">

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/lognormal_dist.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/lognormal_dist.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/lognormal_dist.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.dist_ref.dists.lognormal_dist"></a><a class="link" href="lognormal_dist.html" title="Log Normal Distribution">
- Log Normal Distribution</a>
+<a name="math_toolkit.dist.dist_ref.dists.lognormal_dist"></a><a class="link" href="lognormal_dist.html" title="Log Normal Distribution">Log
+ Normal Distribution</a>
</h5></div></div></div>


@@ -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="id1145872"></a>
+<a name="id1020172"></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="id1146032"></a>
+<a name="id1021452"></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="id1146132"></a>
+<a name="id1021552"></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="id1146159"></a>
+<a name="id1021580"></a>
 <a class="link" href="lognormal_dist.html#math_toolkit.dist.dist_ref.dists.lognormal_dist.implementation">Implementation</a>
 </h5>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/nc_beta_dist.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/nc_beta_dist.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/nc_beta_dist.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.dist_ref.dists.nc_beta_dist"></a><a class="link" href="nc_beta_dist.html" title="Noncentral Beta Distribution"> Noncentral
+<a name="math_toolkit.dist.dist_ref.dists.nc_beta_dist"></a><a class="link" href="nc_beta_dist.html" title="Noncentral Beta Distribution">Noncentral
 Beta Distribution</a>
</h5></div></div></div>

@@ -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="id1153748"></a>
+<a name="id1026941"></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="id1153934"></a>
+<a name="id1027127"></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="id1154035"></a>
+<a name="id1027228"></a>
 <a class="link" href="nc_beta_dist.html#math_toolkit.dist.dist_ref.dists.nc_beta_dist.accuracy">Accuracy</a>
 </h5>

@@ -295,7 +295,7 @@
 functions are broadly similar.
 
<a name="math_toolkit.dist.dist_ref.dists.nc_beta_dist.tests"></a><h5>
-<a name="id1155315"></a>
+<a name="id1027470"></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="id1155339"></a>
+<a name="id1027494"></a>
 <a class="link" href="nc_beta_dist.html#math_toolkit.dist.dist_ref.dists.nc_beta_dist.implementation">Implementation</a>
 </h5>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/nc_chi_squared_dist.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/nc_chi_squared_dist.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/nc_chi_squared_dist.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.dist_ref.dists.nc_chi_squared_dist"></a><a class="link" href="nc_chi_squared_dist.html" title="Noncentral Chi-Squared Distribution">
- Noncentral Chi-Squared Distribution</a>
+<a name="math_toolkit.dist.dist_ref.dists.nc_chi_squared_dist"></a><a class="link" href="nc_chi_squared_dist.html" title="Noncentral Chi-Squared Distribution">Noncentral
+ Chi-Squared Distribution</a>
</h5></div></div></div>


@@ -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="id1156358"></a>
+<a name="id1028513"></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="id1157259"></a>
+<a name="id1031241"></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="id1157359"></a>
+<a name="id1031340"></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="id1157386"></a>
+<a name="id1031368"></a>
 <a class="link" href="nc_chi_squared_dist.html#math_toolkit.dist.dist_ref.dists.nc_chi_squared_dist.accuracy">Accuracy</a>
 </h5>

@@ -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="id1158786"></a>
+<a name="id1031628"></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="id1158805"></a>
+<a name="id1031648"></a>
 <a class="link" href="nc_chi_squared_dist.html#math_toolkit.dist.dist_ref.dists.nc_chi_squared_dist.implementation">Implementation</a>
 </h5>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/nc_f_dist.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/nc_f_dist.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/nc_f_dist.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.dist_ref.dists.nc_f_dist"></a><a class="link" href="nc_f_dist.html" title="Noncentral F Distribution"> Noncentral
+<a name="math_toolkit.dist.dist_ref.dists.nc_f_dist"></a><a class="link" href="nc_f_dist.html" title="Noncentral F Distribution">Noncentral
 F Distribution</a>
</h5></div></div></div>

@@ -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="id1159658"></a>
+<a name="id1032501"></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="id1159846"></a>
+<a name="id1032689"></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="id1159946"></a>
+<a name="id1032789"></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="id1159970"></a>
+<a name="id1032813"></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="id1159994"></a>
+<a name="id1032837"></a>
 <a class="link" href="nc_f_dist.html#math_toolkit.dist.dist_ref.dists.nc_f_dist.implementation">Implementation</a>
 </h5>

@@ -234,8 +234,6 @@
 
 y = x * v1 / v2
 
- 
- 
 </td>
</tr>
<tr>
@@ -258,8 +256,6 @@
 
 y = x * v1 / v2
 
- 
- 
 </td>
</tr>
<tr>
@@ -290,8 +286,6 @@
 
 is the noncentral beta quantile.
 
- 
- 
 </td>
</tr>
<tr>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/nc_t_dist.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/nc_t_dist.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/nc_t_dist.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.dist_ref.dists.nc_t_dist"></a><a class="link" href="nc_t_dist.html" title="Noncentral T Distribution"> Noncentral
+<a name="math_toolkit.dist.dist_ref.dists.nc_t_dist"></a><a class="link" href="nc_t_dist.html" title="Noncentral T Distribution">Noncentral
 T Distribution</a>
</h5></div></div></div>

@@ -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="id1162056"></a>
+<a name="id1034070"></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="id1162195"></a>
+<a name="id1034209"></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="id1162295"></a>
+<a name="id1034308"></a>
 <a class="link" href="nc_t_dist.html#math_toolkit.dist.dist_ref.dists.nc_t_dist.accuracy">Accuracy</a>
 </h5>

@@ -255,7 +255,7 @@
 epsilon.
 
<a name="math_toolkit.dist.dist_ref.dists.nc_t_dist.tests"></a><h5>
-<a name="id1162495"></a>
+<a name="id1034509"></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="id1162514"></a>
+<a name="id1034528"></a>
 <a class="link" href="nc_t_dist.html#math_toolkit.dist.dist_ref.dists.nc_t_dist.implementation">Implementation</a>
 </h5>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/negative_binomial_dist.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/negative_binomial_dist.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/negative_binomial_dist.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.dist_ref.dists.negative_binomial_dist"></a><a class="link" href="negative_binomial_dist.html" title="Negative Binomial Distribution">
- Negative Binomial Distribution</a>
+<a name="math_toolkit.dist.dist_ref.dists.negative_binomial_dist"></a><a class="link" href="negative_binomial_dist.html" title="Negative Binomial Distribution">Negative
+ Binomial Distribution</a>
</h5></div></div></div>


@@ -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="id1149605"></a>
+<a name="id1022727"></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,10 +158,8 @@
 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)))
 
-
- 
<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>
@@ -169,43 +167,40 @@
</tr>
<tr><td align="left" valign="top">

- The Negative Binomial distribution is a discrete distribution: internally
- functions like the <code class="computeroutput">cdf</code>
- and <code class="computeroutput">pdf</code> are treated
- "as if" they are continuous functions, but in reality the
- results returned from these functions only have meaning if an integer
- value is provided for the random variate argument.
- 
-
- The quantile function will by default return an integer result that
- has been rounded outwards. That is to say lower
- quantiles (where the probability is less than 0.5) are rounded downward,
- and upper quantiles (where the probability is greater than 0.5) are
- rounded upwards. This behaviour ensures that if an X% quantile is
- requested, then at least the requested coverage
- will be present in the central region, and no more than
- the requested coverage will be present in the tails.
- 
-
- This behaviour can be changed so that the quantile functions are
- rounded differently, or even return a real-valued result using <a class="link" href="../../../policy/pol_overview.html" title="Policy Overview">Policies</a>. It is
- strongly recommended that you read the tutorial <a class="link" href="../../../policy/pol_tutorial/understand_dis_quant.html" title="Understanding Quantiles of Discrete Distributions">Understanding
- Quantiles of Discrete Distributions</a> before using the quantile
- function on the Negative Binomial distribution. The <a class="link" href="../../../policy/pol_ref/discrete_quant_ref.html" title="Discrete Quantile Policies">reference
- docs</a> describe how to change the rounding policy for these
- distributions.
- 
+ The Negative Binomial distribution is a discrete distribution: internally
+ functions like the <code class="computeroutput">cdf</code>
+ and <code class="computeroutput">pdf</code> are treated
+ "as if" they are continuous functions, but in reality the
+ results returned from these functions only have meaning if an integer
+ value is provided for the random variate argument.
+ 
+
+ The quantile function will by default return an integer result that
+ has been rounded outwards. That is to say lower
+ quantiles (where the probability is less than 0.5) are rounded downward,
+ and upper quantiles (where the probability is greater than 0.5) are
+ rounded upwards. This behaviour ensures that if an X% quantile is requested,
+ then at least the requested coverage will be present
+ in the central region, and no more than the requested
+ coverage will be present in the tails.
+ 
+
+ This behaviour can be changed so that the quantile functions are rounded
+ differently, or even return a real-valued result using <a class="link" href="../../../policy/pol_overview.html" title="Policy Overview">Policies</a>.
+ It is strongly recommended that you read the tutorial <a class="link" href="../../../policy/pol_tutorial/understand_dis_quant.html" title="Understanding Quantiles of Discrete Distributions">Understanding
+ Quantiles of Discrete Distributions</a> before using the quantile
+ function on the Negative Binomial distribution. The <a class="link" href="../../../policy/pol_ref/discrete_quant_ref.html" title="Discrete Quantile Policies">reference
+ docs</a> describe how to change the rounding policy for these distributions.
+ 
</td></tr>
</table></div>
-
- 
<a name="math_toolkit.dist.dist_ref.dists.negative_binomial_dist.member_functions"></a><h5>
-<a name="id1149715"></a>
+<a name="id1022835"></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="id1149729"></a>
+<a name="id1022848"></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 +216,7 @@
 <= 1</code>.
 
<a name="math_toolkit.dist.dist_ref.dists.negative_binomial_dist.accessors"></a><h6>
-<a name="id1149838"></a>
+<a name="id1022957"></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 +232,7 @@
 was constructed.
 
<a name="math_toolkit.dist.dist_ref.dists.negative_binomial_dist.lower_bound_on_parameter_p"></a><h6>
-<a name="id1149923"></a>
+<a name="id1023042"></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 +293,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="id1150191"></a>
+<a name="id1023310"></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 +353,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="id1150455"></a>
+<a name="id1023797"></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 +404,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="id1150679"></a>
+<a name="id1024022"></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 +452,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="id1150911"></a>
+<a name="id1024253"></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>
@@ -606,7 +601,7 @@
</table></div>
</div>
 <a name="math_toolkit.dist.dist_ref.dists.negative_binomial_dist.accuracy"></a><h5>
-<a name="id1152335"></a>
+<a name="id1024767"></a>
 <a class="link" href="negative_binomial_dist.html#math_toolkit.dist.dist_ref.dists.negative_binomial_dist.accuracy">Accuracy</a>
 </h5>

@@ -616,7 +611,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="id1152362"></a>
+<a name="id1024793"></a>
 <a class="link" href="negative_binomial_dist.html#math_toolkit.dist.dist_ref.dists.negative_binomial_dist.implementation">Implementation</a>
 </h5>

@@ -827,8 +822,6 @@
 
 </td>
<td>
- 
- 
 </td>
</tr>
<tr>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/normal_dist.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/normal_dist.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/normal_dist.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.dist_ref.dists.normal_dist"></a><a class="link" href="normal_dist.html" title="Normal (Gaussian) Distribution"> Normal
+<a name="math_toolkit.dist.dist_ref.dists.normal_dist"></a><a class="link" href="normal_dist.html" title="Normal (Gaussian) Distribution">Normal
 (Gaussian) Distribution</a>
</h5></div></div></div>

@@ -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="id1163228"></a>
+<a name="id1035242"></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="id1163424"></a>
+<a name="id1035438"></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="id1163521"></a>
+<a name="id1035918"></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="id1163546"></a>
+<a name="id1035943"></a>
 <a class="link" href="normal_dist.html#math_toolkit.dist.dist_ref.dists.normal_dist.implementation">Implementation</a>
 </h5>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/pareto.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/pareto.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/pareto.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,8 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.dist_ref.dists.pareto"></a><a class="link" href="pareto.html" title="Pareto Distribution"> Pareto
- Distribution</a>
+<a name="math_toolkit.dist.dist_ref.dists.pareto"></a><a class="link" href="pareto.html" title="Pareto Distribution">Pareto Distribution</a>
</h5></div></div></div>


@@ -64,7 +63,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 +86,12 @@
 <img src="../../../../../graphs/pareto_pdf2.png" align="middle">
 
<a name="math_toolkit.dist.dist_ref.dists.pareto.related_distributions"></a><h5>
-<a name="id1164564"></a>
+<a name="id1036727"></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="id1164582"></a>
+<a name="id1036745"></a>
 <a class="link" href="pareto.html#math_toolkit.dist.dist_ref.dists.pareto.member_functions">Member
 Functions</a>
 </h5>
@@ -118,7 +117,7 @@
 Returns the shape parameter of this distribution.
 
<a name="math_toolkit.dist.dist_ref.dists.pareto.non_member_accessors"></a><h5>
-<a name="id1164750"></a>
+<a name="id1036913"></a>
 <a class="link" href="pareto.html#math_toolkit.dist.dist_ref.dists.pareto.non_member_accessors">Non-member
 Accessors</a>
 </h5>
@@ -138,7 +137,7 @@
 The supported domain of the random variable is [scale, ∞].
 
<a name="math_toolkit.dist.dist_ref.dists.pareto.accuracy"></a><h5>
-<a name="id1164849"></a>
+<a name="id1037012"></a>
 <a class="link" href="pareto.html#math_toolkit.dist.dist_ref.dists.pareto.accuracy">Accuracy</a>
 </h5>

@@ -151,12 +150,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="id1164887"></a>
+<a name="id1037050"></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 +197,7 @@
 </td>
<td>
 
- Using the relation: cdf p = 1 - (β / x)α
+ Using the relation: cdf p = 1 - (β / x)α
 
 </td>
</tr>
@@ -210,7 +209,7 @@
 </td>
<td>
 
- Using the relation: q = 1 - p = -(β / x)α
+ Using the relation: q = 1 - p = -(β / x)α
 
 </td>
</tr>
@@ -319,7 +318,7 @@
</tbody>
</table></div>
<a name="math_toolkit.dist.dist_ref.dists.pareto.references"></a><h5>
-<a name="id1165194"></a>
+<a name="id1037357"></a>
 <a class="link" href="pareto.html#math_toolkit.dist.dist_ref.dists.pareto.references">References</a>
 </h5>
<div class="itemizedlist"><ul type="disc">

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/poisson_dist.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/poisson_dist.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/poisson_dist.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.dist_ref.dists.poisson_dist"></a><a class="link" href="poisson_dist.html" title="Poisson Distribution"> Poisson
+<a name="math_toolkit.dist.dist_ref.dists.poisson_dist"></a><a class="link" href="poisson_dist.html" title="Poisson Distribution">Poisson
 Distribution</a>
</h5></div></div></div>

@@ -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.
 
@@ -82,8 +82,6 @@

 <img src="../../../../../graphs/poisson_pdf_1.png" align="middle">
 
-
- 
<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>
@@ -91,38 +89,34 @@
</tr>
<tr><td align="left" valign="top">

- The Poisson distribution is a discrete distribution: internally functions
- like the <code class="computeroutput">cdf</code> and
- <code class="computeroutput">pdf</code> are treated "as
- if" they are continuous functions, but in reality the results
- returned from these functions only have meaning if an integer value
- is provided for the random variate argument.
- 
-
- The quantile function will by default return an integer result that
- has been rounded outwards. That is to say lower
- quantiles (where the probability is less than 0.5) are rounded downward,
- and upper quantiles (where the probability is greater than 0.5) are
- rounded upwards. This behaviour ensures that if an X% quantile is
- requested, then at least the requested coverage
- will be present in the central region, and no more than
- the requested coverage will be present in the tails.
- 
-
- This behaviour can be changed so that the quantile functions are
- rounded differently, or even return a real-valued result using <a class="link" href="../../../policy/pol_overview.html" title="Policy Overview">Policies</a>. It is
- strongly recommended that you read the tutorial <a class="link" href="../../../policy/pol_tutorial/understand_dis_quant.html" title="Understanding Quantiles of Discrete Distributions">Understanding
- Quantiles of Discrete Distributions</a> before using the quantile
- function on the Poisson distribution. The <a class="link" href="../../../policy/pol_ref/discrete_quant_ref.html" title="Discrete Quantile Policies">reference
- docs</a> describe how to change the rounding policy for these
- distributions.
- 
+ The Poisson distribution is a discrete distribution: internally functions
+ like the <code class="computeroutput">cdf</code> and <code class="computeroutput">pdf</code> are treated "as if"
+ they are continuous functions, but in reality the results returned
+ from these functions only have meaning if an integer value is provided
+ for the random variate argument.
+ 
+
+ The quantile function will by default return an integer result that
+ has been rounded outwards. That is to say lower
+ quantiles (where the probability is less than 0.5) are rounded downward,
+ and upper quantiles (where the probability is greater than 0.5) are
+ rounded upwards. This behaviour ensures that if an X% quantile is requested,
+ then at least the requested coverage will be present
+ in the central region, and no more than the requested
+ coverage will be present in the tails.
+ 
+
+ This behaviour can be changed so that the quantile functions are rounded
+ differently, or even return a real-valued result using <a class="link" href="../../../policy/pol_overview.html" title="Policy Overview">Policies</a>.
+ It is strongly recommended that you read the tutorial <a class="link" href="../../../policy/pol_tutorial/understand_dis_quant.html" title="Understanding Quantiles of Discrete Distributions">Understanding
+ Quantiles of Discrete Distributions</a> before using the quantile
+ function on the Poisson distribution. The <a class="link" href="../../../policy/pol_ref/discrete_quant_ref.html" title="Discrete Quantile Policies">reference
+ docs</a> describe how to change the rounding policy for these distributions.
+ 
</td></tr>
</table></div>
-
- 
<a name="math_toolkit.dist.dist_ref.dists.poisson_dist.member_functions"></a><h5>
-<a name="id1165727"></a>
+<a name="id1037887"></a>
 <a class="link" href="poisson_dist.html#math_toolkit.dist.dist_ref.dists.poisson_dist.member_functions">Member
 Functions</a>
 </h5>
@@ -137,7 +131,7 @@
 Returns the mean of this distribution.
 
<a name="math_toolkit.dist.dist_ref.dists.poisson_dist.non_member_accessors"></a><h5>
-<a name="id1165815"></a>
+<a name="id1037976"></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 +151,7 @@
 The domain of the random variable is [0, ∞].
 
<a name="math_toolkit.dist.dist_ref.dists.poisson_dist.accuracy"></a><h5>
-<a name="id1165913"></a>
+<a name="id1040284"></a>
 <a class="link" href="poisson_dist.html#math_toolkit.dist.dist_ref.dists.poisson_dist.accuracy">Accuracy</a>
 </h5>

@@ -171,11 +165,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="id1165941"></a>
+<a name="id1040313"></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.

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/rayleigh.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/rayleigh.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/rayleigh.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.dist_ref.dists.rayleigh"></a><a class="link" href="rayleigh.html" title="Rayleigh Distribution"> Rayleigh
+<a name="math_toolkit.dist.dist_ref.dists.rayleigh"></a><a class="link" href="rayleigh.html" title="Rayleigh Distribution">Rayleigh
 Distribution</a>
</h5></div></div></div>

@@ -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="id1168324"></a>
+<a name="id1041034"></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="id1168375"></a>
+<a name="id1041086"></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="id1168478"></a>
+<a name="id1041189"></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="id1168578"></a>
+<a name="id1041289"></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="id1168612"></a>
+<a name="id1041322"></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="id1168948"></a>
+<a name="id1041658"></a>
 <a class="link" href="rayleigh.html#math_toolkit.dist.dist_ref.dists.rayleigh.references">References</a>
 </h5>
<div class="itemizedlist"><ul type="disc">

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/students_t_dist.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/students_t_dist.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/students_t_dist.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.dist_ref.dists.students_t_dist"></a><a class="link" href="students_t_dist.html" title="Students t Distribution">
- Students t Distribution</a>
+<a name="math_toolkit.dist.dist_ref.dists.students_t_dist"></a><a class="link" href="students_t_dist.html" title="Students t Distribution">Students
+ t Distribution</a>
</h5></div></div></div>


@@ -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="id1169528"></a>
+<a name="id1042239"></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="id1169819"></a>
+<a name="id1042827"></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="id1169918"></a>
+<a name="id1042927"></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="id1169945"></a>
+<a name="id1042953"></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="id1169976"></a>
+<a name="id1042984"></a>
 <a class="link" href="students_t_dist.html#math_toolkit.dist.dist_ref.dists.students_t_dist.implementation">Implementation</a>
 </h5>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/triangular_dist.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/triangular_dist.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/triangular_dist.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.dist_ref.dists.triangular_dist"></a><a class="link" href="triangular_dist.html" title="Triangular Distribution">
- Triangular Distribution</a>
+<a name="math_toolkit.dist.dist_ref.dists.triangular_dist"></a><a class="link" href="triangular_dist.html" title="Triangular Distribution">Triangular
+ Distribution</a>
</h5></div></div></div>


@@ -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="id1171227"></a>
+<a name="id1044014"></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="id1171445"></a>
+<a name="id1044232"></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="id1171545"></a>
+<a name="id1044332"></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="id1171566"></a>
+<a name="id1044353"></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="id1171907"></a>
+<a name="id1044694"></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">

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/uniform_dist.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/uniform_dist.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/uniform_dist.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.dist_ref.dists.uniform_dist"></a><a class="link" href="uniform_dist.html" title="Uniform Distribution"> Uniform
+<a name="math_toolkit.dist.dist_ref.dists.uniform_dist"></a><a class="link" href="uniform_dist.html" title="Uniform Distribution">Uniform
 Distribution</a>
</h5></div></div></div>

@@ -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="id1173974"></a>
+<a name="id1046817"></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="id1174140"></a>
+<a name="id1046982"></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="id1174244"></a>
+<a name="id1047087"></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="id1174263"></a>
+<a name="id1047106"></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="id1174542"></a>
+<a name="id1048477"></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">

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/weibull.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/weibull.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/dists/weibull.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.dist_ref.dists.weibull"></a><a class="link" href="weibull.html" title="Weibull Distribution"> Weibull
+<a name="math_toolkit.dist.dist_ref.dists.weibull"></a><a class="link" href="weibull.html" title="Weibull Distribution">Weibull
 Distribution</a>
</h5></div></div></div>

@@ -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="id1172501"></a>
+<a name="id1045506"></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="id1172543"></a>
+<a name="id1045547"></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="id1172701"></a>
+<a name="id1045706"></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="id1172801"></a>
+<a name="id1045805"></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="id1173003"></a>
+<a name="id1045846"></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="id1173331"></a>
+<a name="id1046174"></a>
 <a class="link" href="weibull.html#math_toolkit.dist.dist_ref.dists.weibull.references">References</a>
 </h5>
<div class="itemizedlist"><ul type="disc">

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/nmp.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/nmp.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/dist_ref/nmp.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,12 +24,12 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.dist.dist_ref.nmp"></a><a class="link" href="nmp.html" title="Non-Member Properties"> Non-Member Properties</a>
+<a name="math_toolkit.dist.dist_ref.nmp"></a><a class="link" href="nmp.html" title="Non-Member Properties">Non-Member Properties</a>
</h4></div></div></div>

 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="id1115255"></a>
+<a name="id984327"></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="id1115480"></a>
+<a name="id984552"></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="id1116009"></a>
+<a name="id984888"></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="id1116179"></a>
+<a name="id985058"></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="id1116469"></a>
+<a name="id985347"></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="id1116651"></a>
+<a name="id986171"></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="id1116833"></a>
+<a name="id986353"></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="id1116951"></a>
+<a name="id986471"></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="id1117060"></a>
+<a name="id986580"></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="id1117175"></a>
+<a name="id986695"></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="id1117345"></a>
- <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp.range">range</a>
+<a name="id986864"></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="id1117480"></a>
+<a name="id987000"></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="id1117703"></a>
+<a name="id987223"></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="id1118659"></a>
+<a name="id987564"></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="id1118779"></a>
+<a name="id987684"></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="id1118923"></a>
+<a name="id987828"></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="id1119042"></a>
+<a name="id987947"></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="id1119161"></a>
+<a name="id988066"></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="id1119368"></a>
+<a name="id988273"></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="id1119553"></a>
+<a name="id989745"></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="id1119583"></a>
+<a name="id989775"></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="id1119608"></a>
+<a name="id989800"></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="id1119636"></a>
+<a name="id989828"></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="id1119666"></a>
+<a name="id989858"></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="id1119704"></a>
+<a name="id989896"></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="id1119730"></a>
+<a name="id989921"></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="id1119756"></a>
+<a name="id989948"></a>
 <a class="link" href="nmp.html#math_toolkit.dist.dist_ref.nmp.survival_function">Survival
 Function</a>
 </h5>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/future.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/future.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/future.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,10 +24,10 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.dist.future"></a><a class="link" href="future.html" title="Extras/Future Directions"> Extras/Future Directions</a>
+<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="id1176186"></a>
+<a name="id1049575"></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="id1176351"></a>
+<a name="id1049740"></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="id1176560"></a>
+<a name="id1049948"></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="id1176722"></a>
+<a name="id1050110"></a>
 <a class="link" href="future.html#math_toolkit.dist.future.integration_with_statistical_accumulators">Integration
 With Statistical Accumulators</a>
 </h5>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,112 +24,110 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.dist.stat_tut"></a><a class="link" href="stat_tut.html" title="Statistical Distributions Tutorial"> Statistical Distributions
+<a name="math_toolkit.dist.stat_tut"></a><a class="link" href="stat_tut.html" title="Statistical Distributions Tutorial">Statistical Distributions
 Tutorial</a>
</h3></div></div></div>
<div class="toc"><dl>
-<dt> Overview of Distributions</dt>
+<dt>Overview of Distributions</dt>
<dd><dl>
-<dt><a href="stat_tut/overview/headers.html"> Headers
+<dt><a href="stat_tut/overview/headers.html">Headers
 and Namespaces</a></dt>
-<dt><a href="stat_tut/overview/objects.html"> Distributions
+<dt><a href="stat_tut/overview/objects.html">Distributions
 are Objects</a></dt>
-<dt><a href="stat_tut/overview/generic.html"> Generic
+<dt><a href="stat_tut/overview/generic.html">Generic
 operations common to all distributions are non-member functions</a></dt>
-<dt><a href="stat_tut/overview/complements.html">
- Complements are supported too - and when to use them</a></dt>
-<dt><a href="stat_tut/overview/parameters.html">
- Parameters can be calculated</a></dt>
-<dt> Summary</dt>
-</dl></dd>
-<dt> Worked Examples</dt>
-<dd><dl>
-<dt><a href="stat_tut/weg/dist_construct_eg.html">
- Distribution Construction Example</a></dt>
-<dt><a href="stat_tut/weg/st_eg.html"> Student's
- t Distribution Examples</a></dt>
-<dd><dl>
-<dt><a href="stat_tut/weg/st_eg/tut_mean_intervals.html">
- Calculating confidence intervals on the mean with the Students-t distribution</a></dt>
-<dt><a href="stat_tut/weg/st_eg/tut_mean_test.html">
- Testing a sample mean for difference from a "true" mean</a></dt>
-<dt><a href="stat_tut/weg/st_eg/tut_mean_size.html">
- Estimating how large a sample size would have to become in order to give
- a significant Students-t test result with a single sample test</a></dt>
-<dt><a href="stat_tut/weg/st_eg/two_sample_students_t.html">
- Comparing the means of two samples with the Students-t test</a></dt>
-<dt><a href="stat_tut/weg/st_eg/paired_st.html">
- Comparing two paired samples with the Student's t distribution</a></dt>
+<dt><a href="stat_tut/overview/complements.html">Complements
+ are supported too - and when to use them</a></dt>
+<dt><a href="stat_tut/overview/parameters.html">Parameters
+ can be calculated</a></dt>
+<dt>Summary</dt>
+</dl></dd>
+<dt>Worked Examples</dt>
+<dd><dl>
+<dt><a href="stat_tut/weg/dist_construct_eg.html">Distribution
+ Construction Example</a></dt>
+<dt><a href="stat_tut/weg/st_eg.html">Student's t
+ Distribution Examples</a></dt>
+<dd><dl>
+<dt><a href="stat_tut/weg/st_eg/tut_mean_intervals.html">Calculating
+ confidence intervals on the mean with the Students-t distribution</a></dt>
+<dt><a href="stat_tut/weg/st_eg/tut_mean_test.html">Testing
+ a sample mean for difference from a "true" mean</a></dt>
+<dt><a href="stat_tut/weg/st_eg/tut_mean_size.html">Estimating
+ how large a sample size would have to become in order to give a significant
+ Students-t test result with a single sample test</a></dt>
+<dt><a href="stat_tut/weg/st_eg/two_sample_students_t.html">Comparing
+ the means of two samples with the Students-t test</a></dt>
+<dt><a href="stat_tut/weg/st_eg/paired_st.html">Comparing
+ two paired samples with the Student's t distribution</a></dt>
</dl></dd>
-<dt><a href="stat_tut/weg/cs_eg.html"> Chi Squared
+<dt><a href="stat_tut/weg/cs_eg.html">Chi Squared
 Distribution Examples</a></dt>
<dd><dl>
-<dt><a href="stat_tut/weg/cs_eg/chi_sq_intervals.html">
- Confidence Intervals on the Standard Deviation</a></dt>
-<dt><a href="stat_tut/weg/cs_eg/chi_sq_test.html">
- Chi-Square Test for the Standard Deviation</a></dt>
-<dt><a href="stat_tut/weg/cs_eg/chi_sq_size.html">
- Estimating the Required Sample Sizes for a Chi-Square Test for the Standard
- Deviation</a></dt>
+<dt><a href="stat_tut/weg/cs_eg/chi_sq_intervals.html">Confidence
+ Intervals on the Standard Deviation</a></dt>
+<dt><a href="stat_tut/weg/cs_eg/chi_sq_test.html">Chi-Square
+ Test for the Standard Deviation</a></dt>
+<dt><a href="stat_tut/weg/cs_eg/chi_sq_size.html">Estimating
+ the Required Sample Sizes for a Chi-Square Test for the Standard Deviation</a></dt>
</dl></dd>
-<dt><a href="stat_tut/weg/f_eg.html"> F Distribution
+<dt><a href="stat_tut/weg/f_eg.html">F Distribution
 Examples</a></dt>
-<dt><a href="stat_tut/weg/binom_eg.html"> Binomial
+<dt><a href="stat_tut/weg/binom_eg.html">Binomial
 Distribution Examples</a></dt>
<dd><dl>
-<dt><a href="stat_tut/weg/binom_eg/binomial_coinflip_example.html">
- Binomial Coin-Flipping Example</a></dt>
-<dt><a href="stat_tut/weg/binom_eg/binomial_quiz_example.html">
- Binomial Quiz Example</a></dt>
-<dt><a href="stat_tut/weg/binom_eg/binom_conf.html">
- Calculating Confidence Limits on the Frequency of Occurrence for a Binomial
- Distribution</a></dt>
-<dt><a href="stat_tut/weg/binom_eg/binom_size_eg.html">
- Estimating Sample Sizes for a Binomial Distribution.</a></dt>
+<dt><a href="stat_tut/weg/binom_eg/binomial_coinflip_example.html">Binomial
+ Coin-Flipping Example</a></dt>
+<dt><a href="stat_tut/weg/binom_eg/binomial_quiz_example.html">Binomial
+ Quiz Example</a></dt>
+<dt><a href="stat_tut/weg/binom_eg/binom_conf.html">Calculating
+ Confidence Limits on the Frequency of Occurrence for a Binomial Distribution</a></dt>
+<dt><a href="stat_tut/weg/binom_eg/binom_size_eg.html">Estimating
+ Sample Sizes for a Binomial Distribution.</a></dt>
</dl></dd>
-<dt><a href="stat_tut/weg/neg_binom_eg.html"> Negative
+<dt><a href="stat_tut/weg/neg_binom_eg.html">Negative
 Binomial Distribution Examples</a></dt>
<dd><dl>
-<dt><a href="stat_tut/weg/neg_binom_eg/neg_binom_conf.html">
- Calculating Confidence Limits on the Frequency of Occurrence for the
- Negative Binomial Distribution</a></dt>
-<dt><a href="stat_tut/weg/neg_binom_eg/neg_binom_size_eg.html">
- Estimating Sample Sizes for the Negative Binomial.</a></dt>
-<dt><a href="stat_tut/weg/neg_binom_eg/negative_binomial_example1.html">
- Negative Binomial Sales Quota Example.</a></dt>
-<dt><a href="stat_tut/weg/neg_binom_eg/negative_binomial_example2.html">
- Negative Binomial Table Printing Example.</a></dt>
+<dt><a href="stat_tut/weg/neg_binom_eg/neg_binom_conf.html">Calculating
+ Confidence Limits on the Frequency of Occurrence for the Negative Binomial
+ Distribution</a></dt>
+<dt><a href="stat_tut/weg/neg_binom_eg/neg_binom_size_eg.html">Estimating
+ Sample Sizes for the Negative Binomial.</a></dt>
+<dt><a href="stat_tut/weg/neg_binom_eg/negative_binomial_example1.html">Negative
+ Binomial Sales Quota Example.</a></dt>
+<dt><a href="stat_tut/weg/neg_binom_eg/negative_binomial_example2.html">Negative
+ Binomial Table Printing Example.</a></dt>
</dl></dd>
-<dt><a href="stat_tut/weg/normal_example.html"> Normal
+<dt><a href="stat_tut/weg/normal_example.html">Normal
 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
+<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">
- Tables of the power function of the χ2 test.</a></dt></dl></dd>
-<dt><a href="stat_tut/weg/error_eg.html"> Error Handling
+<dd><dl><dt><a href="stat_tut/weg/nccs_eg/nccs_power_eg.html">Tables
+ of the power function of the χ2 test.</a></dt></dl></dd>
+<dt><a href="stat_tut/weg/error_eg.html">Error Handling
 Example</a></dt>
-<dt><a href="stat_tut/weg/find_eg.html"> Find Location
+<dt><a href="stat_tut/weg/find_eg.html">Find Location
 and Scale Examples</a></dt>
<dd><dl>
-<dt><a href="stat_tut/weg/find_eg/find_location_eg.html">
- Find Location (Mean) Example</a></dt>
-<dt><a href="stat_tut/weg/find_eg/find_scale_eg.html">
- Find Scale (Standard Deviation) Example</a></dt>
-<dt><a href="stat_tut/weg/find_eg/find_mean_and_sd_eg.html">
- Find mean and standard deviation example</a></dt>
+<dt><a href="stat_tut/weg/find_eg/find_location_eg.html">Find
+ Location (Mean) Example</a></dt>
+<dt><a href="stat_tut/weg/find_eg/find_scale_eg.html">Find
+ Scale (Standard Deviation) Example</a></dt>
+<dt><a href="stat_tut/weg/find_eg/find_mean_and_sd_eg.html">Find
+ mean and standard deviation example</a></dt>
</dl></dd>
-<dt><a href="stat_tut/weg/nag_library.html"> Comparison
+<dt><a href="stat_tut/weg/nag_library.html">Comparison
 with C, R, FORTRAN-style Free Functions</a></dt>
-<dt><a href="stat_tut/weg/c_sharp.html"> Using the
+<dt><a href="stat_tut/weg/c_sharp.html">Using the
 Distributions from Within C#</a></dt>
</dl></dd>
-<dt><a href="stat_tut/variates.html"> Random Variates
+<dt><a href="stat_tut/variates.html">Random Variates
 and Distribution Parameters</a></dt>
-<dt><a href="stat_tut/dist_params.html"> Discrete Probability
+<dt><a href="stat_tut/dist_params.html">Discrete Probability
 Distributions</a></dt>
</dl></div>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/dist_params.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/dist_params.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/dist_params.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,22 +24,23 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.dist.stat_tut.dist_params"></a><a class="link" href="dist_params.html" title="Discrete Probability Distributions"> Discrete Probability
+<a name="math_toolkit.dist.stat_tut.dist_params"></a><a class="link" href="dist_params.html" title="Discrete Probability Distributions">Discrete Probability
 Distributions</a>
</h4></div></div></div>

 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.

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,23 +24,22 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.dist.stat_tut.overview"></a><a class="link" href="overview.html" title="Overview of Distributions"> Overview of Distributions</a>
+<a name="math_toolkit.dist.stat_tut.overview"></a><a class="link" href="overview.html" title="Overview of Distributions">Overview of Distributions</a>
</h4></div></div></div>
<div class="toc"><dl>
-<dt><a href="overview/headers.html"> Headers
+<dt><a href="overview/headers.html">Headers
 and Namespaces</a></dt>
-<dt><a href="overview/objects.html"> Distributions
+<dt><a href="overview/objects.html">Distributions
 are Objects</a></dt>
-<dt><a href="overview/generic.html"> Generic
+<dt><a href="overview/generic.html">Generic
 operations common to all distributions are non-member functions</a></dt>
-<dt><a href="overview/complements.html">
- Complements are supported too - and when to use them</a></dt>
-<dt><a href="overview/parameters.html">
- Parameters can be calculated</a></dt>
-<dt> Summary</dt>
+<dt><a href="overview/complements.html">Complements
+ are supported too - and when to use them</a></dt>
+<dt><a href="overview/parameters.html">Parameters
+ can be calculated</a></dt>
+<dt>Summary</dt>
</dl></div>
-<a name="complements"></a>
- 
+<a name="complements"></a>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/complements.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/complements.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/complements.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.stat_tut.overview.complements"></a><a class="link" href="complements.html" title="Complements are supported too - and when to use them">
- Complements are supported too - and when to use them</a>
+<a name="math_toolkit.dist.stat_tut.overview.complements"></a><a class="link" href="complements.html" title="Complements are supported too - and when to use them">Complements
+ are supported too - and when to use them</a>
</h5></div></div></div>

 Often you don't want the value of the CDF, but its complement, which
@@ -70,8 +70,6 @@
</tr>
<tr><td align="left" valign="top">

- 
-
 Critical values are just quantiles
 

@@ -105,17 +103,13 @@
 
</td></tr>
</table></div>
-<a name="why_complements"></a>
- 
-<div class="tip"><table border="0" summary="Tip">
+<a name="why_complements"></a><div class="tip"><table border="0" summary="Tip">
<tr>
<td rowspan="2" align="center" valign="top" width="25"><img alt="[Tip]" src="../../../../../../../../../doc/src/images/tip.png"></td>
<th align="left">Tip</th>
</tr>
<tr><td align="left" valign="top">

- 
-
 Why bother with complements anyway?
 

@@ -186,8 +180,6 @@
 This assumes that the 0.00001 value is either a constant, or can be
 computed by some manner other than subtracting 0.99999 from 1.
 
-
- 
</td></tr>
</table></div>
</div>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/generic.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/generic.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/generic.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.stat_tut.overview.generic"></a><a class="link" href="generic.html" title="Generic operations common to all distributions are non-member functions"> Generic
+<a name="math_toolkit.dist.stat_tut.overview.generic"></a><a class="link" href="generic.html" title="Generic operations common to all distributions are non-member functions">Generic
 operations common to all distributions are non-member functions</a>
</h5></div></div></div>

@@ -59,8 +59,6 @@
</tr>
<tr><td align="left" valign="top">

- 
-
 Random numbers that approximate Quantiles of
 Distributions
 
@@ -78,7 +76,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 +88,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>
@@ -101,21 +100,41 @@
</tr>
<tr><td align="left" valign="top">

- 
-
 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 +144,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 +161,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).
@@ -170,8 +190,6 @@
</tr>
<tr><td align="left" valign="top">

- 
-
 Discrete Probability Distributions

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/headers.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/headers.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/headers.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,31 +24,41 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.stat_tut.overview.headers"></a><a class="link" href="headers.html" title="Headers and Namespaces"> Headers
+<a name="math_toolkit.dist.stat_tut.overview.headers"></a><a class="link" href="headers.html" title="Headers and Namespaces">Headers
 and Namespaces</a>
</h5></div></div></div>

 All the code in this library is inside namespace boost::math.
 
-<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 math function names are also used in namespace std so including
- <random> could cause ambiguity.
- </td></tr>
-</table></div>

 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>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/objects.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/objects.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/objects.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.stat_tut.overview.objects"></a><a class="link" href="objects.html" title="Distributions are Objects"> Distributions
+<a name="math_toolkit.dist.stat_tut.overview.objects"></a><a class="link" href="objects.html" title="Distributions are Objects">Distributions
are Objects</a>
</h5></div></div></div>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/parameters.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/parameters.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/parameters.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.stat_tut.overview.parameters"></a><a class="link" href="parameters.html" title="Parameters can be calculated">
- Parameters can be calculated</a>
+<a name="math_toolkit.dist.stat_tut.overview.parameters"></a><a class="link" href="parameters.html" title="Parameters can be calculated">Parameters
+ can be calculated</a>
</h5></div></div></div>

Sometimes it's the parameters that define the distribution that you need

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/summary.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/summary.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/overview/summary.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.stat_tut.overview.summary"></a><a class="link" href="summary.html" title="Summary"> Summary</a>
+<a name="math_toolkit.dist.stat_tut.overview.summary"></a><a class="link" href="summary.html" title="Summary">Summary</a>
</h5></div></div></div>
<div class="itemizedlist"><ul type="disc">
<li>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/variates.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/variates.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/variates.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,23 +24,24 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.dist.stat_tut.variates"></a><a class="link" href="variates.html" title="Random Variates and Distribution Parameters"> Random Variates
+<a name="math_toolkit.dist.stat_tut.variates"></a><a class="link" href="variates.html" title="Random Variates and Distribution Parameters">Random Variates
 and Distribution Parameters</a>
</h4></div></div></div>

 <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,8 +52,9 @@

 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>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,98 +24,90 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.dist.stat_tut.weg"></a><a class="link" href="weg.html" title="Worked Examples"> Worked Examples</a>
+<a name="math_toolkit.dist.stat_tut.weg"></a><a class="link" href="weg.html" title="Worked Examples">Worked Examples</a>
</h4></div></div></div>
<div class="toc"><dl>
-<dt><a href="weg/dist_construct_eg.html">
- Distribution Construction Example</a></dt>
-<dt><a href="weg/st_eg.html"> Student's
- t Distribution Examples</a></dt>
+<dt><a href="weg/dist_construct_eg.html">Distribution
+ Construction Example</a></dt>
+<dt><a href="weg/st_eg.html">Student's t
+ Distribution Examples</a></dt>
<dd><dl>
-<dt><a href="weg/st_eg/tut_mean_intervals.html">
- Calculating confidence intervals on the mean with the Students-t distribution</a></dt>
-<dt><a href="weg/st_eg/tut_mean_test.html">
- Testing a sample mean for difference from a "true" mean</a></dt>
-<dt><a href="weg/st_eg/tut_mean_size.html">
- Estimating how large a sample size would have to become in order to give
- a significant Students-t test result with a single sample test</a></dt>
-<dt><a href="weg/st_eg/two_sample_students_t.html">
- Comparing the means of two samples with the Students-t test</a></dt>
-<dt><a href="weg/st_eg/paired_st.html">
- Comparing two paired samples with the Student's t distribution</a></dt>
+<dt><a href="weg/st_eg/tut_mean_intervals.html">Calculating
+ confidence intervals on the mean with the Students-t distribution</a></dt>
+<dt><a href="weg/st_eg/tut_mean_test.html">Testing
+ a sample mean for difference from a "true" mean</a></dt>
+<dt><a href="weg/st_eg/tut_mean_size.html">Estimating
+ how large a sample size would have to become in order to give a significant
+ Students-t test result with a single sample test</a></dt>
+<dt><a href="weg/st_eg/two_sample_students_t.html">Comparing
+ the means of two samples with the Students-t test</a></dt>
+<dt><a href="weg/st_eg/paired_st.html">Comparing
+ two paired samples with the Student's t distribution</a></dt>
</dl></dd>
-<dt><a href="weg/cs_eg.html"> Chi Squared
+<dt><a href="weg/cs_eg.html">Chi Squared
 Distribution Examples</a></dt>
<dd><dl>
-<dt><a href="weg/cs_eg/chi_sq_intervals.html">
- Confidence Intervals on the Standard Deviation</a></dt>
-<dt><a href="weg/cs_eg/chi_sq_test.html">
- Chi-Square Test for the Standard Deviation</a></dt>
-<dt><a href="weg/cs_eg/chi_sq_size.html">
- Estimating the Required Sample Sizes for a Chi-Square Test for the Standard
- Deviation</a></dt>
+<dt><a href="weg/cs_eg/chi_sq_intervals.html">Confidence
+ Intervals on the Standard Deviation</a></dt>
+<dt><a href="weg/cs_eg/chi_sq_test.html">Chi-Square
+ Test for the Standard Deviation</a></dt>
+<dt><a href="weg/cs_eg/chi_sq_size.html">Estimating
+ the Required Sample Sizes for a Chi-Square Test for the Standard Deviation</a></dt>
</dl></dd>
-<dt><a href="weg/f_eg.html"> F Distribution
+<dt><a href="weg/f_eg.html">F Distribution
 Examples</a></dt>
-<dt><a href="weg/binom_eg.html"> Binomial
+<dt><a href="weg/binom_eg.html">Binomial
 Distribution Examples</a></dt>
<dd><dl>
-<dt><a href="weg/binom_eg/binomial_coinflip_example.html">
- Binomial Coin-Flipping Example</a></dt>
-<dt><a href="weg/binom_eg/binomial_quiz_example.html">
- Binomial Quiz Example</a></dt>
-<dt><a href="weg/binom_eg/binom_conf.html">
- Calculating Confidence Limits on the Frequency of Occurrence for a Binomial
- Distribution</a></dt>
-<dt><a href="weg/binom_eg/binom_size_eg.html">
- Estimating Sample Sizes for a Binomial Distribution.</a></dt>
+<dt><a href="weg/binom_eg/binomial_coinflip_example.html">Binomial
+ Coin-Flipping Example</a></dt>
+<dt><a href="weg/binom_eg/binomial_quiz_example.html">Binomial
+ Quiz Example</a></dt>
+<dt><a href="weg/binom_eg/binom_conf.html">Calculating
+ Confidence Limits on the Frequency of Occurrence for a Binomial Distribution</a></dt>
+<dt><a href="weg/binom_eg/binom_size_eg.html">Estimating
+ Sample Sizes for a Binomial Distribution.</a></dt>
</dl></dd>
-<dt><a href="weg/neg_binom_eg.html"> Negative
+<dt><a href="weg/neg_binom_eg.html">Negative
 Binomial Distribution Examples</a></dt>
<dd><dl>
-<dt><a href="weg/neg_binom_eg/neg_binom_conf.html">
- Calculating Confidence Limits on the Frequency of Occurrence for the
- Negative Binomial Distribution</a></dt>
-<dt><a href="weg/neg_binom_eg/neg_binom_size_eg.html">
- Estimating Sample Sizes for the Negative Binomial.</a></dt>
-<dt><a href="weg/neg_binom_eg/negative_binomial_example1.html">
- Negative Binomial Sales Quota Example.</a></dt>
-<dt><a href="weg/neg_binom_eg/negative_binomial_example2.html">
- Negative Binomial Table Printing Example.</a></dt>
+<dt><a href="weg/neg_binom_eg/neg_binom_conf.html">Calculating
+ Confidence Limits on the Frequency of Occurrence for the Negative Binomial
+ Distribution</a></dt>
+<dt><a href="weg/neg_binom_eg/neg_binom_size_eg.html">Estimating
+ Sample Sizes for the Negative Binomial.</a></dt>
+<dt><a href="weg/neg_binom_eg/negative_binomial_example1.html">Negative
+ Binomial Sales Quota Example.</a></dt>
+<dt><a href="weg/neg_binom_eg/negative_binomial_example2.html">Negative
+ Binomial Table Printing Example.</a></dt>
</dl></dd>
-<dt><a href="weg/normal_example.html"> Normal
+<dt><a href="weg/normal_example.html">Normal
 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
+<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">
- Tables of the power function of the χ2 test.</a></dt></dl></dd>
-<dt><a href="weg/error_eg.html"> Error Handling
+<dd><dl><dt><a href="weg/nccs_eg/nccs_power_eg.html">Tables
+ of the power function of the χ2 test.</a></dt></dl></dd>
+<dt><a href="weg/error_eg.html">Error Handling
 Example</a></dt>
-<dt><a href="weg/find_eg.html"> Find Location
+<dt><a href="weg/find_eg.html">Find Location
 and Scale Examples</a></dt>
<dd><dl>
-<dt><a href="weg/find_eg/find_location_eg.html">
- Find Location (Mean) Example</a></dt>
-<dt><a href="weg/find_eg/find_scale_eg.html">
- Find Scale (Standard Deviation) Example</a></dt>
-<dt><a href="weg/find_eg/find_mean_and_sd_eg.html">
- Find mean and standard deviation example</a></dt>
+<dt><a href="weg/find_eg/find_location_eg.html">Find
+ Location (Mean) Example</a></dt>
+<dt><a href="weg/find_eg/find_scale_eg.html">Find
+ Scale (Standard Deviation) Example</a></dt>
+<dt><a href="weg/find_eg/find_mean_and_sd_eg.html">Find
+ mean and standard deviation example</a></dt>
</dl></dd>
-<dt><a href="weg/nag_library.html"> Comparison
+<dt><a href="weg/nag_library.html">Comparison
 with C, R, FORTRAN-style Free Functions</a></dt>
-<dt><a href="weg/c_sharp.html"> Using the
+<dt><a href="weg/c_sharp.html">Using the
 Distributions from Within C#</a></dt>
</dl></div>
-
- 
-
- 
-
- 
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,19 +24,18 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.binom_eg"></a><a class="link" href="binom_eg.html" title="Binomial Distribution Examples"> Binomial
+<a name="math_toolkit.dist.stat_tut.weg.binom_eg"></a><a class="link" href="binom_eg.html" title="Binomial Distribution Examples">Binomial
Distribution Examples</a>
</h5></div></div></div>
<div class="toc"><dl>
-<dt><a href="binom_eg/binomial_coinflip_example.html">
- Binomial Coin-Flipping Example</a></dt>
-<dt><a href="binom_eg/binomial_quiz_example.html">
- Binomial Quiz Example</a></dt>
-<dt><a href="binom_eg/binom_conf.html">
- Calculating Confidence Limits on the Frequency of Occurrence for a Binomial
- Distribution</a></dt>
-<dt><a href="binom_eg/binom_size_eg.html">
- Estimating Sample Sizes for a Binomial Distribution.</a></dt>
+<dt><a href="binom_eg/binomial_coinflip_example.html">Binomial
+ Coin-Flipping Example</a></dt>
+<dt><a href="binom_eg/binomial_quiz_example.html">Binomial
+ Quiz Example</a></dt>
+<dt><a href="binom_eg/binom_conf.html">Calculating
+ Confidence Limits on the Frequency of Occurrence for a Binomial Distribution</a></dt>
+<dt><a href="binom_eg/binom_size_eg.html">Estimating
+ Sample Sizes for a Binomial Distribution.</a></dt>
</dl></div>

See also the reference documentation for the <a class="link" href="../../dist_ref/dists/binomial_dist.html" title="Binomial Distribution">Binomial

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg/binom_conf.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg/binom_conf.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg/binom_conf.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,9 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h6 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.binom_eg.binom_conf"></a><a class="link" href="binom_conf.html" title="Calculating Confidence Limits on the Frequency of Occurrence for a Binomial Distribution">
- Calculating Confidence Limits on the Frequency of Occurrence for a Binomial
- Distribution</a>
+<a name="math_toolkit.dist.stat_tut.weg.binom_eg.binom_conf"></a><a class="link" href="binom_conf.html" title="Calculating Confidence Limits on the Frequency of Occurrence for a Binomial Distribution">Calculating
+ Confidence Limits on the Frequency of Occurrence for a Binomial Distribution</a>
</h6></div></div></div>

 Imagine you have a process that follows a binomial distribution: for
@@ -100,7 +99,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:

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg/binom_size_eg.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg/binom_size_eg.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg/binom_size_eg.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h6 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.binom_eg.binom_size_eg"></a><a class="link" href="binom_size_eg.html" title="Estimating Sample Sizes for a Binomial Distribution.">
- Estimating Sample Sizes for a Binomial Distribution.</a>
+<a name="math_toolkit.dist.stat_tut.weg.binom_eg.binom_size_eg"></a><a class="link" href="binom_size_eg.html" title="Estimating Sample Sizes for a Binomial Distribution.">Estimating
+ Sample Sizes for a Binomial Distribution.</a>
</h6></div></div></div>

Imagine you have a critical component that you know will fail in 1

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg/binomial_coinflip_example.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg/binomial_coinflip_example.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg/binomial_coinflip_example.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,48 +24,36 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h6 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.binom_eg.binomial_coinflip_example"></a><a class="link" href="binomial_coinflip_example.html" title="Binomial Coin-Flipping Example">
- Binomial Coin-Flipping Example</a>
+<a name="math_toolkit.dist.stat_tut.weg.binom_eg.binomial_coinflip_example"></a><a class="link" href="binomial_coinflip_example.html" title="Binomial Coin-Flipping Example">Binomial
+ Coin-Flipping Example</a>
</h6></div></div></div>

- 
-
- An example of a <a href="http://en.wikipedia.org/wiki/Bernoulli_process" target="_top">Bernoulli
- process</a> is coin flipping. A variable in such a sequence may
- be called a Bernoulli variable.
- 
-
- 
-
- This example shows using the Binomial distribution to predict the
- probability of heads and tails when throwing a coin.
- 
-
- 
-
- The number of correct answers (say heads), X, is distributed as a
- binomial random variable with binomial distribution parameters number
- of trials (flips) n = 10 and probability (success_fraction) of getting
- a head p = 0.5 (a 'fair' coin).
- 
-
- 
+ An example of a <a href="http://en.wikipedia.org/wiki/Bernoulli_process" target="_top">Bernoulli
+ process</a> is coin flipping. A variable in such a sequence may
+ be called a Bernoulli variable.
+ 

- (Our coin is assumed fair, but we could easily change the success_fraction
- parameter p from 0.5 to some other value to simulate an unfair coin,
- say 0.6 for one with chewing gum on the tail, so it is more likely
- to fall tails down and heads up).
- 
+ This example shows using the Binomial distribution to predict the probability
+ of heads and tails when throwing a coin.
+ 

- 
+ The number of correct answers (say heads), X, is distributed as a binomial
+ random variable with binomial distribution parameters number of trials
+ (flips) n = 10 and probability (success_fraction) of getting a head
+ p = 0.5 (a 'fair' coin).
+ 

- First we need some includes and using statements to be able to use
- the binomial distribution, some std input and output, and get started:
- 
+ (Our coin is assumed fair, but we could easily change the success_fraction
+ parameter p from 0.5 to some other value to simulate an unfair coin,
+ say 0.6 for one with chewing gum on the tail, so it is more likely
+ to fall tails down and heads up).
+ 

- 
+ First we need some includes and using statements to be able to use
+ the binomial distribution, some std input and output, and get started:
+ 

-
+

<pre class="programlisting">#include <boost/math/distributions/binomial.hpp>
 using boost::math::binomial;
@@ -81,23 +69,17 @@
 try
 {</pre>

- 
-
- 
-
- See note <a class="link" href="binomial_coinflip_example.html#coinflip_eg_catch">with the catch block</a>
- about why a try and catch block is always a good idea.
- 
-
- 
+ 

- First, construct a binomial distribution with parameters success_fraction
- 1/2, and how many flips.
- 
+ See note <a class="link" href="binomial_coinflip_example.html#coinflip_eg_catch">with the catch block</a>
+ about why a try and catch block is always a good idea.
+ 

- 
+ First, construct a binomial distribution with parameters success_fraction
+ 1/2, and how many flips.
+ 

-
+

<pre class="programlisting">const double success_fraction = 0.5; // = 50% = 1/2 for a 'fair' coin.
int flips = 10;
@@ -105,16 +87,12 @@

cout.precision(4);</pre>

- 
-
- 
-
- Then some examples of using Binomial moments (and echoing the parameters).
- 
+ 

- 
+ Then some examples of using Binomial moments (and echoing the parameters).
+ 

-
+

<pre class="programlisting">cout << "From " << flips << " one can expect to get on average "
 << mean(flip) << " heads (or tails)." << endl;
@@ -130,141 +108,104 @@
cout << "Skewness if success_fraction is " << flip.success_fraction()
 << " is " << skewness(flip) << endl << endl; // Expect zero for a 'fair' coin.</pre>

- 
-
- 
-
- Now we show a variety of predictions on the probability of heads:
- 
+ 

- 
+ Now we show a variety of predictions on the probability of heads:
+ 

-
+

<pre class="programlisting">cout << "For " << flip.trials() << " coin flips: " << endl;
cout << "Probability of getting no heads is " << pdf(flip, 0) << endl;
cout << "Probability of getting at least one head is " << 1. - pdf(flip, 0) << endl;</pre>

- 
-
- 
-
- When we want to calculate the probability for a range or values we
- can sum the PDF's:
- 
+ 

- 
+ When we want to calculate the probability for a range or values we
+ can sum the PDF's:
+ 

-
+

<pre class="programlisting">cout << "Probability of getting 0 or 1 heads is "
 << pdf(flip, 0) + pdf(flip, 1) << endl; // sum of exactly == probabilities</pre>

- 
-
- 
-
- Or we can use the cdf.
- 
+ 

- 
+ Or we can use the cdf.
+ 

-
+

<pre class="programlisting">cout << "Probability of getting 0 or 1 (<= 1) heads is " << cdf(flip, 1) << endl;
cout << "Probability of getting 9 or 10 heads is " << pdf(flip, 9) + pdf(flip, 10) << endl;</pre>

- 
-
- 
-
- Note that using
- 
+ 

- 
+ Note that using
+ 

-
+

<pre class="programlisting">cout << "Probability of getting 9 or 10 heads is " << 1. - cdf(flip, 8) << endl;</pre>

- 
-
- 
-
- is less accurate than using the complement
- 
+ 

- 
+ is less accurate than using the complement
+ 

-
+

<pre class="programlisting">cout << "Probability of getting 9 or 10 heads is " << cdf(complement(flip, 8)) << endl;</pre>

- 
-
- 
-
- Since the subtraction may involve <a href="http://docs.sun.com/source/806-3568/ncg_goldberg.html" target="_top">cancellation
- error</a>, where as <code class="computeroutput">cdf(complement(flip, 8))</code> does not use such a subtraction
- internally, and so does not exhibit the problem.
- 
-
- 
+ 

- To get the probability for a range of heads, we can either add the
- pdfs for each number of heads
- 
+ Since the subtraction may involve <a href="http://docs.sun.com/source/806-3568/ncg_goldberg.html" target="_top">cancellation
+ error</a>, where as <code class="computeroutput">cdf(complement(flip, 8))</code>
+ does not use such a subtraction internally, and so does not exhibit
+ the problem.
+ 

- 
+ To get the probability for a range of heads, we can either add the
+ pdfs for each number of heads
+ 

-
+

<pre class="programlisting">cout << "Probability of between 4 and 6 heads (4 or 5 or 6) is "
 // P(X == 4) + P(X == 5) + P(X == 6)
 << pdf(flip, 4) + pdf(flip, 5) + pdf(flip, 6) << endl;</pre>

- 
-
- 
-
- But this is probably less efficient than using the cdf
- 
+ 

- 
+ But this is probably less efficient than using the cdf
+ 

-
+

<pre class="programlisting">cout << "Probability of between 4 and 6 heads (4 or 5 or 6) is "
 // P(X <= 6) - P(X <= 3) == P(X < 4)
 << cdf(flip, 6) - cdf(flip, 3) << endl;</pre>

- 
-
- 
-
- Certainly for a bigger range like, 3 to 7
- 
+ 

- 
+ Certainly for a bigger range like, 3 to 7
+ 

-
+

<pre class="programlisting">cout << "Probability of between 3 and 7 heads (3, 4, 5, 6 or 7) is "
 // P(X <= 7) - P(X <= 2) == P(X < 3)
 << cdf(flip, 7) - cdf(flip, 2) << endl;
cout << endl;</pre>

- 
-
- 
-
- Finally, print two tables of probability for the exactly
- and at least a number of heads.
- 
+ 

- 
+ Finally, print two tables of probability for the exactly
+ and at least a number of heads.
+ 

-
+

<pre class="programlisting">// Print a table of probability for the exactly a number of heads.
cout << "Probability of getting exactly (==) heads" << endl;
@@ -288,58 +229,42 @@
 << probability * 100. << "%"<< endl;
} // for i</pre>

- 
-
- 
-
- The last (0 to 10 heads) must, of course, be 100% probability.
- 
+ 

- 
+ The last (0 to 10 heads) must, of course, be 100% probability.
+ 

-
+

<pre class="programlisting">}
catch(const std::exception& e)
{
 //</pre>

- 
-
- <a name="coinflip_eg_catch"></a>
- 
-
- It is always essential to include try & catch blocks because
- default policies are to throw exceptions on arguments that are out
- of domain or cause errors like numeric-overflow.
- 
-
- 
-
- Lacking try & catch blocks, the program will abort, whereas the
- message below from the thrown exception will give some helpful clues
- as to the cause of the problem.
- 
+ 
+<a name="coinflip_eg_catch"></a>
+ It is always essential to include try & catch blocks because default
+ policies are to throw exceptions on arguments that are out of domain
+ or cause errors like numeric-overflow.
+ 

- 
+ Lacking try & catch blocks, the program will abort, whereas the
+ message below from the thrown exception will give some helpful clues
+ as to the cause of the problem.
+ 

-
+

<pre class="programlisting"> std::cout <<
 "\n""Message from thrown exception was:\n " << e.what() << std::endl;
}
</pre>

- 
-
 

 See binomial_coinflip_example.cpp
 for full source code, the program output looks like this:
 
-
-
-
<pre class="programlisting">Using Binomial distribution to predict how many heads and tails.
From 10 one can expect to get on average 5 heads (or tails).
Mode is 5
@@ -386,8 +311,6 @@
9 0.999 or 1 in 1.001, or 99.9%
10 1 or 1 in 1, or 100%
</pre>
-
- 
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg/binomial_quiz_example.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg/binomial_quiz_example.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/binom_eg/binomial_quiz_example.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,33 +24,27 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h6 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.binom_eg.binomial_quiz_example"></a><a class="link" href="binomial_quiz_example.html" title="Binomial Quiz Example">
- Binomial Quiz Example</a>
+<a name="math_toolkit.dist.stat_tut.weg.binom_eg.binomial_quiz_example"></a><a class="link" href="binomial_quiz_example.html" title="Binomial Quiz Example">Binomial
+ Quiz Example</a>
</h6></div></div></div>

- 
-
- A multiple choice test has four possible answers to each of 16 questions.
- A student guesses the answer to each question, so the probability
- of getting a correct answer on any given question is one in four,
- a quarter, 1/4, 25% or fraction 0.25. The conditions of the binomial
- experiment are assumed to be met: n = 16 questions constitute the
- trials; each question results in one of two possible outcomes (correct
- or incorrect); the probability of being correct is 0.25 and is constant
- if no knowledge about the subject is assumed; the questions are answered
- independently if the student's answer to a question in no way influences
- his/her answer to another question.
- 
-
- 
-
- First, we need to be able to use the binomial distribution constructor
- (and some std input/output, of course).
- 
+ A multiple choice test has four possible answers to each of 16 questions.
+ A student guesses the answer to each question, so the probability of
+ getting a correct answer on any given question is one in four, a quarter,
+ 1/4, 25% or fraction 0.25. The conditions of the binomial experiment
+ are assumed to be met: n = 16 questions constitute the trials; each
+ question results in one of two possible outcomes (correct or incorrect);
+ the probability of being correct is 0.25 and is constant if no knowledge
+ about the subject is assumed; the questions are answered independently
+ if the student's answer to a question in no way influences his/her
+ answer to another question.
+ 

- 
+ First, we need to be able to use the binomial distribution constructor
+ (and some std input/output, of course).
+ 

-
+

<pre class="programlisting">#include <boost/math/distributions/binomial.hpp>
 using boost::math::binomial;
@@ -66,50 +60,38 @@

</pre>

- 
-
- 
-
- The number of correct answers, X, is distributed as a binomial random
- variable with binomial distribution parameters: questions n and success
- fraction probability p. So we construct a binomial distribution:
- 
+ 

- 
+ The number of correct answers, X, is distributed as a binomial random
+ variable with binomial distribution parameters: questions n and success
+ fraction probability p. So we construct a binomial distribution:
+ 

-
+

<pre class="programlisting">int questions = 16; // All the questions in the quiz.
int answers = 4; // Possible answers to each question.
double success_fraction = 1. / answers; // If a random guess, p = 1/4 = 0.25.
binomial quiz(questions, success_fraction);</pre>

- 
-
- 
-
- and display the distribution parameters we used thus:
- 
+ 

- 
+ and display the distribution parameters we used thus:
+ 

-
+

<pre class="programlisting">cout << "In a quiz with " << quiz.trials()
 << " questions and with a probability of guessing right of "
 << quiz.success_fraction() * 100 << " %"
 << " or 1 in " << static_cast<int>(1. / quiz.success_fraction()) << endl;</pre>

- 
-
- 
-
- Show a few probabilities of just guessing:
- 
+ 

- 
+ Show a few probabilities of just guessing:
+ 

-
+

<pre class="programlisting">cout << "Probability of getting none right is " << pdf(quiz, 0) << endl; // 0.010023
cout << "Probability of getting exactly one right is " << pdf(quiz, 1) << endl;
@@ -120,10 +102,7 @@
cout << "Probability of getting all " << questions << " answers right by chance is "
 << pdf(quiz, questions) << endl;</pre>

- 
-
-
-
+ 
<pre class="programlisting">Probability of getting none right is 0.0100226
Probability of getting exactly one right is 0.0534538
Probability of getting exactly two right is 0.133635
@@ -131,20 +110,13 @@
Probability of getting exactly all 16 answers right by chance is 2.32831e-010
</pre>

- 
-
- These don't give any encouragement to guessers!
- 
-
- 
-
- We can tabulate the 'getting exactly right' ( == ) probabilities
- thus:
- 
+ These don't give any encouragement to guessers!
+ 

- 
+ We can tabulate the 'getting exactly right' ( == ) probabilities thus:
+ 

-
+

<pre class="programlisting">cout << "\n" "Guessed Probability" << right << endl;
for (int successes = 0; successes <= questions; successes++)
@@ -154,10 +126,7 @@
}
cout << endl;</pre>

- 
-
-
-
+ 
<pre class="programlisting">Guessed Probability
 0 0.0100226
 1 0.0534538
@@ -178,152 +147,101 @@
16 2.32831e-010
</pre>

- 
-
- Then we can add the probabilities of some 'exactly right' like this:
- 
-
- 
+ Then we can add the probabilities of some 'exactly right' like this:
+ 

-
+

<pre class="programlisting">cout << "Probability of getting none or one right is " << pdf(quiz, 0) + pdf(quiz, 1) << endl;</pre>

- 
-
-
-
+ 
<pre class="programlisting">Probability of getting none or one right is 0.0634764
</pre>

- 
-
- But if more than a couple of scores are involved, it is more convenient
- (and may be more accurate) to use the Cumulative Distribution Function
- (cdf) instead:
- 
-
- 
+ But if more than a couple of scores are involved, it is more convenient
+ (and may be more accurate) to use the Cumulative Distribution Function
+ (cdf) instead:
+ 

-
+

<pre class="programlisting">cout << "Probability of getting none or one right is " << cdf(quiz, 1) << endl;</pre>

- 
-
-
-
+ 
<pre class="programlisting">Probability of getting none or one right is 0.0634764
</pre>

- 
-
- Since the cdf is inclusive, we can get the probability of getting
- up to 10 right ( <= )
- 
-
- 
+ Since the cdf is inclusive, we can get the probability of getting up
+ to 10 right ( <= )
+ 

-
+

<pre class="programlisting">cout << "Probability of getting <= 10 right (to fail) is " << cdf(quiz, 10) << endl;</pre>

- 
-
-
-
+ 
<pre class="programlisting">Probability of getting <= 10 right (to fail) is 0.999715
</pre>

- 
-
- To get the probability of getting 11 or more right (to pass), it
- is tempting to use
+ To get the probability of getting 11 or more right (to pass), it is
+ tempting to use

<pre class="programlisting">1 - cdf(quiz, 10)</pre>

- to get the probability of > 10
- 
-
- 
+ to get the probability of > 10
+ 

-
+

<pre class="programlisting">cout << "Probability of getting > 10 right (to pass) is " << 1 - cdf(quiz, 10) << endl;</pre>

- 
-
-
-
+ 
<pre class="programlisting">Probability of getting > 10 right (to pass) is 0.000285239
</pre>

- 
-
- But this should be resisted in favor of using the complement function.
- <a class="link" href="../../overview/complements.html#why_complements">Why complements?</a>
- 
-
- 
+ But this should be resisted in favor of using the complement function.
+ <a class="link" href="../../overview/complements.html#why_complements">Why complements?</a>
+ 

-
+

<pre class="programlisting">cout << "Probability of getting > 10 right (to pass) is " << cdf(complement(quiz, 10)) << endl;</pre>

- 
-
-
-
+ 
<pre class="programlisting">Probability of getting > 10 right (to pass) is 0.000285239
</pre>

- 
-
- And we can check that these two, <= 10 and > 10, add up to
- unity.
- 
-
- 
+ And we can check that these two, <= 10 and > 10, add up to unity.
+ 

-
+

<pre class="programlisting">BOOST_ASSERT((cdf(quiz, 10) + cdf(complement(quiz, 10))) == 1.);</pre>

- 
-
- 
-
- If we want a < rather than a <= test, because the CDF is inclusive,
- we must subtract one from the score.
- 
+ 

- 
+ If we want a < rather than a <= test, because the CDF is inclusive,
+ we must subtract one from the score.
+ 

-
+

<pre class="programlisting">cout << "Probability of getting less than " << pass_score
 << " (< " << pass_score << ") answers right by guessing is "
 << cdf(quiz, pass_score -1) << endl;</pre>

- 
-
-
-
+ 
<pre class="programlisting">Probability of getting less than 11 (< 11) answers right by guessing is 0.999715
</pre>

- 
-
- and similarly to get a >= rather than a > test we also need
- to subtract one from the score (and can again check the sum is unity).
- This is because if the cdf is inclusive, then
- its complement must be exclusive otherwise there
- would be one possible outcome counted twice!
- 
-
- 
+ and similarly to get a >= rather than a > test we also need to
+ subtract one from the score (and can again check the sum is unity).
+ This is because if the cdf is inclusive, then
+ its complement must be exclusive otherwise there
+ would be one possible outcome counted twice!
+ 

-
+

<pre class="programlisting">cout << "Probability of getting at least " << pass_score
 << "(>= " << pass_score << ") answers right by guessing is "
@@ -332,21 +250,14 @@

BOOST_ASSERT((cdf(quiz, pass_score -1) + cdf(complement(quiz, pass_score-1))) == 1);</pre>

- 
-
-
-
+ 
<pre class="programlisting">Probability of getting at least 11 (>= 11) answers right by guessing is 0.000285239, only 1 in 3505.83
</pre>

- 
-
- Finally we can tabulate some probabilities:
- 
-
- 
+ Finally we can tabulate some probabilities:
+ 

-
+

<pre class="programlisting">cout << "\n" "At most (<=)""\n""Guessed OK Probability" << right << endl;
for (int score = 0; score <= questions; score++)
@@ -356,10 +267,7 @@
}
cout << endl;</pre>

- 
-
-
-
+ 
<pre class="programlisting">At most (<=)
Guessed OK Probability
 0 0.01002259576
@@ -381,9 +289,7 @@
16 1
</pre>

- 
-
-
+

<pre class="programlisting">cout << "\n" "At least (>)""\n""Guessed OK Probability" << right << endl;
for (int score = 0; score <= questions; score++)
@@ -392,10 +298,7 @@
 << cdf(complement(quiz, score)) << endl;
}</pre>

- 
-
-
-
+ 
<pre class="programlisting">At least (>)
Guessed OK Probability
 0 0.9899774042
@@ -417,21 +320,15 @@
16 0
</pre>

- 
-
- We now consider the probabilities of ranges
- of correct guesses.
- 
-
- 
-
- First, calculate the probability of getting a range of guesses right,
- by adding the exact probabilities of each from low ... high.
- 
+ We now consider the probabilities of ranges
+ of correct guesses.
+ 

- 
+ First, calculate the probability of getting a range of guesses right,
+ by adding the exact probabilities of each from low ... high.
+ 

-
+

<pre class="programlisting">int low = 3; // Getting at least 3 right.
int high = 5; // Getting as most 5 right.
@@ -445,40 +342,26 @@
 << low << " and " << high << " answers right by guessing is "
 << sum << endl; // 0.61323</pre>

- 
-
-
-
+ 
<pre class="programlisting">Probability of getting between 3 and 5 answers right by guessing is 0.6132
</pre>

- 
-
- Or, usually better, we can use the difference of cdfs instead:
- 
-
- 
+ Or, usually better, we can use the difference of cdfs instead:
+ 

-
+

<pre class="programlisting">cout << "Probability of getting between " << low << " and " << high << " answers right by guessing is "
 << cdf(quiz, high) - cdf(quiz, low - 1) << endl; // 0.61323</pre>

- 
-
-
-
+ 
<pre class="programlisting">Probability of getting between 3 and 5 answers right by guessing is 0.6132
</pre>

- 
-
- And we can also try a few more combinations of high and low choices:
- 
-
- 
+ And we can also try a few more combinations of high and low choices:
+ 

-
+

<pre class="programlisting">low = 1; high = 6;
cout << "Probability of getting between " << low << " and " << high << " answers right by guessing is "
@@ -490,32 +373,22 @@
cout << "Probability of getting between " << low << " and " << high << " answers right by guessing is "
 << cdf(quiz, high) - cdf(quiz, low - 1) << endl; // 4 <= x 4 P = 0.22520</pre>

- 
-
-
-
+ 
<pre class="programlisting">Probability of getting between 1 and 6 answers right by guessing is 0.9104
Probability of getting between 1 and 8 answers right by guessing is 0.9825
Probability of getting between 4 and 4 answers right by guessing is 0.2252
</pre>
+<a name="math_toolkit.dist.stat_tut.weg.binom_eg.binomial_quiz_example.using_binomial_distribution_moments"></a><h5>
+<a name="id937843"></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>

- <a name="math_toolkit.dist.stat_tut.weg.binom_eg.binomial_quiz_example.using_binomial_distribution_moments"></a>
- 
-<h5>
-<a name="id1067449"></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>
-
- 
-
- Using moments of the distribution, we can say more about the spread
- of results from guessing.
- 
-
- 
+ Using moments of the distribution, we can say more about the spread
+ of results from guessing.
+ 

-
+

<pre class="programlisting">cout << "By guessing, on average, one can expect to get " << mean(quiz) << " correct answers." << endl;
cout << "Standard deviation is " << standard_deviation(quiz) << endl;
@@ -525,33 +398,23 @@
cout << "Mode (the most frequent) is " << mode(quiz) << endl;
cout << "Skewness is " << skewness(quiz) << endl;</pre>

- 
-
-
-
+ 
<pre class="programlisting">By guessing, on average, one can expect to get 4 correct answers.
Standard deviation is 1.732
So about 2/3 will lie within 1 standard deviation and get between 3 and 5 correct.
Mode (the most frequent) is 4
Skewness is 0.2887
</pre>
+<a name="math_toolkit.dist.stat_tut.weg.binom_eg.binomial_quiz_example.quantiles"></a><h5>
+<a name="id939364"></a>
+ <a class="link" href="binomial_quiz_example.html#math_toolkit.dist.stat_tut.weg.binom_eg.binomial_quiz_example.quantiles">Quantiles</a>
+ </h5>

- <a name="math_toolkit.dist.stat_tut.weg.binom_eg.binomial_quiz_example.quantiles"></a>
- 
-<h5>
-<a name="id1067821"></a>
- <a class="link" href="binomial_quiz_example.html#math_toolkit.dist.stat_tut.weg.binom_eg.binomial_quiz_example.quantiles">Quantiles</a>
- </h5>
-
- 
-
- The quantiles (percentiles or percentage points) for a few probability
- levels:
- 
-
- 
+ The quantiles (percentiles or percentage points) for a few probability
+ levels:
+ 

-
+

<pre class="programlisting">cout << "Quartiles " << quantile(quiz, 0.25) << " to "
 << quantile(complement(quiz, 0.25)) << endl; // Quartiles
@@ -569,16 +432,11 @@
cout << "If guessing then percentiles 1 to 99% will get " << quantile(quiz, 0.01)
 << " to " << quantile(complement(quiz, 0.01)) << " right." << endl;</pre>

- 
-
- 
-
- Notice that these output integral values because the default policy
- is <code class="computeroutput">integer_round_outwards</code>.
- 
+ 

-
-
+ Notice that these output integral values because the default policy
+ is <code class="computeroutput">integer_round_outwards</code>.
+ 
<pre class="programlisting">Quartiles 2 to 5
1 standard deviation 2 to 5
Deciles 1 to 6
@@ -587,111 +445,74 @@
2 to 98% 0 to 8
</pre>

- 
+ Quantiles values are controlled by the <a class="link" href="../../../../policy/pol_ref/discrete_quant_ref.html" title="Discrete Quantile Policies">discrete
+ quantile policy</a> chosen. The default is <code class="computeroutput">integer_round_outwards</code>,
+ so the lower quantile is rounded down, and the upper quantile is rounded
+ up.
+ 

- Quantiles values are controlled by the <a class="link" href="../../../../policy/pol_ref/discrete_quant_ref.html" title="Discrete Quantile Policies">discrete
- quantile policy</a> chosen. The default is <code class="computeroutput">integer_round_outwards</code>,
- so the lower quantile is rounded down, and the upper quantile is
- rounded up.
- 
-
- 
-
- But we might believe that the real values tell us a little more -
- see <a class="link" href="../../../../policy/pol_tutorial/understand_dis_quant.html" title="Understanding Quantiles of Discrete Distributions">Understanding
- Discrete Quantile Policy</a>.
- 
-
- 
-
- We could control the policy for all
- distributions by
- 
+ But we might believe that the real values tell us a little more - see
+ <a class="link" href="../../../../policy/pol_tutorial/understand_dis_quant.html" title="Understanding Quantiles of Discrete Distributions">Understanding
+ Discrete Quantile Policy</a>.
+ 

-
-
+ We could control the policy for all
+ distributions by
+ 
<pre class="programlisting">#define BOOST_MATH_DISCRETE_QUANTILE_POLICY real

at the head of the program would make this policy apply
</pre>

- 
+ to this one, and only, translation
+ unit.
+ 

- #define BOOST_MATH_DISCRETE_QUANTILE_POLICY real
- 
+ Or we can now create a (typedef for) policy that has discrete quantiles
+ real (here avoiding any 'using namespaces ...' statements):
+ 



-<pre class="programlisting">at the head of the program would make this policy apply
-</pre>
-
- 
-
- at the head of the program would make this policy apply to this
- one, and only, translation unit.
- 
-
- 
-
- Or we can now create a (typedef for) policy that has discrete quantiles
- real (here avoiding any 'using namespaces ...' statements):
- 
-
- 
-
-
-
<pre class="programlisting">using boost::math::policies::policy;
using boost::math::policies::discrete_quantile;
using boost::math::policies::real;
using boost::math::policies::integer_round_outwards; // Default.
typedef boost::math::policies::policy<discrete_quantile<real> > real_quantile_policy;</pre>

- 
-
- 
+ 

- Add a custom binomial distribution called
+ Add a custom binomial distribution called

<pre class="programlisting">real_quantile_binomial</pre>

- that uses
+ that uses

<pre class="programlisting">real_quantile_policy</pre>

- 
-
- 
+ 

-
+

<pre class="programlisting">using boost::math::binomial_distribution;
typedef binomial_distribution<double, real_quantile_policy> real_quantile_binomial;</pre>

- 
-
- 
-
- Construct an object of this custom distribution:
- 
+ 

- 
+ Construct an object of this custom distribution:
+ 

-
+

<pre class="programlisting">real_quantile_binomial quiz_real(questions, success_fraction);</pre>

- 
-
- 
-
- And use this to show some quantiles - that now have real rather than
- integer values.
- 
+ 

- 
+ And use this to show some quantiles - that now have real rather than
+ integer values.
+ 

-
+

<pre class="programlisting">cout << "Quartiles " << quantile(quiz, 0.25) << " to "
 << quantile(complement(quiz_real, 0.25)) << endl; // Quartiles 2 to 4.6212
@@ -709,10 +530,7 @@
cout << "If guessing, then percentiles 1 to 99% will get " << quantile(quiz_real, 0.01)
 << " to " << quantile(complement(quiz_real, 0.01)) << " right." << endl;</pre>

- 
-
-
-
+ 
<pre class="programlisting">Real Quantiles
Quartiles 2 to 4.621
1 standard deviation 2.665 to 4.194
@@ -723,8 +541,6 @@
If guessing then percentiles 1 to 99% will get 0 to 7.788 right.
</pre>

- 
-
 See binomial_quiz_example.cpp
 for full source code and output.

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/c_sharp.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/c_sharp.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/c_sharp.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.c_sharp"></a><a class="link" href="c_sharp.html" title="Using the Distributions from Within C#"> Using the
+<a name="math_toolkit.dist.stat_tut.weg.c_sharp"></a><a class="link" href="c_sharp.html" title="Using the Distributions from Within C#">Using the
Distributions from Within C#</a>
</h5></div></div></div>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/cs_eg.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/cs_eg.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/cs_eg.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,17 +24,16 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.cs_eg"></a><a class="link" href="cs_eg.html" title="Chi Squared Distribution Examples"> Chi Squared
+<a name="math_toolkit.dist.stat_tut.weg.cs_eg"></a><a class="link" href="cs_eg.html" title="Chi Squared Distribution Examples">Chi Squared
Distribution Examples</a>
</h5></div></div></div>
<div class="toc"><dl>
-<dt><a href="cs_eg/chi_sq_intervals.html">
- Confidence Intervals on the Standard Deviation</a></dt>
-<dt><a href="cs_eg/chi_sq_test.html">
- Chi-Square Test for the Standard Deviation</a></dt>
-<dt><a href="cs_eg/chi_sq_size.html">
- Estimating the Required Sample Sizes for a Chi-Square Test for the Standard
- Deviation</a></dt>
+<dt><a href="cs_eg/chi_sq_intervals.html">Confidence
+ Intervals on the Standard Deviation</a></dt>
+<dt><a href="cs_eg/chi_sq_test.html">Chi-Square
+ Test for the Standard Deviation</a></dt>
+<dt><a href="cs_eg/chi_sq_size.html">Estimating
+ the Required Sample Sizes for a Chi-Square Test for the Standard Deviation</a></dt>
</dl></div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/cs_eg/chi_sq_intervals.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/cs_eg/chi_sq_intervals.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/cs_eg/chi_sq_intervals.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h6 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.cs_eg.chi_sq_intervals"></a><a class="link" href="chi_sq_intervals.html" title="Confidence Intervals on the Standard Deviation">
- Confidence Intervals on the Standard Deviation</a>
+<a name="math_toolkit.dist.stat_tut.weg.cs_eg.chi_sq_intervals"></a><a class="link" href="chi_sq_intervals.html" title="Confidence Intervals on the Standard Deviation">Confidence
+ Intervals on the Standard Deviation</a>
</h6></div></div></div>

 Once you have calculated the standard deviation for your data, a legitimate
@@ -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="id1051053"></a>
+<a name="id921272"></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>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/cs_eg/chi_sq_size.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/cs_eg/chi_sq_size.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/cs_eg/chi_sq_size.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,9 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h6 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.cs_eg.chi_sq_size"></a><a class="link" href="chi_sq_size.html" title="Estimating the Required Sample Sizes for a Chi-Square Test for the Standard Deviation">
- Estimating the Required Sample Sizes for a Chi-Square Test for the Standard
- Deviation</a>
+<a name="math_toolkit.dist.stat_tut.weg.cs_eg.chi_sq_size"></a><a class="link" href="chi_sq_size.html" title="Estimating the Required Sample Sizes for a Chi-Square Test for the Standard Deviation">Estimating
+ the Required Sample Sizes for a Chi-Square Test for the Standard Deviation</a>
</h6></div></div></div>

Suppose we conduct a Chi Squared test for standard deviation and the

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/cs_eg/chi_sq_test.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/cs_eg/chi_sq_test.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/cs_eg/chi_sq_test.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h6 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.cs_eg.chi_sq_test"></a><a class="link" href="chi_sq_test.html" title="Chi-Square Test for the Standard Deviation">
- Chi-Square Test for the Standard Deviation</a>
+<a name="math_toolkit.dist.stat_tut.weg.cs_eg.chi_sq_test"></a><a class="link" href="chi_sq_test.html" title="Chi-Square Test for the Standard Deviation">Chi-Square
+ Test for the Standard Deviation</a>
</h6></div></div></div>

We use this test to determine whether the standard deviation of a sample

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/dist_construct_eg.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/dist_construct_eg.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/dist_construct_eg.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,34 +24,28 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.dist_construct_eg"></a><a class="link" href="dist_construct_eg.html" title="Distribution Construction Example">
- Distribution Construction Example</a>
+<a name="math_toolkit.dist.stat_tut.weg.dist_construct_eg"></a><a class="link" href="dist_construct_eg.html" title="Distribution Construction Example">Distribution
+ Construction Example</a>
</h5></div></div></div>

 See distribution_construction.cpp
 for full source code.
 

- 
-
- The structure of distributions is rather different from some other
- statistical libraries, for example in less object-oriented language
- like FORTRAN and C, that provide a few arguments to each free function.
- This library provides each distribution as a template C++ class. A
- distribution is constructed with a few arguments, and then member and
- non-member functions are used to find values of the distribution, often
- a function of a random variate.
- 
-
- 
-
- First we need some includes to access the negative binomial distribution
- (and the binomial, beta and gamma too).
- 
+ The structure of distributions is rather different from some other statistical
+ libraries, for example in less object-oriented language like FORTRAN
+ and C, that provide a few arguments to each free function. This library
+ provides each distribution as a template C++ class. A distribution is
+ constructed with a few arguments, and then member and non-member functions
+ are used to find values of the distribution, often a function of a random
+ variate.
+ 

- 
+ First we need some includes to access the negative binomial distribution
+ (and the binomial, beta and gamma too).
+ 

-
+

<pre class="programlisting">#include <boost/math/distributions/negative_binomial.hpp> // for negative_binomial_distribution
 using boost::math::negative_binomial_distribution; // default type is double.
@@ -61,324 +55,226 @@
#include <boost/math/distributions/gamma.hpp> // for gamma_distribution.
#include <boost/math/distributions/normal.hpp> // for normal_distribution.</pre>

- 
-
- 
-
- Several examples of constructing distributions follow:
- 
-
- 
+ 

- First, a negative binomial distribution with 8 successes and a success
- fraction 0.25, 25% or 1 in 4, is constructed like this:
- 
+ Several examples of constructing distributions follow:
+ 

- 
+ First, a negative binomial distribution with 8 successes and a success
+ fraction 0.25, 25% or 1 in 4, is constructed like this:
+ 

-
+

<pre class="programlisting">boost::math::negative_binomial_distribution<double> mydist0(8., 0.25);</pre>

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

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

-
+

<pre class="programlisting">using namespace boost::math;</pre>

- 
-
- 
-
- but this might risk ambiguity with names in std random so much better is explicit 'using boost::math::
- ' ... statements like
- 
+ 

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

-
+

<pre class="programlisting">using boost::math::negative_binomial_distribution;</pre>

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

- Since the vast majority of applications use will be using double precision,
- the template argument to the distribution (RealType) defaults to type
- double, so we can also write:
- 
+ and we can still reduce typing.
+ 

- 
+ Since the vast majority of applications use will be using double precision,
+ the template argument to the distribution (RealType) defaults to type
+ double, so we can also write:
+ 

-
+

<pre class="programlisting">negative_binomial_distribution<> mydist9(8., 0.25); // Uses default RealType = double.</pre>

- 
-
- 
-
- But the name "negative_binomial_distribution" is still inconveniently
- long, so for most distributions, a convenience typedef is provided,
- for example:
- 
+ 

-
-
+ But the name "negative_binomial_distribution" is still inconveniently
+ long, so for most distributions, a convenience typedef is provided, for
+ example:
+ 
<pre class="programlisting">typedef negative_binomial_distribution<double> negative_binomial; // Reserved name of type double.
</pre>
-
- 
<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">
- 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.
- </td></tr>
+ 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.
+ </td></tr>
</table></div>

- 
-
- So, after a using statement,
- 
-
- 
+ So, after a using statement,
+ 

-
+

<pre class="programlisting">using boost::math::negative_binomial;</pre>

- 
-
- 
-
- we have a convenient typedef to <code class="computeroutput">negative_binomial_distribution<double></code>:
- 
+ 

- 
+ we have a convenient typedef to <code class="computeroutput">negative_binomial_distribution<double></code>:
+ 

-
+

<pre class="programlisting">negative_binomial mydist(8., 0.25);</pre>

- 
-
- 
-
- Some more examples using the convenience typedef:
- 
+ 

- 
+ Some more examples using the convenience typedef:
+ 

-
+

<pre class="programlisting">negative_binomial mydist10(5., 0.4); // Both arguments double.</pre>

- 
-
- 
-
- And automatic conversion takes place, so you can use integers and floats:
- 
+ 

- 
+ And automatic conversion takes place, so you can use integers and floats:
+ 

-
+

<pre class="programlisting">negative_binomial mydist11(5, 0.4); // Using provided typedef double, int and double arguments.</pre>

- 
-
- 
-
- This is probably the most common usage.
- 
+ 

- 
+ This is probably the most common usage.
+ 

-
+

<pre class="programlisting">negative_binomial mydist12(5., 0.4F); // Double and float arguments.
negative_binomial mydist13(5, 1); // Both arguments integer.</pre>

- 
-
- 
-
- Similarly for most other distributions like the binomial.
- 
+ 

- 
+ Similarly for most other distributions like the binomial.
+ 

-
+

<pre class="programlisting">binomial mybinomial(1, 0.5); // is more concise than
binomial_distribution<> mybinomd1(1, 0.5);</pre>

- 
-
- 
-
- 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 must be used. For
- example do not use:
- 
+ 

-
-
+ 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 must be used. For example
+ do not use:
+ 
<pre class="programlisting">using boost::math::beta;
beta mybetad0(1, 0.5); // Error beta is a math FUNCTION!
</pre>

- 
-
- Which produces the error messages:
- 
-
-
-
+ Which produces the error messages:
+ 
<pre class="programlisting">error C2146: syntax error : missing ';' before identifier 'mybetad0'
warning C4551: function call missing argument list
error C3861: 'mybetad0': identifier not found
</pre>

- 
-
- Instead you should use:
- 
-
- 
+ Instead you should use:
+ 

-
+

<pre class="programlisting">using boost::math::beta_distribution;
beta_distribution<> mybetad1(1, 0.5);</pre>

- 
-
- 
-
- or for the gamma distribution:
- 
+ 

- 
+ or for the gamma distribution:
+ 

-
+

<pre class="programlisting">gamma_distribution<> mygammad1(1, 0.5);</pre>

- 
-
- 
-
- We can, of course, still provide the type explicitly thus:
- 
+ 

- 
+ We can, of course, still provide the type explicitly thus:
+ 

-
+

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

- 
-
- 
-
- And if you have your own RealType called MyFPType, for example NTL
- RR (an arbitrary precision type), then we can write:
- 
+ 

-
-
+ And if you have your own RealType called MyFPType, for example NTL RR
+ (an arbitrary precision type), then we can write:
+ 
<pre class="programlisting">negative_binomial_distribution<MyFPType> mydist6(8, 1); // Integer arguments -> MyFPType.
</pre>
-
- <a name="math_toolkit.dist.stat_tut.weg.dist_construct_eg.default_arguments_to_distribution_constructors_"></a>
- 
-<h6>
-<a name="id1041334"></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>
-
- 
-
- 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:
- 
-
-
-
+<a name="math_toolkit.dist.stat_tut.weg.dist_construct_eg.default_arguments_to_distribution_constructors_"></a><h6>
+<a name="id911782"></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>
+
+ 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:
+ 
<pre class="programlisting">negative_binomial_distribution<> mydist8;
</pre>
-
-
-
<pre class="programlisting">error C2512 no appropriate default constructor available.</pre>

- 
-
- No default constructors are provided for the negative binomial, because
- it is difficult to chose any sensible default values for this distribution.
- For other distributions, like the normal distribution, it is obviously
- very useful to provide 'standard' defaults for the mean and standard
- deviation thus:
- 
-
-
-
+ No default constructors are provided for the negative binomial, because
+ it is difficult to chose any sensible default values for this distribution.
+ For other distributions, like the normal distribution, it is obviously
+ very useful to provide 'standard' defaults for the mean and standard
+ deviation thus:
+ 
<pre class="programlisting">normal_distribution(RealType mean = 0, RealType sd = 1);
</pre>

- 
-
- So in this case we can write:
- 
-
- 
+ So in this case we can write:
+ 

-
+

<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.
@@ -386,13 +282,9 @@
 return 0;
} // int main()</pre>

- 
-
- 
-
- There is no useful output from this program, of course.
- 
+ 

+ There is no useful output from this program, of course.
 
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/error_eg.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/error_eg.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/error_eg.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.error_eg"></a><a class="link" href="error_eg.html" title="Error Handling Example"> Error Handling
+<a name="math_toolkit.dist.stat_tut.weg.error_eg"></a><a class="link" href="error_eg.html" title="Error Handling Example">Error Handling
 Example</a>
</h5></div></div></div>

@@ -43,68 +43,43 @@
 the policy.
 

- 
-
- The following example demonstrates the effect of setting the macro
- BOOST_MATH_DOMAIN_ERROR_POLICY when an invalid argument is encountered.
- For the purposes of this example, we'll pass a negative degrees of
- freedom parameter to the student's t distribution.
- 
-
- 
-
- Since we know that this is a single file program we could just add:
- 
+ The following example demonstrates the effect of setting the macro BOOST_MATH_DOMAIN_ERROR_POLICY
+ when an invalid argument is encountered. For the purposes of this example,
+ we'll pass a negative degrees of freedom parameter to the student's t
+ distribution.
+ 

-
-
+ Since we know that this is a single file program we could just add:
+ 
<pre class="programlisting">#define BOOST_MATH_DOMAIN_ERROR_POLICY ignore_error
</pre>

- 
-
- to the top of the source file to change the default policy to one that
- simply returns a NaN when a domain error occurs. Alternatively we could
- use:
- 
-
-
-
+ to the top of the source file to change the default policy to one that
+ simply returns a NaN when a domain error occurs. Alternatively we could
+ use:
+ 
<pre class="programlisting">#define BOOST_MATH_DOMAIN_ERROR_POLICY errno_on_error
</pre>

- 
-
- To ensure the <code class="computeroutput">::errno</code>
- is set when a domain error occurs as well as returning a NaN.
- 
-
- 
-
- This is safe provided the program consists of a single translation
- unit and we place the define before
- any #includes. Note that should we add the define after the includes
- then it will have no effect! A warning such as:
- 
+ To ensure the <code class="computeroutput">::errno</code>
+ is set when a domain error occurs as well as returning a NaN.
+ 

-
-
+ This is safe provided the program consists of a single translation unit
+ and we place the define before
+ any #includes. Note that should we add the define after the includes
+ then it will have no effect! A warning such as:
+ 
<pre class="programlisting">warning C4005: 'BOOST_MATH_OVERFLOW_ERROR_POLICY' : macro redefinition</pre>

- 
-
- is a certain sign that it will not have the desired
- effect.
- 
-
- 
-
- We'll begin our sample program with the needed includes:
- 
+ is a certain sign that it will not have the desired
+ effect.
+ 

- 
+ We'll begin our sample program with the needed includes:
+ 

-
+

<pre class="programlisting">// Boost
#include <boost/math/distributions/students_t.hpp>
@@ -118,18 +93,14 @@
#include <stdexcept>
 using std::exception;</pre>

- 
-
- 
-
- 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:
- 
+ 

- 
+ 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:
+ 

-
+

<pre class="programlisting">int main()
{
@@ -142,14 +113,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,20 +133,14 @@
 std::cout <<
 "\n""Message from thrown exception was:\n " << e.what() << std::endl;
 }
-
 return 0;
} // int main()</pre>

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

-
-
+ Here's what the program output looks like with a default build (one that
+ does throw exceptions):
+ 
<pre class="programlisting">Example error handling using Student's t function.
BOOST_MATH_DOMAIN_ERROR_POLICY is set to: throw_on_error

@@ -181,53 +149,30 @@
 Degrees of freedom argument is -1, but must be > 0 !
</pre>

- 
-
- Alternatively let's build with:
- 
-
-
-
+ Alternatively let's build with:
+ 
<pre class="programlisting">#define BOOST_MATH_DOMAIN_ERROR_POLICY ignore_error
</pre>

- 
-
- Now the program output is:
- 
-
-
-
+ Now the program output is:
+ 
<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>

- 
-
- And finally let's build with:
- 
-
-
-
+ And finally let's build with:
+ 
<pre class="programlisting">#define BOOST_MATH_DOMAIN_ERROR_POLICY errno_on_error
</pre>

- 
-
- Which gives the output:
- 
-
-
-
+ Which gives the output show errno:
+ 
<pre class="programlisting">Example error handling using Student's t function.
BOOST_MATH_DOMAIN_ERROR_POLICY is set to: errno_on_error
cdf returned a NaN!
errno is set to: 33
</pre>
-
- 
<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>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/f_eg.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/f_eg.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/f_eg.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.f_eg"></a><a class="link" href="f_eg.html" title="F Distribution Examples"> F Distribution
+<a name="math_toolkit.dist.stat_tut.weg.f_eg"></a><a class="link" href="f_eg.html" title="F Distribution Examples">F Distribution
Examples</a>
</h5></div></div></div>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/find_eg.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/find_eg.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/find_eg.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,16 +24,16 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.find_eg"></a><a class="link" href="find_eg.html" title="Find Location and Scale Examples"> Find Location
+<a name="math_toolkit.dist.stat_tut.weg.find_eg"></a><a class="link" href="find_eg.html" title="Find Location and Scale Examples">Find Location
and Scale Examples</a>
</h5></div></div></div>
<div class="toc"><dl>
-<dt><a href="find_eg/find_location_eg.html">
- Find Location (Mean) Example</a></dt>
-<dt><a href="find_eg/find_scale_eg.html">
- Find Scale (Standard Deviation) Example</a></dt>
-<dt><a href="find_eg/find_mean_and_sd_eg.html">
- Find mean and standard deviation example</a></dt>
+<dt><a href="find_eg/find_location_eg.html">Find
+ Location (Mean) Example</a></dt>
+<dt><a href="find_eg/find_scale_eg.html">Find
+ Scale (Standard Deviation) Example</a></dt>
+<dt><a href="find_eg/find_mean_and_sd_eg.html">Find
+ mean and standard deviation example</a></dt>
</dl></div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/find_eg/find_location_eg.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/find_eg/find_location_eg.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/find_eg/find_location_eg.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,19 +24,15 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h6 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.find_eg.find_location_eg"></a><a class="link" href="find_location_eg.html" title="Find Location (Mean) Example">
- Find Location (Mean) Example</a>
+<a name="math_toolkit.dist.stat_tut.weg.find_eg.find_location_eg"></a><a class="link" href="find_location_eg.html" title="Find Location (Mean) Example">Find
+ Location (Mean) Example</a>
</h6></div></div></div>

- 
-
- First we need some includes to access the normal distribution, the
- algorithms to find location (and some std output of course).
- 
-
- 
+ First we need some includes to access the normal distribution, the
+ algorithms to find location (and some std output of course).
+ 

-
+

<pre class="programlisting">#include <boost/math/distributions/normal.hpp> // for normal_distribution
 using boost::math::normal; // typedef provides default type is double.
@@ -58,34 +54,26 @@

</pre>

- 
-
- 
-
- For this example, we will use the standard normal distribution, with
- mean (location) zero and standard deviation (scale) unity. This is
- also the default for this implementation.
- 
+ 

- 
+ For this example, we will use the standard normal distribution, with
+ mean (location) zero and standard deviation (scale) unity. This is
+ also the default for this implementation.
+ 

-
+

<pre class="programlisting">normal N01; // Default 'standard' normal distribution with zero mean and
double sd = 1.; // normal default standard deviation is 1.</pre>

- 
-
- 
-
- Suppose we want to find a different normal distribution whose mean
- is shifted so that only fraction p (here 0.001 or 0.1%) are below
- a certain chosen limit (here -2, two standard deviations).
- 
+ 

- 
+ Suppose we want to find a different normal distribution whose mean
+ is shifted so that only fraction p (here 0.001 or 0.1%) are below a
+ certain chosen limit (here -2, two standard deviations).
+ 

-
+

<pre class="programlisting">double z = -2.; // z to give prob p
double p = 0.001; // only 0.1% below z
@@ -99,66 +87,44 @@
 << ", has " << "fraction > " << z
 << ", p = " << cdf(complement(N01, z)) << endl; // Note: uses complement.</pre>

- 
-
-
-
+ 
<pre class="programlisting">Normal distribution with mean = 0, standard deviation 1, has fraction <= -2, p = 0.0227501
Normal distribution with mean = 0, standard deviation 1, has fraction > -2, p = 0.97725
</pre>

- 
-
- We can now use ''find_location'' to give a new offset mean.
- 
-
- 
+ We can now use ''find_location'' to give a new offset mean.
+ 

-
+

<pre class="programlisting">double l = find_location<normal>(z, p, sd);
cout << "offset location (mean) = " << l << endl;</pre>

- 
-
- 
-
- that outputs:
- 
+ 

-
-
+ that outputs:
+ 
<pre class="programlisting">offset location (mean) = 1.09023
</pre>

- 
-
- showing that we need to shift the mean just over one standard deviation
- from its previous value of zero.
- 
-
- 
-
- Then we can check that we have achieved our objective by constructing
- a new distribution with the offset mean (but same standard deviation):
- 
+ showing that we need to shift the mean just over one standard deviation
+ from its previous value of zero.
+ 

- 
+ Then we can check that we have achieved our objective by constructing
+ a new distribution with the offset mean (but same standard deviation):
+ 

-
+

<pre class="programlisting">normal np001pc(l, sd); // Same standard_deviation (scale) but with mean (location) shifted.</pre>

- 
-
- 
-
- And re-calculating the fraction below our chosen limit.
- 
+ 

- 
+ And re-calculating the fraction below our chosen limit.
+ 

-
+

<pre class="programlisting">cout << "Normal distribution with mean = " << l
 << " has " << "fraction <= " << z
@@ -167,53 +133,37 @@
 << " has " << "fraction > " << z
 << ", p = " << cdf(complement(np001pc, z)) << endl;</pre>

- 
-
-
-
+ 
<pre class="programlisting">Normal distribution with mean = 1.09023 has fraction <= -2, p = 0.001
Normal distribution with mean = 1.09023 has fraction > -2, p = 0.999
</pre>
+<a name="math_toolkit.dist.stat_tut.weg.find_eg.find_location_eg.controlling_error_handling_from_find_location"></a><h5>
+<a name="id972713"></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>
+
+ We can also control the policy for handling various errors. For example,
+ we can define a new (possibly unwise) policy to ignore domain errors
+ ('bad' arguments).
+ 

- <a name="math_toolkit.dist.stat_tut.weg.find_eg.find_location_eg.controlling_error_handling_from_find_location"></a>
- 
-<h5>
-<a name="id1102612"></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>
-
- 
-
- We can also control the policy for handling various errors. For example,
- we can define a new (possibly unwise) policy to ignore domain errors
- ('bad' arguments).
- 
-
- 
-
- Unless we are using the boost::math namespace, we will need:
- 
-
- 
+ Unless we are using the boost::math namespace, we will need:
+ 

-
+

<pre class="programlisting">using boost::math::policies::policy;
using boost::math::policies::domain_error;
using boost::math::policies::ignore_error;</pre>

- 
-
- 
-
- Using a typedef is often convenient, especially if it is re-used,
- although it is not required, as the various examples below show.
- 
+ 

- 
+ Using a typedef is often convenient, especially if it is re-used, although
+ it is not required, as the various examples below show.
+ 

-
+

<pre class="programlisting">typedef policy<domain_error<ignore_error> > ignore_domain_policy;
// find_location with new policy, using typedef.
@@ -225,19 +175,15 @@
// A new policy, ignoring domain errors, without using a typedef.
l = find_location<normal>(z, p, sd, policy<domain_error<ignore_error> >());</pre>

- 
-
- 
-
- If we want to use a probability that is the <a class="link" href="../../overview.html#complements">complement
- of our probability</a>, we should not even think of writing <code class="computeroutput">find_location<normal>(z, 1 - p, sd)</code>,
- but, <a class="link" href="../../overview/complements.html#why_complements">to avoid loss of accuracy</a>,
- use the complement version.
- 
+ 

- 
+ If we want to use a probability that is the <a class="link" href="../../overview.html#complements">complement
+ of our probability</a>, we should not even think of writing <code class="computeroutput">find_location<normal>(z, 1 - p, sd)</code>,
+ but, <a class="link" href="../../overview/complements.html#why_complements">to avoid loss of accuracy</a>,
+ use the complement version.
+ 

-
+

<pre class="programlisting">z = 2.;
double q = 0.95; // = 1 - p; // complement.
@@ -250,11 +196,11 @@
 << "fraction > " << z << " = " << cdf(complement(np95pc, z)) << endl;
</pre>

- 
+ 

 See find_location_example.cpp
- for full source code: the program output looks like this:
-
+ for full source code: the program output looks like this:
+ 
<pre class="programlisting">Example: Find location (mean).
Normal distribution with mean = 0, standard deviation 1, has fraction <= -2, p = 0.0227501
Normal distribution with mean = 0, standard deviation 1, has fraction > -2, p = 0.97725
@@ -264,8 +210,6 @@
Normal distribution with mean = 0.355146 has fraction <= 2 = 0.95
Normal distribution with mean = 0.355146 has fraction > 2 = 0.05
</pre>
-
- 
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/find_eg/find_mean_and_sd_eg.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/find_eg/find_mean_and_sd_eg.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/find_eg/find_mean_and_sd_eg.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,19 +24,15 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h6 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.find_eg.find_mean_and_sd_eg"></a><a class="link" href="find_mean_and_sd_eg.html" title="Find mean and standard deviation example">
- Find mean and standard deviation example</a>
+<a name="math_toolkit.dist.stat_tut.weg.find_eg.find_mean_and_sd_eg"></a><a class="link" href="find_mean_and_sd_eg.html" title="Find mean and standard deviation example">Find
+ mean and standard deviation example</a>
</h6></div></div></div>

- 
-
- First we need some includes to access the normal distribution, the
- algorithms to find location and scale (and some std output of course).
- 
-
- 
+ First we need some includes to access the normal distribution, the
+ algorithms to find location and scale (and some std output of course).
+ 

-
+

<pre class="programlisting">#include <boost/math/distributions/normal.hpp> // for normal_distribution
 using boost::math::normal; // typedef provides default type is double.
@@ -59,108 +55,78 @@
 using std::exception;
</pre>

- 
-
- <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="id1107775"></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>
-
- 
-
- Consider an example from K Krishnamoorthy, Handbook of Statistical
- Distributions with Applications, ISBN 1-58488-635-8, (2006) p 126,
- example 10.3.7.
- 
-
- 
-
- "A machine is set to pack 3 kg of ground beef per pack. Over
- a long period of time it is found that the average packed was 3 kg
- with a standard deviation of 0.1 kg. Assume the packing is normally
- distributed."
- 
-
- 
+ 
+<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="id977712"></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>
+
+ Consider an example from K Krishnamoorthy, Handbook of Statistical
+ Distributions with Applications, ISBN 1-58488-635-8, (2006) p 126,
+ example 10.3.7.
+ 

- We start by constructing a normal distribution with the given parameters:
- 
+ "A machine is set to pack 3 kg of ground beef per pack. Over a
+ long period of time it is found that the average packed was 3 kg with
+ a standard deviation of 0.1 kg. Assume the packing is normally distributed."
+ 

- 
+ We start by constructing a normal distribution with the given parameters:
+ 

-
+

<pre class="programlisting">double mean = 3.; // kg
double standard_deviation = 0.1; // kg
normal packs(mean, standard_deviation);</pre>

- 
-
- 
-
- We can then find the fraction (or %) of packages that weigh more
- than 3.1 kg.
- 
+ 

- 
+ We can then find the fraction (or %) of packages that weigh more than
+ 3.1 kg.
+ 

-
+

<pre class="programlisting">double max_weight = 3.1; // kg
cout << "Percentage of packs > " << max_weight << " is "
<< cdf(complement(packs, max_weight)) * 100. << endl; // P(X > 3.1)</pre>

- 
-
- 
-
- We might want to ensure that 95% of packs are over a minimum weight
- specification, then we want the value of the mean such that P(X <
- 2.9) = 0.05.
- 
-
- 
+ 

- Using the mean of 3 kg, we can estimate the fraction of packs that
- fail to meet the specification of 2.9 kg.
- 
+ We might want to ensure that 95% of packs are over a minimum weight
+ specification, then we want the value of the mean such that P(X <
+ 2.9) = 0.05.
+ 

- 
+ Using the mean of 3 kg, we can estimate the fraction of packs that
+ fail to meet the specification of 2.9 kg.
+ 

-
+

<pre class="programlisting">double minimum_weight = 2.9;
cout <<"Fraction of packs <= " << minimum_weight << " with a mean of " << mean
 << " is " << cdf(complement(packs, minimum_weight)) << endl;
// fraction of packs <= 2.9 with a mean of 3 is 0.841345</pre>

- 
-
- 
-
- This is 0.84 - more than the target fraction of 0.95. If we want
- 95% to be over the minimum weight, what should we set the mean weight
- to be?
- 
-
- 
-
- Using the KK StatCalc program supplied with the book and the method
- given on page 126 gives 3.06449.
- 
+ 

- 
+ This is 0.84 - more than the target fraction of 0.95. If we want 95%
+ to be over the minimum weight, what should we set the mean weight to
+ be?
+ 

- We can confirm this by constructing a new distribution which we call
- 'xpacks' with a safety margin mean of 3.06449 thus:
- 
+ Using the KK StatCalc program supplied with the book and the method
+ given on page 126 gives 3.06449.
+ 

- 
+ We can confirm this by constructing a new distribution which we call
+ 'xpacks' with a safety margin mean of 3.06449 thus:
+ 

-
+

<pre class="programlisting">double over_mean = 3.06449;
normal xpacks(over_mean, standard_deviation);
@@ -169,17 +135,13 @@
 << " is " << cdf(complement(xpacks, minimum_weight)) << endl;
// fraction of packs >= 2.9 with a mean of 3.06449 is 0.950005</pre>

- 
-
- 
-
- Using this Math Toolkit, we can calculate the required mean directly
- thus:
- 
+ 

- 
+ Using this Math Toolkit, we can calculate the required mean directly
+ thus:
+ 

-
+

<pre class="programlisting">double under_fraction = 0.05; // so 95% are above the minimum weight mean - sd = 2.9
double low_limit = standard_deviation;
@@ -193,94 +155,69 @@
 << " is " << cdf(complement(nominal_packs, minimum_weight)) << endl;
// Setting the packer to 3.06449 will mean that fraction of packs >= 2.9 is 0.95</pre>

- 
-
- 
-
- This calculation is generalized as the free function called <a class="link" href="../../../dist_ref/dist_algorithms.html" title="Distribution Algorithms">find_location</a>.
- 
-
- 
+ 

- To use this we will need to
- 
+ This calculation is generalized as the free function called <a class="link" href="../../../dist_ref/dist_algorithms.html" title="Distribution Algorithms">find_location</a>.
+ 

- 
+ To use this we will need to
+ 

-
+

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

- 
-
- 
-
- and then use find_location function to find safe_mean, & construct
- a new normal distribution called 'goodpacks'.
- 
+ 

- 
+ and then use find_location function to find safe_mean, & construct
+ a new normal distribution called 'goodpacks'.
+ 

-
+

<pre class="programlisting">double safe_mean = find_location<normal>(minimum_weight, under_fraction, standard_deviation);
normal good_packs(safe_mean, standard_deviation);</pre>

- 
-
- 
-
- with the same confirmation as before:
- 
+ 

- 
+ with the same confirmation as before:
+ 

-
+

<pre class="programlisting">cout << "Setting the packer to " << nominal_mean << " will mean that "
 << "fraction of packs >= " << minimum_weight
 << " is " << cdf(complement(good_packs, minimum_weight)) << endl;
// Setting the packer to 3.06449 will mean that fraction of packs >= 2.9 is 0.95</pre>

- 
+ 
+<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="id978893"></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>
+
+ After examining the weight distribution of a large number of packs,
+ we might decide that, after all, the assumption of a normal distribution
+ is not really justified. We might find that the fit is better to a
+ <a class="link" href="../../../dist_ref/dists/cauchy_dist.html" title="Cauchy-Lorentz Distribution">Cauchy
+ Distribution</a>. This distribution has wider 'wings', so that whereas
+ most of the values are closer to the mean than the normal, there are
+ also more values than 'normal' that lie further from the mean than
+ the normal.
+ 

- <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="id1108988"></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>
-
- 
-
- After examining the weight distribution of a large number of packs,
- we might decide that, after all, the assumption of a normal distribution
- is not really justified. We might find that the fit is better to
- a <a class="link" href="../../../dist_ref/dists/cauchy_dist.html" title="Cauchy-Lorentz Distribution">Cauchy
- Distribution</a>. This distribution has wider 'wings', so that
- whereas most of the values are closer to the mean than the normal,
- there are also more values than 'normal' that lie further from the
- mean than the normal.
- 
-
- 
-
- This might happen because a larger than normal lump of meat is either
- included or excluded.
- 
-
- 
-
- We first create a <a class="link" href="../../../dist_ref/dists/cauchy_dist.html" title="Cauchy-Lorentz Distribution">Cauchy
- Distribution</a> with the original mean and standard deviation,
- and estimate the fraction that lie below our minimum weight specification.
- 
+ This might happen because a larger than normal lump of meat is either
+ included or excluded.
+ 

- 
+ We first create a <a class="link" href="../../../dist_ref/dists/cauchy_dist.html" title="Cauchy-Lorentz Distribution">Cauchy
+ Distribution</a> with the original mean and standard deviation,
+ and estimate the fraction that lie below our minimum weight specification.
+ 

-
+

<pre class="programlisting">cauchy cpacks(mean, standard_deviation);
cout << "Cauchy Setting the packer to " << mean << " will mean that "
@@ -288,39 +225,29 @@
 << " is " << cdf(complement(cpacks, minimum_weight)) << endl;
// Cauchy Setting the packer to 3 will mean that fraction of packs >= 2.9 is 0.75</pre>

- 
-
- 
-
- Note that far fewer of the packs meet the specification, only 75%
- instead of 95%. Now we can repeat the find_location, using the cauchy
- distribution as template parameter, in place of the normal used above.
- 
+ 

- 
+ Note that far fewer of the packs meet the specification, only 75% instead
+ of 95%. Now we can repeat the find_location, using the cauchy distribution
+ as template parameter, in place of the normal used above.
+ 

-
+

<pre class="programlisting">double lc = find_location<cauchy>(minimum_weight, under_fraction, standard_deviation);
cout << "find_location<cauchy>(minimum_weight, over fraction, standard_deviation); " << lc << endl;
// find_location<cauchy>(minimum_weight, over fraction, packs.standard_deviation()); 3.53138</pre>

- 
-
- 
-
- Note that the safe_mean setting needs to be much higher, 3.53138
- instead of 3.06449, so we will make rather less profit.
- 
-
- 
+ 

- And again confirm that the fraction meeting specification is as expected.
- 
+ Note that the safe_mean setting needs to be much higher, 3.53138 instead
+ of 3.06449, so we will make rather less profit.
+ 

- 
+ And again confirm that the fraction meeting specification is as expected.
+ 

-
+

<pre class="programlisting">cauchy goodcpacks(lc, standard_deviation);
cout << "Cauchy Setting the packer to " << lc << " will mean that "
@@ -328,17 +255,13 @@
 << " is " << cdf(complement(goodcpacks, minimum_weight)) << endl;
// Cauchy Setting the packer to 3.53138 will mean that fraction of packs >= 2.9 is 0.95</pre>

- 
-
- 
-
- Finally we could estimate the effect of a much tighter specification,
- that 99% of packs met the specification.
- 
+ 

- 
+ Finally we could estimate the effect of a much tighter specification,
+ that 99% of packs met the specification.
+ 

-
+

<pre class="programlisting">cout << "Cauchy Setting the packer to "
 << find_location<cauchy>(minimum_weight, 0.99, standard_deviation)
@@ -346,114 +269,81 @@
 << "fraction of packs >= " << minimum_weight
 << " is " << cdf(complement(goodcpacks, minimum_weight)) << endl;</pre>

- 
-
- 
-
- Setting the packer to 3.13263 will mean that fraction of packs >=
- 2.9 is 0.99, but will more than double the mean loss from 0.0644
- to 0.133 kg per pack.
- 
-
- 
-
- Of course, this calculation is not limited to packs of meat, it applies
- to dispensing anything, and it also applies to a 'virtual' material
- like any measurement.
- 
-
- 
-
- The only caveat is that the calculation assumes that the standard
- deviation (scale) is known with a reasonably low uncertainty, something
- that is not so easy to ensure in practice. And that the distribution
- is well defined, <a class="link" href="../../../dist_ref/dists/normal_dist.html" title="Normal (Gaussian) Distribution">Normal
- Distribution</a> or <a class="link" href="../../../dist_ref/dists/cauchy_dist.html" title="Cauchy-Lorentz Distribution">Cauchy
- Distribution</a>, or some other.
- 
-
- 
-
- If one is simply dispensing a very large number of packs, then it
- may be feasible to measure the weight of hundreds or thousands of
- packs. With a healthy 'degrees of freedom', the confidence intervals
- for the standard deviation are not too wide, typically about + and
- - 10% for hundreds of observations.
- 
-
- 
-
- For other applications, where it is more difficult or expensive to
- make many observations, the confidence intervals are depressingly
- wide.
- 
-
- 
+ 

- See <a class="link" href="../cs_eg/chi_sq_intervals.html" title="Confidence Intervals on the Standard Deviation">Confidence
- Intervals on the standard deviation</a> for a worked example
- chi_square_std_dev_test.cpp
- of estimating these intervals.
- 
+ Setting the packer to 3.13263 will mean that fraction of packs >=
+ 2.9 is 0.99, but will more than double the mean loss from 0.0644 to
+ 0.133 kg per pack.
+ 

- <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="id1109636"></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>
+ Of course, this calculation is not limited to packs of meat, it applies
+ to dispensing anything, and it also applies to a 'virtual' material
+ like any measurement.
+ 

- 
+ The only caveat is that the calculation assumes that the standard deviation
+ (scale) is known with a reasonably low uncertainty, something that
+ is not so easy to ensure in practice. And that the distribution is
+ well defined, <a class="link" href="../../../dist_ref/dists/normal_dist.html" title="Normal (Gaussian) Distribution">Normal
+ Distribution</a> or <a class="link" href="../../../dist_ref/dists/cauchy_dist.html" title="Cauchy-Lorentz Distribution">Cauchy
+ Distribution</a>, or some other.
+ 

- Alternatively, we could invest in a better (more precise) packer
- (or measuring device) with a lower standard deviation, or scale.
- 
+ If one is simply dispensing a very large number of packs, then it may
+ be feasible to measure the weight of hundreds or thousands of packs.
+ With a healthy 'degrees of freedom', the confidence intervals for the
+ standard deviation are not too wide, typically about + and - 10% for
+ hundreds of observations.
+ 

- 
+ For other applications, where it is more difficult or expensive to
+ make many observations, the confidence intervals are depressingly wide.
+ 

- This might cost more, but would reduce the amount we have to 'give
- away' in order to meet the specification.
- 
+ See <a class="link" href="../cs_eg/chi_sq_intervals.html" title="Confidence Intervals on the Standard Deviation">Confidence
+ Intervals on the standard deviation</a> for a worked example chi_square_std_dev_test.cpp
+ of estimating these intervals.
+ 
+<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="id979701"></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>

- 
+ Alternatively, we could invest in a better (more precise) packer (or
+ measuring device) with a lower standard deviation, or scale.
+ 

- To estimate how much better (how much smaller standard deviation)
- it would have to be, we need to get the 5% quantile to be located
- at the under_weight limit, 2.9
- 
+ This might cost more, but would reduce the amount we have to 'give
+ away' in order to meet the specification.
+ 

- 
+ To estimate how much better (how much smaller standard deviation) it
+ would have to be, we need to get the 5% quantile to be located at the
+ under_weight limit, 2.9
+ 

-
+

<pre class="programlisting">double p = 0.05; // wanted p th quantile.
cout << "Quantile of " << p << " = " << quantile(packs, p)
 << ", mean = " << packs.mean() << ", sd = " << packs.standard_deviation() << endl;</pre>

- 
-
- 
-
- Quantile of 0.05 = 2.83551, mean = 3, sd = 0.1
- 
-
- 
-
- With the current packer (mean = 3, sd = 0.1), the 5% quantile is
- at 2.8551 kg, a little below our target of 2.9 kg. So we know that
- the standard deviation is going to have to be smaller.
- 
+ 

- 
+ Quantile of 0.05 = 2.83551, mean = 3, sd = 0.1
+ 

- Let's start by guessing that it (now 0.1) needs to be halved, to
- a standard deviation of 0.05 kg.
- 
+ With the current packer (mean = 3, sd = 0.1), the 5% quantile is at
+ 2.8551 kg, a little below our target of 2.9 kg. So we know that the
+ standard deviation is going to have to be smaller.
+ 

- 
+ Let's start by guessing that it (now 0.1) needs to be halved, to a
+ standard deviation of 0.05 kg.
+ 

-
+

<pre class="programlisting">normal pack05(mean, 0.05);
cout << "Quantile of " << p << " = " << quantile(pack05, p)
@@ -465,20 +355,15 @@
 << " is " << cdf(complement(pack05, minimum_weight)) << endl;
// Fraction of packs >= 2.9 with a mean of 3 and standard deviation of 0.05 is 0.97725</pre>

- 
-
- 
-
- So 0.05 was quite a good guess, but we are a little over the 2.9
- target, so the standard deviation could be a tiny bit more. So we
- could do some more guessing to get closer, say by increasing standard
- deviation to 0.06 kg, constructing another new distribution called
- pack06.
- 
+ 

- 
+ So 0.05 was quite a good guess, but we are a little over the 2.9 target,
+ so the standard deviation could be a tiny bit more. So we could do
+ some more guessing to get closer, say by increasing standard deviation
+ to 0.06 kg, constructing another new distribution called pack06.
+ 

-
+

<pre class="programlisting">normal pack06(mean, 0.06);
cout << "Quantile of " << p << " = " << quantile(pack06, p)
@@ -490,46 +375,34 @@
 << " is " << cdf(complement(pack06, minimum_weight)) << endl;
// Fraction of packs >= 2.9 with a mean of 3 and standard deviation of 0.06 is 0.95221</pre>

- 
-
- 
-
- Now we are getting really close, but to do the job properly, we might
- need to use root finding method, for example the tools provided,
- and used elsewhere, in the Math Toolkit, see <a class="link" href="../../../../toolkit/internals1/roots2.html" title="Root Finding Without Derivatives">Root
- Finding Without Derivatives</a>.
- 
-
- 
-
- But in this (normal) distribution case, we can and should be even
- smarter and make a direct calculation.
- 
-
- 
-
- Our required limit is minimum_weight = 2.9 kg, often called the random
- variate z. For a standard normal distribution, then probability p
- = N((minimum_weight - mean) / sd).
- 
+ 

- 
+ Now we are getting really close, but to do the job properly, we might
+ need to use root finding method, for example the tools provided, and
+ used elsewhere, in the Math Toolkit, see <a class="link" href="../../../../toolkit/internals1/roots2.html" title="Root Finding Without Derivatives">Root
+ Finding Without Derivatives</a>.
+ 

- We want to find the standard deviation that would be required to
- meet this limit, so that the p th quantile is located at z (minimum_weight).
- In this case, the 0.05 (5%) quantile is at 2.9 kg pack weight, when
- the mean is 3 kg, ensuring that 0.95 (95%) of packs are above the
- minimum weight.
- 
+ But in this (normal) distribution case, we can and should be even smarter
+ and make a direct calculation.
+ 

- 
+ Our required limit is minimum_weight = 2.9 kg, often called the random
+ variate z. For a standard normal distribution, then probability p =
+ N((minimum_weight - mean) / sd).
+ 

- Rearranging, we can directly calculate the required standard deviation:
- 
+ We want to find the standard deviation that would be required to meet
+ this limit, so that the p th quantile is located at z (minimum_weight).
+ In this case, the 0.05 (5%) quantile is at 2.9 kg pack weight, when
+ the mean is 3 kg, ensuring that 0.95 (95%) of packs are above the minimum
+ weight.
+ 

- 
+ Rearranging, we can directly calculate the required standard deviation:
+ 

-
+

<pre class="programlisting">normal N01; // standard normal distribution with meamn zero and unit standard deviation.
p = 0.05;
@@ -540,17 +413,13 @@
 << minimum_weight << ", would need a standard deviation of " << sd95 << endl;
// For the 0.05th quantile to be located at 2.9, would need a standard deviation of 0.0607957</pre>

- 
-
- 
-
- We can now construct a new (normal) distribution pack95 for the 'better'
- packer, and check that our distribution will meet the specification.
- 
+ 

- 
+ We can now construct a new (normal) distribution pack95 for the 'better'
+ packer, and check that our distribution will meet the specification.
+ 

-
+

<pre class="programlisting">normal pack95(mean, sd95);
cout <<"Fraction of packs >= " << minimum_weight << " with a mean of " << mean
@@ -558,108 +427,75 @@
 << " is " << cdf(complement(pack95, minimum_weight)) << endl;
// Fraction of packs >= 2.9 with a mean of 3 and standard deviation of 0.0607957 is 0.95</pre>

- 
-
- 
-
- This calculation is generalized in the free function find_scale,
- as shown below, giving the same standard deviation.
- 
+ 

- 
+ This calculation is generalized in the free function find_scale, as
+ shown below, giving the same standard deviation.
+ 

-
+

<pre class="programlisting">double ss = find_scale<normal>(minimum_weight, under_fraction, packs.mean());
cout << "find_scale<normal>(minimum_weight, under_fraction, packs.mean()); " << ss << endl;
// find_scale<normal>(minimum_weight, under_fraction, packs.mean()); 0.0607957</pre>

- 
-
- 
-
- If we had defined an over_fraction, or percentage that must pass
- specification
- 
+ 

- 
+ If we had defined an over_fraction, or percentage that must pass specification
+ 

-
+

<pre class="programlisting">double over_fraction = 0.95;</pre>

- 
-
- 
-
- And (wrongly) written
- 
+ 

-
-
+ And (wrongly) written
+ 
<pre class="programlisting">double sso = find_scale<normal>(minimum_weight, over_fraction, packs.mean());
</pre>

- 
-
- With the default policy, we would get a message like
- 
-
-
-
+ With the default policy, we would get a message like
+ 
<pre class="programlisting">Message from thrown exception was:
 Error in function boost::math::find_scale<Dist, Policy>(double, double, double, Policy):
 Computed scale (-0.060795683191176959) is <= 0! Was the complement intended?
</pre>

- 
-
- But this would return a negative
- standard deviation - obviously impossible. The probability should
- be 1 - over_fraction, not over_fraction, thus:
- 
-
- 
+ But this would return a negative standard
+ deviation - obviously impossible. The probability should be 1 - over_fraction,
+ not over_fraction, thus:
+ 

-
+

<pre class="programlisting">double ss1o = find_scale<normal>(minimum_weight, 1 - over_fraction, packs.mean());
cout << "find_scale<normal>(minimum_weight, under_fraction, packs.mean()); " << ss1o << endl;
// find_scale<normal>(minimum_weight, under_fraction, packs.mean()); 0.0607957</pre>

- 
-
- 
-
- But notice that using '1 - over_fraction' - will lead to a <a class="link" href="../../overview/complements.html#why_complements">loss of accuracy, especially if over_fraction
- was close to unity.</a> In this (very common) case, we should
- instead use the <a class="link" href="../../overview.html#complements">complements</a>, giving
- the most accurate result.
- 
+ 

- 
+ But notice that using '1 - over_fraction' - will lead to a <a class="link" href="../../overview/complements.html#why_complements">loss
+ of accuracy, especially if over_fraction was close to unity.</a>
+ In this (very common) case, we should instead use the <a class="link" href="../../overview.html#complements">complements</a>,
+ giving the most accurate result.
+ 

-
+

<pre class="programlisting">double ssc = find_scale<normal>(complement(minimum_weight, over_fraction, packs.mean()));
cout << "find_scale<normal>(complement(minimum_weight, over_fraction, packs.mean())); " << ssc << endl;
// find_scale<normal>(complement(minimum_weight, over_fraction, packs.mean())); 0.0607957</pre>

- 
-
- 
-
- Note that our guess of 0.06 was close to the accurate value of 0.060795683191176959.
- 
-
- 
+ 

- We can again confirm our prediction thus:
- 
+ Note that our guess of 0.06 was close to the accurate value of 0.060795683191176959.
+ 

- 
+ We can again confirm our prediction thus:
+ 

-
+

<pre class="programlisting">normal pack95c(mean, ssc);
cout <<"Fraction of packs >= " << minimum_weight << " with a mean of " << mean
@@ -667,45 +503,31 @@
 << " is " << cdf(complement(pack95c, minimum_weight)) << endl;
// Fraction of packs >= 2.9 with a mean of 3 and standard deviation of 0.0607957 is 0.95</pre>

- 
-
- 
-
- Notice that these two deceptively simple questions:
- 
+ 

- 
+ Notice that these two deceptively simple questions:
+ 
<div class="itemizedlist"><ul type="disc"><li>
- Do we over-fill to make sure we meet a minimum specification
- (or under-fill to avoid an overdose)?
- </li></ul></div>
-
- 
+ Do we over-fill to make sure we meet a minimum specification (or
+ under-fill to avoid an overdose)?
+ </li></ul></div>

- and/or
- 
-
- 
+ and/or
+ 
<div class="itemizedlist"><ul type="disc"><li>
- Do we measure better?
- </li></ul></div>
-
- 
+ Do we measure better?
+ </li></ul></div>

- are actually extremely common.
- 
-
- 
-
- The weight of beef might be replaced by a measurement of more or
- less anything, from drug tablet content, Apollo landing rocket firing,
- X-ray treatment doses...
- 
+ are actually extremely common.
+ 

- 
+ The weight of beef might be replaced by a measurement of more or less
+ anything, from drug tablet content, Apollo landing rocket firing, X-ray
+ treatment doses...
+ 

- The scale can be variation in dispensing or uncertainty in measurement.
- 
+ The scale can be variation in dispensing or uncertainty in measurement.
+ 

 See find_mean_and_sd_normal.cpp
 for full source code & appended program output.

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/find_eg/find_scale_eg.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/find_eg/find_scale_eg.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/find_eg/find_scale_eg.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,20 +24,16 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h6 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.find_eg.find_scale_eg"></a><a class="link" href="find_scale_eg.html" title="Find Scale (Standard Deviation) Example">
- Find Scale (Standard Deviation) Example</a>
+<a name="math_toolkit.dist.stat_tut.weg.find_eg.find_scale_eg"></a><a class="link" href="find_scale_eg.html" title="Find Scale (Standard Deviation) Example">Find
+ Scale (Standard Deviation) Example</a>
</h6></div></div></div>

- 
-
- First we need some includes to access the <a class="link" href="../../../dist_ref/dists/normal_dist.html" title="Normal (Gaussian) Distribution">Normal
- Distribution</a>, the algorithms to find scale (and some std output
- of course).
- 
-
- 
+ First we need some includes to access the <a class="link" href="../../../dist_ref/dists/normal_dist.html" title="Normal (Gaussian) Distribution">Normal
+ Distribution</a>, the algorithms to find scale (and some std output
+ of course).
+ 

-
+

<pre class="programlisting">#include <boost/math/distributions/normal.hpp> // for normal_distribution
 using boost::math::normal; // typedef provides default type is double.
@@ -54,35 +50,27 @@
 using std::numeric_limits;
</pre>

- 
-
- 
-
- For this example, we will use the standard <a class="link" href="../../../dist_ref/dists/normal_dist.html" title="Normal (Gaussian) Distribution">Normal
- Distribution</a>, with location (mean) zero and standard deviation
- (scale) unity. Conveniently, this is also the default for this implementation's
- constructor.
- 
+ 

- 
+ For this example, we will use the standard <a class="link" href="../../../dist_ref/dists/normal_dist.html" title="Normal (Gaussian) Distribution">Normal
+ Distribution</a>, with location (mean) zero and standard deviation
+ (scale) unity. Conveniently, this is also the default for this implementation's
+ constructor.
+ 

-
+

<pre class="programlisting">normal N01; // Default 'standard' normal distribution with zero mean
double sd = 1.; // and standard deviation is 1.</pre>

- 
-
- 
-
- Suppose we want to find a different normal distribution with standard
- deviation so that only fraction p (here 0.001 or 0.1%) are below
- a certain chosen limit (here -2. standard deviations).
- 
+ 

- 
+ Suppose we want to find a different normal distribution with standard
+ deviation so that only fraction p (here 0.001 or 0.1%) are below a
+ certain chosen limit (here -2. standard deviations).
+ 

-
+

<pre class="programlisting">double z = -2.; // z to give prob p
double p = 0.001; // only 0.1% below z = -2
@@ -96,70 +84,46 @@
 << ", has " << "fraction > " << z
 << ", p = " << cdf(complement(N01, z)) << endl; // Note: uses complement.</pre>

- 
-
-
-
+ 
<pre class="programlisting">Normal distribution with mean = 0 has fraction <= -2, p = 0.0227501
Normal distribution with mean = 0 has fraction > -2, p = 0.97725
</pre>

- 
-
- Noting that p = 0.02 instead of our target of 0.001, we can now use
- <code class="computeroutput">find_scale</code> to give
- a new standard deviation.
- 
-
- 
+ Noting that p = 0.02 instead of our target of 0.001, we can now use
+ <code class="computeroutput">find_scale</code> to give
+ a new standard deviation.
+ 

-
+

<pre class="programlisting">double l = N01.location();
double s = find_scale<normal>(z, p, l);
cout << "scale (standard deviation) = " << s << endl;</pre>

- 
-
- 
-
- that outputs:
- 
+ 

-
-
+ that outputs:
+ 
<pre class="programlisting">scale (standard deviation) = 0.647201
</pre>

- 
-
- showing that we need to reduce the standard deviation from 1. to
- 0.65.
- 
-
- 
-
- Then we can check that we have achieved our objective by constructing
- a new distribution with the new standard deviation (but same zero
- mean):
- 
+ showing that we need to reduce the standard deviation from 1. to 0.65.
+ 

- 
+ Then we can check that we have achieved our objective by constructing
+ a new distribution with the new standard deviation (but same zero mean):
+ 

-
+

<pre class="programlisting">normal np001pc(N01.location(), s);</pre>

- 
-
- 
-
- And re-calculating the fraction below (and above) our chosen limit.
- 
+ 

- 
+ And re-calculating the fraction below (and above) our chosen limit.
+ 

-
+

<pre class="programlisting">cout << "Normal distribution with mean = " << l
 << " has " << "fraction <= " << z
@@ -168,53 +132,37 @@
 << " has " << "fraction > " << z
 << ", p = " << cdf(complement(np001pc, z)) << endl;</pre>

- 
-
-
-
+ 
<pre class="programlisting">Normal distribution with mean = 0 has fraction <= -2, p = 0.001
Normal distribution with mean = 0 has fraction > -2, p = 0.999
</pre>
+<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="id975001"></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>
+
+ We can also control the policy for handling various errors. For example,
+ we can define a new (possibly unwise) policy to ignore domain errors
+ ('bad' arguments).
+ 

- <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="id1104952"></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>
-
- 
-
- We can also control the policy for handling various errors. For example,
- we can define a new (possibly unwise) policy to ignore domain errors
- ('bad' arguments).
- 
-
- 
-
- Unless we are using the boost::math namespace, we will need:
- 
-
- 
+ Unless we are using the boost::math namespace, we will need:
+ 

-
+

<pre class="programlisting">using boost::math::policies::policy;
using boost::math::policies::domain_error;
using boost::math::policies::ignore_error;</pre>

- 
-
- 
-
- Using a typedef is convenient, especially if it is re-used, although
- it is not required, as the various examples below show.
- 
+ 

- 
+ Using a typedef is convenient, especially if it is re-used, although
+ it is not required, as the various examples below show.
+ 

-
+

<pre class="programlisting">typedef policy<domain_error<ignore_error> > ignore_domain_policy;
// find_scale with new policy, using typedef.
@@ -227,20 +175,16 @@
// New policy, without typedef.
l = find_scale<normal>(z, p, l, policy<domain_error<ignore_error> >());</pre>

- 
-
- 
-
- If we want to express a probability, say 0.999, that is a complement,
- <code class="computeroutput">1 -
- p</code> we should not even think
- of writing <code class="computeroutput">find_scale<normal>(z, 1 - p, l)</code>, but <a class="link" href="../../overview/complements.html#why_complements">instead</a>,
- use the <a class="link" href="../../overview.html#complements">complements</a> version.
- 
+ 

- 
+ If we want to express a probability, say 0.999, that is a complement,
+ <code class="computeroutput">1 -
+ p</code> we should not even think
+ of writing <code class="computeroutput">find_scale<normal>(z, 1 - p, l)</code>, but <a class="link" href="../../overview/complements.html#why_complements">instead</a>,
+ use the <a class="link" href="../../overview.html#complements">complements</a> version.
+ 

-
+

<pre class="programlisting">z = -2.;
double q = 0.999; // = 1 - p; // complement of 0.001.
@@ -252,31 +196,24 @@
cout << "Normal distribution with mean = " << l << " has "
 << "fraction > " << z << " = " << cdf(complement(np95pc, z)) << endl;</pre>

- 
-
- 
-
- Sadly, it is all too easy to get probabilities the wrong way round,
- when you may get a warning like this:
- 
+ 

-
-
+ Sadly, it is all too easy to get probabilities the wrong way round,
+ when you may get a warning like this:
+ 
<pre class="programlisting">Message from thrown exception was:
 Error in function boost::math::find_scale<Dist, Policy>(complement(double, double, double, Policy)):
 Computed scale (-0.48043523852179076) is <= 0! Was the complement intended?
</pre>

- 
-
- The default error handling policy is to throw an exception with this
- message, but if you chose a policy to ignore the error, the (impossible)
- negative scale is quietly returned.
- 
+ The default error handling policy is to throw an exception with this
+ message, but if you chose a policy to ignore the error, the (impossible)
+ negative scale is quietly returned.
+ 

 See find_scale_example.cpp
- for full source code: the program output looks like this:
-
+ for full source code: the program output looks like this:
+ 
<pre class="programlisting">Example: Find scale (standard deviation).
Normal distribution with mean = 0, standard deviation 1, has fraction <= -2, p = 0.0227501
Normal distribution with mean = 0, standard deviation 1, has fraction > -2, p = 0.97725
@@ -286,8 +223,6 @@
Normal distribution with mean = 0.946339 has fraction <= -2 = 0.001
Normal distribution with mean = 0.946339 has fraction > -2 = 0.999
</pre>
-
- 
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/inverse_gamma_eg.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/inverse_gamma_eg.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/inverse_gamma_eg.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -22,10 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="normal_example/normal_misc.html"><img src="../../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../weg.html"><img src="../../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="nccs_eg.html"><img src="../../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" lang="en"><div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.inverse_gamma_eg"></a><a class="link" href="inverse_gamma_eg.html" title="Inverse Gamma Distribution Bayes Example">
- Inverse Gamma Distribution Bayes Example</a>
-</h5></div></div></div></div>
+<div class="section" lang="en">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="math_toolkit.dist.stat_tut.weg.inverse_gamma_eg"></a><a class="link" href="inverse_gamma_eg.html" title="Inverse Gamma Distribution Bayes Example">Inverse
+ Gamma Distribution Bayes Example</a>
+</h5></div></div></div>
+
+ TODO
+ 
+</div>
<table xmlns:rev="http://www.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, 2010 John Maddock, Paul A. Bristow,

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/nag_library.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/nag_library.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/nag_library.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.nag_library"></a><a class="link" href="nag_library.html" title="Comparison with C, R, FORTRAN-style Free Functions"> Comparison
+<a name="math_toolkit.dist.stat_tut.weg.nag_library"></a><a class="link" href="nag_library.html" title="Comparison with C, R, FORTRAN-style Free Functions">Comparison
with C, R, FORTRAN-style Free Functions</a>
</h5></div></div></div>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/nccs_eg.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/nccs_eg.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/nccs_eg.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.nccs_eg"></a><a class="link" href="nccs_eg.html" title="Non Central Chi Squared Example"> Non Central
+<a name="math_toolkit.dist.stat_tut.weg.nccs_eg"></a><a class="link" href="nccs_eg.html" title="Non Central Chi Squared Example">Non Central
 Chi Squared Example</a>
</h5></div></div></div>
-<div class="toc"><dl><dt><a href="nccs_eg/nccs_power_eg.html">
- Tables of the power function of the χ2 test.</a></dt></dl></div>
+<div class="toc"><dl><dt><a href="nccs_eg/nccs_power_eg.html">Tables
+ of the power function of the χ2 test.</a></dt></dl></div>

 (See also the reference documentation for the <a class="link" href="../../dist_ref/dists/nc_chi_squared_dist.html" title="Noncentral Chi-Squared Distribution">Noncentral
 Chi Squared Distribution</a>.)

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/nccs_eg/nccs_power_eg.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/nccs_eg/nccs_power_eg.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/nccs_eg/nccs_power_eg.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,29 +24,23 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h6 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.nccs_eg.nccs_power_eg"></a><a class="link" href="nccs_power_eg.html" title="Tables of the power function of the χ2 test.">
- Tables of the power function of the χ2 test.</a>
+<a name="math_toolkit.dist.stat_tut.weg.nccs_eg.nccs_power_eg"></a><a class="link" href="nccs_power_eg.html" title="Tables of the power function of the χ2 test.">Tables
+ of the power function of the χ2 test.</a>
</h6></div></div></div>

- 
-
- This example computes a table of the power of the χ2
-test at the 5%
- significance level, for various degrees of freedom and non-centrality
- parameters. The table is deliberately the same as Table 6 from "The
- Non-Central χ2 and F-Distributions and their applications.", P.
- B. Patnaik, Biometrika, Vol. 36, No. 1/2 (June 1949), 202-232.
- 
-
- 
-
- First we need some includes to access the non-central chi squared
- distribution (and some basic std output of course).
- 
+ This example computes a table of the power of the χ2
+test at the 5% significance
+ level, for various degrees of freedom and non-centrality parameters.
+ The table is deliberately the same as Table 6 from "The Non-Central
+ χ2 and F-Distributions and their applications.", P. B. Patnaik,
+ Biometrika, Vol. 36, No. 1/2 (June 1949), 202-232.
+ 

- 
+ First we need some includes to access the non-central chi squared distribution
+ (and some basic std output of course).
+ 

-
+

<pre class="programlisting">#include <boost/math/distributions/non_central_chi_squared.hpp>
using boost::math::chi_squared;
@@ -59,17 +53,13 @@
int main()
{</pre>

- 
-
- 
-
- Create a table of the power of the χ2 test at 5% significance level,
- start with a table header:
- 
+ 

- 
+ Create a table of the power of the χ2 test at 5% significance level,
+ start with a table header:
+ 

-
+

<pre class="programlisting">cout << "[table\n[[[nu]]";
for(int lam = 2; lam <= 20; lam += 2)
@@ -78,22 +68,16 @@
}
cout << "]\n";</pre>

- 
-
- 
-
- (Note: the enclosing [] brackets are to format as a table in Boost.Quickbook).
- 
-
- 
+ 

- Enumerate the rows and columns and print the power of the test for
- each table cell:
- 
+ (Note: the enclosing [] brackets are to format as a table in Boost.Quickbook).
+ 

- 
+ Enumerate the rows and columns and print the power of the test for
+ each table cell:
+ 

-
+

<pre class="programlisting">for(int n = 2; n <= 20; ++n)
{
@@ -101,43 +85,31 @@
 for(int lam = 2; lam <= 20; lam += 2)
 {</pre>

- 
-
- 
-
- Calculate the χ2 statistic for a 5% significance:
- 
+ 

- 
+ Calculate the χ2 statistic for a 5% significance:
+ 

-
+

<pre class="programlisting">double cs = quantile(complement(chi_squared(n), 0.05));</pre>

- 
-
- 
-
- The power of the test is given by the complement of the CDF of the
- non-central χ2 distribution:
- 
+ 

- 
+ The power of the test is given by the complement of the CDF of the
+ non-central χ2 distribution:
+ 

-
+

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

- 
-
- 
-
- Then output the cell value:
- 
+ 

- 
+ Then output the cell value:
+ 

-
+

<pre class="programlisting"> cout << "[" << setprecision(3) << beta << "]";
 }
@@ -146,24 +118,18 @@
 cout << "]" << endl;
}</pre>

- 
-
- 
-
- The output from this program is a table in Boost.Quickbook format
- as shown below.
- 
-
- 
+ 

- We can interpret this as follows - for example if ν=10 and λ=10 then
- the power of the test is 0.542 - so we have only a 54% chance of
- correctly detecting that our null hypothesis is false, and a 46%
- chance of incurring a type II error (failing to reject the null hypothesis
- when it is in fact false):
- 
+ The output from this program is a table in Boost.Quickbook format as
+ shown below.
+ 

- 
+ We can interpret this as follows - for example if ν=10 and λ=10 then
+ the power of the test is 0.542 - so we have only a 54% chance of correctly
+ detecting that our null hypothesis is false, and a 46% chance of incurring
+ a type II error (failing to reject the null hypothesis when it is in
+ fact false):
+ 
<div class="informaltable"><table class="table">
<colgroup>
<col>
@@ -180,1154 +146,1150 @@
</colgroup>
<thead><tr>
<th>
- 
- ν
- 
- </th>
+ 
+ ν
+ 
+ </th>
<th>
- 
- λ=2
- 
- </th>
+ 
+ λ=2
+ 
+ </th>
<th>
- 
- λ=4
- 
- </th>
+ 
+ λ=4
+ 
+ </th>
<th>
- 
- λ=6
- 
- </th>
+ 
+ λ=6
+ 
+ </th>
<th>
- 
- λ=8
- 
- </th>
+ 
+ λ=8
+ 
+ </th>
<th>
- 
- λ=10
- 
- </th>
+ 
+ λ=10
+ 
+ </th>
<th>
- 
- λ=12
- 
- </th>
+ 
+ λ=12
+ 
+ </th>
<th>
- 
- λ=14
- 
- </th>
+ 
+ λ=14
+ 
+ </th>
<th>
- 
- λ=16
- 
- </th>
+ 
+ λ=16
+ 
+ </th>
<th>
- 
- λ=18
- 
- </th>
+ 
+ λ=18
+ 
+ </th>
<th>
- 
- λ=20
- 
- </th>
+ 
+ λ=20
+ 
+ </th>
</tr></thead>
<tbody>
<tr>
<td>
- 
- 2
- 
- </td>
-<td>
- 
- 0.226
- 
- </td>
-<td>
- 
- 0.415
- 
- </td>
-<td>
- 
- 0.584
- 
- </td>
-<td>
- 
- 0.718
- 
- </td>
-<td>
- 
- 0.815
- 
- </td>
-<td>
- 
- 0.883
- 
- </td>
-<td>
- 
- 0.928
- 
- </td>
-<td>
- 
- 0.957
- 
- </td>
-<td>
- 
- 0.974
- 
- </td>
-<td>
- 
- 0.985
- 
- </td>
+ 
+ 2
+ 
+ </td>
+<td>
+ 
+ 0.226
+ 
+ </td>
+<td>
+ 
+ 0.415
+ 
+ </td>
+<td>
+ 
+ 0.584
+ 
+ </td>
+<td>
+ 
+ 0.718
+ 
+ </td>
+<td>
+ 
+ 0.815
+ 
+ </td>
+<td>
+ 
+ 0.883
+ 
+ </td>
+<td>
+ 
+ 0.928
+ 
+ </td>
+<td>
+ 
+ 0.957
+ 
+ </td>
+<td>
+ 
+ 0.974
+ 
+ </td>
+<td>
+ 
+ 0.985
+ 
+ </td>
</tr>
<tr>
<td>
- 
- 3
- 
- </td>
-<td>
- 
- 0.192
- 
- </td>
-<td>
- 
- 0.359
- 
- </td>
-<td>
- 
- 0.518
- 
- </td>
-<td>
- 
- 0.654
- 
- </td>
-<td>
- 
- 0.761
- 
- </td>
-<td>
- 
- 0.84
- 
- </td>
-<td>
- 
- 0.896
- 
- </td>
-<td>
- 
- 0.934
- 
- </td>
-<td>
- 
- 0.959
- 
- </td>
-<td>
- 
- 0.975
- 
- </td>
+ 
+ 3
+ 
+ </td>
+<td>
+ 
+ 0.192
+ 
+ </td>
+<td>
+ 
+ 0.359
+ 
+ </td>
+<td>
+ 
+ 0.518
+ 
+ </td>
+<td>
+ 
+ 0.654
+ 
+ </td>
+<td>
+ 
+ 0.761
+ 
+ </td>
+<td>
+ 
+ 0.84
+ 
+ </td>
+<td>
+ 
+ 0.896
+ 
+ </td>
+<td>
+ 
+ 0.934
+ 
+ </td>
+<td>
+ 
+ 0.959
+ 
+ </td>
+<td>
+ 
+ 0.975
+ 
+ </td>
</tr>
<tr>
<td>
- 
- 4
- 
- </td>
-<td>
- 
- 0.171
- 
- </td>
-<td>
- 
- 0.32
- 
- </td>
-<td>
- 
- 0.47
- 
- </td>
-<td>
- 
- 0.605
- 
- </td>
-<td>
- 
- 0.716
- 
- </td>
-<td>
- 
- 0.802
- 
- </td>
-<td>
- 
- 0.866
- 
- </td>
-<td>
- 
- 0.912
- 
- </td>
-<td>
- 
- 0.943
- 
- </td>
-<td>
- 
- 0.964
- 
- </td>
+ 
+ 4
+ 
+ </td>
+<td>
+ 
+ 0.171
+ 
+ </td>
+<td>
+ 
+ 0.32
+ 
+ </td>
+<td>
+ 
+ 0.47
+ 
+ </td>
+<td>
+ 
+ 0.605
+ 
+ </td>
+<td>
+ 
+ 0.716
+ 
+ </td>
+<td>
+ 
+ 0.802
+ 
+ </td>
+<td>
+ 
+ 0.866
+ 
+ </td>
+<td>
+ 
+ 0.912
+ 
+ </td>
+<td>
+ 
+ 0.943
+ 
+ </td>
+<td>
+ 
+ 0.964
+ 
+ </td>
</tr>
<tr>
<td>
- 
- 5
- 
- </td>
-<td>
- 
- 0.157
- 
- </td>
-<td>
- 
- 0.292
- 
- </td>
-<td>
- 
- 0.433
- 
- </td>
-<td>
- 
- 0.564
- 
- </td>
-<td>
- 
- 0.677
- 
- </td>
-<td>
- 
- 0.769
- 
- </td>
-<td>
- 
- 0.839
- 
- </td>
-<td>
- 
- 0.89
- 
- </td>
-<td>
- 
- 0.927
- 
- </td>
-<td>
- 
- 0.952
- 
- </td>
+ 
+ 5
+ 
+ </td>
+<td>
+ 
+ 0.157
+ 
+ </td>
+<td>
+ 
+ 0.292
+ 
+ </td>
+<td>
+ 
+ 0.433
+ 
+ </td>
+<td>
+ 
+ 0.564
+ 
+ </td>
+<td>
+ 
+ 0.677
+ 
+ </td>
+<td>
+ 
+ 0.769
+ 
+ </td>
+<td>
+ 
+ 0.839
+ 
+ </td>
+<td>
+ 
+ 0.89
+ 
+ </td>
+<td>
+ 
+ 0.927
+ 
+ </td>
+<td>
+ 
+ 0.952
+ 
+ </td>
</tr>
<tr>
<td>
- 
- 6
- 
- </td>
-<td>
- 
- 0.146
- 
- </td>
-<td>
- 
- 0.27
- 
- </td>
-<td>
- 
- 0.403
- 
- </td>
-<td>
- 
- 0.531
- 
- </td>
-<td>
- 
- 0.644
- 
- </td>
-<td>
- 
- 0.738
- 
- </td>
-<td>
- 
- 0.813
- 
- </td>
-<td>
- 
- 0.869
- 
- </td>
-<td>
- 
- 0.911
- 
- </td>
-<td>
- 
- 0.94
- 
- </td>
+ 
+ 6
+ 
+ </td>
+<td>
+ 
+ 0.146
+ 
+ </td>
+<td>
+ 
+ 0.27
+ 
+ </td>
+<td>
+ 
+ 0.403
+ 
+ </td>
+<td>
+ 
+ 0.531
+ 
+ </td>
+<td>
+ 
+ 0.644
+ 
+ </td>
+<td>
+ 
+ 0.738
+ 
+ </td>
+<td>
+ 
+ 0.813
+ 
+ </td>
+<td>
+ 
+ 0.869
+ 
+ </td>
+<td>
+ 
+ 0.911
+ 
+ </td>
+<td>
+ 
+ 0.94
+ 
+ </td>
</tr>
<tr>
<td>
- 
- 7
- 
- </td>
-<td>
- 
- 0.138
- 
- </td>
-<td>
- 
- 0.252
- 
- </td>
-<td>
- 
- 0.378
- 
- </td>
-<td>
- 
- 0.502
- 
- </td>
-<td>
- 
- 0.614
- 
- </td>
-<td>
- 
- 0.71
- 
- </td>
-<td>
- 
- 0.788
- 
- </td>
-<td>
- 
- 0.849
- 
- </td>
-<td>
- 
- 0.895
- 
- </td>
-<td>
- 
- 0.928
- 
- </td>
+ 
+ 7
+ 
+ </td>
+<td>
+ 
+ 0.138
+ 
+ </td>
+<td>
+ 
+ 0.252
+ 
+ </td>
+<td>
+ 
+ 0.378
+ 
+ </td>
+<td>
+ 
+ 0.502
+ 
+ </td>
+<td>
+ 
+ 0.614
+ 
+ </td>
+<td>
+ 
+ 0.71
+ 
+ </td>
+<td>
+ 
+ 0.788
+ 
+ </td>
+<td>
+ 
+ 0.849
+ 
+ </td>
+<td>
+ 
+ 0.895
+ 
+ </td>
+<td>
+ 
+ 0.928
+ 
+ </td>
</tr>
<tr>
<td>
- 
- 8
- 
- </td>
-<td>
- 
- 0.131
- 
- </td>
-<td>
- 
- 0.238
- 
- </td>
-<td>
- 
- 0.357
- 
- </td>
-<td>
- 
- 0.477
- 
- </td>
-<td>
- 
- 0.588
- 
- </td>
-<td>
- 
- 0.685
- 
- </td>
-<td>
- 
- 0.765
- 
- </td>
-<td>
- 
- 0.829
- 
- </td>
-<td>
- 
- 0.879
- 
- </td>
-<td>
- 
- 0.915
- 
- </td>
+ 
+ 8
+ 
+ </td>
+<td>
+ 
+ 0.131
+ 
+ </td>
+<td>
+ 
+ 0.238
+ 
+ </td>
+<td>
+ 
+ 0.357
+ 
+ </td>
+<td>
+ 
+ 0.477
+ 
+ </td>
+<td>
+ 
+ 0.588
+ 
+ </td>
+<td>
+ 
+ 0.685
+ 
+ </td>
+<td>
+ 
+ 0.765
+ 
+ </td>
+<td>
+ 
+ 0.829
+ 
+ </td>
+<td>
+ 
+ 0.879
+ 
+ </td>
+<td>
+ 
+ 0.915
+ 
+ </td>
</tr>
<tr>
<td>
- 
- 9
- 
- </td>
-<td>
- 
- 0.125
- 
- </td>
-<td>
- 
- 0.225
- 
- </td>
-<td>
- 
- 0.339
- 
- </td>
-<td>
- 
- 0.454
- 
- </td>
-<td>
- 
- 0.564
- 
- </td>
-<td>
- 
- 0.661
- 
- </td>
-<td>
- 
- 0.744
- 
- </td>
-<td>
- 
- 0.811
- 
- </td>
-<td>
- 
- 0.863
- 
- </td>
-<td>
- 
- 0.903
- 
- </td>
+ 
+ 9
+ 
+ </td>
+<td>
+ 
+ 0.125
+ 
+ </td>
+<td>
+ 
+ 0.225
+ 
+ </td>
+<td>
+ 
+ 0.339
+ 
+ </td>
+<td>
+ 
+ 0.454
+ 
+ </td>
+<td>
+ 
+ 0.564
+ 
+ </td>
+<td>
+ 
+ 0.661
+ 
+ </td>
+<td>
+ 
+ 0.744
+ 
+ </td>
+<td>
+ 
+ 0.811
+ 
+ </td>
+<td>
+ 
+ 0.863
+ 
+ </td>
+<td>
+ 
+ 0.903
+ 
+ </td>
</tr>
<tr>
<td>
- 
- 10
- 
- </td>
-<td>
- 
- 0.121
- 
- </td>
-<td>
- 
- 0.215
- 
- </td>
-<td>
- 
- 0.323
- 
- </td>
-<td>
- 
- 0.435
- 
- </td>
-<td>
- 
- 0.542
- 
- </td>
-<td>
- 
- 0.64
- 
- </td>
-<td>
- 
- 0.723
- 
- </td>
-<td>
- 
- 0.793
- 
- </td>
-<td>
- 
- 0.848
- 
- </td>
-<td>
- 
- 0.891
- 
- </td>
+ 
+ 10
+ 
+ </td>
+<td>
+ 
+ 0.121
+ 
+ </td>
+<td>
+ 
+ 0.215
+ 
+ </td>
+<td>
+ 
+ 0.323
+ 
+ </td>
+<td>
+ 
+ 0.435
+ 
+ </td>
+<td>
+ 
+ 0.542
+ 
+ </td>
+<td>
+ 
+ 0.64
+ 
+ </td>
+<td>
+ 
+ 0.723
+ 
+ </td>
+<td>
+ 
+ 0.793
+ 
+ </td>
+<td>
+ 
+ 0.848
+ 
+ </td>
+<td>
+ 
+ 0.891
+ 
+ </td>
</tr>
<tr>
<td>
- 
- 11
- 
- </td>
-<td>
- 
- 0.117
- 
- </td>
-<td>
- 
- 0.206
- 
- </td>
-<td>
- 
- 0.309
- 
- </td>
-<td>
- 
- 0.417
- 
- </td>
-<td>
- 
- 0.523
- 
- </td>
-<td>
- 
- 0.62
- 
- </td>
-<td>
- 
- 0.704
- 
- </td>
-<td>
- 
- 0.775
- 
- </td>
-<td>
- 
- 0.833
- 
- </td>
-<td>
- 
- 0.878
- 
- </td>
+ 
+ 11
+ 
+ </td>
+<td>
+ 
+ 0.117
+ 
+ </td>
+<td>
+ 
+ 0.206
+ 
+ </td>
+<td>
+ 
+ 0.309
+ 
+ </td>
+<td>
+ 
+ 0.417
+ 
+ </td>
+<td>
+ 
+ 0.523
+ 
+ </td>
+<td>
+ 
+ 0.62
+ 
+ </td>
+<td>
+ 
+ 0.704
+ 
+ </td>
+<td>
+ 
+ 0.775
+ 
+ </td>
+<td>
+ 
+ 0.833
+ 
+ </td>
+<td>
+ 
+ 0.878
+ 
+ </td>
</tr>
<tr>
<td>
- 
- 12
- 
- </td>
-<td>
- 
- 0.113
- 
- </td>
-<td>
- 
- 0.198
- 
- </td>
-<td>
- 
- 0.297
- 
- </td>
-<td>
- 
- 0.402
- 
- </td>
-<td>
- 
- 0.505
- 
- </td>
-<td>
- 
- 0.601
- 
- </td>
-<td>
- 
- 0.686
- 
- </td>
-<td>
- 
- 0.759
- 
- </td>
-<td>
- 
- 0.818
- 
- </td>
-<td>
- 
- 0.866
- 
- </td>
+ 
+ 12
+ 
+ </td>
+<td>
+ 
+ 0.113
+ 
+ </td>
+<td>
+ 
+ 0.198
+ 
+ </td>
+<td>
+ 
+ 0.297
+ 
+ </td>
+<td>
+ 
+ 0.402
+ 
+ </td>
+<td>
+ 
+ 0.505
+ 
+ </td>
+<td>
+ 
+ 0.601
+ 
+ </td>
+<td>
+ 
+ 0.686
+ 
+ </td>
+<td>
+ 
+ 0.759
+ 
+ </td>
+<td>
+ 
+ 0.818
+ 
+ </td>
+<td>
+ 
+ 0.866
+ 
+ </td>
</tr>
<tr>
<td>
- 
- 13
- 
- </td>
-<td>
- 
- 0.11
- 
- </td>
-<td>
- 
- 0.191
- 
- </td>
-<td>
- 
- 0.286
- 
- </td>
-<td>
- 
- 0.387
- 
- </td>
-<td>
- 
- 0.488
- 
- </td>
-<td>
- 
- 0.584
- 
- </td>
-<td>
- 
- 0.669
- 
- </td>
-<td>
- 
- 0.743
- 
- </td>
-<td>
- 
- 0.804
- 
- </td>
-<td>
- 
- 0.854
- 
- </td>
+ 
+ 13
+ 
+ </td>
+<td>
+ 
+ 0.11
+ 
+ </td>
+<td>
+ 
+ 0.191
+ 
+ </td>
+<td>
+ 
+ 0.286
+ 
+ </td>
+<td>
+ 
+ 0.387
+ 
+ </td>
+<td>
+ 
+ 0.488
+ 
+ </td>
+<td>
+ 
+ 0.584
+ 
+ </td>
+<td>
+ 
+ 0.669
+ 
+ </td>
+<td>
+ 
+ 0.743
+ 
+ </td>
+<td>
+ 
+ 0.804
+ 
+ </td>
+<td>
+ 
+ 0.854
+ 
+ </td>
</tr>
<tr>
<td>
- 
- 14
- 
- </td>
-<td>
- 
- 0.108
- 
- </td>
-<td>
- 
- 0.185
- 
- </td>
-<td>
- 
- 0.276
- 
- </td>
-<td>
- 
- 0.374
- 
- </td>
-<td>
- 
- 0.473
- 
- </td>
-<td>
- 
- 0.567
- 
- </td>
-<td>
- 
- 0.653
- 
- </td>
-<td>
- 
- 0.728
- 
- </td>
-<td>
- 
- 0.791
- 
- </td>
-<td>
- 
- 0.842
- 
- </td>
+ 
+ 14
+ 
+ </td>
+<td>
+ 
+ 0.108
+ 
+ </td>
+<td>
+ 
+ 0.185
+ 
+ </td>
+<td>
+ 
+ 0.276
+ 
+ </td>
+<td>
+ 
+ 0.374
+ 
+ </td>
+<td>
+ 
+ 0.473
+ 
+ </td>
+<td>
+ 
+ 0.567
+ 
+ </td>
+<td>
+ 
+ 0.653
+ 
+ </td>
+<td>
+ 
+ 0.728
+ 
+ </td>
+<td>
+ 
+ 0.791
+ 
+ </td>
+<td>
+ 
+ 0.842
+ 
+ </td>
</tr>
<tr>
<td>
- 
- 15
- 
- </td>
-<td>
- 
- 0.105
- 
- </td>
-<td>
- 
- 0.179
- 
- </td>
-<td>
- 
- 0.267
- 
- </td>
-<td>
- 
- 0.362
- 
- </td>
-<td>
- 
- 0.459
- 
- </td>
-<td>
- 
- 0.552
- 
- </td>
-<td>
- 
- 0.638
- 
- </td>
-<td>
- 
- 0.713
- 
- </td>
-<td>
- 
- 0.777
- 
- </td>
-<td>
- 
- 0.83
- 
- </td>
+ 
+ 15
+ 
+ </td>
+<td>
+ 
+ 0.105
+ 
+ </td>
+<td>
+ 
+ 0.179
+ 
+ </td>
+<td>
+ 
+ 0.267
+ 
+ </td>
+<td>
+ 
+ 0.362
+ 
+ </td>
+<td>
+ 
+ 0.459
+ 
+ </td>
+<td>
+ 
+ 0.552
+ 
+ </td>
+<td>
+ 
+ 0.638
+ 
+ </td>
+<td>
+ 
+ 0.713
+ 
+ </td>
+<td>
+ 
+ 0.777
+ 
+ </td>
+<td>
+ 
+ 0.83
+ 
+ </td>
</tr>
<tr>
<td>
- 
- 16
- 
- </td>
-<td>
- 
- 0.103
- 
- </td>
-<td>
- 
- 0.174
- 
- </td>
-<td>
- 
- 0.259
- 
- </td>
-<td>
- 
- 0.351
- 
- </td>
-<td>
- 
- 0.446
- 
- </td>
-<td>
- 
- 0.538
- 
- </td>
-<td>
- 
- 0.623
- 
- </td>
-<td>
- 
- 0.699
- 
- </td>
-<td>
- 
- 0.764
- 
- </td>
-<td>
- 
- 0.819
- 
- </td>
+ 
+ 16
+ 
+ </td>
+<td>
+ 
+ 0.103
+ 
+ </td>
+<td>
+ 
+ 0.174
+ 
+ </td>
+<td>
+ 
+ 0.259
+ 
+ </td>
+<td>
+ 
+ 0.351
+ 
+ </td>
+<td>
+ 
+ 0.446
+ 
+ </td>
+<td>
+ 
+ 0.538
+ 
+ </td>
+<td>
+ 
+ 0.623
+ 
+ </td>
+<td>
+ 
+ 0.699
+ 
+ </td>
+<td>
+ 
+ 0.764
+ 
+ </td>
+<td>
+ 
+ 0.819
+ 
+ </td>
</tr>
<tr>
<td>
- 
- 17
- 
- </td>
-<td>
- 
- 0.101
- 
- </td>
-<td>
- 
- 0.169
- 
- </td>
-<td>
- 
- 0.251
- 
- </td>
-<td>
- 
- 0.341
- 
- </td>
-<td>
- 
- 0.434
- 
- </td>
-<td>
- 
- 0.525
- 
- </td>
-<td>
- 
- 0.609
- 
- </td>
-<td>
- 
- 0.686
- 
- </td>
-<td>
- 
- 0.752
- 
- </td>
-<td>
- 
- 0.807
- 
- </td>
+ 
+ 17
+ 
+ </td>
+<td>
+ 
+ 0.101
+ 
+ </td>
+<td>
+ 
+ 0.169
+ 
+ </td>
+<td>
+ 
+ 0.251
+ 
+ </td>
+<td>
+ 
+ 0.341
+ 
+ </td>
+<td>
+ 
+ 0.434
+ 
+ </td>
+<td>
+ 
+ 0.525
+ 
+ </td>
+<td>
+ 
+ 0.609
+ 
+ </td>
+<td>
+ 
+ 0.686
+ 
+ </td>
+<td>
+ 
+ 0.752
+ 
+ </td>
+<td>
+ 
+ 0.807
+ 
+ </td>
</tr>
<tr>
<td>
- 
- 18
- 
- </td>
-<td>
- 
- 0.0992
- 
- </td>
-<td>
- 
- 0.165
- 
- </td>
-<td>
- 
- 0.244
- 
- </td>
-<td>
- 
- 0.332
- 
- </td>
-<td>
- 
- 0.423
- 
- </td>
-<td>
- 
- 0.512
- 
- </td>
-<td>
- 
- 0.596
- 
- </td>
-<td>
- 
- 0.673
- 
- </td>
-<td>
- 
- 0.74
- 
- </td>
-<td>
- 
- 0.796
- 
- </td>
+ 
+ 18
+ 
+ </td>
+<td>
+ 
+ 0.0992
+ 
+ </td>
+<td>
+ 
+ 0.165
+ 
+ </td>
+<td>
+ 
+ 0.244
+ 
+ </td>
+<td>
+ 
+ 0.332
+ 
+ </td>
+<td>
+ 
+ 0.423
+ 
+ </td>
+<td>
+ 
+ 0.512
+ 
+ </td>
+<td>
+ 
+ 0.596
+ 
+ </td>
+<td>
+ 
+ 0.673
+ 
+ </td>
+<td>
+ 
+ 0.74
+ 
+ </td>
+<td>
+ 
+ 0.796
+ 
+ </td>
</tr>
<tr>
<td>
- 
- 19
- 
- </td>
-<td>
- 
- 0.0976
- 
- </td>
-<td>
- 
- 0.161
- 
- </td>
-<td>
- 
- 0.238
- 
- </td>
-<td>
- 
- 0.323
- 
- </td>
-<td>
- 
- 0.412
- 
- </td>
-<td>
- 
- 0.5
- 
- </td>
-<td>
- 
- 0.584
- 
- </td>
-<td>
- 
- 0.66
- 
- </td>
-<td>
- 
- 0.728
- 
- </td>
-<td>
- 
- 0.786
- 
- </td>
+ 
+ 19
+ 
+ </td>
+<td>
+ 
+ 0.0976
+ 
+ </td>
+<td>
+ 
+ 0.161
+ 
+ </td>
+<td>
+ 
+ 0.238
+ 
+ </td>
+<td>
+ 
+ 0.323
+ 
+ </td>
+<td>
+ 
+ 0.412
+ 
+ </td>
+<td>
+ 
+ 0.5
+ 
+ </td>
+<td>
+ 
+ 0.584
+ 
+ </td>
+<td>
+ 
+ 0.66
+ 
+ </td>
+<td>
+ 
+ 0.728
+ 
+ </td>
+<td>
+ 
+ 0.786
+ 
+ </td>
</tr>
<tr>
<td>
- 
- 20
- 
- </td>
-<td>
- 
- 0.0961
- 
- </td>
-<td>
- 
- 0.158
- 
- </td>
-<td>
- 
- 0.232
- 
- </td>
-<td>
- 
- 0.315
- 
- </td>
-<td>
- 
- 0.402
- 
- </td>
-<td>
- 
- 0.489
- 
- </td>
-<td>
- 
- 0.572
- 
- </td>
-<td>
- 
- 0.648
- 
- </td>
-<td>
- 
- 0.716
- 
- </td>
-<td>
- 
- 0.775
- 
- </td>
+ 
+ 20
+ 
+ </td>
+<td>
+ 
+ 0.0961
+ 
+ </td>
+<td>
+ 
+ 0.158
+ 
+ </td>
+<td>
+ 
+ 0.232
+ 
+ </td>
+<td>
+ 
+ 0.315
+ 
+ </td>
+<td>
+ 
+ 0.402
+ 
+ </td>
+<td>
+ 
+ 0.489
+ 
+ </td>
+<td>
+ 
+ 0.572
+ 
+ </td>
+<td>
+ 
+ 0.648
+ 
+ </td>
+<td>
+ 
+ 0.716
+ 
+ </td>
+<td>
+ 
+ 0.775
+ 
+ </td>
</tr>
</tbody>
</table></div>

- 
-
- See nc_chi_sq_example.cpp
- for the full C++ source code.
- 
-
+ See nc_chi_sq_example.cpp
+ for the full C++ source code.
 
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,19 +24,19 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.neg_binom_eg"></a><a class="link" href="neg_binom_eg.html" title="Negative Binomial Distribution Examples"> Negative
+<a name="math_toolkit.dist.stat_tut.weg.neg_binom_eg"></a><a class="link" href="neg_binom_eg.html" title="Negative Binomial Distribution Examples">Negative
Binomial Distribution Examples</a>
</h5></div></div></div>
<div class="toc"><dl>
-<dt><a href="neg_binom_eg/neg_binom_conf.html">
- Calculating Confidence Limits on the Frequency of Occurrence for the
- Negative Binomial Distribution</a></dt>
-<dt><a href="neg_binom_eg/neg_binom_size_eg.html">
- Estimating Sample Sizes for the Negative Binomial.</a></dt>
-<dt><a href="neg_binom_eg/negative_binomial_example1.html">
- Negative Binomial Sales Quota Example.</a></dt>
-<dt><a href="neg_binom_eg/negative_binomial_example2.html">
- Negative Binomial Table Printing Example.</a></dt>
+<dt><a href="neg_binom_eg/neg_binom_conf.html">Calculating
+ Confidence Limits on the Frequency of Occurrence for the Negative Binomial
+ Distribution</a></dt>
+<dt><a href="neg_binom_eg/neg_binom_size_eg.html">Estimating
+ Sample Sizes for the Negative Binomial.</a></dt>
+<dt><a href="neg_binom_eg/negative_binomial_example1.html">Negative
+ Binomial Sales Quota Example.</a></dt>
+<dt><a href="neg_binom_eg/negative_binomial_example2.html">Negative
+ Binomial Table Printing Example.</a></dt>
</dl></div>

(See also the reference documentation for the <a class="link" href="../../dist_ref/dists/negative_binomial_dist.html" title="Negative Binomial Distribution">Negative

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg/neg_binom_conf.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg/neg_binom_conf.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg/neg_binom_conf.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,9 +24,9 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h6 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.neg_binom_eg.neg_binom_conf"></a><a class="link" href="neg_binom_conf.html" title="Calculating Confidence Limits on the Frequency of Occurrence for the Negative Binomial Distribution">
- Calculating Confidence Limits on the Frequency of Occurrence for the
- Negative Binomial Distribution</a>
+<a name="math_toolkit.dist.stat_tut.weg.neg_binom_eg.neg_binom_conf"></a><a class="link" href="neg_binom_conf.html" title="Calculating Confidence Limits on the Frequency of Occurrence for the Negative Binomial Distribution">Calculating
+ Confidence Limits on the Frequency of Occurrence for the Negative Binomial
+ Distribution</a>
</h6></div></div></div>

 Imagine you have a process that follows a negative binomial distribution:
@@ -55,15 +55,11 @@
 illustrates their use.
 

- 
-
- First we need some includes to access the negative binomial distribution
- (and some basic std output of course).
- 
-
- 
+ First we need some includes to access the negative binomial distribution
+ (and some basic std output of course).
+ 

-
+

<pre class="programlisting">#include <boost/math/distributions/negative_binomial.hpp>
using boost::math::negative_binomial;
@@ -74,39 +70,28 @@
using std::setprecision;
using std::setw; using std::left; using std::fixed; using std::right;</pre>

- 
-
- 
-
- First define a table of significance levels: these are the probabilities
- that the true occurrence frequency lies outside the calculated interval:
- 
+ 

- 
+ First define a table of significance levels: these are the probabilities
+ that the true occurrence frequency lies outside the calculated interval:
+ 

-
+

<pre class="programlisting">double alpha[] = { 0.5, 0.25, 0.1, 0.05, 0.01, 0.001, 0.0001, 0.00001 };</pre>

- 
-
- 
-
- Confidence value as % is (1 - alpha) * 100, so alpha 0.05 == 95%
- confidence that the true occurence frequency lies inside
- the calculated interval.
- 
-
- 
+ 

- We need a function to calculate and print confidence limits for an
- observed frequency of occurrence that follows a negative binomial
- distribution.
- 
+ Confidence value as % is (1 - alpha) * 100, so alpha 0.05 == 95% confidence
+ that the true occurence frequency lies inside
+ the calculated interval.
+ 

- 
+ We need a function to calculate and print confidence limits for an
+ observed frequency of occurrence that follows a negative binomial distribution.
+ 

-
+

<pre class="programlisting">void confidence_limits_on_frequency(unsigned trials, unsigned successes)
{
@@ -132,25 +117,21 @@
 " Value (%) Limit Limit\n"
 "___________________________________________\n";</pre>

- 
-
- 
-
- And now for the important part - the bounds themselves. For each
- value of alpha, we call <code class="computeroutput">find_lower_bound_on_p</code>
- and <code class="computeroutput">find_upper_bound_on_p</code>
- to obtain lower and upper bounds respectively. Note that since we
- are calculating a two-sided interval, we must divide the value of
- alpha in two. Had we been calculating a single-sided interval, for
- example: "Calculate a lower bound so that we are P%
- sure that the true occurrence frequency is greater than some value"
- then we would not have divided by
- two.
- 
+ 

- 
+ And now for the important part - the bounds themselves. For each value
+ of alpha, we call <code class="computeroutput">find_lower_bound_on_p</code>
+ and <code class="computeroutput">find_upper_bound_on_p</code>
+ to obtain lower and upper bounds respectively. Note that since we are
+ calculating a two-sided interval, we must divide the value of alpha
+ in two. Had we been calculating a single-sided interval, for example:
+ "Calculate a lower bound so that we are P% sure that
+ the true occurrence frequency is greater than some value"
+ then we would not have divided by
+ two.
+ 

-
+

<pre class="programlisting"> // Now print out the upper and lower limits for the alpha table values.
 for(unsigned i = 0; i < sizeof(alpha)/sizeof(alpha[0]); ++i)
@@ -167,17 +148,13 @@
 cout << endl;
} // void confidence_limits_on_frequency(unsigned trials, unsigned successes)</pre>

- 
-
- 
-
- And then call confidence_limits_on_frequency with increasing numbers
- of trials, but always the same success fraction 0.1, or 1 in 10.
- 
+ 

- 
+ And then call confidence_limits_on_frequency with increasing numbers
+ of trials, but always the same success fraction 0.1, or 1 in 10.
+ 

-
+

<pre class="programlisting">int main()
{
@@ -190,7 +167,7 @@

</pre>

- 
+ 

 Let's see some sample output for a 1 in 10 success ratio, first for
 a mere 20 trials:

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg/neg_binom_size_eg.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg/neg_binom_size_eg.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg/neg_binom_size_eg.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h6 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.neg_binom_eg.neg_binom_size_eg"></a><a class="link" href="neg_binom_size_eg.html" title="Estimating Sample Sizes for the Negative Binomial.">
- Estimating Sample Sizes for the Negative Binomial.</a>
+<a name="math_toolkit.dist.stat_tut.weg.neg_binom_eg.neg_binom_size_eg"></a><a class="link" href="neg_binom_size_eg.html" title="Estimating Sample Sizes for the Negative Binomial.">Estimating
+ Sample Sizes for the Negative Binomial.</a>
</h6></div></div></div>

 Imagine you have an event (let's call it a "failure" - though
@@ -43,62 +43,43 @@
 demonstrates its usage.
 

- 
-
- It centres around a routine that prints out a table of minimum sample
- sizes for various probability thresholds:
- 
-
- 
+ It centres around a routine that prints out a table of minimum sample
+ sizes for various probability thresholds:
+ 

-
+

<pre class="programlisting">void find_number_of_trials(double failures, double p);</pre>

- 
-
- 
-
- First define a table of significance levels: these are the maximum
- acceptable probability that failure or fewer
- events will be observed.
- 
+ 

- 
+ First define a table of significance levels: these are the maximum
+ acceptable probability that failure or fewer events
+ will be observed.
+ 

-
+

<pre class="programlisting">double alpha[] = { 0.5, 0.25, 0.1, 0.05, 0.01, 0.001, 0.0001, 0.00001 };</pre>

- 
-
- 
-
- Confidence value as % is (1 - alpha) * 100, so alpha 0.05 == 95%
- confidence that the desired number of failures will be observed.
- 
-
- 
+ 

- Much of the rest of the program is pretty-printing, the important
- part is in the calculation of minimum number of trials required for
- each value of alpha using:
- 
+ Confidence value as % is (1 - alpha) * 100, so alpha 0.05 == 95% confidence
+ that the desired number of failures will be observed.
+ 

-
-
+ Much of the rest of the program is pretty-printing, the important part
+ is in the calculation of minimum number of trials required for each
+ value of alpha using:
+ 
<pre class="programlisting">(int)ceil(negative_binomial::find_minimum_number_of_trials(failures, p, alpha[i]);
</pre>

- 
-
- find_minimum_number_of_trials returns a double, so ceil rounds this
- up to ensure we have an integral minimum number of trials.
- 
-
- 
+ find_minimum_number_of_trials returns a double, so ceil rounds this
+ up to ensure we have an integral minimum number of trials.
+ 

-
+

<pre class="programlisting">
void find_number_of_trials(double failures, double p)
@@ -130,17 +111,13 @@
 cout << endl;
} // void find_number_of_trials(double failures, double p)</pre>

- 
-
- 
-
- finally we can produce some tables of minimum trials for the chosen
- confidence levels:
- 
+ 

- 
+ finally we can produce some tables of minimum trials for the chosen
+ confidence levels:
+ 

-
+

<pre class="programlisting">int main()
{
@@ -156,8 +133,6 @@

</pre>

- 
-
 
<div class="note"><table border="0" summary="Note">
<tr>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg/negative_binomial_example1.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg/negative_binomial_example1.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg/negative_binomial_example1.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h6 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.neg_binom_eg.negative_binomial_example1"></a><a class="link" href="negative_binomial_example1.html" title="Negative Binomial Sales Quota Example.">
- Negative Binomial Sales Quota Example.</a>
+<a name="math_toolkit.dist.stat_tut.weg.neg_binom_eg.negative_binomial_example1"></a><a class="link" href="negative_binomial_example1.html" title="Negative Binomial Sales Quota Example.">Negative
+ Binomial Sales Quota Example.</a>
</h6></div></div></div>

 This example program <a href="../../../../../../../../example/negative_binomial_example1.cpp" target="_top">negative_binomial_example1.cpp
@@ -33,92 +33,69 @@
 of meeting a sales quota.
 

- 
+ Based on <a href="http://en.wikipedia.org/wiki/Negative_binomial_distribution" target="_top">a
+ problem by Dr. Diane Evans, Professor of Mathematics at Rose-Hulman
+ Institute of Technology</a>.
+ 
+
+ Pat is required to sell candy bars to raise money for the 6th grade
+ field trip. There are thirty houses in the neighborhood, and Pat is
+ not supposed to return home until five candy bars have been sold. So
+ the child goes door to door, selling candy bars. At each house, there
+ is a 0.4 probability (40%) of selling one candy bar and a 0.6 probability
+ (60%) of selling nothing.
+ 
+
+ What is the probability mass (density) function (pdf) for selling the
+ last (fifth) candy bar at the nth house?
+ 
+
+ The Negative Binomial(r, p) distribution describes the probability
+ of k failures and r successes in k+r Bernoulli(p) trials with success
+ on the last trial. (A <a href="http://en.wikipedia.org/wiki/Bernoulli_distribution" target="_top">Bernoulli
+ trial</a> is one with only two possible outcomes, success of failure,
+ and p is the probability of success). See also <a href="../../../../../" target="_top">http://en.wikipedia.org/wiki/Bernoulli_distribution
+ Bernoulli distribution</a> and <a href="http://www.math.uah.edu/stat/bernoulli/Introduction.xhtml" target="_top">Bernoulli
+ applications</a>.
+ 

- Based on <a href="http://en.wikipedia.org/wiki/Negative_binomial_distribution" target="_top">a
- problem by Dr. Diane Evans, Professor of Mathematics at Rose-Hulman
- Institute of Technology</a>.
- 
-
- 
-
- Pat is required to sell candy bars to raise money for the 6th grade
- field trip. There are thirty houses in the neighborhood, and Pat
- is not supposed to return home until five candy bars have been sold.
- So the child goes door to door, selling candy bars. At each house,
- there is a 0.4 probability (40%) of selling one candy bar and a 0.6
- probability (60%) of selling nothing.
- 
-
- 
-
- What is the probability mass (density) function (pdf) for selling
- the last (fifth) candy bar at the nth house?
- 
-
- 
-
- The Negative Binomial(r, p) distribution describes the probability
- of k failures and r successes in k+r Bernoulli(p) trials with success
- on the last trial. (A <a href="http://en.wikipedia.org/wiki/Bernoulli_distribution" target="_top">Bernoulli
- trial</a> is one with only two possible outcomes, success of
- failure, and p is the probability of success). See also <a href="../../../../../" target="_top">http://en.wikipedia.org/wiki/Bernoulli_distribution
- Bernoulli distribution</a> and <a href="http://www.math.uah.edu/stat/bernoulli/Introduction.xhtml" target="_top">Bernoulli
- applications</a>.
- 
-
- 
-
- In this example, we will deliberately produce a variety of calculations
- and outputs to demonstrate the ways that the negative binomial distribution
- can be implemented with this library: it is also deliberately over-commented.
- 
-
- 
-
- First we need to #define macros to control the error and discrete
- handling policies. For this simple example, we want to avoid throwing
- an exception (the default policy) and just return infinity. We want
- to treat the distribution as if it was continuous, so we choose a
- discrete_quantile policy of real, rather than the default policy
- integer_round_outwards.
- 
+ In this example, we will deliberately produce a variety of calculations
+ and outputs to demonstrate the ways that the negative binomial distribution
+ can be implemented with this library: it is also deliberately over-commented.
+ 

- 
+ First we need to #define macros to control the error and discrete handling
+ policies. For this simple example, we want to avoid throwing an exception
+ (the default policy) and just return infinity. We want to treat the
+ distribution as if it was continuous, so we choose a discrete_quantile
+ policy of real, rather than the default policy integer_round_outwards.
+ 

-
+

<pre class="programlisting">#define BOOST_MATH_OVERFLOW_ERROR_POLICY ignore_error
#define BOOST_MATH_DISCRETE_QUANTILE_POLICY real</pre>

- 
-
- 
-
- After that we need some includes to provide easy access to the negative
- binomial distribution,
- 
+ 

- 
+ After that we need some includes to provide easy access to the negative
+ binomial distribution,
+ 
<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">
- It is vital to #include distributions etc after
- the above #defines
- </td></tr>
+ It is vital to #include distributions etc after
+ the above #defines
+ </td></tr>
</table></div>

- 
-
- and we need some std library iostream, of course.
- 
-
- 
+ and we need some std library iostream, of course.
+ 

-
+

<pre class="programlisting">#include <boost/math/distributions/negative_binomial.hpp>
 // for negative_binomial_distribution
@@ -137,91 +114,67 @@
 using std::numeric_limits;
</pre>

- 
-
- 
-
- It is always sensible to use try and catch blocks because defaults
- policies are to throw an exception if anything goes wrong.
- 
-
- 
+ 

- A simple catch block (see below) will ensure that you get a helpful
- error message instead of an abrupt program abort.
- 
+ It is always sensible to use try and catch blocks because defaults
+ policies are to throw an exception if anything goes wrong.
+ 

- 
+ A simple catch block (see below) will ensure that you get a helpful
+ error message instead of an abrupt program abort.
+ 

-
+

<pre class="programlisting">try
{</pre>

- 
-
- 
-
- Selling five candy bars means getting five successes, so successes
- r = 5. The total number of trials (n, in this case, houses visited)
- this takes is therefore = sucesses + failures or k + r = k + 5.
- 
+ 

- 
+ Selling five candy bars means getting five successes, so successes
+ r = 5. The total number of trials (n, in this case, houses visited)
+ this takes is therefore = sucesses + failures or k + r = k + 5.
+ 

-
+

<pre class="programlisting">double sales_quota = 5; // Pat's sales quota - successes (r).</pre>

- 
-
- 
-
- At each house, there is a 0.4 probability (40%) of selling one candy
- bar and a 0.6 probability (60%) of selling nothing.
- 
+ 

- 
+ At each house, there is a 0.4 probability (40%) of selling one candy
+ bar and a 0.6 probability (60%) of selling nothing.
+ 

-
+

<pre class="programlisting">double success_fraction = 0.4; // success_fraction (p) - so failure_fraction is 0.6.</pre>

- 
-
- 
-
- The Negative Binomial(r, p) distribution describes the probability
- of k failures and r successes in k+r Bernoulli(p) trials with success
- on the last trial. (A <a href="http://en.wikipedia.org/wiki/Bernoulli_distribution" target="_top">Bernoulli
- trial</a> is one with only two possible outcomes, success of
- failure, and p is the probability of success).
- 
-
- 
+ 

- We therefore start by constructing a negative binomial distribution
- with parameters sales_quota (required successes) and probability
- of success.
- 
+ The Negative Binomial(r, p) distribution describes the probability
+ of k failures and r successes in k+r Bernoulli(p) trials with success
+ on the last trial. (A <a href="http://en.wikipedia.org/wiki/Bernoulli_distribution" target="_top">Bernoulli
+ trial</a> is one with only two possible outcomes, success of failure,
+ and p is the probability of success).
+ 

- 
+ We therefore start by constructing a negative binomial distribution
+ with parameters sales_quota (required successes) and probability of
+ success.
+ 

-
+

<pre class="programlisting">negative_binomial nb(sales_quota, success_fraction); // type double by default.</pre>

- 
-
- 
-
- To confirm, display the success_fraction & successes parameters
- of the distribution.
- 
+ 

- 
+ To confirm, display the success_fraction & successes parameters
+ of the distribution.
+ 

-
+

<pre class="programlisting">cout << "Pat has a sales per house success rate of " << success_fraction
 << ".\nTherefore he would, on average, sell " << nb.success_fraction() * 100
@@ -234,57 +187,42 @@
 "to need to visit about " << success_fraction * all_houses
 << " houses in order to sell all " << nb.successes() << " bars. " << endl;</pre>

- 
-
-
-
+ 
<pre class="programlisting">Pat has a sales per house success rate of 0.4.
Therefore he would, on average, sell 40 bars after trying 100 houses.
With a success rate of 0.4, he might expect, on average,
to need to visit about 12 houses in order to sell all 5 bars.
</pre>

- 
-
- The random variable of interest is the number of houses that must
- be visited to sell five candy bars, so we substitute k = n - 5 into
- a negative_binomial(5, 0.4) and obtain the <a class="link" href="../../../dist_ref/nmp.html#math.dist.pdf">probability
- mass (density) function (pdf or pmf)</a> of the distribution of
- houses visited. Obviously, the best possible case is that Pat makes
- sales on all the first five houses.
- 
-
- 
-
- We calculate this using the pdf function:
- 
+ The random variable of interest is the number of houses that must be
+ visited to sell five candy bars, so we substitute k = n - 5 into a
+ negative_binomial(5, 0.4) and obtain the <a class="link" href="../../../dist_ref/nmp.html#math.dist.pdf">probability
+ mass (density) function (pdf or pmf)</a> of the distribution of
+ houses visited. Obviously, the best possible case is that Pat makes
+ sales on all the first five houses.
+ 

- 
+ We calculate this using the pdf function:
+ 

-
+

<pre class="programlisting">cout << "Probability that Pat finishes on the " << sales_quota << "th house is "
 << pdf(nb, 5 - sales_quota) << endl; // == pdf(nb, 0)</pre>

- 
-
- 
-
- Of course, he could not finish on fewer than 5 houses because he
- must sell 5 candy bars. So the 5th house is the first that he could
- possibly finish on.
- 
-
- 
+ 

- To finish on or before the 8th house, Pat must finish at the 5th,
- 6th, 7th or 8th house. The probability that he will finish on exactly ( == ) on any house is the Probability
- Density Function (pdf).
- 
+ Of course, he could not finish on fewer than 5 houses because he must
+ sell 5 candy bars. So the 5th house is the first that he could possibly
+ finish on.
+ 

- 
+ To finish on or before the 8th house, Pat must finish at the 5th, 6th,
+ 7th or 8th house. The probability that he will finish on exactly ( == ) on any house is the Probability
+ Density Function (pdf).
+ 

-
+

<pre class="programlisting">cout << "Probability that Pat finishes on the 6th house is "
 << pdf(nb, 6 - sales_quota) << endl;
@@ -293,24 +231,17 @@
cout << "Probability that Pat finishes on the 8th house is "
 << pdf(nb, 8 - sales_quota) << endl;</pre>

- 
-
-
-
+ 
<pre class="programlisting">Probability that Pat finishes on the 6th house is 0.03072
Probability that Pat finishes on the 7th house is 0.055296
Probability that Pat finishes on the 8th house is 0.077414
</pre>

- 
-
- The sum of the probabilities for these houses is the Cumulative Distribution
- Function (cdf). We can calculate it by adding the individual probabilities.
- 
-
- 
+ The sum of the probabilities for these houses is the Cumulative Distribution
+ Function (cdf). We can calculate it by adding the individual probabilities.
+ 

-
+

<pre class="programlisting">cout << "Probability that Pat finishes on or before the 8th house is sum "
 "\n" << "pdf(sales_quota) + pdf(6) + pdf(7) + pdf(8) = "
@@ -321,37 +252,25 @@
 + pdf(nb, 8 - sales_quota) // 3 failures.
 << endl;</pre>

- 
-
-
-
+ 
<pre class="programlisting">pdf(sales_quota) + pdf(6) + pdf(7) + pdf(8) = 0.17367
</pre>

- 
-
- Or, usually better, by using the negative binomial cumulative
- distribution function.
- 
-
- 
+ Or, usually better, by using the negative binomial cumulative
+ distribution function.
+ 

-
+

<pre class="programlisting">cout << "\nProbability of selling his quota of " << sales_quota
 << " bars\non or before the " << 8 << "th house is "
 << cdf(nb, 8 - sales_quota) << endl;</pre>

- 
-
-
-
+ 
<pre class="programlisting">Probability of selling his quota of 5 bars on or before the 8th house is 0.17367
</pre>

- 
-
-
+

<pre class="programlisting">cout << "\nProbability that Pat finishes exactly on the 10th house is "
 << pdf(nb, 10 - sales_quota) << endl;
@@ -359,17 +278,12 @@
 << " bars\non or before the " << 10 << "th house is "
 << cdf(nb, 10 - sales_quota) << endl;</pre>

- 
-
-
-
+ 
<pre class="programlisting">Probability that Pat finishes exactly on the 10th house is 0.10033
Probability of selling his quota of 5 bars on or before the 10th house is 0.3669
</pre>

- 
-
-
+

<pre class="programlisting">cout << "Probability that Pat finishes exactly on the 11th house is "
 << pdf(nb, 11 - sales_quota) << endl;
@@ -377,18 +291,13 @@
 << " bars\non or before the " << 11 << "th house is "
 << cdf(nb, 11 - sales_quota) << endl;</pre>

- 
-
-
-
+ 
<pre class="programlisting">Probability that Pat finishes on the 11th house is 0.10033
Probability of selling his quota of 5 candy bars
on or before the 11th house is 0.46723
</pre>

- 
-
-
+

<pre class="programlisting">cout << "Probability that Pat finishes exactly on the 12th house is "
 << pdf(nb, 12 - sales_quota) << endl;
@@ -397,189 +306,135 @@
 << " bars\non or before the " << 12 << "th house is "
 << cdf(nb, 12 - sales_quota) << endl;</pre>

- 
-
-
-
+ 
<pre class="programlisting">Probability that Pat finishes on the 12th house is 0.094596
Probability of selling his quota of 5 candy bars
on or before the 12th house is 0.56182
</pre>

- 
-
- Finally consider the risk of Pat not selling his quota of 5 bars
- even after visiting all the houses. Calculate the probability that
- he will sell on or before the last house: Calculate
- the probability that he would sell all his quota on the very last
- house.
- 
-
- 
+ Finally consider the risk of Pat not selling his quota of 5 bars even
+ after visiting all the houses. Calculate the probability that he will
+ sell on or before the last house: Calculate the probability that he
+ would sell all his quota on the very last house.
+ 

-
+

<pre class="programlisting">cout << "Probability that Pat finishes on the " << all_houses
 << " house is " << pdf(nb, all_houses - sales_quota) << endl;</pre>

- 
-
- 
-
- Probability of selling his quota of 5 bars on the 30th house is
- 
+ 

-
-
+ Probability of selling his quota of 5 bars on the 30th house is
+ 
<pre class="programlisting">Probability that Pat finishes on the 30 house is 0.00069145
</pre>

- 
-
- when he'd be very unlucky indeed!
- 
-
- 
-
- What is the probability that Pat exhausts all 30 houses in the neighborhood,
- and still doesn't sell the required
- 5 candy bars?
- 
+ when he'd be very unlucky indeed!
+ 

- 
+ What is the probability that Pat exhausts all 30 houses in the neighborhood,
+ and still doesn't sell the required
+ 5 candy bars?
+ 

-
+

<pre class="programlisting">cout << "\nProbability of selling his quota of " << sales_quota
 << " bars\non or before the " << all_houses << "th house is "
 << cdf(nb, all_houses - sales_quota) << endl;</pre>

- 
-
-
-
+ 
<pre class="programlisting">Probability of selling his quota of 5 bars
on or before the 30th house is 0.99849
</pre>

- 
-
- /*<code class="computeroutput">So the
- risk of
- failing even
- after visiting
- all the
- houses is
- 1 -
- this probability, </code><code class="computeroutput">1
- - cdf(nb, all_houses
- - sales_quota</code><code class="computeroutput">
- But using
- this expression
- may cause
- serious inaccuracy, so
- it would
- be much
- better to
- use the
- complement of
- the cdf: So
- the risk
- of failing
- even at, or after,
- the 31th (non-existent)
- houses is
- 1 -
- this probability, </code><code class="computeroutput">1
- - cdf(nb, all_houses
- - sales_quota)</code>` But using this expression may cause
- serious inaccuracy. So it would be much better to use the complement
- of the cdf. <a class="link" href="../../overview/complements.html#why_complements">Why complements?</a>
- 
-
- 
+ /*<code class="computeroutput">So the
+ risk of
+ failing even
+ after visiting
+ all the
+ houses is
+ 1 -
+ this probability, </code><code class="computeroutput">1
+ - cdf(nb, all_houses
+ - sales_quota</code><code class="computeroutput">
+ But using
+ this expression
+ may cause
+ serious inaccuracy, so it would
+ be much
+ better to
+ use the
+ complement of
+ the cdf: So the risk
+ of failing
+ even at, or after,
+ the 31th (non-existent)
+ houses is
+ 1 -
+ this probability, </code><code class="computeroutput">1
+ - cdf(nb, all_houses
+ - sales_quota)</code>` But using this expression may cause
+ serious inaccuracy. So it would be much better to use the complement
+ of the cdf. <a class="link" href="../../overview/complements.html#why_complements">Why complements?</a>
+ 

-
+

<pre class="programlisting">cout << "\nProbability of failing to sell his quota of " << sales_quota
 << " bars\neven after visiting all " << all_houses << " houses is "
 << cdf(complement(nb, all_houses - sales_quota)) << endl;</pre>

- 
-
-
-
+ 
<pre class="programlisting">Probability of failing to sell his quota of 5 bars
even after visiting all 30 houses is 0.0015101
</pre>

- 
-
- We can also use the quantile (percentile), the inverse of the cdf,
- to predict which house Pat will finish on. So for the 8th house:
- 
-
- 
+ We can also use the quantile (percentile), the inverse of the cdf,
+ to predict which house Pat will finish on. So for the 8th house:
+ 

-
+

<pre class="programlisting">double p = cdf(nb, (8 - sales_quota));
cout << "Probability of meeting sales quota on or before 8th house is "<< p << endl;</pre>

- 
-
-
-
+ 
<pre class="programlisting">Probability of meeting sales quota on or before 8th house is 0.174
</pre>

- 
-
-
+

<pre class="programlisting">cout << "If the confidence of meeting sales quota is " << p
 << ", then the finishing house is " << quantile(nb, p) + sales_quota << endl;

cout<< " quantile(nb, p) = " << quantile(nb, p) << endl;</pre>

- 
-
-
-
+ 
<pre class="programlisting">If the confidence of meeting sales quota is 0.17367, then the finishing house is 8
</pre>

- 
-
- Demanding absolute certainty that all 5 will be sold, implies an
- infinite number of trials. (Of course, there are only 30 houses on
- the estate, so he can't ever be certain
- of selling his quota).
- 
-
- 
+ Demanding absolute certainty that all 5 will be sold, implies an infinite
+ number of trials. (Of course, there are only 30 houses on the estate,
+ so he can't ever be certain of selling
+ his quota).
+ 

-
+

<pre class="programlisting">cout << "If the confidence of meeting sales quota is " << 1.
 << ", then the finishing house is " << quantile(nb, 1) + sales_quota << endl;
// 1.#INF == infinity.</pre>

- 
-
-
-
+ 
<pre class="programlisting">If the confidence of meeting sales quota is 1, then the finishing house is 1.#INF
</pre>

- 
-
- And similarly for a few other probabilities:
- 
-
- 
+ And similarly for a few other probabilities:
+ 

-
+

<pre class="programlisting">cout << "If the confidence of meeting sales quota is " << 0.
 << ", then the finishing house is " << quantile(nb, 0.) + sales_quota << endl;
@@ -590,51 +445,35 @@
cout << "If the confidence of meeting sales quota is " << 1 - 0.00151 // 30 th
 << ", then the finishing house is " << quantile(nb, 1 - 0.00151) + sales_quota << endl;</pre>

- 
-
-
-
+ 
<pre class="programlisting">If the confidence of meeting sales quota is 0, then the finishing house is 5
If the confidence of meeting sales quota is 0.5, then the finishing house is 11.337
If the confidence of meeting sales quota is 0.99849, then the finishing house is 30
</pre>

- 
-
- Notice that because we chose a discrete quantile policy of real,
- the result can be an 'unreal' fractional house.
- 
-
- 
-
- If the opposite is true, we don't want to assume any confidence,
- then this is tantamount to assuming that all the first sales_quota
- trials will be successful sales.
- 
+ Notice that because we chose a discrete quantile policy of real, the
+ result can be an 'unreal' fractional house.
+ 

- 
+ If the opposite is true, we don't want to assume any confidence, then
+ this is tantamount to assuming that all the first sales_quota trials
+ will be successful sales.
+ 

-
+

<pre class="programlisting">cout << "If confidence of meeting quota is zero\n(we assume all houses are successful sales)"
 ", then finishing house is " << sales_quota << endl;</pre>

- 
-
-
-
+ 
<pre class="programlisting">If confidence of meeting quota is zero (we assume all houses are successful sales), then finishing house is 5
If confidence of meeting quota is 0, then finishing house is 5
</pre>

- 
-
- We can list quantiles for a few probabilities:
- 
-
- 
+ We can list quantiles for a few probabilities:
+ 

-
+

<pre class="programlisting"> double ps[] = {0., 0.001, 0.01, 0.05, 0.1, 0.5, 0.9, 0.95, 0.99, 0.999, 1.};
 // Confidence as fraction = 1-alpha, as percent = 100 * (1-alpha[i]) %
@@ -646,10 +485,7 @@
 << endl;
}</pre>

- 
-
-
-
+ 
<pre class="programlisting">If confidence of meeting quota is 0, then finishing house is 5
If confidence of meeting quota is 0.001, then finishing house is 5
If confidence of meeting quota is 0.01, then finishing house is 5
@@ -663,53 +499,38 @@
If confidence of meeting quota is 1, then finishing house is 1.#INF
</pre>

- 
-
- We could have applied a ceil function to obtain a 'worst case' integer
- value for house.
+ We could have applied a ceil function to obtain a 'worst case' integer
+ value for house.

<pre class="programlisting">ceil(quantile(nb, ps[i]))</pre>

- 
-
- 
+ 

- Or, if we had used the default discrete quantile policy, integer_outside,
- by omitting
+ Or, if we had used the default discrete quantile policy, integer_outside,
+ by omitting

<pre class="programlisting">#define BOOST_MATH_DISCRETE_QUANTILE_POLICY real</pre>

- we would have achieved the same effect.
- 
-
- 
-
- The real result gives some suggestion which house is most likely.
- For example, compare the real and integer_outside for 95% confidence.
- 
+ we would have achieved the same effect.
+ 

-
-
+ The real result gives some suggestion which house is most likely. For
+ example, compare the real and integer_outside for 95% confidence.
+ 
<pre class="programlisting">If confidence of meeting quota is 0.95, then finishing house is 20.1
If confidence of meeting quota is 0.95, then finishing house is 21
</pre>

- 
-
- The real value 20.1 is much closer to 20 than 21, so integer_outside
- is pessimistic. We could also use integer_round_nearest policy to
- suggest that 20 is more likely.
- 
-
- 
-
- Finally, we can tabulate the probability for the last sale being
- exactly on each house.
- 
+ The real value 20.1 is much closer to 20 than 21, so integer_outside
+ is pessimistic. We could also use integer_round_nearest policy to suggest
+ that 20 is more likely.
+ 

- 
+ Finally, we can tabulate the probability for the last sale being exactly
+ on each house.
+ 

-
+

<pre class="programlisting">cout << "\nHouse for " << sales_quota << "th (last) sale. Probability (%)" << endl;
cout.precision(5);
@@ -719,10 +540,7 @@
}
cout << endl;</pre>

- 
-
-
-
+ 
<pre class="programlisting">House for 5 th (last) sale. Probability (%)
5 0.01024
6 0.04096
@@ -752,15 +570,11 @@
30 0.99849
</pre>

- 
-
- As noted above, using a catch block is always a good idea, even if
- you do not expect to use it.
- 
-
- 
+ As noted above, using a catch block is always a good idea, even if
+ you do not expect to use it.
+ 

-
+

<pre class="programlisting">}
catch(const std::exception& e)
@@ -768,26 +582,19 @@
 // an overflow exception should never be thrown.
 std::cout << "\nMessage from thrown exception was:\n " << e.what() << std::endl;</pre>

- 
-
- 
+ 

- For example, without a ignore domain error policy, if we asked for
-
+ For example, without a ignore domain error policy, if we asked for
+

<pre class="programlisting">pdf(nb, -1)</pre>

- for example, we would get:
- 
-
-
-
+ for example, we would get:
+ 
<pre class="programlisting">Message from thrown exception was:
 Error in function boost::math::pdf(const negative_binomial_distribution<double>&, double):
 Number of failures argument is -1, but must be >= 0 !
</pre>
-
- 
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg/negative_binomial_example2.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg/negative_binomial_example2.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/neg_binom_eg/negative_binomial_example2.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,17 +24,15 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h6 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.neg_binom_eg.negative_binomial_example2"></a><a class="link" href="negative_binomial_example2.html" title="Negative Binomial Table Printing Example.">
- Negative Binomial Table Printing Example.</a>
+<a name="math_toolkit.dist.stat_tut.weg.neg_binom_eg.negative_binomial_example2"></a><a class="link" href="negative_binomial_example2.html" title="Negative Binomial Table Printing Example.">Negative
+ Binomial Table Printing Example.</a>
</h6></div></div></div>

 Example program showing output of a table of values of cdf and pdf
 for various k failures.
 

- 
-
-
+

<pre class="programlisting">// Print a table of values that can be used to plot
// using Excel, or some other superior graphical display tool.
@@ -56,11 +54,9 @@
cout << endl;
</pre>

- 
-
- 
+ 

-
+

<pre class="programlisting">k pdf cdf
 0, 1.5258789062500000e-005 1.5258789062500003e-005
@@ -129,8 +125,6 @@
63, 0.00024610318764958566 0.99882473495070978
</pre>

- 
-
 
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/normal_example.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/normal_example.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/normal_example.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.normal_example"></a><a class="link" href="normal_example.html" title="Normal Distribution Examples"> Normal
+<a name="math_toolkit.dist.stat_tut.weg.normal_example"></a><a class="link" href="normal_example.html" title="Normal Distribution Examples">Normal
 Distribution Examples</a>
</h5></div></div></div>
-<div class="toc"><dl><dt><a href="normal_example/normal_misc.html">
- Some Miscellaneous Examples of the Normal (Gaussian) Distribution</a></dt></dl></div>
+<div class="toc"><dl><dt><a href="normal_example/normal_misc.html">Some
+ Miscellaneous Examples of the Normal (Gaussian) Distribution</a></dt></dl></div>

 (See also the reference documentation for the <a class="link" href="../../dist_ref/dists/normal_dist.html" title="Normal (Gaussian) Distribution">Normal
 Distribution</a>.)

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/normal_example/normal_misc.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/normal_example/normal_misc.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/normal_example/normal_misc.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,28 +24,24 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h6 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.normal_example.normal_misc"></a><a class="link" href="normal_misc.html" title="Some Miscellaneous Examples of the Normal (Gaussian) Distribution">
- Some Miscellaneous Examples of the Normal (Gaussian) Distribution</a>
+<a name="math_toolkit.dist.stat_tut.weg.normal_example.normal_misc"></a><a class="link" href="normal_misc.html" title="Some Miscellaneous Examples of the Normal (Gaussian) Distribution">Some
+ Miscellaneous Examples of the Normal (Gaussian) Distribution</a>
</h6></div></div></div>

 The sample program normal_misc_examples.cpp
 illustrates their use.
 
<a name="math_toolkit.dist.stat_tut.weg.normal_example.normal_misc.traditional_tables"></a><h5>
-<a name="id1087326"></a>
+<a name="id957276"></a>
 <a class="link" href="normal_misc.html#math_toolkit.dist.stat_tut.weg.normal_example.normal_misc.traditional_tables">Traditional
 Tables</a>
 </h5>

- 
-
- First we need some includes to access the normal distribution (and
- some std output of course).
- 
-
- 
+ First we need some includes to access the normal distribution (and
+ some std output of course).
+ 

-
+

<pre class="programlisting">#include <boost/math/distributions/normal.hpp> // for normal_distribution
 using boost::math::normal; // typedef provides default type is double.
@@ -65,16 +61,12 @@
 {
 { // Traditional tables and values.</pre>

- 
-
- 
-
- Let's start by printing some traditional tables.
- 
+ 

- 
+ Let's start by printing some traditional tables.
+ 

-
+

<pre class="programlisting">double step = 1.; // in z
double range = 4; // min and max z = -range to +range.
@@ -85,16 +77,12 @@
 cout << "Standard normal distribution, mean = "<< s.mean()
 << ", standard deviation = " << s.standard_deviation() << endl;</pre>

- 
-
- 
-
- First the probability distribution function (pdf).
- 
+ 

- 
+ First the probability distribution function (pdf).
+ 

-
+

<pre class="programlisting">cout << "Probability distribution function values" << endl;
cout << " z " " pdf " << endl;
@@ -106,17 +94,13 @@
}
cout.precision(6); // default</pre>

- 
-
- 
-
- And the area under the normal curve from -∞ up to z, the cumulative
- distribution function (cdf).
- 
+ 

- 
+ And the area under the normal curve from -∞ up to z, the cumulative distribution
+ function (cdf).
+ 

-
+

<pre class="programlisting">// For a standard normal distribution
cout << "Standard normal mean = "<< s.mean()
@@ -130,116 +114,88 @@
}
cout.precision(6); // default</pre>

- 
-
- 
+ 

- And all this you can do with a nanoscopic amount of work compared
- to the team of human computers toiling
- with Milton Abramovitz and Irene Stegen at the US National Bureau
- of Standards (now NIST).
- Starting in 1938, their "Handbook of Mathematical Functions
- with Formulas, Graphs and Mathematical Tables", was eventually
- published in 1964, and has been reprinted numerous times since. (A
- major replacement is planned at <a href="http://dlmf.nist.gov" target="_top">Digital
- Library of Mathematical Functions</a>).
- 
-
- 
-
- Pretty-printing a traditional 2-dimensional table is left as an exercise
- for the student, but why bother now that the Math Toolkit lets you
- write
- 
+ And all this you can do with a nanoscopic amount of work compared to
+ the team of human computers toiling
+ with Milton Abramovitz and Irene Stegen at the US National Bureau of
+ Standards (now NIST). Starting
+ in 1938, their "Handbook of Mathematical Functions with Formulas,
+ Graphs and Mathematical Tables", was eventually published in 1964,
+ and has been reprinted numerous times since. (A major replacement is
+ planned at <a href="http://dlmf.nist.gov" target="_top">Digital Library of Mathematical
+ Functions</a>).
+ 

- 
+ Pretty-printing a traditional 2-dimensional table is left as an exercise
+ for the student, but why bother now that the Math Toolkit lets you
+ write
+ 

-
+

<pre class="programlisting">double z = 2.;
cout << "Area for z = " << z << " is " << cdf(s, z) << endl; // to get the area for z.</pre>

- 
-
- 
-
- Correspondingly, we can obtain the traditional 'critical' values
- for significance levels. For the 95% confidence level, the significance
- level usually called alpha, is 0.05 = 1 - 0.95 (for a one-sided test),
- so we can write
- 
+ 

- 
+ Correspondingly, we can obtain the traditional 'critical' values for
+ significance levels. For the 95% confidence level, the significance
+ level usually called alpha, is 0.05 = 1 - 0.95 (for a one-sided test),
+ so we can write
+ 

-
+

<pre class="programlisting"> cout << "95% of area has a z below " << quantile(s, 0.95) << endl;
// 95% of area has a z below 1.64485</pre>

- 
-
- 
-
- and a two-sided test (a comparison between two levels, rather than
- a one-sided test)
- 
+ 

- 
+ and a two-sided test (a comparison between two levels, rather than
+ a one-sided test)
+ 

-
+

<pre class="programlisting"> cout << "95% of area has a z between " << quantile(s, 0.975)
 << " and " << -quantile(s, 0.975) << endl;
// 95% of area has a z between 1.95996 and -1.95996</pre>

- 
-
- 
-
- First, define a table of significance levels: these are the probabilities
- that the true occurrence frequency lies outside the calculated interval.
- 
-
- 
+ 

- It is convenient to have an alpha level for the probability that
- z lies outside just one standard deviation. This will not be some
- nice neat number like 0.05, but we can easily calculate it,
- 
+ First, define a table of significance levels: these are the probabilities
+ that the true occurrence frequency lies outside the calculated interval.
+ 

- 
+ It is convenient to have an alpha level for the probability that z
+ lies outside just one standard deviation. This will not be some nice
+ neat number like 0.05, but we can easily calculate it,
+ 

-
+

<pre class="programlisting">double alpha1 = cdf(s, -1) * 2; // 0.3173105078629142
cout << setprecision(17) << "Significance level for z == 1 is " << alpha1 << endl;</pre>

- 
-
- 
-
- and place in our array of favorite alpha values.
- 
+ 

- 
+ and place in our array of favorite alpha values.
+ 

-
+

<pre class="programlisting">double alpha[] = {0.3173105078629142, // z for 1 standard deviation.
 0.20, 0.1, 0.05, 0.01, 0.001, 0.0001, 0.00001 };</pre>

- 
-
- 
-
- Confidence value as % is (1 - alpha) * 100 (so alpha 0.05 == 95%
- confidence) that the true occurrence frequency lies inside
- the calculated interval.
- 
+ 

- 
+ Confidence value as % is (1 - alpha) * 100 (so alpha 0.05 == 95% confidence)
+ that the true occurrence frequency lies inside
+ the calculated interval.
+ 

-
+

<pre class="programlisting">cout << "level of significance (alpha)" << setprecision(4) << endl;
cout << "2-sided 1 -sided z(alpha) " << endl;
@@ -250,49 +206,37 @@
}
cout << endl;</pre>

- 
+ 

- 
+ Notice the distinction between one-sided (also called one-tailed) where
+ we are using a > or < test (and
+ not both) and considering the area of the tail (integral) from z up
+ to +∞, and a two-sided test where we are using two > and
+ < tests, and thus considering two tails, from -∞ up to z low and z
+ high up to +∞.
+ 

- Notice the distinction between one-sided (also called one-tailed)
- where we are using a > or <
- test (and not both) and considering the area of the tail (integral)
- from z up to +∞, and a two-sided test where we are using two >
- and < tests, and thus considering
- two tails, from -∞ up to z low and z high up to +∞.
- 
-
- 
-
- So the 2-sided values alpha[i] are calculated using alpha[i]/2.
- 
-
- 
-
- If we consider a simple example of alpha = 0.05, then for a two-sided
- test, the lower tail area from -∞ up to -1.96 is 0.025 (alpha/2) and
- the upper tail area from +z up to +1.96 is also 0.025 (alpha/2),
- and the area between -1.96 up to 12.96 is alpha = 0.95. and the sum
- of the two tails is 0.025 + 0.025 = 0.05,
- 
+ So the 2-sided values alpha[i] are calculated using alpha[i]/2.
+ 

+ If we consider a simple example of alpha = 0.05, then for a two-sided
+ test, the lower tail area from -∞ up to -1.96 is 0.025 (alpha/2) and
+ the upper tail area from +z up to +1.96 is also 0.025 (alpha/2), and
+ the area between -1.96 up to 12.96 is alpha = 0.95. and the sum of
+ the two tails is 0.025 + 0.025 = 0.05,
 
<a name="math_toolkit.dist.stat_tut.weg.normal_example.normal_misc.standard_deviations_either_side_of_the_mean"></a><h5>
-<a name="id1090746"></a>
+<a name="id959612"></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>

- 
-
- Armed with the cumulative distribution function, we can easily calculate
- the easy to remember proportion of values that lie within 1, 2 and
- 3 standard deviations from the mean.
- 
-
- 
+ Armed with the cumulative distribution function, we can easily calculate
+ the easy to remember proportion of values that lie within 1, 2 and
+ 3 standard deviations from the mean.
+ 

-
+

<pre class="programlisting">cout.precision(3);
cout << showpoint << "cdf(s, s.standard_deviation()) = "
@@ -306,105 +250,77 @@
cout << "Fraction 3 standard deviations within either side of mean is "
 << 1 - cdf(complement(s, 3 * s.standard_deviation())) * 2 << endl;</pre>

- 
-
- 
-
- To a useful precision, the 1, 2 & 3 percentages are 68, 95 and
- 99.7, and these are worth memorising as useful 'rules of thumb',
- as, for example, in <a href="http://en.wikipedia.org/wiki/Standard_deviation" target="_top">standard
- deviation</a>:
- 
+ 

-
-
+ To a useful precision, the 1, 2 & 3 percentages are 68, 95 and
+ 99.7, and these are worth memorising as useful 'rules of thumb', as,
+ for example, in <a href="http://en.wikipedia.org/wiki/Standard_deviation" target="_top">standard
+ deviation</a>:
+ 
<pre class="programlisting">Fraction 1 standard deviation within either side of mean is 0.683
Fraction 2 standard deviations within either side of mean is 0.954
Fraction 3 standard deviations within either side of mean is 0.997
</pre>

- 
-
- We could of course get some really accurate values for these <a href="http://en.wikipedia.org/wiki/Confidence_interval" target="_top">confidence
- intervals</a> by using cout.precision(15);
- 
-
-
-
+ We could of course get some really accurate values for these confidence intervals
+ by using cout.precision(15);
+ 
<pre class="programlisting">Fraction 1 standard deviation within either side of mean is 0.682689492137086
Fraction 2 standard deviations within either side of mean is 0.954499736103642
Fraction 3 standard deviations within either side of mean is 0.997300203936740
</pre>

- 
-
- But before you get too excited about this impressive precision, don't
- forget that the confidence intervals of the
- standard deviation are surprisingly wide, especially if
- you have estimated the standard deviation from only a few measurements.
- 
-
+ But before you get too excited about this impressive precision, don't
+ forget that the confidence intervals of the standard
+ deviation are surprisingly wide, especially if you have
+ estimated the standard deviation from only a few measurements.
 
<a name="math_toolkit.dist.stat_tut.weg.normal_example.normal_misc.some_simple_examples"></a><h5>
-<a name="id1091272"></a>
+<a name="id960136"></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="id1091286"></a>
+<a name="id960150"></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>

- 
-
- Examples from K. Krishnamoorthy, Handbook of Statistical Distributions
- with Applications, ISBN 1 58488 635 8, page 125... implemented using
- the Math Toolkit library.
- 
-
- 
-
- A few very simple examples are shown here:
- 
+ Examples from K. Krishnamoorthy, Handbook of Statistical Distributions
+ with Applications, ISBN 1 58488 635 8, page 125... implemented using
+ the Math Toolkit library.
+ 

- 
+ A few very simple examples are shown here:
+ 

-
+

<pre class="programlisting">// K. Krishnamoorthy, Handbook of Statistical Distributions with Applications,
 // ISBN 1 58488 635 8, page 125, example 10.3.5</pre>

- 
-
- 
-
- Mean lifespan of 100 W bulbs is 1100 h with standard deviation of
- 100 h. Assuming, perhaps with little evidence and much faith, that
- the distribution is normal, we construct a normal distribution called
- bulbs with these values:
- 
+ 

- 
+ Mean lifespan of 100 W bulbs is 1100 h with standard deviation of 100
+ h. Assuming, perhaps with little evidence and much faith, that the
+ distribution is normal, we construct a normal distribution called
+ bulbs with these values:
+ 

-
+

<pre class="programlisting">double mean_life = 1100.;
double life_standard_deviation = 100.;
normal bulbs(mean_life, life_standard_deviation);
double expected_life = 1000.;</pre>

- 
-
- 
-
- The we can use the Cumulative distribution function to predict fractions
- (or percentages, if * 100) that will last various lifetimes.
- 
+ 

- 
+ The we can use the Cumulative distribution function to predict fractions
+ (or percentages, if * 100) that will last various lifetimes.
+ 

-
+

<pre class="programlisting">cout << "Fraction of bulbs that will last at best (<=) " // P(X <= 1000)
 << expected_life << " is "<< cdf(bulbs, expected_life) << endl;
@@ -417,38 +333,30 @@
 << cdf(bulbs, max_life) // P(X <= 1200)
 - cdf(bulbs, min_life) << endl; // P(X <= 900)</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">
- Real-life failures are often very ab-normal, with a significant
- number that 'dead-on-arrival' or suffer failure very early in their
- life: the lifetime of the survivors of 'early mortality' may be
- well described by the normal distribution.
- </td></tr>
+ Real-life failures are often very ab-normal, with a significant number
+ that 'dead-on-arrival' or suffer failure very early in their life:
+ the lifetime of the survivors of 'early mortality' may be well described
+ by the normal distribution.
+ </td></tr>
</table></div>
-
- 
<a name="math_toolkit.dist.stat_tut.weg.normal_example.normal_misc.how_many_onions_"></a><h5>
-<a name="id1092381"></a>
+<a name="id960657"></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>

- 
-
- Weekly demand for 5 lb sacks of onions at a store is normally distributed
- with mean 140 sacks and standard deviation 10.
- 
-
- 
+ Weekly demand for 5 lb sacks of onions at a store is normally distributed
+ with mean 140 sacks and standard deviation 10.
+ 

-
+

<pre class="programlisting">double mean = 140.; // sacks per week.
double standard_deviation = 10;
@@ -459,58 +367,44 @@
 << cdf(sacks, stock) * 100. << endl; // P(X <=160)
// Percentage of weeks overstocked 97.7</pre>

- 
-
- 
-
- So there will be lots of mouldy onions! So we should be able to say
- what stock level will meet demand 95% of the weeks.
- 
+ 

- 
+ So there will be lots of mouldy onions! So we should be able to say
+ what stock level will meet demand 95% of the weeks.
+ 

-
+

<pre class="programlisting">double stock_95 = quantile(sacks, 0.95);
cout << "Store should stock " << int(stock_95) << " sacks to meet 95% of demands." << endl;</pre>

- 
-
- 
-
- And it is easy to estimate how to meet 80% of demand, and waste even
- less.
- 
+ 

- 
+ And it is easy to estimate how to meet 80% of demand, and waste even
+ less.
+ 

-
+

<pre class="programlisting">double stock_80 = quantile(sacks, 0.80);
cout << "Store should stock " << int(stock_80) << " sacks to meet 8 out of 10 demands." << endl;
</pre>

- 
-
 
<a name="math_toolkit.dist.stat_tut.weg.normal_example.normal_misc.packing_beef"></a><h5>
-<a name="id1092798"></a>
+<a name="id962187"></a>
 <a class="link" href="normal_misc.html#math_toolkit.dist.stat_tut.weg.normal_example.normal_misc.packing_beef">Packing
 beef</a>
 </h5>

- 
-
- A machine is set to pack 3 kg of ground beef per pack. Over a long
- period of time it is found that the average packed was 3 kg with
- a standard deviation of 0.1 kg. Assuming the packing is normally
- distributed, we can find the fraction (or %) of packages that weigh
- more than 3.1 kg.
- 
-
- 
+ A machine is set to pack 3 kg of ground beef per pack. Over a long
+ period of time it is found that the average packed was 3 kg with a
+ standard deviation of 0.1 kg. Assuming the packing is normally distributed,
+ we can find the fraction (or %) of packages that weigh more than 3.1
+ kg.
+ 

-
+

<pre class="programlisting">double mean = 3.; // kg
double standard_deviation = 0.1; // kg
@@ -543,65 +437,47 @@
 << "fraction of packs >= " << under_weight
 << " is " << cdf(complement(nominal_packs, under_weight)) << endl;</pre>

- 
-
- 
-
- Setting the packer to 3.06449 will mean that fraction of packs >=
- 2.9 is 0.95.
- 
-
- 
-
- Setting the packer to 3.13263 will mean that fraction of packs >=
- 2.9 is 0.99, but will more than double the mean loss from 0.0644
- to 0.133.
- 
-
- 
+ 

- Alternatively, we could invest in a better (more precise) packer
- with a lower standard deviation.
- 
+ Setting the packer to 3.06449 will mean that fraction of packs >=
+ 2.9 is 0.95.
+ 

- 
+ Setting the packer to 3.13263 will mean that fraction of packs >=
+ 2.9 is 0.99, but will more than double the mean loss from 0.0644 to
+ 0.133.
+ 

- To estimate how much better (how much smaller standard deviation)
- it would have to be, we need to get the 5% quantile to be located
- at the under_weight limit, 2.9
- 
+ Alternatively, we could invest in a better (more precise) packer with
+ a lower standard deviation.
+ 

- 
+ To estimate how much better (how much smaller standard deviation) it
+ would have to be, we need to get the 5% quantile to be located at the
+ under_weight limit, 2.9
+ 

-
+

<pre class="programlisting">double p = 0.05; // wanted p th quantile.
cout << "Quantile of " << p << " = " << quantile(packs, p)
 << ", mean = " << packs.mean() << ", sd = " << packs.standard_deviation() << endl; //</pre>

- 
-
- 
-
- Quantile of 0.05 = 2.83551, mean = 3, sd = 0.1
- 
-
- 
-
- With the current packer (mean = 3, sd = 0.1), the 5% quantile is
- at 2.8551 kg, a little below our target of 2.9 kg. So we know that
- the standard deviation is going to have to be smaller.
- 
+ 

- 
+ Quantile of 0.05 = 2.83551, mean = 3, sd = 0.1
+ 

- Let's start by guessing that it (now 0.1) needs to be halved, to
- a standard deviation of 0.05
- 
+ With the current packer (mean = 3, sd = 0.1), the 5% quantile is at
+ 2.8551 kg, a little below our target of 2.9 kg. So we know that the
+ standard deviation is going to have to be smaller.
+ 

- 
+ Let's start by guessing that it (now 0.1) needs to be halved, to a
+ standard deviation of 0.05
+ 

-
+

<pre class="programlisting">normal pack05(mean, 0.05);
cout << "Quantile of " << p << " = " << quantile(pack05, p)
@@ -612,24 +488,18 @@
 << " is " << cdf(complement(pack05, under_weight)) << endl;
//</pre>

- 
-
- 
-
- Fraction of packs >= 2.9 with a mean of 3 and standard deviation
- of 0.05 is 0.9772
- 
-
- 
+ 

- So 0.05 was quite a good guess, but we are a little over the 2.9
- target, so the standard deviation could be a tiny bit more. So we
- could do some more guessing to get closer, say by increasing to 0.06
- 
+ Fraction of packs >= 2.9 with a mean of 3 and standard deviation
+ of 0.05 is 0.9772
+ 

- 
+ So 0.05 was quite a good guess, but we are a little over the 2.9 target,
+ so the standard deviation could be a tiny bit more. So we could do
+ some more guessing to get closer, say by increasing to 0.06
+ 

-
+

<pre class="programlisting">normal pack06(mean, 0.06);
cout << "Quantile of " << p << " = " << quantile(pack06, p)
@@ -639,31 +509,23 @@
 << " and standard deviation of " << pack06.standard_deviation()
 << " is " << cdf(complement(pack06, under_weight)) << endl;</pre>

- 
-
- 
-
- Fraction of packs >= 2.9 with a mean of 3 and standard deviation
- of 0.06 is 0.9522
- 
-
- 
-
- Now we are getting really close, but to do the job properly, we could
- use root finding method, for example the tools provided, and used
- elsewhere, in the Math Toolkit, see <a class="link" href="../../../../toolkit/internals1/roots2.html" title="Root Finding Without Derivatives">Root
- Finding Without Derivatives</a>.
- 
+ 

- 
+ Fraction of packs >= 2.9 with a mean of 3 and standard deviation
+ of 0.06 is 0.9522
+ 

- But in this normal distribution case, we could be even smarter and
- make a direct calculation.
- 
+ Now we are getting really close, but to do the job properly, we could
+ use root finding method, for example the tools provided, and used elsewhere,
+ in the Math Toolkit, see <a class="link" href="../../../../toolkit/internals1/roots2.html" title="Root Finding Without Derivatives">Root
+ Finding Without Derivatives</a>.
+ 

- 
+ But in this normal distribution case, we could be even smarter and
+ make a direct calculation.
+ 

-
+

<pre class="programlisting">normal s; // For standard normal distribution,
double sd = 0.1;
@@ -689,37 +551,29 @@

// Fraction of packs >= 2.9 with a mean of 3 and standard deviation of 0.0608 is 0.95</pre>

- 
-
- 
-
- Notice that these two deceptively simple questions (do we over-fill
- or measure better) are actually very common. The weight of beef might
- be replaced by a measurement of more or less anything. But the calculations
- rely on the accuracy of the standard deviation - something that is
- almost always less good than we might wish, especially if based on
- a few measurements.
- 
+ 

+ Notice that these two deceptively simple questions (do we over-fill
+ or measure better) are actually very common. The weight of beef might
+ be replaced by a measurement of more or less anything. But the calculations
+ rely on the accuracy of the standard deviation - something that is
+ almost always less good than we might wish, especially if based on
+ a few measurements.
 
<a name="math_toolkit.dist.stat_tut.weg.normal_example.normal_misc.length_of_bolts"></a><h5>
-<a name="id1095156"></a>
+<a name="id964540"></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>

- 
-
- A bolt is usable if between 3.9 and 4.1 long. From a large batch
- of bolts, a sample of 50 show a mean length of 3.95 with standard
- deviation 0.1. Assuming a normal distribution, what proportion is
- usable? The true sample mean is unknown, but we can use the sample
- mean and standard deviation to find approximate solutions.
- 
-
- 
+ A bolt is usable if between 3.9 and 4.1 long. From a large batch of
+ bolts, a sample of 50 show a mean length of 3.95 with standard deviation
+ 0.1. Assuming a normal distribution, what proportion is usable? The
+ true sample mean is unknown, but we can use the sample mean and standard
+ deviation to find approximate solutions.
+ 

-
+

<pre class="programlisting"> normal bolts(3.95, 0.1);
 double top = 4.1;
@@ -738,8 +592,6 @@

</pre>

- 
-
 
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,21 +24,21 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h5 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.st_eg"></a><a class="link" href="st_eg.html" title="Student's t Distribution Examples"> Student's
- t Distribution Examples</a>
+<a name="math_toolkit.dist.stat_tut.weg.st_eg"></a><a class="link" href="st_eg.html" title="Student's t Distribution Examples">Student's t
+ Distribution Examples</a>
</h5></div></div></div>
<div class="toc"><dl>
-<dt><a href="st_eg/tut_mean_intervals.html">
- Calculating confidence intervals on the mean with the Students-t distribution</a></dt>
-<dt><a href="st_eg/tut_mean_test.html">
- Testing a sample mean for difference from a "true" mean</a></dt>
-<dt><a href="st_eg/tut_mean_size.html">
- Estimating how large a sample size would have to become in order to give
- a significant Students-t test result with a single sample test</a></dt>
-<dt><a href="st_eg/two_sample_students_t.html">
- Comparing the means of two samples with the Students-t test</a></dt>
-<dt><a href="st_eg/paired_st.html">
- Comparing two paired samples with the Student's t distribution</a></dt>
+<dt><a href="st_eg/tut_mean_intervals.html">Calculating
+ confidence intervals on the mean with the Students-t distribution</a></dt>
+<dt><a href="st_eg/tut_mean_test.html">Testing
+ a sample mean for difference from a "true" mean</a></dt>
+<dt><a href="st_eg/tut_mean_size.html">Estimating
+ how large a sample size would have to become in order to give a significant
+ Students-t test result with a single sample test</a></dt>
+<dt><a href="st_eg/two_sample_students_t.html">Comparing
+ the means of two samples with the Students-t test</a></dt>
+<dt><a href="st_eg/paired_st.html">Comparing
+ two paired samples with the Student's t distribution</a></dt>
</dl></div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg/paired_st.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg/paired_st.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg/paired_st.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h6 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.st_eg.paired_st"></a><a class="link" href="paired_st.html" title="Comparing two paired samples with the Student's t distribution">
- Comparing two paired samples with the Student's t distribution</a>
+<a name="math_toolkit.dist.stat_tut.weg.st_eg.paired_st"></a><a class="link" href="paired_st.html" title="Comparing two paired samples with the Student's t distribution">Comparing
+ two paired samples with the Student's t distribution</a>
</h6></div></div></div>

Imagine that we have a before and after reading for each item in the

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg/tut_mean_intervals.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg/tut_mean_intervals.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg/tut_mean_intervals.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h6 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.st_eg.tut_mean_intervals"></a><a class="link" href="tut_mean_intervals.html" title="Calculating confidence intervals on the mean with the Students-t distribution">
- Calculating confidence intervals on the mean with the Students-t distribution</a>
+<a name="math_toolkit.dist.stat_tut.weg.st_eg.tut_mean_intervals"></a><a class="link" href="tut_mean_intervals.html" title="Calculating confidence intervals on the mean with the Students-t distribution">Calculating
+ confidence intervals on the mean with the Students-t distribution</a>
</h6></div></div></div>

 Let's say you have a sample mean, you may wish to know what confidence
@@ -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.

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg/tut_mean_size.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg/tut_mean_size.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg/tut_mean_size.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,9 +24,9 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h6 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.st_eg.tut_mean_size"></a><a class="link" href="tut_mean_size.html" title="Estimating how large a sample size would have to become in order to give a significant Students-t test result with a single sample test">
- Estimating how large a sample size would have to become in order to give
- a significant Students-t test result with a single sample test</a>
+<a name="math_toolkit.dist.stat_tut.weg.st_eg.tut_mean_size"></a><a class="link" href="tut_mean_size.html" title="Estimating how large a sample size would have to become in order to give a significant Students-t test result with a single sample test">Estimating
+ how large a sample size would have to become in order to give a significant
+ Students-t test result with a single sample test</a>
</h6></div></div></div>

Imagine you have conducted a Students-t test on a single sample in

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg/tut_mean_test.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg/tut_mean_test.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg/tut_mean_test.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h6 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.st_eg.tut_mean_test"></a><a class="link" href="tut_mean_test.html" title='Testing a sample mean for difference from a "true" mean'>
- Testing a sample mean for difference from a "true" mean</a>
+<a name="math_toolkit.dist.stat_tut.weg.st_eg.tut_mean_test"></a><a class="link" href="tut_mean_test.html" title='Testing a sample mean for difference from a "true" mean'>Testing
+ a sample mean for difference from a "true" mean</a>
</h6></div></div></div>

When calibrating or comparing a scientific instrument or measurement

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg/two_sample_students_t.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg/two_sample_students_t.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/dist/stat_tut/weg/st_eg/two_sample_students_t.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h6 class="title">
-<a name="math_toolkit.dist.stat_tut.weg.st_eg.two_sample_students_t"></a><a class="link" href="two_sample_students_t.html" title="Comparing the means of two samples with the Students-t test">
- Comparing the means of two samples with the Students-t test</a>
+<a name="math_toolkit.dist.stat_tut.weg.st_eg.two_sample_students_t"></a><a class="link" href="two_sample_students_t.html" title="Comparing the means of two samples with the Students-t test">Comparing
+ the means of two samples with the Students-t test</a>
</h6></div></div></div>

Imagine that we have two samples, and we wish to determine whether

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/extern_c.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/extern_c.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/extern_c.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,13 +24,13 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="math_toolkit.extern_c"></a><a class="link" href="extern_c.html" title='TR1 and C99 external "C" Functions'> TR1 and C99 external "C"
+<a name="math_toolkit.extern_c"></a><a class="link" href="extern_c.html" title='TR1 and C99 external "C" Functions'>TR1 and C99 external "C"
Functions</a>
</h2></div></div></div>
<div class="toc"><dl>
-<dt> C99 and TR1 C Functions Overview</dt>
-<dt> C99 C Functions</dt>
-<dt><a href="extern_c/tr1_ref.html"> TR1 C Functions Quick
+<dt>C99 and TR1 C Functions Overview</dt>
+<dt>C99 C Functions</dt>
+<dt><a href="extern_c/tr1_ref.html">TR1 C Functions Quick
Reference</a></dt>
</dl></div>
</div>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/extern_c/c99.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/extern_c/c99.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/extern_c/c99.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,10 +24,10 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.extern_c.c99"></a><a class="link" href="c99.html" title="C99 C Functions"> C99 C Functions</a>
+<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="id1283610"></a>
+<a name="id1156058"></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="id1286427"></a>
+<a name="id1158329"></a>
 <a class="link" href="c99.html#math_toolkit.extern_c.c99.quick_reference">Quick Reference</a>
 </h5>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/extern_c/tr1.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/extern_c/tr1.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/extern_c/tr1.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,86 +24,68 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.extern_c.tr1"></a><a class="link" href="tr1.html" title="C99 and TR1 C Functions Overview"> C99 and TR1 C Functions Overview</a>
+<a name="math_toolkit.extern_c.tr1"></a><a class="link" href="tr1.html" title="C99 and TR1 C Functions Overview">C99 and TR1 C Functions Overview</a>
</h3></div></div></div>

- 
-
- Many of the special functions included in this library are also a part
- of the either the <a href="http://www.open-std.org/JTC1/SC22/WG14/www/docs/n1256.pdf" target="_top">C99
- Standard ISO/IEC 9899:1999</a> or the <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2005/n1836.pdf" target="_top">Technical
- Report on C++ Library Extensions</a>. Therefore this library includes
- a thin wrapper header <code class="computeroutput">boost/math/tr1.hpp</code>
- that provides compatibility with these two standards.
- 
-
- 
-
- There are various pros and cons to using the library in this way:
- 
-
- 
+ Many of the special functions included in this library are also a part of
+ the either the <a href="http://www.open-std.org/JTC1/SC22/WG14/www/docs/n1256.pdf" target="_top">C99
+ Standard ISO/IEC 9899:1999</a> or the <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2005/n1836.pdf" target="_top">Technical
+ Report on C++ Library Extensions</a>. Therefore this library includes
+ a thin wrapper header <code class="computeroutput">boost/math/tr1.hpp</code>
+ that provides compatibility with these two standards.
+ 

- Pros:
- 
+ There are various pros and cons to using the library in this way:
+ 

- 
+ Pros:
+ 
<div class="itemizedlist"><ul type="disc">
<li>
- The header to include is lightweight (i.e. fast to compile).
- </li>
+ The header to include is lightweight (i.e. fast to compile).
+ </li>
<li>
- The functions have extern "C" linkage, and so are usable
- from other languages (not just C and C++).
- </li>
+ The functions have extern "C" linkage, and so are usable from
+ other languages (not just C and C++).
+ </li>
<li>
- C99 and C++ TR1 Standard compatibility.
- </li>
+ C99 and C++ TR1 Standard compatibility.
+ </li>
</ul></div>

- 
-
- Cons:
- 
-
- 
+ Cons:
+ 
<div class="itemizedlist"><ul type="disc">
<li>
- You will need to compile and link to the external Boost.Math libraries.
- </li>
+ You will need to compile and link to the external Boost.Math libraries.
+ </li>
<li>
- Limited to support for the types, <code class="computeroutput">float</code>,
- <code class="computeroutput">double</code> and <code class="computeroutput">long double</code>.
- </li>
+ Limited to support for the types, <code class="computeroutput">float</code>,
+ <code class="computeroutput">double</code> and <code class="computeroutput">long double</code>.
+ </li>
<li>
- Error handling is handled via setting ::errno and returning NaN's and
- infinities: this may be less flexible than an C++ exception based approach.
- </li>
+ Error handling is handled via setting ::errno and returning NaN's and
+ infinities: this may be less flexible than an C++ exception based approach.
+ </li>
</ul></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">
- The separate libraries are required only
- if you choose to use boost/math/tr1.hpp rather than some other Boost.Math
- header, the rest of Boost.Math remains header-only.
- </td></tr>
+ The separate libraries are required only
+ if you choose to use boost/math/tr1.hpp rather than some other Boost.Math
+ header, the rest of Boost.Math remains header-only.
+ </td></tr>
</table></div>

- 
-
- The separate libraries required in order to use tr1.hpp can be compiled
- using bjam from within the libs/math/build directory, or from the Boost
- root directory using the usual Boost-wide install procedure. Alternatively
- the source files are located in libs/math/src and each have the same name
- as the function they implement. The various libraries are named as follows:
- 
-
- 
+ The separate libraries required in order to use tr1.hpp can be compiled using
+ bjam from within the libs/math/build directory, or from the Boost root directory
+ using the usual Boost-wide install procedure. Alternatively the source files
+ are located in libs/math/src and each have the same name as the function
+ they implement. The various libraries are named as follows:
+ 
<div class="informaltable"><table class="table">
<colgroup>
<col>
@@ -112,140 +94,136 @@
</colgroup>
<thead><tr>
<th>
- 
- Name
- 
- </th>
+ 
+ Name
+ 
+ </th>
<th>
- 
- Type
- 
- </th>
+ 
+ Type
+ 
+ </th>
<th>
- 
- Functions
- 
- </th>
+ 
+ Functions
+ 
+ </th>
</tr></thead>
<tbody>
<tr>
<td>
- 
- boost_math_c99f-<suffix>
- 
- </td>
-<td>
- 
- float
- 
- </td>
-<td>
- 
- C99 Functions
- 
- </td>
+ 
+ boost_math_c99f-<suffix>
+ 
+ </td>
+<td>
+ 
+ float
+ 
+ </td>
+<td>
+ 
+ C99 Functions
+ 
+ </td>
</tr>
<tr>
<td>
- 
- boost_math_c99-<suffix>
- 
- </td>
-<td>
- 
- double
- 
- </td>
-<td>
- 
- C99 Functions
- 
- </td>
+ 
+ boost_math_c99-<suffix>
+ 
+ </td>
+<td>
+ 
+ double
+ 
+ </td>
+<td>
+ 
+ C99 Functions
+ 
+ </td>
</tr>
<tr>
<td>
- 
- boost_math_c99l-<suffix>
- 
- </td>
-<td>
- 
- long double
- 
- </td>
-<td>
- 
- C99 Functions
- 
- </td>
+ 
+ boost_math_c99l-<suffix>
+ 
+ </td>
+<td>
+ 
+ long double
+ 
+ </td>
+<td>
+ 
+ C99 Functions
+ 
+ </td>
</tr>
<tr>
<td>
- 
- boost_math_tr1f-<suffix>
- 
- </td>
-<td>
- 
- float
- 
- </td>
-<td>
- 
- TR1 Functions
- 
- </td>
+ 
+ boost_math_tr1f-<suffix>
+ 
+ </td>
+<td>
+ 
+ float
+ 
+ </td>
+<td>
+ 
+ TR1 Functions
+ 
+ </td>
</tr>
<tr>
<td>
- 
- boost_math_tr1-<suffix>
- 
- </td>
-<td>
- 
- double
- 
- </td>
-<td>
- 
- TR1 Functions
- 
- </td>
+ 
+ boost_math_tr1-<suffix>
+ 
+ </td>
+<td>
+ 
+ double
+ 
+ </td>
+<td>
+ 
+ TR1 Functions
+ 
+ </td>
</tr>
<tr>
<td>
- 
- boost_math_tr1l-<suffix>
- 
- </td>
-<td>
- 
- long double
- 
- </td>
-<td>
- 
- TR1 Functions
- 
- </td>
+ 
+ boost_math_tr1l-<suffix>
+ 
+ </td>
+<td>
+ 
+ long double
+ 
+ </td>
+<td>
+ 
+ TR1 Functions
+ 
+ </td>
</tr>
</tbody>
</table></div>

- 
-
- Where <code class="computeroutput"><suffix></code> encodes the compiler and build options
- used to build the libraries: for example "libboost_math_tr1-vc80-mt-gd.lib"
- would be the statically linked TR1 library to use with Visual C++ 8.0,
- in multithreading debug mode, with the DLL VC++ runtime, where as "boost_math_tr1-vc80-mt.lib"
- would be import library for the TR1 DLL to be used with Visual C++ 8.0
- with the release multithreaded DLL VC++ runtime. Refer to the getting started
- guide for a <a href="http://www.boost.org/doc/libs/1_35_0/more/getting_started/windows.html#library-naming" target="_top">full
- explanation of the <code class="computeroutput"><suffix></code> meanings</a>.
- 
-
- 
+ Where <code class="computeroutput"><suffix></code> encodes the compiler and build options
+ used to build the libraries: for example "libboost_math_tr1-vc80-mt-gd.lib"
+ would be the statically linked TR1 library to use with Visual C++ 8.0, in
+ multithreading debug mode, with the DLL VC++ runtime, where as "boost_math_tr1-vc80-mt.lib"
+ would be import library for the TR1 DLL to be used with Visual C++ 8.0 with
+ the release multithreaded DLL VC++ runtime. Refer to the getting started
+ guide for a <a href="http://www.boost.org/doc/libs/1_35_0/more/getting_started/windows.html#library-naming" target="_top">full
+ explanation of the <code class="computeroutput"><suffix></code> meanings</a>.
+ 
<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>
@@ -253,102 +231,78 @@
</tr>
<tr><td align="left" valign="top">

- Visual C++ users will typically have the correct library variant to link
- against selected for them by boost/math/tr1.hpp based on your compiler
- settings.
- 
-
- Users will need to define BOOST_MATH_TR1_DYN_LINK when building their
- code if they want to link against the DLL versions of these libraries
- rather than the static versions.
- 
-
- Users can disable auto-linking by defining BOOST_MATH_TR1_NO_LIB when
- building: this is typically only used when linking against a customised
- build of the libraries.
- 
-</td></tr>
-</table></div>
+ Visual C++ users will typically have the correct library variant to link
+ against selected for them by boost/math/tr1.hpp based on your compiler
+ settings.
+ 
+
+ Users will need to define BOOST_MATH_TR1_DYN_LINK when building their code
+ if they want to link against the DLL versions of these libraries rather
+ than the static versions.
+ 

+ Users can disable auto-linking by defining BOOST_MATH_TR1_NO_LIB when building:
+ this is typically only used when linking against a customised build of
+ the libraries.

+</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">
- Linux and Unix users will generally only have one variant of these libraries
- installed, and can generally just link against -lboost_math_tr1 etc.
- </td></tr>
+ Linux and Unix users will generally only have one variant of these libraries
+ installed, and can generally just link against -lboost_math_tr1 etc.
+ </td></tr>
</table></div>
+<a name="math_toolkit.extern_c.tr1.usage_recomendations"></a><h5>
+<a name="id1146554"></a>
+ <a class="link" href="tr1.html#math_toolkit.extern_c.tr1.usage_recomendations">Usage Recomendations</a>
+ </h5>

- <a name="math_toolkit.extern_c.tr1.usage_recomendations"></a>
- 
-<h5>
-<a name="id1274661"></a>
- <a class="link" href="tr1.html#math_toolkit.extern_c.tr1.usage_recomendations">Usage Recomendations</a>
- </h5>
-
- 
-
- This library now presents the user with a choice:
- 
-
- 
+ This library now presents the user with a choice:
+ 
<div class="itemizedlist"><ul type="disc">
<li>
- To include the header only versions of the functions and have an easier
- time linking, but a longer compile time.
- </li>
+ To include the header only versions of the functions and have an easier
+ time linking, but a longer compile time.
+ </li>
<li>
- To include the TR1 headers and link against an external library.
- </li>
+ To include the TR1 headers and link against an external library.
+ </li>
</ul></div>

- 
-
- Which option you choose depends largely on how you prefer to work and how
- your system is set up.
- 
-
- 
-
- For example a casual user who just needs the acosh function, would probably
- be better off including <code class="computeroutput"><boost/math/special_functions/acosh.hpp></code>
- and using <code class="computeroutput">boost::math::acosh(x)</code> in
- their code.
- 
-
- 
-
- However, for large scale software development where compile times are significant,
- and where the Boost libraries are already built and installed on the system,
- then including <code class="computeroutput"><boost/math/tr1.hpp></code> and using <code class="computeroutput">boost::math::tr1::acosh(x)</code>
- will speed up compile times, reduce object files sizes (since there are
- no templates being instantiated any more), and also speed up debugging
- runtimes - since the externally compiled libraries can be compiler optimised,
- rather than built using full settings - the difference in performance between
- <a class="link" href="../perf/getting_best.html" title="Getting the Best Performance from this Library">release and debug builds
- can be as much as 20 times</a>, so for complex applications this can
- be a big win.
- 
-
- <a name="math_toolkit.extern_c.tr1.supported_c99_functions"></a>
- 
-<h5>
-<a name="id1274864"></a>
- <a class="link" href="tr1.html#math_toolkit.extern_c.tr1.supported_c99_functions">Supported
- C99 Functions</a>
- </h5>
+ Which option you choose depends largely on how you prefer to work and how
+ your system is set up.
+ 

- 
+ For example a casual user who just needs the acosh function, would probably
+ be better off including <code class="computeroutput"><boost/math/special_functions/acosh.hpp></code>
+ and using <code class="computeroutput">boost::math::acosh(x)</code> in their
+ code.
+ 

- See also the <a class="link" href="c99.html" title="C99 C Functions">quick reference
- guide for these functions</a>.
- 
+ However, for large scale software development where compile times are significant,
+ and where the Boost libraries are already built and installed on the system,
+ then including <code class="computeroutput"><boost/math/tr1.hpp></code> and using <code class="computeroutput">boost::math::tr1::acosh(x)</code> will
+ speed up compile times, reduce object files sizes (since there are no templates
+ being instantiated any more), and also speed up debugging runtimes - since
+ the externally compiled libraries can be compiler optimised, rather than
+ built using full settings - the difference in performance between <a class="link" href="../perf/getting_best.html" title="Getting the Best Performance from this Library">release
+ and debug builds can be as much as 20 times</a>, so for complex applications
+ this can be a big win.
+ 
+<a name="math_toolkit.extern_c.tr1.supported_c99_functions"></a><h5>
+<a name="id1146756"></a>
+ <a class="link" href="tr1.html#math_toolkit.extern_c.tr1.supported_c99_functions">Supported
+ C99 Functions</a>
+ </h5>

-
-
+ See also the <a class="link" href="c99.html" title="C99 C Functions">quick reference guide
+ for these functions</a>.
+ 
<pre class="programlisting">namespace boost{ namespace math{ namespace tr1{ extern "C"{

typedef unspecified float_t;
@@ -436,23 +390,15 @@

}}}} // namespaces
</pre>
+<a name="math_toolkit.extern_c.tr1.supported_tr1_functions"></a><h5>
+<a name="id1149964"></a>
+ <a class="link" href="tr1.html#math_toolkit.extern_c.tr1.supported_tr1_functions">Supported
+ TR1 Functions</a>
+ </h5>

- <a name="math_toolkit.extern_c.tr1.supported_tr1_functions"></a>
- 
-<h5>
-<a name="id1276986"></a>
- <a class="link" href="tr1.html#math_toolkit.extern_c.tr1.supported_tr1_functions">Supported
- TR1 Functions</a>
- </h5>
-
- 
-
- See also the <a class="link" href="tr1.html" title="C99 and TR1 C Functions Overview">quick reference
- guide for these functions</a>.
- 
-
-
-
+ See also the <a class="link" href="tr1.html" title="C99 and TR1 C Functions Overview">quick reference guide
+ for these functions</a>.
+ 
<pre class="programlisting">namespace boost{ namespace math{ namespace tr1{ extern "C"{

// [5.2.1.1] associated Laguerre polynomials:
@@ -565,27 +511,19 @@
}}}} // namespaces
</pre>

- 
-
- In addition sufficient additional overloads of the <code class="computeroutput">double</code>
- versions of the above functions are provided, so that calling the function
- with any mixture of <code class="computeroutput">float</code>,
- <code class="computeroutput">double</code>, <code class="computeroutput">long
- double</code>, or integer
- arguments is supported, with the return type determined by the <a class="link" href="../main_overview/result_type.html" title="Calculation of the Type of the Result">result
- type calculation rules</a>.
- 
-
- <a name="math_toolkit.extern_c.tr1.currently_unsupported_c99_functions"></a>
- 
-<h5>
-<a name="id1280415"></a>
- <a class="link" href="tr1.html#math_toolkit.extern_c.tr1.currently_unsupported_c99_functions">Currently
- Unsupported C99 Functions</a>
- </h5>
-
-
-
+ In addition sufficient additional overloads of the <code class="computeroutput">double</code>
+ versions of the above functions are provided, so that calling the function
+ with any mixture of <code class="computeroutput">float</code>,
+ <code class="computeroutput">double</code>, <code class="computeroutput">long
+ double</code>, or integer
+ arguments is supported, with the return type determined by the <a class="link" href="../main_overview/result_type.html" title="Calculation of the Type of the Result">result
+ type calculation rules</a>.
+ 
+<a name="math_toolkit.extern_c.tr1.currently_unsupported_c99_functions"></a><h5>
+<a name="id1152847"></a>
+ <a class="link" href="tr1.html#math_toolkit.extern_c.tr1.currently_unsupported_c99_functions">Currently
+ Unsupported C99 Functions</a>
+ </h5>
<pre class="programlisting">double exp2(double x);
float exp2f(float x);
long double exp2l(long double x);
@@ -646,17 +584,11 @@
float scalbnf(float x, int ex);
long double scalbnl(long double x, int ex);
</pre>
-
- <a name="math_toolkit.extern_c.tr1.currently_unsupported_tr1_functions"></a>
- 
-<h5>
-<a name="id1283179"></a>
- <a class="link" href="tr1.html#math_toolkit.extern_c.tr1.currently_unsupported_tr1_functions">Currently
- Unsupported TR1 Functions</a>
- </h5>
-
-
-
+<a name="math_toolkit.extern_c.tr1.currently_unsupported_tr1_functions"></a><h5>
+<a name="id1155628"></a>
+ <a class="link" href="tr1.html#math_toolkit.extern_c.tr1.currently_unsupported_tr1_functions">Currently
+ Unsupported TR1 Functions</a>
+ </h5>
<pre class="programlisting">// [5.2.1.7] confluent hypergeometric functions:
double conf_hyperg(double a, double c, double x);
float conf_hypergf(float a, float c, float x);
@@ -668,8 +600,6 @@
long double hypergl(long double a, long double b, long double c,
long double x);
</pre>
-
- 
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/extern_c/tr1_ref.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/extern_c/tr1_ref.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/extern_c/tr1_ref.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.extern_c.tr1_ref"></a><a class="link" href="tr1_ref.html" title="TR1 C Functions Quick Reference"> TR1 C Functions Quick
+<a name="math_toolkit.extern_c.tr1_ref"></a><a class="link" href="tr1_ref.html" title="TR1 C Functions Quick Reference">TR1 C Functions Quick
 Reference</a>
</h3></div></div></div>
<a name="math_toolkit.extern_c.tr1_ref.supported_tr1_functions"></a><h5>
-<a name="id1290405"></a>
+<a name="id1163399"></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="id1294493"></a>
+<a name="id1167487"></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="id1299315"></a>
+<a name="id1172428"></a>
 <a class="link" href="tr1_ref.html#math_toolkit.extern_c.tr1_ref.currently_unsupported_tr1_functions">Currently
 Unsupported TR1 Functions</a>
 </h5>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,37 +24,33 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="math_toolkit.main_overview"></a><a class="link" href="main_overview.html" title="Overview"> Overview</a>
+<a name="math_toolkit.main_overview"></a><a class="link" href="main_overview.html" title="Overview">Overview</a>
</h2></div></div></div>
<div class="toc"><dl>
-<dt> About the Math Toolkit</dt>
-<dt> Navigation</dt>
-<dt><a href="main_overview/directories.html"> Directory and
+<dt>About the Math Toolkit</dt>
+<dt>Navigation</dt>
+<dt><a href="main_overview/directories.html">Directory and
 File Structure</a></dt>
-<dt> Namespaces</dt>
-<dt><a href="main_overview/result_type.html"> Calculation
- of the Type of the Result</a></dt>
-<dt> Error Handling</dt>
-<dt> Compilers</dt>
-<dt><a href="main_overview/pol_overview.html"> Configuration
+<dt>Namespaces</dt>
+<dt><a href="main_overview/result_type.html">Calculation of
+ the Type of the Result</a></dt>
+<dt>Error Handling</dt>
+<dt>Compilers</dt>
+<dt><a href="main_overview/pol_overview.html">Configuration
 and Policies</a></dt>
-<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>
-<dt><a href="main_overview/history1.html"> History and What's
+<dt>Thread Safety</dt>
+<dt>Performance</dt>
+<dt><a href="main_overview/building.html">If and How to Build
+ 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
+<dt><a href="main_overview/tr1.html">C99 and C++ TR1 C-style
 Functions</a></dt>
-<dt><a href="main_overview/contact.html"> Contact Info and
+<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>
-
- 
-
- 
-
- 
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/building.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/building.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/building.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 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="id1024316"></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="id893176"></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="id1024761"></a>
+<a name="id893626"></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="id1024802"></a>
+<a name="id893666"></a>
 <a class="link" href="building.html#math_toolkit.main_overview.building.building_the_tests">Building
 the Tests</a>
 </h5>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/compilers_overview.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/compilers_overview.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/compilers_overview.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,18 +24,14 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.main_overview.compilers_overview"></a><a class="link" href="compilers_overview.html" title="Compilers"> Compilers</a>
+<a name="math_toolkit.main_overview.compilers_overview"></a><a class="link" href="compilers_overview.html" title="Compilers">Compilers</a>
</h3></div></div></div>

- 
-
- This section contains some information about how various compilers work
- with this library. It is not comprehensive and updated experiences are
- always welcome. Some effort has been made to suppress unhelpful warnings
- but it is difficult to achieve this on all systems.
- 
-
- 
+ This section contains some information about how various compilers work with
+ this library. It is not comprehensive and updated experiences are always
+ welcome. Some effort has been made to suppress unhelpful warnings but it
+ is difficult to achieve this on all systems.
+ 
<div class="table">
<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">
@@ -47,508 +43,498 @@
</colgroup>
<thead><tr>
<th>
- 
- Platform
- 
- </th>
+ 
+ Platform
+ 
+ </th>
<th>
- 
- Compiler
- 
- </th>
+ 
+ Compiler
+ 
+ </th>
<th>
- 
- Has long double support
- 
- </th>
+ 
+ Has long double support
+ 
+ </th>
<th>
- 
- Notes
- 
- </th>
+ 
+ Notes
+ 
+ </th>
</tr></thead>
<tbody>
<tr>
<td>
- 
- Windows
- 
- </td>
-<td>
- 
- MSVC 7.1 and later
- 
- </td>
-<td>
- 
- Yes
- 
- </td>
-<td>
- 
- All tests OK.
- 
- 
- We aim to keep our headers warning free at level 4 with this
- compiler.
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- Windows
- 
- </td>
-<td>
- 
- Intel 8.1 and later
- 
- </td>
-<td>
- 
- Yes
- 
- </td>
-<td>
- 
- All tests OK.
- 
- 
- We aim to keep our headers warning free at level 4 with this
- compiler. However, The tests cases tend to generate a lot of
- warnings relating to numeric underflow of the test data: these
- are harmless.
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- Windows
- 
- </td>
-<td>
- 
- GNU Mingw32 C++
- 
- </td>
-<td>
- 
- Yes
- 
- </td>
-<td>
- 
- All tests OK.
- 
- 
- We aim to keep our headers warning free with -Wall with this
- compiler.
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- Windows
- 
- </td>
-<td>
- 
- GNU Cygwin C++
- 
- </td>
-<td>
- 
- No
- 
- </td>
-<td>
- 
- All tests OK.
- 
- 
- We aim to keep our headers warning free with -Wall with this
- compiler.
- 
- 
- Long double support has been disabled because there are no native
- long double C std library functions available.
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- Windows
- 
- </td>
-<td>
- 
- Borland C++ 5.8.2 (Developer studio 2006)
- 
- </td>
-<td>
- 
- No
- 
- </td>
-<td>
- 
- We have only partial compatability with this compiler:
- 
- 
- Long double support has been disabled because the native long
- double C standard library functions really only forward to the
- double versions. This can result in unpredictable behaviour when
- using the long double overloads: for example <code class="computeroutput">sqrtl</code>
- applied to a finite value, can result in an infinite result.
- 
- 
- Some functions still fail to compile, there are no known workarounds
- at present.
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- Linux
- 
- </td>
-<td>
- 
- GNU C++ 3.4 and later
- 
- </td>
-<td>
- 
- Yes
- 
- </td>
-<td>
- 
- All tests OK.
- 
- 
- We aim to keep our headers warning free with -Wall with this
- compiler.
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- Linux
- 
- </td>
-<td>
- 
- Intel C++ 10.0 and later
- 
- </td>
-<td>
- 
- Yes
- 
- </td>
-<td>
- 
- All tests OK.
- 
- 
- We aim to keep our headers warning free with -Wall with this
- compiler. However, The tests cases tend to generate a lot of
- warnings relating to numeric underflow of the test data: these
- are harmless.
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- Linux
- 
- </td>
-<td>
- 
- Intel C++ 8.1 and 9.1
- 
- </td>
-<td>
- 
- No
- 
- </td>
-<td>
- 
- All tests OK.
- 
- 
- Long double support has been disabled with these compiler releases
- because calling the standard library long double math functions
- can result in a segfault. The issue is Linux distribution and
- glibc version specific and is Intel bug report #409291. Fully
- up to date releases of Intel 9.1 (post version l_cc_c_9.1.046)
- shouldn't have this problem. If you need long double support
- with this compiler, then comment out the define of BOOST_MATH_NO_LONG_DOUBLE_MATH_FUNCTIONS
- at line 55 of boost/math/tools/config.hpp.
- 
- 
- We aim to keep our headers warning free with -Wall with this
- compiler. However, The tests cases tend to generate a lot of
- warnings relating to numeric underflow of the test data: these
- are harmless.
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- Linux
- 
- </td>
-<td>
- 
- QLogic PathScale 3.0
- 
- </td>
-<td>
- 
- Yes
- 
- </td>
-<td>
- 
- Some tests involving conceptual checks fail to build, otherwise
- there appear to be no issues.
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- Linux
- 
- </td>
-<td>
- 
- Sun Studio 12
- 
- </td>
-<td>
- 
- Yes
- 
- </td>
-<td>
- 
- Some tests involving function overload resolution fail to build,
- these issues should be rairly encountered in practice.
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- Solaris
- 
- </td>
-<td>
- 
- Sun Studio 12
- 
- </td>
-<td>
- 
- Yes
- 
- </td>
-<td>
- 
- Some tests involving function overload resolution fail to build,
- these issues should be rairly encountered in practice.
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- Solaris
- 
- </td>
-<td>
- 
- GNU C++ 4.x
- 
- </td>
-<td>
- 
- Yes
- 
- </td>
-<td>
- 
- All tests OK.
- 
- 
- We aim to keep our headers warning free with -Wall with this
- compiler.
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- HP Tru64
- 
- </td>
-<td>
- 
- Compaq C++ 7.1
- 
- </td>
-<td>
- 
- Yes
- 
- </td>
-<td>
- 
- All tests OK.
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- HP-UX Itanium
- 
- </td>
-<td>
- 
- HP aCC 6.x
- 
- </td>
-<td>
- 
- Yes
- 
- </td>
-<td>
- 
- All tests OK.
- 
- 
- Unfortunately this compiler emits quite a few warnings from libraries
- upon which we depend (TR1, Array etc).
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- HP-UX PA-RISC
- 
- </td>
-<td>
- 
- GNU C++ 3.4
- 
- </td>
-<td>
- 
- No
- 
- </td>
-<td>
- 
- All tests OK.
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- Apple Mac OS X, Intel
- 
- </td>
-<td>
- 
- Darwin/GNU C++ 4.x
- 
- </td>
-<td>
- 
- Yes
- 
- </td>
-<td>
- 
- All tests OK.
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- Apple Mac OS X, PowerPC
- 
- </td>
-<td>
- 
- Darwin/GNU C++ 4.x
- 
- </td>
-<td>
- 
- No
- 
- </td>
-<td>
- 
- All tests OK.
- 
- 
- Long double support has been disabled on this platform due to
- the rather strange nature of Darwin's 106-bit long double implementation.
- It should be possible to make this work if someone is prepared
- to offer assistance.
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- IMB AIX
- 
- </td>
-<td>
- 
- IBM xlc 5.3
- 
- </td>
-<td>
- 
- Yes
- 
- </td>
-<td>
- 
- All tests pass except for our fpclassify tests which fail due
- to a bug in <code class="computeroutput">std::numeric_limits</code>,
- the bug effects the test code, not fpclassify itself. The IBM
- compiler group are aware of the problem.
- 
- </td>
+ 
+ Windows
+ 
+ </td>
+<td>
+ 
+ MSVC 7.1 and later
+ 
+ </td>
+<td>
+ 
+ Yes
+ 
+ </td>
+<td>
+ 
+ All tests OK.
+ 
+ 
+ We aim to keep our headers warning free at level 4 with this compiler.
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Windows
+ 
+ </td>
+<td>
+ 
+ Intel 8.1 and later
+ 
+ </td>
+<td>
+ 
+ Yes
+ 
+ </td>
+<td>
+ 
+ All tests OK.
+ 
+ 
+ We aim to keep our headers warning free at level 4 with this compiler.
+ However, The tests cases tend to generate a lot of warnings relating
+ to numeric underflow of the test data: these are harmless.
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Windows
+ 
+ </td>
+<td>
+ 
+ GNU Mingw32 C++
+ 
+ </td>
+<td>
+ 
+ Yes
+ 
+ </td>
+<td>
+ 
+ All tests OK.
+ 
+ 
+ We aim to keep our headers warning free with -Wall with this compiler.
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Windows
+ 
+ </td>
+<td>
+ 
+ GNU Cygwin C++
+ 
+ </td>
+<td>
+ 
+ No
+ 
+ </td>
+<td>
+ 
+ All tests OK.
+ 
+ 
+ We aim to keep our headers warning free with -Wall with this compiler.
+ 
+ 
+ Long double support has been disabled because there are no native
+ long double C std library functions available.
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Windows
+ 
+ </td>
+<td>
+ 
+ Borland C++ 5.8.2 (Developer studio 2006)
+ 
+ </td>
+<td>
+ 
+ No
+ 
+ </td>
+<td>
+ 
+ We have only partial compatability with this compiler:
+ 
+ 
+ Long double support has been disabled because the native long double
+ C standard library functions really only forward to the double
+ versions. This can result in unpredictable behaviour when using
+ the long double overloads: for example <code class="computeroutput">sqrtl</code>
+ applied to a finite value, can result in an infinite result.
+ 
+ 
+ Some functions still fail to compile, there are no known workarounds
+ at present.
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Linux
+ 
+ </td>
+<td>
+ 
+ GNU C++ 3.4 and later
+ 
+ </td>
+<td>
+ 
+ Yes
+ 
+ </td>
+<td>
+ 
+ All tests OK.
+ 
+ 
+ We aim to keep our headers warning free with -Wall with this compiler.
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Linux
+ 
+ </td>
+<td>
+ 
+ Intel C++ 10.0 and later
+ 
+ </td>
+<td>
+ 
+ Yes
+ 
+ </td>
+<td>
+ 
+ All tests OK.
+ 
+ 
+ We aim to keep our headers warning free with -Wall with this compiler.
+ However, The tests cases tend to generate a lot of warnings relating
+ to numeric underflow of the test data: these are harmless.
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Linux
+ 
+ </td>
+<td>
+ 
+ Intel C++ 8.1 and 9.1
+ 
+ </td>
+<td>
+ 
+ No
+ 
+ </td>
+<td>
+ 
+ All tests OK.
+ 
+ 
+ Long double support has been disabled with these compiler releases
+ because calling the standard library long double math functions
+ can result in a segfault. The issue is Linux distribution and glibc
+ version specific and is Intel bug report #409291. Fully up to date
+ releases of Intel 9.1 (post version l_cc_c_9.1.046) shouldn't have
+ this problem. If you need long double support with this compiler,
+ then comment out the define of BOOST_MATH_NO_LONG_DOUBLE_MATH_FUNCTIONS
+ at line 55 of boost/math/tools/config.hpp.
+ 
+ 
+ We aim to keep our headers warning free with -Wall with this compiler.
+ However, The tests cases tend to generate a lot of warnings relating
+ to numeric underflow of the test data: these are harmless.
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Linux
+ 
+ </td>
+<td>
+ 
+ QLogic PathScale 3.0
+ 
+ </td>
+<td>
+ 
+ Yes
+ 
+ </td>
+<td>
+ 
+ Some tests involving conceptual checks fail to build, otherwise
+ there appear to be no issues.
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Linux
+ 
+ </td>
+<td>
+ 
+ Sun Studio 12
+ 
+ </td>
+<td>
+ 
+ Yes
+ 
+ </td>
+<td>
+ 
+ Some tests involving function overload resolution fail to build,
+ these issues should be rairly encountered in practice.
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Solaris
+ 
+ </td>
+<td>
+ 
+ Sun Studio 12
+ 
+ </td>
+<td>
+ 
+ Yes
+ 
+ </td>
+<td>
+ 
+ Some tests involving function overload resolution fail to build,
+ these issues should be rairly encountered in practice.
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Solaris
+ 
+ </td>
+<td>
+ 
+ GNU C++ 4.x
+ 
+ </td>
+<td>
+ 
+ Yes
+ 
+ </td>
+<td>
+ 
+ All tests OK.
+ 
+ 
+ We aim to keep our headers warning free with -Wall with this compiler.
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ HP Tru64
+ 
+ </td>
+<td>
+ 
+ Compaq C++ 7.1
+ 
+ </td>
+<td>
+ 
+ Yes
+ 
+ </td>
+<td>
+ 
+ All tests OK.
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ HP-UX Itanium
+ 
+ </td>
+<td>
+ 
+ HP aCC 6.x
+ 
+ </td>
+<td>
+ 
+ Yes
+ 
+ </td>
+<td>
+ 
+ All tests OK.
+ 
+ 
+ Unfortunately this compiler emits quite a few warnings from libraries
+ upon which we depend (TR1, Array etc).
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ HP-UX PA-RISC
+ 
+ </td>
+<td>
+ 
+ GNU C++ 3.4
+ 
+ </td>
+<td>
+ 
+ No
+ 
+ </td>
+<td>
+ 
+ All tests OK.
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Apple Mac OS X, Intel
+ 
+ </td>
+<td>
+ 
+ Darwin/GNU C++ 4.x
+ 
+ </td>
+<td>
+ 
+ Yes
+ 
+ </td>
+<td>
+ 
+ All tests OK.
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Apple Mac OS X, PowerPC
+ 
+ </td>
+<td>
+ 
+ Darwin/GNU C++ 4.x
+ 
+ </td>
+<td>
+ 
+ No
+ 
+ </td>
+<td>
+ 
+ All tests OK.
+ 
+ 
+ Long double support has been disabled on this platform due to the
+ rather strange nature of Darwin's 106-bit long double implementation.
+ It should be possible to make this work if someone is prepared
+ to offer assistance.
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ IMB AIX
+ 
+ </td>
+<td>
+ 
+ IBM xlc 5.3
+ 
+ </td>
+<td>
+ 
+ Yes
+ 
+ </td>
+<td>
+ 
+ All tests pass except for our fpclassify tests which fail due to
+ a bug in <code class="computeroutput">std::numeric_limits</code>, the bug effects
+ the test code, not fpclassify itself. The IBM compiler group are
+ aware of the problem.
+ 
+ </td>
</tr>
</tbody>
</table></div>
</div>
- 
- 
-<div class="table">
+ <div class="table">
<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>
@@ -557,68 +543,59 @@
</colgroup>
<thead><tr>
<th>
- 
- Platform
- 
- </th>
+ 
+ Platform
+ 
+ </th>
<th>
- 
- Compiler
- 
- </th>
+ 
+ Compiler
+ 
+ </th>
</tr></thead>
<tbody>
<tr>
<td>
- 
- Windows
- 
- </td>
-<td>
- 
- Borland C++ 5.9.2 (Borland Developer Studio 2007)
- 
- </td>
+ 
+ Windows
+ 
+ </td>
+<td>
+ 
+ Borland C++ 5.9.2 (Borland Developer Studio 2007)
+ 
+ </td>
</tr>
<tr>
<td>
- 
- Windows
- 
- </td>
-<td>
- 
- MSVC 6 and 7
- 
- </td>
+ 
+ Windows
+ 
+ </td>
+<td>
+ 
+ MSVC 6 and 7
+ 
+ </td>
</tr>
</tbody>
</table></div>
</div>
- 
- 
-
- If you're compiler or platform is not listed above, please try running
- the regression tests: cd into boost-root/libs/math/test and do a:
- 
-
-
-
+ 
+ If you're compiler or platform is not listed above, please try running the
+ regression tests: cd into boost-root/libs/math/test and do a:
+ 
<pre class="programlisting">bjam mytoolset
</pre>

- 
-
- where "mytoolset" is the name of the Boost.Build
- toolset used for your compiler. The chances are that many
- of the accuracy tests will fail at this stage - don't panic
- - the default acceptable error tolerances are quite tight, especially for
- long double types with an extended exponent range (these cause more extreme
- test cases to be executed for some functions). You will need to cast an
- eye over the output from the failing tests and make a judgement as to whether
- the error rates are acceptable or not.
- 
-
+ where "mytoolset" is the name of the Boost.Build
+ toolset used for your compiler. The chances are that many
+ of the accuracy tests will fail at this stage - don't panic -
+ the default acceptable error tolerances are quite tight, especially for long
+ double types with an extended exponent range (these cause more extreme test
+ cases to be executed for some functions). You will need to cast an eye over
+ the output from the failing tests and make a judgement as to whether the
+ error rates are acceptable or not.

</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/contact.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/contact.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/contact.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 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,11 +20,11 @@
</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">
-<a name="math_toolkit.main_overview.contact"></a><a class="link" href="contact.html" title="Contact Info and Support"> Contact Info and
+<a name="math_toolkit.main_overview.contact"></a><a class="link" href="contact.html" title="Contact Info and Support">Contact Info and
Support</a>
</h3></div></div></div>

@@ -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: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/directories.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/directories.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/directories.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.main_overview.directories"></a><a class="link" href="directories.html" title="Directory and File Structure"> Directory and
+<a name="math_toolkit.main_overview.directories"></a><a class="link" href="directories.html" title="Directory and File Structure">Directory and
 File Structure</a>
</h3></div></div></div>
<a name="math_toolkit.main_overview.directories.boost_math"></a><h5>
-<a name="id1008817"></a>
+<a name="id886338"></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="id1016740"></a>
+<a name="id886486"></a>
 <a class="link" href="directories.html#math_toolkit.main_overview.directories.boost_libs">boost/libs</a>
 </h5>
<div class="variablelist">

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/error_handling.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/error_handling.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/error_handling.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,10 +24,10 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.main_overview.error_handling"></a><a class="link" href="error_handling.html" title="Error Handling"> Error Handling</a>
+<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="id1017710"></a>
+<a name="id887449"></a>
 <a class="link" href="error_handling.html#math_toolkit.main_overview.error_handling.quick_reference">Quick
 Reference</a>
 </h5>
@@ -131,7 +131,7 @@
</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="math_toolkit.main_overview.error_handling.possible_actions_for_domain_errors"></a>Table 1. Possible Actions for Domain Errors
@@ -734,19 +734,26 @@
</tbody>
</table></div>
</div>
- <a name="math_toolkit.main_overview.error_handling.rationale"></a><h5>
-<a name="id1020209"></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="id835043"></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="id1020243"></a>
+<a name="id835089"></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="id1020296"></a>
+<a name="id835142"></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="id1020545"></a>
+<a name="id888788"></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="id1020752"></a>
+<a name="id888996"></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="id1020941"></a>
+<a name="id889184"></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="id1021086"></a>
+<a name="id889330"></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="id1021248"></a>
+<a name="id889492"></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="id1021463"></a>
+<a name="id889706"></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="id1022715"></a>
+<a name="id889871"></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="id1022947"></a>
+<a name="id890102"></a>
 <a class="link" href="error_handling.html#math_toolkit.main_overview.error_handling.errors_from_typecasts">Errors
 from typecasts</a>
 </h5>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/history1.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/history1.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/history1.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 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">
@@ -24,342 +24,278 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.main_overview.history1"></a><a class="link" href="history1.html" title="History and What's New"> History and What's
+<a name="math_toolkit.main_overview.history1"></a><a class="link" href="history1.html" title="History and What's New">History and What's
New</a>
</h3></div></div></div>
-
- <a name="math_toolkit.main_overview.history1.boost_1_45_0"></a>
- 
-<h5>
-<a name="id1025045"></a>
- <a class="link" href="history1.html#math_toolkit.main_overview.history1.boost_1_45_0">Boost-1.45.0</a>
- </h5>
-
- 
+<a name="math_toolkit.main_overview.history1.boost_1_45_0"></a><h5>
+<a name="id893898"></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>
+ 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>
- Added inverse gamma distribution at request of Thomas Mang.
- </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="id1025076"></a>
- <a class="link" href="history1.html#math_toolkit.main_overview.history1.boost_1_44_0">Boost-1.44.0</a>
- </h5>
-
- 
+<a name="math_toolkit.main_overview.history1.boost_1_44_0"></a><h5>
+<a name="id893936"></a>
+ <a class="link" href="history1.html#math_toolkit.main_overview.history1.boost_1_44_0">Boost-1.44.0</a>
+ </h5>
<div class="itemizedlist"><ul type="disc">
<li>
- Fixed incorrect range and support for Rayleigh distribution.
- </li>
+ Fixed incorrect range and support for Rayleigh distribution.
+ </li>
<li>
- Fixed numerical error in the quantile of the Student's T distribution:
- the function was returning garbage values for non-integer degrees of
- freedom between 2 and 3.
- </li>
+ Fixed numerical error in the quantile of the Student's T distribution:
+ the function was returning garbage values for non-integer degrees of
+ freedom between 2 and 3.
+ </li>
</ul></div>
-
- <a name="math_toolkit.main_overview.history1.boost_1_41_0"></a>
- 
-<h5>
-<a name="id1025107"></a>
- <a class="link" href="history1.html#math_toolkit.main_overview.history1.boost_1_41_0">Boost-1.41.0</a>
- </h5>
-
- 
+<a name="math_toolkit.main_overview.history1.boost_1_41_0"></a><h5>
+<a name="id893968"></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 its inverse.
- </li></ul></div>
-
- <a name="math_toolkit.main_overview.history1.boost_1_40_0"></a>
- 
-<h5>
-<a name="id1025131"></a>
- <a class="link" href="history1.html#math_toolkit.main_overview.history1.boost_1_40_0">Boost-1.40.0</a>
- </h5>
-
- 
+ Significantly improved performance for the incomplete gamma function
+ and its inverse.
+ </li></ul></div>
+<a name="math_toolkit.main_overview.history1.boost_1_40_0"></a><h5>
+<a name="id893992"></a>
+ <a class="link" href="history1.html#math_toolkit.main_overview.history1.boost_1_40_0">Boost-1.40.0</a>
+ </h5>
<div class="itemizedlist"><ul type="disc">
<li>
- Added support for MPFR as a bignum type.
- </li>
+ Added support for MPFR as a bignum type.
+ </li>
<li>
- Added some full specializations of the policy classes to reduce compile
- times.
- </li>
-<li>
- Added logistic and hypergeometric distributions, from Gautam Sewani's
- Google Summer of Code project.
- </li>
-<li>
- Added Laplace distribution submitted by Thijs van den Berg.
- </li>
-<li>
- Updated performance test code to include new distributions, and improved
- the performance of the non-central distributions.
- </li>
-<li>
- Added SSE2 optimised <a class="link" href="../backgrounders/lanczos.html" title="The Lanczos Approximation">Lanczos
- approximation</a> code, from Gautam Sewani's Google Summer of Code
- project.
- </li>
-<li>
- Fixed bug in cyl_bessel_i that used an incorrect approximation for
- ν = 0.5, also effects the non-central Chi Square Distribution when ν =
- 3, see bug report #2877.
- </li>
+ Added some full specializations of the policy classes to reduce compile
+ times.
+ </li>
+<li>
+ Added logistic and hypergeometric distributions, from Gautam Sewani's
+ Google Summer of Code project.
+ </li>
+<li>
+ Added Laplace distribution submitted by Thijs van den Berg.
+ </li>
+<li>
+ Updated performance test code to include new distributions, and improved
+ the performance of the non-central distributions.
+ </li>
+<li>
+ Added SSE2 optimised <a class="link" href="../backgrounders/lanczos.html" title="The Lanczos Approximation">Lanczos
+ approximation</a> code, from Gautam Sewani's Google Summer of Code
+ project.
+ </li>
+<li>
+ Fixed bug in cyl_bessel_i that used an incorrect approximation for ν =
+ 0.5, also effects the non-central Chi Square Distribution when ν = 3, see
+ bug report #2877.
+ </li>
<li>
- Fixed minor bugs #2873.
- </li>
+ Fixed minor bugs #2873.
+ </li>
</ul></div>
-
- <a name="math_toolkit.main_overview.history1.boost_1_38_0"></a>
- 
-<h5>
-<a name="id1025220"></a>
- <a class="link" href="history1.html#math_toolkit.main_overview.history1.boost_1_38_0">Boost-1.38.0</a>
- </h5>
-
- 
+<a name="math_toolkit.main_overview.history1.boost_1_38_0"></a><h5>
+<a name="id894080"></a>
+ <a class="link" href="history1.html#math_toolkit.main_overview.history1.boost_1_38_0">Boost-1.38.0</a>
+ </h5>
<div class="itemizedlist"><ul type="disc">
<li>
- Added Johan Råde's optimised floating point classification routines.
- </li>
+ Added Johan Råde's optimised floating point classification routines.
+ </li>
<li>
- Fixed code so that it compiles in GCC's -pedantic mode (bug report
- #1451).
- </li>
+ Fixed code so that it compiles in GCC's -pedantic mode (bug report #1451).
+ </li>
</ul></div>
-
- <a name="math_toolkit.main_overview.history1.boost_1_37_0"></a>
- 
-<h5>
-<a name="id1025256"></a>
- <a class="link" href="history1.html#math_toolkit.main_overview.history1.boost_1_37_0">Boost-1.37.0</a>
- </h5>
-
- 
+<a name="math_toolkit.main_overview.history1.boost_1_37_0"></a><h5>
+<a name="id894116"></a>
+ <a class="link" href="history1.html#math_toolkit.main_overview.history1.boost_1_37_0">Boost-1.37.0</a>
+ </h5>
<div class="itemizedlist"><ul type="disc"><li>
- Improved accuracy and testing of the inverse hypergeometric functions.
- </li></ul></div>
-
- <a name="math_toolkit.main_overview.history1.boost_1_36_0"></a>
- 
-<h5>
-<a name="id1025280"></a>
- <a class="link" href="history1.html#math_toolkit.main_overview.history1.boost_1_36_0">Boost-1.36.0</a>
- </h5>
-
- 
+ Improved accuracy and testing of the inverse hypergeometric functions.
+ </li></ul></div>
+<a name="math_toolkit.main_overview.history1.boost_1_36_0"></a><h5>
+<a name="id894140"></a>
+ <a class="link" href="history1.html#math_toolkit.main_overview.history1.boost_1_36_0">Boost-1.36.0</a>
+ </h5>
<div class="itemizedlist"><ul type="disc">
<li>
- Added Noncentral Chi Squared Distribution.
- </li>
+ Added Noncentral Chi Squared Distribution.
+ </li>
<li>
- Added Noncentral Beta Distribution.
- </li>
+ Added Noncentral Beta Distribution.
+ </li>
<li>
- Added Noncentral F Distribution.
- </li>
+ Added Noncentral F Distribution.
+ </li>
<li>
- Added Noncentral T Distribution.
- </li>
+ Added Noncentral T Distribution.
+ </li>
<li>
- Added Exponential Integral Functions.
- </li>
+ Added Exponential Integral Functions.
+ </li>
<li>
- Added Zeta Function.
- </li>
+ Added Zeta Function.
+ </li>
<li>
- Added Rounding and Truncation functions.
- </li>
+ Added Rounding and Truncation functions.
+ </li>
<li>
- Added Compile time powers of runtime bases.
- </li>
+ Added Compile time powers of runtime bases.
+ </li>
<li>
- Added SSE2 optimizations for Lanczos evaluation.
- </li>
+ Added SSE2 optimizations for Lanczos evaluation.
+ </li>
</ul></div>
-
- <a name="math_toolkit.main_overview.history1.boost_1_35_0__post_review_first_official_release"></a>
- 
-<h5>
-<a name="id1025365"></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>
-
- 
+<a name="math_toolkit.main_overview.history1.boost_1_35_0__post_review_first_official_release"></a><h5>
+<a name="id894227"></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>
<div class="itemizedlist"><ul type="disc">
<li>
- Added Policy based framework that allows fine grained control over
- function behaviour.
- </li>
-<li>
- Breaking change: Changed default behaviour
- for domain, pole and overflow errors to throw an exception (based on
- review feedback), this behaviour can be customised using <a class="link" href="../policy.html" title="Policies">Policy</a>'s.
- </li>
-<li>
- Breaking change: Changed exception
- thrown when an internal evaluation error occurs to boost::math::evaluation_error.
- </li>
-<li>
- Breaking change: Changed discrete
- quantiles to return an integer result: this is anything up to 20 times
- faster than finding the true root, this behaviour can be customised
- using <a class="link" href="../policy.html" title="Policies">Policy</a>'s.
- </li>
-<li>
- Polynomial/rational function evaluation is now customisable and hopefully
- faster than before.
- </li>
+ Added Policy based framework that allows fine grained control over function
+ behaviour.
+ </li>
+<li>
+ Breaking change: Changed default behaviour
+ for domain, pole and overflow errors to throw an exception (based on
+ review feedback), this behaviour can be customised using <a class="link" href="../policy.html" title="Policies">Policy</a>'s.
+ </li>
+<li>
+ Breaking change: Changed exception thrown
+ when an internal evaluation error occurs to boost::math::evaluation_error.
+ </li>
+<li>
+ Breaking change: Changed discrete quantiles
+ to return an integer result: this is anything up to 20 times faster than
+ finding the true root, this behaviour can be customised using <a class="link" href="../policy.html" title="Policies">Policy</a>'s.
+ </li>
+<li>
+ Polynomial/rational function evaluation is now customisable and hopefully
+ faster than before.
+ </li>
<li>
- Added performance test program.
- </li>
+ Added performance test program.
+ </li>
</ul></div>
-
- <a name="math_toolkit.main_overview.history1.milestone_4__second_review_candidate__1st_march_2007_"></a>
- 
-<h5>
-<a name="id1025452"></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>
-
- 
+<a name="math_toolkit.main_overview.history1.milestone_4__second_review_candidate__1st_march_2007_"></a><h5>
+<a name="id894312"></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>
<div class="itemizedlist"><ul type="disc">
<li>
- Moved Xiaogang Zhang's Bessel Functions code into the library, and
- brought them into line with the rest of the code.
- </li>
+ Moved Xiaogang Zhang's Bessel Functions code into the library, and brought
+ them into line with the rest of the code.
+ </li>
<li>
- Added C# "Distribution Explorer" demo application.
- </li>
+ Added C# "Distribution Explorer" demo application.
+ </li>
</ul></div>
-
- <a name="math_toolkit.main_overview.history1.milestone_3__first_review_candidate__31st_dec_2006_"></a>
- 
-<h5>
-<a name="id1025484"></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>
-
- 
+<a name="math_toolkit.main_overview.history1.milestone_3__first_review_candidate__31st_dec_2006_"></a><h5>
+<a name="id894344"></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>
<div class="itemizedlist"><ul type="disc">
<li>
- Implemented the main probability distribution and density functions.
- </li>
+ Implemented the main probability distribution and density functions.
+ </li>
<li>
- Implemented digamma.
- </li>
+ Implemented digamma.
+ </li>
<li>
- Added more factorial functions.
- </li>
+ Added more factorial functions.
+ </li>
<li>
- Implemented the Hermite, Legendre and Laguerre polynomials plus the
- spherical harmonic functions from TR1.
- </li>
-<li>
- Moved Xiaogang Zhang's elliptic integral code into the library, and
- brought them into line with the rest of the code.
- </li>
-<li>
- Moved Hubert Holin's existing Boost.Math special functions into this
- library and brought them into line with the rest of the code.
- </li>
+ Implemented the Hermite, Legendre and Laguerre polynomials plus the spherical
+ harmonic functions from TR1.
+ </li>
+<li>
+ Moved Xiaogang Zhang's elliptic integral code into the library, and brought
+ them into line with the rest of the code.
+ </li>
+<li>
+ Moved Hubert Holin's existing Boost.Math special functions into this
+ library and brought them into line with the rest of the code.
+ </li>
</ul></div>
-
- <a name="math_toolkit.main_overview.history1.milestone_2__released_september_10th_2006"></a>
- 
-<h5>
-<a name="id1025546"></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>
-
- 
+<a name="math_toolkit.main_overview.history1.milestone_2__released_september_10th_2006"></a><h5>
+<a name="id894406"></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>
<div class="itemizedlist"><ul type="disc">
<li>
- Implement preview release of the statistical distributions.
- </li>
+ Implement preview release of the statistical distributions.
+ </li>
<li>
- Added statistical distributions tutorial.
- </li>
+ Added statistical distributions tutorial.
+ </li>
<li>
- Implemented root finding algorithms.
- </li>
+ Implemented root finding algorithms.
+ </li>
<li>
- Implemented the inverses of the incomplete gamma and beta functions.
- </li>
+ Implemented the inverses of the incomplete gamma and beta functions.
+ </li>
<li>
- Rewrite erf/erfc as rational approximations (valid to 128-bit precision).
- </li>
+ Rewrite erf/erfc as rational approximations (valid to 128-bit precision).
+ </li>
<li>
- Integrated the statistical results generated from the test data with
- Boost.Test: uses a database of expected results, indexed by test, floating
- point type, platform, and compiler.
- </li>
+ Integrated the statistical results generated from the test data with
+ Boost.Test: uses a database of expected results, indexed by test, floating
+ point type, platform, and compiler.
+ </li>
<li>
- Improved lgamma near 1 and 2 (rational approximations).
- </li>
+ Improved lgamma near 1 and 2 (rational approximations).
+ </li>
<li>
- Improved erf/erfc inverses (rational approximations).
- </li>
+ Improved erf/erfc inverses (rational approximations).
+ </li>
<li>
- Implemented Rational function generation (the Remez method).
- </li>
+ Implemented Rational function generation (the Remez method).
+ </li>
</ul></div>
-
- <a name="math_toolkit.main_overview.history1.milestone_1__released_march_31st_2006"></a>
- 
-<h5>
-<a name="id1025628"></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>
-
- 
+<a name="math_toolkit.main_overview.history1.milestone_1__released_march_31st_2006"></a><h5>
+<a name="id894488"></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>
<div class="itemizedlist"><ul type="disc">
<li>
- Implement gamma/beta/erf functions along with their incomplete counterparts.
- </li>
+ Implement gamma/beta/erf functions along with their incomplete counterparts.
+ </li>
<li>
- Generate high quality test data, against which future improvements
- can be judged.
- </li>
-<li>
- Provide tools for the evaluation of infinite series, continued fractions,
- and rational functions.
- </li>
-<li>
- Provide tools for testing against tabulated test data, and collecting
- statistics on error rates.
- </li>
-<li>
- Provide sufficient docs for people to be able to find their way around
- the library.
- </li>
+ Generate high quality test data, against which future improvements can
+ be judged.
+ </li>
+<li>
+ Provide tools for the evaluation of infinite series, continued fractions,
+ and rational functions.
+ </li>
+<li>
+ Provide tools for testing against tabulated test data, and collecting
+ statistics on error rates.
+ </li>
+<li>
+ Provide sufficient docs for people to be able to find their way around
+ the library.
+ </li>
</ul></div>

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

+ Sandbox and trunk last synchonised at revision: .

</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/intro.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/intro.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/intro.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,13 +24,13 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.main_overview.intro"></a><a class="link" href="intro.html" title="About the Math Toolkit"> About the Math Toolkit</a>
+<a name="math_toolkit.main_overview.intro"></a><a class="link" href="intro.html" title="About the Math Toolkit">About the Math Toolkit</a>
</h3></div></div></div>

 This library is divided into three interconnected parts:
 
<a name="math_toolkit.main_overview.intro.statistical_distributions"></a><h5>
-<a name="id1008381"></a>
+<a name="id885901"></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="id1008465"></a>
+<a name="id885985"></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="id1008532"></a>
+<a name="id886052"></a>
 <a class="link" href="intro.html#math_toolkit.main_overview.intro.implementation_toolkit">Implementation
 Toolkit</a>
 </h5>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/namespaces.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/namespaces.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/namespaces.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.main_overview.namespaces"></a><a class="link" href="namespaces.html" title="Namespaces"> Namespaces</a>
+<a name="math_toolkit.main_overview.namespaces"></a><a class="link" href="namespaces.html" title="Namespaces">Namespaces</a>
</h3></div></div></div>

All math functions and distributions are in <code class="computeroutput">namespace

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/navigation.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/navigation.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/navigation.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,14 +24,14 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.main_overview.navigation"></a><a class="link" href="navigation.html" title="Navigation"> Navigation</a>
+<a name="math_toolkit.main_overview.navigation"></a><a class="link" href="navigation.html" title="Navigation">Navigation</a>
</h3></div></div></div>

 Used in combination with the configured browser key, the following keys act
 as handy shortcuts for common navigation tasks.
 
<a name="math_toolkit.main_overview.navigation.shortcuts"></a><h6>
-<a name="id1008631"></a>
+<a name="id886152"></a>
 <a class="link" href="navigation.html#math_toolkit.main_overview.navigation.shortcuts">Shortcuts</a>
 </h6>
<div class="blockquote"><blockquote class="blockquote">

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/perf_over.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/perf_over.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/perf_over.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 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>
@@ -24,56 +24,44 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.main_overview.perf_over"></a><a class="link" href="perf_over.html" title="Performance"> Performance</a>
+<a name="math_toolkit.main_overview.perf_over"></a><a class="link" href="perf_over.html" title="Performance">Performance</a>
</h3></div></div></div>

- 
-
- 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
- on accuracy and numerical stability, and not speed.
- 
-
- 
-
- In terms of the algorithms used, this library aims to use the same "best
- of breed" algorithms as many other libraries: the principle difference
- is that this library is implemented in C++ - taking advantage of all the
- abstraction mechanisms that C++ offers - where as most traditional numeric
- libraries are implemented in C or FORTRAN. Traditionally languages such
- as C or FORTRAN are perceived as easier to optimise than more complex languages
- like C++, so in a sense this library provides a good test of current compiler
- technology, and the "abstraction penalty" - if any - of C++ compared
- to other languages.
- 
-
- 
+ By and large the performance of this library should be acceptable for most
+ needs. However, you should note that this library's primary emphasis is on
+ accuracy and numerical stability, and not speed.
+ 

- The two most important things you can do to ensure the best performance
- from this library are:
- 
+ In terms of the algorithms used, this library aims to use the same "best
+ of breed" algorithms as many other libraries: the principle difference
+ is that this library is implemented in C++ - taking advantage of all the
+ abstraction mechanisms that C++ offers - where as most traditional numeric
+ libraries are implemented in C or FORTRAN. Traditionally languages such as
+ C or FORTRAN are perceived as easier to optimise than more complex languages
+ like C++, so in a sense this library provides a good test of current compiler
+ technology, and the "abstraction penalty" - if any - of C++ compared
+ to other languages.
+ 

- 
+ The two most important things you can do to ensure the best performance from
+ this library are:
+ 
<div class="orderedlist"><ol type="1">
<li>
- Turn on your compilers optimisations: the difference between "release"
- and "debug" builds can easily be a <a class="link" href="../perf/getting_best.html" title="Getting the Best Performance from this Library">factor
- of 20</a>.
- </li>
+ Turn on your compilers optimisations: the difference between "release"
+ and "debug" builds can easily be a <a class="link" href="../perf/getting_best.html" title="Getting the Best Performance from this Library">factor
+ of 20</a>.
+ </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
- compilers for example.
- </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
+ compilers for example.
+ </li>
</ol></div>

- 
-
- The <a class="link" href="../perf.html" title="Performance">performance section</a> contains
- more information on the performance of this library, what you can do to
- fine tune it, and how this library compares to some other open source alternatives.
- 
-
+ The <a class="link" href="../perf.html" title="Performance">performance section</a> contains
+ more information on the performance of this library, what you can do to fine
+ tune it, and how this library compares to some other open source alternatives.

</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/pol_overview.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/pol_overview.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/pol_overview.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,100 +24,82 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.main_overview.pol_overview"></a><a class="link" href="pol_overview.html" title="Configuration and Policies"> Configuration
+<a name="math_toolkit.main_overview.pol_overview"></a><a class="link" href="pol_overview.html" title="Configuration and Policies">Configuration
and Policies</a>
</h3></div></div></div>

- 
-
- Policies are a powerful fine-grain mechanism that allow you to customise
- the behaviour of this library according to your needs. There is more information
- available in the <a class="link" href="../policy/pol_tutorial.html" title="Policy Tutorial">policy
- tutorial</a> and the <a class="link" href="../policy/pol_ref.html" title="Policy Reference">policy
- reference</a>.
- 
-
- 
-
- 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.
- 
-
- 
-
- Policies are a compile-time mechanism that allow you to change error-handling
- or calculation precision either program wide, or at the call site.
- 
-
- 
+ Policies are a powerful fine-grain mechanism that allow you to customise
+ the behaviour of this library according to your needs. There is more information
+ available in the <a class="link" href="../policy/pol_tutorial.html" title="Policy Tutorial">policy
+ tutorial</a> and the <a class="link" href="../policy/pol_ref.html" title="Policy Reference">policy
+ reference</a>.
+ 

- Although the policy mechanism itself is rather complicated, in practice
- it is easy to use, and very flexible.
- 
+ 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.
+ 

- 
+ Policies are a compile-time mechanism that allow you to change error-handling
+ or calculation precision either program wide, or at the call site.
+ 

- Using policies you can control:
- 
+ Although the policy mechanism itself is rather complicated, in practice it
+ is easy to use, and very flexible.
+ 

- 
+ Using policies you can control:
+ 
<div class="itemizedlist"><ul type="disc">
<li>
- <a class="link" href="../policy/pol_ref/error_handling_policies.html" title="Error Handling Policies">How
- results from 'bad' arguments are handled</a>, including those that
- cannot be fully evaluated.
- </li>
-<li>
- How <a class="link" href="../policy/pol_ref/internal_promotion.html" title="Internal Promotion Policies">accuracy
- is controlled by internal promotion</a> to use more precise types.
- </li>
-<li>
- What working <a class="link" href="../policy/pol_ref/precision_pol.html" title="Precision Policies">precision</a>
- should be used to calculate results.
- </li>
-<li>
- What to do when a <a class="link" href="../policy/pol_ref/assert_undefined.html" title="Mathematically Undefined Function Policies">mathematically
- undefined function</a> is used: Should this raise a run-time or
- compile-time error?
- </li>
-<li>
- Whether <a class="link" href="../policy/pol_ref/discrete_quant_ref.html" title="Discrete Quantile Policies">discrete
- functions</a>, like the binomial, should return real or only integral
- values, and how they are rounded.
- </li>
-<li>
- How many iterations a special function is permitted to perform in a
- series evaluation or root finding algorithm before it gives up and
- raises an <a class="link" href="error_handling.html#evaluation_error">evaluation_error</a>.
- </li>
+ <a class="link" href="../policy/pol_ref/error_handling_policies.html" title="Error Handling Policies">How
+ results from 'bad' arguments are handled</a>, including those that
+ cannot be fully evaluated.
+ </li>
+<li>
+ 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>
+ What working <a class="link" href="../policy/pol_ref/precision_pol.html" title="Precision Policies">precision</a>
+ should be used to calculate results.
+ </li>
+<li>
+ What to do when a <a class="link" href="../policy/pol_ref/assert_undefined.html" title="Mathematically Undefined Function Policies">mathematically
+ undefined function</a> is used: Should this raise a run-time or compile-time
+ error?
+ </li>
+<li>
+ Whether <a class="link" href="../policy/pol_ref/discrete_quant_ref.html" title="Discrete Quantile Policies">discrete
+ functions</a>, like the binomial, should return real or only integral
+ values, and how they are rounded.
+ </li>
+<li>
+ How many iterations a special function is permitted to perform in a series
+ evaluation or root finding algorithm before it gives up and raises an
+ <a class="link" href="error_handling.html#evaluation_error">evaluation_error</a>.
+ </li>
</ul></div>

- 
-
- You can control policies:
- 
-
- 
+ You can control policies:
+ 
<div class="itemizedlist"><ul type="disc">
<li>
- Using <a class="link" href="../policy/pol_ref/policy_defaults.html" title="Using macros to Change the Policy Defaults">macros</a>
- to change any default policy: the is the prefered method for installation
- wide policies.
- </li>
-<li>
- At your chosen <a class="link" href="../policy/pol_ref/namespace_pol.html" title="Setting Polices at Namespace Scope">namespace
- scope</a> for distributions and/or functions: this is the prefered
- method for project, namespace, or translation unit scope policies.
- </li>
-<li>
- In an ad-hoc manner <a class="link" href="../policy/pol_tutorial/ad_hoc_sf_policies.html" title="Changing the Policy on an Ad Hoc Basis for the Special Functions">by
- passing a specific policy to a special function</a>, or to a <a class="link" href="../policy/pol_tutorial/ad_hoc_dist_policies.html" title="Setting Policies for Distributions on an Ad Hoc Basis">statistical
- distribution</a>.
- </li>
+ Using <a class="link" href="../policy/pol_ref/policy_defaults.html" title="Using macros to Change the Policy Defaults">macros</a>
+ to change any default policy: the is the prefered method for installation
+ wide policies.
+ </li>
+<li>
+ At your chosen <a class="link" href="../policy/pol_ref/namespace_pol.html" title="Setting Polices at Namespace Scope">namespace
+ scope</a> for distributions and/or functions: this is the prefered
+ method for project, namespace, or translation unit scope policies.
+ </li>
+<li>
+ In an ad-hoc manner <a class="link" href="../policy/pol_tutorial/ad_hoc_sf_policies.html" title="Changing the Policy on an Ad Hoc Basis for the Special Functions">by
+ passing a specific policy to a special function</a>, or to a <a class="link" href="../policy/pol_tutorial/ad_hoc_dist_policies.html" title="Setting Policies for Distributions on an Ad Hoc Basis">statistical
+ distribution</a>.
+ </li>
</ul></div>
-
- 
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/result_type.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/result_type.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/result_type.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.main_overview.result_type"></a><a class="link" href="result_type.html" title="Calculation of the Type of the Result"> Calculation
- of the Type of the Result</a>
+<a name="math_toolkit.main_overview.result_type"></a><a class="link" href="result_type.html" title="Calculation of the Type of the Result">Calculation of
+ the Type of the Result</a>
</h3></div></div></div>

The functions in this library are all overloaded to accept mixed floating

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/threads.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/threads.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/threads.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.main_overview.threads"></a><a class="link" href="threads.html" title="Thread Safety"> Thread Safety</a>
+<a name="math_toolkit.main_overview.threads"></a><a class="link" href="threads.html" title="Thread Safety">Thread Safety</a>
</h3></div></div></div>

The library is fully thread safe and re-entrant provided the function and

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/tr1.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/tr1.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/main_overview/tr1.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 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,91 +20,73 @@
</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">
-<a name="math_toolkit.main_overview.tr1"></a><a class="link" href="tr1.html" title="C99 and C++ TR1 C-style Functions"> C99 and C++ TR1 C-style
+<a name="math_toolkit.main_overview.tr1"></a><a class="link" href="tr1.html" title="C99 and C++ TR1 C-style Functions">C99 and C++ TR1 C-style
 Functions</a>
</h3></div></div></div>

- 
-
- Many of the special functions included in this library are also a part
- of the either the <a href="http://www.open-std.org/JTC1/SC22/WG14/www/docs/n1256.pdf" target="_top">C99
- Standard ISO/IEC 9899:1999</a> or the <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2005/n1836.pdf" target="_top">Technical
- Report on C++ Library Extensions</a>. Therefore this library includes
- a thin wrapper header <code class="computeroutput">boost/math/tr1.hpp</code>
- that provides compatibility with these two standards.
- 
-
- 
-
- There are various pros and cons to using the library in this way:
- 
-
- 
+ Many of the special functions included in this library are also a part of
+ the either the <a href="http://www.open-std.org/JTC1/SC22/WG14/www/docs/n1256.pdf" target="_top">C99
+ Standard ISO/IEC 9899:1999</a> or the <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2005/n1836.pdf" target="_top">Technical
+ Report on C++ Library Extensions</a>. Therefore this library includes
+ a thin wrapper header <code class="computeroutput">boost/math/tr1.hpp</code>
+ that provides compatibility with these two standards.
+ 

- Pros:
- 
+ There are various pros and cons to using the library in this way:
+ 

- 
+ Pros:
+ 
<div class="itemizedlist"><ul type="disc">
<li>
- The header to include is lightweight (i.e. fast to compile).
- </li>
+ The header to include is lightweight (i.e. fast to compile).
+ </li>
<li>
- The functions have extern "C" linkage, and so are usable
- from other languages (not just C and C++).
- </li>
+ The functions have extern "C" linkage, and so are usable from
+ other languages (not just C and C++).
+ </li>
<li>
- C99 and C++ TR1 Standard compatibility.
- </li>
+ C99 and C++ TR1 Standard compatibility.
+ </li>
</ul></div>

- 
-
- Cons:
- 
-
- 
+ Cons:
+ 
<div class="itemizedlist"><ul type="disc">
<li>
- You will need to compile and link to the external Boost.Math libraries.
- </li>
+ You will need to compile and link to the external Boost.Math libraries.
+ </li>
<li>
- Limited to support for the types, <code class="computeroutput">float</code>,
- <code class="computeroutput">double</code> and <code class="computeroutput">long double</code>.
- </li>
+ Limited to support for the types, <code class="computeroutput">float</code>,
+ <code class="computeroutput">double</code> and <code class="computeroutput">long double</code>.
+ </li>
<li>
- Error handling is handled via setting ::errno and returning NaN's and
- infinities: this may be less flexible than an C++ exception based approach.
- </li>
+ Error handling is handled via setting ::errno and returning NaN's and
+ infinities: this may be less flexible than an C++ exception based approach.
+ </li>
</ul></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">
- The separate libraries are required only
- if you choose to use boost/math/tr1.hpp rather than some other Boost.Math
- header, the rest of Boost.Math remains header-only.
- </td></tr>
+ The separate libraries are required only
+ if you choose to use boost/math/tr1.hpp rather than some other Boost.Math
+ header, the rest of Boost.Math remains header-only.
+ </td></tr>
</table></div>

- 
-
- The separate libraries required in order to use tr1.hpp can be compiled
- using bjam from within the libs/math/build directory, or from the Boost
- root directory using the usual Boost-wide install procedure. Alternatively
- the source files are located in libs/math/src and each have the same name
- as the function they implement. The various libraries are named as follows:
- 
-
- 
+ The separate libraries required in order to use tr1.hpp can be compiled using
+ bjam from within the libs/math/build directory, or from the Boost root directory
+ using the usual Boost-wide install procedure. Alternatively the source files
+ are located in libs/math/src and each have the same name as the function
+ they implement. The various libraries are named as follows:
+ 
<div class="informaltable"><table class="table">
<colgroup>
<col>
@@ -113,140 +95,136 @@
</colgroup>
<thead><tr>
<th>
- 
- Name
- 
- </th>
+ 
+ Name
+ 
+ </th>
<th>
- 
- Type
- 
- </th>
+ 
+ Type
+ 
+ </th>
<th>
- 
- Functions
- 
- </th>
+ 
+ Functions
+ 
+ </th>
</tr></thead>
<tbody>
<tr>
<td>
- 
- boost_math_c99f-<suffix>
- 
- </td>
-<td>
- 
- float
- 
- </td>
-<td>
- 
- C99 Functions
- 
- </td>
+ 
+ boost_math_c99f-<suffix>
+ 
+ </td>
+<td>
+ 
+ float
+ 
+ </td>
+<td>
+ 
+ C99 Functions
+ 
+ </td>
</tr>
<tr>
<td>
- 
- boost_math_c99-<suffix>
- 
- </td>
-<td>
- 
- double
- 
- </td>
-<td>
- 
- C99 Functions
- 
- </td>
+ 
+ boost_math_c99-<suffix>
+ 
+ </td>
+<td>
+ 
+ double
+ 
+ </td>
+<td>
+ 
+ C99 Functions
+ 
+ </td>
</tr>
<tr>
<td>
- 
- boost_math_c99l-<suffix>
- 
- </td>
-<td>
- 
- long double
- 
- </td>
-<td>
- 
- C99 Functions
- 
- </td>
+ 
+ boost_math_c99l-<suffix>
+ 
+ </td>
+<td>
+ 
+ long double
+ 
+ </td>
+<td>
+ 
+ C99 Functions
+ 
+ </td>
</tr>
<tr>
<td>
- 
- boost_math_tr1f-<suffix>
- 
- </td>
-<td>
- 
- float
- 
- </td>
-<td>
- 
- TR1 Functions
- 
- </td>
+ 
+ boost_math_tr1f-<suffix>
+ 
+ </td>
+<td>
+ 
+ float
+ 
+ </td>
+<td>
+ 
+ TR1 Functions
+ 
+ </td>
</tr>
<tr>
<td>
- 
- boost_math_tr1-<suffix>
- 
- </td>
-<td>
- 
- double
- 
- </td>
-<td>
- 
- TR1 Functions
- 
- </td>
+ 
+ boost_math_tr1-<suffix>
+ 
+ </td>
+<td>
+ 
+ double
+ 
+ </td>
+<td>
+ 
+ TR1 Functions
+ 
+ </td>
</tr>
<tr>
<td>
- 
- boost_math_tr1l-<suffix>
- 
- </td>
-<td>
- 
- long double
- 
- </td>
-<td>
- 
- TR1 Functions
- 
- </td>
+ 
+ boost_math_tr1l-<suffix>
+ 
+ </td>
+<td>
+ 
+ long double
+ 
+ </td>
+<td>
+ 
+ TR1 Functions
+ 
+ </td>
</tr>
</tbody>
</table></div>

- 
-
- Where <code class="computeroutput"><suffix></code> encodes the compiler and build options
- used to build the libraries: for example "libboost_math_tr1-vc80-mt-gd.lib"
- would be the statically linked TR1 library to use with Visual C++ 8.0,
- in multithreading debug mode, with the DLL VC++ runtime, where as "boost_math_tr1-vc80-mt.lib"
- would be import library for the TR1 DLL to be used with Visual C++ 8.0
- with the release multithreaded DLL VC++ runtime. Refer to the getting started
- guide for a <a href="http://www.boost.org/doc/libs/1_35_0/more/getting_started/windows.html#library-naming" target="_top">full
- explanation of the <code class="computeroutput"><suffix></code> meanings</a>.
- 
-
- 
+ Where <code class="computeroutput"><suffix></code> encodes the compiler and build options
+ used to build the libraries: for example "libboost_math_tr1-vc80-mt-gd.lib"
+ would be the statically linked TR1 library to use with Visual C++ 8.0, in
+ multithreading debug mode, with the DLL VC++ runtime, where as "boost_math_tr1-vc80-mt.lib"
+ would be import library for the TR1 DLL to be used with Visual C++ 8.0 with
+ the release multithreaded DLL VC++ runtime. Refer to the getting started
+ guide for a <a href="http://www.boost.org/doc/libs/1_35_0/more/getting_started/windows.html#library-naming" target="_top">full
+ explanation of the <code class="computeroutput"><suffix></code> meanings</a>.
+ 
<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>
@@ -254,103 +232,79 @@
</tr>
<tr><td align="left" valign="top">

- Visual C++ users will typically have the correct library variant to link
- against selected for them by boost/math/tr1.hpp based on your compiler
- settings.
- 
-
- Users will need to define BOOST_MATH_TR1_DYN_LINK when building their
- code if they want to link against the DLL versions of these libraries
- rather than the static versions.
- 
-
- Users can disable auto-linking by defining BOOST_MATH_TR1_NO_LIB when
- building: this is typically only used when linking against a customised
- build of the libraries.
- 
-</td></tr>
-</table></div>
+ Visual C++ users will typically have the correct library variant to link
+ against selected for them by boost/math/tr1.hpp based on your compiler
+ settings.
+ 
+
+ Users will need to define BOOST_MATH_TR1_DYN_LINK when building their code
+ if they want to link against the DLL versions of these libraries rather
+ than the static versions.
+ 

+ Users can disable auto-linking by defining BOOST_MATH_TR1_NO_LIB when building:
+ this is typically only used when linking against a customised build of
+ the libraries.
 
+</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">
- Linux and Unix users will generally only have one variant of these libraries
- installed, and can generally just link against -lboost_math_tr1 etc.
- </td></tr>
+ Linux and Unix users will generally only have one variant of these libraries
+ installed, and can generally just link against -lboost_math_tr1 etc.
+ </td></tr>
</table></div>
+<a name="math_toolkit.main_overview.tr1.usage_recomendations"></a><h5>
+<a name="id895240"></a>
+ <a class="link" href="tr1.html#math_toolkit.main_overview.tr1.usage_recomendations">Usage
+ Recomendations</a>
+ </h5>

- <a name="math_toolkit.main_overview.tr1.usage_recomendations"></a>
- 
-<h5>
-<a name="id1026101"></a>
- <a class="link" href="tr1.html#math_toolkit.main_overview.tr1.usage_recomendations">Usage
- Recomendations</a>
- </h5>
-
- 
-
- This library now presents the user with a choice:
- 
-
- 
+ This library now presents the user with a choice:
+ 
<div class="itemizedlist"><ul type="disc">
<li>
- To include the header only versions of the functions and have an easier
- time linking, but a longer compile time.
- </li>
+ To include the header only versions of the functions and have an easier
+ time linking, but a longer compile time.
+ </li>
<li>
- To include the TR1 headers and link against an external library.
- </li>
+ To include the TR1 headers and link against an external library.
+ </li>
</ul></div>

- 
-
- Which option you choose depends largely on how you prefer to work and how
- your system is set up.
- 
-
- 
-
- For example a casual user who just needs the acosh function, would probably
- be better off including <code class="computeroutput"><boost/math/special_functions/acosh.hpp></code>
- and using <code class="computeroutput">boost::math::acosh(x)</code> in
- their code.
- 
-
- 
-
- However, for large scale software development where compile times are significant,
- and where the Boost libraries are already built and installed on the system,
- then including <code class="computeroutput"><boost/math/tr1.hpp></code> and using <code class="computeroutput">boost::math::tr1::acosh(x)</code>
- will speed up compile times, reduce object files sizes (since there are
- no templates being instantiated any more), and also speed up debugging
- runtimes - since the externally compiled libraries can be compiler optimised,
- rather than built using full settings - the difference in performance between
- <a class="link" href="../perf/getting_best.html" title="Getting the Best Performance from this Library">release and debug builds
- can be as much as 20 times</a>, so for complex applications this can
- be a big win.
- 
-
- <a name="math_toolkit.main_overview.tr1.supported_c99_functions"></a>
- 
-<h5>
-<a name="id1026304"></a>
- <a class="link" href="tr1.html#math_toolkit.main_overview.tr1.supported_c99_functions">Supported
- C99 Functions</a>
- </h5>
+ Which option you choose depends largely on how you prefer to work and how
+ your system is set up.
+ 

- 
+ For example a casual user who just needs the acosh function, would probably
+ be better off including <code class="computeroutput"><boost/math/special_functions/acosh.hpp></code>
+ and using <code class="computeroutput">boost::math::acosh(x)</code> in their
+ code.
+ 

- See also the <a class="link" href="../extern_c/c99.html" title="C99 C Functions">quick reference
- guide for these functions</a>.
- 
+ However, for large scale software development where compile times are significant,
+ and where the Boost libraries are already built and installed on the system,
+ then including <code class="computeroutput"><boost/math/tr1.hpp></code> and using <code class="computeroutput">boost::math::tr1::acosh(x)</code> will
+ speed up compile times, reduce object files sizes (since there are no templates
+ being instantiated any more), and also speed up debugging runtimes - since
+ the externally compiled libraries can be compiler optimised, rather than
+ built using full settings - the difference in performance between <a class="link" href="../perf/getting_best.html" title="Getting the Best Performance from this Library">release
+ and debug builds can be as much as 20 times</a>, so for complex applications
+ this can be a big win.
+ 
+<a name="math_toolkit.main_overview.tr1.supported_c99_functions"></a><h5>
+<a name="id895443"></a>
+ <a class="link" href="tr1.html#math_toolkit.main_overview.tr1.supported_c99_functions">Supported
+ C99 Functions</a>
+ </h5>

-
-
+ See also the <a class="link" href="../extern_c/c99.html" title="C99 C Functions">quick reference guide
+ for these functions</a>.
+ 
<pre class="programlisting">namespace boost{ namespace math{ namespace tr1{ extern "C"{

typedef unspecified float_t;
@@ -438,23 +392,15 @@

}}}} // namespaces
</pre>
+<a name="math_toolkit.main_overview.tr1.supported_tr1_functions"></a><h5>
+<a name="id897830"></a>
+ <a class="link" href="tr1.html#math_toolkit.main_overview.tr1.supported_tr1_functions">Supported
+ TR1 Functions</a>
+ </h5>

- <a name="math_toolkit.main_overview.tr1.supported_tr1_functions"></a>
- 
-<h5>
-<a name="id1028957"></a>
- <a class="link" href="tr1.html#math_toolkit.main_overview.tr1.supported_tr1_functions">Supported
- TR1 Functions</a>
- </h5>
-
- 
-
- See also the <a class="link" href="../extern_c/tr1.html" title="C99 and TR1 C Functions Overview">quick reference
- guide for these functions</a>.
- 
-
-
-
+ See also the <a class="link" href="../extern_c/tr1.html" title="C99 and TR1 C Functions Overview">quick reference guide
+ for these functions</a>.
+ 
<pre class="programlisting">namespace boost{ namespace math{ namespace tr1{ extern "C"{

// [5.2.1.1] associated Laguerre polynomials:
@@ -567,27 +513,19 @@
}}}} // namespaces
</pre>

- 
-
- In addition sufficient additional overloads of the <code class="computeroutput">double</code>
- versions of the above functions are provided, so that calling the function
- with any mixture of <code class="computeroutput">float</code>,
- <code class="computeroutput">double</code>, <code class="computeroutput">long
- double</code>, or integer
- arguments is supported, with the return type determined by the <a class="link" href="result_type.html" title="Calculation of the Type of the Result">result
- type calculation rules</a>.
- 
-
- <a name="math_toolkit.main_overview.tr1.currently_unsupported_c99_functions"></a>
- 
-<h5>
-<a name="id1032930"></a>
- <a class="link" href="tr1.html#math_toolkit.main_overview.tr1.currently_unsupported_c99_functions">Currently
- Unsupported C99 Functions</a>
- </h5>
-
-
-
+ In addition sufficient additional overloads of the <code class="computeroutput">double</code>
+ versions of the above functions are provided, so that calling the function
+ with any mixture of <code class="computeroutput">float</code>,
+ <code class="computeroutput">double</code>, <code class="computeroutput">long
+ double</code>, or integer
+ arguments is supported, with the return type determined by the <a class="link" href="result_type.html" title="Calculation of the Type of the Result">result
+ type calculation rules</a>.
+ 
+<a name="math_toolkit.main_overview.tr1.currently_unsupported_c99_functions"></a><h5>
+<a name="id901803"></a>
+ <a class="link" href="tr1.html#math_toolkit.main_overview.tr1.currently_unsupported_c99_functions">Currently
+ Unsupported C99 Functions</a>
+ </h5>
<pre class="programlisting">double exp2(double x);
float exp2f(float x);
long double exp2l(long double x);
@@ -648,17 +586,11 @@
float scalbnf(float x, int ex);
long double scalbnl(long double x, int ex);
</pre>
-
- <a name="math_toolkit.main_overview.tr1.currently_unsupported_tr1_functions"></a>
- 
-<h5>
-<a name="id1035144"></a>
- <a class="link" href="tr1.html#math_toolkit.main_overview.tr1.currently_unsupported_tr1_functions">Currently
- Unsupported TR1 Functions</a>
- </h5>
-
-
-
+<a name="math_toolkit.main_overview.tr1.currently_unsupported_tr1_functions"></a><h5>
+<a name="id903470"></a>
+ <a class="link" href="tr1.html#math_toolkit.main_overview.tr1.currently_unsupported_tr1_functions">Currently
+ Unsupported TR1 Functions</a>
+ </h5>
<pre class="programlisting">// [5.2.1.7] confluent hypergeometric functions:
double conf_hyperg(double a, double c, double x);
float conf_hypergf(float a, float c, float x);
@@ -670,8 +602,6 @@
long double hypergl(long double a, long double b, long double c,
long double x);
</pre>
-
- 
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
@@ -685,7 +615,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: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/perf.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/perf.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/perf.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,18 +24,18 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="math_toolkit.perf"></a><a class="link" href="perf.html" title="Performance"> Performance</a>
+<a name="math_toolkit.perf"></a><a class="link" href="perf.html" title="Performance">Performance</a>
</h2></div></div></div>
<div class="toc"><dl>
-<dt> Performance Overview</dt>
-<dt> Interpreting these Results</dt>
-<dt><a href="perf/getting_best.html"> Getting the Best Performance
+<dt>Performance Overview</dt>
+<dt>Interpreting these Results</dt>
+<dt><a href="perf/getting_best.html">Getting the Best Performance
from this Library</a></dt>
-<dt> Comparing Compilers</dt>
-<dt> Performance Tuning Macros</dt>
-<dt><a href="perf/comparisons.html"> Comparisons to Other
- Open Source Libraries</a></dt>
-<dt><a href="perf/perf_test_app.html"> The Performance Test
+<dt>Comparing Compilers</dt>
+<dt>Performance Tuning Macros</dt>
+<dt><a href="perf/comparisons.html">Comparisons to Other Open
+ Source Libraries</a></dt>
+<dt><a href="perf/perf_test_app.html">The Performance Test
Application</a></dt>
</dl></div>
</div>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/perf/comp_compilers.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/perf/comp_compilers.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/perf/comp_compilers.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.perf.comp_compilers"></a><a class="link" href="comp_compilers.html" title="Comparing Compilers"> Comparing Compilers</a>
+<a name="math_toolkit.perf.comp_compilers"></a><a class="link" href="comp_compilers.html" title="Comparing Compilers">Comparing Compilers</a>
</h3></div></div></div>

After a good choice of build settings the next most important thing you can

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/perf/comparisons.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/perf/comparisons.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/perf/comparisons.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.perf.comparisons"></a><a class="link" href="comparisons.html" title="Comparisons to Other Open Source Libraries"> Comparisons to Other
- Open Source Libraries</a>
+<a name="math_toolkit.perf.comparisons"></a><a class="link" href="comparisons.html" title="Comparisons to Other Open Source Libraries">Comparisons to Other Open
+ Source Libraries</a>
</h3></div></div></div>

 We've run our performance tests both for our own code, and against other
@@ -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="id1388509"></a>
+<a name="id1260458"></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="id1389066" href="#ftn.id1389066" class="footnote">1</a>]
+ +INF [<a name="id1261015" href="#ftn.id1261015" class="footnote">1</a>]
 
 </td>
</tr>
@@ -423,7 +423,7 @@
<td>
 
 
-17.89[<a name="id1389223" href="#ftn.id1389223" class="footnote">2</a>]
+17.89[<a name="id1261172" href="#ftn.id1261172" 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.id1389066" href="#id1389066" class="para">1</a>] 
+<div class="footnote">[<a name="ftn.id1261015" href="#id1261015" 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.id1389223" href="#id1389223" class="para">2</a>] 
+<div class="footnote">[<a name="ftn.id1261172" href="#id1261172" 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="id1389467"></a>
+<a name="id1261416"></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>
@@ -659,7 +659,7 @@
<td>
 
 
-67.66[<a name="id1389631" href="#ftn.id1389631" class="footnote">1</a>]
+67.66[<a name="id1261580" href="#ftn.id1261580" class="footnote">1</a>]
 
(3.366e-004s)

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

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

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

@@ -1525,7 +1525,7 @@
<td>
 
 
-1.00[<a name="id1391187" href="#ftn.id1391187" class="footnote">5</a>]
+1.00[<a name="id1264220" href="#ftn.id1264220" 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.id1389631" href="#id1389631" class="para">1</a>] 
+<div class="footnote">[<a name="ftn.id1261580" href="#id1261580" 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.id1390390" href="#id1390390" class="para">2</a>] 
+<div class="footnote">[<a name="ftn.id1263431" href="#id1263431" 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.id1390810" href="#id1390810" class="para">3</a>] 
+<div class="footnote">[<a name="ftn.id1263843" href="#id1263843" 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.id1390936" href="#id1390936" class="para">4</a>] 
+<div class="footnote">[<a name="ftn.id1263969" href="#id1263969" 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.id1391187" href="#id1391187" class="para">5</a>] 
+<div class="footnote">[<a name="ftn.id1264220" href="#id1264220" 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="id1391691"></a>
+<a name="id1264724"></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>
@@ -1936,7 +1936,7 @@
<td>
 
 
-30.51[<a name="id1391857" href="#ftn.id1391857" class="footnote">1</a>]
+30.51[<a name="id1264889" href="#ftn.id1264889" class="footnote">1</a>]
 
(3.616e-004s)

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

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

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

@@ -2802,7 +2802,7 @@
<td>
 
 
-1.00[<a name="id1393399" href="#ftn.id1393399" class="footnote">5</a>]
+1.00[<a name="id1268053" href="#ftn.id1268053" 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.id1391857" href="#id1391857" class="para">1</a>] 
+<div class="footnote">[<a name="ftn.id1264889" href="#id1264889" 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.id1392613" href="#id1392613" class="para">2</a>] 
+<div class="footnote">[<a name="ftn.id1267267" href="#id1267267" 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.id1393027" href="#id1393027" class="para">3</a>] 
+<div class="footnote">[<a name="ftn.id1267681" href="#id1267681" 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.id1393153" href="#id1393153" class="para">4</a>] 
+<div class="footnote">[<a name="ftn.id1267807" href="#id1267807" 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.id1393399" href="#id1393399" class="para">5</a>] 
+<div class="footnote">[<a name="ftn.id1268053" href="#id1268053" 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.

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/perf/getting_best.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/perf/getting_best.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/perf/getting_best.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.perf.getting_best"></a><a class="link" href="getting_best.html" title="Getting the Best Performance from this Library"> Getting the Best Performance
+<a name="math_toolkit.perf.getting_best"></a><a class="link" href="getting_best.html" title="Getting the Best Performance from this Library">Getting the Best Performance
from this Library</a>
</h3></div></div></div>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/perf/interp.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/perf/interp.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/perf/interp.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.perf.interp"></a><a class="link" href="interp.html" title="Interpreting these Results"> Interpreting these Results</a>
+<a name="math_toolkit.perf.interp"></a><a class="link" href="interp.html" title="Interpreting these Results">Interpreting these Results</a>
</h3></div></div></div>

 In all of the following tables, the best performing result in each row, is
@@ -52,6 +52,17 @@
 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>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/perf/perf_over.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/perf/perf_over.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/perf/perf_over.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,56 +24,44 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.perf.perf_over"></a><a class="link" href="perf_over.html" title="Performance Overview"> Performance Overview</a>
+<a name="math_toolkit.perf.perf_over"></a><a class="link" href="perf_over.html" title="Performance Overview">Performance Overview</a>
</h3></div></div></div>

- 
-
- 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
- on accuracy and numerical stability, and not speed.
- 
-
- 
-
- In terms of the algorithms used, this library aims to use the same "best
- of breed" algorithms as many other libraries: the principle difference
- is that this library is implemented in C++ - taking advantage of all the
- abstraction mechanisms that C++ offers - where as most traditional numeric
- libraries are implemented in C or FORTRAN. Traditionally languages such
- as C or FORTRAN are perceived as easier to optimise than more complex languages
- like C++, so in a sense this library provides a good test of current compiler
- technology, and the "abstraction penalty" - if any - of C++ compared
- to other languages.
- 
-
- 
+ By and large the performance of this library should be acceptable for most
+ needs. However, you should note that this library's primary emphasis is on
+ accuracy and numerical stability, and not speed.
+ 

- The two most important things you can do to ensure the best performance
- from this library are:
- 
+ In terms of the algorithms used, this library aims to use the same "best
+ of breed" algorithms as many other libraries: the principle difference
+ is that this library is implemented in C++ - taking advantage of all the
+ abstraction mechanisms that C++ offers - where as most traditional numeric
+ libraries are implemented in C or FORTRAN. Traditionally languages such as
+ C or FORTRAN are perceived as easier to optimise than more complex languages
+ like C++, so in a sense this library provides a good test of current compiler
+ technology, and the "abstraction penalty" - if any - of C++ compared
+ to other languages.
+ 

- 
+ The two most important things you can do to ensure the best performance from
+ this library are:
+ 
<div class="orderedlist"><ol type="1">
<li>
- Turn on your compilers optimisations: the difference between "release"
- and "debug" builds can easily be a <a class="link" href="getting_best.html" title="Getting the Best Performance from this Library">factor
- of 20</a>.
- </li>
+ Turn on your compilers optimisations: the difference between "release"
+ and "debug" builds can easily be a <a class="link" href="getting_best.html" title="Getting the Best Performance from this Library">factor
+ of 20</a>.
+ </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
- compilers for example.
- </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
+ compilers for example.
+ </li>
</ol></div>

- 
-
- The <a class="link" href="../perf.html" title="Performance">performance section</a> contains
- more information on the performance of this library, what you can do to
- fine tune it, and how this library compares to some other open source alternatives.
- 
-
+ The <a class="link" href="../perf.html" title="Performance">performance section</a> contains
+ more information on the performance of this library, what you can do to fine
+ tune it, and how this library compares to some other open source alternatives.

</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/perf/perf_test_app.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/perf/perf_test_app.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/perf/perf_test_app.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.perf.perf_test_app"></a><a class="link" href="perf_test_app.html" title="The Performance Test Application"> The Performance Test
+<a name="math_toolkit.perf.perf_test_app"></a><a class="link" href="perf_test_app.html" title="The Performance Test Application">The Performance Test
Application</a>
</h3></div></div></div>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/perf/tuning.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/perf/tuning.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/perf/tuning.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.perf.tuning"></a><a class="link" href="tuning.html" title="Performance Tuning Macros"> Performance Tuning Macros</a>
+<a name="math_toolkit.perf.tuning"></a><a class="link" href="tuning.html" title="Performance Tuning Macros">Performance Tuning Macros</a>
</h3></div></div></div>

 There are a small number of performance tuning options that are determined
@@ -632,7 +632,7 @@
 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>.

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,55 +24,53 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="math_toolkit.policy"></a><a class="link" href="policy.html" title="Policies"> Policies</a>
+<a name="math_toolkit.policy"></a><a class="link" href="policy.html" title="Policies">Policies</a>
</h2></div></div></div>
<div class="toc"><dl>
-<dt> Policy Overview</dt>
-<dt> Policy Tutorial</dt>
+<dt>Policy Overview</dt>
+<dt>Policy Tutorial</dt>
<dd><dl>
-<dt><a href="policy/pol_tutorial/what_is_a_policy.html">
- So Just What is a Policy Anyway?</a></dt>
-<dt><a href="policy/pol_tutorial/policy_tut_defaults.html">
- Policies Have Sensible Defaults</a></dt>
-<dt><a href="policy/pol_tutorial/policy_usage.html"> So
- How are Policies Used Anyway?</a></dt>
-<dt><a href="policy/pol_tutorial/changing_policy_defaults.html">
- Changing the Policy Defaults</a></dt>
-<dt><a href="policy/pol_tutorial/ad_hoc_dist_policies.html">
- Setting Policies for Distributions on an Ad Hoc Basis</a></dt>
-<dt><a href="policy/pol_tutorial/ad_hoc_sf_policies.html">
- Changing the Policy on an Ad Hoc Basis for the Special Functions</a></dt>
-<dt><a href="policy/pol_tutorial/namespace_policies.html">
- Setting Policies at Namespace or Translation Unit Scope</a></dt>
-<dt><a href="policy/pol_tutorial/user_def_err_pol.html">
- Calling User Defined Error Handlers</a></dt>
-<dt><a href="policy/pol_tutorial/understand_dis_quant.html">
- Understanding Quantiles of Discrete Distributions</a></dt>
+<dt><a href="policy/pol_tutorial/what_is_a_policy.html">So
+ Just What is a Policy Anyway?</a></dt>
+<dt><a href="policy/pol_tutorial/policy_tut_defaults.html">Policies
+ Have Sensible Defaults</a></dt>
+<dt><a href="policy/pol_tutorial/policy_usage.html">So How
+ are Policies Used Anyway?</a></dt>
+<dt><a href="policy/pol_tutorial/changing_policy_defaults.html">Changing
+ the Policy Defaults</a></dt>
+<dt><a href="policy/pol_tutorial/ad_hoc_dist_policies.html">Setting
+ Policies for Distributions on an Ad Hoc Basis</a></dt>
+<dt><a href="policy/pol_tutorial/ad_hoc_sf_policies.html">Changing
+ the Policy on an Ad Hoc Basis for the Special Functions</a></dt>
+<dt><a href="policy/pol_tutorial/namespace_policies.html">Setting
+ Policies at Namespace or Translation Unit Scope</a></dt>
+<dt><a href="policy/pol_tutorial/user_def_err_pol.html">Calling
+ User Defined Error Handlers</a></dt>
+<dt><a href="policy/pol_tutorial/understand_dis_quant.html">Understanding
+ Quantiles of Discrete Distributions</a></dt>
</dl></dd>
-<dt> Policy Reference</dt>
+<dt>Policy Reference</dt>
<dd><dl>
-<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>
-<dt><a href="policy/pol_ref/assert_undefined.html"> Mathematically
+<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
+ 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
+<dt><a href="policy/pol_ref/discrete_quant_ref.html">Discrete
 Quantile Policies</a></dt>
-<dt><a href="policy/pol_ref/precision_pol.html"> Precision
+<dt><a href="policy/pol_ref/precision_pol.html">Precision
 Policies</a></dt>
-<dt><a href="policy/pol_ref/iteration_pol.html"> Iteration
+<dt><a href="policy/pol_ref/iteration_pol.html">Iteration
 Limits Policies</a></dt>
-<dt><a href="policy/pol_ref/policy_defaults.html"> Using
+<dt><a href="policy/pol_ref/policy_defaults.html">Using
 macros to Change the Policy Defaults</a></dt>
-<dt><a href="policy/pol_ref/namespace_pol.html"> Setting
+<dt><a href="policy/pol_ref/namespace_pol.html">Setting
 Polices at Namespace Scope</a></dt>
-<dt><a href="policy/pol_ref/pol_ref_ref.html"> Policy Class
+<dt><a href="policy/pol_ref/pol_ref_ref.html">Policy Class
 Reference</a></dt>
</dl></dd>
</dl></div>
-
- 
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_overview.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_overview.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_overview.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,99 +24,81 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.policy.pol_overview"></a><a class="link" href="pol_overview.html" title="Policy Overview"> Policy Overview</a>
+<a name="math_toolkit.policy.pol_overview"></a><a class="link" href="pol_overview.html" title="Policy Overview">Policy Overview</a>
</h3></div></div></div>

- 
-
- Policies are a powerful fine-grain mechanism that allow you to customise
- the behaviour of this library according to your needs. There is more information
- available in the <a class="link" href="pol_tutorial.html" title="Policy Tutorial">policy
- tutorial</a> and the <a class="link" href="pol_ref.html" title="Policy Reference">policy
- reference</a>.
- 
-
- 
-
- 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.
- 
-
- 
-
- Policies are a compile-time mechanism that allow you to change error-handling
- or calculation precision either program wide, or at the call site.
- 
-
- 
+ Policies are a powerful fine-grain mechanism that allow you to customise
+ the behaviour of this library according to your needs. There is more information
+ available in the <a class="link" href="pol_tutorial.html" title="Policy Tutorial">policy
+ tutorial</a> and the <a class="link" href="pol_ref.html" title="Policy Reference">policy
+ reference</a>.
+ 

- Although the policy mechanism itself is rather complicated, in practice
- it is easy to use, and very flexible.
- 
+ 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.
+ 

- 
+ Policies are a compile-time mechanism that allow you to change error-handling
+ or calculation precision either program wide, or at the call site.
+ 

- Using policies you can control:
- 
+ Although the policy mechanism itself is rather complicated, in practice it
+ is easy to use, and very flexible.
+ 

- 
+ Using policies you can control:
+ 
<div class="itemizedlist"><ul type="disc">
<li>
- <a class="link" href="pol_ref/error_handling_policies.html" title="Error Handling Policies">How
- results from 'bad' arguments are handled</a>, including those that
- cannot be fully evaluated.
- </li>
-<li>
- How <a class="link" href="pol_ref/internal_promotion.html" title="Internal Promotion Policies">accuracy
- is controlled by internal promotion</a> to use more precise types.
- </li>
-<li>
- What working <a class="link" href="pol_ref/precision_pol.html" title="Precision Policies">precision</a>
- should be used to calculate results.
- </li>
-<li>
- What to do when a <a class="link" href="pol_ref/assert_undefined.html" title="Mathematically Undefined Function Policies">mathematically
- undefined function</a> is used: Should this raise a run-time or
- compile-time error?
- </li>
-<li>
- Whether <a class="link" href="pol_ref/discrete_quant_ref.html" title="Discrete Quantile Policies">discrete
- functions</a>, like the binomial, should return real or only integral
- values, and how they are rounded.
- </li>
-<li>
- How many iterations a special function is permitted to perform in a
- series evaluation or root finding algorithm before it gives up and
- raises an <a class="link" href="../main_overview/error_handling.html#evaluation_error">evaluation_error</a>.
- </li>
+ <a class="link" href="pol_ref/error_handling_policies.html" title="Error Handling Policies">How
+ results from 'bad' arguments are handled</a>, including those that
+ cannot be fully evaluated.
+ </li>
+<li>
+ 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>
+ What working <a class="link" href="pol_ref/precision_pol.html" title="Precision Policies">precision</a>
+ should be used to calculate results.
+ </li>
+<li>
+ What to do when a <a class="link" href="pol_ref/assert_undefined.html" title="Mathematically Undefined Function Policies">mathematically
+ undefined function</a> is used: Should this raise a run-time or compile-time
+ error?
+ </li>
+<li>
+ Whether <a class="link" href="pol_ref/discrete_quant_ref.html" title="Discrete Quantile Policies">discrete
+ functions</a>, like the binomial, should return real or only integral
+ values, and how they are rounded.
+ </li>
+<li>
+ How many iterations a special function is permitted to perform in a series
+ evaluation or root finding algorithm before it gives up and raises an
+ <a class="link" href="../main_overview/error_handling.html#evaluation_error">evaluation_error</a>.
+ </li>
</ul></div>

- 
-
- You can control policies:
- 
-
- 
+ You can control policies:
+ 
<div class="itemizedlist"><ul type="disc">
<li>
- Using <a class="link" href="pol_ref/policy_defaults.html" title="Using macros to Change the Policy Defaults">macros</a>
- to change any default policy: the is the prefered method for installation
- wide policies.
- </li>
-<li>
- At your chosen <a class="link" href="pol_ref/namespace_pol.html" title="Setting Polices at Namespace Scope">namespace
- scope</a> for distributions and/or functions: this is the prefered
- method for project, namespace, or translation unit scope policies.
- </li>
-<li>
- In an ad-hoc manner <a class="link" href="pol_tutorial/ad_hoc_sf_policies.html" title="Changing the Policy on an Ad Hoc Basis for the Special Functions">by
- passing a specific policy to a special function</a>, or to a <a class="link" href="pol_tutorial/ad_hoc_dist_policies.html" title="Setting Policies for Distributions on an Ad Hoc Basis">statistical
- distribution</a>.
- </li>
+ Using <a class="link" href="pol_ref/policy_defaults.html" title="Using macros to Change the Policy Defaults">macros</a>
+ to change any default policy: the is the prefered method for installation
+ wide policies.
+ </li>
+<li>
+ At your chosen <a class="link" href="pol_ref/namespace_pol.html" title="Setting Polices at Namespace Scope">namespace
+ scope</a> for distributions and/or functions: this is the prefered
+ method for project, namespace, or translation unit scope policies.
+ </li>
+<li>
+ In an ad-hoc manner <a class="link" href="pol_tutorial/ad_hoc_sf_policies.html" title="Changing the Policy on an Ad Hoc Basis for the Special Functions">by
+ passing a specific policy to a special function</a>, or to a <a class="link" href="pol_tutorial/ad_hoc_dist_policies.html" title="Setting Policies for Distributions on an Ad Hoc Basis">statistical
+ distribution</a>.
+ </li>
</ul></div>
-
- 
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,26 +24,26 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.policy.pol_ref"></a><a class="link" href="pol_ref.html" title="Policy Reference"> Policy Reference</a>
+<a name="math_toolkit.policy.pol_ref"></a><a class="link" href="pol_ref.html" title="Policy Reference">Policy Reference</a>
</h3></div></div></div>
<div class="toc"><dl>
-<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>
-<dt><a href="pol_ref/assert_undefined.html"> Mathematically
+<dt><a href="pol_ref/error_handling_policies.html">Error
+ Handling Policies</a></dt>
+<dt><a href="pol_ref/internal_promotion.html">Internal
+ 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
+<dt><a href="pol_ref/discrete_quant_ref.html">Discrete
 Quantile Policies</a></dt>
-<dt><a href="pol_ref/precision_pol.html"> Precision
+<dt><a href="pol_ref/precision_pol.html">Precision
 Policies</a></dt>
-<dt><a href="pol_ref/iteration_pol.html"> Iteration
+<dt><a href="pol_ref/iteration_pol.html">Iteration
 Limits Policies</a></dt>
-<dt><a href="pol_ref/policy_defaults.html"> Using
+<dt><a href="pol_ref/policy_defaults.html">Using
 macros to Change the Policy Defaults</a></dt>
-<dt><a href="pol_ref/namespace_pol.html"> Setting
+<dt><a href="pol_ref/namespace_pol.html">Setting
 Polices at Namespace Scope</a></dt>
-<dt><a href="pol_ref/pol_ref_ref.html"> Policy Class
+<dt><a href="pol_ref/pol_ref_ref.html">Policy Class
 Reference</a></dt>
</dl></div>
</div>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/assert_undefined.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/assert_undefined.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/assert_undefined.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 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">
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.policy.pol_ref.assert_undefined"></a><a class="link" href="assert_undefined.html" title="Mathematically Undefined Function Policies"> Mathematically
+<a name="math_toolkit.policy.pol_ref.assert_undefined"></a><a class="link" href="assert_undefined.html" title="Mathematically Undefined Function Policies">Mathematically
 Undefined Function Policies</a>
</h4></div></div></div>

@@ -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>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/discrete_quant_ref.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/discrete_quant_ref.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/discrete_quant_ref.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.policy.pol_ref.discrete_quant_ref"></a><a class="link" href="discrete_quant_ref.html" title="Discrete Quantile Policies"> Discrete
+<a name="math_toolkit.policy.pol_ref.discrete_quant_ref"></a><a class="link" href="discrete_quant_ref.html" title="Discrete Quantile Policies">Discrete
 Quantile Policies</a>
</h4></div></div></div>

@@ -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="id1373737"></a>
+<a name="id1246207"></a>
 <a class="link" href="discrete_quant_ref.html#math_toolkit.policy.pol_ref.discrete_quant_ref.real">real</a>
 </h6>

@@ -63,9 +63,7 @@
 result. For example:
 

- 
-
-
+

<pre class="programlisting">#include <boost/math/distributions/negative_binomial.hpp>
using boost::math::negative_binomial_distribution;
@@ -84,8 +82,6 @@

</pre>

- 
-
 

 Results in <code class="computeroutput">x =
@@ -93,7 +89,7 @@
 = 68.1584</code>.
 
<a name="math_toolkit.policy.pol_ref.discrete_quant_ref.integer_round_outwards"></a><h6>
-<a name="id1374092"></a>
+<a name="id1246559"></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>

@@ -115,9 +111,7 @@
 the requested coverage. For example:
 

- 
-
-
+

<pre class="programlisting">#include <boost/math/distributions/negative_binomial.hpp>
using boost::math::negative_binomial;
@@ -130,8 +124,6 @@

</pre>

- 
-
 

 Results in <code class="computeroutput">x =
@@ -151,7 +143,7 @@
 in each tail.
 
<a name="math_toolkit.policy.pol_ref.discrete_quant_ref.integer_round_inwards"></a><h6>
-<a name="id1374493"></a>
+<a name="id1248057"></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>

@@ -172,9 +164,7 @@
 For example:
 

- 
-
-
+

<pre class="programlisting">#include <boost/math/distributions/negative_binomial.hpp>
using boost::math::negative_binomial_distribution;
@@ -193,8 +183,6 @@

</pre>

- 
-
 

 Results in <code class="computeroutput">x =
@@ -214,7 +202,7 @@
 in each tail.
 
<a name="math_toolkit.policy.pol_ref.discrete_quant_ref.integer_round_down"></a><h6>
-<a name="id1376092"></a>
+<a name="id1248550"></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 +210,7 @@
 or a lower quantile.
 
<a name="math_toolkit.policy.pol_ref.discrete_quant_ref.integer_round_up"></a><h6>
-<a name="id1376111"></a>
+<a name="id1248570"></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 +218,7 @@
 a lower quantile.
 
<a name="math_toolkit.policy.pol_ref.discrete_quant_ref.integer_round_nearest"></a><h6>
-<a name="id1376130"></a>
+<a name="id1248589"></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>

@@ -244,9 +232,7 @@
 For example:
 

- 
-
-
+

<pre class="programlisting">#include <boost/math/distributions/negative_binomial.hpp>
using boost::math::negative_binomial_distribution;
@@ -265,8 +251,6 @@

</pre>

- 
-
 

 Results in <code class="computeroutput">x =

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/error_handling_policies.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/error_handling_policies.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/error_handling_policies.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 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>
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.policy.pol_ref.error_handling_policies"></a><a class="link" href="error_handling_policies.html" title="Error Handling Policies">
- Error Handling Policies</a>
+<a name="math_toolkit.policy.pol_ref.error_handling_policies"></a><a class="link" href="error_handling_policies.html" title="Error Handling Policies">Error
+ Handling Policies</a>
</h4></div></div></div>

 There are two orthogonal aspects to error handling:
@@ -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="id1368957"></a>
+<a name="id1241159"></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="id1369138"></a>
+<a name="id1241341"></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="id1369324"></a>
+<a name="id1241527"></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="id1369514"></a>
+<a name="id1241729"></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="id1369707"></a>
+<a name="id1241923"></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="id1370616"></a>
+<a name="id1243100"></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="id1371457"></a>
+<a name="id1243942"></a>
 <a class="link" href="error_handling_policies.html#math_toolkit.policy.pol_ref.error_handling_policies.examples">Examples</a>
 </h5>

@@ -698,9 +700,7 @@
 we can achieve this at the call site using:
 

- 
-
-
+

<pre class="programlisting">#include <boost/math/special_functions/gamma.hpp>
using boost::math::tgamma;
@@ -738,17 +738,13 @@
 );
</pre>

- 
-
 

 Suppose we want a statistical distribution to return infinities, rather
 than throw exceptions, then we can use:
 

- 
-
-
+

<pre class="programlisting">#include <boost/math/distributions/normal.hpp>
using boost::math::normal_distribution;
@@ -769,8 +765,6 @@

</pre>

- 
-
 
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/internal_promotion.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/internal_promotion.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/internal_promotion.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 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="id1372662"></a>
+<a name="id1245139"></a>
 <a class="link" href="internal_promotion.html#math_toolkit.policy.pol_ref.internal_promotion.examples">Examples</a>
 </h5>

@@ -93,9 +94,7 @@
 double</code>, then we could use:
 

- 
-
-
+

<pre class="programlisting">#include <boost/math/special_functions/gamma.hpp>

@@ -116,17 +115,13 @@

</pre>

- 
-
 

 Alternatively, suppose we want a distribution to perform calculations without
 promoting <code class="computeroutput">float</code> to <code class="computeroutput">double</code>, then we could use:
 

- 
-
-
+

<pre class="programlisting">#include <boost/math/distributions/normal.hpp>
using boost::math::normal_distribution;
@@ -146,8 +141,6 @@

</pre>

- 
-
 
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/iteration_pol.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/iteration_pol.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/iteration_pol.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.policy.pol_ref.iteration_pol"></a><a class="link" href="iteration_pol.html" title="Iteration Limits Policies"> Iteration
+<a name="math_toolkit.policy.pol_ref.iteration_pol"></a><a class="link" href="iteration_pol.html" title="Iteration Limits Policies">Iteration
Limits Policies</a>
</h4></div></div></div>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/namespace_pol.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/namespace_pol.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/namespace_pol.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.policy.pol_ref.namespace_pol"></a><a class="link" href="namespace_pol.html" title="Setting Polices at Namespace Scope"> Setting
+<a name="math_toolkit.policy.pol_ref.namespace_pol"></a><a class="link" href="namespace_pol.html" title="Setting Polices at Namespace Scope">Setting
 Polices at Namespace Scope</a>
</h4></div></div></div>

@@ -45,9 +45,7 @@
 or distribution header. For example:
 

- 
-
-
+

<pre class="programlisting">#include <boost/math/special_functions/gamma.hpp>
//using boost::math::tgamma;
@@ -74,8 +72,6 @@

</pre>

- 
-
 

 In this example, using BOOST_MATH_DECLARE_SPECIAL_FUNCTIONS results in
@@ -99,9 +95,7 @@
 to specify the floating-point type to use:
 

- 
-
-
+

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

@@ -126,8 +120,8 @@
// myspace::mypolicy:
//
// This compiles but throws a domain error exception at runtime.
-// (Caution, if you omit the try'n'catch blocks, it will just terminate,
-// giving no clues as to why!
+// 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()
@@ -144,8 +138,6 @@

</pre>

- 
-
 

 In this example the result of BOOST_MATH_DECLARE_DISTRIBUTIONS is to declare

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/pol_ref_ref.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/pol_ref_ref.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/pol_ref_ref.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.policy.pol_ref.pol_ref_ref"></a><a class="link" href="pol_ref_ref.html" title="Policy Class Reference"> Policy Class
+<a name="math_toolkit.policy.pol_ref.pol_ref_ref"></a><a class="link" href="pol_ref_ref.html" title="Policy Class Reference">Policy Class
Reference</a>
</h4></div></div></div>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/policy_defaults.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/policy_defaults.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/policy_defaults.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.policy.pol_ref.policy_defaults"></a><a class="link" href="policy_defaults.html" title="Using macros to Change the Policy Defaults"> Using
+<a name="math_toolkit.policy.pol_ref.policy_defaults"></a><a class="link" href="policy_defaults.html" title="Using macros to Change the Policy Defaults">Using
 macros to Change the Policy Defaults</a>
</h4></div></div></div>

@@ -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="id1377491"></a>
+<a name="id1249939"></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="id1377544"></a>
+<a name="id1249992"></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="id1377596"></a>
+<a name="id1250044"></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="id1377649"></a>
+<a name="id1250097"></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="id1377702"></a>
+<a name="id1250150"></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="id1377755"></a>
+<a name="id1251500"></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="id1377808"></a>
+<a name="id1251553"></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="id1377860"></a>
+<a name="id1251606"></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="id1377913"></a>
+<a name="id1251659"></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="id1377937"></a>
+<a name="id1251683"></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="id1377990"></a>
+<a name="id1251736"></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="id1378048"></a>
+<a name="id1251793"></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="id1378678"></a>
+<a name="id1251860"></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="id1378710"></a>
+<a name="id1251892"></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="id1378731"></a>
+<a name="id1251913"></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="id1378753"></a>
+<a name="id1251935"></a>
 <a class="link" href="policy_defaults.html#math_toolkit.policy.pol_ref.policy_defaults.example">Example</a>
 </h6>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/precision_pol.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/precision_pol.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_ref/precision_pol.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,14 +24,15 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.policy.pol_ref.precision_pol"></a><a class="link" href="precision_pol.html" title="Precision Policies"> Precision
+<a name="math_toolkit.policy.pol_ref.precision_pol"></a><a class="link" href="precision_pol.html" title="Precision Policies">Precision
 Policies</a>
</h4></div></div></div>

 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{

@@ -59,9 +60,7 @@
 to approximately 5 decimal digits using:
 

- 
-
-
+

<pre class="programlisting">#include <boost/math/special_functions/gamma.hpp>
using boost::math::tgamma;
@@ -72,16 +71,12 @@
// 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>:
 

- 
-
-
+

<pre class="programlisting">#include <boost/math/special_functions/gamma.hpp>
using boost::math::tgamma;
@@ -92,16 +87,12 @@

</pre>

- 
-
 

 And for a quantile of a distribution to approximately 25-bit precision:
 

- 
-
-
+

<pre class="programlisting">#include <boost/math/distributions/normal.hpp>
using boost::math::normal_distribution;
@@ -116,8 +107,6 @@

</pre>

- 
-
 
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,27 +24,27 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.policy.pol_tutorial"></a><a class="link" href="pol_tutorial.html" title="Policy Tutorial"> Policy Tutorial</a>
+<a name="math_toolkit.policy.pol_tutorial"></a><a class="link" href="pol_tutorial.html" title="Policy Tutorial">Policy Tutorial</a>
</h3></div></div></div>
<div class="toc"><dl>
-<dt><a href="pol_tutorial/what_is_a_policy.html">
- So Just What is a Policy Anyway?</a></dt>
-<dt><a href="pol_tutorial/policy_tut_defaults.html">
- Policies Have Sensible Defaults</a></dt>
-<dt><a href="pol_tutorial/policy_usage.html"> So
- How are Policies Used Anyway?</a></dt>
-<dt><a href="pol_tutorial/changing_policy_defaults.html">
- Changing the Policy Defaults</a></dt>
-<dt><a href="pol_tutorial/ad_hoc_dist_policies.html">
- Setting Policies for Distributions on an Ad Hoc Basis</a></dt>
-<dt><a href="pol_tutorial/ad_hoc_sf_policies.html">
- Changing the Policy on an Ad Hoc Basis for the Special Functions</a></dt>
-<dt><a href="pol_tutorial/namespace_policies.html">
- Setting Policies at Namespace or Translation Unit Scope</a></dt>
-<dt><a href="pol_tutorial/user_def_err_pol.html">
- Calling User Defined Error Handlers</a></dt>
-<dt><a href="pol_tutorial/understand_dis_quant.html">
- Understanding Quantiles of Discrete Distributions</a></dt>
+<dt><a href="pol_tutorial/what_is_a_policy.html">So
+ Just What is a Policy Anyway?</a></dt>
+<dt><a href="pol_tutorial/policy_tut_defaults.html">Policies
+ Have Sensible Defaults</a></dt>
+<dt><a href="pol_tutorial/policy_usage.html">So How
+ are Policies Used Anyway?</a></dt>
+<dt><a href="pol_tutorial/changing_policy_defaults.html">Changing
+ the Policy Defaults</a></dt>
+<dt><a href="pol_tutorial/ad_hoc_dist_policies.html">Setting
+ Policies for Distributions on an Ad Hoc Basis</a></dt>
+<dt><a href="pol_tutorial/ad_hoc_sf_policies.html">Changing
+ the Policy on an Ad Hoc Basis for the Special Functions</a></dt>
+<dt><a href="pol_tutorial/namespace_policies.html">Setting
+ Policies at Namespace or Translation Unit Scope</a></dt>
+<dt><a href="pol_tutorial/user_def_err_pol.html">Calling
+ User Defined Error Handlers</a></dt>
+<dt><a href="pol_tutorial/understand_dis_quant.html">Understanding
+ Quantiles of Discrete Distributions</a></dt>
</dl></div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/ad_hoc_dist_policies.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/ad_hoc_dist_policies.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/ad_hoc_dist_policies.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,12 +24,14 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.policy.pol_tutorial.ad_hoc_dist_policies"></a><a class="link" href="ad_hoc_dist_policies.html" title="Setting Policies for Distributions on an Ad Hoc Basis">
- Setting Policies for Distributions on an Ad Hoc Basis</a>
+<a name="math_toolkit.policy.pol_tutorial.ad_hoc_dist_policies"></a><a class="link" href="ad_hoc_dist_policies.html" title="Setting Policies for Distributions on an Ad Hoc Basis">Setting
+ Policies for Distributions on an Ad Hoc Basis</a>
</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{

@@ -53,9 +55,7 @@
 then here's how it can be done:
 

- 
-
-
+

<pre class="programlisting">#include <boost/math/distributions/binomial.hpp>
using boost::math::binomial_distribution;
@@ -87,8 +87,6 @@

</pre>

- 
-
 

 Which outputs:

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/ad_hoc_sf_policies.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/ad_hoc_sf_policies.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/ad_hoc_sf_policies.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.policy.pol_tutorial.ad_hoc_sf_policies"></a><a class="link" href="ad_hoc_sf_policies.html" title="Changing the Policy on an Ad Hoc Basis for the Special Functions">
- Changing the Policy on an Ad Hoc Basis for the Special Functions</a>
+<a name="math_toolkit.policy.pol_tutorial.ad_hoc_sf_policies"></a><a class="link" href="ad_hoc_sf_policies.html" title="Changing the Policy on an Ad Hoc Basis for the Special Functions">Changing
+ the Policy on an Ad Hoc Basis for the Special Functions</a>
</h4></div></div></div>

 All of the special functions in this library come in two overloaded forms,
@@ -59,9 +59,7 @@
 throw an exception:
 

- 
-
-
+

<pre class="programlisting">#include <boost/math/special_functions/gamma.hpp>
using boost::math::tgamma;
@@ -94,8 +92,6 @@

</pre>

- 
-
 

 which outputs:
@@ -111,9 +107,7 @@
 so is probably only preferred when a policy is going to be used once only:
 

- 
-
-
+

<pre class="programlisting">#include <boost/math/special_functions/gamma.hpp>
using boost::math::tgamma;
@@ -158,8 +152,6 @@

</pre>

- 
-
 
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/changing_policy_defaults.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/changing_policy_defaults.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/changing_policy_defaults.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.policy.pol_tutorial.changing_policy_defaults"></a><a class="link" href="changing_policy_defaults.html" title="Changing the Policy Defaults">
- Changing the Policy Defaults</a>
+<a name="math_toolkit.policy.pol_tutorial.changing_policy_defaults"></a><a class="link" href="changing_policy_defaults.html" title="Changing the Policy Defaults">Changing
+ the Policy Defaults</a>
</h4></div></div></div>

 The default policies used by the library are changed by the usual configuration
@@ -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:
@@ -129,68 +129,42 @@
 unit only: don't say that you weren't warned!
 

- 
-
- The following example demonstrates the effect of setting the macro BOOST_MATH_DOMAIN_ERROR_POLICY
- when an invalid argument is encountered. For the purposes of this example,
- we'll pass a negative degrees of freedom parameter to the student's t
- distribution.
- 
-
- 
-
- Since we know that this is a single file program we could just add:
- 
+ The following example demonstrates the effect of setting the macro BOOST_MATH_DOMAIN_ERROR_POLICY
+ when an invalid argument is encountered. For the purposes of this example,
+ we'll pass a negative degrees of freedom parameter to the student's t distribution.
+ 

-
-
+ Since we know that this is a single file program we could just add:
+ 
<pre class="programlisting">#define BOOST_MATH_DOMAIN_ERROR_POLICY ignore_error
</pre>

- 
-
- to the top of the source file to change the default policy to one that
- simply returns a NaN when a domain error occurs. Alternatively we could
- use:
- 
-
-
-
+ to the top of the source file to change the default policy to one that
+ simply returns a NaN when a domain error occurs. Alternatively we could
+ use:
+ 
<pre class="programlisting">#define BOOST_MATH_DOMAIN_ERROR_POLICY errno_on_error
</pre>

- 
-
- To ensure the <code class="computeroutput">::errno</code>
- is set when a domain error occurs as well as returning a NaN.
- 
-
- 
-
- This is safe provided the program consists of a single translation unit
- and we place the define before
- any #includes. Note that should we add the define after the includes
- then it will have no effect! A warning such as:
- 
+ To ensure the <code class="computeroutput">::errno</code>
+ is set when a domain error occurs as well as returning a NaN.
+ 

-
-
+ This is safe provided the program consists of a single translation unit
+ and we place the define before
+ any #includes. Note that should we add the define after the includes then
+ it will have no effect! A warning such as:
+ 
<pre class="programlisting">warning C4005: 'BOOST_MATH_OVERFLOW_ERROR_POLICY' : macro redefinition</pre>

- 
-
- is a certain sign that it will not have the desired
- effect.
- 
-
- 
-
- We'll begin our sample program with the needed includes:
- 
+ is a certain sign that it will not have the desired
+ effect.
+ 

- 
+ We'll begin our sample program with the needed includes:
+ 

-
+

<pre class="programlisting">// Boost
#include <boost/math/distributions/students_t.hpp>
@@ -204,18 +178,14 @@
#include <stdexcept>
 using std::exception;</pre>

- 
-
- 
-
- 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:
- 
+ 

- 
+ 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:
+ 

-
+

<pre class="programlisting">int main()
{
@@ -228,14 +198,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,20 +218,14 @@
 std::cout <<
 "\n""Message from thrown exception was:\n " << e.what() << std::endl;
 }
-
 return 0;
} // int main()</pre>

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

-
-
+ Here's what the program output looks like with a default build (one that
+ does throw exceptions):
+ 
<pre class="programlisting">Example error handling using Student's t function.
BOOST_MATH_DOMAIN_ERROR_POLICY is set to: throw_on_error

@@ -267,53 +234,30 @@
 Degrees of freedom argument is -1, but must be > 0 !
</pre>

- 
-
- Alternatively let's build with:
- 
-
-
-
+ Alternatively let's build with:
+ 
<pre class="programlisting">#define BOOST_MATH_DOMAIN_ERROR_POLICY ignore_error
</pre>

- 
-
- Now the program output is:
- 
-
-
-
+ Now the program output is:
+ 
<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>

- 
-
- And finally let's build with:
- 
-
-
-
+ And finally let's build with:
+ 
<pre class="programlisting">#define BOOST_MATH_DOMAIN_ERROR_POLICY errno_on_error
</pre>

- 
-
- Which gives the output:
- 
-
-
-
+ Which gives the output show errno:
+ 
<pre class="programlisting">Example error handling using Student's t function.
BOOST_MATH_DOMAIN_ERROR_POLICY is set to: errno_on_error
cdf returned a NaN!
errno is set to: 33
</pre>
-
- 
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/namespace_policies.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/namespace_policies.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/namespace_policies.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,64 +24,53 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.policy.pol_tutorial.namespace_policies"></a><a class="link" href="namespace_policies.html" title="Setting Policies at Namespace or Translation Unit Scope">
- Setting Policies at Namespace or Translation Unit Scope</a>
+<a name="math_toolkit.policy.pol_tutorial.namespace_policies"></a><a class="link" href="namespace_policies.html" title="Setting Policies at Namespace or Translation Unit Scope">Setting
+ Policies at Namespace or Translation Unit Scope</a>
</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.
 

- 
-
- Suppose we want <code class="computeroutput">C::foo()</code>
- to behave in a C-compatible way and set <code class="computeroutput">::errno</code> on error rather than throwing
- any exceptions.
- 
-
- 
-
- We'll begin by including the needed header:
- 
+ Suppose we want <code class="computeroutput">C::foo()</code>
+ to behave in a C-compatible way and set <code class="computeroutput">::errno</code> on error rather than throwing any
+ exceptions.
+ 

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

-
+

<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
- and returns a standard value, rather than throwing exceptions.
- 
-
- 
+ 

- Any policies we don't specify here will inherit the defaults.
- 
+ Open up the "C" namespace that we'll use for our functions, 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
-{
- //using namespace boost::math::policies; or explicitly:
+{ // To hold our C-style policy.
+ //using namespace boost::math::policies; or explicitly:
 using boost::math::policies::policy;

 using boost::math::policies::domain_error;
@@ -97,33 +86,25 @@
 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 c_policy as the single argument:
- 
+ 

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

-
+

<pre class="programlisting">BOOST_MATH_DECLARE_SPECIAL_FUNCTIONS(c_policy)

} // close namespace C</pre>

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

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

-
+

<pre class="programlisting">template <class RealType>
inline typename boost::math::tools::promote_args<RT>::type
@@ -133,16 +114,14 @@
}
</pre>

- 
-
- 
-
- 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>:
+ 

-
+

<pre class="programlisting">int main()
{
@@ -155,28 +134,19 @@
 cout << "errno = " << errno << endl; // errno = 33, overwriting previous value of 34.
}</pre>

- 
-
- 
-
- Which outputs:
- 
+ 

-
-
+ Which outputs:
+ 
<pre class="programlisting">Result of C::tgamma(30000) is: 1.#INF
errno = 34
Result of C::tgamma(-10) is: 1.#QNAN
errno = 33
</pre>

- 
-
- 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).
- 
-
+ 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).
 

 The same mechanism works well at file scope as well, by using an unnamed
@@ -184,17 +154,15 @@
 alternate policies present in other translation units:
 

- 
-
-
+

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

namespace
-{ // not named
+{ // unnamed

using namespace boost::math::policies;

@@ -202,37 +170,30 @@
 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)</pre>

- 
-
-
-
-<pre class="programlisting">So that when we call `tgamma(z)`, we really end up calling
-</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>:
- 
+ 

- 
+ 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;
- cout << "Result of tgamma(30000) is: "
+ 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: "
+ cout << "Result of tgamma(-10) is: "
 << tgamma(-10) << endl;
 cout << "errno = " << errno << endl;
 // Default tgamma policy would throw an exception, and abort.
@@ -240,8 +201,6 @@

</pre>

- 
-
 

 Handling policies for the statistical distributions is very similar except
@@ -260,48 +219,35 @@
 template, but without the "_distribution" suffix.
 

- 
-
- Suppose we want a set of distributions to behave as follows:
- 
-
- 
+ Suppose we want a set of distributions to behave as follows:
+ 
<div class="itemizedlist"><ul type="disc">
<li>
- Return infinity on overflow, rather than throwing an exception.
- </li>
+ Return infinity on overflow, rather than throwing an exception.
+ </li>
<li>
- Don't perform any promotion from double to long double internally.
- </li>
+ Don't perform any promotion from double to long double internally.
+ </li>
<li>
- Return the closest integer result from the quantiles of discrete
- distributions.
- </li>
+ Return the closest integer result from the quantiles of discrete distributions.
+ </li>
</ul></div>

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

-
+

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

- 
-
- 
-
- 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
{
@@ -317,35 +263,27 @@
 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 type <code class="computeroutput">double</code>
- and policy types <code class="computeroutput">my_policy</code>
- as arguments:
- 
+ 

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

-
+

<pre class="programlisting">BOOST_MATH_DECLARE_DISTRIBUTIONS(double, my_policy)

} // close namespace my_namespace</pre>

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

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

-
+

<pre class="programlisting">typedef boost::math::normal_distribution<double, my_policy> normal;
typedef boost::math::cauchy_distribution<double, my_policy> cauchy;
@@ -353,50 +291,40 @@
// etc
</pre>

- 
-
- 
-
- So that when we use my_distributions::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>:
+ 

-
+

<pre class="programlisting">int main()
{
 // Construct distribution with something we know will overflow
 // (using double rather than if promoted to long double):
- my_distributions::normal norm(10, 2);
+ my_distributions::normal norm(10, 2);

 errno = 0;
- cout << "Result of quantile(norm, 0) is: "
+ cout << "Result of quantile(norm, 0) is: "
 << quantile(norm, 0) << endl; // -infinity.
 cout << "errno = " << errno << endl;
 errno = 0;
- cout << "Result of quantile(norm, 1) is: "
+ 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);
- cout << "Result of quantile(binom, 0.05) is: "
+ 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: "
+ cout << "Result of quantile(complement(binom, 0.05)) is: "
 << quantile(complement(binom, 0.05)) << endl;
}</pre>

- 
-
- 
-
- Which outputs:
- 
+ 

-
-
+ Which outputs:
+ 
<pre class="programlisting">Result of quantile(norm, 0) is: -1.#INF
errno = 34
Result of quantile(norm, 1) is: 1.#INF
@@ -405,13 +333,9 @@
Result of quantile(complement(binom, 0.05)) is: 8
</pre>

- 
-
- 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 project wide
- build macros (possibly fragile and easy to forget).
- 
-
+ 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 project wide build
+ macros (possibly fragile and easy to forget).
 
<div class="note"><table border="0" summary="Note">
<tr>
@@ -419,9 +343,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 BOOST_MATH_DECLARE_DISTRIBUTIONS and BOOST_MATH_DECLARE_SPECIAL_FUNCTIONS
- in the same namespace, as doing so creates ambiguities
+ 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 and distributions of the same name.
 </td></tr>
</table></div>
@@ -431,9 +355,7 @@
 with any alternate policies present in other translation units:
 

- 
-
-
+

<pre class="programlisting">#include <boost/math/distributions.hpp> // All distributions.
// using boost::math::normal; // Would create an ambguity between
@@ -481,8 +403,6 @@

</pre>

- 
-
 
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/policy_tut_defaults.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/policy_tut_defaults.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/policy_tut_defaults.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,13 +24,15 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.policy.pol_tutorial.policy_tut_defaults"></a><a class="link" href="policy_tut_defaults.html" title="Policies Have Sensible Defaults">
- Policies Have Sensible Defaults</a>
+<a name="math_toolkit.policy.pol_tutorial.policy_tut_defaults"></a><a class="link" href="policy_tut_defaults.html" title="Policies Have Sensible Defaults">Policies
+ Have Sensible Defaults</a>
</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">

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/policy_usage.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/policy_usage.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/policy_usage.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.policy.pol_tutorial.policy_usage"></a><a class="link" href="policy_usage.html" title="So How are Policies Used Anyway?"> So
- How are Policies Used Anyway?</a>
+<a name="math_toolkit.policy.pol_tutorial.policy_usage"></a><a class="link" href="policy_usage.html" title="So How are Policies Used Anyway?">So How
+ are Policies Used Anyway?</a>
</h4></div></div></div>

The details follow later, but basically policies can be set by either:

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/understand_dis_quant.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/understand_dis_quant.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/understand_dis_quant.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.policy.pol_tutorial.understand_dis_quant"></a><a class="link" href="understand_dis_quant.html" title="Understanding Quantiles of Discrete Distributions">
- Understanding Quantiles of Discrete Distributions</a>
+<a name="math_toolkit.policy.pol_tutorial.understand_dis_quant"></a><a class="link" href="understand_dis_quant.html" title="Understanding Quantiles of Discrete Distributions">Understanding
+ Quantiles of Discrete Distributions</a>
</h4></div></div></div>

 Discrete distributions present us with a problem when calculating the quantile:
@@ -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="id1364090"></a>
+<a name="id1236544"></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>
@@ -239,23 +239,16 @@
</dl>
</div>

- 
-
- To understand how the rounding policies for the discrete distributions
- can be used, we'll use the 50-sample binomial distribution with a 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 (and some using statements for
- conciseness):
- 
+ To understand how the rounding policies for the discrete distributions
+ can be used, we'll use the 50-sample binomial distribution with a 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 (and some using statements for conciseness):
+ 

-
+

<pre class="programlisting">#include <iostream>
using std::cout; using std::endl;
@@ -266,17 +259,13 @@

#include <boost/math/distributions/binomial.hpp></pre>

- 
-
- 
-
- Next we'll bring the needed declarations into scope, and define distribution
- types for all the available rounding policies:
- 
+ 

- 
+ Next we'll bring the needed declarations into scope, and define distribution
+ types for all the available rounding policies:
+ 

-
+

<pre class="programlisting">// Avoid
// using namespace std; // and
@@ -328,16 +317,12 @@
 policy<discrete_quantile<real> > >
 binom_real_quantile;</pre>

- 
-
- 
-
- Now let's set to work calling those quantiles:
- 
+ 

- 
+ Now let's set to work calling those quantiles:
+ 

-
+

<pre class="programlisting">int main()
{
@@ -407,15 +392,10 @@
 << endl;
} // int main()</pre>

- 
-
- 
-
- Which produces the program output:
- 
+ 

-
-
+ Which produces the program output:
+ 
<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.
@@ -432,8 +412,6 @@
 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>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/user_def_err_pol.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/user_def_err_pol.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/user_def_err_pol.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,22 +24,17 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.policy.pol_tutorial.user_def_err_pol"></a><a class="link" href="user_def_err_pol.html" title="Calling User Defined Error Handlers">
- Calling User Defined Error Handlers</a>
+<a name="math_toolkit.policy.pol_tutorial.user_def_err_pol"></a><a class="link" href="user_def_err_pol.html" title="Calling User Defined Error Handlers">Calling
+ User Defined Error Handlers</a>
</h4></div></div></div>

- 
-
- 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 <code class="computeroutput">user_error</code>
- 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:
- 
-
-
-
+ 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 <code class="computeroutput">user_error</code>
+ 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:
+ 
<pre class="programlisting">namespace boost{ namespace math{ namespace policies{

template <class T>
@@ -60,17 +55,13 @@
}}} // namespaces
</pre>

- 
-
- So out first job is to include the header we want to use, and then 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
- use the default.
- 
-
- 
+ So out first job is to include the header we want to use, and then 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.
+ 

-
+

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

@@ -94,17 +85,13 @@
 } // namespace policies
}} // namespace boost{ namespace math</pre>

- 
-
- 
-
- 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:
- 
+ 

- 
+ 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:
+ 

-
+

<pre class="programlisting">namespace{

@@ -119,17 +106,13 @@

} // close unnamed namespace</pre>

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

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

-
+

<pre class="programlisting">template <class RealType>
inline typename boost::math::tools::promote_args<RT>::type
@@ -139,17 +122,15 @@
}
</pre>

- 
-
- 
-
- 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.
- 
+ 

- 
+ 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.
+ 

-
+

<pre class="programlisting">int main()
{
@@ -159,100 +140,74 @@
 << tgamma(-10) << endl;
}</pre>

- 
-
- 
-
- Which outputs:
- 
+ 

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

+ 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 used
+ to generate nice formatted error messages.
 

- 
-
- 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 used to generate nice formatted error messages.
- 
-
- 
-
- Each error handler has the general form:
- 
-
-
-
+ Each error handler has the general form:
+ 
<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>

- 
-
- and accepts three arguments:
- 
-
- 
+ and accepts three arguments:
+ 
<div class="variablelist">

<dl>
<dt>const char* function</dt>
<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.
- </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 real type T, like float or double.
+ </dd>
<dt>const char* message</dt>
<dd>
- A message associated with the error, normally this contains a %1%
- format specifier that should be replaced with the value of value:
- however note that overflow and underflow messages do not contain
- this %1% specifier (since the value of value
- is immaterial in these cases).
- </dd>
+ A message associated with the error, normally this contains a %1%
+ format specifier that should be replaced with the value of value:
+ however note that overflow and underflow messages do not contain
+ this %1% specifier (since the value of value
+ is immaterial in these cases).
+ </dd>
<dt>const T& value</dt>
<dd>
- The value that caused the error: either an argument to the function
- if this is a domain or pole error, the tentative result if this
- is a denorm or evaluation error, or zero or infinity for underflow
- or overflow errors.
- </dd>
+ The value that caused the error: either an argument to the function
+ if this is a domain or pole error, the tentative result if this is
+ a denorm or evaluation error, or zero or infinity for underflow or
+ overflow errors.
+ </dd>
</dl>
</div>

- 
-
- As before we'll include the headers we need first:
- 
-
- 
+ As before we'll include the headers we need first:
+ 

-
+

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

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

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

-
+

<pre class="programlisting">namespace boost{ namespace math{
namespace policies
@@ -262,96 +217,71 @@
T user_domain_error(const char* function, const char* message, const T& val)
{</pre>

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

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

-
+

<pre class="programlisting">if(function == 0)
 function = "Unknown function with arguments of type %1%";
if(message == 0)
 message = "Cause unknown with bad argument %1%";</pre>

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

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

-
+

<pre class="programlisting">std::string msg("Error in function ");
msg += (boost::format(function) % typeid(T).name()).str();</pre>

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

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

-
+

<pre class="programlisting">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();</pre>

- 
-
- 
-
- 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:
- 
+ 

- 
+ 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:
+ 

-
+

<pre class="programlisting">std::cerr << msg << std::endl;</pre>

- 
-
- 
-
- Finally the only sensible value we can return from a domain error is
- a NaN:
- 
+ 

- 
+ Finally the only sensible value we can return from a domain error is a
+ NaN:
+ 

-
+

<pre class="programlisting"> return std::numeric_limits<T>::quiet_NaN();
}</pre>

- 
-
- 
-
- Pole errors are essentially a special case of domain errors, so in this
- example we'll just return the result of a domain error:
- 
+ 

- 
+ Pole errors are essentially a special case of domain errors, so in this
+ example we'll just return the result of a domain error:
+ 

-
+

<pre class="programlisting">template <class T>
T user_pole_error(const char* function, const char* message, const T& val)
@@ -359,17 +289,13 @@
 return user_domain_error(function, message, val);
}</pre>

- 
-
- 
-
- Overflow errors are very similar to domain errors, except that there's
- no %1% format specifier in the message parameter:
- 
+ 

- 
+ Overflow errors are very similar to domain errors, except that there's
+ no %1% format specifier in the message parameter:
+ 

-
+

<pre class="programlisting">template <class T>
T user_overflow_error(const char* function, const char* message, const T& val)
@@ -386,21 +312,17 @@
 msg += message;

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

- 
-
- 
-
- Underflow errors are much the same as overflow:
- 
+ 

- 
+ Underflow errors are much the same as overflow:
+ 

-
+

<pre class="programlisting">template <class T>
T user_underflow_error(const char* function, const char* message, const T& val)
@@ -417,21 +339,17 @@
 msg += message;

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

- 
-
- 
-
- Denormalised results are much the same as underflow:
- 
+ 

- 
+ Denormalised results are much the same as underflow:
+ 

-
+

<pre class="programlisting">template <class T>
T user_denorm_error(const char* function, const char* message, const T& val)
@@ -448,24 +366,20 @@
 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
- error occurs that prevents the function being fully evaluated. The parameter
- val contains the closest approximation to the result
- found so far:
- 
+ 

- 
+ 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:
+ 

-
+

<pre class="programlisting">template <class T>
T user_evaluation_error(const char* function, const char* message, const T& val)
@@ -486,26 +400,21 @@

 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();
}

} // policies
}} // boost::math</pre>

- 
-
- 
-
- 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:
- 
+ 

- 
+ 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:
+ 

-
+

<pre class="programlisting">namespace
{ // unnamed.
@@ -525,17 +434,13 @@

} // unnamed namespace</pre>

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

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

-
+

<pre class="programlisting">template <class RealType>
inline typename boost::math::tools::promote_args<RT>::type
@@ -545,17 +450,15 @@
}
</pre>

- 
-
- 
-
- 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:
- 
+ 

- 
+ 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:
+ 

-
+

<pre class="programlisting">int main()
{
@@ -576,15 +479,10 @@
 // since these should never really occur!
} // int main()</pre>

- 
-
- 
-
- Which outputs:
- 
+ 

-
-
+ Which outputs:
+ 
<pre class="programlisting">Error in function boost::math::erf_inv<double>(double, double):
Argument outside range [-1, 1] in inverse erf function (got p=-10).
Result of erf_inv(-10) is: 1.#QNAN
@@ -606,18 +504,14 @@
Result of tgamma(-190.5) is: 0
</pre>

- 
-
- Notice how some of the calls result in an error handler being called
- more than once, or for more than one handler to be called: this is an
- artefact 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 <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 is dividing by infinity and so underflows.
- 
-
+ Notice how some of the calls result in an error handler being called more
+ than once, or for more than one handler to be called: this is an artefact
+ 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
+ <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 is dividing by infinity and so underflows.
 
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/what_is_a_policy.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/what_is_a_policy.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/policy/pol_tutorial/what_is_a_policy.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.policy.pol_tutorial.what_is_a_policy"></a><a class="link" href="what_is_a_policy.html" title="So Just What is a Policy Anyway?">
- So Just What is a Policy Anyway?</a>
+<a name="math_toolkit.policy.pol_tutorial.what_is_a_policy"></a><a class="link" href="what_is_a_policy.html" title="So Just What is a Policy Anyway?">So
+ Just What is a Policy Anyway?</a>
</h4></div></div></div>

 A policy is a compile-time mechanism for customising the behaviour of a
@@ -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.

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,122 +24,121 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="math_toolkit.special"></a><a class="link" href="special.html" title="Special Functions"> Special Functions</a>
+<a name="math_toolkit.special"></a><a class="link" href="special.html" title="Special Functions">Special Functions</a>
</h2></div></div></div>
<div class="toc"><dl>
-<dt> Gamma Functions</dt>
+<dt>Gamma Functions</dt>
<dd><dl>
-<dt> Gamma</dt>
-<dt> Log Gamma</dt>
-<dt> Digamma</dt>
-<dt><a href="special/sf_gamma/gamma_ratios.html"> Ratios
+<dt>Gamma</dt>
+<dt>Log Gamma</dt>
+<dt>Digamma</dt>
+<dt><a href="special/sf_gamma/gamma_ratios.html">Ratios
 of Gamma Functions</a></dt>
-<dt><a href="special/sf_gamma/igamma.html"> Incomplete Gamma
+<dt><a href="special/sf_gamma/igamma.html">Incomplete Gamma
 Functions</a></dt>
-<dt><a href="special/sf_gamma/igamma_inv.html"> Incomplete
+<dt><a href="special/sf_gamma/igamma_inv.html">Incomplete
 Gamma Function Inverses</a></dt>
-<dt><a href="special/sf_gamma/gamma_derivatives.html"> Derivative
+<dt><a href="special/sf_gamma/gamma_derivatives.html">Derivative
 of the Incomplete Gamma Function</a></dt>
</dl></dd>
-<dt><a href="special/factorials.html"> Factorials and Binomial
+<dt><a href="special/factorials.html">Factorials and Binomial
 Coefficients</a></dt>
<dd><dl>
-<dt> Factorial</dt>
-<dt><a href="special/factorials/sf_double_factorial.html">
- Double Factorial</a></dt>
-<dt><a href="special/factorials/sf_rising_factorial.html">
- Rising Factorial</a></dt>
-<dt><a href="special/factorials/sf_falling_factorial.html">
- Falling Factorial</a></dt>
-<dt><a href="special/factorials/sf_binomial.html"> Binomial
+<dt>Factorial</dt>
+<dt><a href="special/factorials/sf_double_factorial.html">Double
+ Factorial</a></dt>
+<dt><a href="special/factorials/sf_rising_factorial.html">Rising
+ Factorial</a></dt>
+<dt><a href="special/factorials/sf_falling_factorial.html">Falling
+ Factorial</a></dt>
+<dt><a href="special/factorials/sf_binomial.html">Binomial
 Coefficients</a></dt>
</dl></dd>
-<dt> Beta Functions</dt>
+<dt>Beta Functions</dt>
<dd><dl>
-<dt> Beta</dt>
-<dt><a href="special/sf_beta/ibeta_function.html"> Incomplete
+<dt>Beta</dt>
+<dt><a href="special/sf_beta/ibeta_function.html">Incomplete
 Beta Functions</a></dt>
-<dt><a href="special/sf_beta/ibeta_inv_function.html"> The
+<dt><a href="special/sf_beta/ibeta_inv_function.html">The
 Incomplete Beta Function Inverses</a></dt>
-<dt><a href="special/sf_beta/beta_derivative.html"> Derivative
+<dt><a href="special/sf_beta/beta_derivative.html">Derivative
 of the Incomplete Beta Function</a></dt>
</dl></dd>
-<dt> Error Functions</dt>
+<dt>Error Functions</dt>
<dd><dl>
-<dt><a href="special/sf_erf/error_function.html"> Error
- Functions</a></dt>
-<dt><a href="special/sf_erf/error_inv.html"> Error Function
+<dt>Error Functions</dt>
+<dt><a href="special/sf_erf/error_inv.html">Error Function
 Inverses</a></dt>
</dl></dd>
-<dt> Polynomials</dt>
+<dt>Polynomials</dt>
<dd><dl>
-<dt><a href="special/sf_poly/legendre.html"> Legendre (and
+<dt><a href="special/sf_poly/legendre.html">Legendre (and
 Associated) Polynomials</a></dt>
-<dt><a href="special/sf_poly/laguerre.html"> Laguerre (and
+<dt><a href="special/sf_poly/laguerre.html">Laguerre (and
 Associated) Polynomials</a></dt>
-<dt> Hermite Polynomials</dt>
-<dt> Spherical Harmonics</dt>
+<dt>Hermite Polynomials</dt>
+<dt>Spherical Harmonics</dt>
</dl></dd>
-<dt> Bessel Functions</dt>
+<dt>Bessel Functions</dt>
<dd><dl>
-<dt><a href="special/bessel/bessel_over.html"> Bessel Function
+<dt><a href="special/bessel/bessel_over.html">Bessel Function
 Overview</a></dt>
-<dt><a href="special/bessel/bessel.html"> Bessel Functions
+<dt><a href="special/bessel/bessel.html">Bessel Functions
 of the First and Second Kinds</a></dt>
-<dt><a href="special/bessel/mbessel.html"> Modified Bessel
+<dt><a href="special/bessel/mbessel.html">Modified Bessel
+ Functions of the First and Second Kinds</a></dt>
+<dt><a href="special/bessel/sph_bessel.html">Spherical Bessel
 Functions of the First and Second Kinds</a></dt>
-<dt><a href="special/bessel/sph_bessel.html"> Spherical
- Bessel Functions of the First and Second Kinds</a></dt>
</dl></dd>
-<dt> Elliptic Integrals</dt>
+<dt>Elliptic Integrals</dt>
<dd><dl>
-<dt><a href="special/ellint/ellint_intro.html"> Elliptic
+<dt><a href="special/ellint/ellint_intro.html">Elliptic
 Integral Overview</a></dt>
-<dt><a href="special/ellint/ellint_carlson.html"> Elliptic
+<dt><a href="special/ellint/ellint_carlson.html">Elliptic
 Integrals - Carlson Form</a></dt>
-<dt><a href="special/ellint/ellint_1.html"> Elliptic Integrals
+<dt><a href="special/ellint/ellint_1.html">Elliptic Integrals
 of the First Kind - Legendre Form</a></dt>
-<dt><a href="special/ellint/ellint_2.html"> Elliptic Integrals
+<dt><a href="special/ellint/ellint_2.html">Elliptic Integrals
 of the Second Kind - Legendre Form</a></dt>
-<dt><a href="special/ellint/ellint_3.html"> Elliptic Integrals
+<dt><a href="special/ellint/ellint_3.html">Elliptic Integrals
 of the Third Kind - Legendre Form</a></dt>
</dl></dd>
-<dt> Zeta Functions</dt>
-<dd><dl><dt> Riemann Zeta Function</dt></dl></dd>
-<dt> Exponential Integrals</dt>
-<dd><dl>
-<dt><a href="special/expint/expint_n.html"> Exponential
- Integral En</a></dt>
-<dt><a href="special/expint/expint_i.html"> Exponential
- Integral Ei</a></dt>
+<dt>Zeta Functions</dt>
+<dd><dl><dt>Riemann Zeta Function</dt></dl></dd>
+<dt>Exponential Integrals</dt>
+<dd><dl>
+<dt><a href="special/expint/expint_n.html">Exponential Integral
+ En</a></dt>
+<dt><a href="special/expint/expint_i.html">Exponential Integral
+ Ei</a></dt>
</dl></dd>
-<dt><a href="special/powers.html"> Logs, Powers, Roots and
+<dt><a href="special/powers.html">Logs, Powers, Roots and
 Exponentials</a></dt>
<dd><dl>
-<dt> log1p</dt>
-<dt> expm1</dt>
-<dt> cbrt</dt>
-<dt> sqrt1pm1</dt>
-<dt> powm1</dt>
-<dt> hypot</dt>
-<dt><a href="special/powers/ct_pow.html"> Compile Time Power
+<dt>log1p</dt>
+<dt>expm1</dt>
+<dt>cbrt</dt>
+<dt>sqrt1pm1</dt>
+<dt>powm1</dt>
+<dt>hypot</dt>
+<dt><a href="special/powers/ct_pow.html">Compile Time Power
 of a Runtime Base</a></dt>
</dl></dd>
-<dt><a href="special/sinc.html"> Sinus Cardinal and Hyperbolic
+<dt><a href="special/sinc.html">Sinus Cardinal and Hyperbolic
 Sinus Cardinal Functions</a></dt>
<dd><dl>
-<dt><a href="special/sinc/sinc_overview.html"> Sinus Cardinal
+<dt><a href="special/sinc/sinc_overview.html">Sinus Cardinal
 and Hyperbolic Sinus Cardinal Functions Overview</a></dt>
<dt>sinc_pi</dt>
<dt>sinhc_pi</dt>
</dl></dd>
-<dt> Inverse Hyperbolic Functions</dt>
+<dt>Inverse Hyperbolic Functions</dt>
<dd><dl>
-<dt><a href="special/inv_hyper/inv_hyper_over.html"> Inverse
+<dt><a href="special/inv_hyper/inv_hyper_over.html">Inverse
 Hyperbolic Functions Overview</a></dt>
-<dt> acosh</dt>
-<dt> asinh</dt>
-<dt> atanh</dt>
+<dt>acosh</dt>
+<dt>asinh</dt>
+<dt>atanh</dt>
</dl></dd>
</dl></div>
</div>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,26 +24,18 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.special.bessel"></a><a class="link" href="bessel.html" title="Bessel Functions"> Bessel Functions</a>
+<a name="math_toolkit.special.bessel"></a><a class="link" href="bessel.html" title="Bessel Functions">Bessel Functions</a>
</h3></div></div></div>
<div class="toc"><dl>
-<dt><a href="bessel/bessel_over.html"> Bessel Function
+<dt><a href="bessel/bessel_over.html">Bessel Function
 Overview</a></dt>
-<dt><a href="bessel/bessel.html"> Bessel Functions
+<dt><a href="bessel/bessel.html">Bessel Functions
 of the First and Second Kinds</a></dt>
-<dt><a href="bessel/mbessel.html"> Modified Bessel
+<dt><a href="bessel/mbessel.html">Modified Bessel
+ Functions of the First and Second Kinds</a></dt>
+<dt><a href="bessel/sph_bessel.html">Spherical Bessel
 Functions of the First and Second Kinds</a></dt>
-<dt><a href="bessel/sph_bessel.html"> Spherical
- Bessel Functions of the First and Second Kinds</a></dt>
</dl></div>
-
- 
-
- 
-
- 
-
- 
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel/bessel.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel/bessel.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel/bessel.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.bessel.bessel"></a><a class="link" href="bessel.html" title="Bessel Functions of the First and Second Kinds"> Bessel Functions
+<a name="math_toolkit.special.bessel.bessel"></a><a class="link" href="bessel.html" title="Bessel Functions of the First and Second Kinds">Bessel Functions
 of the First and Second Kinds</a>
</h4></div></div></div>
<a name="math_toolkit.special.bessel.bessel.synopsis"></a><h5>
-<a name="id1235005"></a>
+<a name="id1107346"></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="id1235372"></a>
+<a name="id1107713"></a>
 <a class="link" href="bessel.html#math_toolkit.special.bessel.bessel.description">Description</a>
 </h5>

@@ -75,14 +75,9 @@
 is an integer.
 

- 
-
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- 
-
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
 

 The functions return the result of <a class="link" href="../../main_overview/error_handling.html#domain_error">domain_error</a>
@@ -104,13 +99,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="id1235656"></a>
+<a name="id1107993"></a>
 <a class="link" href="bessel.html#math_toolkit.special.bessel.bessel.testing">Testing</a>
 </h5>

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

@@ -157,7 +152,7 @@
 </th>
<th>
 
- J0 and J1
+ J0 and J1
 
 </th>
<th>
@@ -167,7 +162,7 @@
 </th>
<th>
 
- Jv (large values of x > 1000)
+ Jv (large values of x > 1000)
 
 </th>
</tr></thead>
@@ -242,7 +237,7 @@
 </td>
<td>
 
- Peak=2x104 Mean=6x103
+ Peak=2x104 Mean=6x103
 
 </td>
</tr>
@@ -269,7 +264,7 @@
 </td>
<td>
 
- Peak=2x104 Mean=1x104
+ Peak=2x104 Mean=1x104
 
 </td>
</tr>
@@ -326,7 +321,7 @@
 </th>
<th>
 
- J0 and J1
+ J0 and J1
 
 </th>
<th>
@@ -381,7 +376,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 +428,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 +460,7 @@
 </td>
<td>
 
- Peak=2x104 Mean=1200
+ Peak=2x104 Mean=1200
 
 </td>
</tr>
@@ -494,7 +489,7 @@
 were found.
 
<a name="math_toolkit.special.bessel.bessel.implementation"></a><h5>
-<a name="id1236408"></a>
+<a name="id1108750"></a>
 <a class="link" href="bessel.html#math_toolkit.special.bessel.bessel.implementation">Implementation</a>
 </h5>

@@ -538,9 +533,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 +557,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 +637,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,7 +645,7 @@
 (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.

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel/bessel_over.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel/bessel_over.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel/bessel_over.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.bessel.bessel_over"></a><a class="link" href="bessel_over.html" title="Bessel Function Overview"> Bessel Function
+<a name="math_toolkit.special.bessel.bessel_over"></a><a class="link" href="bessel_over.html" title="Bessel Function Overview">Bessel Function
 Overview</a>
</h4></div></div></div>
<a name="math_toolkit.special.bessel.bessel_over.ordinary_bessel_functions"></a><h5>
-<a name="id1233003"></a>
+<a name="id1106601"></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="id1234574"></a>
+<a name="id1106921"></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="id1234879"></a>
+<a name="id1107226"></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.

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel/mbessel.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel/mbessel.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel/mbessel.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.bessel.mbessel"></a><a class="link" href="mbessel.html" title="Modified Bessel Functions of the First and Second Kinds"> Modified Bessel
+<a name="math_toolkit.special.bessel.mbessel"></a><a class="link" href="mbessel.html" title="Modified Bessel Functions of the First and Second Kinds">Modified Bessel
 Functions of the First and Second Kinds</a>
</h4></div></div></div>
<a name="math_toolkit.special.bessel.mbessel.synopsis"></a><h5>
-<a name="id1237028"></a>
+<a name="id1109360"></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="id1237395"></a>
+<a name="id1109727"></a>
 <a class="link" href="mbessel.html#math_toolkit.special.bessel.mbessel.description">Description</a>
 </h5>

@@ -75,14 +75,9 @@
 is an integer.
 

- 
-
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- 
-
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
 

 The functions return the result of <a class="link" href="../../main_overview/error_handling.html#domain_error">domain_error</a>
@@ -109,7 +104,7 @@
 <img src="../../../../graphs/cyl_bessel_k.png" align="middle">
 
<a name="math_toolkit.special.bessel.mbessel.testing"></a><h5>
-<a name="id1237667"></a>
+<a name="id1109996"></a>
 <a class="link" href="mbessel.html#math_toolkit.special.bessel.mbessel.testing">Testing</a>
 </h5>

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

@@ -326,19 +321,19 @@
</table></div>
</div>
 <a name="math_toolkit.special.bessel.mbessel.implementation"></a><h5>
-<a name="id1238032"></a>
+<a name="id1110361"></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 +357,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 +380,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 +417,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 +450,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

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel/sph_bessel.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel/sph_bessel.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/bessel/sph_bessel.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.bessel.sph_bessel"></a><a class="link" href="sph_bessel.html" title="Spherical Bessel Functions of the First and Second Kinds"> Spherical
- Bessel Functions of the First and Second Kinds</a>
+<a name="math_toolkit.special.bessel.sph_bessel"></a><a class="link" href="sph_bessel.html" title="Spherical Bessel Functions of the First and Second Kinds">Spherical Bessel
+ Functions of the First and Second Kinds</a>
</h4></div></div></div>
<a name="math_toolkit.special.bessel.sph_bessel.synopsis"></a><h5>
-<a name="id1238553"></a>
+<a name="id1111158"></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="id1239746"></a>
+<a name="id1111525"></a>
 <a class="link" href="sph_bessel.html#math_toolkit.special.bessel.sph_bessel.description">Description</a>
 </h5>

@@ -70,34 +70,29 @@
 type calculation rules</a> for the single argument type T.
 

- 
-
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- 
-
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
 

 The functions return the result of <a class="link" href="../../main_overview/error_handling.html#domain_error">domain_error</a>
 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="id1239944"></a>
+<a name="id1111721"></a>
 <a class="link" href="sph_bessel.html#math_toolkit.special.bessel.sph_bessel.testing">Testing</a>
 </h5>

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

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

@@ -130,7 +125,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

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,18 +24,18 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.special.ellint"></a><a class="link" href="ellint.html" title="Elliptic Integrals"> Elliptic Integrals</a>
+<a name="math_toolkit.special.ellint"></a><a class="link" href="ellint.html" title="Elliptic Integrals">Elliptic Integrals</a>
</h3></div></div></div>
<div class="toc"><dl>
-<dt><a href="ellint/ellint_intro.html"> Elliptic
+<dt><a href="ellint/ellint_intro.html">Elliptic
 Integral Overview</a></dt>
-<dt><a href="ellint/ellint_carlson.html"> Elliptic
+<dt><a href="ellint/ellint_carlson.html">Elliptic
 Integrals - Carlson Form</a></dt>
-<dt><a href="ellint/ellint_1.html"> Elliptic Integrals
+<dt><a href="ellint/ellint_1.html">Elliptic Integrals
 of the First Kind - Legendre Form</a></dt>
-<dt><a href="ellint/ellint_2.html"> Elliptic Integrals
+<dt><a href="ellint/ellint_2.html">Elliptic Integrals
 of the Second Kind - Legendre Form</a></dt>
-<dt><a href="ellint/ellint_3.html"> Elliptic Integrals
+<dt><a href="ellint/ellint_3.html">Elliptic Integrals
 of the Third Kind - Legendre Form</a></dt>
</dl></div>
</div>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_1.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_1.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_1.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.ellint.ellint_1"></a><a class="link" href="ellint_1.html" title="Elliptic Integrals of the First Kind - Legendre Form"> Elliptic Integrals
+<a name="math_toolkit.special.ellint.ellint_1"></a><a class="link" href="ellint_1.html" title="Elliptic Integrals of the First Kind - Legendre Form">Elliptic Integrals
 of the First Kind - Legendre Form</a>
</h4></div></div></div>
<a name="math_toolkit.special.ellint.ellint_1.synopsis"></a><h6>
-<a name="id1247002"></a>
+<a name="id1119472"></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="id1247406"></a>
+<a name="id1119877"></a>
 <a class="link" href="ellint_1.html#math_toolkit.special.ellint.ellint_1.description">Description</a>
 </h6>

@@ -88,14 +88,9 @@
 Requires -1 <= k <= 1, otherwise returns the result of <a class="link" href="../../main_overview/error_handling.html#domain_error">domain_error</a>.
 

- 
-
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- 
-
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
 
<pre class="programlisting">template <class T>
<a class="link" href="../../main_overview/result_type.html" title="Calculation of the Type of the Result">calculated-result-type</a> ellint_1(T k);
@@ -113,17 +108,12 @@
 Requires -1 <= k <= 1, otherwise returns the result of <a class="link" href="../../main_overview/error_handling.html#domain_error">domain_error</a>.
 

- 
-
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- 
-
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
 
<a name="math_toolkit.special.ellint.ellint_1.accuracy"></a><h6>
-<a name="id1247870"></a>
+<a name="id1120334"></a>
 <a class="link" href="ellint_1.html#math_toolkit.special.ellint.ellint_1.accuracy">Accuracy</a>
 </h6>

@@ -235,7 +225,7 @@
</table></div>
</div>
 <a name="math_toolkit.special.ellint.ellint_1.testing"></a><h6>
-<a name="id1248056"></a>
+<a name="id1120520"></a>
 <a class="link" href="ellint_1.html#math_toolkit.special.ellint.ellint_1.testing">Testing</a>
 </h6>

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

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_2.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_2.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_2.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.ellint.ellint_2"></a><a class="link" href="ellint_2.html" title="Elliptic Integrals of the Second Kind - Legendre Form"> Elliptic Integrals
+<a name="math_toolkit.special.ellint.ellint_2"></a><a class="link" href="ellint_2.html" title="Elliptic Integrals of the Second Kind - Legendre Form">Elliptic Integrals
 of the Second Kind - Legendre Form</a>
</h4></div></div></div>
<a name="math_toolkit.special.ellint.ellint_2.synopsis"></a><h6>
-<a name="id1248158"></a>
+<a name="id1120622"></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="id1248563"></a>
+<a name="id1121027"></a>
 <a class="link" href="ellint_2.html#math_toolkit.special.ellint.ellint_2.description">Description</a>
 </h6>

@@ -88,14 +88,9 @@
 Requires -1 <= k <= 1, otherwise returns the result of <a class="link" href="../../main_overview/error_handling.html#domain_error">domain_error</a>.
 

- 
-
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- 
-
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
 
<pre class="programlisting">template <class T>
<a class="link" href="../../main_overview/result_type.html" title="Calculation of the Type of the Result">calculated-result-type</a> ellint_2(T k);
@@ -113,17 +108,12 @@
 Requires -1 <= k <= 1, otherwise returns the result of <a class="link" href="../../main_overview/error_handling.html#domain_error">domain_error</a>.
 

- 
-
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- 
-
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
 
<a name="math_toolkit.special.ellint.ellint_2.accuracy"></a><h6>
-<a name="id1249028"></a>
+<a name="id1121484"></a>
 <a class="link" href="ellint_2.html#math_toolkit.special.ellint.ellint_2.accuracy">Accuracy</a>
 </h6>

@@ -235,7 +225,7 @@
</table></div>
</div>
 <a name="math_toolkit.special.ellint.ellint_2.testing"></a><h6>
-<a name="id1249215"></a>
+<a name="id1121671"></a>
 <a class="link" href="ellint_2.html#math_toolkit.special.ellint.ellint_2.testing">Testing</a>
 </h6>

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

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_3.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_3.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_3.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.ellint.ellint_3"></a><a class="link" href="ellint_3.html" title="Elliptic Integrals of the Third Kind - Legendre Form"> Elliptic Integrals
+<a name="math_toolkit.special.ellint.ellint_3"></a><a class="link" href="ellint_3.html" title="Elliptic Integrals of the Third Kind - Legendre Form">Elliptic Integrals
 of the Third Kind - Legendre Form</a>
</h4></div></div></div>
<a name="math_toolkit.special.ellint.ellint_3.synopsis"></a><h6>
-<a name="id1249317"></a>
+<a name="id1121773"></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="id1249827"></a>
+<a name="id1122283"></a>
 <a class="link" href="ellint_3.html#math_toolkit.special.ellint.ellint_3.description">Description</a>
 </h6>

@@ -91,14 +91,9 @@
 (outside this range the result would be complex).
 

- 
-
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- 
-
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
 
<pre class="programlisting">template <class T1, class T2>
<a class="link" href="../../main_overview/result_type.html" title="Calculation of the Type of the Result">calculated-result-type</a> ellint_3(T1 k, T2 n);
@@ -119,17 +114,12 @@
 (outside this range the result would be complex).
 

- 
-
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- 
-
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
 
<a name="math_toolkit.special.ellint.ellint_3.accuracy"></a><h6>
-<a name="id1250428"></a>
+<a name="id1122877"></a>
 <a class="link" href="ellint_3.html#math_toolkit.special.ellint.ellint_3.accuracy">Accuracy</a>
 </h6>

@@ -241,7 +231,7 @@
</table></div>
</div>
 <a name="math_toolkit.special.ellint.ellint_3.testing"></a><h6>
-<a name="id1250614"></a>
+<a name="id1124156"></a>
 <a class="link" href="ellint_3.html#math_toolkit.special.ellint.ellint_3.testing">Testing</a>
 </h6>

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

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

- Π(n, φ+mπ, k) = Π(n, φ, k) ; n > 1 [<a name="id1250750" href="#ftn.id1250750" class="footnote">1</a>]
+ Π(n, φ+mπ, k) = Π(n, φ, k) ; n > 1 [<a name="id1124292" href="#ftn.id1124292" 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 +298,7 @@
 
<div class="footnotes">
 <hr width="100" align="left">
-<div class="footnote">[<a name="ftn.id1250750" href="#id1250750" class="para">1</a>] 
+<div class="footnote">[<a name="ftn.id1124292" href="#id1124292" 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

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_carlson.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_carlson.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_carlson.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.ellint.ellint_carlson"></a><a class="link" href="ellint_carlson.html" title="Elliptic Integrals - Carlson Form"> Elliptic
+<a name="math_toolkit.special.ellint.ellint_carlson"></a><a class="link" href="ellint_carlson.html" title="Elliptic Integrals - Carlson Form">Elliptic
 Integrals - Carlson Form</a>
</h4></div></div></div>
<a name="math_toolkit.special.ellint.ellint_carlson.synopsis"></a><h6>
-<a name="id1241186"></a>
+<a name="id1115316"></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="id1244676"></a>
+<a name="id1116615"></a>
 <a class="link" href="ellint_carlson.html#math_toolkit.special.ellint.ellint_carlson.description">Description</a>
 </h6>

@@ -133,14 +133,9 @@
 be zero. Otherwise returns the result of <a class="link" href="../../main_overview/error_handling.html#domain_error">domain_error</a>.
 

- 
-
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- 
-
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
 
<pre class="programlisting">template <class T1, class T2, class T3>
<a class="link" href="../../main_overview/result_type.html" title="Calculation of the Type of the Result">calculated-result-type</a> ellint_rd(T1 x, T2 y, T3 z)
@@ -159,14 +154,9 @@
 and that z >= 0. Otherwise returns the result of <a class="link" href="../../main_overview/error_handling.html#domain_error">domain_error</a>.
 

- 
-
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- 
-
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
 
<pre class="programlisting">template <class T1, class T2, class T3, class T4>
<a class="link" href="../../main_overview/result_type.html" title="Calculation of the Type of the Result">calculated-result-type</a> ellint_rj(T1 x, T2 y, T3 z, T4 p)
@@ -186,14 +176,9 @@
 <a class="link" href="../../main_overview/error_handling.html#domain_error">domain_error</a>.
 

- 
-
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- 
-
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
 

 When p < 0 the function returns the <a href="http://en.wikipedia.org/wiki/Cauchy_principal_value" target="_top">Cauchy
@@ -219,14 +204,9 @@
 Otherwise returns the result of <a class="link" href="../../main_overview/error_handling.html#domain_error">domain_error</a>.
 

- 
-
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- 
-
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
 

 When y < 0 the function returns the <a href="http://mathworld.wolfram.com/CauchyPrincipalValue.html" target="_top">Cauchy
@@ -236,7 +216,7 @@
 <img src="../../../../equations/ellint18.png">
 
<a name="math_toolkit.special.ellint.ellint_carlson.testing"></a><h6>
-<a name="id1245964"></a>
+<a name="id1118981"></a>
 <a class="link" href="ellint_carlson.html#math_toolkit.special.ellint.ellint_carlson.testing">Testing</a>
 </h6>

@@ -259,7 +239,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="id1246005"></a>
+<a name="id1119022"></a>
 <a class="link" href="ellint_carlson.html#math_toolkit.special.ellint.ellint_carlson.accuracy">Accuracy</a>
 </h6>

@@ -413,7 +393,7 @@
</table></div>
</div>
 <a name="math_toolkit.special.ellint.ellint_carlson.implementation"></a><h6>
-<a name="id1246818"></a>
+<a name="id1119289"></a>
 <a class="link" href="ellint_carlson.html#math_toolkit.special.ellint.ellint_carlson.implementation">Implementation</a>
 </h6>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_intro.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_intro.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/ellint/ellint_intro.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.ellint.ellint_intro"></a><a class="link" href="ellint_intro.html" title="Elliptic Integral Overview"> Elliptic
+<a name="math_toolkit.special.ellint.ellint_intro"></a><a class="link" href="ellint_intro.html" title="Elliptic Integral Overview">Elliptic
 Integral Overview</a>
</h4></div></div></div>

@@ -49,14 +49,14 @@
 Elliptic integral</a>.
 
<a name="math_toolkit.special.ellint.ellint_intro.notation"></a><h5>
-<a name="id1240140"></a>
+<a name="id1111916"></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="id1240160"></a>
+<a name="id1111937"></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="id1240760"></a>
+<a name="id1112537"></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="id1240814"></a>
+<a name="id1112591"></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="id1240887"></a>
+<a name="id1112664"></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="id1240920"></a>
+<a name="id1112696"></a>
 <a class="link" href="ellint_intro.html#math_toolkit.special.ellint.ellint_intro.references">References</a>
 </h5>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/expint.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/expint.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/expint.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,13 +24,13 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.special.expint"></a><a class="link" href="expint.html" title="Exponential Integrals"> Exponential Integrals</a>
+<a name="math_toolkit.special.expint"></a><a class="link" href="expint.html" title="Exponential Integrals">Exponential Integrals</a>
</h3></div></div></div>
<div class="toc"><dl>
-<dt><a href="expint/expint_n.html"> Exponential
- Integral En</a></dt>
-<dt><a href="expint/expint_i.html"> Exponential
- Integral Ei</a></dt>
+<dt><a href="expint/expint_n.html">Exponential Integral
+ En</a></dt>
+<dt><a href="expint/expint_i.html">Exponential Integral
+ Ei</a></dt>
</dl></div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/expint/expint_i.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/expint/expint_i.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/expint/expint_i.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.expint.expint_i"></a><a class="link" href="expint_i.html" title="Exponential Integral Ei"> Exponential
- Integral Ei</a>
+<a name="math_toolkit.special.expint.expint_i"></a><a class="link" href="expint_i.html" title="Exponential Integral Ei">Exponential Integral
+ Ei</a>
</h4></div></div></div>
<a name="math_toolkit.special.expint.expint_i.synopsis"></a><h5>
-<a name="id1254045"></a>
+<a name="id1126712"></a>
 <a class="link" href="expint_i.html#math_toolkit.special.expint.expint_i.synopsis">Synopsis</a>
 </h5>

@@ -53,17 +53,12 @@
 type calculation rules</a>: the return type is <code class="computeroutput">double</code> if T is an integer type, and T otherwise.
 

- 
-
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- 
-
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
 
<a name="math_toolkit.special.expint.expint_i.description"></a><h5>
-<a name="id1254306"></a>
+<a name="id1126968"></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 +78,7 @@
 <img src="../../../../graphs/expint_i.png" align="middle">
 
<a name="math_toolkit.special.expint.expint_i.accuracy"></a><h5>
-<a name="id1254670"></a>
+<a name="id1127166"></a>
 <a class="link" href="expint_i.html#math_toolkit.special.expint.expint_i.accuracy">Accuracy</a>
 </h5>

@@ -207,7 +202,7 @@
 slightly over the range [4,6].
 
<a name="math_toolkit.special.expint.expint_i.testing"></a><h5>
-<a name="id1254869"></a>
+<a name="id1127366"></a>
 <a class="link" href="expint_i.html#math_toolkit.special.expint.expint_i.testing">Testing</a>
 </h5>

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

@@ -252,7 +247,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="id1254983" href="#ftn.id1254983" class="footnote">2</a>] experienced the same issue and converted the polynomials into
+ Cody and Thacher [<a name="id1127480" href="#ftn.id1127480" 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 +277,7 @@
 
<div class="footnotes">
 <hr width="100" align="left">
-<div class="footnote">[<a name="ftn.id1254983" href="#id1254983" class="para">2</a>] 
+<div class="footnote">[<a name="ftn.id1127480" href="#id1127480" 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

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/expint/expint_n.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/expint/expint_n.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/expint/expint_n.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.expint.expint_n"></a><a class="link" href="expint_n.html" title="Exponential Integral En"> Exponential
- Integral En</a>
+<a name="math_toolkit.special.expint.expint_n"></a><a class="link" href="expint_n.html" title="Exponential Integral En">Exponential Integral
+ En</a>
</h4></div></div></div>
<a name="math_toolkit.special.expint.expint_n.synopsis"></a><h5>
-<a name="id1253053"></a>
+<a name="id1125362"></a>
 <a class="link" href="expint_n.html#math_toolkit.special.expint.expint_n.synopsis">Synopsis</a>
 </h5>

@@ -53,17 +53,12 @@
 type calculation rules</a>: the return type is <code class="computeroutput">double</code> if T is an integer type, and T otherwise.
 

- 
-
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- 
-
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
 
<a name="math_toolkit.special.expint.expint_n.description"></a><h5>
-<a name="id1253340"></a>
+<a name="id1125645"></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 +78,7 @@
 <img src="../../../../graphs/expint2.png" align="middle">
 
<a name="math_toolkit.special.expint.expint_n.accuracy"></a><h5>
-<a name="id1253564"></a>
+<a name="id1125870"></a>
 <a class="link" href="expint_n.html#math_toolkit.special.expint.expint_n.accuracy">Accuracy</a>
 </h5>

@@ -225,7 +220,7 @@
</table></div>
</div>
 <a name="math_toolkit.special.expint.expint_n.testing"></a><h5>
-<a name="id1253808"></a>
+<a name="id1126113"></a>
 <a class="link" href="expint_n.html#math_toolkit.special.expint.expint_n.testing">Testing</a>
 </h5>

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

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,18 +24,18 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.special.factorials"></a><a class="link" href="factorials.html" title="Factorials and Binomial Coefficients"> Factorials and Binomial
+<a name="math_toolkit.special.factorials"></a><a class="link" href="factorials.html" title="Factorials and Binomial Coefficients">Factorials and Binomial
Coefficients</a>
</h3></div></div></div>
<div class="toc"><dl>
-<dt> Factorial</dt>
-<dt><a href="factorials/sf_double_factorial.html">
- Double Factorial</a></dt>
-<dt><a href="factorials/sf_rising_factorial.html">
- Rising Factorial</a></dt>
-<dt><a href="factorials/sf_falling_factorial.html">
- Falling Factorial</a></dt>
-<dt><a href="factorials/sf_binomial.html"> Binomial
+<dt>Factorial</dt>
+<dt><a href="factorials/sf_double_factorial.html">Double
+ Factorial</a></dt>
+<dt><a href="factorials/sf_rising_factorial.html">Rising
+ Factorial</a></dt>
+<dt><a href="factorials/sf_falling_factorial.html">Falling
+ Factorial</a></dt>
+<dt><a href="factorials/sf_binomial.html">Binomial
Coefficients</a></dt>
</dl></div>
</div>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_binomial.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_binomial.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_binomial.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.factorials.sf_binomial"></a><a class="link" href="sf_binomial.html" title="Binomial Coefficients"> Binomial
+<a name="math_toolkit.special.factorials.sf_binomial"></a><a class="link" href="sf_binomial.html" title="Binomial Coefficients">Binomial
 Coefficients</a>
</h4></div></div></div>

@@ -51,21 +51,16 @@
 Requires k <= n.
 

- 
-
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- 
-
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
 

 May return the result of <a class="link" href="../../main_overview/error_handling.html#overflow_error">overflow_error</a>
 if the result is too large to represent in type T.
 
<a name="math_toolkit.special.factorials.sf_binomial.accuracy"></a><h5>
-<a name="id1201819"></a>
+<a name="id1074371"></a>
 <a class="link" href="sf_binomial.html#math_toolkit.special.factorials.sf_binomial.accuracy">Accuracy</a>
 </h5>

@@ -74,14 +69,14 @@
 function for larger arguments.
 
<a name="math_toolkit.special.factorials.sf_binomial.testing"></a><h5>
-<a name="id1201841"></a>
+<a name="id1074392"></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="id1201860"></a>
+<a name="id1074411"></a>
 <a class="link" href="sf_binomial.html#math_toolkit.special.factorials.sf_binomial.implementation">Implementation</a>
 </h5>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_double_factorial.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_double_factorial.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_double_factorial.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.factorials.sf_double_factorial"></a><a class="link" href="sf_double_factorial.html" title="Double Factorial">
- Double Factorial</a>
+<a name="math_toolkit.special.factorials.sf_double_factorial"></a><a class="link" href="sf_double_factorial.html" title="Double Factorial">Double
+ Factorial</a>
</h4></div></div></div>


@@ -48,14 +48,9 @@
 Returns <code class="literal">i!!</code>.
 

- 
-
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- 
-
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
 

 May return the result of <a class="link" href="../../main_overview/error_handling.html#overflow_error">overflow_error</a>
@@ -64,7 +59,7 @@
 of i! is possible.
 
<a name="math_toolkit.special.factorials.sf_double_factorial.accuracy"></a><h5>
-<a name="id1195843"></a>
+<a name="id1068639"></a>
 <a class="link" href="sf_double_factorial.html#math_toolkit.special.factorials.sf_double_factorial.accuracy">Accuracy</a>
 </h5>

@@ -72,14 +67,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="id1195864"></a>
+<a name="id1068660"></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="id1195884"></a>
+<a name="id1068679"></a>
 <a class="link" href="sf_double_factorial.html#math_toolkit.special.factorials.sf_double_factorial.implementation">Implementation</a>
 </h5>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_factorial.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_factorial.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_factorial.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,10 +24,10 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.factorials.sf_factorial"></a><a class="link" href="sf_factorial.html" title="Factorial"> Factorial</a>
+<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="id1194819"></a>
+<a name="id1067622"></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="id1195128"></a>
+<a name="id1067931"></a>
 <a class="link" href="sf_factorial.html#math_toolkit.special.factorials.sf_factorial.description">Description</a>
 </h5>
<pre class="programlisting">template <class T>
@@ -67,14 +67,9 @@
 Returns <code class="literal">i!</code>.
 

- 
-
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- 
-
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
 

 For <code class="literal">i <= max_factorial<T>::value</code> this is implemented
@@ -112,7 +107,7 @@
 the size of further tables that depend on the factorials.
 
<a name="math_toolkit.special.factorials.sf_factorial.accuracy"></a><h5>
-<a name="id1195488"></a>
+<a name="id1068287"></a>
 <a class="link" href="sf_factorial.html#math_toolkit.special.factorials.sf_factorial.accuracy">Accuracy</a>
 </h5>

@@ -121,7 +116,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="id1195531"></a>
+<a name="id1068330"></a>
 <a class="link" href="sf_factorial.html#math_toolkit.special.factorials.sf_factorial.testing">Testing</a>
 </h5>

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

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_falling_factorial.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_falling_factorial.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_falling_factorial.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.factorials.sf_falling_factorial"></a><a class="link" href="sf_falling_factorial.html" title="Falling Factorial">
- Falling Factorial</a>
+<a name="math_toolkit.special.factorials.sf_falling_factorial"></a><a class="link" href="sf_falling_factorial.html" title="Falling Factorial">Falling
+ Factorial</a>
</h4></div></div></div>


@@ -57,14 +57,9 @@
 however.
 

- 
-
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- 
-
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
 

 May return the result of <a class="link" href="../../main_overview/error_handling.html#overflow_error">overflow_error</a>
@@ -76,7 +71,7 @@
 the type of the result is T.
 
<a name="math_toolkit.special.factorials.sf_falling_factorial.accuracy"></a><h5>
-<a name="id1201464"></a>
+<a name="id1074019"></a>
 <a class="link" href="sf_falling_factorial.html#math_toolkit.special.factorials.sf_falling_factorial.accuracy">Accuracy</a>
 </h5>

@@ -84,14 +79,14 @@
 function.
 
<a name="math_toolkit.special.factorials.sf_falling_factorial.testing"></a><h5>
-<a name="id1201491"></a>
+<a name="id1074045"></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="id1201510"></a>
+<a name="id1074065"></a>
 <a class="link" href="sf_falling_factorial.html#math_toolkit.special.factorials.sf_falling_factorial.implementation">Implementation</a>
 </h5>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_rising_factorial.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_rising_factorial.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/factorials/sf_rising_factorial.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,8 +24,8 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.factorials.sf_rising_factorial"></a><a class="link" href="sf_rising_factorial.html" title="Rising Factorial">
- Rising Factorial</a>
+<a name="math_toolkit.special.factorials.sf_rising_factorial"></a><a class="link" href="sf_rising_factorial.html" title="Rising Factorial">Rising
+ Factorial</a>
</h4></div></div></div>


@@ -61,14 +61,9 @@
 negative as well as positive.
 

- 
-
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- 
-
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
 

 May return the result of <a class="link" href="../../main_overview/error_handling.html#overflow_error">overflow_error</a>
@@ -80,7 +75,7 @@
 the type of the result is T.
 
<a name="math_toolkit.special.factorials.sf_rising_factorial.accuracy"></a><h5>
-<a name="id1196254"></a>
+<a name="id1073627"></a>
 <a class="link" href="sf_rising_factorial.html#math_toolkit.special.factorials.sf_rising_factorial.accuracy">Accuracy</a>
 </h5>

@@ -88,14 +83,14 @@
 function.
 
<a name="math_toolkit.special.factorials.sf_rising_factorial.testing"></a><h5>
-<a name="id1196281"></a>
+<a name="id1073653"></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="id1196300"></a>
+<a name="id1073672"></a>
 <a class="link" href="sf_rising_factorial.html#math_toolkit.special.factorials.sf_rising_factorial.implementation">Implementation</a>
 </h5>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,14 +24,14 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.special.inv_hyper"></a><a class="link" href="inv_hyper.html" title="Inverse Hyperbolic Functions"> Inverse Hyperbolic Functions</a>
+<a name="math_toolkit.special.inv_hyper"></a><a class="link" href="inv_hyper.html" title="Inverse Hyperbolic Functions">Inverse Hyperbolic Functions</a>
</h3></div></div></div>
<div class="toc"><dl>
-<dt><a href="inv_hyper/inv_hyper_over.html"> Inverse
+<dt><a href="inv_hyper/inv_hyper_over.html">Inverse
Hyperbolic Functions Overview</a></dt>
-<dt> acosh</dt>
-<dt> asinh</dt>
-<dt> atanh</dt>
+<dt>acosh</dt>
+<dt>asinh</dt>
+<dt>atanh</dt>
</dl></div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper/acosh.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper/acosh.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper/acosh.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.inv_hyper.acosh"></a><a class="link" href="acosh.html" title="acosh"> acosh</a>
+<a name="math_toolkit.special.inv_hyper.acosh"></a><a class="link" href="acosh.html" title="acosh">acosh</a>
</h4></div></div></div>


@@ -54,27 +54,22 @@
 otherwise.
 

- 
-
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- 
-
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
 

 <img src="../../../../graphs/acosh.png" align="middle">
 
<a name="math_toolkit.special.inv_hyper.acosh.accuracy"></a><h5>
-<a name="id1263780"></a>
+<a name="id1136026"></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="id1263797"></a>
+<a name="id1136043"></a>
 <a class="link" href="acosh.html#math_toolkit.special.inv_hyper.acosh.testing">Testing</a>
 </h5>

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

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper/asinh.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper/asinh.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper/asinh.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.inv_hyper.asinh"></a><a class="link" href="asinh.html" title="asinh"> asinh</a>
+<a name="math_toolkit.special.inv_hyper.asinh"></a><a class="link" href="asinh.html" title="asinh">asinh</a>
</h4></div></div></div>


@@ -52,24 +52,19 @@
 <img src="../../../../graphs/asinh.png" align="middle">
 

- 
-
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- 
-
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
 
<a name="math_toolkit.special.inv_hyper.asinh.accuracy"></a><h5>
-<a name="id1264248"></a>
+<a name="id1136490"></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="id1264265"></a>
+<a name="id1136507"></a>
 <a class="link" href="asinh.html#math_toolkit.special.inv_hyper.asinh.testing">Testing</a>
 </h5>

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

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper/atanh.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper/atanh.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper/atanh.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.inv_hyper.atanh"></a><a class="link" href="atanh.html" title="atanh"> atanh</a>
+<a name="math_toolkit.special.inv_hyper.atanh"></a><a class="link" href="atanh.html" title="atanh">atanh</a>
</h4></div></div></div>


@@ -44,26 +44,21 @@
 hyperbolic tangent function</a>, at x.
 

- 
-
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- 
-
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
 

 If x is in the range <code class="literal">]-∞;-1[</code> or in the range <code class="literal">]+1;+∞[</code>
 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 +71,14 @@
 <img src="../../../../graphs/atanh.png" align="middle">
 
<a name="math_toolkit.special.inv_hyper.atanh.accuracy"></a><h5>
-<a name="id1264759"></a>
+<a name="id1136998"></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="id1264776"></a>
+<a name="id1137015"></a>
 <a class="link" href="atanh.html#math_toolkit.special.inv_hyper.atanh.testing">Testing</a>
 </h5>

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

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper/inv_hyper_over.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper/inv_hyper_over.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/inv_hyper/inv_hyper_over.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.inv_hyper.inv_hyper_over"></a><a class="link" href="inv_hyper_over.html" title="Inverse Hyperbolic Functions Overview"> Inverse
+<a name="math_toolkit.special.inv_hyper.inv_hyper_over"></a><a class="link" href="inv_hyper_over.html" title="Inverse Hyperbolic Functions Overview">Inverse
Hyperbolic Functions Overview</a>
</h4></div></div></div>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,17 +24,17 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.special.powers"></a><a class="link" href="powers.html" title="Logs, Powers, Roots and Exponentials"> Logs, Powers, Roots and
+<a name="math_toolkit.special.powers"></a><a class="link" href="powers.html" title="Logs, Powers, Roots and Exponentials">Logs, Powers, Roots and
Exponentials</a>
</h3></div></div></div>
<div class="toc"><dl>
-<dt> log1p</dt>
-<dt> expm1</dt>
-<dt> cbrt</dt>
-<dt> sqrt1pm1</dt>
-<dt> powm1</dt>
-<dt> hypot</dt>
-<dt><a href="powers/ct_pow.html"> Compile Time Power
+<dt>log1p</dt>
+<dt>expm1</dt>
+<dt>cbrt</dt>
+<dt>sqrt1pm1</dt>
+<dt>powm1</dt>
+<dt>hypot</dt>
+<dt><a href="powers/ct_pow.html">Compile Time Power
of a Runtime Base</a></dt>
</dl></div>
</div>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/cbrt.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/cbrt.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/cbrt.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.powers.cbrt"></a><a class="link" href="cbrt.html" title="cbrt"> cbrt</a>
+<a name="math_toolkit.special.powers.cbrt"></a><a class="link" href="cbrt.html" title="cbrt">cbrt</a>
</h4></div></div></div>


@@ -52,14 +52,9 @@
 when x is an integer type and T otherwise.
 

- 
-
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- 
-
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
 

 Implemented using Halley iteration.
@@ -71,7 +66,7 @@
 <img src="../../../../graphs/cbrt.png" align="middle">
 
<a name="math_toolkit.special.powers.cbrt.accuracy"></a><h5>
-<a name="id1256526"></a>
+<a name="id1130261"></a>
 <a class="link" href="cbrt.html#math_toolkit.special.powers.cbrt.accuracy">Accuracy</a>
 </h5>

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

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/ct_pow.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/ct_pow.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/ct_pow.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.powers.ct_pow"></a><a class="link" href="ct_pow.html" title="Compile Time Power of a Runtime Base"> Compile Time Power
+<a name="math_toolkit.special.powers.ct_pow"></a><a class="link" href="ct_pow.html" title="Compile Time Power of a Runtime Base">Compile Time Power
 of a Runtime Base</a>
</h4></div></div></div>

@@ -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="id1258893"></a>
+<a name="id1131426"></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="id1259154"></a>
+<a name="id1131688"></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="id1259427"></a>
+<a name="id1131960"></a>
 <a class="link" href="ct_pow.html#math_toolkit.special.powers.ct_pow.return_type">Return Type</a>
 </h5>

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

- 
-
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- 
-
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
 
<a name="math_toolkit.special.powers.ct_pow.error_handling"></a><h5>
-<a name="id1259550"></a>
+<a name="id1132080"></a>
 <a class="link" href="ct_pow.html#math_toolkit.special.powers.ct_pow.error_handling">Error
 Handling</a>
 </h5>
@@ -232,7 +227,7 @@
double result = pow<-5>(base);
</pre>
<a name="math_toolkit.special.powers.ct_pow.acknowledgements"></a><h5>
-<a name="id1261278"></a>
+<a name="id1134013"></a>
 <a class="link" href="ct_pow.html#math_toolkit.special.powers.ct_pow.acknowledgements">Acknowledgements</a>
 </h5>

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

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/expm1.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/expm1.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/expm1.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.powers.expm1"></a><a class="link" href="expm1.html" title="expm1"> expm1</a>
+<a name="math_toolkit.special.powers.expm1"></a><a class="link" href="expm1.html" title="expm1">expm1</a>
</h4></div></div></div>


@@ -52,14 +52,9 @@
 when x is an integer type and T otherwise.
 

- 
-
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- 
-
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
 

 For small x, then <code class="computeroutput">ex</code> is very close to 1, as a result calculating <code class="computeroutput">ex - 1</code> results in
@@ -80,7 +75,7 @@
 <img src="../../../../graphs/expm1.png" align="middle">
 
<a name="math_toolkit.special.powers.expm1.accuracy"></a><h5>
-<a name="id1256183"></a>
+<a name="id1128672"></a>
 <a class="link" href="expm1.html#math_toolkit.special.powers.expm1.accuracy">Accuracy</a>
 </h5>

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

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/hypot.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/hypot.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/hypot.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.powers.hypot"></a><a class="link" href="hypot.html" title="hypot"> hypot</a>
+<a name="math_toolkit.special.powers.hypot"></a><a class="link" href="hypot.html" title="hypot">hypot</a>
</h4></div></div></div>
<pre class="programlisting">template <class T1, class T2>
<a class="link" href="../../main_overview/result_type.html" title="Calculation of the Type of the Result">calculated-result-type</a> hypot(T1 x, T2 y);
@@ -43,14 +43,9 @@
 types.
 

- 
-
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- 
-
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
 

 When calculating <img src="../../../../equations/hypot.png"> it's quite easy for the intermediate terms to
@@ -58,7 +53,7 @@
 representable.
 
<a name="math_toolkit.special.powers.hypot.implementation"></a><h5>
-<a name="id1258809"></a>
+<a name="id1131342"></a>
 <a class="link" href="hypot.html#math_toolkit.special.powers.hypot.implementation">Implementation</a>
 </h5>

@@ -67,7 +62,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:

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/log1p.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/log1p.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/log1p.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.powers.log1p"></a><a class="link" href="log1p.html" title="log1p"> log1p</a>
+<a name="math_toolkit.special.powers.log1p"></a><a class="link" href="log1p.html" title="log1p">log1p</a>
</h4></div></div></div>


@@ -52,14 +52,9 @@
 when x is an integer type and T otherwise.
 

- 
-
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- 
-
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
 

 There are many situations where it is desirable to compute <code class="computeroutput">log(x+1)</code>. However, for small <code class="computeroutput">x</code>
@@ -93,7 +88,7 @@
 <img src="../../../../graphs/log1p.png" align="middle">
 
<a name="math_toolkit.special.powers.log1p.accuracy"></a><h5>
-<a name="id1255778"></a>
+<a name="id1128270"></a>
 <a class="link" href="log1p.html#math_toolkit.special.powers.log1p.accuracy">Accuracy</a>
 </h5>

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

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/powm1.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/powm1.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/powm1.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.powers.powm1"></a><a class="link" href="powm1.html" title="powm1"> powm1</a>
+<a name="math_toolkit.special.powers.powm1"></a><a class="link" href="powm1.html" title="powm1">powm1</a>
</h4></div></div></div>


@@ -51,14 +51,9 @@
 type calculation rules</a> when T1 and T2 are dufferent types.
 

- 
-
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- 
-
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
 

 There are two domains where this is useful: when y is very small, or when
@@ -74,14 +69,14 @@
 <img src="../../../../graphs/powm1.png" align="middle">
 
<a name="math_toolkit.special.powers.powm1.accuracy"></a><h5>
-<a name="id1258505"></a>
+<a name="id1131042"></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="id1258522"></a>
+<a name="id1131059"></a>
 <a class="link" href="powm1.html#math_toolkit.special.powers.powm1.testing">Testing</a>
 </h5>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/sqrt1pm1.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/sqrt1pm1.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/powers/sqrt1pm1.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.powers.sqrt1pm1"></a><a class="link" href="sqrt1pm1.html" title="sqrt1pm1"> sqrt1pm1</a>
+<a name="math_toolkit.special.powers.sqrt1pm1"></a><a class="link" href="sqrt1pm1.html" title="sqrt1pm1">sqrt1pm1</a>
</h4></div></div></div>


@@ -52,14 +52,9 @@
 when x is an integer type and T otherwise.
 

- 
-
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- 
-
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
 

 This function is useful when you need the difference between sqrt(x) and
@@ -76,7 +71,7 @@
 <img src="../../../../graphs/sqrt1pm1.png" align="middle">
 
<a name="math_toolkit.special.powers.sqrt1pm1.accuracy"></a><h5>
-<a name="id1258109"></a>
+<a name="id1130650"></a>
 <a class="link" href="sqrt1pm1.html#math_toolkit.special.powers.sqrt1pm1.accuracy">Accuracy</a>
 </h5>

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

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,15 +24,15 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.special.sf_beta"></a><a class="link" href="sf_beta.html" title="Beta Functions"> Beta Functions</a>
+<a name="math_toolkit.special.sf_beta"></a><a class="link" href="sf_beta.html" title="Beta Functions">Beta Functions</a>
</h3></div></div></div>
<div class="toc"><dl>
-<dt> Beta</dt>
-<dt><a href="sf_beta/ibeta_function.html"> Incomplete
+<dt>Beta</dt>
+<dt><a href="sf_beta/ibeta_function.html">Incomplete
 Beta Functions</a></dt>
-<dt><a href="sf_beta/ibeta_inv_function.html"> The
+<dt><a href="sf_beta/ibeta_inv_function.html">The
 Incomplete Beta Function Inverses</a></dt>
-<dt><a href="sf_beta/beta_derivative.html"> Derivative
+<dt><a href="sf_beta/beta_derivative.html">Derivative
 of the Incomplete Beta Function</a></dt>
</dl></div>
</div>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta/beta_derivative.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta/beta_derivative.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta/beta_derivative.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.sf_beta.beta_derivative"></a><a class="link" href="beta_derivative.html" title="Derivative of the Incomplete Beta Function"> Derivative
+<a name="math_toolkit.special.sf_beta.beta_derivative"></a><a class="link" href="beta_derivative.html" title="Derivative of the Incomplete Beta Function">Derivative
 of the Incomplete Beta Function</a>
</h4></div></div></div>
<a name="math_toolkit.special.sf_beta.beta_derivative.synopsis"></a><h5>
-<a name="id1214096"></a>
+<a name="id1088068"></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="id1215694"></a>
+<a name="id1088403"></a>
 <a class="link" href="beta_derivative.html#math_toolkit.special.sf_beta.beta_derivative.description">Description</a>
 </h5>

@@ -66,24 +66,19 @@
 types.
 

- 
-
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- 
-
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
 
<a name="math_toolkit.special.sf_beta.beta_derivative.accuracy"></a><h5>
-<a name="id1215774"></a>
+<a name="id1088479"></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="id1215799"></a>
+<a name="id1088504"></a>
 <a class="link" href="beta_derivative.html#math_toolkit.special.sf_beta.beta_derivative.implementation">Implementation</a>
 </h5>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta/beta_function.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta/beta_function.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta/beta_function.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,10 +24,10 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.sf_beta.beta_function"></a><a class="link" href="beta_function.html" title="Beta"> Beta</a>
+<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="id1201950"></a>
+<a name="id1074501"></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="id1202230"></a>
+<a name="id1074781"></a>
 <a class="link" href="beta_function.html#math_toolkit.special.sf_beta.beta_function.description">Description</a>
 </h5>

@@ -61,14 +61,9 @@
 <img src="../../../../graphs/beta.png" align="middle">
 

- 
-
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- 
-
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
 

 There are effectively two versions of this function internally: a fully
@@ -86,7 +81,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="id1202341"></a>
+<a name="id1074889"></a>
 <a class="link" href="beta_function.html#math_toolkit.special.sf_beta.beta_function.accuracy">Accuracy</a>
 </h5>

@@ -244,7 +239,7 @@
 very small.
 
<a name="math_toolkit.special.sf_beta.beta_function.testing"></a><h5>
-<a name="id1202605"></a>
+<a name="id1075153"></a>
 <a class="link" href="beta_function.html#math_toolkit.special.sf_beta.beta_function.testing">Testing</a>
 </h5>

@@ -253,7 +248,7 @@
 at 1000-bit precision.
 
<a name="math_toolkit.special.sf_beta.beta_function.implementation"></a><h5>
-<a name="id1202629"></a>
+<a name="id1075177"></a>
 <a class="link" href="beta_function.html#math_toolkit.special.sf_beta.beta_function.implementation">Implementation</a>
 </h5>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta/ibeta_function.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta/ibeta_function.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta/ibeta_function.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.sf_beta.ibeta_function"></a><a class="link" href="ibeta_function.html" title="Incomplete Beta Functions"> Incomplete
+<a name="math_toolkit.special.sf_beta.ibeta_function"></a><a class="link" href="ibeta_function.html" title="Incomplete Beta Functions">Incomplete
 Beta Functions</a>
</h4></div></div></div>
<a name="math_toolkit.special.sf_beta.ibeta_function.synopsis"></a><h5>
-<a name="id1202863"></a>
+<a name="id1075411"></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="id1204024"></a>
+<a name="id1077596"></a>
 <a class="link" href="ibeta_function.html#math_toolkit.special.sf_beta.ibeta_function.description">Description</a>
 </h5>

@@ -99,14 +99,9 @@
 types.
 

- 
-
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- 
-
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
 
<pre class="programlisting">template <class T1, class T2, class T3>
<a class="link" href="../../main_overview/result_type.html" title="Calculation of the Type of the Result">calculated-result-type</a> ibeta(T1 a, T2 b, T3 x);
@@ -163,7 +158,7 @@
 <img src="../../../../equations/ibeta2.png">
 
<a name="math_toolkit.special.sf_beta.ibeta_function.accuracy"></a><h5>
-<a name="id1205199"></a>
+<a name="id1078767"></a>
 <a class="link" href="ibeta_function.html#math_toolkit.special.sf_beta.ibeta_function.accuracy">Accuracy</a>
 </h5>

@@ -274,13 +269,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 +302,7 @@
 </td>
<td>
 
- Peak~5x104 Mean=3x103
+ Peak~5x104 Mean=3x103 
 
 </td>
</tr>
@@ -334,7 +329,7 @@
 </td>
<td>
 
- Peak~5x104 Mean=3x103
+ Peak~5x104 Mean=3x103 
 
 </td>
</tr>
@@ -361,7 +356,7 @@
 </td>
<td>
 
- Peak~2x104 Mean=1x103
+ Peak~2x104 Mean=1x103 
 
 </td>
</tr>
@@ -447,7 +442,7 @@
 </td>
<td>
 
- Peak=3x103 Mean=159
+ Peak=3x103 Mean=159
 
 </td>
</tr>
@@ -474,7 +469,7 @@
 </td>
<td>
 
- Peak~9x104 Mean=3x103
+ Peak~9x104 Mean=3x103 
 
 </td>
</tr>
@@ -501,7 +496,7 @@
 </td>
<td>
 
- Peak~9x104 Mean=3x103
+ Peak~9x104 Mean=3x103 
 
 </td>
</tr>
@@ -528,7 +523,7 @@
 </td>
<td>
 
- Peak~3x104 Mean=1x103
+ Peak~3x104 Mean=1x103 
 
 </td>
</tr>
@@ -641,7 +636,7 @@
 </td>
<td>
 
- Peak~7x104 Mean=3x103
+ Peak~7x104 Mean=3x103 
 
 </td>
</tr>
@@ -668,7 +663,7 @@
 </td>
<td>
 
- Peak~7x104 Mean=3x103
+ Peak~7x104 Mean=3x103 
 
 </td>
</tr>
@@ -695,7 +690,7 @@
 </td>
<td>
 
- Peak~6x104 Mean=3x103
+ Peak~6x104 Mean=3x103 
 
 </td>
</tr>
@@ -781,7 +776,7 @@
 </td>
<td>
 
- Peak=4x103 Mean=113
+ Peak=4x103 Mean=113
 
 </td>
</tr>
@@ -808,7 +803,7 @@
 </td>
<td>
 
- Peak~1x105 Mean=5x103
+ Peak~1x105 Mean=5x103 
 
 </td>
</tr>
@@ -835,7 +830,7 @@
 </td>
<td>
 
- Peak~1x105 Mean=5x103
+ Peak~1x105 Mean=5x103 
 
 </td>
</tr>
@@ -862,7 +857,7 @@
 </td>
<td>
 
- Peak~9x104 Mean=5x103
+ Peak~9x104 Mean=5x103 
 
 </td>
</tr>
@@ -870,7 +865,7 @@
</table></div>
</div>
 <a name="math_toolkit.special.sf_beta.ibeta_function.testing"></a><h5>
-<a name="id1208082"></a>
+<a name="id1081104"></a>
 <a class="link" href="ibeta_function.html#math_toolkit.special.sf_beta.ibeta_function.testing">Testing</a>
 </h5>

@@ -888,7 +883,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="id1208118"></a>
+<a name="id1081140"></a>
 <a class="link" href="ibeta_function.html#math_toolkit.special.sf_beta.ibeta_function.implementation">Implementation</a>
 </h5>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta/ibeta_inv_function.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta/ibeta_inv_function.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_beta/ibeta_inv_function.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.sf_beta.ibeta_inv_function"></a><a class="link" href="ibeta_inv_function.html" title="The Incomplete Beta Function Inverses"> The
+<a name="math_toolkit.special.sf_beta.ibeta_inv_function"></a><a class="link" href="ibeta_inv_function.html" title="The Incomplete Beta Function Inverses">The
 Incomplete Beta Function Inverses</a>
</h4></div></div></div>

@@ -87,7 +87,7 @@
}} // namespaces
</pre>
<a name="math_toolkit.special.sf_beta.ibeta_inv_function.description"></a><h5>
-<a name="id1210464"></a>
+<a name="id1083475"></a>
 <a class="link" href="ibeta_inv_function.html#math_toolkit.special.sf_beta.ibeta_inv_function.description">Description</a>
 </h5>

@@ -97,14 +97,9 @@
 incomplete beta (p) or its complement (q).
 

- 
-
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- 
-
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
 
<div class="tip"><table border="0" summary="Tip">
<tr>
@@ -166,14 +161,9 @@
 1.
 

- 
-
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- 
-
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
 
<pre class="programlisting">template <class T1, class T2, class T3>
<a class="link" href="../../main_overview/result_type.html" title="Calculation of the Type of the Result">calculated-result-type</a> ibetac_inv(T1 a, T2 b, T3 q);
@@ -209,14 +199,9 @@
 1.
 

- 
-
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- 
-
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
 
<pre class="programlisting">template <class T1, class T2, class T3>
<a class="link" href="../../main_overview/result_type.html" title="Calculation of the Type of the Result">calculated-result-type</a> ibeta_inva(T1 b, T2 x, T3 p);
@@ -235,14 +220,9 @@
 and 0 <= p <= 1.
 

- 
-
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- 
-
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
 
<pre class="programlisting">template <class T1, class T2, class T3>
<a class="link" href="../../main_overview/result_type.html" title="Calculation of the Type of the Result">calculated-result-type</a> ibetac_inva(T1 b, T2 x, T3 p);
@@ -261,14 +241,9 @@
 and 0 <= q <= 1.
 

- 
-
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- 
-
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
 
<pre class="programlisting">template <class T1, class T2, class T3>
<a class="link" href="../../main_overview/result_type.html" title="Calculation of the Type of the Result">calculated-result-type</a> ibeta_invb(T1 b, T2 x, T3 p);
@@ -287,14 +262,9 @@
 and 0 <= p <= 1.
 

- 
-
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- 
-
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
 
<pre class="programlisting">template <class T1, class T2, class T3>
<a class="link" href="../../main_overview/result_type.html" title="Calculation of the Type of the Result">calculated-result-type</a> ibetac_invb(T1 b, T2 x, T3 p);
@@ -313,17 +283,12 @@
 and 0 <= q <= 1.
 

- 
-
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- 
-
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
 
<a name="math_toolkit.special.sf_beta.ibeta_inv_function.accuracy"></a><h5>
-<a name="id1213308"></a>
+<a name="id1086163"></a>
 <a class="link" href="ibeta_inv_function.html#math_toolkit.special.sf_beta.ibeta_inv_function.accuracy">Accuracy</a>
 </h5>

@@ -335,7 +300,7 @@
 or <code class="computeroutput">1</code>.
 
<a name="math_toolkit.special.sf_beta.ibeta_inv_function.testing"></a><h5>
-<a name="id1213349"></a>
+<a name="id1086204"></a>
 <a class="link" href="ibeta_inv_function.html#math_toolkit.special.sf_beta.ibeta_inv_function.testing">Testing</a>
 </h5>

@@ -359,7 +324,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="id1213405"></a>
+<a name="id1086260"></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 +492,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="id1214034"></a>
+<a name="id1088006"></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>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_erf.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_erf.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_erf.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,12 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.special.sf_erf"></a><a class="link" href="sf_erf.html" title="Error Functions"> Error Functions</a>
+<a name="math_toolkit.special.sf_erf"></a><a class="link" href="sf_erf.html" title="Error Functions">Error Functions</a>
</h3></div></div></div>
<div class="toc"><dl>
-<dt><a href="sf_erf/error_function.html"> Error
- Functions</a></dt>
-<dt><a href="sf_erf/error_inv.html"> Error Function
+<dt>Error Functions</dt>
+<dt><a href="sf_erf/error_inv.html">Error Function
Inverses</a></dt>
</dl></div>
</div>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_erf/error_function.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_erf/error_function.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_erf/error_function.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,11 +24,10 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.sf_erf.error_function"></a><a class="link" href="error_function.html" title="Error Functions"> Error
- Functions</a>
+<a name="math_toolkit.special.sf_erf.error_function"></a><a class="link" href="error_function.html" title="Error Functions">Error Functions</a>
</h4></div></div></div>
<a name="math_toolkit.special.sf_erf.error_function.synopsis"></a><h5>
-<a name="id1215844"></a>
+<a name="id1088550"></a>
 <a class="link" href="error_function.html#math_toolkit.special.sf_erf.error_function.synopsis">Synopsis</a>
 </h5>

@@ -59,17 +58,12 @@
 type calculation rules</a>: the return type is <code class="computeroutput">double</code> if T is an integer type, and T otherwise.
 

- 
-
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- 
-
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
 
<a name="math_toolkit.special.sf_erf.error_function.description"></a><h5>
-<a name="id1216227"></a>
+<a name="id1088929"></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 +100,7 @@
 <img src="../../../../graphs/erfc.png" align="middle">
 
<a name="math_toolkit.special.sf_erf.error_function.accuracy"></a><h5>
-<a name="id1216615"></a>
+<a name="id1089316"></a>
 <a class="link" href="error_function.html#math_toolkit.special.sf_erf.error_function.accuracy">Accuracy</a>
 </h5>

@@ -531,7 +525,7 @@
</table></div>
</div>
 <a name="math_toolkit.special.sf_erf.error_function.testing"></a><h5>
-<a name="id1217366"></a>
+<a name="id1090241"></a>
 <a class="link" href="error_function.html#math_toolkit.special.sf_erf.error_function.testing">Testing</a>
 </h5>

@@ -546,7 +540,7 @@
 check.
 
<a name="math_toolkit.special.sf_erf.error_function.implementation"></a><h5>
-<a name="id1217395"></a>
+<a name="id1090270"></a>
 <a class="link" href="error_function.html#math_toolkit.special.sf_erf.error_function.implementation">Implementation</a>
 </h5>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_erf/error_inv.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_erf/error_inv.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_erf/error_inv.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.sf_erf.error_inv"></a><a class="link" href="error_inv.html" title="Error Function Inverses"> Error Function
+<a name="math_toolkit.special.sf_erf.error_inv"></a><a class="link" href="error_inv.html" title="Error Function Inverses">Error Function
 Inverses</a>
</h4></div></div></div>
<a name="math_toolkit.special.sf_erf.error_inv.synopsis"></a><h5>
-<a name="id1219225"></a>
+<a name="id1091000"></a>
 <a class="link" href="error_inv.html#math_toolkit.special.sf_erf.error_inv.synopsis">Synopsis</a>
 </h5>

@@ -59,17 +59,12 @@
 type calculation rules</a>: the return type is <code class="computeroutput">double</code> if T is an integer type, and T otherwise.
 

- 
-
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- 
-
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
 
<a name="math_toolkit.special.sf_erf.error_inv.description"></a><h5>
-<a name="id1219608"></a>
+<a name="id1091379"></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 +98,7 @@
 <img src="../../../../graphs/erfc_inv.png" align="middle">
 
<a name="math_toolkit.special.sf_erf.error_inv.accuracy"></a><h5>
-<a name="id1219995"></a>
+<a name="id1091766"></a>
 <a class="link" href="error_inv.html#math_toolkit.special.sf_erf.error_inv.accuracy">Accuracy</a>
 </h5>

@@ -113,7 +108,7 @@
 error functions</a>.
 
<a name="math_toolkit.special.sf_erf.error_inv.testing"></a><h5>
-<a name="id1220017"></a>
+<a name="id1091788"></a>
 <a class="link" href="error_inv.html#math_toolkit.special.sf_erf.error_inv.testing">Testing</a>
 </h5>

@@ -136,7 +131,7 @@
 </li>
</ul></div>
<a name="math_toolkit.special.sf_erf.error_inv.implementation"></a><h5>
-<a name="id1220066"></a>
+<a name="id1091837"></a>
 <a class="link" href="error_inv.html#math_toolkit.special.sf_erf.error_inv.implementation">Implementation</a>
 </h5>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,19 +24,19 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.special.sf_gamma"></a><a class="link" href="sf_gamma.html" title="Gamma Functions"> Gamma Functions</a>
+<a name="math_toolkit.special.sf_gamma"></a><a class="link" href="sf_gamma.html" title="Gamma Functions">Gamma Functions</a>
</h3></div></div></div>
<div class="toc"><dl>
-<dt> Gamma</dt>
-<dt> Log Gamma</dt>
-<dt> Digamma</dt>
-<dt><a href="sf_gamma/gamma_ratios.html"> Ratios
+<dt>Gamma</dt>
+<dt>Log Gamma</dt>
+<dt>Digamma</dt>
+<dt><a href="sf_gamma/gamma_ratios.html">Ratios
 of Gamma Functions</a></dt>
-<dt><a href="sf_gamma/igamma.html"> Incomplete Gamma
+<dt><a href="sf_gamma/igamma.html">Incomplete Gamma
 Functions</a></dt>
-<dt><a href="sf_gamma/igamma_inv.html"> Incomplete
+<dt><a href="sf_gamma/igamma_inv.html">Incomplete
 Gamma Function Inverses</a></dt>
-<dt><a href="sf_gamma/gamma_derivatives.html"> Derivative
+<dt><a href="sf_gamma/gamma_derivatives.html">Derivative
 of the Incomplete Gamma Function</a></dt>
</dl></div>
</div>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/digamma.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/digamma.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/digamma.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,10 +24,10 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.sf_gamma.digamma"></a><a class="link" href="digamma.html" title="Digamma"> Digamma</a>
+<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="id1182201"></a>
+<a name="id1056449"></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="id1182428"></a>
+<a name="id1056676"></a>
 <a class="link" href="digamma.html#math_toolkit.special.sf_gamma.digamma.description">Description</a>
 </h5>

@@ -62,14 +62,9 @@
 <img src="../../../../graphs/digamma.png" align="middle">
 

- 
-
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- 
-
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
 

 There is no fully generic version of this function: all the implementations
@@ -82,7 +77,7 @@
 T otherwise.
 
<a name="math_toolkit.special.sf_gamma.digamma.accuracy"></a><h5>
-<a name="id1182536"></a>
+<a name="id1056780"></a>
 <a class="link" href="digamma.html#math_toolkit.special.sf_gamma.digamma.accuracy">Accuracy</a>
 </h5>

@@ -270,7 +265,7 @@
 absolute error will remain very low.
 
<a name="math_toolkit.special.sf_gamma.digamma.testing"></a><h5>
-<a name="id1182839"></a>
+<a name="id1057084"></a>
 <a class="link" href="digamma.html#math_toolkit.special.sf_gamma.digamma.testing">Testing</a>
 </h5>

@@ -280,7 +275,7 @@
 see below).
 
<a name="math_toolkit.special.sf_gamma.digamma.implementation"></a><h5>
-<a name="id1182861"></a>
+<a name="id1057105"></a>
 <a class="link" href="digamma.html#math_toolkit.special.sf_gamma.digamma.implementation">Implementation</a>
 </h5>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/gamma_derivatives.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/gamma_derivatives.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/gamma_derivatives.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.sf_gamma.gamma_derivatives"></a><a class="link" href="gamma_derivatives.html" title="Derivative of the Incomplete Gamma Function"> Derivative
+<a name="math_toolkit.special.sf_gamma.gamma_derivatives"></a><a class="link" href="gamma_derivatives.html" title="Derivative of the Incomplete Gamma Function">Derivative
 of the Incomplete Gamma Function</a>
</h4></div></div></div>
<a name="math_toolkit.special.sf_gamma.gamma_derivatives.synopsis"></a><h5>
-<a name="id1192192"></a>
+<a name="id1067184"></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="id1194662"></a>
+<a name="id1067469"></a>
 <a class="link" href="gamma_derivatives.html#math_toolkit.special.sf_gamma.gamma_derivatives.description">Description</a>
 </h5>

@@ -61,14 +61,9 @@
 <img src="../../../../equations/derivative1.png">
 

- 
-
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- 
-
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
 

 Note that the derivative of the function <a class="link" href="igamma.html" title="Incomplete Gamma Functions">gamma_q</a>
@@ -80,7 +75,7 @@
 otherwise the return type is simply T1.
 
<a name="math_toolkit.special.sf_gamma.gamma_derivatives.accuracy"></a><h5>
-<a name="id1194746"></a>
+<a name="id1067549"></a>
 <a class="link" href="gamma_derivatives.html#math_toolkit.special.sf_gamma.gamma_derivatives.accuracy">Accuracy</a>
 </h5>

@@ -88,7 +83,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="id1194774"></a>
+<a name="id1067577"></a>
 <a class="link" href="gamma_derivatives.html#math_toolkit.special.sf_gamma.gamma_derivatives.implementation">Implementation</a>
 </h5>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/gamma_ratios.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/gamma_ratios.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/gamma_ratios.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.sf_gamma.gamma_ratios"></a><a class="link" href="gamma_ratios.html" title="Ratios of Gamma Functions"> Ratios
+<a name="math_toolkit.special.sf_gamma.gamma_ratios"></a><a class="link" href="gamma_ratios.html" title="Ratios of Gamma Functions">Ratios
 of Gamma Functions</a>
</h4></div></div></div>

@@ -51,7 +51,7 @@
}} // namespaces
</pre>
<a name="math_toolkit.special.sf_gamma.gamma_ratios.description"></a><h5>
-<a name="id1183823"></a>
+<a name="id1059262"></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>
@@ -67,14 +67,9 @@
 <img src="../../../../equations/gamma_ratio0.png">
 

- 
-
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- 
-
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
 

 Internally this just calls <code class="computeroutput">tgamma_delta_ratio(a,
@@ -93,14 +88,9 @@
 <img src="../../../../equations/gamma_ratio1.png">
 

- 
-
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- 
-
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
 

 Note that the result is calculated accurately even when delta
@@ -117,7 +107,7 @@
 <img src="../../../../graphs/tgamma_delta_ratio.png" align="middle">
 
<a name="math_toolkit.special.sf_gamma.gamma_ratios.accuracy"></a><h5>
-<a name="id1186052"></a>
+<a name="id1059811"></a>
 <a class="link" href="gamma_ratios.html#math_toolkit.special.sf_gamma.gamma_ratios.accuracy">Accuracy</a>
 </h5>

@@ -327,7 +317,7 @@
</table></div>
</div>
 <a name="math_toolkit.special.sf_gamma.gamma_ratios.testing"></a><h5>
-<a name="id1186394"></a>
+<a name="id1060153"></a>
 <a class="link" href="gamma_ratios.html#math_toolkit.special.sf_gamma.gamma_ratios.testing">Testing</a>
 </h5>

@@ -336,7 +326,7 @@
 a deliberately naive calculation of Γ(x)/Γ(y).
 
<a name="math_toolkit.special.sf_gamma.gamma_ratios.implementation"></a><h5>
-<a name="id1186418"></a>
+<a name="id1060177"></a>
 <a class="link" href="gamma_ratios.html#math_toolkit.special.sf_gamma.gamma_ratios.implementation">Implementation</a>
 </h5>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/igamma.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/igamma.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/igamma.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.sf_gamma.igamma"></a><a class="link" href="igamma.html" title="Incomplete Gamma Functions"> Incomplete Gamma
+<a name="math_toolkit.special.sf_gamma.igamma"></a><a class="link" href="igamma.html" title="Incomplete Gamma Functions">Incomplete Gamma
 Functions</a>
</h4></div></div></div>
<a name="math_toolkit.special.sf_gamma.igamma.synopsis"></a><h5>
-<a name="id1186460"></a>
+<a name="id1060219"></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="id1187265"></a>
+<a name="id1061093"></a>
 <a class="link" href="igamma.html#math_toolkit.special.sf_gamma.igamma.description">Description</a>
 </h5>

@@ -83,14 +83,9 @@
 >= 0, otherwise they return the result of <a class="link" href="../../main_overview/error_handling.html#domain_error">domain_error</a>.
 

- 
-
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- 
-
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
 

 The return type of these functions is computed using the <a class="link" href="../../main_overview/result_type.html" title="Calculation of the Type of the Result">result
@@ -160,7 +155,7 @@
 <img src="../../../../equations/igamma1.png">
 
<a name="math_toolkit.special.sf_gamma.igamma.accuracy"></a><h5>
-<a name="id1188234"></a>
+<a name="id1062050"></a>
 <a class="link" href="igamma.html#math_toolkit.special.sf_gamma.igamma.accuracy">Accuracy</a>
 </h5>

@@ -828,7 +823,7 @@
</table></div>
</div>
 <a name="math_toolkit.special.sf_gamma.igamma.testing"></a><h5>
-<a name="id1189377"></a>
+<a name="id1063193"></a>
 <a class="link" href="igamma.html#math_toolkit.special.sf_gamma.igamma.testing">Testing</a>
 </h5>

@@ -844,7 +839,7 @@
 fraction (see below) is unstable for small a and z.
 
<a name="math_toolkit.special.sf_gamma.igamma.implementation"></a><h5>
-<a name="id1189404"></a>
+<a name="id1063235"></a>
 <a class="link" href="igamma.html#math_toolkit.special.sf_gamma.igamma.implementation">Implementation</a>
 </h5>

@@ -1013,7 +1008,7 @@
 by Temme (see references below).
 
<a name="math_toolkit.special.sf_gamma.igamma.references"></a><h5>
-<a name="id1190164"></a>
+<a name="id1063976"></a>
 <a class="link" href="igamma.html#math_toolkit.special.sf_gamma.igamma.references">References</a>
 </h5>
<div class="itemizedlist"><ul type="disc">

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/igamma_inv.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/igamma_inv.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/igamma_inv.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.sf_gamma.igamma_inv"></a><a class="link" href="igamma_inv.html" title="Incomplete Gamma Function Inverses"> Incomplete
+<a name="math_toolkit.special.sf_gamma.igamma_inv"></a><a class="link" href="igamma_inv.html" title="Incomplete Gamma Function Inverses">Incomplete
 Gamma Function Inverses</a>
</h4></div></div></div>
<a name="math_toolkit.special.sf_gamma.igamma_inv.synopsis"></a><h5>
-<a name="id1190226"></a>
+<a name="id1064037"></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="id1191031"></a>
+<a name="id1064842"></a>
 <a class="link" href="igamma_inv.html#math_toolkit.special.sf_gamma.igamma_inv.description">Description</a>
 </h5>

@@ -83,14 +83,9 @@
 otherwise the return type is simply T1.
 

- 
-
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- 
-
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
 
<div class="tip"><table border="0" summary="Tip">
<tr>
@@ -173,7 +168,7 @@
 0.
 
<a name="math_toolkit.special.sf_gamma.igamma_inv.accuracy"></a><h5>
-<a name="id1192044"></a>
+<a name="id1067035"></a>
 <a class="link" href="igamma_inv.html#math_toolkit.special.sf_gamma.igamma_inv.accuracy">Accuracy</a>
 </h5>

@@ -187,7 +182,7 @@
 functions.
 
<a name="math_toolkit.special.sf_gamma.igamma_inv.testing"></a><h5>
-<a name="id1192070"></a>
+<a name="id1067062"></a>
 <a class="link" href="igamma_inv.html#math_toolkit.special.sf_gamma.igamma_inv.testing">Testing</a>
 </h5>

@@ -211,7 +206,7 @@
 </li>
</ul></div>
<a name="math_toolkit.special.sf_gamma.igamma_inv.implementation"></a><h5>
-<a name="id1192126"></a>
+<a name="id1067118"></a>
 <a class="link" href="igamma_inv.html#math_toolkit.special.sf_gamma.igamma_inv.implementation">Implementation</a>
 </h5>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/lgamma.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/lgamma.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/lgamma.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,10 +24,10 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.sf_gamma.lgamma"></a><a class="link" href="lgamma.html" title="Log Gamma"> Log Gamma</a>
+<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="id1179962"></a>
+<a name="id1054015"></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="id1180345"></a>
+<a name="id1054398"></a>
 <a class="link" href="lgamma.html#math_toolkit.special.sf_gamma.lgamma.description">Description</a>
 </h5>

@@ -69,14 +69,9 @@
 non-null is set on output to the sign of tgamma(z).
 

- 
-
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- 
-
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
 

 <img src="../../../../graphs/lgamma.png" align="middle">
@@ -98,7 +93,7 @@
 T otherwise.
 
<a name="math_toolkit.special.sf_gamma.lgamma.accuracy"></a><h5>
-<a name="id1180472"></a>
+<a name="id1054522"></a>
 <a class="link" href="lgamma.html#math_toolkit.special.sf_gamma.lgamma.accuracy">Accuracy</a>
 </h5>

@@ -349,7 +344,7 @@
</tbody>
</table></div>
<a name="math_toolkit.special.sf_gamma.lgamma.testing"></a><h5>
-<a name="id1180936"></a>
+<a name="id1055674"></a>
 <a class="link" href="lgamma.html#math_toolkit.special.sf_gamma.lgamma.testing">Testing</a>
 </h5>

@@ -360,7 +355,7 @@
 Random tests in key problem areas are also used.
 
<a name="math_toolkit.special.sf_gamma.lgamma.implementation"></a><h5>
-<a name="id1180956"></a>
+<a name="id1055694"></a>
 <a class="link" href="lgamma.html#math_toolkit.special.sf_gamma.lgamma.implementation">Implementation</a>
 </h5>

@@ -390,7 +385,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 +455,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>.

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/tgamma.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/tgamma.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_gamma/tgamma.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,10 +24,10 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.sf_gamma.tgamma"></a><a class="link" href="tgamma.html" title="Gamma"> Gamma</a>
+<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="id1176952"></a>
+<a name="id1050341"></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="id1177301"></a>
+<a name="id1052608"></a>
 <a class="link" href="tgamma.html#math_toolkit.special.sf_gamma.tgamma.description">Description</a>
 </h5>
<pre class="programlisting">template <class T>
@@ -73,14 +73,9 @@
 <img src="../../../../graphs/tgamma.png" align="middle">
 

- 
-
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- 
-
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
 

 There are effectively two versions of the tgamma
@@ -119,17 +114,12 @@
 when T is an integer type, and T otherwise.
 

- 
-
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- 
-
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
 
<a name="math_toolkit.special.sf_gamma.tgamma.accuracy"></a><h5>
-<a name="id1177767"></a>
+<a name="id1053066"></a>
 <a class="link" href="tgamma.html#math_toolkit.special.sf_gamma.tgamma.accuracy">Accuracy</a>
 </h5>

@@ -384,7 +374,7 @@
</tbody>
</table></div>
<a name="math_toolkit.special.sf_gamma.tgamma.testing"></a><h5>
-<a name="id1179487"></a>
+<a name="id1053540"></a>
 <a class="link" href="tgamma.html#math_toolkit.special.sf_gamma.tgamma.testing">Testing</a>
 </h5>

@@ -399,7 +389,7 @@
 a lanczos approximation accurate to around 100 decimal digits.
 
<a name="math_toolkit.special.sf_gamma.tgamma.implementation"></a><h5>
-<a name="id1179544"></a>
+<a name="id1053596"></a>
 <a class="link" href="tgamma.html#math_toolkit.special.sf_gamma.tgamma.implementation">Implementation</a>
 </h5>

@@ -440,7 +430,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

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,15 +24,15 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.special.sf_poly"></a><a class="link" href="sf_poly.html" title="Polynomials"> Polynomials</a>
+<a name="math_toolkit.special.sf_poly"></a><a class="link" href="sf_poly.html" title="Polynomials">Polynomials</a>
</h3></div></div></div>
<div class="toc"><dl>
-<dt><a href="sf_poly/legendre.html"> Legendre (and
+<dt><a href="sf_poly/legendre.html">Legendre (and
Associated) Polynomials</a></dt>
-<dt><a href="sf_poly/laguerre.html"> Laguerre (and
+<dt><a href="sf_poly/laguerre.html">Laguerre (and
Associated) Polynomials</a></dt>
-<dt> Hermite Polynomials</dt>
-<dt> Spherical Harmonics</dt>
+<dt>Hermite Polynomials</dt>
+<dt>Spherical Harmonics</dt>
</dl></div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly/hermite.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly/hermite.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly/hermite.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,10 +24,10 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.sf_poly.hermite"></a><a class="link" href="hermite.html" title="Hermite Polynomials"> Hermite Polynomials</a>
+<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="id1229553"></a>
+<a name="id1102121"></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="id1229921"></a>
+<a name="id1102488"></a>
 <a class="link" href="hermite.html#math_toolkit.special.sf_poly.hermite.description">Description</a>
 </h5>

@@ -74,14 +74,9 @@
 <img src="../../../../equations/hermite_0.png">
 

- 
-
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- 
-
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
 

 The following graph illustrates the behaviour of the first few Hermite
@@ -136,7 +131,7 @@
</dl>
</div>
<a name="math_toolkit.special.sf_poly.hermite.accuracy"></a><h5>
-<a name="id1230678"></a>
+<a name="id1104335"></a>
 <a class="link" href="hermite.html#math_toolkit.special.sf_poly.hermite.accuracy">Accuracy</a>
 </h5>

@@ -253,7 +248,7 @@
 is very close to a root.
 
<a name="math_toolkit.special.sf_poly.hermite.testing"></a><h5>
-<a name="id1230935"></a>
+<a name="id1104517"></a>
 <a class="link" href="hermite.html#math_toolkit.special.sf_poly.hermite.testing">Testing</a>
 </h5>

@@ -263,7 +258,7 @@
 precision.
 
<a name="math_toolkit.special.sf_poly.hermite.implementation"></a><h5>
-<a name="id1230957"></a>
+<a name="id1104539"></a>
 <a class="link" href="hermite.html#math_toolkit.special.sf_poly.hermite.implementation">Implementation</a>
 </h5>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly/laguerre.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly/laguerre.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly/laguerre.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.sf_poly.laguerre"></a><a class="link" href="laguerre.html" title="Laguerre (and Associated) Polynomials"> Laguerre (and
+<a name="math_toolkit.special.sf_poly.laguerre"></a><a class="link" href="laguerre.html" title="Laguerre (and Associated) Polynomials">Laguerre (and
 Associated) Polynomials</a>
</h4></div></div></div>
<a name="math_toolkit.special.sf_poly.laguerre.synopsis"></a><h5>
-<a name="id1226922"></a>
+<a name="id1098418"></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="id1227591"></a>
+<a name="id1099088"></a>
 <a class="link" href="laguerre.html#math_toolkit.special.sf_poly.laguerre.description">Description</a>
 </h5>

@@ -72,14 +72,9 @@
 type.
 

- 
-
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- 
-
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
 
<pre class="programlisting">template <class T>
<a class="link" href="../../main_overview/result_type.html" title="Calculation of the Type of the Result">calculated-result-type</a> laguerre(unsigned n, T x);
@@ -210,7 +205,7 @@
</dl>
</div>
<a name="math_toolkit.special.sf_poly.laguerre.accuracy"></a><h5>
-<a name="id1229153"></a>
+<a name="id1101720"></a>
 <a class="link" href="laguerre.html#math_toolkit.special.sf_poly.laguerre.accuracy">Accuracy</a>
 </h5>

@@ -427,7 +422,7 @@
 is very close to a root.
 
<a name="math_toolkit.special.sf_poly.laguerre.testing"></a><h5>
-<a name="id1229504"></a>
+<a name="id1102072"></a>
 <a class="link" href="laguerre.html#math_toolkit.special.sf_poly.laguerre.testing">Testing</a>
 </h5>

@@ -437,7 +432,7 @@
 precision.
 
<a name="math_toolkit.special.sf_poly.laguerre.implementation"></a><h5>
-<a name="id1229526"></a>
+<a name="id1102093"></a>
 <a class="link" href="laguerre.html#math_toolkit.special.sf_poly.laguerre.implementation">Implementation</a>
 </h5>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly/legendre.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly/legendre.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly/legendre.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.sf_poly.legendre"></a><a class="link" href="legendre.html" title="Legendre (and Associated) Polynomials"> Legendre (and
+<a name="math_toolkit.special.sf_poly.legendre"></a><a class="link" href="legendre.html" title="Legendre (and Associated) Polynomials">Legendre (and
 Associated) Polynomials</a>
</h4></div></div></div>
<a name="math_toolkit.special.sf_poly.legendre.synopsis"></a><h5>
-<a name="id1220429"></a>
+<a name="id1092200"></a>
 <a class="link" href="legendre.html#math_toolkit.special.sf_poly.legendre.synopsis">Synopsis</a>
 </h5>

@@ -74,17 +74,12 @@
 type.
 

- 
-
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- 
-
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
 
<a name="math_toolkit.special.sf_poly.legendre.description"></a><h5>
-<a name="id1221571"></a>
+<a name="id1094297"></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 +287,7 @@
</dl>
</div>
<a name="math_toolkit.special.sf_poly.legendre.accuracy"></a><h5>
-<a name="id1223411"></a>
+<a name="id1097781"></a>
 <a class="link" href="legendre.html#math_toolkit.special.sf_poly.legendre.accuracy">Accuracy</a>
 </h5>

@@ -673,7 +668,7 @@
 given here.
 
<a name="math_toolkit.special.sf_poly.legendre.testing"></a><h5>
-<a name="id1226872"></a>
+<a name="id1098369"></a>
 <a class="link" href="legendre.html#math_toolkit.special.sf_poly.legendre.testing">Testing</a>
 </h5>

@@ -683,7 +678,7 @@
 precision.
 
<a name="math_toolkit.special.sf_poly.legendre.implementation"></a><h5>
-<a name="id1226894"></a>
+<a name="id1098391"></a>
 <a class="link" href="legendre.html#math_toolkit.special.sf_poly.legendre.implementation">Implementation</a>
 </h5>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly/sph_harm.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly/sph_harm.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly/sph_harm.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,10 +24,10 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.sf_poly.sph_harm"></a><a class="link" href="sph_harm.html" title="Spherical Harmonics"> Spherical Harmonics</a>
+<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="id1230985"></a>
+<a name="id1104566"></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="id1231809"></a>
+<a name="id1105391"></a>
 <a class="link" href="sph_harm.html#math_toolkit.special.sf_poly.sph_harm.description">Description</a>
 </h5>

@@ -68,14 +68,9 @@
 type calculation rules</a> when T1 and T2 are different types.
 

- 
-
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- 
-
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
 
<pre class="programlisting">template <class T1, class T2>
std::complex<<a class="link" href="../../main_overview/result_type.html" title="Calculation of the Type of the Result">calculated-result-type</a>> spherical_harmonic(unsigned n, int m, T1 theta, T2 phi);
@@ -102,8 +97,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 +112,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 +150,7 @@
 <img src="../../../../equations/spherical_2.png">
 
<a name="math_toolkit.special.sf_poly.sph_harm.accuracy"></a><h5>
-<a name="id1232727"></a>
+<a name="id1106328"></a>
 <a class="link" href="sph_harm.html#math_toolkit.special.sf_poly.sph_harm.accuracy">Accuracy</a>
 </h5>

@@ -276,7 +271,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="id1232919"></a>
+<a name="id1106520"></a>
 <a class="link" href="sph_harm.html#math_toolkit.special.sf_poly.sph_harm.testing">Testing</a>
 </h5>

@@ -286,7 +281,7 @@
 precision.
 
<a name="math_toolkit.special.sf_poly.sph_harm.implementation"></a><h5>
-<a name="id1232941"></a>
+<a name="id1106542"></a>
 <a class="link" href="sph_harm.html#math_toolkit.special.sf_poly.sph_harm.implementation">Implementation</a>
 </h5>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sinc.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sinc.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sinc.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.special.sinc"></a><a class="link" href="sinc.html" title="Sinus Cardinal and Hyperbolic Sinus Cardinal Functions"> Sinus Cardinal and Hyperbolic
+<a name="math_toolkit.special.sinc"></a><a class="link" href="sinc.html" title="Sinus Cardinal and Hyperbolic Sinus Cardinal Functions">Sinus Cardinal and Hyperbolic
Sinus Cardinal Functions</a>
</h3></div></div></div>
<div class="toc"><dl>
-<dt><a href="sinc/sinc_overview.html"> Sinus Cardinal
+<dt><a href="sinc/sinc_overview.html">Sinus Cardinal
and Hyperbolic Sinus Cardinal Functions Overview</a></dt>
<dt>sinc_pi</dt>
<dt>sinhc_pi</dt>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sinc/sinc_overview.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sinc/sinc_overview.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sinc/sinc_overview.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.sinc.sinc_overview"></a><a class="link" href="sinc_overview.html" title="Sinus Cardinal and Hyperbolic Sinus Cardinal Functions Overview"> Sinus Cardinal
+<a name="math_toolkit.special.sinc.sinc_overview"></a><a class="link" href="sinc_overview.html" title="Sinus Cardinal and Hyperbolic Sinus Cardinal Functions Overview">Sinus Cardinal
and Hyperbolic Sinus Cardinal Functions Overview</a>
</h4></div></div></div>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sinc/sinc_pi.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sinc/sinc_pi.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sinc/sinc_pi.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -59,14 +59,9 @@
 <img src="../../../../graphs/sinc_pi.png" align="middle">
 

- 
-
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- 
-
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
 
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sinc/sinhc_pi.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sinc/sinhc_pi.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/sinc/sinhc_pi.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -60,14 +60,9 @@
 type calculation rules</a> when T is an integer type.
 

- 
-
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- 
-
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
 

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

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/zetas.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/zetas.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/zetas.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,9 +24,9 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.special.zetas"></a><a class="link" href="zetas.html" title="Zeta Functions"> Zeta Functions</a>
+<a name="math_toolkit.special.zetas"></a><a class="link" href="zetas.html" title="Zeta Functions">Zeta Functions</a>
</h3></div></div></div>
-<div class="toc"><dl><dt> Riemann Zeta Function</dt></dl></div>
+<div class="toc"><dl><dt>Riemann Zeta Function</dt></dl></div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/zetas/zeta.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/zetas/zeta.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/special/zetas/zeta.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,10 +24,10 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.special.zetas.zeta"></a><a class="link" href="zeta.html" title="Riemann Zeta Function"> Riemann Zeta Function</a>
+<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="id1250846"></a>
+<a name="id1124388"></a>
 <a class="link" href="zeta.html#math_toolkit.special.zetas.zeta.synopsis">Synopsis</a>
 </h5>

@@ -52,17 +52,12 @@
 type calculation rules</a>: the return type is <code class="computeroutput">double</code> if T is an integer type, and T otherwise.
 

- 
-
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- 
-
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
 
<a name="math_toolkit.special.zetas.zeta.description"></a><h5>
-<a name="id1252335"></a>
+<a name="id1124644"></a>
 <a class="link" href="zeta.html#math_toolkit.special.zetas.zeta.description">Description</a>
 </h5>
<pre class="programlisting">template <class T>
@@ -85,7 +80,7 @@
 <img src="../../../../graphs/zeta2.png" align="middle">
 
<a name="math_toolkit.special.zetas.zeta.accuracy"></a><h5>
-<a name="id1252560"></a>
+<a name="id1124869"></a>
 <a class="link" href="zeta.html#math_toolkit.special.zetas.zeta.accuracy">Accuracy</a>
 </h5>

@@ -234,7 +229,7 @@
</table></div>
</div>
 <a name="math_toolkit.special.zetas.zeta.testing"></a><h5>
-<a name="id1252820"></a>
+<a name="id1125129"></a>
 <a class="link" href="zeta.html#math_toolkit.special.zetas.zeta.testing">Testing</a>
 </h5>

@@ -249,7 +244,7 @@
 check.
 
<a name="math_toolkit.special.zetas.zeta.implementation"></a><h5>
-<a name="id1252847"></a>
+<a name="id1125156"></a>
 <a class="link" href="zeta.html#math_toolkit.special.zetas.zeta.implementation">Implementation</a>
 </h5>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/status.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/status.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/status.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,13 +24,13 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="math_toolkit.status"></a><a class="link" href="status.html" title="Library Status"> Library Status</a>
+<a name="math_toolkit.status"></a><a class="link" href="status.html" title="Library Status">Library Status</a>
</h2></div></div></div>
<div class="toc"><dl>
-<dt> History and What's New</dt>
-<dt> Compilers</dt>
-<dt> Known Issues, and Todo List</dt>
-<dt> Credits and Acknowledgements</dt>
+<dt>History and What's New</dt>
+<dt>Compilers</dt>
+<dt>Known Issues, and Todo List</dt>
+<dt>Credits and Acknowledgements</dt>
</dl></div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/status/compilers.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/status/compilers.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/status/compilers.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,18 +24,14 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.status.compilers"></a><a class="link" href="compilers.html" title="Compilers"> Compilers</a>
+<a name="math_toolkit.status.compilers"></a><a class="link" href="compilers.html" title="Compilers">Compilers</a>
</h3></div></div></div>

- 
-
- This section contains some information about how various compilers work
- with this library. It is not comprehensive and updated experiences are
- always welcome. Some effort has been made to suppress unhelpful warnings
- but it is difficult to achieve this on all systems.
- 
-
- 
+ This section contains some information about how various compilers work with
+ this library. It is not comprehensive and updated experiences are always
+ welcome. Some effort has been made to suppress unhelpful warnings but it
+ is difficult to achieve this on all systems.
+ 
<div class="table">
<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">
@@ -47,508 +43,498 @@
</colgroup>
<thead><tr>
<th>
- 
- Platform
- 
- </th>
+ 
+ Platform
+ 
+ </th>
<th>
- 
- Compiler
- 
- </th>
+ 
+ Compiler
+ 
+ </th>
<th>
- 
- Has long double support
- 
- </th>
+ 
+ Has long double support
+ 
+ </th>
<th>
- 
- Notes
- 
- </th>
+ 
+ Notes
+ 
+ </th>
</tr></thead>
<tbody>
<tr>
<td>
- 
- Windows
- 
- </td>
-<td>
- 
- MSVC 7.1 and later
- 
- </td>
-<td>
- 
- Yes
- 
- </td>
-<td>
- 
- All tests OK.
- 
- 
- We aim to keep our headers warning free at level 4 with this
- compiler.
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- Windows
- 
- </td>
-<td>
- 
- Intel 8.1 and later
- 
- </td>
-<td>
- 
- Yes
- 
- </td>
-<td>
- 
- All tests OK.
- 
- 
- We aim to keep our headers warning free at level 4 with this
- compiler. However, The tests cases tend to generate a lot of
- warnings relating to numeric underflow of the test data: these
- are harmless.
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- Windows
- 
- </td>
-<td>
- 
- GNU Mingw32 C++
- 
- </td>
-<td>
- 
- Yes
- 
- </td>
-<td>
- 
- All tests OK.
- 
- 
- We aim to keep our headers warning free with -Wall with this
- compiler.
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- Windows
- 
- </td>
-<td>
- 
- GNU Cygwin C++
- 
- </td>
-<td>
- 
- No
- 
- </td>
-<td>
- 
- All tests OK.
- 
- 
- We aim to keep our headers warning free with -Wall with this
- compiler.
- 
- 
- Long double support has been disabled because there are no native
- long double C std library functions available.
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- Windows
- 
- </td>
-<td>
- 
- Borland C++ 5.8.2 (Developer studio 2006)
- 
- </td>
-<td>
- 
- No
- 
- </td>
-<td>
- 
- We have only partial compatability with this compiler:
- 
- 
- Long double support has been disabled because the native long
- double C standard library functions really only forward to the
- double versions. This can result in unpredictable behaviour when
- using the long double overloads: for example <code class="computeroutput">sqrtl</code>
- applied to a finite value, can result in an infinite result.
- 
- 
- Some functions still fail to compile, there are no known workarounds
- at present.
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- Linux
- 
- </td>
-<td>
- 
- GNU C++ 3.4 and later
- 
- </td>
-<td>
- 
- Yes
- 
- </td>
-<td>
- 
- All tests OK.
- 
- 
- We aim to keep our headers warning free with -Wall with this
- compiler.
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- Linux
- 
- </td>
-<td>
- 
- Intel C++ 10.0 and later
- 
- </td>
-<td>
- 
- Yes
- 
- </td>
-<td>
- 
- All tests OK.
- 
- 
- We aim to keep our headers warning free with -Wall with this
- compiler. However, The tests cases tend to generate a lot of
- warnings relating to numeric underflow of the test data: these
- are harmless.
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- Linux
- 
- </td>
-<td>
- 
- Intel C++ 8.1 and 9.1
- 
- </td>
-<td>
- 
- No
- 
- </td>
-<td>
- 
- All tests OK.
- 
- 
- Long double support has been disabled with these compiler releases
- because calling the standard library long double math functions
- can result in a segfault. The issue is Linux distribution and
- glibc version specific and is Intel bug report #409291. Fully
- up to date releases of Intel 9.1 (post version l_cc_c_9.1.046)
- shouldn't have this problem. If you need long double support
- with this compiler, then comment out the define of BOOST_MATH_NO_LONG_DOUBLE_MATH_FUNCTIONS
- at line 55 of boost/math/tools/config.hpp.
- 
- 
- We aim to keep our headers warning free with -Wall with this
- compiler. However, The tests cases tend to generate a lot of
- warnings relating to numeric underflow of the test data: these
- are harmless.
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- Linux
- 
- </td>
-<td>
- 
- QLogic PathScale 3.0
- 
- </td>
-<td>
- 
- Yes
- 
- </td>
-<td>
- 
- Some tests involving conceptual checks fail to build, otherwise
- there appear to be no issues.
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- Linux
- 
- </td>
-<td>
- 
- Sun Studio 12
- 
- </td>
-<td>
- 
- Yes
- 
- </td>
-<td>
- 
- Some tests involving function overload resolution fail to build,
- these issues should be rairly encountered in practice.
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- Solaris
- 
- </td>
-<td>
- 
- Sun Studio 12
- 
- </td>
-<td>
- 
- Yes
- 
- </td>
-<td>
- 
- Some tests involving function overload resolution fail to build,
- these issues should be rairly encountered in practice.
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- Solaris
- 
- </td>
-<td>
- 
- GNU C++ 4.x
- 
- </td>
-<td>
- 
- Yes
- 
- </td>
-<td>
- 
- All tests OK.
- 
- 
- We aim to keep our headers warning free with -Wall with this
- compiler.
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- HP Tru64
- 
- </td>
-<td>
- 
- Compaq C++ 7.1
- 
- </td>
-<td>
- 
- Yes
- 
- </td>
-<td>
- 
- All tests OK.
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- HP-UX Itanium
- 
- </td>
-<td>
- 
- HP aCC 6.x
- 
- </td>
-<td>
- 
- Yes
- 
- </td>
-<td>
- 
- All tests OK.
- 
- 
- Unfortunately this compiler emits quite a few warnings from libraries
- upon which we depend (TR1, Array etc).
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- HP-UX PA-RISC
- 
- </td>
-<td>
- 
- GNU C++ 3.4
- 
- </td>
-<td>
- 
- No
- 
- </td>
-<td>
- 
- All tests OK.
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- Apple Mac OS X, Intel
- 
- </td>
-<td>
- 
- Darwin/GNU C++ 4.x
- 
- </td>
-<td>
- 
- Yes
- 
- </td>
-<td>
- 
- All tests OK.
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- Apple Mac OS X, PowerPC
- 
- </td>
-<td>
- 
- Darwin/GNU C++ 4.x
- 
- </td>
-<td>
- 
- No
- 
- </td>
-<td>
- 
- All tests OK.
- 
- 
- Long double support has been disabled on this platform due to
- the rather strange nature of Darwin's 106-bit long double implementation.
- It should be possible to make this work if someone is prepared
- to offer assistance.
- 
- </td>
-</tr>
-<tr>
-<td>
- 
- IMB AIX
- 
- </td>
-<td>
- 
- IBM xlc 5.3
- 
- </td>
-<td>
- 
- Yes
- 
- </td>
-<td>
- 
- All tests pass except for our fpclassify tests which fail due
- to a bug in <code class="computeroutput">std::numeric_limits</code>,
- the bug effects the test code, not fpclassify itself. The IBM
- compiler group are aware of the problem.
- 
- </td>
+ 
+ Windows
+ 
+ </td>
+<td>
+ 
+ MSVC 7.1 and later
+ 
+ </td>
+<td>
+ 
+ Yes
+ 
+ </td>
+<td>
+ 
+ All tests OK.
+ 
+ 
+ We aim to keep our headers warning free at level 4 with this compiler.
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Windows
+ 
+ </td>
+<td>
+ 
+ Intel 8.1 and later
+ 
+ </td>
+<td>
+ 
+ Yes
+ 
+ </td>
+<td>
+ 
+ All tests OK.
+ 
+ 
+ We aim to keep our headers warning free at level 4 with this compiler.
+ However, The tests cases tend to generate a lot of warnings relating
+ to numeric underflow of the test data: these are harmless.
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Windows
+ 
+ </td>
+<td>
+ 
+ GNU Mingw32 C++
+ 
+ </td>
+<td>
+ 
+ Yes
+ 
+ </td>
+<td>
+ 
+ All tests OK.
+ 
+ 
+ We aim to keep our headers warning free with -Wall with this compiler.
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Windows
+ 
+ </td>
+<td>
+ 
+ GNU Cygwin C++
+ 
+ </td>
+<td>
+ 
+ No
+ 
+ </td>
+<td>
+ 
+ All tests OK.
+ 
+ 
+ We aim to keep our headers warning free with -Wall with this compiler.
+ 
+ 
+ Long double support has been disabled because there are no native
+ long double C std library functions available.
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Windows
+ 
+ </td>
+<td>
+ 
+ Borland C++ 5.8.2 (Developer studio 2006)
+ 
+ </td>
+<td>
+ 
+ No
+ 
+ </td>
+<td>
+ 
+ We have only partial compatability with this compiler:
+ 
+ 
+ Long double support has been disabled because the native long double
+ C standard library functions really only forward to the double
+ versions. This can result in unpredictable behaviour when using
+ the long double overloads: for example <code class="computeroutput">sqrtl</code>
+ applied to a finite value, can result in an infinite result.
+ 
+ 
+ Some functions still fail to compile, there are no known workarounds
+ at present.
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Linux
+ 
+ </td>
+<td>
+ 
+ GNU C++ 3.4 and later
+ 
+ </td>
+<td>
+ 
+ Yes
+ 
+ </td>
+<td>
+ 
+ All tests OK.
+ 
+ 
+ We aim to keep our headers warning free with -Wall with this compiler.
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Linux
+ 
+ </td>
+<td>
+ 
+ Intel C++ 10.0 and later
+ 
+ </td>
+<td>
+ 
+ Yes
+ 
+ </td>
+<td>
+ 
+ All tests OK.
+ 
+ 
+ We aim to keep our headers warning free with -Wall with this compiler.
+ However, The tests cases tend to generate a lot of warnings relating
+ to numeric underflow of the test data: these are harmless.
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Linux
+ 
+ </td>
+<td>
+ 
+ Intel C++ 8.1 and 9.1
+ 
+ </td>
+<td>
+ 
+ No
+ 
+ </td>
+<td>
+ 
+ All tests OK.
+ 
+ 
+ Long double support has been disabled with these compiler releases
+ because calling the standard library long double math functions
+ can result in a segfault. The issue is Linux distribution and glibc
+ version specific and is Intel bug report #409291. Fully up to date
+ releases of Intel 9.1 (post version l_cc_c_9.1.046) shouldn't have
+ this problem. If you need long double support with this compiler,
+ then comment out the define of BOOST_MATH_NO_LONG_DOUBLE_MATH_FUNCTIONS
+ at line 55 of boost/math/tools/config.hpp.
+ 
+ 
+ We aim to keep our headers warning free with -Wall with this compiler.
+ However, The tests cases tend to generate a lot of warnings relating
+ to numeric underflow of the test data: these are harmless.
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Linux
+ 
+ </td>
+<td>
+ 
+ QLogic PathScale 3.0
+ 
+ </td>
+<td>
+ 
+ Yes
+ 
+ </td>
+<td>
+ 
+ Some tests involving conceptual checks fail to build, otherwise
+ there appear to be no issues.
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Linux
+ 
+ </td>
+<td>
+ 
+ Sun Studio 12
+ 
+ </td>
+<td>
+ 
+ Yes
+ 
+ </td>
+<td>
+ 
+ Some tests involving function overload resolution fail to build,
+ these issues should be rairly encountered in practice.
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Solaris
+ 
+ </td>
+<td>
+ 
+ Sun Studio 12
+ 
+ </td>
+<td>
+ 
+ Yes
+ 
+ </td>
+<td>
+ 
+ Some tests involving function overload resolution fail to build,
+ these issues should be rairly encountered in practice.
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Solaris
+ 
+ </td>
+<td>
+ 
+ GNU C++ 4.x
+ 
+ </td>
+<td>
+ 
+ Yes
+ 
+ </td>
+<td>
+ 
+ All tests OK.
+ 
+ 
+ We aim to keep our headers warning free with -Wall with this compiler.
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ HP Tru64
+ 
+ </td>
+<td>
+ 
+ Compaq C++ 7.1
+ 
+ </td>
+<td>
+ 
+ Yes
+ 
+ </td>
+<td>
+ 
+ All tests OK.
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ HP-UX Itanium
+ 
+ </td>
+<td>
+ 
+ HP aCC 6.x
+ 
+ </td>
+<td>
+ 
+ Yes
+ 
+ </td>
+<td>
+ 
+ All tests OK.
+ 
+ 
+ Unfortunately this compiler emits quite a few warnings from libraries
+ upon which we depend (TR1, Array etc).
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ HP-UX PA-RISC
+ 
+ </td>
+<td>
+ 
+ GNU C++ 3.4
+ 
+ </td>
+<td>
+ 
+ No
+ 
+ </td>
+<td>
+ 
+ All tests OK.
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Apple Mac OS X, Intel
+ 
+ </td>
+<td>
+ 
+ Darwin/GNU C++ 4.x
+ 
+ </td>
+<td>
+ 
+ Yes
+ 
+ </td>
+<td>
+ 
+ All tests OK.
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Apple Mac OS X, PowerPC
+ 
+ </td>
+<td>
+ 
+ Darwin/GNU C++ 4.x
+ 
+ </td>
+<td>
+ 
+ No
+ 
+ </td>
+<td>
+ 
+ All tests OK.
+ 
+ 
+ Long double support has been disabled on this platform due to the
+ rather strange nature of Darwin's 106-bit long double implementation.
+ It should be possible to make this work if someone is prepared
+ to offer assistance.
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ IMB AIX
+ 
+ </td>
+<td>
+ 
+ IBM xlc 5.3
+ 
+ </td>
+<td>
+ 
+ Yes
+ 
+ </td>
+<td>
+ 
+ All tests pass except for our fpclassify tests which fail due to
+ a bug in <code class="computeroutput">std::numeric_limits</code>, the bug effects
+ the test code, not fpclassify itself. The IBM compiler group are
+ aware of the problem.
+ 
+ </td>
</tr>
</tbody>
</table></div>
</div>
- 
- 
-<div class="table">
+ <div class="table">
<a name="math_toolkit.status.compilers.unsupported_compilers"></a>Table 56. Unsupported Compilers
<div class="table-contents"><table class="table" summary="Unsupported Compilers">
<colgroup>
@@ -557,68 +543,59 @@
</colgroup>
<thead><tr>
<th>
- 
- Platform
- 
- </th>
+ 
+ Platform
+ 
+ </th>
<th>
- 
- Compiler
- 
- </th>
+ 
+ Compiler
+ 
+ </th>
</tr></thead>
<tbody>
<tr>
<td>
- 
- Windows
- 
- </td>
-<td>
- 
- Borland C++ 5.9.2 (Borland Developer Studio 2007)
- 
- </td>
+ 
+ Windows
+ 
+ </td>
+<td>
+ 
+ Borland C++ 5.9.2 (Borland Developer Studio 2007)
+ 
+ </td>
</tr>
<tr>
<td>
- 
- Windows
- 
- </td>
-<td>
- 
- MSVC 6 and 7
- 
- </td>
+ 
+ Windows
+ 
+ </td>
+<td>
+ 
+ MSVC 6 and 7
+ 
+ </td>
</tr>
</tbody>
</table></div>
</div>
- 
- 
-
- If you're compiler or platform is not listed above, please try running
- the regression tests: cd into boost-root/libs/math/test and do a:
- 
-
-
-
+ 
+ If you're compiler or platform is not listed above, please try running the
+ regression tests: cd into boost-root/libs/math/test and do a:
+ 
<pre class="programlisting">bjam mytoolset
</pre>

- 
-
- where "mytoolset" is the name of the Boost.Build
- toolset used for your compiler. The chances are that many
- of the accuracy tests will fail at this stage - don't panic
- - the default acceptable error tolerances are quite tight, especially for
- long double types with an extended exponent range (these cause more extreme
- test cases to be executed for some functions). You will need to cast an
- eye over the output from the failing tests and make a judgement as to whether
- the error rates are acceptable or not.
- 
-
+ where "mytoolset" is the name of the Boost.Build
+ toolset used for your compiler. The chances are that many
+ of the accuracy tests will fail at this stage - don't panic -
+ the default acceptable error tolerances are quite tight, especially for long
+ double types with an extended exponent range (these cause more extreme test
+ cases to be executed for some functions). You will need to cast an eye over
+ the output from the failing tests and make a judgement as to whether the
+ error rates are acceptable or not.

</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/status/credits.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/status/credits.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/status/credits.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -23,7 +23,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.status.credits"></a><a class="link" href="credits.html" title="Credits and Acknowledgements"> Credits and Acknowledgements</a>
+<a name="math_toolkit.status.credits"></a><a class="link" href="credits.html" title="Credits and Acknowledgements">Credits and Acknowledgements</a>
</h3></div></div></div>

 Hubert Holin started the Boost.Math library. The inverse hyperbolic functions,
@@ -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

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/status/history1.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/status/history1.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/status/history1.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,341 +24,277 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.status.history1"></a><a class="link" href="history1.html" title="History and What's New"> History and What's New</a>
+<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="id1400958"></a>
- <a class="link" href="history1.html#math_toolkit.status.history1.boost_1_45_0">Boost-1.45.0</a>
- </h5>
-
- 
+<a name="math_toolkit.status.history1.boost_1_45_0"></a><h5>
+<a name="id1274025"></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>
+ 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>
- Added inverse gamma distribution at request of Thomas Mang.
- </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="id1400989"></a>
- <a class="link" href="history1.html#math_toolkit.status.history1.boost_1_44_0">Boost-1.44.0</a>
- </h5>
-
- 
+<a name="math_toolkit.status.history1.boost_1_44_0"></a><h5>
+<a name="id1274064"></a>
+ <a class="link" href="history1.html#math_toolkit.status.history1.boost_1_44_0">Boost-1.44.0</a>
+ </h5>
<div class="itemizedlist"><ul type="disc">
<li>
- Fixed incorrect range and support for Rayleigh distribution.
- </li>
+ Fixed incorrect range and support for Rayleigh distribution.
+ </li>
<li>
- Fixed numerical error in the quantile of the Student's T distribution:
- the function was returning garbage values for non-integer degrees of
- freedom between 2 and 3.
- </li>
+ Fixed numerical error in the quantile of the Student's T distribution:
+ the function was returning garbage values for non-integer degrees of
+ freedom between 2 and 3.
+ </li>
</ul></div>
-
- <a name="math_toolkit.status.history1.boost_1_41_0"></a>
- 
-<h5>
-<a name="id1401021"></a>
- <a class="link" href="history1.html#math_toolkit.status.history1.boost_1_41_0">Boost-1.41.0</a>
- </h5>
-
- 
+<a name="math_toolkit.status.history1.boost_1_41_0"></a><h5>
+<a name="id1274095"></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 its inverse.
- </li></ul></div>
-
- <a name="math_toolkit.status.history1.boost_1_40_0"></a>
- 
-<h5>
-<a name="id1401045"></a>
- <a class="link" href="history1.html#math_toolkit.status.history1.boost_1_40_0">Boost-1.40.0</a>
- </h5>
-
- 
+ Significantly improved performance for the incomplete gamma function
+ and its inverse.
+ </li></ul></div>
+<a name="math_toolkit.status.history1.boost_1_40_0"></a><h5>
+<a name="id1274119"></a>
+ <a class="link" href="history1.html#math_toolkit.status.history1.boost_1_40_0">Boost-1.40.0</a>
+ </h5>
<div class="itemizedlist"><ul type="disc">
<li>
- Added support for MPFR as a bignum type.
- </li>
+ Added support for MPFR as a bignum type.
+ </li>
<li>
- Added some full specializations of the policy classes to reduce compile
- times.
- </li>
-<li>
- Added logistic and hypergeometric distributions, from Gautam Sewani's
- Google Summer of Code project.
- </li>
-<li>
- Added Laplace distribution submitted by Thijs van den Berg.
- </li>
-<li>
- Updated performance test code to include new distributions, and improved
- the performance of the non-central distributions.
- </li>
-<li>
- Added SSE2 optimised <a class="link" href="../backgrounders/lanczos.html" title="The Lanczos Approximation">Lanczos
- approximation</a> code, from Gautam Sewani's Google Summer of Code
- project.
- </li>
-<li>
- Fixed bug in cyl_bessel_i that used an incorrect approximation for
- ν = 0.5, also effects the non-central Chi Square Distribution when ν =
- 3, see bug report #2877.
- </li>
+ Added some full specializations of the policy classes to reduce compile
+ times.
+ </li>
+<li>
+ Added logistic and hypergeometric distributions, from Gautam Sewani's
+ Google Summer of Code project.
+ </li>
+<li>
+ Added Laplace distribution submitted by Thijs van den Berg.
+ </li>
+<li>
+ Updated performance test code to include new distributions, and improved
+ the performance of the non-central distributions.
+ </li>
+<li>
+ Added SSE2 optimised <a class="link" href="../backgrounders/lanczos.html" title="The Lanczos Approximation">Lanczos
+ approximation</a> code, from Gautam Sewani's Google Summer of Code
+ project.
+ </li>
+<li>
+ Fixed bug in cyl_bessel_i that used an incorrect approximation for ν =
+ 0.5, also effects the non-central Chi Square Distribution when ν = 3, see
+ bug report #2877.
+ </li>
<li>
- Fixed minor bugs #2873.
- </li>
+ Fixed minor bugs #2873.
+ </li>
</ul></div>
-
- <a name="math_toolkit.status.history1.boost_1_38_0"></a>
- 
-<h5>
-<a name="id1401133"></a>
- <a class="link" href="history1.html#math_toolkit.status.history1.boost_1_38_0">Boost-1.38.0</a>
- </h5>
-
- 
+<a name="math_toolkit.status.history1.boost_1_38_0"></a><h5>
+<a name="id1274208"></a>
+ <a class="link" href="history1.html#math_toolkit.status.history1.boost_1_38_0">Boost-1.38.0</a>
+ </h5>
<div class="itemizedlist"><ul type="disc">
<li>
- Added Johan Råde's optimised floating point classification routines.
- </li>
+ Added Johan Råde's optimised floating point classification routines.
+ </li>
<li>
- Fixed code so that it compiles in GCC's -pedantic mode (bug report
- #1451).
- </li>
+ Fixed code so that it compiles in GCC's -pedantic mode (bug report #1451).
+ </li>
</ul></div>
-
- <a name="math_toolkit.status.history1.boost_1_37_0"></a>
- 
-<h5>
-<a name="id1401169"></a>
- <a class="link" href="history1.html#math_toolkit.status.history1.boost_1_37_0">Boost-1.37.0</a>
- </h5>
-
- 
+<a name="math_toolkit.status.history1.boost_1_37_0"></a><h5>
+<a name="id1274244"></a>
+ <a class="link" href="history1.html#math_toolkit.status.history1.boost_1_37_0">Boost-1.37.0</a>
+ </h5>
<div class="itemizedlist"><ul type="disc"><li>
- Improved accuracy and testing of the inverse hypergeometric functions.
- </li></ul></div>
-
- <a name="math_toolkit.status.history1.boost_1_36_0"></a>
- 
-<h5>
-<a name="id1401193"></a>
- <a class="link" href="history1.html#math_toolkit.status.history1.boost_1_36_0">Boost-1.36.0</a>
- </h5>
-
- 
+ Improved accuracy and testing of the inverse hypergeometric functions.
+ </li></ul></div>
+<a name="math_toolkit.status.history1.boost_1_36_0"></a><h5>
+<a name="id1274268"></a>
+ <a class="link" href="history1.html#math_toolkit.status.history1.boost_1_36_0">Boost-1.36.0</a>
+ </h5>
<div class="itemizedlist"><ul type="disc">
<li>
- Added Noncentral Chi Squared Distribution.
- </li>
+ Added Noncentral Chi Squared Distribution.
+ </li>
<li>
- Added Noncentral Beta Distribution.
- </li>
+ Added Noncentral Beta Distribution.
+ </li>
<li>
- Added Noncentral F Distribution.
- </li>
+ Added Noncentral F Distribution.
+ </li>
<li>
- Added Noncentral T Distribution.
- </li>
+ Added Noncentral T Distribution.
+ </li>
<li>
- Added Exponential Integral Functions.
- </li>
+ Added Exponential Integral Functions.
+ </li>
<li>
- Added Zeta Function.
- </li>
+ Added Zeta Function.
+ </li>
<li>
- Added Rounding and Truncation functions.
- </li>
+ Added Rounding and Truncation functions.
+ </li>
<li>
- Added Compile time powers of runtime bases.
- </li>
+ Added Compile time powers of runtime bases.
+ </li>
<li>
- Added SSE2 optimizations for Lanczos evaluation.
- </li>
+ Added SSE2 optimizations for Lanczos evaluation.
+ </li>
</ul></div>
-
- <a name="math_toolkit.status.history1.boost_1_35_0__post_review_first_official_release"></a>
- 
-<h5>
-<a name="id1401279"></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>
-
- 
+<a name="math_toolkit.status.history1.boost_1_35_0__post_review_first_official_release"></a><h5>
+<a name="id1274354"></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>
<div class="itemizedlist"><ul type="disc">
<li>
- Added Policy based framework that allows fine grained control over
- function behaviour.
- </li>
-<li>
- Breaking change: Changed default behaviour
- for domain, pole and overflow errors to throw an exception (based on
- review feedback), this behaviour can be customised using <a class="link" href="../policy.html" title="Policies">Policy</a>'s.
- </li>
-<li>
- Breaking change: Changed exception
- thrown when an internal evaluation error occurs to boost::math::evaluation_error.
- </li>
-<li>
- Breaking change: Changed discrete
- quantiles to return an integer result: this is anything up to 20 times
- faster than finding the true root, this behaviour can be customised
- using <a class="link" href="../policy.html" title="Policies">Policy</a>'s.
- </li>
-<li>
- Polynomial/rational function evaluation is now customisable and hopefully
- faster than before.
- </li>
+ Added Policy based framework that allows fine grained control over function
+ behaviour.
+ </li>
+<li>
+ Breaking change: Changed default behaviour
+ for domain, pole and overflow errors to throw an exception (based on
+ review feedback), this behaviour can be customised using <a class="link" href="../policy.html" title="Policies">Policy</a>'s.
+ </li>
+<li>
+ Breaking change: Changed exception thrown
+ when an internal evaluation error occurs to boost::math::evaluation_error.
+ </li>
+<li>
+ Breaking change: Changed discrete quantiles
+ to return an integer result: this is anything up to 20 times faster than
+ finding the true root, this behaviour can be customised using <a class="link" href="../policy.html" title="Policies">Policy</a>'s.
+ </li>
+<li>
+ Polynomial/rational function evaluation is now customisable and hopefully
+ faster than before.
+ </li>
<li>
- Added performance test program.
- </li>
+ Added performance test program.
+ </li>
</ul></div>
-
- <a name="math_toolkit.status.history1.milestone_4__second_review_candidate__1st_march_2007_"></a>
- 
-<h5>
-<a name="id1401365"></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>
-
- 
+<a name="math_toolkit.status.history1.milestone_4__second_review_candidate__1st_march_2007_"></a><h5>
+<a name="id1274439"></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>
<div class="itemizedlist"><ul type="disc">
<li>
- Moved Xiaogang Zhang's Bessel Functions code into the library, and
- brought them into line with the rest of the code.
- </li>
+ Moved Xiaogang Zhang's Bessel Functions code into the library, and brought
+ them into line with the rest of the code.
+ </li>
<li>
- Added C# "Distribution Explorer" demo application.
- </li>
+ Added C# "Distribution Explorer" demo application.
+ </li>
</ul></div>
-
- <a name="math_toolkit.status.history1.milestone_3__first_review_candidate__31st_dec_2006_"></a>
- 
-<h5>
-<a name="id1401397"></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>
-
- 
+<a name="math_toolkit.status.history1.milestone_3__first_review_candidate__31st_dec_2006_"></a><h5>
+<a name="id1274999"></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>
<div class="itemizedlist"><ul type="disc">
<li>
- Implemented the main probability distribution and density functions.
- </li>
+ Implemented the main probability distribution and density functions.
+ </li>
<li>
- Implemented digamma.
- </li>
+ Implemented digamma.
+ </li>
<li>
- Added more factorial functions.
- </li>
+ Added more factorial functions.
+ </li>
<li>
- Implemented the Hermite, Legendre and Laguerre polynomials plus the
- spherical harmonic functions from TR1.
- </li>
-<li>
- Moved Xiaogang Zhang's elliptic integral code into the library, and
- brought them into line with the rest of the code.
- </li>
-<li>
- Moved Hubert Holin's existing Boost.Math special functions into this
- library and brought them into line with the rest of the code.
- </li>
+ Implemented the Hermite, Legendre and Laguerre polynomials plus the spherical
+ harmonic functions from TR1.
+ </li>
+<li>
+ Moved Xiaogang Zhang's elliptic integral code into the library, and brought
+ them into line with the rest of the code.
+ </li>
+<li>
+ Moved Hubert Holin's existing Boost.Math special functions into this
+ library and brought them into line with the rest of the code.
+ </li>
</ul></div>
-
- <a name="math_toolkit.status.history1.milestone_2__released_september_10th_2006"></a>
- 
-<h5>
-<a name="id1401460"></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>
-
- 
+<a name="math_toolkit.status.history1.milestone_2__released_september_10th_2006"></a><h5>
+<a name="id1275060"></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>
<div class="itemizedlist"><ul type="disc">
<li>
- Implement preview release of the statistical distributions.
- </li>
+ Implement preview release of the statistical distributions.
+ </li>
<li>
- Added statistical distributions tutorial.
- </li>
+ Added statistical distributions tutorial.
+ </li>
<li>
- Implemented root finding algorithms.
- </li>
+ Implemented root finding algorithms.
+ </li>
<li>
- Implemented the inverses of the incomplete gamma and beta functions.
- </li>
+ Implemented the inverses of the incomplete gamma and beta functions.
+ </li>
<li>
- Rewrite erf/erfc as rational approximations (valid to 128-bit precision).
- </li>
+ Rewrite erf/erfc as rational approximations (valid to 128-bit precision).
+ </li>
<li>
- Integrated the statistical results generated from the test data with
- Boost.Test: uses a database of expected results, indexed by test, floating
- point type, platform, and compiler.
- </li>
+ Integrated the statistical results generated from the test data with
+ Boost.Test: uses a database of expected results, indexed by test, floating
+ point type, platform, and compiler.
+ </li>
<li>
- Improved lgamma near 1 and 2 (rational approximations).
- </li>
+ Improved lgamma near 1 and 2 (rational approximations).
+ </li>
<li>
- Improved erf/erfc inverses (rational approximations).
- </li>
+ Improved erf/erfc inverses (rational approximations).
+ </li>
<li>
- Implemented Rational function generation (the Remez method).
- </li>
+ Implemented Rational function generation (the Remez method).
+ </li>
</ul></div>
-
- <a name="math_toolkit.status.history1.milestone_1__released_march_31st_2006"></a>
- 
-<h5>
-<a name="id1401541"></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>
-
- 
+<a name="math_toolkit.status.history1.milestone_1__released_march_31st_2006"></a><h5>
+<a name="id1275143"></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>
<div class="itemizedlist"><ul type="disc">
<li>
- Implement gamma/beta/erf functions along with their incomplete counterparts.
- </li>
+ Implement gamma/beta/erf functions along with their incomplete counterparts.
+ </li>
<li>
- Generate high quality test data, against which future improvements
- can be judged.
- </li>
-<li>
- Provide tools for the evaluation of infinite series, continued fractions,
- and rational functions.
- </li>
-<li>
- Provide tools for testing against tabulated test data, and collecting
- statistics on error rates.
- </li>
-<li>
- Provide sufficient docs for people to be able to find their way around
- the library.
- </li>
+ Generate high quality test data, against which future improvements can
+ be judged.
+ </li>
+<li>
+ Provide tools for the evaluation of infinite series, continued fractions,
+ and rational functions.
+ </li>
+<li>
+ Provide tools for testing against tabulated test data, and collecting
+ statistics on error rates.
+ </li>
+<li>
+ Provide sufficient docs for people to be able to find their way around
+ the library.
+ </li>
</ul></div>

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

+ Sandbox and trunk last synchonised at revision: .

</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/status/issues.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/status/issues.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/status/issues.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.status.issues"></a><a class="link" href="issues.html" title="Known Issues, and Todo List"> Known Issues, and Todo List</a>
+<a name="math_toolkit.status.issues"></a><a class="link" href="issues.html" title="Known Issues, and Todo List">Known Issues, and Todo List</a>
</h3></div></div></div>

 This section lists those issues that are known about.
@@ -43,7 +43,7 @@
 with it.
 
<a name="math_toolkit.status.issues.tgamma"></a><h5>
-<a name="id1404754"></a>
+<a name="id1276072"></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="id1404782"></a>
+<a name="id1276100"></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="id1404806"></a>
+<a name="id1276124"></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="id1404830"></a>
+<a name="id1276148"></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="id1404854"></a>
+<a name="id1276172"></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="id1404985"></a>
+<a name="id1276303"></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="id1405014"></a>
+<a name="id1276332"></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="id1405038"></a>
+<a name="id1276356"></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>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,36 +24,36 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="math_toolkit.toolkit"></a><a class="link" href="toolkit.html" title="Internal Details and Tools (Experimental)"> Internal Details and Tools (Experimental)</a>
+<a name="math_toolkit.toolkit"></a><a class="link" href="toolkit.html" title="Internal Details and Tools (Experimental)">Internal Details and Tools (Experimental)</a>
</h2></div></div></div>
<div class="toc"><dl>
-<dt> Overview</dt>
-<dt> Reused Utilities</dt>
+<dt>Overview</dt>
+<dt>Reused Utilities</dt>
<dd><dl>
-<dt><a href="toolkit/internals1/constants.html"> Numeric
+<dt><a href="toolkit/internals1/constants.html">Numeric
 Constants</a></dt>
-<dt><a href="toolkit/internals1/series_evaluation.html">
- Series Evaluation</a></dt>
-<dt><a href="toolkit/internals1/cf.html"> Continued Fraction
+<dt><a href="toolkit/internals1/series_evaluation.html">Series
 Evaluation</a></dt>
-<dt><a href="toolkit/internals1/rational.html"> Polynomial
+<dt><a href="toolkit/internals1/cf.html">Continued Fraction
+ Evaluation</a></dt>
+<dt><a href="toolkit/internals1/rational.html">Polynomial
 and Rational Function Evaluation</a></dt>
-<dt><a href="toolkit/internals1/roots.html"> Root Finding
+<dt><a href="toolkit/internals1/roots.html">Root Finding
 With Derivatives</a></dt>
-<dt><a href="toolkit/internals1/roots2.html"> Root Finding
+<dt><a href="toolkit/internals1/roots2.html">Root Finding
 Without Derivatives</a></dt>
-<dt><a href="toolkit/internals1/minima.html"> Locating Function
+<dt><a href="toolkit/internals1/minima.html">Locating Function
 Minima</a></dt>
-<dt> Tuples</dt>
+<dt>Tuples</dt>
</dl></dd>
-<dt> Testing and Development</dt>
+<dt>Testing and Development</dt>
<dd><dl>
-<dt> Polynomials</dt>
-<dt><a href="toolkit/internals2/minimax.html"> Minimax Approximations
+<dt>Polynomials</dt>
+<dt><a href="toolkit/internals2/minimax.html">Minimax Approximations
 and the Remez Algorithm</a></dt>
-<dt><a href="toolkit/internals2/error_test.html"> Relative
+<dt><a href="toolkit/internals2/error_test.html">Relative
 Error and Testing</a></dt>
-<dt><a href="toolkit/internals2/test_data.html"> Graphing,
+<dt><a href="toolkit/internals2/test_data.html">Graphing,
 Profiling, and Generating Test Data for Special Functions</a></dt>
</dl></dd>
</dl></div>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,24 +24,24 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.toolkit.internals1"></a><a class="link" href="internals1.html" title="Reused Utilities"> Reused Utilities</a>
+<a name="math_toolkit.toolkit.internals1"></a><a class="link" href="internals1.html" title="Reused Utilities">Reused Utilities</a>
</h3></div></div></div>
<div class="toc"><dl>
-<dt><a href="internals1/constants.html"> Numeric
+<dt><a href="internals1/constants.html">Numeric
 Constants</a></dt>
-<dt><a href="internals1/series_evaluation.html">
- Series Evaluation</a></dt>
-<dt><a href="internals1/cf.html"> Continued Fraction
+<dt><a href="internals1/series_evaluation.html">Series
 Evaluation</a></dt>
-<dt><a href="internals1/rational.html"> Polynomial
+<dt><a href="internals1/cf.html">Continued Fraction
+ Evaluation</a></dt>
+<dt><a href="internals1/rational.html">Polynomial
 and Rational Function Evaluation</a></dt>
-<dt><a href="internals1/roots.html"> Root Finding
+<dt><a href="internals1/roots.html">Root Finding
 With Derivatives</a></dt>
-<dt><a href="internals1/roots2.html"> Root Finding
+<dt><a href="internals1/roots2.html">Root Finding
 Without Derivatives</a></dt>
-<dt><a href="internals1/minima.html"> Locating Function
+<dt><a href="internals1/minima.html">Locating Function
 Minima</a></dt>
-<dt> Tuples</dt>
+<dt>Tuples</dt>
</dl></div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/cf.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/cf.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/cf.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.toolkit.internals1.cf"></a><a class="link" href="cf.html" title="Continued Fraction Evaluation"> Continued Fraction
+<a name="math_toolkit.toolkit.internals1.cf"></a><a class="link" href="cf.html" title="Continued Fraction Evaluation">Continued Fraction
 Evaluation</a>
</h4></div></div></div>
<a name="math_toolkit.toolkit.internals1.cf.synopsis"></a><h5>
-<a name="id1303870"></a>
+<a name="id1177256"></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="id1304902"></a>
+<a name="id1178293"></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="id1305113"></a>
+<a name="id1178504"></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="id1305130"></a>
+<a name="id1178521"></a>
 <a class="link" href="cf.html#math_toolkit.toolkit.internals1.cf.examples">Examples</a>
 </h5>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/constants.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/constants.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/constants.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.toolkit.internals1.constants"></a><a class="link" href="constants.html" title="Numeric Constants"> Numeric
+<a name="math_toolkit.toolkit.internals1.constants"></a><a class="link" href="constants.html" title="Numeric Constants">Numeric
 Constants</a>
</h4></div></div></div>
<a name="math_toolkit.toolkit.internals1.constants.synopsis"></a><h5>
-<a name="id1299795"></a>
+<a name="id1172908"></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="id1300435"></a>
+<a name="id1173548"></a>
 <a class="link" href="constants.html#math_toolkit.toolkit.internals1.constants.description">Description</a>
 </h5>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/minima.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/minima.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/minima.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.toolkit.internals1.minima"></a><a class="link" href="minima.html" title="Locating Function Minima"> Locating Function
+<a name="math_toolkit.toolkit.internals1.minima"></a><a class="link" href="minima.html" title="Locating Function Minima">Locating Function
 Minima</a>
</h4></div></div></div>
<a name="math_toolkit.toolkit.internals1.minima.synopsis"></a><h5>
-<a name="id1322200"></a>
+<a name="id1195874"></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="id1324184"></a>
+<a name="id1196219"></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="id1324296"></a>
+<a name="id1196331"></a>
 <a class="link" href="minima.html#math_toolkit.toolkit.internals1.minima.implementation">Implementation</a>
 </h5>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/rational.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/rational.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/rational.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.toolkit.internals1.rational"></a><a class="link" href="rational.html" title="Polynomial and Rational Function Evaluation"> Polynomial
+<a name="math_toolkit.toolkit.internals1.rational"></a><a class="link" href="rational.html" title="Polynomial and Rational Function Evaluation">Polynomial
 and Rational Function Evaluation</a>
</h4></div></div></div>
<a name="math_toolkit.toolkit.internals1.rational.synopsis"></a><h5>
-<a name="id1305857"></a>
+<a name="id1179248"></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="id1308670"></a>
+<a name="id1181925"></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="id1311067"></a>
+<a name="id1184857"></a>
 <a class="link" href="rational.html#math_toolkit.toolkit.internals1.rational.implementation">Implementation</a>
 </h5>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/roots.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/roots.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/roots.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.toolkit.internals1.roots"></a><a class="link" href="roots.html" title="Root Finding With Derivatives"> Root Finding
+<a name="math_toolkit.toolkit.internals1.roots"></a><a class="link" href="roots.html" title="Root Finding With Derivatives">Root Finding
 With Derivatives</a>
</h4></div></div></div>
<a name="math_toolkit.toolkit.internals1.roots.synopsis"></a><h5>
-<a name="id1311129"></a>
+<a name="id1184919"></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="id1311996"></a>
+<a name="id1185786"></a>
 <a class="link" href="roots.html#math_toolkit.toolkit.internals1.roots.description">Description</a>
 </h5>

@@ -173,10 +173,8 @@
 themselves. As ever, algebraic simplification can be a big win.
 </li>
</ul></div>
-<a name="newton"></a>
- 
-<a name="math_toolkit.toolkit.internals1.roots.newton_raphson_method"></a><h5>
-<a name="id1312245"></a>
+<a name="newton"></a><a name="math_toolkit.toolkit.internals1.roots.newton_raphson_method"></a><h5>
+<a name="id1186032"></a>
 <a class="link" href="roots.html#math_toolkit.toolkit.internals1.roots.newton_raphson_method">Newton
 Raphson Method</a>
 </h5>
@@ -193,10 +191,8 @@
 Under ideal conditions, the number of correct digits doubles with each
 iteration.
 
-<a name="halley"></a>
- 
-<a name="math_toolkit.toolkit.internals1.roots.halley_s_method"></a><h5>
-<a name="id1312303"></a>
+<a name="halley"></a><a name="math_toolkit.toolkit.internals1.roots.halley_s_method"></a><h5>
+<a name="id1186086"></a>
 <a class="link" href="roots.html#math_toolkit.toolkit.internals1.roots.halley_s_method">Halley's
 Method</a>
 </h5>
@@ -217,10 +213,8 @@
 Under ideal conditions, the number of correct digits trebles with each
 iteration.
 
-<a name="schroeder"></a>
- 
-<a name="math_toolkit.toolkit.internals1.roots.schroeder_s_method"></a><h5>
-<a name="id1312364"></a>
+<a name="schroeder"></a><a name="math_toolkit.toolkit.internals1.roots.schroeder_s_method"></a><h5>
+<a name="id1186143"></a>
 <a class="link" href="roots.html#math_toolkit.toolkit.internals1.roots.schroeder_s_method">Schroeder's
 Method</a>
 </h5>
@@ -244,7 +238,7 @@
 iteration.
 
<a name="math_toolkit.toolkit.internals1.roots.example"></a><h5>
-<a name="id1312418"></a>
+<a name="id1186197"></a>
 <a class="link" href="roots.html#math_toolkit.toolkit.internals1.roots.example">Example</a>
 </h5>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/roots2.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/roots2.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/roots2.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.toolkit.internals1.roots2"></a><a class="link" href="roots2.html" title="Root Finding Without Derivatives"> Root Finding
+<a name="math_toolkit.toolkit.internals1.roots2"></a><a class="link" href="roots2.html" title="Root Finding Without Derivatives">Root Finding
 Without Derivatives</a>
</h4></div></div></div>
<a name="math_toolkit.toolkit.internals1.roots2.synopsis"></a><h5>
-<a name="id1315055"></a>
+<a name="id1187758"></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="id1318682"></a>
+<a name="id1190848"></a>
 <a class="link" href="roots2.html#math_toolkit.toolkit.internals1.roots2.description">Description</a>
 </h5>

@@ -238,14 +238,9 @@
</dl>
</div>

- 
-
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- 
-
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
 

 Returns: a pair of values r that bracket the root
@@ -346,14 +341,9 @@
</dl>
</div>

- 
-
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- 
-
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
 

 Returns: a pair of values r that bracket the root
@@ -475,14 +465,9 @@
</dl>
</div>

- 
-
- The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument
- is optional and can be used to control the behaviour of the function:
- how it handles errors, what level of precision to use etc. Refer to the
- <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
- 
-
+ The final <a class="link" href="../../policy.html" title="Policies">Policy</a> argument is
+ optional and can be used to control the behaviour of the function: how
+ it handles errors, what level of precision to use etc. Refer to the <a class="link" href="../../policy.html" title="Policies">policy documentation for more details</a>.
 

 Returns: a pair of values r that bracket the root
@@ -561,7 +546,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="id1322161"></a>
+<a name="id1195835"></a>
 <a class="link" href="roots2.html#math_toolkit.toolkit.internals1.roots2.implementation">Implementation</a>
 </h5>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/series_evaluation.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/series_evaluation.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/series_evaluation.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.toolkit.internals1.series_evaluation"></a><a class="link" href="series_evaluation.html" title="Series Evaluation">
- Series Evaluation</a>
+<a name="math_toolkit.toolkit.internals1.series_evaluation"></a><a class="link" href="series_evaluation.html" title="Series Evaluation">Series
+ Evaluation</a>
</h4></div></div></div>
<a name="math_toolkit.toolkit.internals1.series_evaluation.synopsis"></a><h5>
-<a name="id1301071"></a>
+<a name="id1175550"></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="id1303175"></a>
+<a name="id1176562"></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="id1303274"></a>
+<a name="id1176660"></a>
 <a class="link" href="series_evaluation.html#math_toolkit.toolkit.internals1.series_evaluation.example">Example</a>
 </h5>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/tuples.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/tuples.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals1/tuples.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,10 +24,10 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.toolkit.internals1.tuples"></a><a class="link" href="tuples.html" title="Tuples"> Tuples</a>
+<a name="math_toolkit.toolkit.internals1.tuples"></a><a class="link" href="tuples.html" title="Tuples">Tuples</a>
</h4></div></div></div>
<a name="math_toolkit.toolkit.internals1.tuples.synopsis"></a><h5>
-<a name="id1324334"></a>
+<a name="id1196369"></a>
 <a class="link" href="tuples.html#math_toolkit.toolkit.internals1.tuples.synopsis">Synopsis</a>
 </h5>

@@ -38,7 +38,7 @@

 
<a name="math_toolkit.toolkit.internals1.tuples.description"></a><h5>
-<a name="id1324400"></a>
+<a name="id1196435"></a>
 <a class="link" href="tuples.html#math_toolkit.toolkit.internals1.tuples.description">Description</a>
 </h5>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,15 +24,15 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.toolkit.internals2"></a><a class="link" href="internals2.html" title="Testing and Development"> Testing and Development</a>
+<a name="math_toolkit.toolkit.internals2"></a><a class="link" href="internals2.html" title="Testing and Development">Testing and Development</a>
</h3></div></div></div>
<div class="toc"><dl>
-<dt> Polynomials</dt>
-<dt><a href="internals2/minimax.html"> Minimax Approximations
+<dt>Polynomials</dt>
+<dt><a href="internals2/minimax.html">Minimax Approximations
 and the Remez Algorithm</a></dt>
-<dt><a href="internals2/error_test.html"> Relative
+<dt><a href="internals2/error_test.html">Relative
 Error and Testing</a></dt>
-<dt><a href="internals2/test_data.html"> Graphing,
+<dt><a href="internals2/test_data.html">Graphing,
 Profiling, and Generating Test Data for Special Functions</a></dt>
</dl></div>
</div>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2/error_test.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2/error_test.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2/error_test.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.toolkit.internals2.error_test"></a><a class="link" href="error_test.html" title="Relative Error and Testing"> Relative
+<a name="math_toolkit.toolkit.internals2.error_test"></a><a class="link" href="error_test.html" title="Relative Error and Testing">Relative
 Error and Testing</a>
</h4></div></div></div>
<a name="math_toolkit.toolkit.internals2.error_test.synopsis"></a><h5>
-<a name="id1327511"></a>
+<a name="id1200639"></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="id1327767"></a>
+<a name="id1200894"></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="id1328792"></a>
+<a name="id1201671"></a>
 <a class="link" href="error_test.html#math_toolkit.toolkit.internals2.error_test.example">Example</a>
 </h5>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2/minimax.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2/minimax.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2/minimax.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.toolkit.internals2.minimax"></a><a class="link" href="minimax.html" title="Minimax Approximations and the Remez Algorithm"> Minimax Approximations
+<a name="math_toolkit.toolkit.internals2.minimax"></a><a class="link" href="minimax.html" title="Minimax Approximations and the Remez Algorithm">Minimax Approximations
 and the Remez Algorithm</a>
</h4></div></div></div>

@@ -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:

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2/polynomials.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2/polynomials.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2/polynomials.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,10 +24,10 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.toolkit.internals2.polynomials"></a><a class="link" href="polynomials.html" title="Polynomials"> Polynomials</a>
+<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="id1324540"></a>
+<a name="id1196576"></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="id1326599"></a>
+<a name="id1199727"></a>
 <a class="link" href="polynomials.html#math_toolkit.toolkit.internals2.polynomials.description">Description</a>
 </h5>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2/test_data.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2/test_data.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals2/test_data.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.toolkit.internals2.test_data"></a><a class="link" href="test_data.html" title="Graphing, Profiling, and Generating Test Data for Special Functions"> Graphing,
+<a name="math_toolkit.toolkit.internals2.test_data"></a><a class="link" href="test_data.html" title="Graphing, Profiling, and Generating Test Data for Special Functions">Graphing,
 Profiling, and Generating Test Data for Special Functions</a>
</h4></div></div></div>

@@ -46,7 +46,7 @@
 </li>
</ul></div>
<a name="math_toolkit.toolkit.internals2.test_data.synopsis"></a><h5>
-<a name="id1329595"></a>
+<a name="id1202474"></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="id1333538"></a>
+<a name="id1205734"></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="id1333594"></a>
+<a name="id1205791"></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="id1333998"></a>
+<a name="id1206195"></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>
@@ -376,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="id1335956"></a>
+<a name="id1208229"></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>
@@ -482,12 +482,10 @@
 of a and z.
 
<a name="math_toolkit.toolkit.internals2.test_data.reference"></a><h5>
-<a name="id1339270"></a>
+<a name="id1210980"></a>
 <a class="link" href="test_data.html#math_toolkit.toolkit.internals2.test_data.reference">reference</a>
 </h5>
<a name="test_data_reference"></a>
- 
-
 Most of this tool has been described already in the examples above, we'll
 just add the following notes on the non-member functions:

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals_overview.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals_overview.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/toolkit/internals_overview.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.toolkit.internals_overview"></a><a class="link" href="internals_overview.html" title="Overview"> Overview</a>
+<a name="math_toolkit.toolkit.internals_overview"></a><a class="link" href="internals_overview.html" title="Overview">Overview</a>
</h3></div></div></div>

This section contains internal utilities used by the library's implementation

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,19 +24,19 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="math_toolkit.using_udt"></a><a class="link" href="using_udt.html" title="Use with User-Defined Floating-Point Types"> Use with User-Defined Floating-Point
+<a name="math_toolkit.using_udt"></a><a class="link" href="using_udt.html" title="Use with User-Defined Floating-Point Types">Use with User-Defined Floating-Point
 Types</a>
</h2></div></div></div>
<div class="toc"><dl>
-<dt><a href="using_udt/use_ntl.html"> Using With NTL - a High-Precision
+<dt><a href="using_udt/use_ntl.html">Using With NTL - a High-Precision
 Floating-Point Library</a></dt>
-<dt><a href="using_udt/use_mpfr.html"> Using With MPFR / GMP
+<dt><a href="using_udt/use_mpfr.html">Using With MPFR / GMP
 - a High-Precision Floating-Point Library</a></dt>
-<dt><a href="using_udt/concepts.html"> Conceptual Requirements
+<dt><a href="using_udt/concepts.html">Conceptual Requirements
 for Real Number Types</a></dt>
-<dt><a href="using_udt/dist_concept.html"> Conceptual Requirements
+<dt><a href="using_udt/dist_concept.html">Conceptual Requirements
 for Distribution Types</a></dt>
-<dt><a href="using_udt/archetypes.html"> Conceptual Archetypes
+<dt><a href="using_udt/archetypes.html">Conceptual Archetypes
 and Testing</a></dt>
</dl></div>
</div>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/archetypes.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/archetypes.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/archetypes.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.using_udt.archetypes"></a><a class="link" href="archetypes.html" title="Conceptual Archetypes and Testing"> Conceptual Archetypes
+<a name="math_toolkit.using_udt.archetypes"></a><a class="link" href="archetypes.html" title="Conceptual Archetypes and Testing">Conceptual Archetypes
and Testing</a>
</h3></div></div></div>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/concepts.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/concepts.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/concepts.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.using_udt.concepts"></a><a class="link" href="concepts.html" title="Conceptual Requirements for Real Number Types"> Conceptual Requirements
+<a name="math_toolkit.using_udt.concepts"></a><a class="link" href="concepts.html" title="Conceptual Requirements for Real Number Types">Conceptual Requirements
 for Real Number Types</a>
</h3></div></div></div>

@@ -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="id1340323"></a>
+<a name="id1212028"></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="id1343193"></a>
+<a name="id1215713"></a>
 <a class="link" href="concepts.html#math_toolkit.using_udt.concepts.standard_library_support_requirements">Standard
 Library Support Requirements</a>
 </h5>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/dist_concept.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/dist_concept.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/dist_concept.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.using_udt.dist_concept"></a><a class="link" href="dist_concept.html" title="Conceptual Requirements for Distribution Types"> Conceptual Requirements
+<a name="math_toolkit.using_udt.dist_concept"></a><a class="link" href="dist_concept.html" title="Conceptual Requirements for Distribution Types">Conceptual Requirements
for Distribution Types</a>
</h3></div></div></div>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/use_mpfr.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/use_mpfr.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/use_mpfr.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.using_udt.use_mpfr"></a><a class="link" href="use_mpfr.html" title="Using With MPFR / GMP - a High-Precision Floating-Point Library"> Using With MPFR / GMP
+<a name="math_toolkit.using_udt.use_mpfr"></a><a class="link" href="use_mpfr.html" title="Using With MPFR / GMP - a High-Precision Floating-Point Library">Using With MPFR / GMP
- a High-Precision Floating-Point Library</a>
</h3></div></div></div>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/use_ntl.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/use_ntl.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/using_udt/use_ntl.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.using_udt.use_ntl"></a><a class="link" href="use_ntl.html" title="Using With NTL - a High-Precision Floating-Point Library"> Using With NTL - a High-Precision
+<a name="math_toolkit.using_udt.use_ntl"></a><a class="link" href="use_ntl.html" title="Using With NTL - a High-Precision Floating-Point Library">Using With NTL - a High-Precision
Floating-Point Library</a>
</h3></div></div></div>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/utils.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/utils.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/utils.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,38 +24,36 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="math_toolkit.utils"></a><a class="link" href="utils.html" title="Floating Point Utilities"> Floating Point Utilities</a>
+<a name="math_toolkit.utils"></a><a class="link" href="utils.html" title="Floating Point Utilities">Floating Point Utilities</a>
</h2></div></div></div>
<div class="toc"><dl>
-<dt><a href="utils/rounding.html"> Rounding Truncation and
+<dt><a href="utils/rounding.html">Rounding Truncation and
 Integer Conversion</a></dt>
<dd><dl>
-<dt> Rounding Functions</dt>
-<dt> Truncation Functions</dt>
-<dt><a href="utils/rounding/modf.html"> Integer and Fractional
+<dt>Rounding Functions</dt>
+<dt>Truncation Functions</dt>
+<dt><a href="utils/rounding/modf.html">Integer and Fractional
 Part Splitting (modf)</a></dt>
</dl></dd>
-<dt><a href="utils/fpclass.html"> Floating-Point Classification:
+<dt><a href="utils/fpclass.html">Floating-Point Classification:
 Infinities and NaN's</a></dt>
-<dt><a href="utils/sign_functions.html"> Sign Manipulation
+<dt><a href="utils/sign_functions.html">Sign Manipulation
 Functions</a></dt>
-<dt><a href="utils/next_float.html"> Floating-Point Representation
+<dt><a href="utils/next_float.html">Floating-Point Representation
 Distance (ULP), and Finding Adjacent Floating-Point Values</a></dt>
<dd><dl>
-<dt><a href="utils/next_float/nextafter.html"> Finding the
+<dt><a href="utils/next_float/nextafter.html">Finding the
 Next Representable Value in a Specific Direction (nextafter)</a></dt>
-<dt><a href="utils/next_float/float_next.html"> Finding
- the Next Greater Representable Value (float_next)</a></dt>
-<dt><a href="utils/next_float/float_prior.html"> Finding
+<dt><a href="utils/next_float/float_next.html">Finding the
+ Next Greater Representable Value (float_next)</a></dt>
+<dt><a href="utils/next_float/float_prior.html">Finding
 the Next Smaller Representable Value (float_prior)</a></dt>
-<dt><a href="utils/next_float/float_distance.html"> Calculating
+<dt><a href="utils/next_float/float_distance.html">Calculating
 the Representation Distance Between Two Floating Point Values (ULP) float_distance</a></dt>
-<dt><a href="utils/next_float/float_advance.html"> Advancing
+<dt><a href="utils/next_float/float_advance.html">Advancing
 a Floating Point Value by a Specific Representation Distance (ULP) float_advance</a></dt>
</dl></dd>
</dl></div>
-
- 
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/utils/fpclass.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/utils/fpclass.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/utils/fpclass.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.utils.fpclass"></a><a class="link" href="fpclass.html" title="Floating-Point Classification: Infinities and NaN's"> Floating-Point Classification:
+<a name="math_toolkit.utils.fpclass"></a><a class="link" href="fpclass.html" title="Floating-Point Classification: Infinities and NaN's">Floating-Point Classification:
 Infinities and NaN's</a>
</h3></div></div></div>
<a name="math_toolkit.utils.fpclass.synopsis"></a><h5>
-<a name="id1268478"></a>
+<a name="id1140440"></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="id1268869"></a>
+<a name="id1140832"></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

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,19 +24,19 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.utils.next_float"></a><a class="link" href="next_float.html" title="Floating-Point Representation Distance (ULP), and Finding Adjacent Floating-Point Values"> Floating-Point Representation
+<a name="math_toolkit.utils.next_float"></a><a class="link" href="next_float.html" title="Floating-Point Representation Distance (ULP), and Finding Adjacent Floating-Point Values">Floating-Point Representation
 Distance (ULP), and Finding Adjacent Floating-Point Values</a>
</h3></div></div></div>
<div class="toc"><dl>
-<dt><a href="next_float/nextafter.html"> Finding the
+<dt><a href="next_float/nextafter.html">Finding the
 Next Representable Value in a Specific Direction (nextafter)</a></dt>
-<dt><a href="next_float/float_next.html"> Finding
- the Next Greater Representable Value (float_next)</a></dt>
-<dt><a href="next_float/float_prior.html"> Finding
+<dt><a href="next_float/float_next.html">Finding the
+ Next Greater Representable Value (float_next)</a></dt>
+<dt><a href="next_float/float_prior.html">Finding
 the Next Smaller Representable Value (float_prior)</a></dt>
-<dt><a href="next_float/float_distance.html"> Calculating
+<dt><a href="next_float/float_distance.html">Calculating
 the Representation Distance Between Two Floating Point Values (ULP) float_distance</a></dt>
-<dt><a href="next_float/float_advance.html"> Advancing
+<dt><a href="next_float/float_advance.html">Advancing
 a Floating Point Value by a Specific Representation Distance (ULP) float_advance</a></dt>
</dl></div>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/float_advance.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/float_advance.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/float_advance.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.utils.next_float.float_advance"></a><a class="link" href="float_advance.html" title="Advancing a Floating Point Value by a Specific Representation Distance (ULP) float_advance"> Advancing
+<a name="math_toolkit.utils.next_float.float_advance"></a><a class="link" href="float_advance.html" title="Advancing a Floating Point Value by a Specific Representation Distance (ULP) float_advance">Advancing
 a Floating Point Value by a Specific Representation Distance (ULP) float_advance</a>
</h4></div></div></div>

@@ -32,7 +32,7 @@
 number of ULP.
 
<a name="math_toolkit.utils.next_float.float_advance.synopsis"></a><h5>
-<a name="id1274016"></a>
+<a name="id1145910"></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="id1274181"></a>
+<a name="id1146075"></a>
 <a class="link" href="float_advance.html#math_toolkit.utils.next_float.float_advance.description___float_advance">Description
 - float_advance</a>
 </h5>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/float_distance.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/float_distance.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/float_distance.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.utils.next_float.float_distance"></a><a class="link" href="float_distance.html" title="Calculating the Representation Distance Between Two Floating Point Values (ULP) float_distance"> Calculating
+<a name="math_toolkit.utils.next_float.float_distance"></a><a class="link" href="float_distance.html" title="Calculating the Representation Distance Between Two Floating Point Values (ULP) float_distance">Calculating
 the Representation Distance Between Two Floating Point Values (ULP) float_distance</a>
</h4></div></div></div>

@@ -34,7 +34,7 @@
 different.
 
<a name="math_toolkit.utils.next_float.float_distance.synopsis"></a><h5>
-<a name="id1271870"></a>
+<a name="id1145540"></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="id1272035"></a>
+<a name="id1145704"></a>
 <a class="link" href="float_distance.html#math_toolkit.utils.next_float.float_distance.description___float_distance">Description
 - float_distance</a>
 </h5>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/float_next.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/float_next.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/float_next.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.utils.next_float.float_next"></a><a class="link" href="float_next.html" title="Finding the Next Greater Representable Value (float_next)"> Finding
- the Next Greater Representable Value (float_next)</a>
+<a name="math_toolkit.utils.next_float.float_next"></a><a class="link" href="float_next.html" title="Finding the Next Greater Representable Value (float_next)">Finding the
+ Next Greater Representable Value (float_next)</a>
</h4></div></div></div>
<a name="math_toolkit.utils.next_float.float_next.synopsis"></a><h5>
-<a name="id1271355"></a>
+<a name="id1142840"></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="id1271507"></a>
+<a name="id1142991"></a>
 <a class="link" href="float_next.html#math_toolkit.utils.next_float.float_next.description___float_next">Description
 - float_next</a>
 </h5>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/float_prior.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/float_prior.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/float_prior.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.utils.next_float.float_prior"></a><a class="link" href="float_prior.html" title="Finding the Next Smaller Representable Value (float_prior)"> Finding
+<a name="math_toolkit.utils.next_float.float_prior"></a><a class="link" href="float_prior.html" title="Finding the Next Smaller Representable Value (float_prior)">Finding
 the Next Smaller Representable Value (float_prior)</a>
</h4></div></div></div>
<a name="math_toolkit.utils.next_float.float_prior.synopsis"></a><h5>
-<a name="id1271607"></a>
+<a name="id1143092"></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="id1271759"></a>
+<a name="id1145428"></a>
 <a class="link" href="float_prior.html#math_toolkit.utils.next_float.float_prior.description___float_prior">Description
 - float_prior</a>
 </h5>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/nextafter.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/nextafter.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/utils/next_float/nextafter.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.utils.next_float.nextafter"></a><a class="link" href="nextafter.html" title="Finding the Next Representable Value in a Specific Direction (nextafter)"> Finding the
+<a name="math_toolkit.utils.next_float.nextafter"></a><a class="link" href="nextafter.html" title="Finding the Next Representable Value in a Specific Direction (nextafter)">Finding the
 Next Representable Value in a Specific Direction (nextafter)</a>
</h4></div></div></div>
<a name="math_toolkit.utils.next_float.nextafter.synopsis"></a><h5>
-<a name="id1270829"></a>
+<a name="id1142313"></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="id1270995"></a>
+<a name="id1142480"></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="id1271081"></a>
+<a name="id1142565"></a>
 <a class="link" href="nextafter.html#math_toolkit.utils.next_float.nextafter.examples___nextafter">Examples
 - nextafter</a>
 </h5>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/utils/rounding.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/utils/rounding.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/utils/rounding.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,13 +24,13 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.utils.rounding"></a><a class="link" href="rounding.html" title="Rounding Truncation and Integer Conversion"> Rounding Truncation and
+<a name="math_toolkit.utils.rounding"></a><a class="link" href="rounding.html" title="Rounding Truncation and Integer Conversion">Rounding Truncation and
Integer Conversion</a>
</h3></div></div></div>
<div class="toc"><dl>
-<dt> Rounding Functions</dt>
-<dt> Truncation Functions</dt>
-<dt><a href="rounding/modf.html"> Integer and Fractional
+<dt>Rounding Functions</dt>
+<dt>Truncation Functions</dt>
+<dt><a href="rounding/modf.html">Integer and Fractional
Part Splitting (modf)</a></dt>
</dl></div>
</div>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/utils/rounding/modf.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/utils/rounding/modf.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/utils/rounding/modf.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.utils.rounding.modf"></a><a class="link" href="modf.html" title="Integer and Fractional Part Splitting (modf)"> Integer and Fractional
+<a name="math_toolkit.utils.rounding.modf"></a><a class="link" href="modf.html" title="Integer and Fractional Part Splitting (modf)">Integer and Fractional
Part Splitting (modf)</a>
</h4></div></div></div>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/utils/rounding/round.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/utils/rounding/round.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/utils/rounding/round.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.utils.rounding.round"></a><a class="link" href="round.html" title="Rounding Functions"> Rounding Functions</a>
+<a name="math_toolkit.utils.rounding.round"></a><a class="link" href="round.html" title="Rounding Functions">Rounding Functions</a>
</h4></div></div></div>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/utils/rounding/trunc.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/utils/rounding/trunc.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/utils/rounding/trunc.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,7 +24,7 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h4 class="title">
-<a name="math_toolkit.utils.rounding.trunc"></a><a class="link" href="trunc.html" title="Truncation Functions"> Truncation Functions</a>
+<a name="math_toolkit.utils.rounding.trunc"></a><a class="link" href="trunc.html" title="Truncation Functions">Truncation Functions</a>
</h4></div></div></div>

Modified: trunk/libs/math/doc/sf_and_dist/html/math_toolkit/utils/sign_functions.html
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html/math_toolkit/utils/sign_functions.html (original)
+++ trunk/libs/math/doc/sf_and_dist/html/math_toolkit/utils/sign_functions.html 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -24,11 +24,11 @@
</div>
<div class="section" lang="en">
<div class="titlepage"><div><div><h3 class="title">
-<a name="math_toolkit.utils.sign_functions"></a><a class="link" href="sign_functions.html" title="Sign Manipulation Functions"> Sign Manipulation
+<a name="math_toolkit.utils.sign_functions"></a><a class="link" href="sign_functions.html" title="Sign Manipulation Functions">Sign Manipulation
 Functions</a>
</h3></div></div></div>
<a name="math_toolkit.utils.sign_functions.synopsis"></a><h5>
-<a name="id1270173"></a>
+<a name="id1141658"></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="id1270467"></a>
+<a name="id1141952"></a>
 <a class="link" href="sign_functions.html#math_toolkit.utils.sign_functions.description">Description</a>
 </h5>
<pre class="programlisting">template<class T>

Modified: trunk/libs/math/doc/sf_and_dist/html4_symbols.qbk
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/html4_symbols.qbk (original)
+++ trunk/libs/math/doc/sf_and_dist/html4_symbols.qbk 2010-09-29 05:23:59 EDT (Wed, 29 Sep 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: trunk/libs/math/doc/sf_and_dist/implementation.qbk
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/implementation.qbk (original)
+++ trunk/libs/math/doc/sf_and_dist/implementation.qbk 2010-09-29 05:23:59 EDT (Wed, 29 Sep 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,10 +167,12 @@
[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 numerical approximation for distribution `dist` may be available by calling
+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)` (this is the /mathematical/ definition of course).

@@ -394,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\/.
@@ -570,7 +579,9 @@
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]

Modified: trunk/libs/math/doc/sf_and_dist/issues.qbk
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/issues.qbk (original)
+++ trunk/libs/math/doc/sf_and_dist/issues.qbk 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -122,7 +122,6 @@
[[Double Gamma][-][-][-][X][-]]
[[Double Weibul][-][-][-][X][-]]
[[Hyperbolic Secant][-][-][-][X][-]]
-[[Laplace][-][-][-][X][-]]
[[Semicircular][-][-][-][X][-]]
[[Bradford][-][-][-][X][-]]
[[Birr / Fisk][-][-][-][X][-]]

Modified: trunk/libs/math/doc/sf_and_dist/latin1_symbols.qbk
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/latin1_symbols.qbk (original)
+++ trunk/libs/math/doc/sf_and_dist/latin1_symbols.qbk 2010-09-29 05:23:59 EDT (Wed, 29 Sep 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: trunk/libs/math/doc/sf_and_dist/license.qbk
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/license.qbk (original)
+++ trunk/libs/math/doc/sf_and_dist/license.qbk 2010-09-29 05:23:59 EDT (Wed, 29 Sep 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: trunk/libs/math/doc/sf_and_dist/math.qbk
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/math.qbk (original)
+++ trunk/libs/math/doc/sf_and_dist/math.qbk 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -11,6 +11,8 @@
 [/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>
@@ -29,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!]
@@ -37,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 '''⌉''']
@@ -51,16 +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 __R [@http://www.r-project.org/ The R Project for Statistical Computing]]
-
-[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]]
@@ -203,7 +199,6 @@
[/tools]
[def __tuple [link math_toolkit.toolkit.internals1.tuples boost::math::tuple]]

-
[/ distribution non-members]
[def __cdf [link math.dist.cdf Cumulative Distribution Function]]
[def __pdf [link math.dist.pdf Probability Density Function]]
@@ -233,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]]
@@ -257,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,
@@ -266,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>''']
@@ -317,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]
@@ -346,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]
@@ -446,7 +465,7 @@
[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]

@@ -466,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: trunk/libs/math/doc/sf_and_dist/minimax.qbk
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/minimax.qbk (original)
+++ trunk/libs/math/doc/sf_and_dist/minimax.qbk 2010-09-29 05:23:59 EDT (Wed, 29 Sep 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: trunk/libs/math/doc/sf_and_dist/performance.qbk
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/performance.qbk (original)
+++ trunk/libs/math/doc/sf_and_dist/performance.qbk 2010-09-29 05:23:59 EDT (Wed, 29 Sep 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: trunk/libs/math/doc/sf_and_dist/policy.qbk
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/policy.qbk (original)
+++ trunk/libs/math/doc/sf_and_dist/policy.qbk 2010-09-29 05:23:59 EDT (Wed, 29 Sep 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]

Modified: trunk/libs/math/doc/sf_and_dist/policy_tutorial.qbk
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/policy_tutorial.qbk (original)
+++ trunk/libs/math/doc/sf_and_dist/policy_tutorial.qbk 2010-09-29 05:23:59 EDT (Wed, 29 Sep 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]
@@ -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: trunk/libs/math/doc/sf_and_dist/references.qbk
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/references.qbk (original)
+++ trunk/libs/math/doc/sf_and_dist/references.qbk 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -76,8 +76,23 @@
[@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, Jim Albert, Bayesian Computation with R, ISBN 978-0-387-71384-7.
+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]
[/

Modified: trunk/libs/math/doc/sf_and_dist/roadmap.qbk
==============================================================================
--- trunk/libs/math/doc/sf_and_dist/roadmap.qbk (original)
+++ trunk/libs/math/doc/sf_and_dist/roadmap.qbk 2010-09-29 05:23:59 EDT (Wed, 29 Sep 2010)
@@ -3,7 +3,8 @@
[h4 Boost-1.45.0]

* Added warnings about potential ambiguity with std random library in distribution and function names.
-* Added inverse gamma distribution at request of Thomas Mang.
+* 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]

@@ -109,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).

Next message: pbristow_at_[hidden]: "[Boost-commit] svn:boost r65665 - trunk/libs/math/example"
Previous message: pbristow_at_[hidden]: "[Boost-commit] svn:boost r65662 - trunk/libs/math/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