mirror of
https://github.com/nlohmann/json.git
synced 2026-09-07 16:57:59 +00:00
Compare commits
| Author | SHA1 | Date | |
|---|---|---|---|
|
|
1df654d19d | ||
|
|
90bd0f7fec | ||
|
|
3d89ac50a0 | ||
|
|
ee69490b28 | ||
|
|
3970ecccd1 | ||
|
|
00e5d21041 | ||
|
|
755c547003 |
@@ -108,7 +108,9 @@ The tests are located in [`tests/src/unit-*.cpp`](https://github.com/nlohmann/js
|
|||||||
are structured along the features of the library or the nature of the tests. Usually, it should be clear from the
|
are structured along the features of the library or the nature of the tests. Usually, it should be clear from the
|
||||||
context which existing file needs to be extended, and only very few cases require creating new test files.
|
context which existing file needs to be extended, and only very few cases require creating new test files.
|
||||||
|
|
||||||
When fixing a bug, edit `unit-regression2.cpp` and add a section referencing the fixed issue.
|
When fixing a bug, edit `unit-regression3.cpp` and add a section referencing the fixed issue.
|
||||||
|
`unit-regression2.cpp` holds the older tests; the two files exist because a single one grew large enough for the
|
||||||
|
MinGW linker to fail relocating it, so please keep adding to the smaller file rather than growing one of them.
|
||||||
|
|
||||||
#### Exceptions
|
#### Exceptions
|
||||||
|
|
||||||
|
|||||||
@@ -69,6 +69,12 @@ The library uses the following mapping from JSON values types to UBJSON types ac
|
|||||||
Note that `use_size = true` alone may result in larger representations - the benefit of this parameter is that the
|
Note that `use_size = true` alone may result in larger representations - the benefit of this parameter is that the
|
||||||
receiving side is immediately informed on the number of elements of the container.
|
receiving side is immediately informed on the number of elements of the container.
|
||||||
|
|
||||||
|
An array whose type marker is `Z` (null), `T` (true) or `F` (false) stores no payload at all, because the marker
|
||||||
|
already is the value. Its declared count is therefore the only thing that decides how much memory the receiving side
|
||||||
|
allocates, and a handful of bytes can describe billions of elements. `from_ubjson` rejects such an array with
|
||||||
|
[`out_of_range.408`](../../home/exceptions.md#jsonexceptionout_of_range408) when the count exceeds 1,048,576, and
|
||||||
|
`to_ubjson` writes longer arrays of these types without the annotation, so any value it produces can be read back.
|
||||||
|
|
||||||
!!! info "Binary values"
|
!!! info "Binary values"
|
||||||
|
|
||||||
If the JSON data contains the binary type, the value stored is a list of integers, as suggested by the UBJSON
|
If the JSON data contains the binary type, the value stored is a list of integers, as suggested by the UBJSON
|
||||||
|
|||||||
@@ -868,6 +868,12 @@ The size of an array or object in a [binary format](../features/binary_formats/i
|
|||||||
the size following `#` for [UBJSON](../features/binary_formats/ubjson.md)/[BJData](../features/binary_formats/bjdata.md),
|
the size following `#` for [UBJSON](../features/binary_formats/ubjson.md)/[BJData](../features/binary_formats/bjdata.md),
|
||||||
or the encoded length for [CBOR](../features/binary_formats/cbor.md).
|
or the encoded length for [CBOR](../features/binary_formats/cbor.md).
|
||||||
|
|
||||||
|
The exception is also thrown for a [UBJSON](../features/binary_formats/ubjson.md) array of a type that is encoded by its
|
||||||
|
marker alone (`Z`, `T` or `F`) whose declared count exceeds 1,048,576. Such an array has no payload, so its count alone
|
||||||
|
decides how much memory is allocated, and a handful of bytes would otherwise describe billions of values.
|
||||||
|
[`to_ubjson`](../api/basic_json/to_ubjson.md) writes longer arrays of these types without the size and type annotation,
|
||||||
|
so any value it produces can still be read back.
|
||||||
|
|
||||||
!!! failure "Example messages"
|
!!! failure "Example messages"
|
||||||
|
|
||||||
```
|
```
|
||||||
@@ -879,6 +885,9 @@ or the encoded length for [CBOR](../features/binary_formats/cbor.md).
|
|||||||
```
|
```
|
||||||
[json.exception.out_of_range.408] syntax error while parsing CBOR size: excessive map size
|
[json.exception.out_of_range.408] syntax error while parsing CBOR size: excessive map size
|
||||||
```
|
```
|
||||||
|
```
|
||||||
|
[json.exception.out_of_range.408] syntax error while parsing UBJSON size: excessive array size
|
||||||
|
```
|
||||||
|
|
||||||
### json.exception.out_of_range.409
|
### json.exception.out_of_range.409
|
||||||
|
|
||||||
|
|||||||
@@ -58,6 +58,26 @@ inline bool little_endianness(int num = 1) noexcept
|
|||||||
return *reinterpret_cast<char*>(&num) == 1;
|
return *reinterpret_cast<char*>(&num) == 1;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/*!
|
||||||
|
@brief largest element count accepted for a UBJSON container of a valueless type
|
||||||
|
|
||||||
|
An element of type 'Z' (null), 'T' (true) or 'F' (false) is encoded by its
|
||||||
|
type marker alone, so an optimized container of one of those types has no
|
||||||
|
payload at all and its declared count is the only thing that decides how much
|
||||||
|
is allocated: `[$Z#L` followed by a large count turns some ten bytes of input
|
||||||
|
into that many values (see #2793, which reports 35 GB and 150 seconds). Every
|
||||||
|
other type costs at least one byte per element and is bounded by the end of
|
||||||
|
the input.
|
||||||
|
|
||||||
|
This is a sanity bound rather than a security boundary, and it is far above
|
||||||
|
any container met in practice. @ref binary_writer falls back to the
|
||||||
|
unoptimized encoding for longer containers, so that a value serialized by
|
||||||
|
this library can always be read back.
|
||||||
|
|
||||||
|
@sa https://github.com/nlohmann/json/issues/2793
|
||||||
|
*/
|
||||||
|
JSON_INLINE_VARIABLE constexpr std::size_t max_valueless_container_size = 1 << 20;
|
||||||
|
|
||||||
///////////////////
|
///////////////////
|
||||||
// binary reader //
|
// binary reader //
|
||||||
///////////////////
|
///////////////////
|
||||||
@@ -110,6 +130,7 @@ class binary_reader
|
|||||||
const cbor_tag_handler_t tag_handler = cbor_tag_handler_t::error)
|
const cbor_tag_handler_t tag_handler = cbor_tag_handler_t::error)
|
||||||
{
|
{
|
||||||
sax = sax_;
|
sax = sax_;
|
||||||
|
container_stack.clear();
|
||||||
bool result = false;
|
bool result = false;
|
||||||
|
|
||||||
switch (format)
|
switch (format)
|
||||||
@@ -159,6 +180,69 @@ class binary_reader
|
|||||||
}
|
}
|
||||||
|
|
||||||
private:
|
private:
|
||||||
|
////////////////////////
|
||||||
|
// nested containers //
|
||||||
|
////////////////////////
|
||||||
|
|
||||||
|
/*!
|
||||||
|
@brief a container that has been opened and not closed yet
|
||||||
|
|
||||||
|
The binary readers do not call themselves once per nesting level. Like
|
||||||
|
@ref parser::sax_parse_internal, which does the same for JSON text, they
|
||||||
|
keep the containers they are inside of on a heap-allocated stack, so that
|
||||||
|
the native call stack does not grow with the nesting depth of the input
|
||||||
|
and a deeply nested value is bounded by memory rather than by the stack
|
||||||
|
(see #5104).
|
||||||
|
|
||||||
|
The members are ordered by decreasing alignment, which is the ordering that
|
||||||
|
keeps a struct from growing as members are added to it.
|
||||||
|
*/
|
||||||
|
struct container_frame
|
||||||
|
{
|
||||||
|
container_frame(const std::size_t remaining_, const bool is_object_) noexcept
|
||||||
|
: remaining(remaining_), is_object(is_object_) {}
|
||||||
|
|
||||||
|
/// number of elements that have not been read yet
|
||||||
|
std::size_t remaining;
|
||||||
|
/// whether to close this container with end_object() or end_array()
|
||||||
|
bool is_object;
|
||||||
|
};
|
||||||
|
|
||||||
|
/*!
|
||||||
|
@brief open a nested array or object
|
||||||
|
|
||||||
|
Emits the SAX start event and records the container. This is the only
|
||||||
|
place the binary readers start a container, so a check that rejects one
|
||||||
|
can be made here and is then guaranteed to run before the start event.
|
||||||
|
|
||||||
|
@param[in] is_object whether an object (true) or an array (false) begins
|
||||||
|
@param[in] len number of elements the container declares
|
||||||
|
|
||||||
|
@return whether the SAX parser accepted the start event
|
||||||
|
*/
|
||||||
|
bool enter_container(const bool is_object, const std::size_t len)
|
||||||
|
{
|
||||||
|
if (JSON_HEDLEY_UNLIKELY(is_object ? !sax->start_object(len) : !sax->start_array(len)))
|
||||||
|
{
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
|
||||||
|
container_stack.emplace_back(len, is_object);
|
||||||
|
return true;
|
||||||
|
}
|
||||||
|
|
||||||
|
/// @copydoc enter_container
|
||||||
|
bool enter_array(const std::size_t len)
|
||||||
|
{
|
||||||
|
return enter_container(/*is_object*/false, len);
|
||||||
|
}
|
||||||
|
|
||||||
|
/// @copydoc enter_container
|
||||||
|
bool enter_object(const std::size_t len)
|
||||||
|
{
|
||||||
|
return enter_container(/*is_object*/true, len);
|
||||||
|
}
|
||||||
|
|
||||||
//////////
|
//////////
|
||||||
// BSON //
|
// BSON //
|
||||||
//////////
|
//////////
|
||||||
@@ -491,9 +575,12 @@ class binary_reader
|
|||||||
|
|
||||||
@return whether a valid CBOR value was passed to the SAX parser
|
@return whether a valid CBOR value was passed to the SAX parser
|
||||||
*/
|
*/
|
||||||
bool parse_cbor_internal(const bool get_char,
|
bool parse_cbor_value(const bool get_char,
|
||||||
const cbor_tag_handler_t tag_handler)
|
const cbor_tag_handler_t tag_handler,
|
||||||
|
bool& tag_pending)
|
||||||
{
|
{
|
||||||
|
tag_pending = false;
|
||||||
|
|
||||||
switch (get_char ? get() : current)
|
switch (get_char ? get() : current)
|
||||||
{
|
{
|
||||||
// EOF
|
// EOF
|
||||||
@@ -685,37 +772,36 @@ class binary_reader
|
|||||||
case 0x95:
|
case 0x95:
|
||||||
case 0x96:
|
case 0x96:
|
||||||
case 0x97:
|
case 0x97:
|
||||||
return get_cbor_array(
|
return enter_array(conditional_static_cast<std::size_t>(static_cast<unsigned int>(current) & 0x1Fu));
|
||||||
conditional_static_cast<std::size_t>(static_cast<unsigned int>(current) & 0x1Fu), tag_handler);
|
|
||||||
|
|
||||||
case 0x98: // array (one-byte uint8_t for n follows)
|
case 0x98: // array (one-byte uint8_t for n follows)
|
||||||
{
|
{
|
||||||
std::uint8_t len{};
|
std::uint8_t len{};
|
||||||
return get_number(input_format_t::cbor, len) && get_cbor_array(static_cast<std::size_t>(len), tag_handler);
|
return get_number(input_format_t::cbor, len) && enter_array(static_cast<std::size_t>(len));
|
||||||
}
|
}
|
||||||
|
|
||||||
case 0x99: // array (two-byte uint16_t for n follow)
|
case 0x99: // array (two-byte uint16_t for n follow)
|
||||||
{
|
{
|
||||||
std::uint16_t len{};
|
std::uint16_t len{};
|
||||||
return get_number(input_format_t::cbor, len) && get_cbor_array(static_cast<std::size_t>(len), tag_handler);
|
return get_number(input_format_t::cbor, len) && enter_array(static_cast<std::size_t>(len));
|
||||||
}
|
}
|
||||||
|
|
||||||
case 0x9A: // array (four-byte uint32_t for n follow)
|
case 0x9A: // array (four-byte uint32_t for n follow)
|
||||||
{
|
{
|
||||||
std::uint32_t len{};
|
std::uint32_t len{};
|
||||||
std::size_t size{};
|
std::size_t size{};
|
||||||
return get_number(input_format_t::cbor, len) && get_cbor_container_size(len, size, "array") && get_cbor_array(size, tag_handler);
|
return get_number(input_format_t::cbor, len) && get_cbor_container_size(len, size, "array") && enter_array(size);
|
||||||
}
|
}
|
||||||
|
|
||||||
case 0x9B: // array (eight-byte uint64_t for n follow)
|
case 0x9B: // array (eight-byte uint64_t for n follow)
|
||||||
{
|
{
|
||||||
std::uint64_t len{};
|
std::uint64_t len{};
|
||||||
std::size_t size{};
|
std::size_t size{};
|
||||||
return get_number(input_format_t::cbor, len) && get_cbor_container_size(len, size, "array") && get_cbor_array(size, tag_handler);
|
return get_number(input_format_t::cbor, len) && get_cbor_container_size(len, size, "array") && enter_array(size);
|
||||||
}
|
}
|
||||||
|
|
||||||
case 0x9F: // array (indefinite length)
|
case 0x9F: // array (indefinite length)
|
||||||
return get_cbor_array(detail::unknown_size(), tag_handler);
|
return enter_array(detail::unknown_size());
|
||||||
|
|
||||||
// map (0x00..0x17 pairs of data items follow)
|
// map (0x00..0x17 pairs of data items follow)
|
||||||
case 0xA0:
|
case 0xA0:
|
||||||
@@ -742,36 +828,36 @@ class binary_reader
|
|||||||
case 0xB5:
|
case 0xB5:
|
||||||
case 0xB6:
|
case 0xB6:
|
||||||
case 0xB7:
|
case 0xB7:
|
||||||
return get_cbor_object(conditional_static_cast<std::size_t>(static_cast<unsigned int>(current) & 0x1Fu), tag_handler);
|
return enter_object(conditional_static_cast<std::size_t>(static_cast<unsigned int>(current) & 0x1Fu));
|
||||||
|
|
||||||
case 0xB8: // map (one-byte uint8_t for n follows)
|
case 0xB8: // map (one-byte uint8_t for n follows)
|
||||||
{
|
{
|
||||||
std::uint8_t len{};
|
std::uint8_t len{};
|
||||||
return get_number(input_format_t::cbor, len) && get_cbor_object(static_cast<std::size_t>(len), tag_handler);
|
return get_number(input_format_t::cbor, len) && enter_object(static_cast<std::size_t>(len));
|
||||||
}
|
}
|
||||||
|
|
||||||
case 0xB9: // map (two-byte uint16_t for n follow)
|
case 0xB9: // map (two-byte uint16_t for n follow)
|
||||||
{
|
{
|
||||||
std::uint16_t len{};
|
std::uint16_t len{};
|
||||||
return get_number(input_format_t::cbor, len) && get_cbor_object(static_cast<std::size_t>(len), tag_handler);
|
return get_number(input_format_t::cbor, len) && enter_object(static_cast<std::size_t>(len));
|
||||||
}
|
}
|
||||||
|
|
||||||
case 0xBA: // map (four-byte uint32_t for n follow)
|
case 0xBA: // map (four-byte uint32_t for n follow)
|
||||||
{
|
{
|
||||||
std::uint32_t len{};
|
std::uint32_t len{};
|
||||||
std::size_t size{};
|
std::size_t size{};
|
||||||
return get_number(input_format_t::cbor, len) && get_cbor_container_size(len, size, "map") && get_cbor_object(size, tag_handler);
|
return get_number(input_format_t::cbor, len) && get_cbor_container_size(len, size, "map") && enter_object(size);
|
||||||
}
|
}
|
||||||
|
|
||||||
case 0xBB: // map (eight-byte uint64_t for n follow)
|
case 0xBB: // map (eight-byte uint64_t for n follow)
|
||||||
{
|
{
|
||||||
std::uint64_t len{};
|
std::uint64_t len{};
|
||||||
std::size_t size{};
|
std::size_t size{};
|
||||||
return get_number(input_format_t::cbor, len) && get_cbor_container_size(len, size, "map") && get_cbor_object(size, tag_handler);
|
return get_number(input_format_t::cbor, len) && get_cbor_container_size(len, size, "map") && enter_object(size);
|
||||||
}
|
}
|
||||||
|
|
||||||
case 0xBF: // map (indefinite length)
|
case 0xBF: // map (indefinite length)
|
||||||
return get_cbor_object(detail::unknown_size(), tag_handler);
|
return enter_object(detail::unknown_size());
|
||||||
|
|
||||||
case 0xC0: // tagged item
|
case 0xC0: // tagged item
|
||||||
case 0xC1:
|
case 0xC1:
|
||||||
@@ -855,7 +941,10 @@ class binary_reader
|
|||||||
default:
|
default:
|
||||||
break;
|
break;
|
||||||
}
|
}
|
||||||
return parse_cbor_internal(true, tag_handler);
|
// the tagged value follows; it is read by the loop in
|
||||||
|
// parse_cbor_internal() rather than by recursing here
|
||||||
|
tag_pending = true;
|
||||||
|
return true;
|
||||||
}
|
}
|
||||||
|
|
||||||
case cbor_tag_handler_t::store:
|
case cbor_tag_handler_t::store:
|
||||||
@@ -905,7 +994,11 @@ class binary_reader
|
|||||||
break;
|
break;
|
||||||
}
|
}
|
||||||
default:
|
default:
|
||||||
return parse_cbor_internal(true, tag_handler);
|
{
|
||||||
|
// as above, the tagged value is read by the caller
|
||||||
|
tag_pending = true;
|
||||||
|
return true;
|
||||||
|
}
|
||||||
}
|
}
|
||||||
get();
|
get();
|
||||||
return get_cbor_binary(b) && sax->binary(b);
|
return get_cbor_binary(b) && sax->binary(b);
|
||||||
@@ -996,23 +1089,21 @@ class binary_reader
|
|||||||
}
|
}
|
||||||
|
|
||||||
/*!
|
/*!
|
||||||
@brief reads a CBOR string
|
@brief reads a definite-length CBOR string
|
||||||
|
|
||||||
This function first reads starting bytes to determine the expected
|
Reads everything @ref get_cbor_string accepts except the indefinite-length
|
||||||
string length and then copies this number of bytes into a string.
|
form, which that function handles itself. The bytes are appended to @a
|
||||||
Additionally, CBOR's strings with indefinite lengths are supported.
|
result, so consecutive chunks of an indefinite-length string can be read
|
||||||
|
into the same string.
|
||||||
|
|
||||||
@param[out] result created string
|
@param[out] result string the bytes are appended to
|
||||||
|
|
||||||
@return whether string creation completed
|
@return whether string creation completed
|
||||||
*/
|
|
||||||
bool get_cbor_string(string_t& result)
|
|
||||||
{
|
|
||||||
if (JSON_HEDLEY_UNLIKELY(!unexpect_eof(input_format_t::cbor, "string")))
|
|
||||||
{
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
|
|
||||||
|
@pre @a current is not EOF
|
||||||
|
*/
|
||||||
|
bool get_cbor_string_chunk(string_t& result)
|
||||||
|
{
|
||||||
switch (current)
|
switch (current)
|
||||||
{
|
{
|
||||||
// UTF-8 string (0x00..0x17 bytes follow)
|
// UTF-8 string (0x00..0x17 bytes follow)
|
||||||
@@ -1068,20 +1159,6 @@ class binary_reader
|
|||||||
return get_number(input_format_t::cbor, len) && get_string(input_format_t::cbor, len, result);
|
return get_number(input_format_t::cbor, len) && get_string(input_format_t::cbor, len, result);
|
||||||
}
|
}
|
||||||
|
|
||||||
case 0x7F: // UTF-8 string (indefinite length)
|
|
||||||
{
|
|
||||||
while (get() != 0xFF)
|
|
||||||
{
|
|
||||||
string_t chunk;
|
|
||||||
if (!get_cbor_string(chunk))
|
|
||||||
{
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
result.append(chunk);
|
|
||||||
}
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
default:
|
default:
|
||||||
{
|
{
|
||||||
auto last_token = get_token_string();
|
auto last_token = get_token_string();
|
||||||
@@ -1092,23 +1169,82 @@ class binary_reader
|
|||||||
}
|
}
|
||||||
|
|
||||||
/*!
|
/*!
|
||||||
@brief reads a CBOR byte array
|
@brief reads a CBOR string
|
||||||
|
|
||||||
This function first reads starting bytes to determine the expected
|
This function first reads starting bytes to determine the expected
|
||||||
byte array length and then copies this number of bytes into the byte array.
|
string length and then copies this number of bytes into a string.
|
||||||
Additionally, CBOR's byte arrays with indefinite lengths are supported.
|
Additionally, CBOR's strings with indefinite lengths are supported.
|
||||||
|
|
||||||
@param[out] result created byte array
|
@param[out] result created string
|
||||||
|
|
||||||
@return whether byte array creation completed
|
@return whether string creation completed
|
||||||
*/
|
*/
|
||||||
bool get_cbor_binary(binary_t& result)
|
bool get_cbor_string(string_t& result)
|
||||||
{
|
{
|
||||||
if (JSON_HEDLEY_UNLIKELY(!unexpect_eof(input_format_t::cbor, "binary")))
|
// number of indefinite-length strings that have been opened and not
|
||||||
|
// closed yet. RFC 8949, Section 3.2.3 does not permit nesting them,
|
||||||
|
// but this reader has always accepted it, so the open levels are
|
||||||
|
// counted instead of recursed through, which overflowed the stack for
|
||||||
|
// an input of repeated 0x7F bytes (see #5104). Every chunk is appended
|
||||||
|
// to the same result, so no per-level state is needed.
|
||||||
|
std::size_t open = 0;
|
||||||
|
|
||||||
|
while (true)
|
||||||
|
{
|
||||||
|
if (JSON_HEDLEY_UNLIKELY(!unexpect_eof(input_format_t::cbor, "string")))
|
||||||
{
|
{
|
||||||
return false;
|
return false;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
if (current == 0x7F) // UTF-8 string (indefinite length)
|
||||||
|
{
|
||||||
|
++open;
|
||||||
|
get();
|
||||||
|
continue;
|
||||||
|
}
|
||||||
|
|
||||||
|
// a break marker closes the innermost indefinite-length string;
|
||||||
|
// outside of one it is not a string and falls through to the error
|
||||||
|
if (open != 0 && current == 0xFF)
|
||||||
|
{
|
||||||
|
if (--open == 0)
|
||||||
|
{
|
||||||
|
return true;
|
||||||
|
}
|
||||||
|
get();
|
||||||
|
continue;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (JSON_HEDLEY_UNLIKELY(!get_cbor_string_chunk(result)))
|
||||||
|
{
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (open == 0)
|
||||||
|
{
|
||||||
|
return true;
|
||||||
|
}
|
||||||
|
|
||||||
|
get();
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
/*!
|
||||||
|
@brief reads a definite-length CBOR byte array
|
||||||
|
|
||||||
|
Reads everything @ref get_cbor_binary accepts except the indefinite-length
|
||||||
|
form, which that function handles itself. The bytes are appended to @a
|
||||||
|
result, so consecutive chunks of an indefinite-length byte array can be
|
||||||
|
read into the same byte array.
|
||||||
|
|
||||||
|
@param[out] result byte array the bytes are appended to
|
||||||
|
|
||||||
|
@return whether byte array creation completed
|
||||||
|
|
||||||
|
@pre @a current is not EOF
|
||||||
|
*/
|
||||||
|
bool get_cbor_binary_chunk(binary_t& result)
|
||||||
|
{
|
||||||
switch (current)
|
switch (current)
|
||||||
{
|
{
|
||||||
// Binary data (0x00..0x17 bytes follow)
|
// Binary data (0x00..0x17 bytes follow)
|
||||||
@@ -1168,20 +1304,6 @@ class binary_reader
|
|||||||
get_binary(input_format_t::cbor, len, result);
|
get_binary(input_format_t::cbor, len, result);
|
||||||
}
|
}
|
||||||
|
|
||||||
case 0x5F: // Binary data (indefinite length)
|
|
||||||
{
|
|
||||||
while (get() != 0xFF)
|
|
||||||
{
|
|
||||||
binary_t chunk;
|
|
||||||
if (!get_cbor_binary(chunk))
|
|
||||||
{
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
result.insert(result.end(), chunk.begin(), chunk.end());
|
|
||||||
}
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
default:
|
default:
|
||||||
{
|
{
|
||||||
auto last_token = get_token_string();
|
auto last_token = get_token_string();
|
||||||
@@ -1191,6 +1313,63 @@ class binary_reader
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/*!
|
||||||
|
@brief reads a CBOR byte array
|
||||||
|
|
||||||
|
This function first reads starting bytes to determine the expected
|
||||||
|
byte array length and then copies this number of bytes into the byte array.
|
||||||
|
Additionally, CBOR's byte arrays with indefinite lengths are supported.
|
||||||
|
|
||||||
|
@param[out] result created byte array
|
||||||
|
|
||||||
|
@return whether byte array creation completed
|
||||||
|
*/
|
||||||
|
bool get_cbor_binary(binary_t& result)
|
||||||
|
{
|
||||||
|
// the open indefinite-length byte arrays are counted rather than
|
||||||
|
// recursed through, for the reason given in @ref get_cbor_string
|
||||||
|
std::size_t open = 0;
|
||||||
|
|
||||||
|
while (true)
|
||||||
|
{
|
||||||
|
if (JSON_HEDLEY_UNLIKELY(!unexpect_eof(input_format_t::cbor, "binary")))
|
||||||
|
{
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (current == 0x5F) // Binary data (indefinite length)
|
||||||
|
{
|
||||||
|
++open;
|
||||||
|
get();
|
||||||
|
continue;
|
||||||
|
}
|
||||||
|
|
||||||
|
// a break marker closes the innermost indefinite-length byte
|
||||||
|
// array; outside of one it falls through to the error below
|
||||||
|
if (open != 0 && current == 0xFF)
|
||||||
|
{
|
||||||
|
if (--open == 0)
|
||||||
|
{
|
||||||
|
return true;
|
||||||
|
}
|
||||||
|
get();
|
||||||
|
continue;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (JSON_HEDLEY_UNLIKELY(!get_cbor_binary_chunk(result)))
|
||||||
|
{
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (open == 0)
|
||||||
|
{
|
||||||
|
return true;
|
||||||
|
}
|
||||||
|
|
||||||
|
get();
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
/*!
|
/*!
|
||||||
@brief narrow a definite CBOR array/map length to std::size_t
|
@brief narrow a definite CBOR array/map length to std::size_t
|
||||||
|
|
||||||
@@ -1217,96 +1396,110 @@ class binary_reader
|
|||||||
}
|
}
|
||||||
|
|
||||||
/*!
|
/*!
|
||||||
@param[in] len the length of the array or detail::unknown_size() for an
|
@brief read a CBOR value and everything nested inside it
|
||||||
array of indefinite size
|
|
||||||
|
Reads values until the one that was begun here is complete, resuming the
|
||||||
|
enclosing container after each element, so that the nesting depth of the
|
||||||
|
input costs heap rather than native stack (see #5104).
|
||||||
|
|
||||||
|
@param[in] get_char whether a new character should be retrieved from the
|
||||||
|
input (true) or whether the last read character
|
||||||
|
@a current should be considered instead
|
||||||
@param[in] tag_handler how CBOR tags should be treated
|
@param[in] tag_handler how CBOR tags should be treated
|
||||||
@return whether array creation completed
|
|
||||||
|
@return whether reading the value succeeded
|
||||||
*/
|
*/
|
||||||
bool get_cbor_array(const std::size_t len,
|
bool parse_cbor_internal(const bool get_char,
|
||||||
const cbor_tag_handler_t tag_handler)
|
const cbor_tag_handler_t tag_handler)
|
||||||
{
|
{
|
||||||
if (JSON_HEDLEY_UNLIKELY(!sax->start_array(len)))
|
// whether the next value starts at a fresh byte or at the one already
|
||||||
{
|
// read into `current`
|
||||||
return false;
|
bool fetch = get_char;
|
||||||
}
|
|
||||||
|
|
||||||
if (len != detail::unknown_size())
|
// the key currently being read; hoisted out of the loop so that its
|
||||||
{
|
// capacity is reused across elements and across nesting levels
|
||||||
for (std::size_t i = 0; i < len; ++i)
|
|
||||||
{
|
|
||||||
if (JSON_HEDLEY_UNLIKELY(!parse_cbor_internal(true, tag_handler)))
|
|
||||||
{
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
else
|
|
||||||
{
|
|
||||||
while (get() != 0xFF)
|
|
||||||
{
|
|
||||||
if (JSON_HEDLEY_UNLIKELY(!parse_cbor_internal(false, tag_handler)))
|
|
||||||
{
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
return sax->end_array();
|
|
||||||
}
|
|
||||||
|
|
||||||
/*!
|
|
||||||
@param[in] len the length of the object or detail::unknown_size() for an
|
|
||||||
object of indefinite size
|
|
||||||
@param[in] tag_handler how CBOR tags should be treated
|
|
||||||
@return whether object creation completed
|
|
||||||
*/
|
|
||||||
bool get_cbor_object(const std::size_t len,
|
|
||||||
const cbor_tag_handler_t tag_handler)
|
|
||||||
{
|
|
||||||
if (JSON_HEDLEY_UNLIKELY(!sax->start_object(len)))
|
|
||||||
{
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
|
|
||||||
if (len != 0)
|
|
||||||
{
|
|
||||||
string_t key;
|
string_t key;
|
||||||
if (len != detail::unknown_size())
|
|
||||||
|
while (true)
|
||||||
{
|
{
|
||||||
for (std::size_t i = 0; i < len; ++i)
|
if (!container_stack.empty())
|
||||||
|
{
|
||||||
|
// the reference is not held across parse_cbor_value() below,
|
||||||
|
// which can push onto the stack and reallocate it
|
||||||
|
container_frame& top = container_stack.back();
|
||||||
|
bool at_end = false;
|
||||||
|
|
||||||
|
if (top.remaining != npos)
|
||||||
|
{
|
||||||
|
// definite length: the container ends once its elements
|
||||||
|
// have been read
|
||||||
|
at_end = (top.remaining == 0);
|
||||||
|
if (!at_end)
|
||||||
|
{
|
||||||
|
// claim the element about to be read
|
||||||
|
--top.remaining;
|
||||||
|
if (top.is_object)
|
||||||
{
|
{
|
||||||
get();
|
get();
|
||||||
if (JSON_HEDLEY_UNLIKELY(!get_cbor_string(key) || !sax->key(key)))
|
|
||||||
{
|
|
||||||
return false;
|
|
||||||
}
|
}
|
||||||
|
|
||||||
if (JSON_HEDLEY_UNLIKELY(!parse_cbor_internal(true, tag_handler)))
|
|
||||||
{
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
key.clear();
|
|
||||||
}
|
}
|
||||||
|
fetch = true;
|
||||||
}
|
}
|
||||||
else
|
else
|
||||||
{
|
{
|
||||||
while (get() != 0xFF)
|
// indefinite length: the container ends at a break marker.
|
||||||
|
// Testing for it consumes a byte, which is the first byte
|
||||||
|
// of the next element when it is not one.
|
||||||
|
at_end = (get() == 0xFF);
|
||||||
|
fetch = top.is_object;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (at_end)
|
||||||
{
|
{
|
||||||
|
const bool is_object = top.is_object;
|
||||||
|
container_stack.pop_back();
|
||||||
|
if (JSON_HEDLEY_UNLIKELY(is_object ? !sax->end_object() : !sax->end_array()))
|
||||||
|
{
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
// the value begun here is complete once its container is
|
||||||
|
if (container_stack.empty())
|
||||||
|
{
|
||||||
|
return true;
|
||||||
|
}
|
||||||
|
continue;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (top.is_object)
|
||||||
|
{
|
||||||
|
key.clear();
|
||||||
if (JSON_HEDLEY_UNLIKELY(!get_cbor_string(key) || !sax->key(key)))
|
if (JSON_HEDLEY_UNLIKELY(!get_cbor_string(key) || !sax->key(key)))
|
||||||
{
|
{
|
||||||
return false;
|
return false;
|
||||||
}
|
}
|
||||||
|
fetch = true;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
if (JSON_HEDLEY_UNLIKELY(!parse_cbor_internal(true, tag_handler)))
|
// a tag is not a value of its own: read on until the tagged value
|
||||||
|
bool tag_pending = false;
|
||||||
|
do
|
||||||
|
{
|
||||||
|
if (JSON_HEDLEY_UNLIKELY(!parse_cbor_value(fetch, tag_handler, tag_pending)))
|
||||||
{
|
{
|
||||||
return false;
|
return false;
|
||||||
}
|
}
|
||||||
key.clear();
|
fetch = true;
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
|
while (tag_pending);
|
||||||
|
|
||||||
return sax->end_object();
|
// a value that opened a container left it on the stack; one that
|
||||||
|
// did not, and that was not inside a container, was the whole value
|
||||||
|
if (container_stack.empty())
|
||||||
|
{
|
||||||
|
return true;
|
||||||
|
}
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
/////////////
|
/////////////
|
||||||
@@ -1316,7 +1509,17 @@ class binary_reader
|
|||||||
/*!
|
/*!
|
||||||
@return whether a valid MessagePack value was passed to the SAX parser
|
@return whether a valid MessagePack value was passed to the SAX parser
|
||||||
*/
|
*/
|
||||||
bool parse_msgpack_internal()
|
/*!
|
||||||
|
@brief read one MessagePack value
|
||||||
|
|
||||||
|
Reads a single value and passes it to the SAX parser. A value that begins
|
||||||
|
a container is not read to its end: the container is opened with
|
||||||
|
@ref enter_container and its elements are read by
|
||||||
|
@ref parse_msgpack_internal, so that nesting does not consume native stack.
|
||||||
|
|
||||||
|
@return whether reading the value succeeded
|
||||||
|
*/
|
||||||
|
bool parse_msgpack_value()
|
||||||
{
|
{
|
||||||
switch (get())
|
switch (get())
|
||||||
{
|
{
|
||||||
@@ -1472,7 +1675,7 @@ class binary_reader
|
|||||||
case 0x8D:
|
case 0x8D:
|
||||||
case 0x8E:
|
case 0x8E:
|
||||||
case 0x8F:
|
case 0x8F:
|
||||||
return get_msgpack_object(conditional_static_cast<std::size_t>(static_cast<unsigned int>(current) & 0x0Fu));
|
return enter_object(conditional_static_cast<std::size_t>(static_cast<unsigned int>(current) & 0x0Fu));
|
||||||
|
|
||||||
// fixarray
|
// fixarray
|
||||||
case 0x90:
|
case 0x90:
|
||||||
@@ -1491,7 +1694,7 @@ class binary_reader
|
|||||||
case 0x9D:
|
case 0x9D:
|
||||||
case 0x9E:
|
case 0x9E:
|
||||||
case 0x9F:
|
case 0x9F:
|
||||||
return get_msgpack_array(conditional_static_cast<std::size_t>(static_cast<unsigned int>(current) & 0x0Fu));
|
return enter_array(conditional_static_cast<std::size_t>(static_cast<unsigned int>(current) & 0x0Fu));
|
||||||
|
|
||||||
// fixstr
|
// fixstr
|
||||||
case 0xA0:
|
case 0xA0:
|
||||||
@@ -1622,25 +1825,25 @@ class binary_reader
|
|||||||
case 0xDC: // array 16
|
case 0xDC: // array 16
|
||||||
{
|
{
|
||||||
std::uint16_t len{};
|
std::uint16_t len{};
|
||||||
return get_number(input_format_t::msgpack, len) && get_msgpack_array(static_cast<std::size_t>(len));
|
return get_number(input_format_t::msgpack, len) && enter_array(static_cast<std::size_t>(len));
|
||||||
}
|
}
|
||||||
|
|
||||||
case 0xDD: // array 32
|
case 0xDD: // array 32
|
||||||
{
|
{
|
||||||
std::uint32_t len{};
|
std::uint32_t len{};
|
||||||
return get_number(input_format_t::msgpack, len) && get_msgpack_array(conditional_static_cast<std::size_t>(len));
|
return get_number(input_format_t::msgpack, len) && enter_array(conditional_static_cast<std::size_t>(len));
|
||||||
}
|
}
|
||||||
|
|
||||||
case 0xDE: // map 16
|
case 0xDE: // map 16
|
||||||
{
|
{
|
||||||
std::uint16_t len{};
|
std::uint16_t len{};
|
||||||
return get_number(input_format_t::msgpack, len) && get_msgpack_object(static_cast<std::size_t>(len));
|
return get_number(input_format_t::msgpack, len) && enter_object(static_cast<std::size_t>(len));
|
||||||
}
|
}
|
||||||
|
|
||||||
case 0xDF: // map 32
|
case 0xDF: // map 32
|
||||||
{
|
{
|
||||||
std::uint32_t len{};
|
std::uint32_t len{};
|
||||||
return get_number(input_format_t::msgpack, len) && get_msgpack_object(conditional_static_cast<std::size_t>(len));
|
return get_number(input_format_t::msgpack, len) && enter_object(conditional_static_cast<std::size_t>(len));
|
||||||
}
|
}
|
||||||
|
|
||||||
// negative fixint
|
// negative fixint
|
||||||
@@ -1888,55 +2091,69 @@ class binary_reader
|
|||||||
}
|
}
|
||||||
|
|
||||||
/*!
|
/*!
|
||||||
@param[in] len the length of the array
|
@brief read a MessagePack value and everything nested inside it
|
||||||
@return whether array creation completed
|
|
||||||
|
Reads values until the one that was begun here is complete, resuming the
|
||||||
|
enclosing container each time an element ends, so that the nesting depth
|
||||||
|
of the input costs heap rather than native stack (see #5104).
|
||||||
|
|
||||||
|
@return whether reading the value succeeded
|
||||||
*/
|
*/
|
||||||
bool get_msgpack_array(const std::size_t len)
|
bool parse_msgpack_internal()
|
||||||
{
|
{
|
||||||
if (JSON_HEDLEY_UNLIKELY(!sax->start_array(len)))
|
// the key currently being read; hoisted out of the loop so that its
|
||||||
{
|
// capacity is reused across elements and across nesting levels
|
||||||
return false;
|
|
||||||
}
|
|
||||||
|
|
||||||
for (std::size_t i = 0; i < len; ++i)
|
|
||||||
{
|
|
||||||
if (JSON_HEDLEY_UNLIKELY(!parse_msgpack_internal()))
|
|
||||||
{
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
return sax->end_array();
|
|
||||||
}
|
|
||||||
|
|
||||||
/*!
|
|
||||||
@param[in] len the length of the object
|
|
||||||
@return whether object creation completed
|
|
||||||
*/
|
|
||||||
bool get_msgpack_object(const std::size_t len)
|
|
||||||
{
|
|
||||||
if (JSON_HEDLEY_UNLIKELY(!sax->start_object(len)))
|
|
||||||
{
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
|
|
||||||
string_t key;
|
string_t key;
|
||||||
for (std::size_t i = 0; i < len; ++i)
|
|
||||||
|
while (true)
|
||||||
|
{
|
||||||
|
if (!container_stack.empty())
|
||||||
|
{
|
||||||
|
// copied out before anything can push onto the stack and
|
||||||
|
// invalidate a reference into it
|
||||||
|
const bool is_object = container_stack.back().is_object;
|
||||||
|
|
||||||
|
if (container_stack.back().remaining == 0)
|
||||||
|
{
|
||||||
|
container_stack.pop_back();
|
||||||
|
if (JSON_HEDLEY_UNLIKELY(is_object ? !sax->end_object() : !sax->end_array()))
|
||||||
|
{
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
// the value begun here is complete once its container is
|
||||||
|
if (container_stack.empty())
|
||||||
|
{
|
||||||
|
return true;
|
||||||
|
}
|
||||||
|
continue;
|
||||||
|
}
|
||||||
|
|
||||||
|
// claim the element about to be read
|
||||||
|
--container_stack.back().remaining;
|
||||||
|
|
||||||
|
if (is_object)
|
||||||
{
|
{
|
||||||
get();
|
get();
|
||||||
|
key.clear();
|
||||||
if (JSON_HEDLEY_UNLIKELY(!get_msgpack_string(key) || !sax->key(key)))
|
if (JSON_HEDLEY_UNLIKELY(!get_msgpack_string(key) || !sax->key(key)))
|
||||||
{
|
{
|
||||||
return false;
|
return false;
|
||||||
}
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
if (JSON_HEDLEY_UNLIKELY(!parse_msgpack_internal()))
|
if (JSON_HEDLEY_UNLIKELY(!parse_msgpack_value()))
|
||||||
{
|
{
|
||||||
return false;
|
return false;
|
||||||
}
|
}
|
||||||
key.clear();
|
|
||||||
}
|
|
||||||
|
|
||||||
return sax->end_object();
|
// a value that opened a container left it on the stack; one that
|
||||||
|
// did not, and that was not inside a container, was the whole value
|
||||||
|
if (container_stack.empty())
|
||||||
|
{
|
||||||
|
return true;
|
||||||
|
}
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
////////////
|
////////////
|
||||||
@@ -2391,7 +2608,12 @@ class binary_reader
|
|||||||
{
|
{
|
||||||
result.first = npos; // size
|
result.first = npos; // size
|
||||||
result.second = 0; // type
|
result.second = 0; // type
|
||||||
bool is_ndarray = false;
|
// seed the flag with the caller's context: inside an ndarray dimension
|
||||||
|
// vector another ndarray is not allowed, and get_ubjson_size_value()
|
||||||
|
// rejects it up front instead of reading it and reporting afterwards.
|
||||||
|
// Seeding it with `false` made every '#' of a "[#[#[..." chain descend
|
||||||
|
// another level, which overflowed the stack (see #5104).
|
||||||
|
bool is_ndarray = inside_ndarray;
|
||||||
|
|
||||||
get_ignore_noop();
|
get_ignore_noop();
|
||||||
|
|
||||||
@@ -2424,13 +2646,11 @@ class binary_reader
|
|||||||
}
|
}
|
||||||
|
|
||||||
const bool is_error = get_ubjson_size_value(result.first, is_ndarray);
|
const bool is_error = get_ubjson_size_value(result.first, is_ndarray);
|
||||||
if (input_format == input_format_t::bjdata && is_ndarray)
|
// an ndarray was read here only if the flag flipped; when it was
|
||||||
|
// seeded true, get_ubjson_size_value() already rejected the nested
|
||||||
|
// dimension vector
|
||||||
|
if (input_format == input_format_t::bjdata && is_ndarray && !inside_ndarray)
|
||||||
{
|
{
|
||||||
if (inside_ndarray)
|
|
||||||
{
|
|
||||||
return sax->parse_error(chars_read, get_token_string(), parse_error::create(112, chars_read,
|
|
||||||
exception_message(input_format, "ndarray can not be recursive", "size"), nullptr));
|
|
||||||
}
|
|
||||||
result.second |= (1 << 8); // use bit 8 to indicate ndarray, all UBJSON and BJData markers should be ASCII letters
|
result.second |= (1 << 8); // use bit 8 to indicate ndarray, all UBJSON and BJData markers should be ASCII letters
|
||||||
}
|
}
|
||||||
return is_error;
|
return is_error;
|
||||||
@@ -2439,7 +2659,7 @@ class binary_reader
|
|||||||
if (current == '#')
|
if (current == '#')
|
||||||
{
|
{
|
||||||
const bool is_error = get_ubjson_size_value(result.first, is_ndarray);
|
const bool is_error = get_ubjson_size_value(result.first, is_ndarray);
|
||||||
if (input_format == input_format_t::bjdata && is_ndarray)
|
if (input_format == input_format_t::bjdata && is_ndarray && !inside_ndarray)
|
||||||
{
|
{
|
||||||
return sax->parse_error(chars_read, get_token_string(), parse_error::create(112, chars_read,
|
return sax->parse_error(chars_read, get_token_string(), parse_error::create(112, chars_read,
|
||||||
exception_message(input_format, "ndarray requires both type and size", "size"), nullptr));
|
exception_message(input_format, "ndarray requires both type and size", "size"), nullptr));
|
||||||
@@ -2710,6 +2930,17 @@ class binary_reader
|
|||||||
|
|
||||||
if (size_and_type.first != npos)
|
if (size_and_type.first != npos)
|
||||||
{
|
{
|
||||||
|
// reading an element of a valueless type consumes no input, so the
|
||||||
|
// declared count alone decides how much is allocated; the check is
|
||||||
|
// made before the start event so that no container is opened that
|
||||||
|
// is then abandoned. See @ref max_valueless_container_size.
|
||||||
|
if (JSON_HEDLEY_UNLIKELY((size_and_type.second == 'Z' || size_and_type.second == 'T' || size_and_type.second == 'F')
|
||||||
|
&& size_and_type.first > max_valueless_container_size))
|
||||||
|
{
|
||||||
|
return sax->parse_error(chars_read, get_token_string(), out_of_range::create(408,
|
||||||
|
exception_message(input_format, "excessive array size", "size"), nullptr));
|
||||||
|
}
|
||||||
|
|
||||||
if (JSON_HEDLEY_UNLIKELY(!sax->start_array(size_and_type.first)))
|
if (JSON_HEDLEY_UNLIKELY(!sax->start_array(size_and_type.first)))
|
||||||
{
|
{
|
||||||
return false;
|
return false;
|
||||||
@@ -3227,6 +3458,9 @@ class binary_reader
|
|||||||
/// the SAX parser
|
/// the SAX parser
|
||||||
json_sax_t* sax = nullptr;
|
json_sax_t* sax = nullptr;
|
||||||
|
|
||||||
|
/// the containers that have been opened and not closed yet; see @ref container_frame
|
||||||
|
std::vector<container_frame> container_stack{};
|
||||||
|
|
||||||
// excluded markers in bjdata optimized type
|
// excluded markers in bjdata optimized type
|
||||||
#define JSON_BINARY_READER_MAKE_BJD_OPTIMIZED_TYPE_MARKERS_ \
|
#define JSON_BINARY_READER_MAKE_BJD_OPTIMIZED_TYPE_MARKERS_ \
|
||||||
make_array<char_int_type>('F', 'H', 'N', 'S', 'T', 'Z', '[', '{')
|
make_array<char_int_type>('F', 'H', 'N', 'S', 'T', 'Z', '[', '{')
|
||||||
|
|||||||
@@ -149,11 +149,10 @@ class lexer : public lexer_base<BasicJsonType>
|
|||||||
public:
|
public:
|
||||||
using token_type = typename lexer_base<BasicJsonType>::token_type;
|
using token_type = typename lexer_base<BasicJsonType>::token_type;
|
||||||
|
|
||||||
explicit lexer(InputAdapterType&& adapter, bool ignore_comments_ = false, bool discard_number_values_ = false) noexcept
|
explicit lexer(InputAdapterType&& adapter, bool ignore_comments_ = false) noexcept
|
||||||
: ia(std::move(adapter))
|
: ia(std::move(adapter))
|
||||||
, ignore_comments(ignore_comments_)
|
, ignore_comments(ignore_comments_)
|
||||||
, decimal_point_char(static_cast<char_int_type>(get_decimal_point()))
|
, decimal_point_char(static_cast<char_int_type>(get_decimal_point()))
|
||||||
, discard_number_values(discard_number_values_)
|
|
||||||
{}
|
{}
|
||||||
|
|
||||||
// deleted because of pointer members
|
// deleted because of pointer members
|
||||||
@@ -1280,58 +1279,6 @@ scan_number_done:
|
|||||||
// we are done scanning a number)
|
// we are done scanning a number)
|
||||||
unget();
|
unget();
|
||||||
|
|
||||||
// If the caller does not need the converted value (only whether the
|
|
||||||
// input is syntactically valid; see json_sax_acceptor/accept()), an
|
|
||||||
// unsigned/integer token can be reported without calling
|
|
||||||
// strtoull()/strtoll() at all, *provided* we can already tell from
|
|
||||||
// the digit count alone that the conversion cannot overflow 64 bits.
|
|
||||||
// Such tokens are always finite and are accepted unconditionally by
|
|
||||||
// the parser regardless of their actual value (parser::sax_parse_internal()
|
|
||||||
// never checks finiteness for value_unsigned/value_integer), so the
|
|
||||||
// classification below is all that is needed.
|
|
||||||
//
|
|
||||||
// A decimal number with up to 18 digits is always representable in
|
|
||||||
// both std::uint64_t and std::int64_t (18 nines is ~1e18, well below
|
|
||||||
// both UINT64_MAX ~1.8e19 and INT64_MAX ~9.2e18), so strtoull()/strtoll()
|
|
||||||
// could not have set errno to ERANGE for it. Numbers with more digits
|
|
||||||
// (rare in practice) fall through to the exact code below, unchanged,
|
|
||||||
// so their handling -- including reclassification to value_float when
|
|
||||||
// the value overflows 64 bits, and rejection when it is not even
|
|
||||||
// finite as a double -- is bit-for-bit identical to before this
|
|
||||||
// optimization.
|
|
||||||
//
|
|
||||||
// Note this reasons about std::uint64_t/std::int64_t, not about
|
|
||||||
// number_unsigned_t/number_integer_t (BasicJsonType's own, possibly
|
|
||||||
// narrower, template parameters -- e.g. std::uint32_t). That is fine
|
|
||||||
// *only* because discard_number_values is exclusively set by
|
|
||||||
// accept() (see json.hpp), and accept() always parses through the
|
|
||||||
// library's own json_sax_acceptor -- never a user-supplied SAX
|
|
||||||
// consumer -- whose number_unsigned()/number_integer()/number_float()
|
|
||||||
// callbacks unconditionally discard their argument and return true.
|
|
||||||
// So for every caller that can reach this branch, neither the token
|
|
||||||
// classification below nor the eventual (possibly narrowed, and on
|
|
||||||
// this fast path left stale/unset) value_unsigned/value_integer is
|
|
||||||
// ever consulted -- an unsigned/integer token is accepted outright,
|
|
||||||
// and even a >18-digit token that this fast path deliberately falls
|
|
||||||
// through for is, once reclassified to value_float, still finite
|
|
||||||
// (and thus accepted) for any digit count that fits in number_unsigned_t
|
|
||||||
// or number_integer_t regardless of that type's width. If this
|
|
||||||
// function is ever taught to run with discard_number_values true for
|
|
||||||
// a caller that *does* read the converted value, this reasoning (and
|
|
||||||
// the fast path below) would need to be revisited.
|
|
||||||
if (discard_number_values)
|
|
||||||
{
|
|
||||||
constexpr std::size_t safe_digit_count = 18;
|
|
||||||
if (number_type == token_type::value_unsigned && token_buffer.size() <= safe_digit_count)
|
|
||||||
{
|
|
||||||
return token_type::value_unsigned;
|
|
||||||
}
|
|
||||||
if (number_type == token_type::value_integer && token_buffer.size() - 1 <= safe_digit_count)
|
|
||||||
{
|
|
||||||
return token_type::value_integer;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
char* endptr = nullptr; // NOLINT(misc-const-correctness,cppcoreguidelines-pro-type-vararg,hicpp-vararg)
|
char* endptr = nullptr; // NOLINT(misc-const-correctness,cppcoreguidelines-pro-type-vararg,hicpp-vararg)
|
||||||
errno = 0;
|
errno = 0;
|
||||||
|
|
||||||
@@ -1446,7 +1393,8 @@ scan_number_done:
|
|||||||
*/
|
*/
|
||||||
char_int_type get()
|
char_int_type get()
|
||||||
{
|
{
|
||||||
advance_position();
|
++position.chars_read_total;
|
||||||
|
++position.chars_read_current_line;
|
||||||
|
|
||||||
if (next_unget)
|
if (next_unget)
|
||||||
{
|
{
|
||||||
@@ -1458,23 +1406,6 @@ scan_number_done:
|
|||||||
current = ia.get_character();
|
current = ia.get_character();
|
||||||
}
|
}
|
||||||
|
|
||||||
return track_after_read();
|
|
||||||
}
|
|
||||||
|
|
||||||
/// shared head of get() / get_ignoring_pending_unget(): bump the
|
|
||||||
/// per-character position counters (line-count-on-'\n' bookkeeping is
|
|
||||||
/// handled afterwards, in track_after_read(), once `current` is known)
|
|
||||||
void advance_position() noexcept
|
|
||||||
{
|
|
||||||
++position.chars_read_total;
|
|
||||||
++position.chars_read_current_line;
|
|
||||||
}
|
|
||||||
|
|
||||||
/// shared tail of get() / get_ignoring_pending_unget(): capture the
|
|
||||||
/// character for error messages (if needed) and update line/column
|
|
||||||
/// bookkeeping for the character now in `current`
|
|
||||||
char_int_type track_after_read()
|
|
||||||
{
|
|
||||||
// seekable adapters reconstruct the token lazily on error (see
|
// seekable adapters reconstruct the token lazily on error (see
|
||||||
// get_token_string), so the eager per-character copy is skipped
|
// get_token_string), so the eager per-character copy is skipped
|
||||||
capture_char(std::integral_constant<bool, lazy_token_string> {});
|
capture_char(std::integral_constant<bool, lazy_token_string> {});
|
||||||
@@ -1488,29 +1419,6 @@ scan_number_done:
|
|||||||
return current;
|
return current;
|
||||||
}
|
}
|
||||||
|
|
||||||
/*!
|
|
||||||
@brief like get(), but for call sites that can prove no unget() is pending
|
|
||||||
|
|
||||||
get() has to check the `next_unget` flag on every call, because a
|
|
||||||
previous token may have ended with unget() (e.g. scan_number() always
|
|
||||||
ungets the character that terminated the number, so the next call to
|
|
||||||
scan() can see it again). skip_whitespace() reads that first,
|
|
||||||
possibly-ungotten character via a plain get(), but every further
|
|
||||||
character it reads is guaranteed to be a fresh read: nothing between
|
|
||||||
those calls invokes unget(). This variant skips the (otherwise always
|
|
||||||
false) next_unget branch for those calls; it is not a general
|
|
||||||
replacement for get().
|
|
||||||
*/
|
|
||||||
char_int_type get_ignoring_pending_unget()
|
|
||||||
{
|
|
||||||
JSON_ASSERT(!next_unget);
|
|
||||||
|
|
||||||
advance_position();
|
|
||||||
current = ia.get_character();
|
|
||||||
|
|
||||||
return track_after_read();
|
|
||||||
}
|
|
||||||
|
|
||||||
/// seekable adapter: nothing to capture, the token is rebuilt on error
|
/// seekable adapter: nothing to capture, the token is rebuilt on error
|
||||||
void capture_char(std::true_type /*lazy*/) const noexcept {}
|
void capture_char(std::true_type /*lazy*/) const noexcept {}
|
||||||
|
|
||||||
@@ -1704,37 +1612,13 @@ scan_number_done:
|
|||||||
return true;
|
return true;
|
||||||
}
|
}
|
||||||
|
|
||||||
/// whether `current` is one of the four JSON whitespace characters
|
|
||||||
bool current_is_whitespace() const noexcept
|
|
||||||
{
|
|
||||||
return current == ' ' || current == '\t' || current == '\n' || current == '\r';
|
|
||||||
}
|
|
||||||
|
|
||||||
void skip_whitespace()
|
void skip_whitespace()
|
||||||
{
|
{
|
||||||
// the first character may be a pending unget() left over from the
|
|
||||||
// previous token (see get_ignoring_pending_unget()); every
|
|
||||||
// subsequent character read by this loop is guaranteed fresh, since
|
|
||||||
// nothing below calls unget()
|
|
||||||
get();
|
|
||||||
|
|
||||||
if (!current_is_whitespace())
|
|
||||||
{
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
|
|
||||||
// this is written as an if-guarded do-while (rather than a plain
|
|
||||||
// while loop) because that shape is what lets both GCC and Clang
|
|
||||||
// keep the input adapter's read pointer in a register across
|
|
||||||
// iterations; the equivalent while-loop measurably defeated that
|
|
||||||
// optimization in testing, turning long whitespace runs (e.g. the
|
|
||||||
// indentation of pretty-printed JSON) from a register-only loop
|
|
||||||
// into one that reloads the pointer from memory every character
|
|
||||||
do
|
do
|
||||||
{
|
{
|
||||||
get_ignoring_pending_unget();
|
get();
|
||||||
}
|
}
|
||||||
while (current_is_whitespace());
|
while (current == ' ' || current == '\t' || current == '\n' || current == '\r');
|
||||||
}
|
}
|
||||||
|
|
||||||
token_type scan()
|
token_type scan()
|
||||||
@@ -1870,13 +1754,6 @@ scan_number_done:
|
|||||||
const char_int_type decimal_point_char = '.';
|
const char_int_type decimal_point_char = '.';
|
||||||
/// the position of the decimal point in the input
|
/// the position of the decimal point in the input
|
||||||
std::size_t decimal_point_position = std::string::npos;
|
std::size_t decimal_point_position = std::string::npos;
|
||||||
|
|
||||||
/// whether the caller (e.g. accept()/json_sax_acceptor) only needs the
|
|
||||||
/// token classification and never looks at the converted numeric value;
|
|
||||||
/// when set, scan_number() may skip strtoull()/strtoll() for
|
|
||||||
/// value_unsigned/value_integer tokens whose digit count guarantees they
|
|
||||||
/// fit into 64 bits (see scan_number())
|
|
||||||
const bool discard_number_values = false;
|
|
||||||
};
|
};
|
||||||
|
|
||||||
} // namespace detail
|
} // namespace detail
|
||||||
|
|||||||
@@ -72,10 +72,9 @@ class parser
|
|||||||
parser_callback_t<BasicJsonType> cb = nullptr,
|
parser_callback_t<BasicJsonType> cb = nullptr,
|
||||||
const bool allow_exceptions_ = true,
|
const bool allow_exceptions_ = true,
|
||||||
const bool ignore_comments = false,
|
const bool ignore_comments = false,
|
||||||
const bool ignore_trailing_commas_ = false,
|
const bool ignore_trailing_commas_ = false)
|
||||||
const bool discard_number_values_ = false)
|
|
||||||
: callback(std::move(cb))
|
: callback(std::move(cb))
|
||||||
, m_lexer(std::move(adapter), ignore_comments, discard_number_values_)
|
, m_lexer(std::move(adapter), ignore_comments)
|
||||||
, allow_exceptions(allow_exceptions_)
|
, allow_exceptions(allow_exceptions_)
|
||||||
, ignore_trailing_commas(ignore_trailing_commas_)
|
, ignore_trailing_commas(ignore_trailing_commas_)
|
||||||
{
|
{
|
||||||
|
|||||||
@@ -826,7 +826,17 @@ class binary_writer
|
|||||||
|
|
||||||
std::vector<CharType> bjdx = {'[', '{', 'S', 'H', 'T', 'F', 'N', 'Z'}; // excluded markers in bjdata optimized type
|
std::vector<CharType> bjdx = {'[', '{', 'S', 'H', 'T', 'F', 'N', 'Z'}; // excluded markers in bjdata optimized type
|
||||||
|
|
||||||
if (same_prefix && !(use_bjdata && std::find(bjdx.begin(), bjdx.end(), first_prefix) != bjdx.end()))
|
// an optimized array of a valueless type carries no payload, so a
|
||||||
|
// reader has nothing but the declared count to bound the allocation
|
||||||
|
// by and refuses an excessive one. Write the unoptimized form for
|
||||||
|
// those, at one byte per element, so the result can be read back.
|
||||||
|
// Objects are not affected: every element is preceded by its key.
|
||||||
|
const bool valueless_type = (first_prefix == 'Z' || first_prefix == 'T' || first_prefix == 'F');
|
||||||
|
const bool excessive_valueless = valueless_type
|
||||||
|
&& j.m_data.m_value.array->size() > detail::max_valueless_container_size;
|
||||||
|
|
||||||
|
if (same_prefix && !excessive_valueless
|
||||||
|
&& !(use_bjdata && std::find(bjdx.begin(), bjdx.end(), first_prefix) != bjdx.end()))
|
||||||
{
|
{
|
||||||
prefix_required = false;
|
prefix_required = false;
|
||||||
oa->write_character(to_char_type('$'));
|
oa->write_character(to_char_type('$'));
|
||||||
|
|||||||
+75
-34
@@ -164,12 +164,11 @@ class basic_json // NOLINT(cppcoreguidelines-special-member-functions,hicpp-spec
|
|||||||
detail::parser_callback_t<basic_json>cb = nullptr,
|
detail::parser_callback_t<basic_json>cb = nullptr,
|
||||||
const bool allow_exceptions = true,
|
const bool allow_exceptions = true,
|
||||||
const bool ignore_comments = false,
|
const bool ignore_comments = false,
|
||||||
const bool ignore_trailing_commas = false,
|
const bool ignore_trailing_commas = false
|
||||||
const bool discard_number_values = false
|
|
||||||
)
|
)
|
||||||
{
|
{
|
||||||
return ::nlohmann::detail::parser<basic_json, InputAdapterType>(std::move(adapter),
|
return ::nlohmann::detail::parser<basic_json, InputAdapterType>(std::move(adapter),
|
||||||
std::move(cb), allow_exceptions, ignore_comments, ignore_trailing_commas, discard_number_values);
|
std::move(cb), allow_exceptions, ignore_comments, ignore_trailing_commas);
|
||||||
}
|
}
|
||||||
|
|
||||||
private:
|
private:
|
||||||
@@ -4134,7 +4133,7 @@ class basic_json // NOLINT(cppcoreguidelines-special-member-functions,hicpp-spec
|
|||||||
const bool ignore_comments = false,
|
const bool ignore_comments = false,
|
||||||
const bool ignore_trailing_commas = false)
|
const bool ignore_trailing_commas = false)
|
||||||
{
|
{
|
||||||
return parser(detail::input_adapter(std::forward<InputType>(i)), nullptr, false, ignore_comments, ignore_trailing_commas, true).accept(true);
|
return parser(detail::input_adapter(std::forward<InputType>(i)), nullptr, false, ignore_comments, ignore_trailing_commas).accept(true);
|
||||||
}
|
}
|
||||||
|
|
||||||
/// @brief check if the input is valid JSON (iterator pair, or iterator+sentinel pair for C++20 ranges support)
|
/// @brief check if the input is valid JSON (iterator pair, or iterator+sentinel pair for C++20 ranges support)
|
||||||
@@ -4145,7 +4144,7 @@ class basic_json // NOLINT(cppcoreguidelines-special-member-functions,hicpp-spec
|
|||||||
const bool ignore_comments = false,
|
const bool ignore_comments = false,
|
||||||
const bool ignore_trailing_commas = false)
|
const bool ignore_trailing_commas = false)
|
||||||
{
|
{
|
||||||
return parser(detail::input_adapter(std::move(first), std::move(last)), nullptr, false, ignore_comments, ignore_trailing_commas, true).accept(true);
|
return parser(detail::input_adapter(std::move(first), std::move(last)), nullptr, false, ignore_comments, ignore_trailing_commas).accept(true);
|
||||||
}
|
}
|
||||||
|
|
||||||
JSON_HEDLEY_WARN_UNUSED_RESULT
|
JSON_HEDLEY_WARN_UNUSED_RESULT
|
||||||
@@ -4154,7 +4153,7 @@ class basic_json // NOLINT(cppcoreguidelines-special-member-functions,hicpp-spec
|
|||||||
const bool ignore_comments = false,
|
const bool ignore_comments = false,
|
||||||
const bool ignore_trailing_commas = false)
|
const bool ignore_trailing_commas = false)
|
||||||
{
|
{
|
||||||
return parser(i.get(), nullptr, false, ignore_comments, ignore_trailing_commas, true).accept(true);
|
return parser(i.get(), nullptr, false, ignore_comments, ignore_trailing_commas).accept(true);
|
||||||
}
|
}
|
||||||
|
|
||||||
/// @brief generate SAX events
|
/// @brief generate SAX events
|
||||||
@@ -4474,8 +4473,11 @@ class basic_json // NOLINT(cppcoreguidelines-special-member-functions,hicpp-spec
|
|||||||
basic_json result;
|
basic_json result;
|
||||||
auto ia = detail::input_adapter(std::forward<InputType>(i));
|
auto ia = detail::input_adapter(std::forward<InputType>(i));
|
||||||
detail::json_sax_dom_parser<basic_json, decltype(ia)> sdp(result, allow_exceptions);
|
detail::json_sax_dom_parser<basic_json, decltype(ia)> sdp(result, allow_exceptions);
|
||||||
const bool res = binary_reader<decltype(ia)>(std::move(ia), input_format_t::cbor).sax_parse(input_format_t::cbor, &sdp, strict, tag_handler); // cppcheck-suppress[accessMoved]
|
if (!binary_reader<decltype(ia)>(std::move(ia), input_format_t::cbor).sax_parse(input_format_t::cbor, &sdp, strict, tag_handler)) // cppcheck-suppress[accessMoved]
|
||||||
return res ? result : basic_json(value_t::discarded);
|
{
|
||||||
|
result = value_t::discarded;
|
||||||
|
}
|
||||||
|
return result;
|
||||||
}
|
}
|
||||||
|
|
||||||
/// @brief create a JSON value from an input in CBOR format (iterator pair, or iterator+sentinel pair for C++20 ranges support)
|
/// @brief create a JSON value from an input in CBOR format (iterator pair, or iterator+sentinel pair for C++20 ranges support)
|
||||||
@@ -4491,8 +4493,11 @@ class basic_json // NOLINT(cppcoreguidelines-special-member-functions,hicpp-spec
|
|||||||
basic_json result;
|
basic_json result;
|
||||||
auto ia = detail::input_adapter(std::move(first), std::move(last));
|
auto ia = detail::input_adapter(std::move(first), std::move(last));
|
||||||
detail::json_sax_dom_parser<basic_json, decltype(ia)> sdp(result, allow_exceptions);
|
detail::json_sax_dom_parser<basic_json, decltype(ia)> sdp(result, allow_exceptions);
|
||||||
const bool res = binary_reader<decltype(ia)>(std::move(ia), input_format_t::cbor).sax_parse(input_format_t::cbor, &sdp, strict, tag_handler); // cppcheck-suppress[accessMoved]
|
if (!binary_reader<decltype(ia)>(std::move(ia), input_format_t::cbor).sax_parse(input_format_t::cbor, &sdp, strict, tag_handler)) // cppcheck-suppress[accessMoved]
|
||||||
return res ? result : basic_json(value_t::discarded);
|
{
|
||||||
|
result = value_t::discarded;
|
||||||
|
}
|
||||||
|
return result;
|
||||||
}
|
}
|
||||||
|
|
||||||
template<typename T>
|
template<typename T>
|
||||||
@@ -4517,8 +4522,11 @@ class basic_json // NOLINT(cppcoreguidelines-special-member-functions,hicpp-spec
|
|||||||
auto ia = i.get();
|
auto ia = i.get();
|
||||||
detail::json_sax_dom_parser<basic_json, decltype(ia)> sdp(result, allow_exceptions);
|
detail::json_sax_dom_parser<basic_json, decltype(ia)> sdp(result, allow_exceptions);
|
||||||
// NOLINTNEXTLINE(hicpp-move-const-arg,performance-move-const-arg)
|
// NOLINTNEXTLINE(hicpp-move-const-arg,performance-move-const-arg)
|
||||||
const bool res = binary_reader<decltype(ia)>(std::move(ia), input_format_t::cbor).sax_parse(input_format_t::cbor, &sdp, strict, tag_handler); // cppcheck-suppress[accessMoved]
|
if (!binary_reader<decltype(ia)>(std::move(ia), input_format_t::cbor).sax_parse(input_format_t::cbor, &sdp, strict, tag_handler)) // cppcheck-suppress[accessMoved]
|
||||||
return res ? result : basic_json(value_t::discarded);
|
{
|
||||||
|
result = value_t::discarded;
|
||||||
|
}
|
||||||
|
return result;
|
||||||
}
|
}
|
||||||
|
|
||||||
/// @brief create a JSON value from an input in MessagePack format
|
/// @brief create a JSON value from an input in MessagePack format
|
||||||
@@ -4532,8 +4540,11 @@ class basic_json // NOLINT(cppcoreguidelines-special-member-functions,hicpp-spec
|
|||||||
basic_json result;
|
basic_json result;
|
||||||
auto ia = detail::input_adapter(std::forward<InputType>(i));
|
auto ia = detail::input_adapter(std::forward<InputType>(i));
|
||||||
detail::json_sax_dom_parser<basic_json, decltype(ia)> sdp(result, allow_exceptions);
|
detail::json_sax_dom_parser<basic_json, decltype(ia)> sdp(result, allow_exceptions);
|
||||||
const bool res = binary_reader<decltype(ia)>(std::move(ia), input_format_t::msgpack).sax_parse(input_format_t::msgpack, &sdp, strict); // cppcheck-suppress[accessMoved]
|
if (!binary_reader<decltype(ia)>(std::move(ia), input_format_t::msgpack).sax_parse(input_format_t::msgpack, &sdp, strict)) // cppcheck-suppress[accessMoved]
|
||||||
return res ? result : basic_json(value_t::discarded);
|
{
|
||||||
|
result = value_t::discarded;
|
||||||
|
}
|
||||||
|
return result;
|
||||||
}
|
}
|
||||||
|
|
||||||
/// @brief create a JSON value from an input in MessagePack format (iterator pair, or iterator+sentinel pair for C++20 ranges support)
|
/// @brief create a JSON value from an input in MessagePack format (iterator pair, or iterator+sentinel pair for C++20 ranges support)
|
||||||
@@ -4548,8 +4559,11 @@ class basic_json // NOLINT(cppcoreguidelines-special-member-functions,hicpp-spec
|
|||||||
basic_json result;
|
basic_json result;
|
||||||
auto ia = detail::input_adapter(std::move(first), std::move(last));
|
auto ia = detail::input_adapter(std::move(first), std::move(last));
|
||||||
detail::json_sax_dom_parser<basic_json, decltype(ia)> sdp(result, allow_exceptions);
|
detail::json_sax_dom_parser<basic_json, decltype(ia)> sdp(result, allow_exceptions);
|
||||||
const bool res = binary_reader<decltype(ia)>(std::move(ia), input_format_t::msgpack).sax_parse(input_format_t::msgpack, &sdp, strict); // cppcheck-suppress[accessMoved]
|
if (!binary_reader<decltype(ia)>(std::move(ia), input_format_t::msgpack).sax_parse(input_format_t::msgpack, &sdp, strict)) // cppcheck-suppress[accessMoved]
|
||||||
return res ? result : basic_json(value_t::discarded);
|
{
|
||||||
|
result = value_t::discarded;
|
||||||
|
}
|
||||||
|
return result;
|
||||||
}
|
}
|
||||||
|
|
||||||
template<typename T>
|
template<typename T>
|
||||||
@@ -4572,8 +4586,11 @@ class basic_json // NOLINT(cppcoreguidelines-special-member-functions,hicpp-spec
|
|||||||
auto ia = i.get();
|
auto ia = i.get();
|
||||||
detail::json_sax_dom_parser<basic_json, decltype(ia)> sdp(result, allow_exceptions);
|
detail::json_sax_dom_parser<basic_json, decltype(ia)> sdp(result, allow_exceptions);
|
||||||
// NOLINTNEXTLINE(hicpp-move-const-arg,performance-move-const-arg)
|
// NOLINTNEXTLINE(hicpp-move-const-arg,performance-move-const-arg)
|
||||||
const bool res = binary_reader<decltype(ia)>(std::move(ia), input_format_t::msgpack).sax_parse(input_format_t::msgpack, &sdp, strict); // cppcheck-suppress[accessMoved]
|
if (!binary_reader<decltype(ia)>(std::move(ia), input_format_t::msgpack).sax_parse(input_format_t::msgpack, &sdp, strict)) // cppcheck-suppress[accessMoved]
|
||||||
return res ? result : basic_json(value_t::discarded);
|
{
|
||||||
|
result = value_t::discarded;
|
||||||
|
}
|
||||||
|
return result;
|
||||||
}
|
}
|
||||||
|
|
||||||
/// @brief create a JSON value from an input in UBJSON format
|
/// @brief create a JSON value from an input in UBJSON format
|
||||||
@@ -4587,8 +4604,11 @@ class basic_json // NOLINT(cppcoreguidelines-special-member-functions,hicpp-spec
|
|||||||
basic_json result;
|
basic_json result;
|
||||||
auto ia = detail::input_adapter(std::forward<InputType>(i));
|
auto ia = detail::input_adapter(std::forward<InputType>(i));
|
||||||
detail::json_sax_dom_parser<basic_json, decltype(ia)> sdp(result, allow_exceptions);
|
detail::json_sax_dom_parser<basic_json, decltype(ia)> sdp(result, allow_exceptions);
|
||||||
const bool res = binary_reader<decltype(ia)>(std::move(ia), input_format_t::ubjson).sax_parse(input_format_t::ubjson, &sdp, strict); // cppcheck-suppress[accessMoved]
|
if (!binary_reader<decltype(ia)>(std::move(ia), input_format_t::ubjson).sax_parse(input_format_t::ubjson, &sdp, strict)) // cppcheck-suppress[accessMoved]
|
||||||
return res ? result : basic_json(value_t::discarded);
|
{
|
||||||
|
result = value_t::discarded;
|
||||||
|
}
|
||||||
|
return result;
|
||||||
}
|
}
|
||||||
|
|
||||||
/// @brief create a JSON value from an input in UBJSON format (iterator pair, or iterator+sentinel pair for C++20 ranges support)
|
/// @brief create a JSON value from an input in UBJSON format (iterator pair, or iterator+sentinel pair for C++20 ranges support)
|
||||||
@@ -4603,8 +4623,11 @@ class basic_json // NOLINT(cppcoreguidelines-special-member-functions,hicpp-spec
|
|||||||
basic_json result;
|
basic_json result;
|
||||||
auto ia = detail::input_adapter(std::move(first), std::move(last));
|
auto ia = detail::input_adapter(std::move(first), std::move(last));
|
||||||
detail::json_sax_dom_parser<basic_json, decltype(ia)> sdp(result, allow_exceptions);
|
detail::json_sax_dom_parser<basic_json, decltype(ia)> sdp(result, allow_exceptions);
|
||||||
const bool res = binary_reader<decltype(ia)>(std::move(ia), input_format_t::ubjson).sax_parse(input_format_t::ubjson, &sdp, strict); // cppcheck-suppress[accessMoved]
|
if (!binary_reader<decltype(ia)>(std::move(ia), input_format_t::ubjson).sax_parse(input_format_t::ubjson, &sdp, strict)) // cppcheck-suppress[accessMoved]
|
||||||
return res ? result : basic_json(value_t::discarded);
|
{
|
||||||
|
result = value_t::discarded;
|
||||||
|
}
|
||||||
|
return result;
|
||||||
}
|
}
|
||||||
|
|
||||||
template<typename T>
|
template<typename T>
|
||||||
@@ -4627,8 +4650,11 @@ class basic_json // NOLINT(cppcoreguidelines-special-member-functions,hicpp-spec
|
|||||||
auto ia = i.get();
|
auto ia = i.get();
|
||||||
detail::json_sax_dom_parser<basic_json, decltype(ia)> sdp(result, allow_exceptions);
|
detail::json_sax_dom_parser<basic_json, decltype(ia)> sdp(result, allow_exceptions);
|
||||||
// NOLINTNEXTLINE(hicpp-move-const-arg,performance-move-const-arg)
|
// NOLINTNEXTLINE(hicpp-move-const-arg,performance-move-const-arg)
|
||||||
const bool res = binary_reader<decltype(ia)>(std::move(ia), input_format_t::ubjson).sax_parse(input_format_t::ubjson, &sdp, strict); // cppcheck-suppress[accessMoved]
|
if (!binary_reader<decltype(ia)>(std::move(ia), input_format_t::ubjson).sax_parse(input_format_t::ubjson, &sdp, strict)) // cppcheck-suppress[accessMoved]
|
||||||
return res ? result : basic_json(value_t::discarded);
|
{
|
||||||
|
result = value_t::discarded;
|
||||||
|
}
|
||||||
|
return result;
|
||||||
}
|
}
|
||||||
|
|
||||||
/// @brief create a JSON value from an input in BJData format
|
/// @brief create a JSON value from an input in BJData format
|
||||||
@@ -4642,8 +4668,11 @@ class basic_json // NOLINT(cppcoreguidelines-special-member-functions,hicpp-spec
|
|||||||
basic_json result;
|
basic_json result;
|
||||||
auto ia = detail::input_adapter(std::forward<InputType>(i));
|
auto ia = detail::input_adapter(std::forward<InputType>(i));
|
||||||
detail::json_sax_dom_parser<basic_json, decltype(ia)> sdp(result, allow_exceptions);
|
detail::json_sax_dom_parser<basic_json, decltype(ia)> sdp(result, allow_exceptions);
|
||||||
const bool res = binary_reader<decltype(ia)>(std::move(ia), input_format_t::bjdata).sax_parse(input_format_t::bjdata, &sdp, strict); // cppcheck-suppress[accessMoved]
|
if (!binary_reader<decltype(ia)>(std::move(ia), input_format_t::bjdata).sax_parse(input_format_t::bjdata, &sdp, strict)) // cppcheck-suppress[accessMoved]
|
||||||
return res ? result : basic_json(value_t::discarded);
|
{
|
||||||
|
result = value_t::discarded;
|
||||||
|
}
|
||||||
|
return result;
|
||||||
}
|
}
|
||||||
|
|
||||||
/// @brief create a JSON value from an input in BJData format (iterator pair, or iterator+sentinel pair for C++20 ranges support)
|
/// @brief create a JSON value from an input in BJData format (iterator pair, or iterator+sentinel pair for C++20 ranges support)
|
||||||
@@ -4658,8 +4687,11 @@ class basic_json // NOLINT(cppcoreguidelines-special-member-functions,hicpp-spec
|
|||||||
basic_json result;
|
basic_json result;
|
||||||
auto ia = detail::input_adapter(std::move(first), std::move(last));
|
auto ia = detail::input_adapter(std::move(first), std::move(last));
|
||||||
detail::json_sax_dom_parser<basic_json, decltype(ia)> sdp(result, allow_exceptions);
|
detail::json_sax_dom_parser<basic_json, decltype(ia)> sdp(result, allow_exceptions);
|
||||||
const bool res = binary_reader<decltype(ia)>(std::move(ia), input_format_t::bjdata).sax_parse(input_format_t::bjdata, &sdp, strict); // cppcheck-suppress[accessMoved]
|
if (!binary_reader<decltype(ia)>(std::move(ia), input_format_t::bjdata).sax_parse(input_format_t::bjdata, &sdp, strict)) // cppcheck-suppress[accessMoved]
|
||||||
return res ? result : basic_json(value_t::discarded);
|
{
|
||||||
|
result = value_t::discarded;
|
||||||
|
}
|
||||||
|
return result;
|
||||||
}
|
}
|
||||||
|
|
||||||
/// @brief create a JSON value from an input in BSON format
|
/// @brief create a JSON value from an input in BSON format
|
||||||
@@ -4673,8 +4705,11 @@ class basic_json // NOLINT(cppcoreguidelines-special-member-functions,hicpp-spec
|
|||||||
basic_json result;
|
basic_json result;
|
||||||
auto ia = detail::input_adapter(std::forward<InputType>(i));
|
auto ia = detail::input_adapter(std::forward<InputType>(i));
|
||||||
detail::json_sax_dom_parser<basic_json, decltype(ia)> sdp(result, allow_exceptions);
|
detail::json_sax_dom_parser<basic_json, decltype(ia)> sdp(result, allow_exceptions);
|
||||||
const bool res = binary_reader<decltype(ia)>(std::move(ia), input_format_t::bson).sax_parse(input_format_t::bson, &sdp, strict); // cppcheck-suppress[accessMoved]
|
if (!binary_reader<decltype(ia)>(std::move(ia), input_format_t::bson).sax_parse(input_format_t::bson, &sdp, strict)) // cppcheck-suppress[accessMoved]
|
||||||
return res ? result : basic_json(value_t::discarded);
|
{
|
||||||
|
result = value_t::discarded;
|
||||||
|
}
|
||||||
|
return result;
|
||||||
}
|
}
|
||||||
|
|
||||||
/// @brief create a JSON value from an input in BSON format (iterator pair, or iterator+sentinel pair for C++20 ranges support)
|
/// @brief create a JSON value from an input in BSON format (iterator pair, or iterator+sentinel pair for C++20 ranges support)
|
||||||
@@ -4689,8 +4724,11 @@ class basic_json // NOLINT(cppcoreguidelines-special-member-functions,hicpp-spec
|
|||||||
basic_json result;
|
basic_json result;
|
||||||
auto ia = detail::input_adapter(std::move(first), std::move(last));
|
auto ia = detail::input_adapter(std::move(first), std::move(last));
|
||||||
detail::json_sax_dom_parser<basic_json, decltype(ia)> sdp(result, allow_exceptions);
|
detail::json_sax_dom_parser<basic_json, decltype(ia)> sdp(result, allow_exceptions);
|
||||||
const bool res = binary_reader<decltype(ia)>(std::move(ia), input_format_t::bson).sax_parse(input_format_t::bson, &sdp, strict); // cppcheck-suppress[accessMoved]
|
if (!binary_reader<decltype(ia)>(std::move(ia), input_format_t::bson).sax_parse(input_format_t::bson, &sdp, strict)) // cppcheck-suppress[accessMoved]
|
||||||
return res ? result : basic_json(value_t::discarded);
|
{
|
||||||
|
result = value_t::discarded;
|
||||||
|
}
|
||||||
|
return result;
|
||||||
}
|
}
|
||||||
|
|
||||||
template<typename T>
|
template<typename T>
|
||||||
@@ -4713,8 +4751,11 @@ class basic_json // NOLINT(cppcoreguidelines-special-member-functions,hicpp-spec
|
|||||||
auto ia = i.get();
|
auto ia = i.get();
|
||||||
detail::json_sax_dom_parser<basic_json, decltype(ia)> sdp(result, allow_exceptions);
|
detail::json_sax_dom_parser<basic_json, decltype(ia)> sdp(result, allow_exceptions);
|
||||||
// NOLINTNEXTLINE(hicpp-move-const-arg,performance-move-const-arg)
|
// NOLINTNEXTLINE(hicpp-move-const-arg,performance-move-const-arg)
|
||||||
const bool res = binary_reader<decltype(ia)>(std::move(ia), input_format_t::bson).sax_parse(input_format_t::bson, &sdp, strict); // cppcheck-suppress[accessMoved]
|
if (!binary_reader<decltype(ia)>(std::move(ia), input_format_t::bson).sax_parse(input_format_t::bson, &sdp, strict)) // cppcheck-suppress[accessMoved]
|
||||||
return res ? result : basic_json(value_t::discarded);
|
{
|
||||||
|
result = value_t::discarded;
|
||||||
|
}
|
||||||
|
return result;
|
||||||
}
|
}
|
||||||
/// @}
|
/// @}
|
||||||
|
|
||||||
|
|||||||
+506
-345
File diff suppressed because it is too large
Load Diff
@@ -3288,8 +3288,10 @@ TEST_CASE("BJData")
|
|||||||
CHECK_THROWS_WITH_AS(_ = json::from_bjdata(vR1), "[json.exception.parse_error.113] parse error at byte 6: syntax error while parsing BJData size: ndarray dimensional vector is not allowed", json::parse_error&);
|
CHECK_THROWS_WITH_AS(_ = json::from_bjdata(vR1), "[json.exception.parse_error.113] parse error at byte 6: syntax error while parsing BJData size: ndarray dimensional vector is not allowed", json::parse_error&);
|
||||||
CHECK(json::from_bjdata(vR1, true, false).is_discarded());
|
CHECK(json::from_bjdata(vR1, true, false).is_discarded());
|
||||||
|
|
||||||
|
// a dimension vector that opens another one is rejected where the
|
||||||
|
// nested '[' is read, rather than after it has been descended into
|
||||||
std::vector<uint8_t> const vR2 = {'[', '$', 'i', '#', '[', '#', '[', 'i', 1, ']', ']', 1};
|
std::vector<uint8_t> const vR2 = {'[', '$', 'i', '#', '[', '#', '[', 'i', 1, ']', ']', 1};
|
||||||
CHECK_THROWS_WITH_AS(_ = json::from_bjdata(vR2), "[json.exception.parse_error.113] parse error at byte 11: syntax error while parsing BJData size: expected length type specification (U, i, u, I, m, l, M, L) after '#'; last byte: 0x5D", json::parse_error&);
|
CHECK_THROWS_WITH_AS(_ = json::from_bjdata(vR2), "[json.exception.parse_error.113] parse error at byte 7: syntax error while parsing BJData size: ndarray dimensional vector is not allowed", json::parse_error&);
|
||||||
CHECK(json::from_bjdata(vR2, true, false).is_discarded());
|
CHECK(json::from_bjdata(vR2, true, false).is_discarded());
|
||||||
|
|
||||||
std::vector<uint8_t> const vR3 = {'[', '#', '[', 'i', '2', 'i', 2, ']'};
|
std::vector<uint8_t> const vR3 = {'[', '#', '[', 'i', '2', 'i', 2, ']'};
|
||||||
@@ -3297,7 +3299,7 @@ TEST_CASE("BJData")
|
|||||||
CHECK(json::from_bjdata(vR3, true, false).is_discarded());
|
CHECK(json::from_bjdata(vR3, true, false).is_discarded());
|
||||||
|
|
||||||
std::vector<uint8_t> const vR4 = {'[', '$', 'i', '#', '[', '$', 'i', '#', '[', 'i', 1, ']', 1};
|
std::vector<uint8_t> const vR4 = {'[', '$', 'i', '#', '[', '$', 'i', '#', '[', 'i', 1, ']', 1};
|
||||||
CHECK_THROWS_WITH_AS(_ = json::from_bjdata(vR4), "[json.exception.parse_error.110] parse error at byte 14: syntax error while parsing BJData number: unexpected end of input", json::parse_error&);
|
CHECK_THROWS_WITH_AS(_ = json::from_bjdata(vR4), "[json.exception.parse_error.113] parse error at byte 9: syntax error while parsing BJData size: ndarray dimensional vector is not allowed", json::parse_error&);
|
||||||
CHECK(json::from_bjdata(vR4, true, false).is_discarded());
|
CHECK(json::from_bjdata(vR4, true, false).is_discarded());
|
||||||
|
|
||||||
std::vector<uint8_t> const vR5 = {'[', '$', 'i', '#', '[', '[', '[', ']', ']', ']'};
|
std::vector<uint8_t> const vR5 = {'[', '$', 'i', '#', '[', '[', '[', ']', ']', ']'};
|
||||||
@@ -3305,12 +3307,25 @@ TEST_CASE("BJData")
|
|||||||
CHECK(json::from_bjdata(vR5, true, false).is_discarded());
|
CHECK(json::from_bjdata(vR5, true, false).is_discarded());
|
||||||
|
|
||||||
std::vector<uint8_t> const vR6 = {'[', '$', 'i', '#', '[', '$', 'i', '#', '[', 'i', '2', 'i', 2, ']'};
|
std::vector<uint8_t> const vR6 = {'[', '$', 'i', '#', '[', '$', 'i', '#', '[', 'i', '2', 'i', 2, ']'};
|
||||||
CHECK_THROWS_WITH_AS(_ = json::from_bjdata(vR6), "[json.exception.parse_error.112] parse error at byte 14: syntax error while parsing BJData size: ndarray can not be recursive", json::parse_error&);
|
CHECK_THROWS_WITH_AS(_ = json::from_bjdata(vR6), "[json.exception.parse_error.113] parse error at byte 9: syntax error while parsing BJData size: ndarray dimensional vector is not allowed", json::parse_error&);
|
||||||
CHECK(json::from_bjdata(vR6, true, false).is_discarded());
|
CHECK(json::from_bjdata(vR6, true, false).is_discarded());
|
||||||
|
|
||||||
std::vector<uint8_t> const vH = {'[', 'H', '[', '#', '[', '$', 'i', '#', '[', 'i', '2', 'i', 2, ']'};
|
std::vector<uint8_t> const vH = {'[', 'H', '[', '#', '[', '$', 'i', '#', '[', 'i', '2', 'i', 2, ']'};
|
||||||
CHECK_THROWS_WITH_AS(_ = json::from_bjdata(vH), "[json.exception.parse_error.113] parse error at byte 3: syntax error while parsing BJData size: ndarray dimensional vector is not allowed", json::parse_error&);
|
CHECK_THROWS_WITH_AS(_ = json::from_bjdata(vH), "[json.exception.parse_error.113] parse error at byte 3: syntax error while parsing BJData size: ndarray dimensional vector is not allowed", json::parse_error&);
|
||||||
CHECK(json::from_bjdata(vH, true, false).is_discarded());
|
CHECK(json::from_bjdata(vH, true, false).is_discarded());
|
||||||
|
|
||||||
|
// Every "#[" of this chain used to open another dimension vector
|
||||||
|
// and cost several stack frames before anything was rejected, so a
|
||||||
|
// long enough chain crashed the process (see #5104). The nested
|
||||||
|
// vector is refused where it is read, so the length is irrelevant.
|
||||||
|
std::vector<uint8_t> vRdeep = {'['};
|
||||||
|
for (std::size_t i = 0; i < 100000; ++i)
|
||||||
|
{
|
||||||
|
vRdeep.push_back('#');
|
||||||
|
vRdeep.push_back('[');
|
||||||
|
}
|
||||||
|
CHECK_THROWS_WITH_AS(_ = json::from_bjdata(vRdeep), "[json.exception.parse_error.113] parse error at byte 5: syntax error while parsing BJData size: ndarray dimensional vector is not allowed", json::parse_error&);
|
||||||
|
CHECK(json::from_bjdata(vRdeep, true, false).is_discarded());
|
||||||
}
|
}
|
||||||
|
|
||||||
SECTION("objects")
|
SECTION("objects")
|
||||||
|
|||||||
@@ -2035,6 +2035,145 @@ TEST_CASE("CBOR definite length equal to the indefinite-length sentinel")
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
TEST_CASE("CBOR nesting does not consume the call stack")
|
||||||
|
{
|
||||||
|
// Containers used to be read by calling back into the value reader once
|
||||||
|
// per element, and a tag by calling it for the tagged value, so the native
|
||||||
|
// call stack grew with the nesting depth of the input. Each of the three
|
||||||
|
// costs a single byte to encode -- 0x9F, 0x81 and 0xC2 -- so a payload of
|
||||||
|
// repeated bytes crashed the process (#5104). The containers are kept on a
|
||||||
|
// heap stack now, and a tag is read in a loop.
|
||||||
|
//
|
||||||
|
// Deeply nested values must not be compared, copied or dumped here: those
|
||||||
|
// operations are still recursive and would reintroduce the crash.
|
||||||
|
json _;
|
||||||
|
|
||||||
|
SECTION("indefinite-length containers")
|
||||||
|
{
|
||||||
|
const std::vector<uint8_t> input(500000, 0x9F);
|
||||||
|
CHECK_THROWS_WITH_AS(_ = json::from_cbor(input), "[json.exception.parse_error.110] parse error at byte 500001: syntax error while parsing CBOR value: unexpected end of input", json::parse_error&);
|
||||||
|
CHECK(json::from_cbor(input, true, false).is_discarded());
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("definite-length containers")
|
||||||
|
{
|
||||||
|
const std::vector<uint8_t> input(500000, 0x81);
|
||||||
|
CHECK_THROWS_WITH_AS(_ = json::from_cbor(input), "[json.exception.parse_error.110] parse error at byte 500001: syntax error while parsing CBOR value: unexpected end of input", json::parse_error&);
|
||||||
|
CHECK(json::from_cbor(input, true, false).is_discarded());
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("tags")
|
||||||
|
{
|
||||||
|
// a tag is not a value of its own, so a chain of them used to recurse
|
||||||
|
const std::vector<uint8_t> input(500000, 0xC2);
|
||||||
|
CHECK_THROWS_WITH_AS(_ = json::from_cbor(input, true, true, json::cbor_tag_handler_t::ignore), "[json.exception.parse_error.110] parse error at byte 500001: syntax error while parsing CBOR value: unexpected end of input", json::parse_error&);
|
||||||
|
CHECK(json::from_cbor(input, true, false, json::cbor_tag_handler_t::ignore).is_discarded());
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("a well-formed deep value is read through the SAX interface")
|
||||||
|
{
|
||||||
|
std::vector<uint8_t> input(200000, 0x9F);
|
||||||
|
input.insert(input.end(), 200000, 0xFF);
|
||||||
|
|
||||||
|
SaxCountdown accept_all(1000000);
|
||||||
|
CHECK(json::sax_parse(input, &accept_all, json::input_format_t::cbor));
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("a well-formed deep value is read into a value")
|
||||||
|
{
|
||||||
|
const std::size_t depth = 10000;
|
||||||
|
std::vector<uint8_t> input(depth, 0x81);
|
||||||
|
input.push_back(0x00);
|
||||||
|
|
||||||
|
json j = json::from_cbor(input);
|
||||||
|
|
||||||
|
std::size_t measured = 0;
|
||||||
|
const json* p = &j;
|
||||||
|
while (p->is_array() && !p->empty())
|
||||||
|
{
|
||||||
|
p = &p->front();
|
||||||
|
++measured;
|
||||||
|
}
|
||||||
|
CHECK(measured == depth);
|
||||||
|
CHECK(p->is_number());
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("containers are still read the same way")
|
||||||
|
{
|
||||||
|
CHECK(json::from_cbor(std::vector<uint8_t>({0x80})) == json::array());
|
||||||
|
CHECK(json::from_cbor(std::vector<uint8_t>({0xA0})) == json::object());
|
||||||
|
CHECK(json::from_cbor(std::vector<uint8_t>({0x9F, 0xFF})) == json::array());
|
||||||
|
CHECK(json::from_cbor(std::vector<uint8_t>({0xBF, 0xFF})) == json::object());
|
||||||
|
CHECK(json::from_cbor(std::vector<uint8_t>({0x9F, 0x01, 0x02, 0xFF})) == json({1, 2}));
|
||||||
|
CHECK(json::from_cbor(std::vector<uint8_t>({0xBF, 0x61, 'a', 0x01, 0xFF})) == json({{"a", 1}}));
|
||||||
|
// definite and indefinite forms nested inside each other
|
||||||
|
CHECK(json::from_cbor(std::vector<uint8_t>({0x9F, 0x82, 0x01, 0x02, 0xA1, 0x61, 'k', 0xBF, 0xFF, 0xFF})) == json({{1, 2}, {{"k", json::object()}}}));
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("tagged values are still read the same way")
|
||||||
|
{
|
||||||
|
const auto ignore = json::cbor_tag_handler_t::ignore;
|
||||||
|
CHECK(json::from_cbor(std::vector<uint8_t>({0xC2, 0x01}), true, true, ignore) == json(1));
|
||||||
|
// a chain of tags resolves to the value that follows it
|
||||||
|
CHECK(json::from_cbor(std::vector<uint8_t>({0xC2, 0xC2, 0xC2, 0x01}), true, true, ignore) == json(1));
|
||||||
|
// a tag inside a container, and one in front of a container
|
||||||
|
CHECK(json::from_cbor(std::vector<uint8_t>({0x82, 0xC2, 0x01, 0x02}), true, true, ignore) == json({1, 2}));
|
||||||
|
CHECK(json::from_cbor(std::vector<uint8_t>({0xC2, 0x82, 0x01, 0x02}), true, true, ignore) == json({1, 2}));
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
TEST_CASE("CBOR indefinite-length strings do not recurse per chunk")
|
||||||
|
{
|
||||||
|
// Reading an indefinite-length string or byte array used to call itself
|
||||||
|
// once per chunk, so a payload of repeated 0x7F (or 0x5F) bytes exhausted
|
||||||
|
// the call stack before any of the input was rejected. The open levels are
|
||||||
|
// counted now, and the levels below prove the reader still reads the same
|
||||||
|
// values and reports the same errors at the same byte offsets.
|
||||||
|
json _;
|
||||||
|
|
||||||
|
SECTION("many open levels are reported, not crashed on")
|
||||||
|
{
|
||||||
|
const std::vector<uint8_t> input(200000, 0x7F);
|
||||||
|
CHECK_THROWS_WITH_AS(_ = json::from_cbor(input), "[json.exception.parse_error.110] parse error at byte 200001: syntax error while parsing CBOR string: unexpected end of input", json::parse_error&);
|
||||||
|
CHECK(json::from_cbor(input, true, false).is_discarded());
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("many open levels are reported, not crashed on (binary)")
|
||||||
|
{
|
||||||
|
const std::vector<uint8_t> input(200000, 0x5F);
|
||||||
|
CHECK_THROWS_WITH_AS(_ = json::from_cbor(input), "[json.exception.parse_error.110] parse error at byte 200001: syntax error while parsing CBOR binary: unexpected end of input", json::parse_error&);
|
||||||
|
CHECK(json::from_cbor(input, true, false).is_discarded());
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("chunks are still concatenated")
|
||||||
|
{
|
||||||
|
CHECK(json::from_cbor(std::vector<uint8_t>({0x7F, 0xFF})) == json(""));
|
||||||
|
CHECK(json::from_cbor(std::vector<uint8_t>({0x7F, 0x61, 0x61, 0xFF})) == json("a"));
|
||||||
|
// nested indefinite-length strings are concatenated across levels
|
||||||
|
CHECK(json::from_cbor(std::vector<uint8_t>({0x7F, 0x7F, 0x61, 0x61, 0xFF, 0x61, 0x62, 0xFF})) == json("ab"));
|
||||||
|
CHECK(json::from_cbor(std::vector<uint8_t>({0x7F, 0x7F, 0x7F, 0x61, 0x7A, 0xFF, 0xFF, 0xFF})) == json("z"));
|
||||||
|
CHECK(json::from_cbor(std::vector<uint8_t>({0xA1, 0x7F, 0x61, 0x61, 0xFF, 0x01})) == json({{"a", 1}}));
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("chunks are still concatenated (binary)")
|
||||||
|
{
|
||||||
|
CHECK(json::from_cbor(std::vector<uint8_t>({0x5F, 0x41, 0x61, 0xFF})) == json::binary({0x61}));
|
||||||
|
CHECK(json::from_cbor(std::vector<uint8_t>({0x5F, 0x5F, 0x41, 0x61, 0xFF, 0x41, 0x62, 0xFF})) == json::binary({0x61, 0x62}));
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("a chunk that is not a string is still rejected")
|
||||||
|
{
|
||||||
|
CHECK_THROWS_WITH_AS(_ = json::from_cbor(std::vector<uint8_t>({0x7F, 0x7F, 0x00})), "[json.exception.parse_error.113] parse error at byte 3: syntax error while parsing CBOR string: expected length specification (0x60-0x7B) or indefinite string type (0x7F); last byte: 0x00", json::parse_error&);
|
||||||
|
CHECK_THROWS_WITH_AS(_ = json::from_cbor(std::vector<uint8_t>({0x5F, 0x5F, 0x00})), "[json.exception.parse_error.113] parse error at byte 3: syntax error while parsing CBOR binary: expected length specification (0x40-0x5B) or indefinite binary array type (0x5F); last byte: 0x00", json::parse_error&);
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("a break marker outside an indefinite-length string is not a string")
|
||||||
|
{
|
||||||
|
// 0xFF only closes a string that was opened; on its own it is not one
|
||||||
|
CHECK_THROWS_WITH_AS(_ = json::from_cbor(std::vector<uint8_t>({0xA1, 0xFF, 0x01})), "[json.exception.parse_error.113] parse error at byte 2: syntax error while parsing CBOR string: expected length specification (0x60-0x7B) or indefinite string type (0x7F); last byte: 0xFF", json::parse_error&);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
TEST_CASE("CBOR roundtrips" * doctest::skip())
|
TEST_CASE("CBOR roundtrips" * doctest::skip())
|
||||||
{
|
{
|
||||||
SECTION("input from flynn")
|
SECTION("input from flynn")
|
||||||
|
|||||||
@@ -930,98 +930,6 @@ TEST_CASE("parser class")
|
|||||||
CHECK(accept_helper("+1") == false);
|
CHECK(accept_helper("+1") == false);
|
||||||
CHECK(accept_helper("+0") == false);
|
CHECK(accept_helper("+0") == false);
|
||||||
}
|
}
|
||||||
|
|
||||||
SECTION("issue #5411 - skip conversion when accept() does not need the numeric value")
|
|
||||||
{
|
|
||||||
// lexer::scan_number() may skip strtoull()/strtoll() for
|
|
||||||
// value_unsigned/value_integer tokens when the caller (e.g.
|
|
||||||
// json::accept()) does not need the converted value, as long
|
|
||||||
// as the digit count alone guarantees no 64-bit overflow (see
|
|
||||||
// the "safe_digit_count" fast path in scan_number()). This
|
|
||||||
// differential test checks that json::accept() (which enables
|
|
||||||
// the fast path) and json::parse() (which never does) always
|
|
||||||
// agree, over a corpus that exercises both the fast path
|
|
||||||
// (<=18 digits) and the untouched, exact fallback path (>=19
|
|
||||||
// digits) -- including reclassification of huge digit-only
|
|
||||||
// integers to a (possibly non-finite) floating-point value.
|
|
||||||
const std::vector<std::pair<std::string, bool>> cases =
|
|
||||||
{
|
|
||||||
// normal small/large integers, both signs
|
|
||||||
{"0", true}, {"1", true}, {"-1", true}, {"42", true}, {"-42", true},
|
|
||||||
{"123456789", true}, {"-123456789", true},
|
|
||||||
|
|
||||||
// digit-count boundary around the 18-digit safe cutoff (both signs)
|
|
||||||
{std::string(17, '9'), true},
|
|
||||||
{std::string(18, '9'), true},
|
|
||||||
{std::string(19, '9'), true},
|
|
||||||
{std::string(20, '9'), true},
|
|
||||||
{"-" + std::string(17, '9'), true},
|
|
||||||
{"-" + std::string(18, '9'), true},
|
|
||||||
{"-" + std::string(19, '9'), true},
|
|
||||||
{"-" + std::string(20, '9'), true},
|
|
||||||
|
|
||||||
// 64-bit boundaries
|
|
||||||
{"9223372036854775807", true}, // INT64_MAX
|
|
||||||
{"-9223372036854775808", true}, // INT64_MIN
|
|
||||||
{"18446744073709551615", true}, // UINT64_MAX
|
|
||||||
{"18446744073709551616", true}, // UINT64_MAX + 1 (overflows uint64_t, finite double)
|
|
||||||
|
|
||||||
// the 28-digit example from the issue: overflows uint64_t
|
|
||||||
// but is finite as a double, so the scanner reclassifies
|
|
||||||
// it to value_float and it is accepted
|
|
||||||
{"9999999999999999999999999999", true},
|
|
||||||
|
|
||||||
// huge digit-only integers that overflow even a double -> rejected
|
|
||||||
{std::string(309, '9'), false},
|
|
||||||
{std::string(400, '9'), false},
|
|
||||||
{"1" + std::string(400, '0'), false},
|
|
||||||
|
|
||||||
// 1e999 / 1e400 style overflow -> rejected
|
|
||||||
{"1e999", false},
|
|
||||||
{"1e400", false},
|
|
||||||
{"-1e999", false},
|
|
||||||
{"1E999", false},
|
|
||||||
|
|
||||||
// values straddling DBL_MAX
|
|
||||||
{"1.7976931348623157e308", true}, // <= DBL_MAX, finite
|
|
||||||
{"1.7976931348623159e308", false}, // > DBL_MAX, overflows to inf
|
|
||||||
|
|
||||||
// a mix of other valid/invalid numeric syntax
|
|
||||||
{"3.14159", true},
|
|
||||||
{"-0.0", true},
|
|
||||||
{"1.0e10", true},
|
|
||||||
{"01", false},
|
|
||||||
{"-", false},
|
|
||||||
{"1.", false},
|
|
||||||
{"1e", false},
|
|
||||||
{"+1", false},
|
|
||||||
};
|
|
||||||
|
|
||||||
for (const auto& c : cases)
|
|
||||||
{
|
|
||||||
const std::string& number = c.first;
|
|
||||||
const bool expected = c.second;
|
|
||||||
CAPTURE(number)
|
|
||||||
CAPTURE(expected)
|
|
||||||
|
|
||||||
// accept() takes the fast path (skips conversion when possible)
|
|
||||||
CHECK(json::accept(number) == expected);
|
|
||||||
|
|
||||||
// parse() always performs the full conversion; it must agree
|
|
||||||
json j;
|
|
||||||
CHECK_NOTHROW(json::parser(nlohmann::detail::input_adapter(number), nullptr, false).parse(true, j));
|
|
||||||
CHECK(!j.is_discarded() == expected);
|
|
||||||
|
|
||||||
// wrap in an array so get_token() is exercised beyond the
|
|
||||||
// very first (constructor-time) scan as well
|
|
||||||
std::string wrapped = "[";
|
|
||||||
wrapped += number;
|
|
||||||
wrapped += ",";
|
|
||||||
wrapped += number;
|
|
||||||
wrapped += "]";
|
|
||||||
CHECK(json::accept(wrapped) == expected);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -1486,69 +1394,6 @@ TEST_CASE("parser class")
|
|||||||
CHECK(accept_helper("\"\\uD80C\\uFFFF\"") == false);
|
CHECK(accept_helper("\"\\uD80C\\uFFFF\"") == false);
|
||||||
}
|
}
|
||||||
|
|
||||||
SECTION("issue #5412 - whitespace skipping bookkeeping (compact vs. pretty-printed)")
|
|
||||||
{
|
|
||||||
// lexer::skip_whitespace() reads its first character with get() (to
|
|
||||||
// honor a possibly pending unget() from the previous token) and every
|
|
||||||
// further whitespace character with get_ignoring_pending_unget() (a
|
|
||||||
// get() variant that skips the then-always-false next_unget check).
|
|
||||||
// This must not change the reported byte offset, line, or column of
|
|
||||||
// a syntax error, even when a long run of whitespace containing
|
|
||||||
// multiple newlines is skipped beforehand (as with pretty-printed
|
|
||||||
// input). The expected values below were captured from the
|
|
||||||
// unmodified do-while(get()) loop, so any regression that miscounts
|
|
||||||
// characters or newlines while skipping whitespace changes them.
|
|
||||||
const auto check_error = [](const std::string & input, std::size_t expected_byte,
|
|
||||||
const std::string & expected_what)
|
|
||||||
{
|
|
||||||
CAPTURE(input)
|
|
||||||
try
|
|
||||||
{
|
|
||||||
json _ = json::parse(input);
|
|
||||||
FAIL_CHECK("expected a parse_error, but parsing succeeded");
|
|
||||||
}
|
|
||||||
catch (const json::parse_error& e)
|
|
||||||
{
|
|
||||||
CHECK(e.byte == expected_byte);
|
|
||||||
CHECK(std::string(e.what()) == expected_what);
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
// a nested document, serialized both compactly and pretty-printed
|
|
||||||
// (dump(4)), each truncated right before the final closing '}' so
|
|
||||||
// that the parser hits EOF after skipping all of the (in the
|
|
||||||
// pretty-printed case, substantial) indentation whitespace
|
|
||||||
const json doc =
|
|
||||||
{
|
|
||||||
{"a", 1},
|
|
||||||
{"b", json::array({true, false, nullptr, "x"})},
|
|
||||||
{"c", json::object({{"d", 3.14}, {"e", json::array({1, 2, 3})}})}
|
|
||||||
};
|
|
||||||
|
|
||||||
const std::string compact = doc.dump();
|
|
||||||
const std::string pretty = doc.dump(4);
|
|
||||||
|
|
||||||
check_error(compact.substr(0, compact.size() - 1), 60,
|
|
||||||
"[json.exception.parse_error.101] parse error at line 1, column 60: syntax error while parsing object - unexpected end of input; expected '}'");
|
|
||||||
check_error(pretty.substr(0, pretty.size() - 1), 193,
|
|
||||||
"[json.exception.parse_error.101] parse error at line 17, column 1: syntax error while parsing object - unexpected end of input; expected '}'");
|
|
||||||
|
|
||||||
// an invalid token appearing after several indented, multi-line
|
|
||||||
// whitespace runs vs. the same document without any of that
|
|
||||||
// whitespace
|
|
||||||
check_error(R"({
|
|
||||||
"a": 1,
|
|
||||||
"b": [
|
|
||||||
true,
|
|
||||||
false
|
|
||||||
],
|
|
||||||
"c": @
|
|
||||||
})", 70,
|
|
||||||
"[json.exception.parse_error.101] parse error at line 7, column 10: syntax error while parsing value - invalid literal; last read: '\"c\": @'");
|
|
||||||
check_error("{\"a\":1,\"b\":[true,false],\"c\":@}", 29,
|
|
||||||
"[json.exception.parse_error.101] parse error at line 1, column 29: syntax error while parsing value - invalid literal; last read: '\"c\":@'");
|
|
||||||
}
|
|
||||||
|
|
||||||
SECTION("tests found by mutate++")
|
SECTION("tests found by mutate++")
|
||||||
{
|
{
|
||||||
// test case to make sure no comma precedes the first key
|
// test case to make sure no comma precedes the first key
|
||||||
|
|||||||
@@ -1598,6 +1598,67 @@ TEST_CASE("MessagePack")
|
|||||||
}
|
}
|
||||||
|
|
||||||
// use this testcase outside [hide] to run it with Valgrind
|
// use this testcase outside [hide] to run it with Valgrind
|
||||||
|
TEST_CASE("MessagePack nesting does not consume the call stack")
|
||||||
|
{
|
||||||
|
// Reading a container used to call back into the value reader once per
|
||||||
|
// element, so the native call stack grew with the nesting depth of the
|
||||||
|
// input: one frame per byte for repeated 0x91 (a one-element array), which
|
||||||
|
// crashes the process long before the input is exhausted (#5104). The
|
||||||
|
// containers are kept on a heap stack now.
|
||||||
|
//
|
||||||
|
// Note that deeply nested values must not be compared, copied or dumped
|
||||||
|
// here: those operations are still recursive, and would reintroduce the
|
||||||
|
// very crash this checks for. Depth is measured by descending instead.
|
||||||
|
|
||||||
|
SECTION("an unterminated chain is reported, not crashed on")
|
||||||
|
{
|
||||||
|
json _;
|
||||||
|
const std::vector<uint8_t> input(300000, 0x91);
|
||||||
|
CHECK_THROWS_WITH_AS(_ = json::from_msgpack(input), "[json.exception.parse_error.110] parse error at byte 300001: syntax error while parsing MessagePack value: unexpected end of input", json::parse_error&);
|
||||||
|
CHECK(json::from_msgpack(input, true, false).is_discarded());
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("a well-formed deep value is read through the SAX interface")
|
||||||
|
{
|
||||||
|
std::vector<uint8_t> input(300000, 0x91);
|
||||||
|
input.push_back(0x01); // innermost value
|
||||||
|
|
||||||
|
SaxCountdown accept_all(600001);
|
||||||
|
CHECK(json::sax_parse(input, &accept_all, json::input_format_t::msgpack));
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("a well-formed deep value is read into a value")
|
||||||
|
{
|
||||||
|
const std::size_t depth = 10000;
|
||||||
|
std::vector<uint8_t> input(depth, 0x91);
|
||||||
|
input.push_back(0x01);
|
||||||
|
|
||||||
|
json j = json::from_msgpack(input);
|
||||||
|
|
||||||
|
std::size_t measured = 0;
|
||||||
|
const json* p = &j;
|
||||||
|
while (p->is_array() && !p->empty())
|
||||||
|
{
|
||||||
|
p = &p->front();
|
||||||
|
++measured;
|
||||||
|
}
|
||||||
|
CHECK(measured == depth);
|
||||||
|
CHECK(p->is_number());
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("containers are still read the same way")
|
||||||
|
{
|
||||||
|
CHECK(json::from_msgpack(std::vector<uint8_t>({0x90})) == json::array());
|
||||||
|
CHECK(json::from_msgpack(std::vector<uint8_t>({0x80})) == json::object());
|
||||||
|
CHECK(json::from_msgpack(std::vector<uint8_t>({0x92, 0x90, 0x80})) == json({json::array(), json::object()}));
|
||||||
|
CHECK(json::from_msgpack(std::vector<uint8_t>({0x91, 0x91, 0x91, 0x90})) == json({{{json::array()}}}));
|
||||||
|
CHECK(json::from_msgpack(std::vector<uint8_t>({0x81, 0xA1, 'a', 0x81, 0xA1, 'b', 0x92, 0x01, 0x02})) == json({{"a", {{"b", {1, 2}}}}}));
|
||||||
|
// array 16 and map 32, i.e. the counted forms
|
||||||
|
CHECK(json::from_msgpack(std::vector<uint8_t>({0xDC, 0x00, 0x02, 0x01, 0x02})) == json({1, 2}));
|
||||||
|
CHECK(json::from_msgpack(std::vector<uint8_t>({0xDF, 0x00, 0x00, 0x00, 0x01, 0xA1, 'k', 0xC3})) == json({{"k", true}}));
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
TEST_CASE("single MessagePack roundtrip")
|
TEST_CASE("single MessagePack roundtrip")
|
||||||
{
|
{
|
||||||
SECTION("sample.json")
|
SECTION("sample.json")
|
||||||
|
|||||||
@@ -239,209 +239,6 @@ class my_allocator : public std::allocator<T>
|
|||||||
};
|
};
|
||||||
};
|
};
|
||||||
|
|
||||||
/////////////////////////////////////////////////////////////////////
|
|
||||||
// for #3077
|
|
||||||
/////////////////////////////////////////////////////////////////////
|
|
||||||
|
|
||||||
class FooAlloc
|
|
||||||
{};
|
|
||||||
|
|
||||||
class Foo
|
|
||||||
{
|
|
||||||
public:
|
|
||||||
explicit Foo(const FooAlloc& /* unused */ = FooAlloc()) {}
|
|
||||||
|
|
||||||
bool value = false;
|
|
||||||
};
|
|
||||||
|
|
||||||
class FooBar
|
|
||||||
{
|
|
||||||
public:
|
|
||||||
Foo foo{}; // NOLINT(readability-redundant-member-init)
|
|
||||||
};
|
|
||||||
|
|
||||||
inline void from_json(const nlohmann::json& j, FooBar& fb) // NOLINT(misc-use-internal-linkage)
|
|
||||||
{
|
|
||||||
j.at("value").get_to(fb.foo.value);
|
|
||||||
}
|
|
||||||
|
|
||||||
/////////////////////////////////////////////////////////////////////
|
|
||||||
// for #3171
|
|
||||||
/////////////////////////////////////////////////////////////////////
|
|
||||||
|
|
||||||
struct for_3171_base // NOLINT(cppcoreguidelines-special-member-functions)
|
|
||||||
{
|
|
||||||
for_3171_base(const std::string& /*unused*/ = {}) {}
|
|
||||||
virtual ~for_3171_base();
|
|
||||||
|
|
||||||
for_3171_base(const for_3171_base& other) // NOLINT(hicpp-use-equals-default,modernize-use-equals-default)
|
|
||||||
: str(other.str)
|
|
||||||
{}
|
|
||||||
|
|
||||||
for_3171_base& operator=(const for_3171_base& other)
|
|
||||||
{
|
|
||||||
if (this != &other)
|
|
||||||
{
|
|
||||||
str = other.str;
|
|
||||||
}
|
|
||||||
return *this;
|
|
||||||
}
|
|
||||||
|
|
||||||
for_3171_base(for_3171_base&& other) noexcept
|
|
||||||
: str(std::move(other.str))
|
|
||||||
{}
|
|
||||||
|
|
||||||
for_3171_base& operator=(for_3171_base&& other) noexcept
|
|
||||||
{
|
|
||||||
if (this != &other)
|
|
||||||
{
|
|
||||||
str = std::move(other.str);
|
|
||||||
}
|
|
||||||
return *this;
|
|
||||||
}
|
|
||||||
|
|
||||||
virtual void _from_json(const json& j)
|
|
||||||
{
|
|
||||||
j.at("str").get_to(str);
|
|
||||||
}
|
|
||||||
|
|
||||||
std::string str{}; // NOLINT(readability-redundant-member-init)
|
|
||||||
};
|
|
||||||
|
|
||||||
for_3171_base::~for_3171_base() = default;
|
|
||||||
|
|
||||||
struct for_3171_derived : public for_3171_base
|
|
||||||
{
|
|
||||||
for_3171_derived() = default;
|
|
||||||
~for_3171_derived() override;
|
|
||||||
explicit for_3171_derived(const std::string& /*unused*/) { }
|
|
||||||
|
|
||||||
for_3171_derived(const for_3171_derived& other) // NOLINT(hicpp-use-equals-default,modernize-use-equals-default)
|
|
||||||
: for_3171_base(other)
|
|
||||||
{}
|
|
||||||
|
|
||||||
for_3171_derived& operator=(const for_3171_derived& other)
|
|
||||||
{
|
|
||||||
if (this != &other)
|
|
||||||
{
|
|
||||||
for_3171_base::operator=(other); // Call base class assignment operator
|
|
||||||
}
|
|
||||||
return *this;
|
|
||||||
}
|
|
||||||
|
|
||||||
for_3171_derived(for_3171_derived&& other) noexcept
|
|
||||||
: for_3171_base(std::move(other))
|
|
||||||
{}
|
|
||||||
|
|
||||||
for_3171_derived& operator=(for_3171_derived&& other) noexcept
|
|
||||||
{
|
|
||||||
if (this != &other)
|
|
||||||
{
|
|
||||||
for_3171_base::operator=(std::move(other)); // Call base class move assignment operator
|
|
||||||
}
|
|
||||||
return *this;
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
for_3171_derived::~for_3171_derived() = default;
|
|
||||||
|
|
||||||
inline void from_json(const json& j, for_3171_base& tb) // NOLINT(misc-use-internal-linkage)
|
|
||||||
{
|
|
||||||
tb._from_json(j);
|
|
||||||
}
|
|
||||||
|
|
||||||
/////////////////////////////////////////////////////////////////////
|
|
||||||
// for #3312
|
|
||||||
/////////////////////////////////////////////////////////////////////
|
|
||||||
|
|
||||||
#ifdef JSON_HAS_CPP_20
|
|
||||||
struct for_3312
|
|
||||||
{
|
|
||||||
std::string name;
|
|
||||||
};
|
|
||||||
|
|
||||||
inline void from_json(const json& j, for_3312& obj) // NOLINT(misc-use-internal-linkage)
|
|
||||||
{
|
|
||||||
j.at("name").get_to(obj.name);
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
|
|
||||||
/////////////////////////////////////////////////////////////////////
|
|
||||||
// for #3204
|
|
||||||
/////////////////////////////////////////////////////////////////////
|
|
||||||
|
|
||||||
struct for_3204_foo
|
|
||||||
{
|
|
||||||
for_3204_foo() = default;
|
|
||||||
explicit for_3204_foo(std::string /*unused*/) {} // NOLINT(performance-unnecessary-value-param)
|
|
||||||
};
|
|
||||||
|
|
||||||
struct for_3204_bar
|
|
||||||
{
|
|
||||||
enum constructed_from_t // NOLINT(cppcoreguidelines-use-enum-class)
|
|
||||||
{
|
|
||||||
constructed_from_none = 0,
|
|
||||||
constructed_from_foo = 1,
|
|
||||||
constructed_from_json = 2
|
|
||||||
};
|
|
||||||
|
|
||||||
explicit for_3204_bar(std::function<void(for_3204_foo)> /*unused*/) noexcept // NOLINT(performance-unnecessary-value-param)
|
|
||||||
: constructed_from(constructed_from_foo) {}
|
|
||||||
explicit for_3204_bar(std::function<void(json)> /*unused*/) noexcept // NOLINT(performance-unnecessary-value-param)
|
|
||||||
: constructed_from(constructed_from_json) {}
|
|
||||||
|
|
||||||
constructed_from_t constructed_from = constructed_from_none;
|
|
||||||
};
|
|
||||||
|
|
||||||
/////////////////////////////////////////////////////////////////////
|
|
||||||
// for #3333
|
|
||||||
/////////////////////////////////////////////////////////////////////
|
|
||||||
|
|
||||||
struct for_3333 final
|
|
||||||
{
|
|
||||||
for_3333(int x_ = 0, int y_ = 0) : x(x_), y(y_) {}
|
|
||||||
|
|
||||||
template <class T>
|
|
||||||
for_3333(const T& /*unused*/)
|
|
||||||
{
|
|
||||||
CHECK(false);
|
|
||||||
}
|
|
||||||
|
|
||||||
int x = 0;
|
|
||||||
int y = 0;
|
|
||||||
};
|
|
||||||
|
|
||||||
template <>
|
|
||||||
inline for_3333::for_3333(const json& j)
|
|
||||||
: for_3333(j.value("x", 0), j.value("y", 0))
|
|
||||||
{}
|
|
||||||
|
|
||||||
/////////////////////////////////////////////////////////////////////
|
|
||||||
// for #3810
|
|
||||||
/////////////////////////////////////////////////////////////////////
|
|
||||||
|
|
||||||
struct Example_3810
|
|
||||||
{
|
|
||||||
int bla{};
|
|
||||||
|
|
||||||
Example_3810() = default;
|
|
||||||
};
|
|
||||||
|
|
||||||
NLOHMANN_DEFINE_TYPE_NON_INTRUSIVE(Example_3810, bla) // NOLINT(misc-use-internal-linkage)
|
|
||||||
|
|
||||||
/////////////////////////////////////////////////////////////////////
|
|
||||||
// for #4740
|
|
||||||
/////////////////////////////////////////////////////////////////////
|
|
||||||
|
|
||||||
#ifdef JSON_HAS_CPP_17
|
|
||||||
struct Example_4740
|
|
||||||
{
|
|
||||||
std::optional<std::string> host = std::nullopt;
|
|
||||||
std::optional<int> port = std::nullopt;
|
|
||||||
NLOHMANN_DEFINE_TYPE_INTRUSIVE_WITH_DEFAULT(Example_4740, host, port)
|
|
||||||
};
|
|
||||||
#endif
|
|
||||||
|
|
||||||
TEST_CASE("regression tests 2")
|
TEST_CASE("regression tests 2")
|
||||||
{
|
{
|
||||||
SECTION("issue #1001 - Fix memory leak during parser callback")
|
SECTION("issue #1001 - Fix memory leak during parser callback")
|
||||||
@@ -959,611 +756,6 @@ TEST_CASE("regression tests 2")
|
|||||||
CHECK(j == k);
|
CHECK(j == k);
|
||||||
}
|
}
|
||||||
|
|
||||||
#if JSON_HAS_FILESYSTEM || JSON_HAS_EXPERIMENTAL_FILESYSTEM
|
|
||||||
// JSON_HAS_CPP_17 (do not remove; see note at top of file)
|
|
||||||
SECTION("issue #3070 - Version 3.10.3 breaks backward-compatibility with 3.10.2 ")
|
|
||||||
{
|
|
||||||
nlohmann::detail::std_fs::path text_path("/tmp/text.txt");
|
|
||||||
const json j(text_path);
|
|
||||||
|
|
||||||
const auto j_path = j.get<nlohmann::detail::std_fs::path>();
|
|
||||||
CHECK(j_path == text_path);
|
|
||||||
|
|
||||||
#if DOCTEST_CLANG || DOCTEST_GCC >= DOCTEST_COMPILER(8, 4, 0)
|
|
||||||
// only known to work on Clang and GCC >=8.4
|
|
||||||
CHECK_THROWS_WITH_AS(nlohmann::detail::std_fs::path(json(1)), "[json.exception.type_error.302] type must be string, but is number", json::type_error);
|
|
||||||
#endif
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
|
|
||||||
SECTION("issue #3077 - explicit constructor with default does not compile")
|
|
||||||
{
|
|
||||||
json j;
|
|
||||||
j[0]["value"] = true;
|
|
||||||
std::vector<FooBar> foo;
|
|
||||||
j.get_to(foo);
|
|
||||||
}
|
|
||||||
|
|
||||||
SECTION("issue #3108 - ordered_json doesn't support range based erase")
|
|
||||||
{
|
|
||||||
ordered_json j = {1, 2, 2, 4};
|
|
||||||
|
|
||||||
auto last = std::unique(j.begin(), j.end());
|
|
||||||
j.erase(last, j.end());
|
|
||||||
|
|
||||||
CHECK(j.dump() == "[1,2,4]");
|
|
||||||
|
|
||||||
j.erase(std::remove_if(j.begin(), j.end(), [](const ordered_json & val)
|
|
||||||
{
|
|
||||||
return val == 2;
|
|
||||||
}), j.end());
|
|
||||||
|
|
||||||
CHECK(j.dump() == "[1,4]");
|
|
||||||
}
|
|
||||||
|
|
||||||
SECTION("issue #3343 - json and ordered_json are not interchangeable")
|
|
||||||
{
|
|
||||||
json::object_t jobj({ { "product", "one" } });
|
|
||||||
ordered_json::object_t ojobj({{"product", "one"}});
|
|
||||||
|
|
||||||
auto jit = jobj.begin();
|
|
||||||
auto ojit = ojobj.begin();
|
|
||||||
|
|
||||||
CHECK(jit->first == ojit->first);
|
|
||||||
CHECK(jit->second.get<std::string>() == ojit->second.get<std::string>());
|
|
||||||
}
|
|
||||||
|
|
||||||
SECTION("issue #3171 - if class is_constructible from std::string wrong from_json overload is being selected, compilation failed")
|
|
||||||
{
|
|
||||||
const json j{{ "str", "value"}};
|
|
||||||
|
|
||||||
// failed with: error: no match for ‘operator=’ (operand types are ‘for_3171_derived’ and ‘const nlohmann::basic_json<>::string_t’
|
|
||||||
// {aka ‘const std::__cxx11::basic_string<char>’})
|
|
||||||
// s = *j.template get_ptr<const typename BasicJsonType::string_t*>();
|
|
||||||
auto td = j.get<for_3171_derived>();
|
|
||||||
|
|
||||||
CHECK(td.str == "value");
|
|
||||||
}
|
|
||||||
|
|
||||||
#ifdef JSON_HAS_CPP_20
|
|
||||||
SECTION("issue #3312 - Parse to custom class from unordered_json breaks on G++11.2.0 with C++20")
|
|
||||||
{
|
|
||||||
// see test for #3171
|
|
||||||
const ordered_json j = {{"name", "class"}};
|
|
||||||
for_3312 obj{};
|
|
||||||
|
|
||||||
j.get_to(obj);
|
|
||||||
|
|
||||||
CHECK(obj.name == "class");
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#if defined(JSON_HAS_CPP_17) && JSON_USE_IMPLICIT_CONVERSIONS
|
|
||||||
SECTION("issue #3428 - Error occurred when converting nlohmann::json to std::any")
|
|
||||||
{
|
|
||||||
const json j;
|
|
||||||
const std::any a1 = j;
|
|
||||||
std::any&& a2 = j;
|
|
||||||
|
|
||||||
CHECK(a1.type() == typeid(j));
|
|
||||||
CHECK(a2.type() == typeid(j));
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
|
|
||||||
SECTION("issue #3204 - ambiguous regression")
|
|
||||||
{
|
|
||||||
const for_3204_bar bar_from_foo([](for_3204_foo) noexcept {}); // NOLINT(performance-unnecessary-value-param)
|
|
||||||
const for_3204_bar bar_from_json([](json) noexcept {}); // NOLINT(performance-unnecessary-value-param)
|
|
||||||
|
|
||||||
CHECK(bar_from_foo.constructed_from == for_3204_bar::constructed_from_foo);
|
|
||||||
CHECK(bar_from_json.constructed_from == for_3204_bar::constructed_from_json);
|
|
||||||
}
|
|
||||||
|
|
||||||
SECTION("issue #3333 - Ambiguous conversion from nlohmann::basic_json<> to custom class")
|
|
||||||
{
|
|
||||||
const json j
|
|
||||||
{
|
|
||||||
{"x", 1},
|
|
||||||
{"y", 2}
|
|
||||||
};
|
|
||||||
const for_3333 p = j;
|
|
||||||
|
|
||||||
CHECK(p.x == 1);
|
|
||||||
CHECK(p.y == 2);
|
|
||||||
}
|
|
||||||
|
|
||||||
SECTION("issue #3810 - ordered_json doesn't support construction from C array of custom type")
|
|
||||||
{
|
|
||||||
Example_3810 states[45]; // NOLINT(cppcoreguidelines-avoid-c-arrays,hicpp-avoid-c-arrays,modernize-avoid-c-arrays)
|
|
||||||
|
|
||||||
// fix "not used" warning
|
|
||||||
states[0].bla = 1;
|
|
||||||
|
|
||||||
const auto* const expected = R"([{"bla":1},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0}])";
|
|
||||||
|
|
||||||
// This works:
|
|
||||||
nlohmann::json j;
|
|
||||||
j["test"] = states;
|
|
||||||
CHECK(j["test"].dump() == expected);
|
|
||||||
|
|
||||||
// This doesn't compile:
|
|
||||||
nlohmann::ordered_json oj;
|
|
||||||
oj["test"] = states;
|
|
||||||
CHECK(oj["test"].dump() == expected);
|
|
||||||
}
|
|
||||||
|
|
||||||
#ifdef JSON_HAS_CPP_17
|
|
||||||
SECTION("issue #4740 - build issue with std::optional")
|
|
||||||
{
|
|
||||||
const auto t1 = Example_4740();
|
|
||||||
const auto j1 = nlohmann::json(t1);
|
|
||||||
CHECK(j1.dump() == "{\"host\":null,\"port\":null}");
|
|
||||||
const auto t2 = j1.get<Example_4740>();
|
|
||||||
CHECK(!t2.host.has_value());
|
|
||||||
CHECK(!t2.port.has_value());
|
|
||||||
|
|
||||||
// improve coverage
|
|
||||||
auto t3 = Example_4740();
|
|
||||||
t3.port = 80;
|
|
||||||
t3.host = "example.com";
|
|
||||||
const auto j2 = nlohmann::json(t3);
|
|
||||||
CHECK(j2.dump() == "{\"host\":\"example.com\",\"port\":80}");
|
|
||||||
const auto t4 = j2.get<Example_4740>();
|
|
||||||
CHECK(t4.host.has_value());
|
|
||||||
CHECK(t4.port.has_value());
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#if !defined(_MSVC_LANG)
|
|
||||||
// MSVC returns garbage on invalid enum values, so this test is excluded
|
|
||||||
// there.
|
|
||||||
SECTION("issue #4762 - json exception 302 with unhelpful explanation : type must be number, but is number")
|
|
||||||
{
|
|
||||||
// In #4762, the main issue was that a json object with an invalid type
|
|
||||||
// returned "number" as type_name(), because this was the default case.
|
|
||||||
// This test makes sure we now return "invalid" instead.
|
|
||||||
json j;
|
|
||||||
j.m_data.m_type = static_cast<json::value_t>(100); // NOLINT(clang-analyzer-optin.core.EnumCastOutOfRange)
|
|
||||||
CHECK(j.type_name() == "invalid");
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#ifdef JSON_HAS_CPP_17
|
|
||||||
SECTION("issue #4804: from_cbor incompatible with std::vector<std::byte> as binary_t")
|
|
||||||
{
|
|
||||||
const std::vector<std::uint8_t> data = {0x80};
|
|
||||||
const auto decoded = json_4804::from_cbor(data);
|
|
||||||
CHECK((decoded == json_4804::array()));
|
|
||||||
}
|
|
||||||
|
|
||||||
SECTION("discussion #4209 - custom BinaryType direct assignment and round-tripping")
|
|
||||||
{
|
|
||||||
// Test that assigning a custom BinaryType directly creates a binary value, not an array
|
|
||||||
const std::vector<std::byte> original{std::byte{1}, std::byte{2}, std::byte{3}};
|
|
||||||
const json_4804 j = original;
|
|
||||||
CHECK(j.is_binary());
|
|
||||||
CHECK(!j.is_array());
|
|
||||||
|
|
||||||
// Test round-tripping: extracting the binary value back as the custom container type
|
|
||||||
const auto extracted = j.get<std::vector<std::byte>>();
|
|
||||||
CHECK(extracted == original);
|
|
||||||
|
|
||||||
// Test that the default json alias behavior is unchanged: std::vector<uint8_t> -> array
|
|
||||||
const json default_json = std::vector<std::uint8_t> {1, 2, 3};
|
|
||||||
CHECK(default_json.is_array());
|
|
||||||
CHECK(!default_json.is_binary());
|
|
||||||
}
|
|
||||||
|
|
||||||
SECTION("discussion #4209 - custom BinaryType extraction from parsed array")
|
|
||||||
{
|
|
||||||
// Test that extracting a custom BinaryType from a parsed JSON array still works
|
|
||||||
// (not just from a binary-typed node)
|
|
||||||
const auto j = json_4804::parse("[1,2,3]");
|
|
||||||
CHECK(j.is_array());
|
|
||||||
CHECK(!j.is_binary());
|
|
||||||
|
|
||||||
// Extracting as custom BinaryType should work from arrays
|
|
||||||
const auto extracted = j.get<std::vector<std::byte>>();
|
|
||||||
CHECK(extracted.size() == 3);
|
|
||||||
CHECK(extracted[0] == std::byte{1});
|
|
||||||
CHECK(extracted[1] == std::byte{2});
|
|
||||||
CHECK(extracted[2] == std::byte{3});
|
|
||||||
}
|
|
||||||
|
|
||||||
SECTION("issue #5046 - implicit conversion of return json to std::optional no longer implicit")
|
|
||||||
{
|
|
||||||
const json jval{};
|
|
||||||
auto GetValue = [](const json & valRoot) -> std::optional<json>
|
|
||||||
{
|
|
||||||
if (valRoot.contains("default"))
|
|
||||||
{
|
|
||||||
return valRoot.at("default");
|
|
||||||
}
|
|
||||||
return std::nullopt;
|
|
||||||
};
|
|
||||||
auto result = GetValue(jval);
|
|
||||||
CHECK(!result.has_value());
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#if JSON_HAS_RANGES == 1
|
|
||||||
SECTION("issue #4440 - assert when using std::views::filter and GCC 10")
|
|
||||||
{
|
|
||||||
auto noOpFilter = std::views::filter([](auto&&) noexcept
|
|
||||||
{
|
|
||||||
return true;
|
|
||||||
});
|
|
||||||
json j = {1, 2, 3};
|
|
||||||
auto filtered = j | noOpFilter;
|
|
||||||
CHECK(*filtered.begin() == 1);
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#if JSON_HAS_RANGES && !defined(__MINGW32__)
|
|
||||||
SECTION("issue #4916 - constructing array from C++20 ranges view does not work")
|
|
||||||
{
|
|
||||||
std::vector<int> nums{1, 2, 37, 42, 21};
|
|
||||||
auto filteredNums = nums | std::views::filter([](int i)
|
|
||||||
{
|
|
||||||
return i > 10;
|
|
||||||
});
|
|
||||||
json const j(filteredNums);
|
|
||||||
CHECK(j.type() == json::value_t::array);
|
|
||||||
CHECK(j == json({37, 42, 21}));
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
|
|
||||||
// owning_view is not available in libstdc++ < 12
|
|
||||||
#if JSON_HAS_RANGES && !defined(__MINGW32__) && !(defined(__GLIBCXX__) && _GLIBCXX_RELEASE < 12)
|
|
||||||
SECTION("issue #4916 - constructing array from prvalue C++20 ranges view (owning_view)")
|
|
||||||
{
|
|
||||||
json const j(std::vector<int> {1, 2, 37, 42, 21} | std::views::filter([](int i)
|
|
||||||
{
|
|
||||||
return i > 10;
|
|
||||||
}));
|
|
||||||
CHECK(j.type() == json::value_t::array);
|
|
||||||
CHECK(j == json({37, 42, 21}));
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#if JSON_HAS_RANGES && !defined(__MINGW32__)
|
|
||||||
SECTION("issue #4916 - constructing array from C++20 transform view (prvalue elements)")
|
|
||||||
{
|
|
||||||
std::vector<int> nums{1, 2, 3};
|
|
||||||
auto t = nums | std::views::transform([](int i) noexcept
|
|
||||||
{
|
|
||||||
return i * 2;
|
|
||||||
});
|
|
||||||
json const j(t);
|
|
||||||
CHECK(j.type() == json::value_t::array);
|
|
||||||
CHECK(j == json({2, 4, 6}));
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
}
|
|
||||||
|
|
||||||
TEST_CASE_TEMPLATE("issue #4798 - nlohmann::json::to_msgpack() encode float NaN as double", T, double, float) // NOLINT(readability-math-missing-parentheses, bugprone-throwing-static-initialization)
|
|
||||||
{
|
|
||||||
// With issue #4798, we encode NaN, infinity, and -infinity as float instead
|
|
||||||
// of double to allow for smaller encodings.
|
|
||||||
const json jx = std::numeric_limits<T>::quiet_NaN();
|
|
||||||
const json jy = std::numeric_limits<T>::infinity();
|
|
||||||
const json jz = -std::numeric_limits<T>::infinity();
|
|
||||||
|
|
||||||
/////////////////////////////////////////////////////////////////////////
|
|
||||||
// MessagePack
|
|
||||||
/////////////////////////////////////////////////////////////////////////
|
|
||||||
|
|
||||||
// expected MessagePack values
|
|
||||||
const std::vector<std::uint8_t> msgpack_x = {{0xCA, 0x7F, 0xC0, 0x00, 0x00}};
|
|
||||||
const std::vector<std::uint8_t> msgpack_y = {{0xCA, 0x7F, 0x80, 0x00, 0x00}};
|
|
||||||
const std::vector<std::uint8_t> msgpack_z = {{0xCA, 0xFF, 0x80, 0x00, 0x00}};
|
|
||||||
|
|
||||||
CHECK(json::to_msgpack(jx) == msgpack_x);
|
|
||||||
CHECK(json::to_msgpack(jy) == msgpack_y);
|
|
||||||
CHECK(json::to_msgpack(jz) == msgpack_z);
|
|
||||||
|
|
||||||
CHECK(std::isnan(json::from_msgpack(msgpack_x).get<T>()));
|
|
||||||
CHECK(json::from_msgpack(msgpack_y).get<T>() == std::numeric_limits<T>::infinity());
|
|
||||||
CHECK(json::from_msgpack(msgpack_z).get<T>() == -std::numeric_limits<T>::infinity());
|
|
||||||
|
|
||||||
// Make sure the other MessagePakc encodings for NaN, infinity, and
|
|
||||||
// -infinity are still supported.
|
|
||||||
const std::vector<std::uint8_t> msgpack_x_2 = {{0xCB, 0x7F, 0xF8, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00}};
|
|
||||||
const std::vector<std::uint8_t> msgpack_y_2 = {{0xCB, 0x7F, 0xF0, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00}};
|
|
||||||
const std::vector<std::uint8_t> msgpack_z_2 = {{0xCB, 0xFF, 0xF0, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00}};
|
|
||||||
CHECK(std::isnan(json::from_msgpack(msgpack_x_2).get<T>()));
|
|
||||||
CHECK(json::from_msgpack(msgpack_y_2).get<T>() == std::numeric_limits<T>::infinity());
|
|
||||||
CHECK(json::from_msgpack(msgpack_z_2).get<T>() == -std::numeric_limits<T>::infinity());
|
|
||||||
|
|
||||||
/////////////////////////////////////////////////////////////////////////
|
|
||||||
// CBOR
|
|
||||||
/////////////////////////////////////////////////////////////////////////
|
|
||||||
|
|
||||||
// expected CBOR values
|
|
||||||
const std::vector<std::uint8_t> cbor_x = {{0xF9, 0x7E, 0x00}};
|
|
||||||
const std::vector<std::uint8_t> cbor_y = {{0xF9, 0x7C, 0x00}};
|
|
||||||
const std::vector<std::uint8_t> cbor_z = {{0xF9, 0xfC, 0x00}};
|
|
||||||
|
|
||||||
CHECK(json::to_cbor(jx) == cbor_x);
|
|
||||||
CHECK(json::to_cbor(jy) == cbor_y);
|
|
||||||
CHECK(json::to_cbor(jz) == cbor_z);
|
|
||||||
|
|
||||||
CHECK(std::isnan(json::from_cbor(cbor_x).get<T>()));
|
|
||||||
CHECK(json::from_cbor(cbor_y).get<T>() == std::numeric_limits<T>::infinity());
|
|
||||||
CHECK(json::from_cbor(cbor_z).get<T>() == -std::numeric_limits<T>::infinity());
|
|
||||||
|
|
||||||
// Make sure the other CBOR encodings for NaN, infinity, and -infinity are
|
|
||||||
// still supported.
|
|
||||||
const std::vector<std::uint8_t> cbor_x_2 = {{0xFA, 0x7F, 0xC0, 0x00, 0x00}};
|
|
||||||
const std::vector<std::uint8_t> cbor_y_2 = {{0xFA, 0x7F, 0x80, 0x00, 0x00}};
|
|
||||||
const std::vector<std::uint8_t> cbor_z_2 = {{0xFA, 0xFF, 0x80, 0x00, 0x00}};
|
|
||||||
const std::vector<std::uint8_t> cbor_x_3 = {{0xFB, 0x7F, 0xF8, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00}};
|
|
||||||
const std::vector<std::uint8_t> cbor_y_3 = {{0xFB, 0x7F, 0xF0, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00}};
|
|
||||||
const std::vector<std::uint8_t> cbor_z_3 = {{0xFB, 0xFF, 0xF0, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00}};
|
|
||||||
CHECK(std::isnan(json::from_cbor(cbor_x_2).get<T>()));
|
|
||||||
CHECK(json::from_cbor(cbor_y_2).get<T>() == std::numeric_limits<T>::infinity());
|
|
||||||
CHECK(json::from_cbor(cbor_z_2).get<T>() == -std::numeric_limits<T>::infinity());
|
|
||||||
CHECK(std::isnan(json::from_cbor(cbor_x_3).get<T>()));
|
|
||||||
CHECK(json::from_cbor(cbor_y_3).get<T>() == std::numeric_limits<T>::infinity());
|
|
||||||
CHECK(json::from_cbor(cbor_z_3).get<T>() == -std::numeric_limits<T>::infinity());
|
|
||||||
}
|
|
||||||
|
|
||||||
TEST_CASE("regression test #5074 - portable workaround for single-element brace init")
|
|
||||||
{
|
|
||||||
json const j_obj = {{"key", "value"}};
|
|
||||||
|
|
||||||
json const j = json::array({j_obj});
|
|
||||||
CHECK(j.is_array());
|
|
||||||
CHECK(j.size() == 1);
|
|
||||||
CHECK(j[0] == j_obj);
|
|
||||||
}
|
|
||||||
|
|
||||||
#if defined(JSON_BRACE_INIT_COPY_SEMANTICS) && (JSON_BRACE_INIT_COPY_SEMANTICS == 1)
|
|
||||||
TEST_CASE("regression test #5074 - single-element brace init with JSON_BRACE_INIT_COPY_SEMANTICS")
|
|
||||||
{
|
|
||||||
// with JSON_BRACE_INIT_COPY_SEMANTICS: single-element brace init copies/moves
|
|
||||||
json const j_obj = {{"key", "value"}, {"num", 42}};
|
|
||||||
json const j_arr = {1, 2, 3};
|
|
||||||
|
|
||||||
// object: brace init copies instead of wrapping
|
|
||||||
json const j1{j_obj};
|
|
||||||
CHECK(j1.is_object());
|
|
||||||
CHECK(j1 == j_obj);
|
|
||||||
|
|
||||||
// array: brace init copies instead of wrapping
|
|
||||||
json const j2{j_arr};
|
|
||||||
CHECK(j2.is_array());
|
|
||||||
CHECK(j2.size() == 3);
|
|
||||||
CHECK(j2 == j_arr);
|
|
||||||
|
|
||||||
// primitives still work as initializer lists
|
|
||||||
json const j3{true};
|
|
||||||
CHECK(j3.is_boolean());
|
|
||||||
|
|
||||||
json const j4{42};
|
|
||||||
CHECK(j4.is_number_integer());
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
|
|
||||||
struct Example_5122
|
|
||||||
{
|
|
||||||
float b = 2;
|
|
||||||
nlohmann::ordered_map<std::string, std::string> c{}; // NOLINT(readability-redundant-member-init): needed for GCC -Weffc++
|
|
||||||
int a = 1;
|
|
||||||
NLOHMANN_DEFINE_TYPE_INTRUSIVE_WITH_DEFAULT(Example_5122, b, c, a)
|
|
||||||
};
|
|
||||||
|
|
||||||
TEST_CASE("regression test #5122 - from_json into types holding nlohmann::ordered_map")
|
|
||||||
{
|
|
||||||
Example_5122 src;
|
|
||||||
src.c.emplace("first", "1");
|
|
||||||
src.c.emplace("second", "2");
|
|
||||||
|
|
||||||
ordered_json const j = src;
|
|
||||||
Example_5122 const dst = j.get<Example_5122>();
|
|
||||||
|
|
||||||
CHECK(dst.b == src.b);
|
|
||||||
CHECK(dst.a == src.a);
|
|
||||||
REQUIRE(dst.c.size() == src.c.size());
|
|
||||||
auto src_it = src.c.begin();
|
|
||||||
auto dst_it = dst.c.begin();
|
|
||||||
for (; src_it != src.c.end(); ++src_it, ++dst_it)
|
|
||||||
{
|
|
||||||
CHECK(dst_it->first == src_it->first);
|
|
||||||
CHECK(dst_it->second == src_it->second);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// -Wself-assign-overloaded was introduced in Clang 7. Gate the pragma on
|
|
||||||
// __has_warning so older Clang versions do not error with "unknown warning
|
|
||||||
// group". The __has_warning check has to stay inside the __clang__ branch
|
|
||||||
// because GCC does not provide it and would tokenize-error on the argument.
|
|
||||||
#if defined(__clang__) && defined(__has_warning)
|
|
||||||
#if __has_warning("-Wself-assign-overloaded")
|
|
||||||
DOCTEST_CLANG_SUPPRESS_WARNING_PUSH
|
|
||||||
DOCTEST_CLANG_SUPPRESS_WARNING("-Wself-assign-overloaded")
|
|
||||||
#endif
|
|
||||||
#endif
|
|
||||||
|
|
||||||
TEST_CASE("regression test #5122 - nlohmann::ordered_map copy-assignment is self-assignment safe")
|
|
||||||
{
|
|
||||||
nlohmann::ordered_map<std::string, std::string> m;
|
|
||||||
m.emplace("first", "1");
|
|
||||||
m.emplace("second", "2");
|
|
||||||
|
|
||||||
// Insertion order is preserved by ordered_map, so we can check it directly.
|
|
||||||
m = m;
|
|
||||||
|
|
||||||
REQUIRE(m.size() == 2);
|
|
||||||
auto it = m.begin();
|
|
||||||
CHECK(it->first == "first");
|
|
||||||
CHECK(it->second == "1");
|
|
||||||
++it;
|
|
||||||
CHECK(it->first == "second");
|
|
||||||
CHECK(it->second == "2");
|
|
||||||
}
|
|
||||||
|
|
||||||
#if defined(__clang__) && defined(__has_warning)
|
|
||||||
#if __has_warning("-Wself-assign-overloaded")
|
|
||||||
DOCTEST_CLANG_SUPPRESS_WARNING_POP
|
|
||||||
#endif
|
|
||||||
#endif
|
|
||||||
|
|
||||||
TEST_CASE("regression test #5122 - nlohmann::ordered_map move-assignment transfers contents")
|
|
||||||
{
|
|
||||||
nlohmann::ordered_map<std::string, std::string> src;
|
|
||||||
src.emplace("first", "1");
|
|
||||||
src.emplace("second", "2");
|
|
||||||
|
|
||||||
nlohmann::ordered_map<std::string, std::string> dst;
|
|
||||||
dst.emplace("stale", "x");
|
|
||||||
dst = std::move(src);
|
|
||||||
|
|
||||||
REQUIRE(dst.size() == 2);
|
|
||||||
auto it = dst.begin();
|
|
||||||
CHECK(it->first == "first");
|
|
||||||
CHECK(it->second == "1");
|
|
||||||
++it;
|
|
||||||
CHECK(it->first == "second");
|
|
||||||
CHECK(it->second == "2");
|
|
||||||
|
|
||||||
// Re-assigning into the moved-from object must leave it in a usable state.
|
|
||||||
src = nlohmann::ordered_map<std::string, std::string> {};
|
|
||||||
src.emplace("after-move", "3");
|
|
||||||
REQUIRE(src.size() == 1);
|
|
||||||
CHECK(src.begin()->first == "after-move");
|
|
||||||
}
|
|
||||||
|
|
||||||
// Stand-in for a third-party library (e.g., Eigen as of 3.4, which added
|
|
||||||
// STL-compatible begin()/end() to its vector types), living in its own
|
|
||||||
// namespace with its own to_json overload for its vector type.
|
|
||||||
namespace issue_4320_eigen
|
|
||||||
{
|
|
||||||
// "array-compatible" from the library's point of view (it has begin()/end()),
|
|
||||||
// but for which this (fake) third-party namespace provides its own to_json.
|
|
||||||
struct vector3
|
|
||||||
{
|
|
||||||
double v[3]; // NOLINT(cppcoreguidelines-avoid-c-arrays,hicpp-avoid-c-arrays,modernize-avoid-c-arrays,cppcoreguidelines-use-default-member-init,modernize-use-default-member-init)
|
|
||||||
vector3(double x, double y, double z) : v{x, y, z} {} // NOLINT(hicpp-member-init,cppcoreguidelines-pro-type-member-init)
|
|
||||||
double x() const
|
|
||||||
{
|
|
||||||
return v[0];
|
|
||||||
}
|
|
||||||
double y() const
|
|
||||||
{
|
|
||||||
return v[1];
|
|
||||||
}
|
|
||||||
double z() const
|
|
||||||
{
|
|
||||||
return v[2];
|
|
||||||
}
|
|
||||||
double* begin()
|
|
||||||
{
|
|
||||||
return v;
|
|
||||||
}
|
|
||||||
double* end()
|
|
||||||
{
|
|
||||||
return v + 3;
|
|
||||||
}
|
|
||||||
const double* begin() const
|
|
||||||
{
|
|
||||||
return v;
|
|
||||||
}
|
|
||||||
const double* end() const
|
|
||||||
{
|
|
||||||
return v + 3;
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
inline void to_json(json& j, const vector3& v) // NOLINT(misc-use-internal-linkage)
|
|
||||||
{
|
|
||||||
j = {{"x", v.x()}, {"y", v.y()}, {"z", v.z()}};
|
|
||||||
}
|
|
||||||
} // namespace issue_4320_eigen
|
|
||||||
|
|
||||||
// The user's own namespace, using the (fake) Eigen type as an implementation
|
|
||||||
// detail behind a payload type that has nothing to do with vectors/arrays.
|
|
||||||
namespace issue_4320
|
|
||||||
{
|
|
||||||
// Publicly derives from issue_4320_eigen::vector3 but does *not* define its
|
|
||||||
// own to_json - it is only ever used as a temporary to reach the base
|
|
||||||
// class's to_json via ADL.
|
|
||||||
struct vector3_wrapper : issue_4320_eigen::vector3
|
|
||||||
{
|
|
||||||
using issue_4320_eigen::vector3::vector3;
|
|
||||||
};
|
|
||||||
|
|
||||||
struct payload
|
|
||||||
{
|
|
||||||
double x, y, z;
|
|
||||||
};
|
|
||||||
|
|
||||||
inline vector3_wrapper to_eigen(const payload& p) // NOLINT(misc-use-internal-linkage)
|
|
||||||
{
|
|
||||||
return {p.x, p.y, p.z};
|
|
||||||
}
|
|
||||||
|
|
||||||
inline void to_json(json& j, const payload& p) // NOLINT(misc-use-internal-linkage)
|
|
||||||
{
|
|
||||||
// Unqualified call, passing a *derived* vector3_wrapper: relies on ADL
|
|
||||||
// finding issue_4320_eigen::to_json(json&, const vector3&) through the
|
|
||||||
// vector3 base class, via a derived-to-base conversion. Must NOT resolve
|
|
||||||
// to the library's own generic array-compatible to_json (an exact-match
|
|
||||||
// template for vector3_wrapper, since it also has begin()/end()), which
|
|
||||||
// would serialize this as [x, y, z] instead of {"x":x, "y":y, "z":z}.
|
|
||||||
to_json(j, to_eigen(p));
|
|
||||||
}
|
|
||||||
} // namespace issue_4320
|
|
||||||
|
|
||||||
TEST_CASE("issue #4320 - custom base class must not leak nlohmann::detail into ADL")
|
|
||||||
{
|
|
||||||
// Before the fix, basic_json unconditionally derived from a type living in
|
|
||||||
// nlohmann::detail (json_default_base), which made nlohmann::detail an
|
|
||||||
// associated namespace of every basic_json for ADL purposes. That leaked
|
|
||||||
// the library's internal generic-array to_json overload into unqualified
|
|
||||||
// to_json() calls made from user code, silently bypassing user-defined
|
|
||||||
// to_json overloads reached via a derived-to-base conversion.
|
|
||||||
const issue_4320::payload p{1.0, 2.0, 3.0};
|
|
||||||
|
|
||||||
json j;
|
|
||||||
to_json(j, p);
|
|
||||||
CHECK(j == json({{"x", 1.0}, {"y", 2.0}, {"z", 3.0}}));
|
|
||||||
}
|
|
||||||
|
|
||||||
TEST_CASE("issue #5338 - truncated CBOR tagged binary subtype is rejected")
|
|
||||||
{
|
|
||||||
const std::vector<std::vector<std::uint8_t>> truncated_tags =
|
|
||||||
{
|
|
||||||
{0xD8},
|
|
||||||
{0xD9, 0x00},
|
|
||||||
{0xDA, 0x00, 0x00, 0x00},
|
|
||||||
{0xDB, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00}
|
|
||||||
};
|
|
||||||
|
|
||||||
for (const auto& data : truncated_tags)
|
|
||||||
{
|
|
||||||
CAPTURE(data);
|
|
||||||
for (const auto tag_handler :
|
|
||||||
{
|
|
||||||
json::cbor_tag_handler_t::ignore, json::cbor_tag_handler_t::store
|
|
||||||
})
|
|
||||||
{
|
|
||||||
CAPTURE(tag_handler);
|
|
||||||
const auto result = json::from_cbor(data, true, false, tag_handler);
|
|
||||||
CHECK(result.is_discarded());
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
TEST_CASE("issue #5402 - update(merge_objects=true) overwrites a primitive with an object")
|
|
||||||
{
|
|
||||||
json t = {{"k", 1}};
|
|
||||||
t.update(json{{"k", {{"x", 2}}}}, true);
|
|
||||||
CHECK(t == json({{"k", {{"x", 2}}}}));
|
|
||||||
|
|
||||||
json mixed = {{"keep", {{"a", 1}}}, {"replace", 1}};
|
|
||||||
mixed.update(json{{"keep", {{"b", 2}}}, {"replace", {{"x", 2}}}}, true);
|
|
||||||
CHECK(mixed == json({{"keep", {{"a", 1}, {"b", 2}}}, {"replace", {{"x", 2}}}}));
|
|
||||||
}
|
}
|
||||||
|
|
||||||
DOCTEST_CLANG_SUPPRESS_WARNING_POP
|
DOCTEST_CLANG_SUPPRESS_WARNING_POP
|
||||||
|
|||||||
@@ -0,0 +1,899 @@
|
|||||||
|
// __ _____ _____ _____
|
||||||
|
// __| | __| | | | JSON for Modern C++ (supporting code)
|
||||||
|
// | | |__ | | | | | | version 3.12.0
|
||||||
|
// |_____|_____|_____|_|___| https://github.com/nlohmann/json
|
||||||
|
//
|
||||||
|
// SPDX-FileCopyrightText: 2013-2026 Niels Lohmann <https://nlohmann.me>
|
||||||
|
// SPDX-License-Identifier: MIT
|
||||||
|
|
||||||
|
// cmake/test.cmake selects the C++ standard versions with which to build a
|
||||||
|
// unit test based on the presence of JSON_HAS_CPP_<VERSION> macros.
|
||||||
|
// When using macros that are only defined for particular versions of the standard
|
||||||
|
// (e.g., JSON_HAS_FILESYSTEM for C++17 and up), please mention the corresponding
|
||||||
|
// version macro in a comment close by, like this:
|
||||||
|
// JSON_HAS_CPP_<VERSION> (do not remove; see note at top of file)
|
||||||
|
|
||||||
|
#include "doctest_compatibility.h"
|
||||||
|
|
||||||
|
// for some reason including this after the json header leads to linker errors with VS 2017...
|
||||||
|
#include <locale>
|
||||||
|
|
||||||
|
#define JSON_TESTS_PRIVATE
|
||||||
|
#include <nlohmann/json.hpp>
|
||||||
|
using json = nlohmann::json;
|
||||||
|
using ordered_json = nlohmann::ordered_json;
|
||||||
|
#ifdef JSON_TEST_NO_GLOBAL_UDLS
|
||||||
|
using namespace nlohmann::literals; // NOLINT(google-build-using-namespace)
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#include <cstdio>
|
||||||
|
#include <list>
|
||||||
|
#include <type_traits>
|
||||||
|
#include <utility>
|
||||||
|
|
||||||
|
#ifdef JSON_HAS_CPP_17
|
||||||
|
#include <any>
|
||||||
|
#include <variant>
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#ifdef JSON_HAS_CPP_17
|
||||||
|
#if __has_include(<optional>)
|
||||||
|
#include <optional>
|
||||||
|
#elif __has_include(<experimental/optional>)
|
||||||
|
#endif
|
||||||
|
|
||||||
|
/////////////////////////////////////////////////////////////////////
|
||||||
|
// for #4804
|
||||||
|
/////////////////////////////////////////////////////////////////////
|
||||||
|
using json_4804 = nlohmann::basic_json<std::map, // ObjectType
|
||||||
|
std::vector, // ArrayType
|
||||||
|
std::string, // StringType
|
||||||
|
bool, // BooleanType
|
||||||
|
std::int64_t, // NumberIntegerType
|
||||||
|
std::uint64_t, // NumberUnsignedType
|
||||||
|
double, // NumberFloatType
|
||||||
|
std::allocator, // AllocatorType
|
||||||
|
nlohmann::adl_serializer, // JSONSerializer
|
||||||
|
std::vector<std::byte>, // BinaryType
|
||||||
|
void // CustomBaseClass
|
||||||
|
>;
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#ifdef JSON_HAS_CPP_20
|
||||||
|
#if __has_include(<span>)
|
||||||
|
#include <span>
|
||||||
|
#endif
|
||||||
|
#endif
|
||||||
|
|
||||||
|
/////////////////////////////////////////////////////////////////////
|
||||||
|
// for #4825 - explicitly instantiating basic_json must compile; this
|
||||||
|
// forces instantiation of binary_writer::write_bjdata_ndarray, whose
|
||||||
|
// static_cast<string_t> was ambiguous under explicit instantiation on
|
||||||
|
// C++17. Merely compiling this translation unit is the regression test.
|
||||||
|
/////////////////////////////////////////////////////////////////////
|
||||||
|
template class nlohmann::basic_json<>;
|
||||||
|
|
||||||
|
/////////////////////////////////////////////////////////////////////
|
||||||
|
// for #4440
|
||||||
|
/////////////////////////////////////////////////////////////////////
|
||||||
|
#if JSON_HAS_RANGES == 1
|
||||||
|
#include <ranges>
|
||||||
|
#endif
|
||||||
|
|
||||||
|
// NLOHMANN_JSON_SERIALIZE_ENUM uses a static std::pair
|
||||||
|
DOCTEST_CLANG_SUPPRESS_WARNING_PUSH
|
||||||
|
DOCTEST_CLANG_SUPPRESS_WARNING("-Wexit-time-destructors")
|
||||||
|
/////////////////////////////////////////////////////////////////////
|
||||||
|
// for #3077
|
||||||
|
/////////////////////////////////////////////////////////////////////
|
||||||
|
|
||||||
|
class FooAlloc
|
||||||
|
{};
|
||||||
|
|
||||||
|
class Foo
|
||||||
|
{
|
||||||
|
public:
|
||||||
|
explicit Foo(const FooAlloc& /* unused */ = FooAlloc()) {}
|
||||||
|
|
||||||
|
bool value = false;
|
||||||
|
};
|
||||||
|
|
||||||
|
class FooBar
|
||||||
|
{
|
||||||
|
public:
|
||||||
|
Foo foo{}; // NOLINT(readability-redundant-member-init)
|
||||||
|
};
|
||||||
|
|
||||||
|
inline void from_json(const nlohmann::json& j, FooBar& fb) // NOLINT(misc-use-internal-linkage)
|
||||||
|
{
|
||||||
|
j.at("value").get_to(fb.foo.value);
|
||||||
|
}
|
||||||
|
|
||||||
|
/////////////////////////////////////////////////////////////////////
|
||||||
|
// for #3171
|
||||||
|
/////////////////////////////////////////////////////////////////////
|
||||||
|
|
||||||
|
struct for_3171_base // NOLINT(cppcoreguidelines-special-member-functions)
|
||||||
|
{
|
||||||
|
for_3171_base(const std::string& /*unused*/ = {}) {}
|
||||||
|
virtual ~for_3171_base();
|
||||||
|
|
||||||
|
for_3171_base(const for_3171_base& other) // NOLINT(hicpp-use-equals-default,modernize-use-equals-default)
|
||||||
|
: str(other.str)
|
||||||
|
{}
|
||||||
|
|
||||||
|
for_3171_base& operator=(const for_3171_base& other)
|
||||||
|
{
|
||||||
|
if (this != &other)
|
||||||
|
{
|
||||||
|
str = other.str;
|
||||||
|
}
|
||||||
|
return *this;
|
||||||
|
}
|
||||||
|
|
||||||
|
for_3171_base(for_3171_base&& other) noexcept
|
||||||
|
: str(std::move(other.str))
|
||||||
|
{}
|
||||||
|
|
||||||
|
for_3171_base& operator=(for_3171_base&& other) noexcept
|
||||||
|
{
|
||||||
|
if (this != &other)
|
||||||
|
{
|
||||||
|
str = std::move(other.str);
|
||||||
|
}
|
||||||
|
return *this;
|
||||||
|
}
|
||||||
|
|
||||||
|
virtual void _from_json(const json& j)
|
||||||
|
{
|
||||||
|
j.at("str").get_to(str);
|
||||||
|
}
|
||||||
|
|
||||||
|
std::string str{}; // NOLINT(readability-redundant-member-init)
|
||||||
|
};
|
||||||
|
|
||||||
|
for_3171_base::~for_3171_base() = default;
|
||||||
|
|
||||||
|
struct for_3171_derived : public for_3171_base
|
||||||
|
{
|
||||||
|
for_3171_derived() = default;
|
||||||
|
~for_3171_derived() override;
|
||||||
|
explicit for_3171_derived(const std::string& /*unused*/) { }
|
||||||
|
|
||||||
|
for_3171_derived(const for_3171_derived& other) // NOLINT(hicpp-use-equals-default,modernize-use-equals-default)
|
||||||
|
: for_3171_base(other)
|
||||||
|
{}
|
||||||
|
|
||||||
|
for_3171_derived& operator=(const for_3171_derived& other)
|
||||||
|
{
|
||||||
|
if (this != &other)
|
||||||
|
{
|
||||||
|
for_3171_base::operator=(other); // Call base class assignment operator
|
||||||
|
}
|
||||||
|
return *this;
|
||||||
|
}
|
||||||
|
|
||||||
|
for_3171_derived(for_3171_derived&& other) noexcept
|
||||||
|
: for_3171_base(std::move(other))
|
||||||
|
{}
|
||||||
|
|
||||||
|
for_3171_derived& operator=(for_3171_derived&& other) noexcept
|
||||||
|
{
|
||||||
|
if (this != &other)
|
||||||
|
{
|
||||||
|
for_3171_base::operator=(std::move(other)); // Call base class move assignment operator
|
||||||
|
}
|
||||||
|
return *this;
|
||||||
|
}
|
||||||
|
};
|
||||||
|
|
||||||
|
for_3171_derived::~for_3171_derived() = default;
|
||||||
|
|
||||||
|
inline void from_json(const json& j, for_3171_base& tb) // NOLINT(misc-use-internal-linkage)
|
||||||
|
{
|
||||||
|
tb._from_json(j);
|
||||||
|
}
|
||||||
|
|
||||||
|
/////////////////////////////////////////////////////////////////////
|
||||||
|
// for #3312
|
||||||
|
/////////////////////////////////////////////////////////////////////
|
||||||
|
|
||||||
|
#ifdef JSON_HAS_CPP_20
|
||||||
|
struct for_3312
|
||||||
|
{
|
||||||
|
std::string name;
|
||||||
|
};
|
||||||
|
|
||||||
|
inline void from_json(const json& j, for_3312& obj) // NOLINT(misc-use-internal-linkage)
|
||||||
|
{
|
||||||
|
j.at("name").get_to(obj.name);
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
|
||||||
|
/////////////////////////////////////////////////////////////////////
|
||||||
|
// for #3204
|
||||||
|
/////////////////////////////////////////////////////////////////////
|
||||||
|
|
||||||
|
struct for_3204_foo
|
||||||
|
{
|
||||||
|
for_3204_foo() = default;
|
||||||
|
explicit for_3204_foo(std::string /*unused*/) {} // NOLINT(performance-unnecessary-value-param)
|
||||||
|
};
|
||||||
|
|
||||||
|
struct for_3204_bar
|
||||||
|
{
|
||||||
|
enum constructed_from_t // NOLINT(cppcoreguidelines-use-enum-class)
|
||||||
|
{
|
||||||
|
constructed_from_none = 0,
|
||||||
|
constructed_from_foo = 1,
|
||||||
|
constructed_from_json = 2
|
||||||
|
};
|
||||||
|
|
||||||
|
explicit for_3204_bar(std::function<void(for_3204_foo)> /*unused*/) noexcept // NOLINT(performance-unnecessary-value-param)
|
||||||
|
: constructed_from(constructed_from_foo) {}
|
||||||
|
explicit for_3204_bar(std::function<void(json)> /*unused*/) noexcept // NOLINT(performance-unnecessary-value-param)
|
||||||
|
: constructed_from(constructed_from_json) {}
|
||||||
|
|
||||||
|
constructed_from_t constructed_from = constructed_from_none;
|
||||||
|
};
|
||||||
|
|
||||||
|
/////////////////////////////////////////////////////////////////////
|
||||||
|
// for #3333
|
||||||
|
/////////////////////////////////////////////////////////////////////
|
||||||
|
|
||||||
|
struct for_3333 final
|
||||||
|
{
|
||||||
|
for_3333(int x_ = 0, int y_ = 0) : x(x_), y(y_) {}
|
||||||
|
|
||||||
|
template <class T>
|
||||||
|
for_3333(const T& /*unused*/)
|
||||||
|
{
|
||||||
|
CHECK(false);
|
||||||
|
}
|
||||||
|
|
||||||
|
int x = 0;
|
||||||
|
int y = 0;
|
||||||
|
};
|
||||||
|
|
||||||
|
template <>
|
||||||
|
inline for_3333::for_3333(const json& j)
|
||||||
|
: for_3333(j.value("x", 0), j.value("y", 0))
|
||||||
|
{}
|
||||||
|
|
||||||
|
/////////////////////////////////////////////////////////////////////
|
||||||
|
// for #3810
|
||||||
|
/////////////////////////////////////////////////////////////////////
|
||||||
|
|
||||||
|
struct Example_3810
|
||||||
|
{
|
||||||
|
int bla{};
|
||||||
|
|
||||||
|
Example_3810() = default;
|
||||||
|
};
|
||||||
|
|
||||||
|
NLOHMANN_DEFINE_TYPE_NON_INTRUSIVE(Example_3810, bla) // NOLINT(misc-use-internal-linkage)
|
||||||
|
|
||||||
|
/////////////////////////////////////////////////////////////////////
|
||||||
|
// for #4740
|
||||||
|
/////////////////////////////////////////////////////////////////////
|
||||||
|
|
||||||
|
#ifdef JSON_HAS_CPP_17
|
||||||
|
struct Example_4740
|
||||||
|
{
|
||||||
|
std::optional<std::string> host = std::nullopt;
|
||||||
|
std::optional<int> port = std::nullopt;
|
||||||
|
NLOHMANN_DEFINE_TYPE_INTRUSIVE_WITH_DEFAULT(Example_4740, host, port)
|
||||||
|
};
|
||||||
|
#endif
|
||||||
|
|
||||||
|
TEST_CASE("regression tests 3")
|
||||||
|
{
|
||||||
|
#if JSON_HAS_FILESYSTEM || JSON_HAS_EXPERIMENTAL_FILESYSTEM
|
||||||
|
// JSON_HAS_CPP_17 (do not remove; see note at top of file)
|
||||||
|
SECTION("issue #3070 - Version 3.10.3 breaks backward-compatibility with 3.10.2 ")
|
||||||
|
{
|
||||||
|
nlohmann::detail::std_fs::path text_path("/tmp/text.txt");
|
||||||
|
const json j(text_path);
|
||||||
|
|
||||||
|
const auto j_path = j.get<nlohmann::detail::std_fs::path>();
|
||||||
|
CHECK(j_path == text_path);
|
||||||
|
|
||||||
|
#if DOCTEST_CLANG || DOCTEST_GCC >= DOCTEST_COMPILER(8, 4, 0)
|
||||||
|
// only known to work on Clang and GCC >=8.4
|
||||||
|
CHECK_THROWS_WITH_AS(nlohmann::detail::std_fs::path(json(1)), "[json.exception.type_error.302] type must be string, but is number", json::type_error);
|
||||||
|
#endif
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
|
||||||
|
SECTION("issue #3077 - explicit constructor with default does not compile")
|
||||||
|
{
|
||||||
|
json j;
|
||||||
|
j[0]["value"] = true;
|
||||||
|
std::vector<FooBar> foo;
|
||||||
|
j.get_to(foo);
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("issue #3108 - ordered_json doesn't support range based erase")
|
||||||
|
{
|
||||||
|
ordered_json j = {1, 2, 2, 4};
|
||||||
|
|
||||||
|
auto last = std::unique(j.begin(), j.end());
|
||||||
|
j.erase(last, j.end());
|
||||||
|
|
||||||
|
CHECK(j.dump() == "[1,2,4]");
|
||||||
|
|
||||||
|
j.erase(std::remove_if(j.begin(), j.end(), [](const ordered_json & val)
|
||||||
|
{
|
||||||
|
return val == 2;
|
||||||
|
}), j.end());
|
||||||
|
|
||||||
|
CHECK(j.dump() == "[1,4]");
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("issue #3343 - json and ordered_json are not interchangeable")
|
||||||
|
{
|
||||||
|
json::object_t jobj({ { "product", "one" } });
|
||||||
|
ordered_json::object_t ojobj({{"product", "one"}});
|
||||||
|
|
||||||
|
auto jit = jobj.begin();
|
||||||
|
auto ojit = ojobj.begin();
|
||||||
|
|
||||||
|
CHECK(jit->first == ojit->first);
|
||||||
|
CHECK(jit->second.get<std::string>() == ojit->second.get<std::string>());
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("issue #3171 - if class is_constructible from std::string wrong from_json overload is being selected, compilation failed")
|
||||||
|
{
|
||||||
|
const json j{{ "str", "value"}};
|
||||||
|
|
||||||
|
// failed with: error: no match for ‘operator=’ (operand types are ‘for_3171_derived’ and ‘const nlohmann::basic_json<>::string_t’
|
||||||
|
// {aka ‘const std::__cxx11::basic_string<char>’})
|
||||||
|
// s = *j.template get_ptr<const typename BasicJsonType::string_t*>();
|
||||||
|
auto td = j.get<for_3171_derived>();
|
||||||
|
|
||||||
|
CHECK(td.str == "value");
|
||||||
|
}
|
||||||
|
|
||||||
|
#ifdef JSON_HAS_CPP_20
|
||||||
|
SECTION("issue #3312 - Parse to custom class from unordered_json breaks on G++11.2.0 with C++20")
|
||||||
|
{
|
||||||
|
// see test for #3171
|
||||||
|
const ordered_json j = {{"name", "class"}};
|
||||||
|
for_3312 obj{};
|
||||||
|
|
||||||
|
j.get_to(obj);
|
||||||
|
|
||||||
|
CHECK(obj.name == "class");
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#if defined(JSON_HAS_CPP_17) && JSON_USE_IMPLICIT_CONVERSIONS
|
||||||
|
SECTION("issue #3428 - Error occurred when converting nlohmann::json to std::any")
|
||||||
|
{
|
||||||
|
const json j;
|
||||||
|
const std::any a1 = j;
|
||||||
|
std::any&& a2 = j;
|
||||||
|
|
||||||
|
CHECK(a1.type() == typeid(j));
|
||||||
|
CHECK(a2.type() == typeid(j));
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
|
||||||
|
SECTION("issue #3204 - ambiguous regression")
|
||||||
|
{
|
||||||
|
const for_3204_bar bar_from_foo([](for_3204_foo) noexcept {}); // NOLINT(performance-unnecessary-value-param)
|
||||||
|
const for_3204_bar bar_from_json([](json) noexcept {}); // NOLINT(performance-unnecessary-value-param)
|
||||||
|
|
||||||
|
CHECK(bar_from_foo.constructed_from == for_3204_bar::constructed_from_foo);
|
||||||
|
CHECK(bar_from_json.constructed_from == for_3204_bar::constructed_from_json);
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("issue #3333 - Ambiguous conversion from nlohmann::basic_json<> to custom class")
|
||||||
|
{
|
||||||
|
const json j
|
||||||
|
{
|
||||||
|
{"x", 1},
|
||||||
|
{"y", 2}
|
||||||
|
};
|
||||||
|
const for_3333 p = j;
|
||||||
|
|
||||||
|
CHECK(p.x == 1);
|
||||||
|
CHECK(p.y == 2);
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("issue #3810 - ordered_json doesn't support construction from C array of custom type")
|
||||||
|
{
|
||||||
|
Example_3810 states[45]; // NOLINT(cppcoreguidelines-avoid-c-arrays,hicpp-avoid-c-arrays,modernize-avoid-c-arrays)
|
||||||
|
|
||||||
|
// fix "not used" warning
|
||||||
|
states[0].bla = 1;
|
||||||
|
|
||||||
|
const auto* const expected = R"([{"bla":1},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0},{"bla":0}])";
|
||||||
|
|
||||||
|
// This works:
|
||||||
|
nlohmann::json j;
|
||||||
|
j["test"] = states;
|
||||||
|
CHECK(j["test"].dump() == expected);
|
||||||
|
|
||||||
|
// This doesn't compile:
|
||||||
|
nlohmann::ordered_json oj;
|
||||||
|
oj["test"] = states;
|
||||||
|
CHECK(oj["test"].dump() == expected);
|
||||||
|
}
|
||||||
|
|
||||||
|
#ifdef JSON_HAS_CPP_17
|
||||||
|
SECTION("issue #4740 - build issue with std::optional")
|
||||||
|
{
|
||||||
|
const auto t1 = Example_4740();
|
||||||
|
const auto j1 = nlohmann::json(t1);
|
||||||
|
CHECK(j1.dump() == "{\"host\":null,\"port\":null}");
|
||||||
|
const auto t2 = j1.get<Example_4740>();
|
||||||
|
CHECK(!t2.host.has_value());
|
||||||
|
CHECK(!t2.port.has_value());
|
||||||
|
|
||||||
|
// improve coverage
|
||||||
|
auto t3 = Example_4740();
|
||||||
|
t3.port = 80;
|
||||||
|
t3.host = "example.com";
|
||||||
|
const auto j2 = nlohmann::json(t3);
|
||||||
|
CHECK(j2.dump() == "{\"host\":\"example.com\",\"port\":80}");
|
||||||
|
const auto t4 = j2.get<Example_4740>();
|
||||||
|
CHECK(t4.host.has_value());
|
||||||
|
CHECK(t4.port.has_value());
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#if !defined(_MSVC_LANG)
|
||||||
|
// MSVC returns garbage on invalid enum values, so this test is excluded
|
||||||
|
// there.
|
||||||
|
SECTION("issue #4762 - json exception 302 with unhelpful explanation : type must be number, but is number")
|
||||||
|
{
|
||||||
|
// In #4762, the main issue was that a json object with an invalid type
|
||||||
|
// returned "number" as type_name(), because this was the default case.
|
||||||
|
// This test makes sure we now return "invalid" instead.
|
||||||
|
json j;
|
||||||
|
j.m_data.m_type = static_cast<json::value_t>(100); // NOLINT(clang-analyzer-optin.core.EnumCastOutOfRange)
|
||||||
|
CHECK(j.type_name() == "invalid");
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#ifdef JSON_HAS_CPP_17
|
||||||
|
SECTION("issue #4804: from_cbor incompatible with std::vector<std::byte> as binary_t")
|
||||||
|
{
|
||||||
|
const std::vector<std::uint8_t> data = {0x80};
|
||||||
|
const auto decoded = json_4804::from_cbor(data);
|
||||||
|
CHECK((decoded == json_4804::array()));
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("discussion #4209 - custom BinaryType direct assignment and round-tripping")
|
||||||
|
{
|
||||||
|
// Test that assigning a custom BinaryType directly creates a binary value, not an array
|
||||||
|
const std::vector<std::byte> original{std::byte{1}, std::byte{2}, std::byte{3}};
|
||||||
|
const json_4804 j = original;
|
||||||
|
CHECK(j.is_binary());
|
||||||
|
CHECK(!j.is_array());
|
||||||
|
|
||||||
|
// Test round-tripping: extracting the binary value back as the custom container type
|
||||||
|
const auto extracted = j.get<std::vector<std::byte>>();
|
||||||
|
CHECK(extracted == original);
|
||||||
|
|
||||||
|
// Test that the default json alias behavior is unchanged: std::vector<uint8_t> -> array
|
||||||
|
const json default_json = std::vector<std::uint8_t> {1, 2, 3};
|
||||||
|
CHECK(default_json.is_array());
|
||||||
|
CHECK(!default_json.is_binary());
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("discussion #4209 - custom BinaryType extraction from parsed array")
|
||||||
|
{
|
||||||
|
// Test that extracting a custom BinaryType from a parsed JSON array still works
|
||||||
|
// (not just from a binary-typed node)
|
||||||
|
const auto j = json_4804::parse("[1,2,3]");
|
||||||
|
CHECK(j.is_array());
|
||||||
|
CHECK(!j.is_binary());
|
||||||
|
|
||||||
|
// Extracting as custom BinaryType should work from arrays
|
||||||
|
const auto extracted = j.get<std::vector<std::byte>>();
|
||||||
|
CHECK(extracted.size() == 3);
|
||||||
|
CHECK(extracted[0] == std::byte{1});
|
||||||
|
CHECK(extracted[1] == std::byte{2});
|
||||||
|
CHECK(extracted[2] == std::byte{3});
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("issue #5046 - implicit conversion of return json to std::optional no longer implicit")
|
||||||
|
{
|
||||||
|
const json jval{};
|
||||||
|
auto GetValue = [](const json & valRoot) -> std::optional<json>
|
||||||
|
{
|
||||||
|
if (valRoot.contains("default"))
|
||||||
|
{
|
||||||
|
return valRoot.at("default");
|
||||||
|
}
|
||||||
|
return std::nullopt;
|
||||||
|
};
|
||||||
|
auto result = GetValue(jval);
|
||||||
|
CHECK(!result.has_value());
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#if JSON_HAS_RANGES == 1
|
||||||
|
SECTION("issue #4440 - assert when using std::views::filter and GCC 10")
|
||||||
|
{
|
||||||
|
auto noOpFilter = std::views::filter([](auto&&) noexcept
|
||||||
|
{
|
||||||
|
return true;
|
||||||
|
});
|
||||||
|
json j = {1, 2, 3};
|
||||||
|
auto filtered = j | noOpFilter;
|
||||||
|
CHECK(*filtered.begin() == 1);
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#if JSON_HAS_RANGES && !defined(__MINGW32__)
|
||||||
|
SECTION("issue #4916 - constructing array from C++20 ranges view does not work")
|
||||||
|
{
|
||||||
|
std::vector<int> nums{1, 2, 37, 42, 21};
|
||||||
|
auto filteredNums = nums | std::views::filter([](int i)
|
||||||
|
{
|
||||||
|
return i > 10;
|
||||||
|
});
|
||||||
|
json const j(filteredNums);
|
||||||
|
CHECK(j.type() == json::value_t::array);
|
||||||
|
CHECK(j == json({37, 42, 21}));
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
|
||||||
|
// owning_view is not available in libstdc++ < 12
|
||||||
|
#if JSON_HAS_RANGES && !defined(__MINGW32__) && !(defined(__GLIBCXX__) && _GLIBCXX_RELEASE < 12)
|
||||||
|
SECTION("issue #4916 - constructing array from prvalue C++20 ranges view (owning_view)")
|
||||||
|
{
|
||||||
|
json const j(std::vector<int> {1, 2, 37, 42, 21} | std::views::filter([](int i)
|
||||||
|
{
|
||||||
|
return i > 10;
|
||||||
|
}));
|
||||||
|
CHECK(j.type() == json::value_t::array);
|
||||||
|
CHECK(j == json({37, 42, 21}));
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#if JSON_HAS_RANGES && !defined(__MINGW32__)
|
||||||
|
SECTION("issue #4916 - constructing array from C++20 transform view (prvalue elements)")
|
||||||
|
{
|
||||||
|
std::vector<int> nums{1, 2, 3};
|
||||||
|
auto t = nums | std::views::transform([](int i) noexcept
|
||||||
|
{
|
||||||
|
return i * 2;
|
||||||
|
});
|
||||||
|
json const j(t);
|
||||||
|
CHECK(j.type() == json::value_t::array);
|
||||||
|
CHECK(j == json({2, 4, 6}));
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
}
|
||||||
|
|
||||||
|
TEST_CASE_TEMPLATE("issue #4798 - nlohmann::json::to_msgpack() encode float NaN as double", T, double, float) // NOLINT(readability-math-missing-parentheses, bugprone-throwing-static-initialization)
|
||||||
|
{
|
||||||
|
// With issue #4798, we encode NaN, infinity, and -infinity as float instead
|
||||||
|
// of double to allow for smaller encodings.
|
||||||
|
const json jx = std::numeric_limits<T>::quiet_NaN();
|
||||||
|
const json jy = std::numeric_limits<T>::infinity();
|
||||||
|
const json jz = -std::numeric_limits<T>::infinity();
|
||||||
|
|
||||||
|
/////////////////////////////////////////////////////////////////////////
|
||||||
|
// MessagePack
|
||||||
|
/////////////////////////////////////////////////////////////////////////
|
||||||
|
|
||||||
|
// expected MessagePack values
|
||||||
|
const std::vector<std::uint8_t> msgpack_x = {{0xCA, 0x7F, 0xC0, 0x00, 0x00}};
|
||||||
|
const std::vector<std::uint8_t> msgpack_y = {{0xCA, 0x7F, 0x80, 0x00, 0x00}};
|
||||||
|
const std::vector<std::uint8_t> msgpack_z = {{0xCA, 0xFF, 0x80, 0x00, 0x00}};
|
||||||
|
|
||||||
|
CHECK(json::to_msgpack(jx) == msgpack_x);
|
||||||
|
CHECK(json::to_msgpack(jy) == msgpack_y);
|
||||||
|
CHECK(json::to_msgpack(jz) == msgpack_z);
|
||||||
|
|
||||||
|
CHECK(std::isnan(json::from_msgpack(msgpack_x).get<T>()));
|
||||||
|
CHECK(json::from_msgpack(msgpack_y).get<T>() == std::numeric_limits<T>::infinity());
|
||||||
|
CHECK(json::from_msgpack(msgpack_z).get<T>() == -std::numeric_limits<T>::infinity());
|
||||||
|
|
||||||
|
// Make sure the other MessagePakc encodings for NaN, infinity, and
|
||||||
|
// -infinity are still supported.
|
||||||
|
const std::vector<std::uint8_t> msgpack_x_2 = {{0xCB, 0x7F, 0xF8, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00}};
|
||||||
|
const std::vector<std::uint8_t> msgpack_y_2 = {{0xCB, 0x7F, 0xF0, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00}};
|
||||||
|
const std::vector<std::uint8_t> msgpack_z_2 = {{0xCB, 0xFF, 0xF0, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00}};
|
||||||
|
CHECK(std::isnan(json::from_msgpack(msgpack_x_2).get<T>()));
|
||||||
|
CHECK(json::from_msgpack(msgpack_y_2).get<T>() == std::numeric_limits<T>::infinity());
|
||||||
|
CHECK(json::from_msgpack(msgpack_z_2).get<T>() == -std::numeric_limits<T>::infinity());
|
||||||
|
|
||||||
|
/////////////////////////////////////////////////////////////////////////
|
||||||
|
// CBOR
|
||||||
|
/////////////////////////////////////////////////////////////////////////
|
||||||
|
|
||||||
|
// expected CBOR values
|
||||||
|
const std::vector<std::uint8_t> cbor_x = {{0xF9, 0x7E, 0x00}};
|
||||||
|
const std::vector<std::uint8_t> cbor_y = {{0xF9, 0x7C, 0x00}};
|
||||||
|
const std::vector<std::uint8_t> cbor_z = {{0xF9, 0xfC, 0x00}};
|
||||||
|
|
||||||
|
CHECK(json::to_cbor(jx) == cbor_x);
|
||||||
|
CHECK(json::to_cbor(jy) == cbor_y);
|
||||||
|
CHECK(json::to_cbor(jz) == cbor_z);
|
||||||
|
|
||||||
|
CHECK(std::isnan(json::from_cbor(cbor_x).get<T>()));
|
||||||
|
CHECK(json::from_cbor(cbor_y).get<T>() == std::numeric_limits<T>::infinity());
|
||||||
|
CHECK(json::from_cbor(cbor_z).get<T>() == -std::numeric_limits<T>::infinity());
|
||||||
|
|
||||||
|
// Make sure the other CBOR encodings for NaN, infinity, and -infinity are
|
||||||
|
// still supported.
|
||||||
|
const std::vector<std::uint8_t> cbor_x_2 = {{0xFA, 0x7F, 0xC0, 0x00, 0x00}};
|
||||||
|
const std::vector<std::uint8_t> cbor_y_2 = {{0xFA, 0x7F, 0x80, 0x00, 0x00}};
|
||||||
|
const std::vector<std::uint8_t> cbor_z_2 = {{0xFA, 0xFF, 0x80, 0x00, 0x00}};
|
||||||
|
const std::vector<std::uint8_t> cbor_x_3 = {{0xFB, 0x7F, 0xF8, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00}};
|
||||||
|
const std::vector<std::uint8_t> cbor_y_3 = {{0xFB, 0x7F, 0xF0, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00}};
|
||||||
|
const std::vector<std::uint8_t> cbor_z_3 = {{0xFB, 0xFF, 0xF0, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00}};
|
||||||
|
CHECK(std::isnan(json::from_cbor(cbor_x_2).get<T>()));
|
||||||
|
CHECK(json::from_cbor(cbor_y_2).get<T>() == std::numeric_limits<T>::infinity());
|
||||||
|
CHECK(json::from_cbor(cbor_z_2).get<T>() == -std::numeric_limits<T>::infinity());
|
||||||
|
CHECK(std::isnan(json::from_cbor(cbor_x_3).get<T>()));
|
||||||
|
CHECK(json::from_cbor(cbor_y_3).get<T>() == std::numeric_limits<T>::infinity());
|
||||||
|
CHECK(json::from_cbor(cbor_z_3).get<T>() == -std::numeric_limits<T>::infinity());
|
||||||
|
}
|
||||||
|
|
||||||
|
TEST_CASE("regression test #5074 - portable workaround for single-element brace init")
|
||||||
|
{
|
||||||
|
json const j_obj = {{"key", "value"}};
|
||||||
|
|
||||||
|
json const j = json::array({j_obj});
|
||||||
|
CHECK(j.is_array());
|
||||||
|
CHECK(j.size() == 1);
|
||||||
|
CHECK(j[0] == j_obj);
|
||||||
|
}
|
||||||
|
|
||||||
|
#if defined(JSON_BRACE_INIT_COPY_SEMANTICS) && (JSON_BRACE_INIT_COPY_SEMANTICS == 1)
|
||||||
|
TEST_CASE("regression test #5074 - single-element brace init with JSON_BRACE_INIT_COPY_SEMANTICS")
|
||||||
|
{
|
||||||
|
// with JSON_BRACE_INIT_COPY_SEMANTICS: single-element brace init copies/moves
|
||||||
|
json const j_obj = {{"key", "value"}, {"num", 42}};
|
||||||
|
json const j_arr = {1, 2, 3};
|
||||||
|
|
||||||
|
// object: brace init copies instead of wrapping
|
||||||
|
json const j1{j_obj};
|
||||||
|
CHECK(j1.is_object());
|
||||||
|
CHECK(j1 == j_obj);
|
||||||
|
|
||||||
|
// array: brace init copies instead of wrapping
|
||||||
|
json const j2{j_arr};
|
||||||
|
CHECK(j2.is_array());
|
||||||
|
CHECK(j2.size() == 3);
|
||||||
|
CHECK(j2 == j_arr);
|
||||||
|
|
||||||
|
// primitives still work as initializer lists
|
||||||
|
json const j3{true};
|
||||||
|
CHECK(j3.is_boolean());
|
||||||
|
|
||||||
|
json const j4{42};
|
||||||
|
CHECK(j4.is_number_integer());
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
|
||||||
|
struct Example_5122
|
||||||
|
{
|
||||||
|
float b = 2;
|
||||||
|
nlohmann::ordered_map<std::string, std::string> c{}; // NOLINT(readability-redundant-member-init): needed for GCC -Weffc++
|
||||||
|
int a = 1;
|
||||||
|
NLOHMANN_DEFINE_TYPE_INTRUSIVE_WITH_DEFAULT(Example_5122, b, c, a)
|
||||||
|
};
|
||||||
|
|
||||||
|
TEST_CASE("regression test #5122 - from_json into types holding nlohmann::ordered_map")
|
||||||
|
{
|
||||||
|
Example_5122 src;
|
||||||
|
src.c.emplace("first", "1");
|
||||||
|
src.c.emplace("second", "2");
|
||||||
|
|
||||||
|
ordered_json const j = src;
|
||||||
|
Example_5122 const dst = j.get<Example_5122>();
|
||||||
|
|
||||||
|
CHECK(dst.b == src.b);
|
||||||
|
CHECK(dst.a == src.a);
|
||||||
|
REQUIRE(dst.c.size() == src.c.size());
|
||||||
|
auto src_it = src.c.begin();
|
||||||
|
auto dst_it = dst.c.begin();
|
||||||
|
for (; src_it != src.c.end(); ++src_it, ++dst_it)
|
||||||
|
{
|
||||||
|
CHECK(dst_it->first == src_it->first);
|
||||||
|
CHECK(dst_it->second == src_it->second);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// -Wself-assign-overloaded was introduced in Clang 7. Gate the pragma on
|
||||||
|
// __has_warning so older Clang versions do not error with "unknown warning
|
||||||
|
// group". The __has_warning check has to stay inside the __clang__ branch
|
||||||
|
// because GCC does not provide it and would tokenize-error on the argument.
|
||||||
|
#if defined(__clang__) && defined(__has_warning)
|
||||||
|
#if __has_warning("-Wself-assign-overloaded")
|
||||||
|
DOCTEST_CLANG_SUPPRESS_WARNING_PUSH
|
||||||
|
DOCTEST_CLANG_SUPPRESS_WARNING("-Wself-assign-overloaded")
|
||||||
|
#endif
|
||||||
|
#endif
|
||||||
|
|
||||||
|
TEST_CASE("regression test #5122 - nlohmann::ordered_map copy-assignment is self-assignment safe")
|
||||||
|
{
|
||||||
|
nlohmann::ordered_map<std::string, std::string> m;
|
||||||
|
m.emplace("first", "1");
|
||||||
|
m.emplace("second", "2");
|
||||||
|
|
||||||
|
// Insertion order is preserved by ordered_map, so we can check it directly.
|
||||||
|
m = m;
|
||||||
|
|
||||||
|
REQUIRE(m.size() == 2);
|
||||||
|
auto it = m.begin();
|
||||||
|
CHECK(it->first == "first");
|
||||||
|
CHECK(it->second == "1");
|
||||||
|
++it;
|
||||||
|
CHECK(it->first == "second");
|
||||||
|
CHECK(it->second == "2");
|
||||||
|
}
|
||||||
|
|
||||||
|
#if defined(__clang__) && defined(__has_warning)
|
||||||
|
#if __has_warning("-Wself-assign-overloaded")
|
||||||
|
DOCTEST_CLANG_SUPPRESS_WARNING_POP
|
||||||
|
#endif
|
||||||
|
#endif
|
||||||
|
|
||||||
|
TEST_CASE("regression test #5122 - nlohmann::ordered_map move-assignment transfers contents")
|
||||||
|
{
|
||||||
|
nlohmann::ordered_map<std::string, std::string> src;
|
||||||
|
src.emplace("first", "1");
|
||||||
|
src.emplace("second", "2");
|
||||||
|
|
||||||
|
nlohmann::ordered_map<std::string, std::string> dst;
|
||||||
|
dst.emplace("stale", "x");
|
||||||
|
dst = std::move(src);
|
||||||
|
|
||||||
|
REQUIRE(dst.size() == 2);
|
||||||
|
auto it = dst.begin();
|
||||||
|
CHECK(it->first == "first");
|
||||||
|
CHECK(it->second == "1");
|
||||||
|
++it;
|
||||||
|
CHECK(it->first == "second");
|
||||||
|
CHECK(it->second == "2");
|
||||||
|
|
||||||
|
// Re-assigning into the moved-from object must leave it in a usable state.
|
||||||
|
src = nlohmann::ordered_map<std::string, std::string> {};
|
||||||
|
src.emplace("after-move", "3");
|
||||||
|
REQUIRE(src.size() == 1);
|
||||||
|
CHECK(src.begin()->first == "after-move");
|
||||||
|
}
|
||||||
|
|
||||||
|
// Stand-in for a third-party library (e.g., Eigen as of 3.4, which added
|
||||||
|
// STL-compatible begin()/end() to its vector types), living in its own
|
||||||
|
// namespace with its own to_json overload for its vector type.
|
||||||
|
namespace issue_4320_eigen
|
||||||
|
{
|
||||||
|
// "array-compatible" from the library's point of view (it has begin()/end()),
|
||||||
|
// but for which this (fake) third-party namespace provides its own to_json.
|
||||||
|
struct vector3
|
||||||
|
{
|
||||||
|
double v[3]; // NOLINT(cppcoreguidelines-avoid-c-arrays,hicpp-avoid-c-arrays,modernize-avoid-c-arrays,cppcoreguidelines-use-default-member-init,modernize-use-default-member-init)
|
||||||
|
vector3(double x, double y, double z) : v{x, y, z} {} // NOLINT(hicpp-member-init,cppcoreguidelines-pro-type-member-init)
|
||||||
|
double x() const
|
||||||
|
{
|
||||||
|
return v[0];
|
||||||
|
}
|
||||||
|
double y() const
|
||||||
|
{
|
||||||
|
return v[1];
|
||||||
|
}
|
||||||
|
double z() const
|
||||||
|
{
|
||||||
|
return v[2];
|
||||||
|
}
|
||||||
|
double* begin()
|
||||||
|
{
|
||||||
|
return v;
|
||||||
|
}
|
||||||
|
double* end()
|
||||||
|
{
|
||||||
|
return v + 3;
|
||||||
|
}
|
||||||
|
const double* begin() const
|
||||||
|
{
|
||||||
|
return v;
|
||||||
|
}
|
||||||
|
const double* end() const
|
||||||
|
{
|
||||||
|
return v + 3;
|
||||||
|
}
|
||||||
|
};
|
||||||
|
|
||||||
|
inline void to_json(json& j, const vector3& v) // NOLINT(misc-use-internal-linkage)
|
||||||
|
{
|
||||||
|
j = {{"x", v.x()}, {"y", v.y()}, {"z", v.z()}};
|
||||||
|
}
|
||||||
|
} // namespace issue_4320_eigen
|
||||||
|
|
||||||
|
// The user's own namespace, using the (fake) Eigen type as an implementation
|
||||||
|
// detail behind a payload type that has nothing to do with vectors/arrays.
|
||||||
|
namespace issue_4320
|
||||||
|
{
|
||||||
|
// Publicly derives from issue_4320_eigen::vector3 but does *not* define its
|
||||||
|
// own to_json - it is only ever used as a temporary to reach the base
|
||||||
|
// class's to_json via ADL.
|
||||||
|
struct vector3_wrapper : issue_4320_eigen::vector3
|
||||||
|
{
|
||||||
|
using issue_4320_eigen::vector3::vector3;
|
||||||
|
};
|
||||||
|
|
||||||
|
struct payload
|
||||||
|
{
|
||||||
|
double x, y, z;
|
||||||
|
};
|
||||||
|
|
||||||
|
inline vector3_wrapper to_eigen(const payload& p) // NOLINT(misc-use-internal-linkage)
|
||||||
|
{
|
||||||
|
return {p.x, p.y, p.z};
|
||||||
|
}
|
||||||
|
|
||||||
|
inline void to_json(json& j, const payload& p) // NOLINT(misc-use-internal-linkage)
|
||||||
|
{
|
||||||
|
// Unqualified call, passing a *derived* vector3_wrapper: relies on ADL
|
||||||
|
// finding issue_4320_eigen::to_json(json&, const vector3&) through the
|
||||||
|
// vector3 base class, via a derived-to-base conversion. Must NOT resolve
|
||||||
|
// to the library's own generic array-compatible to_json (an exact-match
|
||||||
|
// template for vector3_wrapper, since it also has begin()/end()), which
|
||||||
|
// would serialize this as [x, y, z] instead of {"x":x, "y":y, "z":z}.
|
||||||
|
to_json(j, to_eigen(p));
|
||||||
|
}
|
||||||
|
} // namespace issue_4320
|
||||||
|
|
||||||
|
TEST_CASE("issue #4320 - custom base class must not leak nlohmann::detail into ADL")
|
||||||
|
{
|
||||||
|
// Before the fix, basic_json unconditionally derived from a type living in
|
||||||
|
// nlohmann::detail (json_default_base), which made nlohmann::detail an
|
||||||
|
// associated namespace of every basic_json for ADL purposes. That leaked
|
||||||
|
// the library's internal generic-array to_json overload into unqualified
|
||||||
|
// to_json() calls made from user code, silently bypassing user-defined
|
||||||
|
// to_json overloads reached via a derived-to-base conversion.
|
||||||
|
const issue_4320::payload p{1.0, 2.0, 3.0};
|
||||||
|
|
||||||
|
json j;
|
||||||
|
to_json(j, p);
|
||||||
|
CHECK(j == json({{"x", 1.0}, {"y", 2.0}, {"z", 3.0}}));
|
||||||
|
}
|
||||||
|
|
||||||
|
TEST_CASE("issue #5338 - truncated CBOR tagged binary subtype is rejected")
|
||||||
|
{
|
||||||
|
const std::vector<std::vector<std::uint8_t>> truncated_tags =
|
||||||
|
{
|
||||||
|
{0xD8},
|
||||||
|
{0xD9, 0x00},
|
||||||
|
{0xDA, 0x00, 0x00, 0x00},
|
||||||
|
{0xDB, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00}
|
||||||
|
};
|
||||||
|
|
||||||
|
for (const auto& data : truncated_tags)
|
||||||
|
{
|
||||||
|
CAPTURE(data);
|
||||||
|
for (const auto tag_handler :
|
||||||
|
{
|
||||||
|
json::cbor_tag_handler_t::ignore, json::cbor_tag_handler_t::store
|
||||||
|
})
|
||||||
|
{
|
||||||
|
CAPTURE(tag_handler);
|
||||||
|
const auto result = json::from_cbor(data, true, false, tag_handler);
|
||||||
|
CHECK(result.is_discarded());
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
TEST_CASE("issue #5402 - update(merge_objects=true) overwrites a primitive with an object")
|
||||||
|
{
|
||||||
|
json t = {{"k", 1}};
|
||||||
|
t.update(json{{"k", {{"x", 2}}}}, true);
|
||||||
|
CHECK(t == json({{"k", {{"x", 2}}}}));
|
||||||
|
|
||||||
|
json mixed = {{"keep", {{"a", 1}}}, {"replace", 1}};
|
||||||
|
mixed.update(json{{"keep", {{"b", 2}}}, {"replace", {{"x", 2}}}}, true);
|
||||||
|
CHECK(mixed == json({{"keep", {{"a", 1}, {"b", 2}}}, {"replace", {{"x", 2}}}}));
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
DOCTEST_CLANG_SUPPRESS_WARNING_POP
|
||||||
@@ -2149,6 +2149,67 @@ TEST_CASE("UBJSON")
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
TEST_CASE("UBJSON optimized arrays of a valueless type are bounded")
|
||||||
|
{
|
||||||
|
// An element of type 'Z', 'T' or 'F' is encoded by its marker alone, so an
|
||||||
|
// optimized array of one of those has no payload and the declared count is
|
||||||
|
// the only thing deciding how much is allocated. Ten bytes used to produce
|
||||||
|
// billions of values (#2793); every other type costs at least one byte per
|
||||||
|
// element and is bounded by the end of the input.
|
||||||
|
json _;
|
||||||
|
|
||||||
|
SECTION("an excessive count is rejected")
|
||||||
|
{
|
||||||
|
// 'l' is a big-endian int32: 0x7FFFFFFF elements, about 34 GB of value
|
||||||
|
for (const auto marker :
|
||||||
|
{'Z', 'T', 'F'
|
||||||
|
})
|
||||||
|
{
|
||||||
|
const std::vector<uint8_t> input = {'[', '$', static_cast<uint8_t>(marker), '#', 'l', 0x7F, 0xFF, 0xFF, 0xFF};
|
||||||
|
CHECK_THROWS_WITH_AS(_ = json::from_ubjson(input), "[json.exception.out_of_range.408] syntax error while parsing UBJSON size: excessive array size", json::out_of_range&);
|
||||||
|
CHECK(json::from_ubjson(input, true, false).is_discarded());
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("ordinary counts are unaffected")
|
||||||
|
{
|
||||||
|
CHECK(json::from_ubjson(std::vector<uint8_t>({'[', '$', 'Z', '#', 'i', 3})) == json({nullptr, nullptr, nullptr}));
|
||||||
|
CHECK(json::from_ubjson(std::vector<uint8_t>({'[', '$', 'T', '#', 'i', 2})) == json({true, true}));
|
||||||
|
CHECK(json::from_ubjson(std::vector<uint8_t>({'[', '$', 'F', '#', 'i', 2})) == json({false, false}));
|
||||||
|
// 'N' is a no-op rather than a value, and still yields an empty array
|
||||||
|
CHECK(json::from_ubjson(std::vector<uint8_t>({'[', '$', 'N', '#', 'i', 2})) == json::array());
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("a type with a payload is unaffected")
|
||||||
|
{
|
||||||
|
// A count past the limit is not rejected for 'U', which costs a byte
|
||||||
|
// per element and is bounded by the end of the input instead. The
|
||||||
|
// count is kept just past the limit rather than made huge, because a
|
||||||
|
// count that also exceeds the array's max_size() is reported as
|
||||||
|
// out_of_range before the input runs out, and max_size() depends on
|
||||||
|
// the width of std::size_t.
|
||||||
|
const std::vector<uint8_t> input = {'[', '$', 'U', '#', 'l', 0x00, 0x10, 0x00, 0x01};
|
||||||
|
CHECK_THROWS_WITH_AS(_ = json::from_ubjson(input), "[json.exception.parse_error.110] parse error at byte 10: syntax error while parsing UBJSON number: unexpected end of input", json::parse_error&);
|
||||||
|
CHECK(json::from_ubjson(input, true, false).is_discarded());
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("the writer stays within what the reader accepts")
|
||||||
|
{
|
||||||
|
// below the limit the optimized form is used and is tiny; above it the
|
||||||
|
// writer falls back so that the result can still be read back
|
||||||
|
json const at_limit(1048576, nullptr);
|
||||||
|
const auto v_at_limit = json::to_ubjson(at_limit, true, true);
|
||||||
|
CHECK(v_at_limit.size() == 9);
|
||||||
|
CHECK(v_at_limit.at(1) == '$');
|
||||||
|
CHECK(json::from_ubjson(v_at_limit) == at_limit);
|
||||||
|
|
||||||
|
json const above_limit(1048577, nullptr);
|
||||||
|
const auto v_above_limit = json::to_ubjson(above_limit, true, true);
|
||||||
|
CHECK(v_above_limit.at(1) != '$');
|
||||||
|
CHECK(json::from_ubjson(v_above_limit) == above_limit);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
TEST_CASE("Universal Binary JSON Specification Examples 1")
|
TEST_CASE("Universal Binary JSON Specification Examples 1")
|
||||||
{
|
{
|
||||||
SECTION("Null Value")
|
SECTION("Null Value")
|
||||||
|
|||||||
Reference in New Issue
Block a user