mirror/fmt
1
0
Fork 0
mirror of https://github.com/fmtlib/fmt.git synced 2025-02-20 18:40:44 +00:00
Code Issues Packages Projects Releases Wiki Activity

Improve comments

Browse Source
This commit is contained in:
Junekey Jeon 2022-01-18 15:39:42 -08:00 committed by Victor Zverovich
parent 925b744ae8
commit 6240d02011
1 changed files with 9 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
include/fmt/format-inl.h
View File

@ -2035,11 +2035,15 @@ template <typename T> decimal_fp<T> to_decimal(T x) FMT_NOEXCEPT {
const carrier_uint two_fc = significand << 1; const carrier_uint two_fc = significand << 1;
// For the case of binary32, the result of integer check is not correct for // For the case of binary32, the result of integer check is not correct for
// 29711844 * 2^-81, and it is the unique counterexample. However, since // 29711844 * 2^-82
// 29711844 is even, this does not cause any problem for the endpoints; it can // = 6.1442653300000000008655037797566933477355632930994033813476... * 10^-18
// only cause a problem when we need to perform integer check for the center. // and 29711844 * 2^-81
// Fortunately, with the input 297184444 * 2^-81, that branch is never // = 1.2288530660000000001731007559513386695471126586198806762695... * 10^-17,
// executed, so we are fine. // and they are the unique counterexamples. However, since 29711844 is even,
// this does not cause any problem for the endpoints calculations; it can only
// cause a problem when we need to perform integer check for the center.
// Fortunately, with these inputs, that branch is never executed, so we are
// fine.
const typename cache_accessor<T>::compute_mul_result z_mul = const typename cache_accessor<T>::compute_mul_result z_mul =
cache_accessor<T>::compute_mul((two_fc | 1) << beta_minus_1, cache); cache_accessor<T>::compute_mul((two_fc | 1) << beta_minus_1, cache);