forked from jbeder/yaml-cpp
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
fix: prettier floating point numbers
Add dragonbox to compute the required precision to print floating point numbers. This avoids uglification of floating point numbers that happen by default via std::stringstream. Numbers like 34.34 used to be converted to '34.340000000000003' as strings. With this version they will be converted to the string '34.34'. This fixes issue jbeder#1289
- Loading branch information
Showing
7 changed files
with
4,656 additions
and
5 deletions.
There are no files selected for viewing
Large diffs are not rendered by default.
Oops, something went wrong.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,206 @@ | ||
// SPDX-FileCopyrightText: 2024 Simon Gene Gottlieb | ||
// SPDX-License-Identifier: MIT | ||
|
||
#ifndef YAML_H_FP_TO_STRING | ||
#define YAML_H_FP_TO_STRING | ||
|
||
#include "contrib/dragonbox.h" | ||
|
||
#include <array> | ||
#include <cassert> | ||
#include <cmath> | ||
#include <sstream> | ||
#include <tuple> | ||
|
||
namespace YAML { | ||
namespace detail { | ||
namespace fp_formatting { | ||
|
||
/** | ||
* Converts a integer into its ASCII digits. | ||
* | ||
* @param begin/end - a buffer, must be at least 20bytes long | ||
* @param value - input value | ||
* @param width - minimum number of digits, fill with '0' to the left. Must be equal or smaller than the buffer size. | ||
* @return - number of digits filled into the buffer. | ||
* | ||
* Example: | ||
* std::array<char, 20> buffer; | ||
* auto ct = convertToChars(buffer.begin(), buffer.end(), 23, 3); | ||
* assert(ct = 3); | ||
* assert(buffer[0] == '0'); | ||
* assert(buffer[1] == '2'); | ||
* assert(buffer[2] == '3'); | ||
*/ | ||
inline auto convertToChars(char* begin, char* end, size_t value, int width=1) -> int { | ||
assert(width >= 1); | ||
assert(end >= begin); // end must be after begin | ||
assert(end-begin >= width); // Buffer must be large enough | ||
assert(end-begin >= 20); // 2^64 has 20digits, so at least 20 digits must be available | ||
|
||
// count number of digits, and fill digits array accordingly | ||
int digits_ct{}; | ||
while (value > 0) { | ||
char c = value % 10 + '0'; | ||
value = value / 10; | ||
digits_ct += 1; | ||
*(end-digits_ct) = c; | ||
} | ||
while(digits_ct < width) { | ||
assert(digits_ct < 64); | ||
digits_ct += 1; | ||
*(end-digits_ct) = '0'; | ||
} | ||
// move data to the front of the array | ||
std::memmove(begin, end-digits_ct, digits_ct); | ||
return digits_ct; | ||
} | ||
|
||
/** | ||
* Converts a float or double to a string. | ||
* | ||
* converts a value 'v' to a string. Uses dragonbox for formatting. | ||
*/ | ||
template <typename T> | ||
auto fp_to_string(T v, int precision = 0) -> std::string { | ||
// assert(precision > 0); | ||
// hardcoded constant, at which exponent should switch to a scientific notation | ||
int const lowerExponentThreshold = -5; | ||
int const upperExponentThreshold = (precision==0)?6:precision; | ||
if (precision == 0) { | ||
precision = 6; | ||
} | ||
|
||
// dragonbox/to_decimal does not handle value 0, inf, NaN | ||
if (v == 0 || std::isinf(v) || std::isnan(v)) { | ||
std::stringstream ss; | ||
ss << v; | ||
return ss.str(); | ||
} | ||
|
||
auto r = jkj::dragonbox::to_decimal(v); | ||
|
||
auto digits = std::array<char, 20>{}; // max digits of size_t is 20. | ||
auto digits_ct = convertToChars(digits.data(), digits.data() + digits.size(), r.significand); | ||
|
||
// check if requested precision is lower than | ||
// required digits for exact representation | ||
if (digits_ct > precision) { | ||
auto diff = digits_ct - precision; | ||
r.exponent += diff; | ||
digits_ct = precision; | ||
|
||
// round numbers if required | ||
if (digits[digits_ct] >= '5') { | ||
int i{digits_ct-1}; | ||
digits[i] += 1; | ||
while (digits[i] == '9'+1) { | ||
digits_ct -= 1; | ||
r.exponent += 1; | ||
if (i > 0) { | ||
digits[i-1] += 1; | ||
i -= 1; | ||
} else { | ||
digits_ct = 1; | ||
digits[0] = '1'; | ||
break; | ||
} | ||
} | ||
} | ||
} | ||
|
||
std::array<char, 28> output_buffer; // max digits of size_t plus sign, a dot and 2 letters for 'e+' or 'e-' and 4 letters for the exponent | ||
auto output_ptr = &output_buffer[0]; | ||
|
||
// print '-' symbol for negative numbers | ||
if (r.is_negative) { | ||
*(output_ptr++) = '-'; | ||
} | ||
|
||
// exponent if only a single non-zero digit is before the decimal point | ||
int const exponent = r.exponent + digits_ct - 1; | ||
|
||
// case 1: scientific notation | ||
if (exponent >= upperExponentThreshold || exponent <= lowerExponentThreshold) { | ||
// print first digit | ||
*(output_ptr++) = digits[0]; | ||
|
||
// print digits after decimal point | ||
if (digits_ct > 1) { | ||
*(output_ptr++) = '.'; | ||
// print significant numbers after decimal point | ||
for (int i{1}; i < digits_ct; ++i) { | ||
*(output_ptr++) = digits[i]; | ||
} | ||
} | ||
*(output_ptr++) = 'e'; | ||
*(output_ptr++) = (exponent>=0)?'+':'-'; | ||
auto exp_digits = std::array<char, 20>{}; | ||
auto exp_digits_ct = convertToChars(exp_digits.data(), exp_digits.data() + exp_digits.size(), std::abs(exponent), /*.precision=*/ 2); | ||
for (int i{0}; i < exp_digits_ct; ++i) { | ||
*(output_ptr++) = exp_digits[i]; | ||
} | ||
|
||
// case 2: default notation | ||
} else { | ||
auto const digits_end = digits.begin() + digits_ct; | ||
auto digits_iter = digits.begin(); | ||
|
||
// print digits before point | ||
int const before_decimal_digits = digits_ct + r.exponent; | ||
if (before_decimal_digits > 0) { | ||
// print digits before point | ||
for (int i{0}; i < std::min(before_decimal_digits, digits_ct); ++i) { | ||
*(output_ptr++) = *(digits_iter++); | ||
} | ||
// print trailing zeros before point | ||
for (int i{0}; i < before_decimal_digits - digits_ct; ++i) { | ||
*(output_ptr++) = '0'; | ||
} | ||
|
||
// print 0 before point if none where printed before | ||
} else { | ||
*(output_ptr++) = '0'; | ||
} | ||
|
||
if (digits_iter != digits_end) { | ||
*(output_ptr++) = '.'; | ||
// print 0 afer decimal point, to fill until first digits | ||
int const after_decimal_zeros = -digits_ct - r.exponent; | ||
for (int i{0}; i < after_decimal_zeros; ++i) { | ||
*(output_ptr++) = '0'; | ||
} | ||
|
||
// print significant numbers after decimal point | ||
for (;digits_iter < digits_end; ++digits_iter) { | ||
*(output_ptr++) = *digits_iter; | ||
} | ||
} | ||
} | ||
*output_ptr = '\0'; | ||
return std::string{&output_buffer[0], output_ptr}; | ||
} | ||
|
||
} | ||
} | ||
|
||
inline auto fp_to_string(float v, size_t precision = 0) -> std::string { | ||
return detail::fp_formatting::fp_to_string(v, precision); | ||
} | ||
|
||
inline auto fp_to_string(double v, size_t precision = 0) -> std::string { | ||
return detail::fp_formatting::fp_to_string(v, precision); | ||
} | ||
|
||
/** | ||
* dragonbox only works for floats/doubles not long double | ||
*/ | ||
inline auto fp_to_string(long double v, size_t precision = std::numeric_limits<long double>::max_digits10) -> std::string { | ||
std::stringstream ss; | ||
ss.precision(precision); | ||
ss << v; | ||
return ss.str(); | ||
} | ||
|
||
} | ||
#endif |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.