diff options
author | vlefevre <vlefevre@280ebfd0-de03-0410-8827-d642c229c3f4> | 2007-03-29 01:58:23 +0000 |
---|---|---|
committer | vlefevre <vlefevre@280ebfd0-de03-0410-8827-d642c229c3f4> | 2007-03-29 01:58:23 +0000 |
commit | 0d3ce2d69534bfd467da09846fe178f683b15cf4 (patch) | |
tree | 7d6edf7feb2760c517b7415e26b47eb6edb4ff6b | |
parent | ba8e9f31a57871a0009b6e7121c2040e8debf7c1 (diff) | |
download | mpfr-2.2.tar.gz |
Fixed typos in comments.2.2
git-svn-id: svn://scm.gforge.inria.fr/svn/mpfr/branches/2.2@4394 280ebfd0-de03-0410-8827-d642c229c3f4
-rw-r--r-- | get_str.c | 4 |
1 files changed, 2 insertions, 2 deletions
@@ -187,7 +187,7 @@ mpfr_ceil_double (double x) /* Input: an approximation r*2^f of an real Y, with |r*2^f-Y| <= 2^(e+f). Returns if possible in the string s the mantissa corresponding to the integer nearest to Y, within the direction rnd, and returns the - the exponent in exp. + exponent in exp. n is the number of limbs of r. e represents the maximal error in the approximation of Y (e < 0 iff the approximation is exact, i.e. r*2^f = Y). @@ -200,7 +200,7 @@ mpfr_ceil_double (double x) Rounding may fail for two reasons: - the error is too large to determine the integer N nearest to Y - either the number of digits of N in base b is too large (m+1), - N=2*N1+(b/2) and the rounding mode is too nearest. This can + N=2*N1+(b/2) and the rounding mode is to nearest. This can only happen when b is even. Return value: |