Mirror
/
cpython
mirror of https://github.com/python/cpython
4
1
Fork 0
Code Issues Releases Wiki Activity

Replace math.sum with math.fsum in a couple of comments 

that were missed by r65308
This commit is contained in:
Mark Dickinson 2008-07-30 16:25:16 +00:00
parent fef6b13c32
commit ff3fdce0d2
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
Modules/mathmodule.c
View File

@ -341,7 +341,7 @@ FUNC1(tanh, tanh, 0,
Note 4: A similar implementation is in Modules/cmathmodule.c. Note 4: A similar implementation is in Modules/cmathmodule.c.
Be sure to update both when making changes. Be sure to update both when making changes.
Note 5: The signature of math.sum() differs from __builtin__.sum() Note 5: The signature of math.fsum() differs from __builtin__.sum()
because the start argument doesn't make sense in the context of because the start argument doesn't make sense in the context of
accurate summation. Since the partials table is collapsed before accurate summation. Since the partials table is collapsed before
returning a result, sum(seq2, start=sum(seq1)) may not equal the returning a result, sum(seq2, start=sum(seq1)) may not equal the
@ -506,7 +506,7 @@ math_fsum(PyObject *self, PyObject *seq)
Needed so that sum([1e-16, 1, 1e16]) will round-up the last Needed so that sum([1e-16, 1, 1e16]) will round-up the last
digit to two instead of down to zero (the 1e-16 makes the 1 digit to two instead of down to zero (the 1e-16 makes the 1
slightly closer to two). With a potential 1 ULP rounding slightly closer to two). With a potential 1 ULP rounding
error fixed-up, math.sum() can guarantee commutativity. */ error fixed-up, math.fsum() can guarantee commutativity. */
if (n > 0 && ((lo < 0.0 && p[n-1] < 0.0) || if (n > 0 && ((lo < 0.0 && p[n-1] < 0.0) ||
(lo > 0.0 && p[n-1] > 0.0))) { (lo > 0.0 && p[n-1] > 0.0))) {
y = lo * 2.0; y = lo * 2.0;