mirror of
https://github.com/nlohmann/json.git
synced 2026-09-07 16:57:59 +00:00
Compare commits
| Author | SHA1 | Date | |
|---|---|---|---|
|
|
d027f06a42 |
@@ -1647,20 +1647,6 @@ class binary_writer
|
|||||||
return 'D'; // float 64
|
return 'D'; // float 64
|
||||||
}
|
}
|
||||||
|
|
||||||
/*!
|
|
||||||
@brief checks whether a JSON number fits into @a TargetType
|
|
||||||
@param[in] el a JSON number of either the signed or unsigned integer kind
|
|
||||||
@return whether @a el's value can be represented by @a TargetType without
|
|
||||||
wrapping, regardless of which of the two kinds it is stored as
|
|
||||||
*/
|
|
||||||
template<typename TargetType>
|
|
||||||
static bool bjdata_ndarray_value_in_range(const BasicJsonType& el)
|
|
||||||
{
|
|
||||||
return el.is_number_unsigned()
|
|
||||||
? value_in_range_of<TargetType>(el.template get<std::uint64_t>())
|
|
||||||
: value_in_range_of<TargetType>(el.template get<std::int64_t>());
|
|
||||||
}
|
|
||||||
|
|
||||||
/*!
|
/*!
|
||||||
@return false if the object is successfully converted to a bjdata ndarray, true if the type or size is invalid
|
@return false if the object is successfully converted to a bjdata ndarray, true if the type or size is invalid
|
||||||
*/
|
*/
|
||||||
@@ -1681,16 +1667,6 @@ class binary_writer
|
|||||||
}
|
}
|
||||||
CharType dtype = it->second;
|
CharType dtype = it->second;
|
||||||
|
|
||||||
// the 'B' (byte) marker is only defined by BJData Draft 3; emitting it
|
|
||||||
// under the default Draft 2 mode would produce a stream that Draft 2
|
|
||||||
// readers reject, so such an object falls back to a plain object
|
|
||||||
// encoding instead (see the "Binary values" section of the BJData
|
|
||||||
// documentation)
|
|
||||||
if (dtype == 'B' && bjdata_version != bjdata_version_t::draft3)
|
|
||||||
{
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
key = "_ArraySize_";
|
key = "_ArraySize_";
|
||||||
// the dimensions are written verbatim as the header length below, so a
|
// the dimensions are written verbatim as the header length below, so a
|
||||||
// value that is not an array cannot produce a valid one: null emits 'Z'
|
// value that is not an array cannot produce a valid one: null emits 'Z'
|
||||||
@@ -1755,60 +1731,6 @@ class binary_writer
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
// every element is cast to the (possibly narrower) C++ type matching
|
|
||||||
// dtype below; a value that does not fit that type would silently
|
|
||||||
// wrap (integers) or overflow to infinity (the "single" precision
|
|
||||||
// float) instead of being reported, so such an object falls back to
|
|
||||||
// a plain object encoding as well
|
|
||||||
for (const auto& el : value.at(key))
|
|
||||||
{
|
|
||||||
bool in_range = true;
|
|
||||||
switch (dtype)
|
|
||||||
{
|
|
||||||
case 'U':
|
|
||||||
case 'C':
|
|
||||||
case 'B':
|
|
||||||
in_range = bjdata_ndarray_value_in_range<std::uint8_t>(el);
|
|
||||||
break;
|
|
||||||
case 'i':
|
|
||||||
in_range = bjdata_ndarray_value_in_range<std::int8_t>(el);
|
|
||||||
break;
|
|
||||||
case 'u':
|
|
||||||
in_range = bjdata_ndarray_value_in_range<std::uint16_t>(el);
|
|
||||||
break;
|
|
||||||
case 'I':
|
|
||||||
in_range = bjdata_ndarray_value_in_range<std::int16_t>(el);
|
|
||||||
break;
|
|
||||||
case 'm':
|
|
||||||
in_range = bjdata_ndarray_value_in_range<std::uint32_t>(el);
|
|
||||||
break;
|
|
||||||
case 'l':
|
|
||||||
in_range = bjdata_ndarray_value_in_range<std::int32_t>(el);
|
|
||||||
break;
|
|
||||||
case 'M':
|
|
||||||
in_range = bjdata_ndarray_value_in_range<std::uint64_t>(el);
|
|
||||||
break;
|
|
||||||
case 'L':
|
|
||||||
in_range = bjdata_ndarray_value_in_range<std::int64_t>(el);
|
|
||||||
break;
|
|
||||||
case 'd':
|
|
||||||
{
|
|
||||||
const auto dval = el.template get<double>();
|
|
||||||
in_range = !std::isfinite(dval) ||
|
|
||||||
(dval >= static_cast<double>(std::numeric_limits<float>::lowest()) &&
|
|
||||||
dval <= static_cast<double>((std::numeric_limits<float>::max)()));
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
default:
|
|
||||||
// 'D' (double) already spans the full range of number_float_t
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
if (!in_range)
|
|
||||||
{
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
oa->write_character('[');
|
oa->write_character('[');
|
||||||
oa->write_character('$');
|
oa->write_character('$');
|
||||||
oa->write_character(dtype);
|
oa->write_character(dtype);
|
||||||
|
|||||||
@@ -71,7 +71,7 @@ class serializer
|
|||||||
, thousands_sep(loc->thousands_sep == nullptr ? '\0' : std::char_traits<char>::to_char_type(* (loc->thousands_sep)))
|
, thousands_sep(loc->thousands_sep == nullptr ? '\0' : std::char_traits<char>::to_char_type(* (loc->thousands_sep)))
|
||||||
, decimal_point(loc->decimal_point == nullptr ? '\0' : std::char_traits<char>::to_char_type(* (loc->decimal_point)))
|
, decimal_point(loc->decimal_point == nullptr ? '\0' : std::char_traits<char>::to_char_type(* (loc->decimal_point)))
|
||||||
, indent_char(ichar)
|
, indent_char(ichar)
|
||||||
, indent_string(512, indent_char)
|
, indent_string()
|
||||||
, error_handler(error_handler_)
|
, error_handler(error_handler_)
|
||||||
{}
|
{}
|
||||||
|
|
||||||
@@ -126,6 +126,10 @@ class serializer
|
|||||||
|
|
||||||
// variable to hold indentation for recursive calls
|
// variable to hold indentation for recursive calls
|
||||||
const auto new_indent = current_indent + indent_step;
|
const auto new_indent = current_indent + indent_step;
|
||||||
|
if (JSON_HEDLEY_UNLIKELY(indent_string.empty()))
|
||||||
|
{
|
||||||
|
indent_string.resize(512, indent_char);
|
||||||
|
}
|
||||||
if (JSON_HEDLEY_UNLIKELY(indent_string.size() < new_indent))
|
if (JSON_HEDLEY_UNLIKELY(indent_string.size() < new_indent))
|
||||||
{
|
{
|
||||||
indent_string.resize(indent_string.size() * 2, ' ');
|
indent_string.resize(indent_string.size() * 2, ' ');
|
||||||
@@ -199,6 +203,10 @@ class serializer
|
|||||||
|
|
||||||
// variable to hold indentation for recursive calls
|
// variable to hold indentation for recursive calls
|
||||||
const auto new_indent = current_indent + indent_step;
|
const auto new_indent = current_indent + indent_step;
|
||||||
|
if (JSON_HEDLEY_UNLIKELY(indent_string.empty()))
|
||||||
|
{
|
||||||
|
indent_string.resize(512, indent_char);
|
||||||
|
}
|
||||||
if (JSON_HEDLEY_UNLIKELY(indent_string.size() < new_indent))
|
if (JSON_HEDLEY_UNLIKELY(indent_string.size() < new_indent))
|
||||||
{
|
{
|
||||||
indent_string.resize(indent_string.size() * 2, ' ');
|
indent_string.resize(indent_string.size() * 2, ' ');
|
||||||
@@ -260,6 +268,10 @@ class serializer
|
|||||||
|
|
||||||
// variable to hold indentation for recursive calls
|
// variable to hold indentation for recursive calls
|
||||||
const auto new_indent = current_indent + indent_step;
|
const auto new_indent = current_indent + indent_step;
|
||||||
|
if (JSON_HEDLEY_UNLIKELY(indent_string.empty()))
|
||||||
|
{
|
||||||
|
indent_string.resize(512, indent_char);
|
||||||
|
}
|
||||||
if (JSON_HEDLEY_UNLIKELY(indent_string.size() < new_indent))
|
if (JSON_HEDLEY_UNLIKELY(indent_string.size() < new_indent))
|
||||||
{
|
{
|
||||||
indent_string.resize(indent_string.size() * 2, ' ');
|
indent_string.resize(indent_string.size() * 2, ' ');
|
||||||
@@ -1010,7 +1022,7 @@ class serializer
|
|||||||
|
|
||||||
/// the indentation character
|
/// the indentation character
|
||||||
const char indent_char;
|
const char indent_char;
|
||||||
/// the indentation string
|
/// the indentation string (lazily allocated on first use by a pretty-print branch)
|
||||||
string_t indent_string;
|
string_t indent_string;
|
||||||
|
|
||||||
/// error_handler how to react on decoding errors
|
/// error_handler how to react on decoding errors
|
||||||
|
|||||||
@@ -18655,20 +18655,6 @@ class binary_writer
|
|||||||
return 'D'; // float 64
|
return 'D'; // float 64
|
||||||
}
|
}
|
||||||
|
|
||||||
/*!
|
|
||||||
@brief checks whether a JSON number fits into @a TargetType
|
|
||||||
@param[in] el a JSON number of either the signed or unsigned integer kind
|
|
||||||
@return whether @a el's value can be represented by @a TargetType without
|
|
||||||
wrapping, regardless of which of the two kinds it is stored as
|
|
||||||
*/
|
|
||||||
template<typename TargetType>
|
|
||||||
static bool bjdata_ndarray_value_in_range(const BasicJsonType& el)
|
|
||||||
{
|
|
||||||
return el.is_number_unsigned()
|
|
||||||
? value_in_range_of<TargetType>(el.template get<std::uint64_t>())
|
|
||||||
: value_in_range_of<TargetType>(el.template get<std::int64_t>());
|
|
||||||
}
|
|
||||||
|
|
||||||
/*!
|
/*!
|
||||||
@return false if the object is successfully converted to a bjdata ndarray, true if the type or size is invalid
|
@return false if the object is successfully converted to a bjdata ndarray, true if the type or size is invalid
|
||||||
*/
|
*/
|
||||||
@@ -18689,16 +18675,6 @@ class binary_writer
|
|||||||
}
|
}
|
||||||
CharType dtype = it->second;
|
CharType dtype = it->second;
|
||||||
|
|
||||||
// the 'B' (byte) marker is only defined by BJData Draft 3; emitting it
|
|
||||||
// under the default Draft 2 mode would produce a stream that Draft 2
|
|
||||||
// readers reject, so such an object falls back to a plain object
|
|
||||||
// encoding instead (see the "Binary values" section of the BJData
|
|
||||||
// documentation)
|
|
||||||
if (dtype == 'B' && bjdata_version != bjdata_version_t::draft3)
|
|
||||||
{
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
key = "_ArraySize_";
|
key = "_ArraySize_";
|
||||||
// the dimensions are written verbatim as the header length below, so a
|
// the dimensions are written verbatim as the header length below, so a
|
||||||
// value that is not an array cannot produce a valid one: null emits 'Z'
|
// value that is not an array cannot produce a valid one: null emits 'Z'
|
||||||
@@ -18763,60 +18739,6 @@ class binary_writer
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
// every element is cast to the (possibly narrower) C++ type matching
|
|
||||||
// dtype below; a value that does not fit that type would silently
|
|
||||||
// wrap (integers) or overflow to infinity (the "single" precision
|
|
||||||
// float) instead of being reported, so such an object falls back to
|
|
||||||
// a plain object encoding as well
|
|
||||||
for (const auto& el : value.at(key))
|
|
||||||
{
|
|
||||||
bool in_range = true;
|
|
||||||
switch (dtype)
|
|
||||||
{
|
|
||||||
case 'U':
|
|
||||||
case 'C':
|
|
||||||
case 'B':
|
|
||||||
in_range = bjdata_ndarray_value_in_range<std::uint8_t>(el);
|
|
||||||
break;
|
|
||||||
case 'i':
|
|
||||||
in_range = bjdata_ndarray_value_in_range<std::int8_t>(el);
|
|
||||||
break;
|
|
||||||
case 'u':
|
|
||||||
in_range = bjdata_ndarray_value_in_range<std::uint16_t>(el);
|
|
||||||
break;
|
|
||||||
case 'I':
|
|
||||||
in_range = bjdata_ndarray_value_in_range<std::int16_t>(el);
|
|
||||||
break;
|
|
||||||
case 'm':
|
|
||||||
in_range = bjdata_ndarray_value_in_range<std::uint32_t>(el);
|
|
||||||
break;
|
|
||||||
case 'l':
|
|
||||||
in_range = bjdata_ndarray_value_in_range<std::int32_t>(el);
|
|
||||||
break;
|
|
||||||
case 'M':
|
|
||||||
in_range = bjdata_ndarray_value_in_range<std::uint64_t>(el);
|
|
||||||
break;
|
|
||||||
case 'L':
|
|
||||||
in_range = bjdata_ndarray_value_in_range<std::int64_t>(el);
|
|
||||||
break;
|
|
||||||
case 'd':
|
|
||||||
{
|
|
||||||
const auto dval = el.template get<double>();
|
|
||||||
in_range = !std::isfinite(dval) ||
|
|
||||||
(dval >= static_cast<double>(std::numeric_limits<float>::lowest()) &&
|
|
||||||
dval <= static_cast<double>((std::numeric_limits<float>::max)()));
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
default:
|
|
||||||
// 'D' (double) already spans the full range of number_float_t
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
if (!in_range)
|
|
||||||
{
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
oa->write_character('[');
|
oa->write_character('[');
|
||||||
oa->write_character('$');
|
oa->write_character('$');
|
||||||
oa->write_character(dtype);
|
oa->write_character(dtype);
|
||||||
@@ -20228,7 +20150,7 @@ class serializer
|
|||||||
, thousands_sep(loc->thousands_sep == nullptr ? '\0' : std::char_traits<char>::to_char_type(* (loc->thousands_sep)))
|
, thousands_sep(loc->thousands_sep == nullptr ? '\0' : std::char_traits<char>::to_char_type(* (loc->thousands_sep)))
|
||||||
, decimal_point(loc->decimal_point == nullptr ? '\0' : std::char_traits<char>::to_char_type(* (loc->decimal_point)))
|
, decimal_point(loc->decimal_point == nullptr ? '\0' : std::char_traits<char>::to_char_type(* (loc->decimal_point)))
|
||||||
, indent_char(ichar)
|
, indent_char(ichar)
|
||||||
, indent_string(512, indent_char)
|
, indent_string()
|
||||||
, error_handler(error_handler_)
|
, error_handler(error_handler_)
|
||||||
{}
|
{}
|
||||||
|
|
||||||
@@ -20283,6 +20205,10 @@ class serializer
|
|||||||
|
|
||||||
// variable to hold indentation for recursive calls
|
// variable to hold indentation for recursive calls
|
||||||
const auto new_indent = current_indent + indent_step;
|
const auto new_indent = current_indent + indent_step;
|
||||||
|
if (JSON_HEDLEY_UNLIKELY(indent_string.empty()))
|
||||||
|
{
|
||||||
|
indent_string.resize(512, indent_char);
|
||||||
|
}
|
||||||
if (JSON_HEDLEY_UNLIKELY(indent_string.size() < new_indent))
|
if (JSON_HEDLEY_UNLIKELY(indent_string.size() < new_indent))
|
||||||
{
|
{
|
||||||
indent_string.resize(indent_string.size() * 2, ' ');
|
indent_string.resize(indent_string.size() * 2, ' ');
|
||||||
@@ -20356,6 +20282,10 @@ class serializer
|
|||||||
|
|
||||||
// variable to hold indentation for recursive calls
|
// variable to hold indentation for recursive calls
|
||||||
const auto new_indent = current_indent + indent_step;
|
const auto new_indent = current_indent + indent_step;
|
||||||
|
if (JSON_HEDLEY_UNLIKELY(indent_string.empty()))
|
||||||
|
{
|
||||||
|
indent_string.resize(512, indent_char);
|
||||||
|
}
|
||||||
if (JSON_HEDLEY_UNLIKELY(indent_string.size() < new_indent))
|
if (JSON_HEDLEY_UNLIKELY(indent_string.size() < new_indent))
|
||||||
{
|
{
|
||||||
indent_string.resize(indent_string.size() * 2, ' ');
|
indent_string.resize(indent_string.size() * 2, ' ');
|
||||||
@@ -20417,6 +20347,10 @@ class serializer
|
|||||||
|
|
||||||
// variable to hold indentation for recursive calls
|
// variable to hold indentation for recursive calls
|
||||||
const auto new_indent = current_indent + indent_step;
|
const auto new_indent = current_indent + indent_step;
|
||||||
|
if (JSON_HEDLEY_UNLIKELY(indent_string.empty()))
|
||||||
|
{
|
||||||
|
indent_string.resize(512, indent_char);
|
||||||
|
}
|
||||||
if (JSON_HEDLEY_UNLIKELY(indent_string.size() < new_indent))
|
if (JSON_HEDLEY_UNLIKELY(indent_string.size() < new_indent))
|
||||||
{
|
{
|
||||||
indent_string.resize(indent_string.size() * 2, ' ');
|
indent_string.resize(indent_string.size() * 2, ' ');
|
||||||
@@ -21167,7 +21101,7 @@ class serializer
|
|||||||
|
|
||||||
/// the indentation character
|
/// the indentation character
|
||||||
const char indent_char;
|
const char indent_char;
|
||||||
/// the indentation string
|
/// the indentation string (lazily allocated on first use by a pretty-print branch)
|
||||||
string_t indent_string;
|
string_t indent_string;
|
||||||
|
|
||||||
/// error_handler how to react on decoding errors
|
/// error_handler how to react on decoding errors
|
||||||
|
|||||||
@@ -2586,12 +2586,7 @@ TEST_CASE("BJData")
|
|||||||
CHECK(json::to_bjdata(json::from_bjdata(v_d), true, true) == v_d);
|
CHECK(json::to_bjdata(json::from_bjdata(v_d), true, true) == v_d);
|
||||||
CHECK(json::to_bjdata(json::from_bjdata(v_D), true, true) == v_D);
|
CHECK(json::to_bjdata(json::from_bjdata(v_D), true, true) == v_D);
|
||||||
CHECK(json::to_bjdata(json::from_bjdata(v_C), true, true) == v_C);
|
CHECK(json::to_bjdata(json::from_bjdata(v_C), true, true) == v_C);
|
||||||
// v_B uses the Draft-3-only 'B' marker, so it round-trips only when
|
CHECK(json::to_bjdata(json::from_bjdata(v_B), true, true) == v_B);
|
||||||
// Draft 3 is explicitly selected (see GitHub issue #5404); the
|
|
||||||
// default Draft 2 falls back to a plain object instead, covered by
|
|
||||||
// the "ndarray with _ArrayType_ "byte" is gated by the BJData draft
|
|
||||||
// version" section below
|
|
||||||
CHECK(json::to_bjdata(json::from_bjdata(v_B), true, true, json::bjdata_version_t::draft3) == v_B);
|
|
||||||
}
|
}
|
||||||
|
|
||||||
SECTION("ndarray with data not matching _ArrayType_ is written as an object")
|
SECTION("ndarray with data not matching _ArrayType_ is written as an object")
|
||||||
@@ -2634,10 +2629,8 @@ TEST_CASE("BJData")
|
|||||||
// the C++ API stores an int literal as number_integer, so _ArrayType_
|
// the C++ API stores an int literal as number_integer, so _ArrayType_
|
||||||
// names the wire type rather than the storage. Both storages have to
|
// names the wire type rather than the storage. Both storages have to
|
||||||
// produce the same typed array for every type.
|
// produce the same typed array for every type.
|
||||||
// "byte" is checked separately below since it additionally requires
|
|
||||||
// BJData Draft 3 to be selected explicitly (see GitHub issue #5404).
|
|
||||||
for (const char* type :
|
for (const char* type :
|
||||||
{"uint8", "int8", "uint16", "int16", "uint32", "int32", "uint64", "int64", "char"
|
{"uint8", "int8", "uint16", "int16", "uint32", "int32", "uint64", "int64", "char", "byte"
|
||||||
})
|
})
|
||||||
{
|
{
|
||||||
CAPTURE(type);
|
CAPTURE(type);
|
||||||
@@ -2648,14 +2641,6 @@ TEST_CASE("BJData")
|
|||||||
CHECK(from_text == json::to_bjdata(json({{"_ArrayType_", type}, {"_ArraySize_", {2, 3}}, {"_ArrayData_", {1, 2, 3, 4, 5, 6}}})));
|
CHECK(from_text == json::to_bjdata(json({{"_ArrayType_", type}, {"_ArraySize_", {2, 3}}, {"_ArrayData_", {1, 2, 3, 4, 5, 6}}})));
|
||||||
}
|
}
|
||||||
|
|
||||||
{
|
|
||||||
const std::string text = R"({"_ArrayType_":"byte","_ArraySize_":[2,3],"_ArrayData_":[1,2,3,4,5,6]})";
|
|
||||||
const auto from_text = json::to_bjdata(json::parse(text), true, true, json::bjdata_version_t::draft3);
|
|
||||||
CHECK(from_text.at(0) == '[');
|
|
||||||
CHECK(from_text == json::to_bjdata(json({{"_ArrayType_", "byte"}, {"_ArraySize_", {2, 3}}, {"_ArrayData_", {1, 2, 3, 4, 5, 6}}}),
|
|
||||||
true, true, json::bjdata_version_t::draft3));
|
|
||||||
}
|
|
||||||
|
|
||||||
// negative values under a signed type behave the same way
|
// negative values under a signed type behave the same way
|
||||||
const auto from_neg = json::to_bjdata(json::parse(R"({"_ArrayType_":"int32","_ArraySize_":[2],"_ArrayData_":[-5,7]})"));
|
const auto from_neg = json::to_bjdata(json::parse(R"({"_ArrayType_":"int32","_ArraySize_":[2],"_ArrayData_":[-5,7]})"));
|
||||||
CHECK(from_neg.at(0) == '[');
|
CHECK(from_neg.at(0) == '[');
|
||||||
@@ -2791,83 +2776,6 @@ TEST_CASE("BJData")
|
|||||||
CHECK(out_num.at(0) == '{');
|
CHECK(out_num.at(0) == '{');
|
||||||
CHECK(json::from_bjdata(out_num) == j_num);
|
CHECK(json::from_bjdata(out_num) == j_num);
|
||||||
}
|
}
|
||||||
|
|
||||||
SECTION("ndarray with out-of-range _ArrayData_ elements stays as object")
|
|
||||||
{
|
|
||||||
// each element is cast to the (possibly narrower) C++ type
|
|
||||||
// named by _ArrayType_ before being written; a value that
|
|
||||||
// does not fit that type would silently wrap instead of
|
|
||||||
// being reported, so such an object falls back to a plain
|
|
||||||
// object encoding that still round-trips (see GitHub issue #5403)
|
|
||||||
|
|
||||||
// an unsigned element that does not fit uint8
|
|
||||||
json const j_uint8 = json({{"_ArrayType_", "uint8"}, {"_ArraySize_", {2}}, {"_ArrayData_", {1, 256}}});
|
|
||||||
const auto out_uint8 = json::to_bjdata(j_uint8);
|
|
||||||
CHECK(out_uint8.at(0) == '{');
|
|
||||||
CHECK(json::from_bjdata(out_uint8) == j_uint8);
|
|
||||||
|
|
||||||
// a signed element that does not fit int8
|
|
||||||
json const j_int8 = json({{"_ArrayType_", "int8"}, {"_ArraySize_", {2}}, {"_ArrayData_", {1, 200}}});
|
|
||||||
const auto out_int8 = json::to_bjdata(j_int8);
|
|
||||||
CHECK(out_int8.at(0) == '{');
|
|
||||||
CHECK(json::from_bjdata(out_int8) == j_int8);
|
|
||||||
|
|
||||||
// a negative element is likewise out of range for an
|
|
||||||
// unsigned _ArrayType_
|
|
||||||
json const j_uint16_neg = json({{"_ArrayType_", "uint16"}, {"_ArraySize_", {2}}, {"_ArrayData_", {1, -1}}});
|
|
||||||
const auto out_uint16_neg = json::to_bjdata(j_uint16_neg);
|
|
||||||
CHECK(out_uint16_neg.at(0) == '{');
|
|
||||||
CHECK(json::from_bjdata(out_uint16_neg) == j_uint16_neg);
|
|
||||||
|
|
||||||
// a double element that overflows to infinity when narrowed
|
|
||||||
// to the "single" (float) precision named by _ArrayType_
|
|
||||||
json const j_single = json({{"_ArrayType_", "single"}, {"_ArraySize_", {2}}, {"_ArrayData_", {1.5, 1e40}}});
|
|
||||||
const auto out_single = json::to_bjdata(j_single);
|
|
||||||
CHECK(out_single.at(0) == '{');
|
|
||||||
CHECK(json::from_bjdata(out_single) == j_single);
|
|
||||||
|
|
||||||
// in-range boundary values still use the compact ndarray encoding
|
|
||||||
json const j_uint8_ok = json({{"_ArrayType_", "uint8"}, {"_ArraySize_", {2}}, {"_ArrayData_", {0, 255}}});
|
|
||||||
CHECK(json::to_bjdata(j_uint8_ok) == std::vector<uint8_t>({'[', '$', 'U', '#', '[', 'i', 2, ']', 0, 255}));
|
|
||||||
|
|
||||||
json const j_int8_ok = json({{"_ArrayType_", "int8"}, {"_ArraySize_", {2}}, {"_ArrayData_", {-128, 127}}});
|
|
||||||
CHECK(json::to_bjdata(j_int8_ok) == std::vector<uint8_t>({'[', '$', 'i', '#', '[', 'i', 2, ']', 0x80, 0x7F}));
|
|
||||||
|
|
||||||
json const j_single_ok = json({{"_ArrayType_", "single"}, {"_ArraySize_", {1}}, {"_ArrayData_", {1.5}}});
|
|
||||||
const auto out_single_ok = json::to_bjdata(j_single_ok);
|
|
||||||
CHECK(out_single_ok.at(0) == '[');
|
|
||||||
CHECK(json::from_bjdata(out_single_ok) == json({1.5f}));
|
|
||||||
}
|
|
||||||
|
|
||||||
SECTION("ndarray with _ArrayType_ \"byte\" is gated by the BJData draft version")
|
|
||||||
{
|
|
||||||
// the 'B' (byte) marker used by _ArrayType_ "byte" is only defined
|
|
||||||
// by BJData Draft 3; Draft 2 (the default) has no such marker, so
|
|
||||||
// emitting it unconditionally produced a stream that a Draft 2
|
|
||||||
// reader could not parse as intended (see GitHub issue #5404).
|
|
||||||
// Two dimensions are used so that a successfully written ndarray
|
|
||||||
// round-trips back into the annotated object (a single dimension
|
|
||||||
// is, by the BJData ndarray convention, read back as a plain
|
|
||||||
// binary value rather than the annotated object, same as every
|
|
||||||
// other single-dimension ndarray of a non-"byte" type is read
|
|
||||||
// back as a plain array instead of the annotated object).
|
|
||||||
json const j_byte = json({{"_ArrayType_", "byte"}, {"_ArraySize_", {2, 3}}, {"_ArrayData_", {1, 2, 3, 4, 5, 6}}});
|
|
||||||
|
|
||||||
// default (Draft 2): falls back to a plain object and round-trips
|
|
||||||
const auto out_draft2 = json::to_bjdata(j_byte);
|
|
||||||
CHECK(out_draft2.at(0) == '{');
|
|
||||||
CHECK(json::from_bjdata(out_draft2) == j_byte);
|
|
||||||
|
|
||||||
// explicit Draft 2: same as the default
|
|
||||||
const auto out_draft2_explicit = json::to_bjdata(j_byte, true, true, json::bjdata_version_t::draft2);
|
|
||||||
CHECK(out_draft2_explicit.at(0) == '{');
|
|
||||||
CHECK(json::from_bjdata(out_draft2_explicit) == j_byte);
|
|
||||||
|
|
||||||
// Draft 3 explicitly selected: still uses the compact 'B' ndarray encoding
|
|
||||||
const auto out_draft3 = json::to_bjdata(j_byte, true, true, json::bjdata_version_t::draft3);
|
|
||||||
CHECK(out_draft3 == std::vector<uint8_t>({'[', '$', 'B', '#', '[', '$', 'i', '#', 'i', 2, 2, 3, 1, 2, 3, 4, 5, 6}));
|
|
||||||
CHECK(json::from_bjdata(out_draft3) == j_byte);
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|||||||
@@ -14,6 +14,40 @@ using nlohmann::json;
|
|||||||
#include <array>
|
#include <array>
|
||||||
#include <sstream>
|
#include <sstream>
|
||||||
#include <iomanip>
|
#include <iomanip>
|
||||||
|
#include <cstdlib>
|
||||||
|
#include <new>
|
||||||
|
|
||||||
|
namespace
|
||||||
|
{
|
||||||
|
// heap allocation counter used by the regression test for issue #5413
|
||||||
|
// (https://github.com/nlohmann/json/issues/5413); disabled (and thus a
|
||||||
|
// no-op besides the counting) unless explicitly toggled on
|
||||||
|
bool count_heap_allocations = false; // NOLINT(cppcoreguidelines-avoid-non-const-global-variables)
|
||||||
|
std::size_t heap_allocations = 0; // NOLINT(cppcoreguidelines-avoid-non-const-global-variables)
|
||||||
|
} // namespace
|
||||||
|
|
||||||
|
void* operator new (std::size_t size) // NOLINT(cppcoreguidelines-owning-memory,misc-new-delete-overloads)
|
||||||
|
{
|
||||||
|
if (count_heap_allocations)
|
||||||
|
{
|
||||||
|
++heap_allocations;
|
||||||
|
}
|
||||||
|
if (void* ptr = std::malloc(size)) // NOLINT(cppcoreguidelines-no-malloc,cppcoreguidelines-owning-memory)
|
||||||
|
{
|
||||||
|
return ptr;
|
||||||
|
}
|
||||||
|
throw std::bad_alloc(); // NOLINT(hicpp-exception-baseclass)
|
||||||
|
}
|
||||||
|
|
||||||
|
void operator delete (void* ptr) noexcept // NOLINT(cppcoreguidelines-owning-memory,misc-new-delete-overloads)
|
||||||
|
{
|
||||||
|
std::free(ptr); // NOLINT(cppcoreguidelines-no-malloc,cppcoreguidelines-owning-memory)
|
||||||
|
}
|
||||||
|
|
||||||
|
void operator delete (void* ptr, std::size_t /*size*/) noexcept // NOLINT(cppcoreguidelines-owning-memory,misc-new-delete-overloads)
|
||||||
|
{
|
||||||
|
std::free(ptr); // NOLINT(cppcoreguidelines-no-malloc,cppcoreguidelines-owning-memory)
|
||||||
|
}
|
||||||
|
|
||||||
TEST_CASE("serialization")
|
TEST_CASE("serialization")
|
||||||
{
|
{
|
||||||
@@ -382,3 +416,76 @@ TEST_CASE("dump for basic_json with long double number_float_t")
|
|||||||
check_same(100.0L, 100.0);
|
check_same(100.0L, 100.0);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
TEST_CASE("regression test for issue #5413 - lazily allocated indent_string")
|
||||||
|
{
|
||||||
|
// the serializer used to unconditionally allocate a 512-byte
|
||||||
|
// indent_string in its constructor, even though it is only ever read
|
||||||
|
// inside the pretty_print branches of dump(). This wasted a heap
|
||||||
|
// allocation (and its matching deallocation) on every single compact
|
||||||
|
// (i.e. non-pretty, the default) dump() call. indent_string is now
|
||||||
|
// allocated lazily, the first time a pretty-print branch actually
|
||||||
|
// needs it -- so a compact dump() must perform strictly fewer heap
|
||||||
|
// allocations than a pretty dump() of the same value.
|
||||||
|
const json j = {{"level", "info"}, {"msg", "hello world"}, {"id", 12345}};
|
||||||
|
|
||||||
|
// warm up anything unrelated to indentation (e.g., one-time locale
|
||||||
|
// lookups) that might otherwise allocate on first use regardless of
|
||||||
|
// pretty-printing, so it does not skew the counts measured below
|
||||||
|
const auto warmup = j.dump();
|
||||||
|
const auto warmup_pretty = j.dump(4);
|
||||||
|
CHECK(!warmup.empty());
|
||||||
|
CHECK(!warmup_pretty.empty());
|
||||||
|
|
||||||
|
SECTION("compact dump() has a stable, minimal allocation count")
|
||||||
|
{
|
||||||
|
count_heap_allocations = true;
|
||||||
|
|
||||||
|
heap_allocations = 0;
|
||||||
|
const auto compact1 = j.dump();
|
||||||
|
const auto allocs_compact1 = heap_allocations;
|
||||||
|
|
||||||
|
heap_allocations = 0;
|
||||||
|
const auto compact2 = j.dump(-1);
|
||||||
|
const auto allocs_compact2 = heap_allocations;
|
||||||
|
|
||||||
|
count_heap_allocations = false;
|
||||||
|
|
||||||
|
CHECK(compact1 == compact2);
|
||||||
|
// dump() and dump(-1) both take the compact code path and must
|
||||||
|
// never touch indent_string, so they allocate identically often
|
||||||
|
CHECK(allocs_compact1 == allocs_compact2);
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("first pretty dump() allocates more than a compact dump()")
|
||||||
|
{
|
||||||
|
// use a tiny value whose compact ({"a":1}, 7 bytes) and pretty
|
||||||
|
// ({"a": 1} with 1-space indent, 11 bytes) serializations both stay
|
||||||
|
// well inside every common std::string small-string-optimization
|
||||||
|
// buffer (>= 15 bytes on libstdc++/MSVC STL, >= 22 on libc++), so
|
||||||
|
// building the result string itself causes no heap allocation
|
||||||
|
// either way -- isolating indent_string as the only thing that can
|
||||||
|
// possibly account for a difference in allocation count
|
||||||
|
const json tiny = {{"a", 1}};
|
||||||
|
|
||||||
|
count_heap_allocations = true;
|
||||||
|
|
||||||
|
heap_allocations = 0;
|
||||||
|
const auto compact = tiny.dump();
|
||||||
|
const auto allocs_compact = heap_allocations;
|
||||||
|
|
||||||
|
heap_allocations = 0;
|
||||||
|
const auto pretty = tiny.dump(1);
|
||||||
|
const auto allocs_pretty = heap_allocations;
|
||||||
|
|
||||||
|
count_heap_allocations = false;
|
||||||
|
|
||||||
|
CHECK(compact == "{\"a\":1}");
|
||||||
|
CHECK(pretty == "{\n \"a\": 1\n}");
|
||||||
|
// a fresh serializer is created per dump() call; the pretty branch
|
||||||
|
// lazily allocates indent_string on its first use, so it must
|
||||||
|
// allocate at least once more than the compact branch, which never
|
||||||
|
// touches indent_string at all
|
||||||
|
CHECK(allocs_pretty > allocs_compact);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|||||||
Reference in New Issue
Block a user