coffee/fast_float
1
0
Fork 0
mirror of https://github.com/fastfloat/fast_float.git synced 2025-12-06 16:56:57 +08:00
Code Issues Packages Projects Releases Wiki Activity

compilation fix

Browse Source
This commit is contained in:
IRainman 2025-05-06 23:03:56 +03:00
parent 1ec5f0880c
commit 036ba0d153
2 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
include/fast_float/ascii_number.h
View File

@ -374,7 +374,7 @@ parse_number_string(UC const *p, UC const *pend,
answer.exponent = static_cast<am_pow_t>(before - p); answer.exponent = static_cast<am_pow_t>(before - p);
answer.fraction = answer.fraction =
span<UC const>(before, static_cast<am_digits>(p - before)); span<UC const>(before, static_cast<am_digits>(p - before));
digit_count -= answer.exponent; digit_count -= static_cast<am_digits>(answer.exponent);
#ifndef FASTFLOAT_ONLY_POSITIVE_C_NUMBER_WO_INF_NAN #ifndef FASTFLOAT_ONLY_POSITIVE_C_NUMBER_WO_INF_NAN
FASTFLOAT_IF_CONSTEXPR17(basic_json_fmt) { FASTFLOAT_IF_CONSTEXPR17(basic_json_fmt) {
// at least 1 digit in fractional part // at least 1 digit in fractional part

2
include/fast_float/decimal_to_binary.h
View File

@ -140,7 +140,7 @@ compute_float(int64_t q, uint64_t w) noexcept {
// practice, we can win big with the compute_product_approximation if its // practice, we can win big with the compute_product_approximation if its
// additional branch is easily predicted. Which is best is data specific. // additional branch is easily predicted. Which is best is data specific.
limb_t upperbit = limb_t(product.high >> 63); limb_t upperbit = limb_t(product.high >> 63);
limb_t shift = upperbit + 64 - binary::mantissa_explicit_bits() - 3; limb_t shift = limb_t(upperbit + 64 - binary::mantissa_explicit_bits() - 3);
answer.mantissa = product.high >> shift; answer.mantissa = product.high >> shift;