
BoostCommit : 
Subject: [Boostcommit] svn:boost r50419  sandbox/math_toolkit/libs/math/doc/sf_and_dist/distributions
From: john_at_[hidden]
Date: 20081231 12:26:14
Author: johnmaddock
Date: 20081231 12:26:14 EST (Wed, 31 Dec 2008)
New Revision: 50419
URL: http://svn.boost.org/trac/boost/changeset/50419
Log:
Fix spelling!
Text files modified:
sandbox/math_toolkit/libs/math/doc/sf_and_dist/distributions/hypergeometric.qbk  8 ++++
1 files changed, 4 insertions(+), 4 deletions()
Modified: sandbox/math_toolkit/libs/math/doc/sf_and_dist/distributions/hypergeometric.qbk
==============================================================================
 sandbox/math_toolkit/libs/math/doc/sf_and_dist/distributions/hypergeometric.qbk (original)
+++ sandbox/math_toolkit/libs/math/doc/sf_and_dist/distributions/hypergeometric.qbk 20081231 12:26:14 EST (Wed, 31 Dec 2008)
@@ 95,7 +95,7 @@
describe how to change the rounding policy
for these distributions.
However, note that the implememtation method of the quantile function
+However, note that the implementation method of the quantile function
always returns an integral value, therefore attempting to use a __Policy
that requires (or produces) a real valued result will result in a
compile time error.
@@ 129,7 +129,7 @@
[equation hypergeometric1]
However, this can only be used directly when the largest of the factorials
is guarenteed not to overflow the floating point representation used.
+is guaranteed not to overflow the floating point representation used.
This formula is used directly when `N < max_factorial<RealType>::value`
in which case table lookup of the factorials gives a rapid and accurate
implementation method.
@@ 163,14 +163,14 @@
calculation into a series of subproducts, with a new subproduct
started each time the next multiplication would cause either overflow
or underflow. The subproducts are stored in a linked list on the
program stack, and combined in an order that will guarentee no overflow
+program stack, and combined in an order that will guarantee no overflow
or unnecessaryunderflow once the last subproduct has been calculated.
This method can be used as long as N is smaller than the largest prime
number we have stored in our table of primes (currently 104729). The method
is relatively slow (calculating the exponents requires the most time), but
requires only a small number of arithmetic operations to
calculate the result (indeed there is no shorter method involing only basic
+calculate the result (indeed there is no shorter method involving only basic
arithmetic once the exponents have been found), the method is therefore
much more accurate than the alternatives.
BoostCommit 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