commit | 2bcd17727027b6c923340209f8c6b92e34c69556 | [log] [tgz] |
---|---|---|
author | Mark Dickinson <dickinsm@gmail.com> | Mon Jan 04 21:32:02 2010 +0000 |
committer | Mark Dickinson <dickinsm@gmail.com> | Mon Jan 04 21:32:02 2010 +0000 |
tree | 811a6d8b97ff2a832190bc3758d911d74b4ea36d | |
parent | 81982566aaed700e16ad0a4ef5b85e4555d79da7 [diff] |
Fix typo in comment.
diff --git a/Python/dtoa.c b/Python/dtoa.c index 1cac941..4f8bab7 100644 --- a/Python/dtoa.c +++ b/Python/dtoa.c
@@ -927,7 +927,7 @@ Given a finite nonzero double d, return an odd Bigint b and exponent *e such that fabs(d) = b * 2**e. On return, *bbits gives the number of - significant bits of e; that is, 2**(*bbits-1) <= b < 2**(*bbits). + significant bits of b; that is, 2**(*bbits-1) <= b < 2**(*bbits). If d is zero, then b == 0, *e == -1010, *bbits = 0. */