1berry/cpython
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Fix inconsequential typo in math.remainder algorithm comments. (#14746)

Browse Source
This commit is contained in:
Mark Dickinson 2019-07-13 16:50:03 +01:00 committed by GitHub
parent e44184749c
commit 014847034b
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
Modules/mathmodule.c
View File

@ -646,7 +646,7 @@ m_remainder(double x, double y)
Warning: some subtlety here. What we *want* to know at this point is Warning: some subtlety here. What we *want* to know at this point is
whether the remainder m is less than, equal to, or greater than half whether the remainder m is less than, equal to, or greater than half
of absy. However, we can't do that comparison directly because we of absy. However, we can't do that comparison directly because we
can't be sure that 0.5*absy is representable (the mutiplication can't be sure that 0.5*absy is representable (the multiplication
might incur precision loss due to underflow). So instead we compare might incur precision loss due to underflow). So instead we compare
m with the complement c = absy - m: m < 0.5*absy if and only if m < m with the complement c = absy - m: m < 0.5*absy if and only if m <
c, and so on. The catch is that absy - m might also not be c, and so on. The catch is that absy - m might also not be