Kaydet (Commit) 2bcd1772 authored tarafından Mark Dickinson's avatar Mark Dickinson

Fix typo in comment.

üst 81982566
......@@ -927,7 +927,7 @@ b2d(Bigint *a, int *e)
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.
*/
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment